| blob | f518c20797f53923fa4a0b68e0d29a63f5277203 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #define GCC_C_COMMON_C
54 /* Mode used to build pointers (VOIDmode means ptr_mode). */
58 /* The following symbols are subsumed in the c_global_trees array, and
59 listed here individually for documentation purposes.
61 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
63 tree short_integer_type_node;
64 tree long_integer_type_node;
65 tree long_long_integer_type_node;
67 tree short_unsigned_type_node;
68 tree long_unsigned_type_node;
69 tree long_long_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
79 tree wchar_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
84 tree float_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
97 tree intQI_type_node;
98 tree intHI_type_node;
99 tree intSI_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
146 tree void_list_node;
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
160 */
163 \f
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
179 /* Nonzero means pass #include lines through to the output. */
183 /* Nonzero means process PCH files while preprocessing. */
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 user's namespace. */
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
230 /* Tells the compiler what is the constant string class for ObjC. */
235 /* C++ language option variables. */
237 /* The reference version of the ABI for -Wabi. */
241 /* Nonzero means generate separate instantiation control files and
242 juggle them at link time. */
246 /* The C++ dialect being used. Default set in c_common_post_options. */
250 /* Maximum template instantiation depth. This limit exists to limit the
251 time it takes to notice excessively recursive template instantiations.
253 The default is lower than the 1024 recommended by the C++0x standard
254 because G++ runs out of stack before 1024 with highly recursive template
255 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
259 /* The elements of `ridpointers' are identifier nodes for the reserved
260 type names and storage classes. It is indexed by a RID_... value. */
265 /* Nonzero means don't warn about problems that occur when the code is
266 executed. */
269 /* Whether we are building a boolean conversion inside
270 convert_for_assignment, or some other late binary operation. If
271 build_binary_op is called for C (from code shared by C and C++) in
272 this case, then the operands have already been folded and the
273 result will not be folded again, so C_MAYBE_CONST_EXPR should not
274 be generated. */
277 /* Whether lexing has been completed, so subsequent preprocessor
278 errors should use the compiler's input_location. */
281 /* Information about how a function name is generated. */
282 struct fname_var_t
283 {
287 };
289 /* The three ways of getting then name of the current function. */
292 {
293 /* C99 compliant __func__, must be first. */
295 /* GCC __FUNCTION__ compliant. */
297 /* GCC __PRETTY_FUNCTION__ compliant. */
300 };
302 /* Global visibility options. */
407 /* Reserved words. The third field is a mask: keywords are disabled
408 if they match the mask.
410 Masks for languages:
411 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
412 C --std=c99: D_CXXONLY | D_OBJC
413 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
414 C++ --std=c++98: D_CONLY | D_CXX11 | D_OBJC
415 C++ --std=c++11: D_CONLY | D_OBJC
416 ObjC++ is like C++ except that D_OBJC is not set
418 If -fno-asm is used, D_ASM is added to the mask. If
419 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
420 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
421 In C with -Wc++-compat, we warn if D_CXXWARN is set.
423 Note the complication of the D_CXX_OBJC keywords. These are
424 reserved words such as 'class'. In C++, 'class' is a reserved
425 word. In Objective-C++ it is too. In Objective-C, it is a
426 reserved word too, but only if it follows an '@' sign.
427 */
429 {
490 D_CXXONLY },
605 /* C++ transactional memory. */
611 /* Concepts-related keywords */
615 /* These Objective-C keywords are recognized only immediately after
616 an '@'. */
632 /* These are recognized only in protocol-qualifier context
633 (see above) */
640 /* These are recognized inside a property attribute list */
649 };
654 /* Table of machine-independent attributes common to all C-like languages.
656 All attributes referencing arguments should be additionally processed
657 in chkp_copy_function_type_adding_bounds for correct instrumentation
658 by Pointer Bounds Checker.
659 Current list of processed common attributes: nonnull. */
661 {
662 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
663 affects_type_identity } */
670 /* FIXME: logically, noreturn attributes should be listed as
671 "false, true, true" and apply to function types. But implementing this
672 would require all the places in the compiler that use TREE_THIS_VOLATILE
673 on a decl to identify non-returning functions to be located and fixed
674 to check the function type instead. */
705 /* The same comments as for noreturn attributes apply to const ones. */
733 handle_no_instrument_function_attribute,
736 handle_no_profile_instrument_function_attribute,
756 /* ??? These two attributes didn't make the transition from the
757 Intel language document to the multi-vendor language document. */
762 /* For internal use (marking of builtins) only. The name contains space
763 to prevent its usage in source code. */
785 /* For internal use (marking of builtins) only. The name contains space
786 to prevent its usage in source code. */
797 handle_no_address_safety_analysis_attribute,
800 handle_no_sanitize_address_attribute,
803 handle_no_sanitize_address_attribute,
806 handle_no_sanitize_undefined_attribute,
818 /* For internal use only. The leading '*' both prevents its usage in
819 source code and signals that it may be overridden by machine tables. */
824 /* For internal use (marking of builtins and runtime functions) only.
825 The name contains space to prevent its usage in source code. */
857 };
859 /* Give the specifications for the format attributes, used by C and all
860 descendants.
862 All attributes referencing arguments should be additionally processed
863 in chkp_copy_function_type_adding_bounds for correct instrumentation
864 by Pointer Bounds Checker.
865 Current list of processed format attributes: format, format_arg. */
867 {
868 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
869 affects_type_identity } */
875 };
877 /* Return identifier for address space AS. */
881 {
885 }
887 /* Push current bindings for the function name VAR_DECLS. */
889 void
891 {
896 {
900 {
902 saved);
904 }
905 }
907 /* Normally they'll have been NULL, so only push if we've got a
908 stack, or they are non-NULL. */
910 saved_function_name_decls);
911 }
913 /* Finish up the current bindings, adding them into the current function's
914 statement tree. This must be done _before_ finish_stmt_tree is called.
915 If there is no current function, we must be at file scope and no statements
916 are involved. Pop the previous bindings. */
918 void
920 {
929 {
937 }
943 {
944 /* We had saved values, restore them. */
945 tree saved;
948 {
953 }
955 }
957 }
959 /* Return the text name of the current function, suitably prettified
960 by PRETTY_P. Return string must be freed by caller. */
964 {
971 {
974 }
987 {
990 }
993 }
995 /* Return the VAR_DECL for a const char array naming the current
996 function. If the VAR_DECL has not yet been created, create it
997 now. RID indicates how it should be formatted and IDENTIFIER_NODE
998 ID is its name (unfortunately C and C++ hold the RID values of
999 keywords in different places, so we can't derive RID from ID in
1000 this language independent code. LOC is the location of the
1001 function. */
1003 tree
1005 {
1015 {
1016 /* If a tree is built here, it would normally have the lineno of
1017 the current statement. Later this tree will be moved to the
1018 beginning of the function and this line number will be wrong.
1019 To avoid this problem set the lineno to 0 here; that prevents
1020 it from appearing in the RTL. */
1021 tree stmts;
1029 saved_function_name_decls
1033 }
1038 }
1040 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1042 tree
1044 {
1049 /* Compute the number of elements, for the array type. */
1051 {
1054 }
1056 {
1059 }
1061 {
1064 }
1065 else
1066 {
1069 }
1071 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1072 limit in C++98 Annex B is very large (65536) and is not normative,
1073 so we do not diagnose it (warn_overlength_strings is forced off
1074 in c_common_post_options). */
1076 {
1080 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1081 separate the %d from the 'C'. 'ISO' should not be
1082 translated, but it may be moved after 'C%d' in languages
1083 where modifiers follow nouns. */
1085 "string length %qd is greater than the length %qd "
1088 }
1090 /* Create the array type for the string constant. The ISO C++
1091 standard says that a string literal has type `const char[N]' or
1092 `const wchar_t[N]'. We use the same logic when invoked as a C
1093 front-end with -Wwrite-strings.
1094 ??? We should change the type of an expression depending on the
1095 state of a warning flag. We should just be warning -- see how
1096 this is handled in the C++ front-end for the deprecated implicit
1097 conversion from string literals to `char*' or `wchar_t*'.
1099 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1100 array type being the unqualified version of that type.
1101 Therefore, if we are constructing an array of const char, we must
1102 construct the matching unqualified array type first. The C front
1103 end does not require this, but it does no harm, so we do it
1104 unconditionally. */
1115 }
1117 /* Given a string of type STRING_TYPE, determine what kind of string
1118 token would give an equivalent execution encoding: CPP_STRING,
1119 CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error.
1120 This may not be exactly the string token type that initially created
1121 the string, since CPP_WSTRING is indistinguishable from the 16/32 bit
1122 string type at this point.
1124 This effectively reverses part of the logic in lex_string and
1125 fix_string_type. */
1127 static enum cpp_ttype
1129 {
1143 {
1150 }
1153 }
1155 /* The global record of string concatentations, for use in
1156 extracting locations within string literals. */
1160 /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
1165 {
1166 enum cpp_ttype tok_type
1173 tok_type,
1177 out_loc);
1178 }
1180 \f
1181 /* Fold X for consideration by one of the warning functions when checking
1182 whether an expression has a constant value. */
1184 static tree
1186 {
1189 else
1190 /* The C front-end has already folded X appropriately. */
1192 }
1194 /* Print a warning if a constant expression had overflow in folding.
1195 Invoke this function on every expression that the language
1196 requires to be a constant expression.
1197 Note the ANSI C standard says it is erroneous for a
1198 constant expression to overflow. */
1200 void
1202 {
1210 }
1212 /* The same as above but print an unconditional error. */
1213 void
1215 {
1222 }
1224 /* Print a warning if an expression had overflow in folding and its
1225 operands hadn't.
1227 Invoke this function on every expression that
1228 (1) appears in the source code, and
1229 (2) is a constant expression that overflowed, and
1230 (3) is not already checked by convert_and_check;
1231 however, do not invoke this function on operands of explicit casts
1232 or when the expression is the result of an operator and any operand
1233 already overflowed. */
1235 void
1237 {
1242 {
1271 }
1272 }
1274 /* Warn about uses of logical || / && operator in a context where it
1275 is likely that the bitwise equivalent was intended by the
1276 programmer. We have seen an expression in which CODE is a binary
1277 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1278 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1279 void
1283 {
1295 /* We don't want to warn if either operand comes from a macro
1296 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1297 see PR61534. */
1302 /* Warn if &&/|| are being used in a context where it is
1303 likely that the bitwise equivalent was intended by the
1304 programmer. That is, an expression such as op && MASK
1305 where op should not be any boolean expression, nor a
1306 constant, and mask seems to be a non-boolean integer constant. */
1308 /* An enumerator counts as a constant. */
1317 {
1321 else
1326 }
1328 /* We do not warn for constants because they are typical of macro
1329 expansions that test for features. */
1334 /* This warning only makes sense with logical operands. */
1341 /* The range computations only work with scalars. */
1346 /* We first test whether either side separately is trivially true
1347 (with OR) or trivially false (with AND). If so, do not warn.
1348 This is a common idiom for testing ranges of data types in
1349 portable code. */
1356 /* If this is an OR operation, invert both sides; now, the result
1357 should be always false to get a warning. */
1371 /* If this is an OR operation, invert both sides; now, the result
1372 should be always false to get a warning. */
1380 /* If both expressions have the same operand, if we can merge the
1381 ranges, ... */
1385 {
1387 /* ... and if the range test is always false, then warn. */
1389 {
1392 "logical %<or%> of collectively exhaustive tests is "
1394 else
1396 "logical %<and%> of mutually exclusive tests is "
1398 }
1399 /* Or warn if the operands have exactly the same range, e.g.
1400 A > 0 && A > 0. */
1403 {
1407 else
1410 }
1411 }
1412 }
1414 /* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1415 with constant indices. */
1417 static tree
1419 {
1425 {
1428 }
1431 }
1433 /* Warn if a self-comparison always evaluates to true or false. LOC
1434 is the location of the comparison with code CODE, LHS and RHS are
1435 operands of the comparison. */
1437 void
1439 {
1443 /* Don't warn for various macro expansions. */
1449 /* We do not warn for constants because they are typical of macro
1450 expansions that test for features, sizeof, and similar. */
1455 /* Don't warn for e.g.
1456 HOST_WIDE_INT n;
1457 ...
1458 if (n == (long) n) ...
1459 */
1464 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1465 It could be a NaN, and NaN never compares equal to anything, even
1466 itself. */
1471 {
1472 /* Don't warn about array references with constant indices;
1473 these are likely to come from a macro. */
1485 else
1488 }
1489 }
1491 /* Return true iff T is a boolean promoted to int. */
1493 static bool
1495 {
1499 }
1501 /* Return true iff EXPR only contains boolean operands, or comparisons. */
1503 static bool
1505 {
1517 else
1519 }
1521 /* Warn about logical not used on the left hand side operand of a comparison.
1522 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1523 Do not warn if RHS is of a boolean type, a logical operator, or
1524 a comparison. */
1526 void
1529 {
1536 /* Don't warn for expression like !x == ~(bool1 | bool2). */
1540 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1541 !(x == 0) or !(y != 0). */
1547 "logical not is only applied to the left hand side of "
1550 {
1557 }
1558 }
1560 /* Warn if EXP contains any computations whose results are not used.
1561 Return true if a warning is printed; false otherwise. LOCUS is the
1562 (potential) location of the expression. */
1564 bool
1566 {
1567 restart:
1571 /* Don't warn about void constructs. This includes casting to void,
1572 void function calls, and statement expressions with a final cast
1573 to void. */
1581 {
1597 /* For a binding, warn if no side effect within it. */
1609 /* In && or ||, warn if 2nd operand has no side effect. */
1616 /* Let people do `(foo (), 0)' without a warning. */
1623 /* If this is an expression with side effects, don't warn; this
1624 case commonly appears in macro expansions. */
1630 /* Don't warn about automatic dereferencing of references, since
1631 the user cannot control it. */
1633 {
1636 }
1637 /* Fall through. */
1640 /* Referencing a volatile value is a side effect, so don't warn. */
1645 /* If this is an expression which has no operands, there is no value
1646 to be unused. There are no such language-independent codes,
1647 but front ends may define such. */
1651 warn:
1653 }
1654 }
1657 /* Print a warning about casts that might indicate violation
1658 of strict aliasing rules if -Wstrict-aliasing is used and
1659 strict aliasing mode is in effect. OTYPE is the original
1660 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1662 bool
1664 {
1665 /* Strip pointer conversion chains and get to the correct original type. */
1673 /* If the type we are casting to is a ref-all pointer
1674 dereferencing it is always valid. */
1681 {
1682 /* Casting the address of an object to non void pointer. Warn
1683 if the cast breaks type based aliasing. */
1685 {
1689 }
1690 else
1691 {
1692 /* warn_strict_aliasing >= 3. This includes the default (3).
1693 Only warn if the cast is dereferenced immediately. */
1694 alias_set_type set1 =
1702 {
1706 }
1709 {
1713 }
1714 }
1715 }
1716 else
1718 {
1719 /* At this level, warn for any conversions, even if an address is
1720 not taken in the same statement. This will likely produce many
1721 false positives, but could be useful to pinpoint problems that
1722 are not revealed at higher levels. */
1727 {
1731 }
1732 }
1735 }
1737 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1738 sizeof as last operand of certain builtins. */
1740 void
1744 {
1748 location_t loc;
1756 {
1760 /* FALLTHRU */
1768 /* FALLTHRU */
1827 }
1855 {
1859 {
1862 "argument to %<sizeof%> in %qD call is the same "
1863 "expression as the destination; did you mean to "
1869 "argument to %<sizeof%> in %qD call is the same "
1870 "expression as the destination; did you mean to "
1872 else
1874 "argument to %<sizeof%> in %qD call is the same "
1875 "expression as the destination; did you mean to "
1878 }
1881 && !strop
1884 {
1886 "argument to %<sizeof%> in %qD call is the same "
1887 "pointer type %qT as the destination; expected %qT "
1891 }
1892 }
1895 {
1899 {
1902 "argument to %<sizeof%> in %qD call is the same "
1903 "expression as the source; did you mean to "
1909 "argument to %<sizeof%> in %qD call is the same "
1910 "expression as the source; did you mean to "
1912 else
1914 "argument to %<sizeof%> in %qD call is the same "
1915 "expression as the source; did you mean to "
1918 }
1921 && !strop
1924 {
1926 "argument to %<sizeof%> in %qD call is the same "
1927 "pointer type %qT as the source; expected %qT "
1931 }
1932 }
1935 {
1939 {
1942 "argument to %<sizeof%> in %qD call is the same "
1943 "expression as the first source; did you mean to "
1949 "argument to %<sizeof%> in %qD call is the same "
1950 "expression as the first source; did you mean to "
1952 else
1954 "argument to %<sizeof%> in %qD call is the same "
1955 "expression as the first source; did you mean to "
1958 }
1961 && !strop
1964 {
1966 "argument to %<sizeof%> in %qD call is the same "
1967 "pointer type %qT as the first source; expected %qT "
1971 }
1972 }
1975 {
1979 {
1982 "argument to %<sizeof%> in %qD call is the same "
1983 "expression as the second source; did you mean to "
1989 "argument to %<sizeof%> in %qD call is the same "
1990 "expression as the second source; did you mean to "
1992 else
1994 "argument to %<sizeof%> in %qD call is the same "
1995 "expression as the second source; did you mean to "
1998 }
2001 && !strop
2004 {
2006 "argument to %<sizeof%> in %qD call is the same "
2007 "pointer type %qT as the second source; expected %qT "
2011 }
2012 }
2014 }
2016 /* Warn for unlikely, improbable, or stupid DECL declarations
2017 of `main'. */
2019 void
2021 {
2022 function_args_iterator iter;
2023 tree type;
2027 {
2028 /* XXX void_type_node belies the abstraction. */
2038 {
2044 }
2048 {
2070 "third argument of %q+D should probably be "
2073 }
2074 }
2076 /* It is intentional that this message does not mention the third
2077 argument because it's only mentioned in an appendix of the
2078 standard. */
2086 }
2088 /* vector_targets_convertible_p is used for vector pointer types. The
2089 callers perform various checks that the qualifiers are satisfactory,
2090 while OTOH vector_targets_convertible_p ignores the number of elements
2091 in the vectors. That's fine with vector pointers as we can consider,
2092 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2093 and that does not require and conversion of the pointer values.
2094 In contrast, vector_types_convertible_p and
2095 vector_types_compatible_elements_p are used for vector value types. */
2096 /* True if pointers to distinct types T1 and T2 can be converted to
2097 each other without an explicit cast. Only returns true for opaque
2098 vector types. */
2099 bool
2101 {
2108 }
2110 /* vector_types_convertible_p is used for vector value types.
2111 It could in principle call vector_targets_convertible_p as a subroutine,
2112 but then the check for vector type would be duplicated with its callers,
2113 and also the purpose of vector_targets_convertible_p would become
2114 muddled.
2115 Where vector_types_convertible_p returns true, a conversion might still be
2116 needed to make the types match.
2117 In contrast, vector_targets_convertible_p is used for vector pointer
2118 values, and vector_types_compatible_elements_p is used specifically
2119 in the context for binary operators, as a check if use is possible without
2120 conversion. */
2121 /* True if vector types T1 and T2 can be converted to each other
2122 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2123 can only be converted with -flax-vector-conversions yet that is not
2124 in effect, emit a note telling the user about that option if such
2125 a note has not previously been emitted. */
2126 bool
2128 {
2136 convertible_lax =
2151 {
2154 "conversions between vectors with differing "
2156 }
2159 }
2161 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2162 and have vector types, V0 has the same type as V1, and the number of
2163 elements of V0, V1, MASK is the same.
2165 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2166 called with two arguments. In this case implementation passes the
2167 first argument twice in order to share the same tree code. This fact
2168 could enable the mask-values being twice the vector length. This is
2169 an implementation accident and this semantics is not guaranteed to
2170 the user. */
2171 tree
2174 {
2175 tree ret;
2181 {
2184 }
2191 {
2196 }
2200 {
2204 }
2207 {
2212 }
2218 {
2221 "argument vector(s) and the mask vector should "
2224 }
2228 {
2233 }
2236 {
2237 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2243 else
2244 {
2247 }
2251 }
2261 }
2263 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2264 to integral type. */
2266 static tree
2268 {
2273 {
2274 /* C++0x scoped enumerations don't implicitly convert to integral
2275 type; if we stripped an explicit conversion to a larger type we
2276 need to replace it so common_type will still work. */
2280 }
2282 }
2284 /* This is a helper function of build_binary_op.
2286 For certain operations if both args were extended from the same
2287 smaller type, do the arithmetic in that type and then extend.
2289 BITWISE indicates a bitwise operation.
2290 For them, this optimization is safe only if
2291 both args are zero-extended or both are sign-extended.
2292 Otherwise, we might change the result.
2293 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2294 but calculated in (unsigned short) it would be (unsigned short)-1.
2295 */
2296 tree
2298 {
2302 tree type;
2304 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2305 excessive narrowing when we call get_narrower below. For
2306 example, suppose that OP0 is of unsigned int extended
2307 from signed char and that RESULT_TYPE is long long int.
2308 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2309 like
2311 (long long int) (unsigned int) signed_char
2313 which get_narrower would narrow down to
2315 (unsigned int) signed char
2317 If we do not cast OP0 first, get_narrower would return
2318 signed_char, which is inconsistent with the case of the
2319 explicit cast. */
2326 /* UNS is 1 if the operation to be done is an unsigned one. */
2329 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2330 but it *requires* conversion to FINAL_TYPE. */
2341 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2343 /* For bitwise operations, signedness of nominal type
2344 does not matter. Consider only how operands were extended. */
2348 /* Note that in all three cases below we refrain from optimizing
2349 an unsigned operation on sign-extended args.
2350 That would not be valid. */
2352 /* Both args variable: if both extended in same way
2353 from same width, do it in that width.
2354 Do it unsigned if args were zero-extended. */
2361 return c_common_signed_or_unsigned_type
2368 && (type
2379 && (type
2387 }
2389 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2390 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2392 static bool
2394 {
2397 REAL_VALUE_TYPE real_low_bound =
2399 REAL_VALUE_TYPE real_high_bound =
2404 }
2406 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2407 to the complex/real/integer type TYPE. Function returns non-zero when:
2408 * EXPR is a constant which cannot be exactly converted to TYPE.
2409 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2410 for EXPR type and TYPE being both integers or both real, or both
2411 complex.
2412 * EXPR is not a constant of complex type and TYPE is a real or
2413 an integer.
2414 * EXPR is not a constant of real type and TYPE is an integer.
2415 * EXPR is not a constant of integer type which cannot be
2416 exactly converted to real type.
2418 Function allows conversions between types of different signedness and
2419 can return SAFE_CONVERSION (zero) in that case. Function can produce
2420 signedness warnings if PRODUCE_WARNS is true.
2422 Function allows conversions from complex constants to non-complex types,
2423 provided that imaginary part is zero and real part can be safely converted
2424 to TYPE. */
2426 enum conversion_safety
2428 {
2434 {
2435 /* If type is complex, we are interested in compatibility with
2436 underlying type. */
2440 /* Warn for real constant that is not an exact integer converted
2441 to integer type. */
2444 {
2447 }
2448 /* Warn for an integer constant that does not fit into integer type. */
2452 {
2455 {
2459 }
2461 {
2465 }
2466 else
2468 }
2470 {
2471 /* Warn for an integer constant that does not fit into real type. */
2473 {
2477 }
2478 /* Warn for a real constant that does not fit into a smaller
2479 real type. */
2482 {
2486 }
2487 }
2488 }
2491 {
2493 /* Conversion from complex constant with zero imaginary part,
2494 perform check for conversion of real part. */
2499 /* Note: in this branch we use recursive call to unsafe_conversion_p
2500 with different type of EXPR, but it is still safe, because when EXPR
2501 is a constant, it's type is not used in text of generated warnings
2502 (otherwise they could sound misleading). */
2504 produce_warns);
2505 /* Conversion from complex constant with non-zero imaginary part. */
2506 else
2507 {
2508 /* Conversion to complex type.
2509 Perform checks for both real and imaginary parts. */
2511 {
2512 /* Unfortunately, produce_warns must be false in two subsequent
2513 calls of unsafe_conversion_p, because otherwise we could
2514 produce strange "double" warnings, if both real and imaginary
2515 parts have conversion problems related to signedness.
2517 For example:
2518 int32_t _Complex a = 0x80000000 + 0x80000000i;
2520 Possible solution: add a separate function for checking
2521 constants and combine result of two calls appropriately. */
2527 /* Merge the results into appropriate single warning. */
2529 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2536 else
2538 }
2539 /* Warn about conversion from complex to real or integer type. */
2540 else
2542 }
2543 }
2545 /* Checks for remaining case: EXPR is not constant. */
2546 else
2547 {
2548 /* Warn for real types converted to integer types. */
2555 {
2556 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2560 /* Don't warn for short y; short x = ((int)y & 0xff); */
2564 {
2565 /* If both args were extended from a shortest type,
2566 use that type if that is safe. */
2573 {
2579 /* If one of the operands is a non-negative constant
2580 that fits in the target type, then the type of the
2581 other operand does not matter. */
2590 /* If constant is unsigned and fits in the target
2591 type, then the result will also fit. */
2593 && unsigned0
2596 && unsigned1
2599 }
2600 }
2601 /* Warn for integer types converted to smaller integer types. */
2605 /* When they are the same width but different signedness,
2606 then the value may change. */
2609 /* Even when converted to a bigger type, if the type is
2610 unsigned but expr is signed, then negative values
2611 will be changed. */
2617 }
2619 /* Warn for integer types converted to real types if and only if
2620 all the range of values of the integer type cannot be
2621 represented by the real type. */
2624 {
2625 /* Don't warn about char y = 0xff; float x = (int) y; */
2631 }
2633 /* Warn for real types converted to smaller real types. */
2639 /* Check conversion between two complex types. */
2642 {
2643 /* Extract underlying types (i.e., type of real and imaginary
2644 parts) of expr_type and type. */
2648 /* Warn for real types converted to integer types. */
2653 /* Warn for real types converted to smaller real types. */
2659 /* Check conversion for complex integer types. Here implementation
2660 is simpler than for real-domain integers because it does not
2661 involve sophisticated cases, such as bitmasks, casts, etc. */
2664 {
2665 /* Warn for integer types converted to smaller integer types. */
2669 /* Check for different signedness, see case for real-domain
2670 integers (above) for a more detailed comment. */
2676 "conversion to %qT from %qT "
2679 }
2684 }
2686 /* Warn for complex types converted to real or integer types. */
2690 }
2693 }
2695 /* Warns if the conversion of EXPR to TYPE may alter a value.
2696 This is a helper function for warnings_for_convert_and_check. */
2698 static void
2700 {
2707 /* This may happen, because for LHS op= RHS we preevaluate
2708 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2709 means we could no longer see the code of the EXPR. */
2716 {
2729 /* Conversion from boolean to a signed:1 bit-field (which only
2730 can hold the values 0 and -1) doesn't lose information - but
2731 it does change the value. */
2752 {
2753 /* In case of COND_EXPR, we do not care about the type of
2754 COND_EXPR, only about the conversion of each operand. */
2761 }
2777 }
2778 }
2780 /* Produce warnings after a conversion. RESULT is the result of
2781 converting EXPR to TYPE. This is a helper function for
2782 convert_and_check and cp_convert_and_check. */
2784 void
2786 tree result)
2787 {
2794 {
2795 /* Do not diagnose overflow in a constant expression merely
2796 because a conversion overflowed. */
2801 {
2802 /* This detects cases like converting -129 or 256 to
2803 unsigned char. */
2807 else
2809 }
2813 /* No warning for converting 0x80000000 to int. */
2821 else
2823 }
2828 else
2830 }
2833 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2834 Invoke this function on every expression that is converted implicitly,
2835 i.e. because of language rules and not because of an explicit cast. */
2837 tree
2839 {
2840 tree result;
2841 tree expr_for_warning;
2843 /* Convert from a value with possible excess precision rather than
2844 via the semantic type, but do not warn about values not fitting
2845 exactly in the semantic type. */
2847 {
2853 }
2854 else
2868 }
2869 \f
2870 /* A node in a list that describes references to variables (EXPR), which are
2871 either read accesses if WRITER is zero, or write accesses, in which case
2872 WRITER is the parent of EXPR. */
2873 struct tlist
2874 {
2877 };
2879 /* Used to implement a cache the results of a call to verify_tree. We only
2880 use this for SAVE_EXPRs. */
2881 struct tlist_cache
2882 {
2886 tree expr;
2887 };
2889 /* Obstack to use when allocating tlist structures, and corresponding
2890 firstobj. */
2894 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2895 warnings. */
2897 /* SAVE_EXPRs need special treatment. We process them only once and then
2898 cache the results. */
2910 /* Create a new struct tlist and fill in its fields. */
2913 {
2920 }
2922 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2923 is nonnull, we ignore any node we find which has a writer equal to it. */
2925 static void
2927 {
2929 {
2936 }
2937 }
2939 /* Merge the nodes of ADD into TO. This merging process is done so that for
2940 each variable that already exists in TO, no new node is added; however if
2941 there is a write access recorded in ADD, and an occurrence on TO is only
2942 a read access, then the occurrence in TO will be modified to record the
2943 write. */
2945 static void
2947 {
2954 {
2961 {
2965 }
2967 {
2971 }
2973 }
2974 }
2976 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2977 references in list LIST conflict with it, excluding reads if ONLY writers
2978 is nonzero. */
2980 static void
2983 {
2986 /* Avoid duplicate warnings. */
2992 {
2996 {
3001 }
3003 }
3004 }
3006 /* Given a list LIST of references to variables, find whether any of these
3007 can cause conflicts due to missing sequence points. */
3009 static void
3011 {
3015 {
3018 }
3019 }
3021 /* Return nonzero if X is a tree that can be verified by the sequence point
3022 warnings. */
3023 static int
3025 {
3032 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3033 (lvalue_p) crash on TRY/CATCH. */
3040 /* No point to track non-const calls, they will never satisfy
3041 operand_equal_p. */
3049 }
3051 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3052 static bool
3054 {
3056 }
3058 /* Walk the tree X, and record accesses to variables. If X is written by the
3059 parent tree, WRITER is the parent.
3060 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3061 expression or its only operand forces a sequence point, then everything up
3062 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3063 in PNO_SP.
3064 Once we return, we will have emitted warnings if any subexpression before
3065 such a sequence point could be undefined. On a higher level, however, the
3066 sequence point may not be relevant, and we'll merge the two lists.
3068 Example: (b++, a) + b;
3069 The call that processes the COMPOUND_EXPR will store the increment of B
3070 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3071 processes the PLUS_EXPR will need to merge the two lists so that
3072 eventually, all accesses end up on the same list (and we'll warn about the
3073 unordered subexpressions b++ and b.
3075 A note on merging. If we modify the former example so that our expression
3076 becomes
3077 (b++, b) + a
3078 care must be taken not simply to add all three expressions into the final
3079 PNO_SP list. The function merge_tlist takes care of that by merging the
3080 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3081 way, so that no more than one access to B is recorded. */
3083 static void
3085 tree writer)
3086 {
3091 /* X may be NULL if it is the operand of an empty statement expression
3092 ({ }). */
3096 restart:
3104 {
3139 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3140 two first, to avoid warning for (a ? b++ : b++). */
3156 /* Expressions inside the LHS are not ordered wrt. the sequence points
3157 in the RHS. Example:
3158 *a = (a++, 2)
3159 Despite the fact that the modification of "a" is in the before_sp
3160 list (tmp_before), it conflicts with the use of "a" in the LHS.
3161 We can handle this by adding the contents of tmp_list3
3162 to those of tmp_before, and redoing the collision warnings for that
3163 list. */
3166 /* Exclude the LHS itself here; we first have to merge it into the
3167 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3168 didn't exclude the LHS, we'd get it twice, once as a read and once
3169 as a write. */
3180 /* We need to warn about conflicts among arguments and conflicts between
3181 args and the function address. Side effects of the function address,
3182 however, are not ordered by the sequence point of the call. */
3183 {
3184 call_expr_arg_iterator iter;
3185 tree arg;
3189 {
3194 }
3199 }
3202 /* Scan all the list, e.g. indices of multi dimensional array. */
3204 {
3210 }
3214 {
3221 {
3235 }
3239 }
3249 /* For other expressions, simply recurse on their operands.
3250 Manual tail recursion for unary expressions.
3251 Other non-expressions need not be processed. */
3253 {
3257 }
3259 {
3263 {
3268 }
3269 }
3271 }
3272 }
3274 /* Try to warn for undefined behavior in EXPR due to missing sequence
3275 points. */
3277 DEBUG_FUNCTION void
3279 {
3285 {
3288 }
3293 }
3294 \f
3295 /* Validate the expression after `case' and apply default promotions. */
3297 static tree
3299 {
3304 /* Promote char or short to int. */
3307 {
3310 }
3315 }
3316 \f
3317 /* See if the case values LOW and HIGH are in the range of the original
3318 type (i.e. before the default conversion to int) of the switch testing
3319 expression.
3320 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3321 the type before promoting it. CASE_LOW_P is a pointer to the lower
3322 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3323 if the case is not a case range.
3324 The caller has to make sure that we are not called with NULL for
3325 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3326 was a case value that doesn't fit into the range of the ORIG_TYPE.
3327 Returns true if the case label is in range of ORIG_TYPE (saturated or
3328 untouched) or false if the label is out of range. */
3330 static bool
3334 {
3339 /* If there was a problem with the original type, do nothing. */
3346 /* We'll really need integer constants here. */
3350 /* Case label is less than minimum for type. */
3353 {
3358 }
3360 /* Case value is greater than maximum for type. */
3363 {
3367 }
3369 /* Saturate lower case label value to minimum. */
3372 {
3377 }
3379 /* Saturate upper case label value to maximum. */
3382 {
3387 }
3395 }
3396 \f
3397 /* Return an integer type with BITS bits of precision,
3398 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3400 tree
3402 {
3444 }
3446 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3447 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3448 and saturating if SATP is nonzero, otherwise not saturating. */
3450 tree
3453 {
3454 machine_mode mode;
3457 else
3465 {
3467 "fixed-point types that have too many integral and "
3470 }
3473 }
3475 /* Used for communication between c_common_type_for_mode and
3476 c_register_builtin_type. */
3477 tree registered_builtin_types;
3479 /* Return a data type that has machine mode MODE.
3480 If the mode is an integer,
3481 then UNSIGNEDP selects between signed and unsigned types.
3482 If the mode is a fixed-point mode,
3483 then UNSIGNEDP selects between saturating and nonsaturating types. */
3485 tree
3487 {
3488 tree t;
3528 #if HOST_BITS_PER_WIDE_INT >= 64
3531 #endif
3561 {
3562 machine_mode inner_mode;
3563 tree inner_type;
3584 }
3586 {
3591 }
3601 {
3687 }
3695 }
3697 tree
3699 {
3701 }
3703 /* Return a signed type the same as TYPE in other respects. */
3705 tree
3707 {
3709 }
3711 /* Return a type the same as TYPE except unsigned or
3712 signed according to UNSIGNEDP. */
3714 tree
3716 {
3717 tree type1;
3720 /* This block of code emulates the behavior of the old
3721 c_common_unsigned_type. In particular, it returns
3722 long_unsigned_type_node if passed a long, even when a int would
3723 have the same size. This is necessary for warnings to work
3724 correctly in archs where sizeof(int) == sizeof(long) */
3727 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3747 #if HOST_BITS_PER_WIDE_INT >= 64
3750 #endif
3760 #define C_COMMON_FIXED_TYPES(NAME) \
3761 if (type1 == short_ ## NAME ## _type_node \
3762 || type1 == unsigned_short_ ## NAME ## _type_node) \
3763 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3764 : short_ ## NAME ## _type_node; \
3765 if (type1 == NAME ## _type_node \
3766 || type1 == unsigned_ ## NAME ## _type_node) \
3767 return unsignedp ? unsigned_ ## NAME ## _type_node \
3768 : NAME ## _type_node; \
3769 if (type1 == long_ ## NAME ## _type_node \
3770 || type1 == unsigned_long_ ## NAME ## _type_node) \
3771 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3772 : long_ ## NAME ## _type_node; \
3773 if (type1 == long_long_ ## NAME ## _type_node \
3774 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3775 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3776 : long_long_ ## NAME ## _type_node;
3778 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3779 if (type1 == NAME ## _type_node \
3780 || type1 == u ## NAME ## _type_node) \
3781 return unsignedp ? u ## NAME ## _type_node \
3782 : NAME ## _type_node;
3784 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3785 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3786 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3787 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3788 : sat_ ## short_ ## NAME ## _type_node; \
3789 if (type1 == sat_ ## NAME ## _type_node \
3790 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3791 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3792 : sat_ ## NAME ## _type_node; \
3793 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3794 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3795 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3796 : sat_ ## long_ ## NAME ## _type_node; \
3797 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3798 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3799 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3800 : sat_ ## long_long_ ## NAME ## _type_node;
3802 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3803 if (type1 == sat_ ## NAME ## _type_node \
3804 || type1 == sat_ ## u ## NAME ## _type_node) \
3805 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3806 : sat_ ## NAME ## _type_node;
3832 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3833 the precision; they have precision set to match their range, but
3834 may use a wider mode to match an ABI. If we change modes, we may
3835 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3836 the precision as well, so as to yield correct results for
3837 bit-field types. C++ does not have these separate bit-field
3838 types, and producing a signed or unsigned variant of an
3839 ENUMERAL_TYPE may cause other problems as well. */
3845 #define TYPE_OK(node) \
3846 (TYPE_MODE (type) == TYPE_MODE (node) \
3847 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3871 #if HOST_BITS_PER_WIDE_INT >= 64
3874 #endif
3883 #undef TYPE_OK
3886 }
3888 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3890 tree
3892 {
3895 /* Extended integer types of the same width as a standard type have
3896 lesser rank, so those of the same width as int promote to int or
3897 unsigned int and are valid for printf formats expecting int or
3898 unsigned int. To avoid such special cases, avoid creating
3899 extended integer types for bit-fields if a standard integer type
3900 is available. */
3918 }
3920 /* The C version of the register_builtin_type langhook. */
3922 void
3924 {
3925 tree decl;
3935 }
3936 \f
3937 /* Print an error message for invalid operands to arith operation
3938 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3939 RICHLOC is a rich location for the message, containing either
3940 three separate locations for each of the operator and operands
3942 lhs op rhs
3943 ~~~ ^~ ~~~
3945 (C FE), or one location ranging over all over them
3947 lhs op rhs
3948 ~~~~^~~~~~
3950 (C++ FE). */
3952 void
3955 {
3959 {
4004 }
4008 }
4009 \f
4010 /* Given an expression as a tree, return its original type. Do this
4011 by stripping any conversion that preserves the sign and precision. */
4012 static tree
4014 {
4017 }
4019 /* Subroutine of build_binary_op, used for comparison operations.
4020 See if the operands have both been converted from subword integer types
4021 and, if so, perhaps change them both back to their original type.
4022 This function is also responsible for converting the two operands
4023 to the proper common type for comparison.
4025 The arguments of this function are all pointers to local variables
4026 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4027 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4029 LOC is the location of the comparison.
4031 If this function returns nonzero, it means that the comparison has
4032 a constant value. What this function returns is an expression for
4033 that value. */
4035 tree
4038 {
4039 tree type;
4047 /* Throw away any conversions to wider types
4048 already present in the operands. */
4053 /* If primopN is first sign-extended from primopN's precision to opN's
4054 precision, then zero-extended from opN's precision to
4055 *restype_ptr precision, shortenings might be invalid. */
4058 && !unsignedp0
4063 && !unsignedp1
4067 /* Handle the case that OP0 does not *contain* a conversion
4068 but it *requires* conversion to FINAL_TYPE. */
4075 /* If one of the operands must be floated, we cannot optimize. */
4079 /* If first arg is constant, swap the args (changing operation
4080 so value is preserved), for canonicalization. Don't do this if
4081 the second arg is 0. */
4086 {
4095 {
4110 }
4112 }
4114 /* If comparing an integer against a constant more bits wide,
4115 maybe we can deduce a value of 1 or 0 independent of the data.
4116 Or else truncate the constant now
4117 rather than extend the variable at run time.
4119 This is only interesting if the constant is the wider arg.
4120 Also, it is not safe if the constant is unsigned and the
4121 variable arg is signed, since in this case the variable
4122 would be sign-extended and then regarded as unsigned.
4123 Our technique fails in this case because the lowest/highest
4124 possible unsigned results don't follow naturally from the
4125 lowest/highest possible values of the variable operand.
4126 For just EQ_EXPR and NE_EXPR there is another technique that
4127 could be used: see if the constant can be faithfully represented
4128 in the other operand's type, by truncating it and reextending it
4129 and see if that preserves the constant's value. */
4135 {
4138 /* 1 if comparison is nominally unsigned. */
4140 tree val;
4152 {
4153 /* Convert primop1 to target type, but do not introduce
4154 additional overflow. We know primop1 is an int_cst. */
4160 }
4162 {
4165 }
4173 /* This used to be a switch, but Genix compiler can't handle that. */
4175 {
4178 }
4180 {
4183 }
4185 {
4190 }
4192 {
4197 }
4199 {
4204 }
4206 {
4211 }
4213 /* If primop0 was sign-extended and unsigned comparison specd,
4214 we did a signed comparison above using the signed type bounds.
4215 But the comparison we output must be unsigned.
4217 Also, for inequalities, VAL is no good; but if the signed
4218 comparison had *any* fixed result, it follows that the
4219 unsigned comparison just tests the sign in reverse
4220 (positive values are LE, negative ones GE).
4221 So we can generate an unsigned comparison
4222 against an extreme value of the signed type. */
4225 {
4228 {
4243 }
4245 }
4248 /* Don't warn if it's from a (non-system) macro. */
4249 && !(from_macro_expansion_at
4250 (expansion_point_location_if_in_system_header
4252 {
4259 }
4262 {
4263 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4267 }
4269 /* Value is not predetermined, but do the comparison
4270 in the type of the operand that is not constant.
4271 TYPE is already properly set. */
4272 }
4274 /* If either arg is decimal float and the other is float, find the
4275 proper common type to use for comparison. */
4281 /* If either arg is decimal float and the other is float, fail. */
4292 /* If args' natural types are both narrower than nominal type
4293 and both extend in the same manner, compare them
4294 in the type of the wider arg.
4295 Otherwise must actually extend both to the nominal
4296 common type lest different ways of extending
4297 alter the result.
4298 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4303 {
4307 type);
4308 /* Make sure shorter operand is extended the right way
4309 to match the longer operand. */
4310 primop0
4313 primop0);
4314 primop1
4317 primop1);
4318 }
4319 else
4320 {
4321 /* Here we must do the comparison on the nominal type
4322 using the args exactly as we received them. */
4329 {
4331 /* All unsigned values are >= 0, so we warn. However,
4332 if OP0 is a constant that is >= 0, the signedness of
4333 the comparison isn't an issue, so suppress the
4334 warning. */
4339 primop0)))
4340 /* Do not warn for enumeration types. */
4344 {
4361 }
4364 {
4365 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4370 }
4371 }
4372 }
4380 }
4381 \f
4382 /* Return a tree for the sum or difference (RESULTCODE says which)
4383 of pointer PTROP and integer INTOP. */
4385 tree
4388 {
4391 /* The result is a pointer of the same type that is being added. */
4395 {
4402 }
4404 {
4411 }
4412 else
4415 /* We are manipulating pointer values, so we don't need to warn
4416 about relying on undefined signed overflow. We disable the
4417 warning here because we use integer types so fold won't know that
4418 they are really pointers. */
4421 /* If what we are about to multiply by the size of the elements
4422 contains a constant term, apply distributive law
4423 and multiply that constant term separately.
4424 This helps produce common subexpressions. */
4429 /* If the constant comes from pointer subtraction,
4430 skip this optimization--it would cause an error. */
4432 /* If the constant is unsigned, and smaller than the pointer size,
4433 then we must skip this optimization. This is because it could cause
4434 an overflow error if the constant is negative but INTOP is not. */
4438 {
4443 /* Convert both subexpression types to the type of intop,
4444 because weird cases involving pointer arithmetic
4445 can result in a sum or difference with different type args. */
4450 }
4452 /* Convert the integer argument to a type the same size as sizetype
4453 so the multiply won't overflow spuriously. */
4459 /* Replace the integer argument with a suitable product by the object size.
4460 Do this multiplication as signed, then convert to the appropriate type
4461 for the pointer operation and disregard an overflow that occurred only
4462 because of the sign-extension change in the latter conversion. */
4463 {
4469 }
4471 /* Create the sum or difference. */
4480 }
4481 \f
4482 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4483 and if NON_CONST is known not to be permitted in an evaluated part
4484 of a constant expression. */
4486 tree
4488 {
4492 /* This should never be called for C++. */
4496 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4505 }
4507 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4508 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4509 around the SAVE_EXPR if needed so that c_fully_fold does not need
4510 to look inside SAVE_EXPRs. */
4512 tree
4514 {
4523 }
4525 /* Return whether EXPR is a declaration whose address can never be
4526 NULL. */
4528 bool
4530 {
4535 }
4537 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4538 or for an `if' or `while' statement or ?..: exp. It should already
4539 have been validated to be of suitable type; otherwise, a bad
4540 diagnostic may result.
4542 The EXPR is located at LOCATION.
4544 This preparation consists of taking the ordinary
4545 representation of an expression expr and producing a valid tree
4546 boolean expression describing whether expr is nonzero. We could
4547 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4548 but we optimize comparisons, &&, ||, and !.
4550 The resulting type should always be `truthvalue_type_node'. */
4552 tree
4554 {
4556 {
4598 ? truthvalue_true_node
4604 ? truthvalue_true_node
4609 /* Fall through. */
4612 {
4615 {
4616 /* Common Ada/Pascal programmer's mistake. */
4618 OPT_Waddress,
4620 inner);
4622 }
4624 }
4641 /* These don't change whether an object is nonzero or zero. */
4646 /* These don't change whether an object is zero or nonzero, but
4647 we can't ignore them if their second arg has side-effects. */
4649 {
4652 c_common_truthvalue_conversion
4655 }
4656 else
4668 {
4678 "?: using integer constants in boolean context, "
4688 }
4689 /* Distribute the conversion into the arms of a COND_EXPR. */
4691 {
4696 /* In C++ one of the arms might have void type if it is throw. */
4705 }
4706 else
4707 {
4710 /* Folding will happen later for C. */
4719 }
4721 CASE_CONVERT:
4722 {
4727 && !c_inhibit_evaluation_warnings
4729 {
4735 OPT_Waddress,
4736 "the compiler can assume that the address of "
4738 inner);
4739 }
4741 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4742 since that affects how `default_conversion' will behave. */
4746 /* Don't strip a conversion from C++0x scoped enum, since they
4747 don't implicitly convert to other types. */
4751 /* If this isn't narrowing the argument, we can ignore it. */
4755 }
4761 {
4763 "suggest parentheses around assignment used as "
4766 }
4771 }
4774 {
4776 expr = (build_binary_op
4780 c_common_truthvalue_conversion
4783 c_common_truthvalue_conversion
4788 }
4791 {
4796 }
4797 else
4800 ret:
4803 }
4804 \f
4813 /* Apply the TYPE_QUALS to the new DECL. */
4815 void
4817 {
4825 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4826 constructor can produce constant init, so rely on cp_finish_decl to
4827 clear TREE_READONLY if the variable has non-constant init. */
4830 {
4833 }
4835 {
4837 /* Allow 'restrict' on arrays of pointers.
4838 FIXME currently we just ignore it. */
4844 }
4845 }
4848 {
4851 };
4853 /* Hash function for the problem of multiple type definitions in
4854 different files. This must hash all types that will compare
4855 equal via comptypes to the same value. In practice it hashes
4856 on some of the simple stuff and leaves the details to comptypes. */
4858 hashval_t
4860 {
4863 tree t2;
4865 {
4866 /* For pointers, hash on pointee type plus some swizzling. */
4869 /* Hash on number of elements and total size. */
4888 }
4889 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4890 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4892 /* We might have a VLA here. */
4895 else
4898 }
4900 bool
4902 {
4904 }
4908 /* Return the typed-based alias set for T, which may be an expression
4909 or a type. Return -1 if we don't do anything special. */
4911 alias_set_type
4913 {
4914 /* For VLAs, use the alias set of the element type rather than the
4915 default of alias set 0 for types compared structurally. */
4917 {
4921 }
4923 /* That's all the expressions we handle specially. */
4927 /* The C standard guarantees that any object may be accessed via an
4928 lvalue that has character type. */
4934 /* The C standard specifically allows aliasing between signed and
4935 unsigned variants of the same type. We treat the signed
4936 variant as canonical. */
4938 {
4941 /* t1 == t can happen for boolean nodes which are always unsigned. */
4944 }
4946 /* Handle the case of multiple type nodes referring to "the same" type,
4947 which occurs with IMA. These share an alias set. FIXME: Currently only
4948 C90 is handled. (In C99 type compatibility is not transitive, which
4949 complicates things mightily. The alias set splay trees can theoretically
4950 represent this, but insertion is tricky when you consider all the
4951 different orders things might arrive in.) */
4956 /* Save time if there's only one input file. */
4960 /* Pointers need special handling if they point to any type that
4961 needs special handling (below). */
4963 {
4964 tree t2;
4965 /* Find bottom type under any nested POINTERs. */
4969 ;
4975 }
4976 /* These are the only cases that need special handling. */
4981 /* Undefined? */
4985 /* Look up t in hash table. Only one of the compatible types within each
4986 alias set is recorded in the table. */
4991 {
4994 }
4995 else
4996 /* Our caller will assign and record (in t) a new alias set; all we need
4997 to do is remember t in the hash table. */
5001 }
5002 \f
5003 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5004 the IS_SIZEOF parameter indicates which operator is being applied.
5005 The COMPLAIN flag controls whether we should diagnose possibly
5006 ill-formed constructs or not. LOC is the location of the SIZEOF or
5007 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5008 a type in any context should be returned, rather than the normal
5009 alignment for that type. */
5011 tree
5015 {
5023 {
5025 {
5032 }
5033 else
5034 {
5036 {
5040 else
5043 }
5045 }
5046 }
5048 {
5056 }
5059 {
5064 }
5067 {
5072 }
5073 else
5074 {
5076 /* Convert in case a char is more than one unit. */
5082 else
5084 }
5086 /* VALUE will have the middle-end integer type sizetype.
5087 However, we should really return a value of type `size_t',
5088 which is just a typedef for an ordinary integer type. */
5092 }
5094 /* Implement the __alignof keyword: Return the minimum required
5095 alignment of EXPR, measured in bytes. For VAR_DECLs,
5096 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5097 from an "aligned" __attribute__ specification). LOC is the
5098 location of the ALIGNOF operator. */
5100 tree
5102 {
5103 tree t;
5110 {
5113 }
5119 {
5126 {
5133 }
5135 }
5136 else
5140 }
5141 \f
5142 /* Handle C and C++ default attributes. */
5144 enum built_in_attribute
5145 {
5146 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5147 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5148 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5149 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5150 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5152 #undef DEF_ATTR_NULL_TREE
5153 #undef DEF_ATTR_INT
5154 #undef DEF_ATTR_STRING
5155 #undef DEF_ATTR_IDENT
5156 #undef DEF_ATTR_TREE_LIST
5157 ATTR_LAST
5158 };
5164 enum c_builtin_type
5165 {
5166 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5167 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5168 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5169 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5170 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5171 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5172 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5173 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5174 ARG6) NAME,
5175 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5176 ARG6, ARG7) NAME,
5177 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5178 ARG6, ARG7, ARG8) NAME,
5179 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5180 ARG6, ARG7, ARG8, ARG9) NAME,
5181 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5182 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5183 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5184 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5185 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5186 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5187 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5188 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5189 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5190 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5191 NAME,
5192 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5193 ARG6) NAME,
5194 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5195 ARG6, ARG7) NAME,
5196 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5198 #undef DEF_PRIMITIVE_TYPE
5199 #undef DEF_FUNCTION_TYPE_0
5200 #undef DEF_FUNCTION_TYPE_1
5201 #undef DEF_FUNCTION_TYPE_2
5202 #undef DEF_FUNCTION_TYPE_3
5203 #undef DEF_FUNCTION_TYPE_4
5204 #undef DEF_FUNCTION_TYPE_5
5205 #undef DEF_FUNCTION_TYPE_6
5206 #undef DEF_FUNCTION_TYPE_7
5207 #undef DEF_FUNCTION_TYPE_8
5208 #undef DEF_FUNCTION_TYPE_9
5209 #undef DEF_FUNCTION_TYPE_10
5210 #undef DEF_FUNCTION_TYPE_11
5211 #undef DEF_FUNCTION_TYPE_VAR_0
5212 #undef DEF_FUNCTION_TYPE_VAR_1
5213 #undef DEF_FUNCTION_TYPE_VAR_2
5214 #undef DEF_FUNCTION_TYPE_VAR_3
5215 #undef DEF_FUNCTION_TYPE_VAR_4
5216 #undef DEF_FUNCTION_TYPE_VAR_5
5217 #undef DEF_FUNCTION_TYPE_VAR_6
5218 #undef DEF_FUNCTION_TYPE_VAR_7
5219 #undef DEF_POINTER_TYPE
5220 BT_LAST
5221 };
5225 /* A temporary array for c_common_nodes_and_builtins. Used in
5226 communication with def_fn_type. */
5229 /* A helper function for c_common_nodes_and_builtins. Build function type
5230 for DEF with return type RET and N arguments. If VAR is true, then the
5231 function should be variadic after those N arguments.
5233 Takes special care not to ICE if any of the types involved are
5234 error_mark_node, which indicates that said type is not in fact available
5235 (see builtin_type_for_size). In which case the function type as a whole
5236 should be error_mark_node. */
5238 static void
5240 {
5241 tree t;
5248 {
5254 }
5261 else
5264 egress:
5267 }
5269 /* Build builtin functions common to both C and C++ language
5270 frontends. */
5272 static void
5274 {
5275 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5276 builtin_types[ENUM] = VALUE;
5277 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5278 def_fn_type (ENUM, RETURN, 0, 0);
5279 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5280 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5281 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5282 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5283 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5284 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5285 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5286 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5287 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5288 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5289 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5290 ARG6) \
5291 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5292 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5293 ARG6, ARG7) \
5294 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5295 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5296 ARG6, ARG7, ARG8) \
5297 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5298 ARG7, ARG8);
5299 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5300 ARG6, ARG7, ARG8, ARG9) \
5301 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5302 ARG7, ARG8, ARG9);
5303 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5304 ARG6, ARG7, ARG8, ARG9, ARG10) \
5305 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5306 ARG7, ARG8, ARG9, ARG10);
5307 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5308 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5309 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5310 ARG7, ARG8, ARG9, ARG10, ARG11);
5311 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5312 def_fn_type (ENUM, RETURN, 1, 0);
5313 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5314 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5315 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5316 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5317 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5318 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5319 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5320 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5321 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5322 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5323 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5324 ARG6) \
5325 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5326 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5327 ARG6, ARG7) \
5328 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5329 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5330 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5334 #undef DEF_PRIMITIVE_TYPE
5335 #undef DEF_FUNCTION_TYPE_0
5336 #undef DEF_FUNCTION_TYPE_1
5337 #undef DEF_FUNCTION_TYPE_2
5338 #undef DEF_FUNCTION_TYPE_3
5339 #undef DEF_FUNCTION_TYPE_4
5340 #undef DEF_FUNCTION_TYPE_5
5341 #undef DEF_FUNCTION_TYPE_6
5342 #undef DEF_FUNCTION_TYPE_7
5343 #undef DEF_FUNCTION_TYPE_8
5344 #undef DEF_FUNCTION_TYPE_9
5345 #undef DEF_FUNCTION_TYPE_10
5346 #undef DEF_FUNCTION_TYPE_11
5347 #undef DEF_FUNCTION_TYPE_VAR_0
5348 #undef DEF_FUNCTION_TYPE_VAR_1
5349 #undef DEF_FUNCTION_TYPE_VAR_2
5350 #undef DEF_FUNCTION_TYPE_VAR_3
5351 #undef DEF_FUNCTION_TYPE_VAR_4
5352 #undef DEF_FUNCTION_TYPE_VAR_5
5353 #undef DEF_FUNCTION_TYPE_VAR_6
5354 #undef DEF_FUNCTION_TYPE_VAR_7
5355 #undef DEF_POINTER_TYPE
5360 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5361 NONANSI_P, ATTRS, IMPLICIT, COND) \
5362 if (NAME && COND) \
5363 def_builtin_1 (ENUM, NAME, CLASS, \
5364 builtin_types[(int) TYPE], \
5365 builtin_types[(int) LIBTYPE], \
5366 BOTH_P, FALLBACK_P, NONANSI_P, \
5367 built_in_attributes[(int) ATTRS], IMPLICIT);
5376 }
5378 /* Like get_identifier, but avoid warnings about null arguments when
5379 the argument may be NULL for targets where GCC lacks stdint.h type
5380 information. */
5384 {
5386 }
5388 /* Build tree nodes and builtin functions common to both C and C++ language
5389 frontends. */
5391 void
5393 {
5397 tree array_domain_type;
5398 tree va_list_ref_type_node;
5399 tree va_list_arg_type_node;
5404 /* Define `int' and `char' first so that dbx will output them first. */
5408 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5409 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5410 but not C. Are the conditionals here needed? */
5416 long_unsigned_type_node);
5419 {
5427 }
5432 long_long_integer_type_node);
5434 long_long_unsigned_type_node);
5437 long_long_unsigned_type_node);
5440 short_unsigned_type_node);
5443 short_unsigned_type_node);
5445 /* Define both `signed char' and `unsigned char'. */
5449 /* These are types that c_common_type_for_size and
5450 c_common_type_for_mode use. */
5453 intQI_type_node));
5456 intHI_type_node));
5459 intSI_type_node));
5462 intDI_type_node));
5463 #if HOST_BITS_PER_WIDE_INT >= 64
5464 /* Note that this is different than the __int128 type that's part of
5465 the generic __intN support. */
5468 TYPE_DECL,
5470 intTI_type_node));
5471 #endif
5474 unsigned_intQI_type_node));
5477 unsigned_intHI_type_node));
5480 unsigned_intSI_type_node));
5483 unsigned_intDI_type_node));
5484 #if HOST_BITS_PER_WIDE_INT >= 64
5487 TYPE_DECL,
5489 unsigned_intTI_type_node));
5490 #endif
5492 /* Create the widest literal types. */
5493 widest_integer_literal_type_node
5497 widest_integer_literal_type_node));
5499 widest_unsigned_literal_type_node
5503 widest_unsigned_literal_type_node));
5507 pid_type_node =
5520 /* Only supported decimal floating point extension if the target
5521 actually supports underlying modes. */
5525 {
5529 }
5532 {
5537 long_long_fract_type_node);
5539 unsigned_short_fract_type_node);
5541 unsigned_fract_type_node);
5543 unsigned_long_fract_type_node);
5545 unsigned_long_long_fract_type_node);
5547 sat_short_fract_type_node);
5550 sat_long_fract_type_node);
5552 sat_long_long_fract_type_node);
5554 sat_unsigned_short_fract_type_node);
5556 sat_unsigned_fract_type_node);
5558 sat_unsigned_long_fract_type_node);
5560 sat_unsigned_long_long_fract_type_node);
5565 long_long_accum_type_node);
5567 unsigned_short_accum_type_node);
5569 unsigned_accum_type_node);
5571 unsigned_long_accum_type_node);
5573 unsigned_long_long_accum_type_node);
5575 sat_short_accum_type_node);
5578 sat_long_accum_type_node);
5580 sat_long_long_accum_type_node);
5582 sat_unsigned_short_accum_type_node);
5584 sat_unsigned_accum_type_node);
5586 sat_unsigned_long_accum_type_node);
5588 sat_unsigned_long_long_accum_type_node);
5590 }
5593 TYPE_DECL,
5595 complex_integer_type_node));
5597 TYPE_DECL,
5599 complex_float_type_node));
5601 TYPE_DECL,
5603 complex_double_type_node));
5607 complex_long_double_type_node));
5612 {
5618 TYPE_DECL,
5621 }
5624 /* For C++, make fileptr_type_node a distinct void * type until
5625 FILE type is defined. */
5630 /* Set the TYPE_NAME for any variants that were built before
5631 record_builtin_type gave names to the built-in types. */
5632 {
5638 }
5642 /* Make a type to be the domain of a few array types
5643 whose domains don't really matter.
5644 200 is small enough that it always fits in size_t
5645 and large enough that it can hold most function names for the
5646 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5649 /* Make a type for arrays of characters.
5650 With luck nothing will ever really depend on the length of this
5651 array type. */
5652 char_array_type_node
5656 const_string_type_node
5660 /* This is special for C++ so functions can be overloaded. */
5666 {
5669 else
5672 }
5674 /* This is for wide string constants. */
5675 wchar_array_type_node
5678 /* Define 'char16_t'. */
5683 {
5688 }
5690 /* This is for UTF-16 string constants. */
5691 char16_array_type_node
5694 /* Define 'char32_t'. */
5699 {
5704 }
5706 /* This is for UTF-32 string constants. */
5707 char32_array_type_node
5710 wint_type_node =
5713 intmax_type_node =
5715 uintmax_type_node =
5719 sig_atomic_type_node =
5722 int8_type_node =
5725 int16_type_node =
5728 int32_type_node =
5731 int64_type_node =
5734 uint8_type_node =
5746 int_least8_type_node =
5749 int_least16_type_node =
5752 int_least32_type_node =
5755 int_least64_type_node =
5758 uint_least8_type_node =
5761 uint_least16_type_node =
5764 uint_least32_type_node =
5767 uint_least64_type_node =
5770 int_fast8_type_node =
5773 int_fast16_type_node =
5776 int_fast32_type_node =
5779 int_fast64_type_node =
5782 uint_fast8_type_node =
5785 uint_fast16_type_node =
5788 uint_fast32_type_node =
5791 uint_fast64_type_node =
5794 intptr_type_node =
5797 uintptr_type_node =
5800 default_function_type
5802 ptrdiff_type_node
5809 va_list_type_node));
5811 {
5814 tree ptype;
5817 {
5821 ptype));
5823 }
5824 }
5827 {
5830 }
5831 else
5832 {
5835 }
5842 /* Create the built-in __null node. It is important that this is
5843 not shared. */
5847 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5849 }
5851 /* The number of named compound-literals generated thus far. */
5854 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5856 void
5858 {
5861 compound_literal_number);
5862 compound_literal_number++;
5864 }
5866 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5867 TYPE and operand OP. */
5869 static tree
5871 {
5875 }
5877 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5878 va_arg (EXPR, TYPE) at source location LOC. */
5880 tree
5882 {
5885 ? error_mark_node
5890 {
5894 /* Let's handle things neutrallly, if expr:
5895 - has undeclared type, or
5896 - is not an va_list type. */
5898 }
5901 {
5902 /* Case 1: Not an array type. */
5904 /* Take the address, to get '&ap'. Note that &ap is not a va_list
5905 type. */
5910 }
5912 /* Case 2: Array type.
5914 Background:
5916 For contrast, let's start with the simple case (case 1). If
5917 canon_va_type is not an array type, but say a char *, then when
5918 passing-by-value a va_list, the type of the va_list param decl is
5919 the same as for another va_list decl (all ap's are char *):
5921 f2_1 (char * ap)
5922 D.1815 = VA_ARG (&ap, 0B, 1);
5923 return D.1815;
5925 f2 (int i)
5926 char * ap.0;
5927 char * ap;
5928 __builtin_va_start (&ap, 0);
5929 ap.0 = ap;
5930 res = f2_1 (ap.0);
5931 __builtin_va_end (&ap);
5932 D.1812 = res;
5933 return D.1812;
5935 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5936 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5937 the same as for another va_list decl (case 2a, struct ap[1]).
5939 f2_1 (struct * ap)
5940 D.1844 = VA_ARG (ap, 0B, 0);
5941 return D.1844;
5943 f2 (int i)
5944 struct ap[1];
5945 __builtin_va_start (&ap, 0);
5946 res = f2_1 (&ap);
5947 __builtin_va_end (&ap);
5948 D.1841 = res;
5949 return D.1841;
5951 Case 2b is different because:
5952 - on the callee side, the parm decl has declared type va_list, but
5953 grokdeclarator changes the type of the parm decl to a pointer to the
5954 array elem type.
5955 - on the caller side, the pass-by-value uses &ap.
5957 We unify these two cases (case 2a: va_list is array type,
5958 case 2b: va_list is pointer to array elem type), by adding '&' for the
5959 array type case, such that we have a pointer to array elem in both
5960 cases. */
5963 {
5964 /* Case 2a: va_list is array type. */
5966 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5967 elem type. */
5970 expr);
5972 /* Verify that &ap is still recognized as having va_list type. */
5973 tree canon_expr_type
5976 }
5977 else
5978 {
5979 /* Case 2b: va_list is pointer to array elem type. */
5982 /* Comparison as in std_canonical_va_list_type. */
5986 /* Don't take the address. We've already got '&ap'. */
5987 ;
5988 }
5991 }
5994 /* Linked list of disabled built-in functions. */
5996 struct disabled_builtin
5997 {
6000 };
6005 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6006 begins with "__builtin_", give an error. */
6008 void
6010 {
6013 else
6014 {
6019 }
6020 }
6023 /* Return true if the built-in function NAME has been disabled, false
6024 otherwise. */
6026 static bool
6028 {
6031 {
6034 }
6036 }
6039 /* Worker for DEF_BUILTIN.
6040 Possibly define a builtin function with one or two names.
6041 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6042 nonansi_p and flag_no_nonansi_builtin. */
6044 static void
6051 {
6052 tree decl;
6065 fnattrs);
6074 }
6075 \f
6076 /* Nonzero if the type T promotes to int. This is (nearly) the
6077 integral promotions defined in ISO C99 6.3.1.1/2. */
6079 bool
6081 {
6083 {
6093 /* ??? Technically all enumerations not larger than an int
6094 promote to an int. But this is used along code paths
6095 that only want to notice a size change. */
6103 }
6104 }
6106 /* Return 1 if PARMS specifies a fixed number of parameters
6107 and none of their types is affected by default promotions. */
6109 int
6111 {
6112 const_tree t;
6114 {
6131 }
6133 }
6135 /* Recursively remove any '*' or '&' operator from TYPE. */
6136 tree
6138 {
6142 }
6144 /* Recursively remove pointer or array type from TYPE. */
6145 tree
6147 {
6151 }
6153 /* Used to compare case labels. K1 and K2 are actually tree nodes
6154 representing case labels, or NULL_TREE for a `default' label.
6155 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6156 K2, and 0 if K1 and K2 are equal. */
6158 int
6160 {
6161 /* Consider a NULL key (such as arises with a `default' label) to be
6162 smaller than anything else. */
6169 }
6171 /* Process a case label, located at LOC, for the range LOW_VALUE
6172 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6173 then this case label is actually a `default' label. If only
6174 HIGH_VALUE is NULL_TREE, then case label was declared using the
6175 usual C/C++ syntax, rather than the GNU case range extension.
6176 CASES is a tree containing all the case ranges processed so far;
6177 COND is the condition for the switch-statement itself.
6178 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6179 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6180 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6182 tree
6185 {
6186 tree type;
6187 tree label;
6188 tree case_label;
6189 splay_tree_node node;
6191 /* Create the LABEL_DECL itself. */
6194 /* If there was an error processing the switch condition, bail now
6195 before we get more confused. */
6203 {
6206 }
6208 /* Case ranges are a GNU extension. */
6215 {
6220 }
6222 {
6227 }
6230 {
6231 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6232 really a case range, even though it was written that way.
6233 Remove the HIGH_VALUE to simplify later processing. */
6238 }
6240 /* See if the case is in range of the type of the original testing
6241 expression. If both low_value and high_value are out of range,
6242 don't insert the case label and return NULL_TREE. */
6246 outside_range_p))
6249 /* Look up the LOW_VALUE in the table of case labels we already
6250 have. */
6252 /* If there was not an exact match, check for overlapping ranges.
6253 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6254 that's a `default' label and the only overlap is an exact match. */
6256 {
6257 splay_tree_node low_bound;
6258 splay_tree_node high_bound;
6260 /* Even though there wasn't an exact match, there might be an
6261 overlap between this case range and another case range.
6262 Since we've (inductively) not allowed any overlapping case
6263 ranges, we simply need to find the greatest low case label
6264 that is smaller that LOW_VALUE, and the smallest low case
6265 label that is greater than LOW_VALUE. If there is an overlap
6266 it will occur in one of these two ranges. */
6272 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6273 the LOW_VALUE, so there is no need to check unless the
6274 LOW_BOUND is in fact itself a case range. */
6280 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6281 range is bigger than the low end of the current range, so we
6282 are only interested if the current range is a real range, and
6283 not an ordinary case label. */
6285 && high_value
6287 high_value)
6290 }
6291 /* If there was an overlap, issue an error. */
6293 {
6297 {
6301 }
6303 {
6306 }
6307 else
6308 {
6312 }
6314 }
6316 /* Add a CASE_LABEL to the statement-tree. */
6318 /* Register this case label in the splay tree. */
6325 error_out:
6326 /* Add a label so that the back-end doesn't think that the beginning of
6327 the switch is unreachable. Note that we do not add a case label, as
6328 that just leads to duplicates and thence to failure later on. */
6330 {
6333 }
6335 }
6337 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6338 Used to verify that case values match up with enumerator values. */
6340 static void
6342 {
6349 else
6356 buf);
6357 else
6362 }
6364 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6365 Used to verify that case values match up with enumerator values. */
6367 static int
6369 {
6373 /* Skip default case. */
6377 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6378 when we did our enum->case scan. Reset our scratch bit after. */
6381 else
6384 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6385 not set, that means that CASE_HIGH did not appear when we did our
6386 enum->case scan. Reset our scratch bit after. */
6388 {
6391 else
6393 }
6396 }
6398 /* Handle -Wswitch*. Called from the front end after parsing the
6399 switch construct. */
6400 /* ??? Should probably be somewhere generic, since other languages
6401 besides C and C++ would want this. At the moment, however, C/C++
6402 are the only tree-ssa languages that support enumerations at all,
6403 so the point is moot. */
6405 void
6409 {
6410 splay_tree_node default_node;
6411 splay_tree_node node;
6412 tree chain;
6423 /* There are certain cases where -Wswitch-bool warnings aren't
6424 desirable, such as
6425 switch (boolean)
6426 {
6427 case true: ...
6428 case false: ...
6429 }
6430 so be careful here. */
6432 {
6433 splay_tree_node min_node;
6434 /* If there's a default node, it's also the value with the minimal
6435 key. So look at the penultimate key (if any). */
6438 else
6443 /* This might be a case range, so look at the value with the
6444 maximal key and then check CASE_HIGH. */
6449 /* If there's a case value > 1 or < 0, that is outside bool
6450 range, warn. */
6454 /* And handle the
6455 switch (boolean)
6456 {
6457 case true: ...
6458 case false: ...
6459 default: ...
6460 }
6461 case, where we want to warn. */
6462 || (default_node
6467 }
6469 /* From here on, we only care about enumerated types. */
6473 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6477 /* Check the cases. Warn about case values which are not members of
6478 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6479 there is no default case, check that exactly all enumeration
6480 literals are covered by the cases. */
6482 /* Clearing COND if it is not an integer constant simplifies
6483 the tests inside the loop below. */
6487 /* The time complexity here is O(N*lg(N)) worst case, but for the
6488 common case of monotonically increasing enumerators, it is
6489 O(N), since the nature of the splay tree will keep the next
6490 element adjacent to the root at all times. */
6493 {
6499 {
6500 /* Mark the CASE_LOW part of the case entry as seen. */
6504 }
6506 /* Even though there wasn't an exact match, there might be a
6507 case range which includes the enumerator's value. */
6510 {
6514 {
6515 /* If we match the upper bound exactly, mark the CASE_HIGH
6516 part of the case entry as seen. */
6520 }
6521 }
6523 /* We've now determined that this enumerated literal isn't
6524 handled by the case labels of the switch statement. */
6526 /* If the switch expression is a constant, we only really care
6527 about whether that constant is handled by the switch. */
6531 /* If there is a default_node, the only relevant option is
6532 Wswitch-enum. Otherwise, if both are enabled then we prefer
6533 to warn using -Wswitch because -Wswitch is enabled by -Wall
6534 while -Wswitch-enum is explicit. */
6537 ? OPT_Wswitch_enum
6541 }
6543 /* Warn if there are case expressions that don't correspond to
6544 enumerators. This can occur since C and C++ don't enforce
6545 type-checking of assignments to enumeration variables.
6547 The time complexity here is now always O(N) worst case, since
6548 we should have marked both the lower bound and upper bound of
6549 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6550 above. This scan also resets those fields. */
6553 }
6555 /* Finish an expression taking the address of LABEL (an
6556 IDENTIFIER_NODE). Returns an expression for the address.
6558 LOC is the location for the expression returned. */
6560 tree
6562 {
6563 tree result;
6573 else
6574 {
6577 /* The current function is not necessarily uninlinable.
6578 Computed gotos are incompatible with inlining, but the value
6579 here could be used only in a diagnostic, for example. */
6581 }
6584 }
6585 \f
6587 /* Given a boolean expression ARG, return a tree representing an increment
6588 or decrement (as indicated by CODE) of ARG. The front end must check for
6589 invalid cases (e.g., decrement in C++). */
6590 tree
6592 {
6593 tree val;
6598 {
6621 }
6624 }
6625 \f
6626 /* Built-in macros for stddef.h and stdint.h, that require macros
6627 defined in this file. */
6628 void
6630 {
6693 }
6695 static void
6697 {
6698 /* Fill in the built_in_attributes array. */
6699 #define DEF_ATTR_NULL_TREE(ENUM) \
6700 built_in_attributes[(int) ENUM] = NULL_TREE;
6701 #define DEF_ATTR_INT(ENUM, VALUE) \
6702 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6703 #define DEF_ATTR_STRING(ENUM, VALUE) \
6704 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6705 #define DEF_ATTR_IDENT(ENUM, STRING) \
6706 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6707 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6708 built_in_attributes[(int) ENUM] \
6709 = tree_cons (built_in_attributes[(int) PURPOSE], \
6710 built_in_attributes[(int) VALUE], \
6711 built_in_attributes[(int) CHAIN]);
6713 #undef DEF_ATTR_NULL_TREE
6714 #undef DEF_ATTR_INT
6715 #undef DEF_ATTR_IDENT
6716 #undef DEF_ATTR_TREE_LIST
6717 }
6719 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6720 identifier as an argument, so the front end shouldn't look it up. */
6722 bool
6724 {
6727 /* Unknown attribute that we'll end up ignoring, return true so we
6728 don't complain about an identifier argument. */
6734 else
6736 }
6738 /* Attribute handlers common to C front ends. */
6740 /* Handle a "packed" attribute; arguments as in
6741 struct attribute_spec.handler. */
6743 static tree
6746 {
6748 {
6752 }
6754 {
6756 /* Still pack bitfields. */
6761 else
6763 }
6764 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6765 used for DECL_REGISTER. It wouldn't mean anything anyway.
6766 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6767 that changes what the typedef is typing. */
6768 else
6769 {
6772 }
6775 }
6777 /* Handle a "nocommon" attribute; arguments as in
6778 struct attribute_spec.handler. */
6780 static tree
6784 {
6787 else
6788 {
6791 }
6794 }
6796 /* Handle a "common" attribute; arguments as in
6797 struct attribute_spec.handler. */
6799 static tree
6802 {
6805 else
6806 {
6809 }
6812 }
6814 /* Handle a "noreturn" attribute; arguments as in
6815 struct attribute_spec.handler. */
6817 static tree
6820 {
6823 /* See FIXME comment in c_common_attribute_table. */
6830 = (build_qualified_type
6831 (build_pointer_type
6835 else
6836 {
6839 }
6842 }
6844 /* Handle a "hot" and attribute; arguments as in
6845 struct attribute_spec.handler. */
6847 static tree
6850 {
6853 {
6855 {
6859 }
6860 /* Most of the rest of the hot processing is done later with
6861 lookup_attribute. */
6862 }
6863 else
6864 {
6867 }
6870 }
6872 /* Handle a "cold" and attribute; arguments as in
6873 struct attribute_spec.handler. */
6875 static tree
6878 {
6881 {
6883 {
6887 }
6888 /* Most of the rest of the cold processing is done later with
6889 lookup_attribute. */
6890 }
6891 else
6892 {
6895 }
6898 }
6900 /* Handle a "no_sanitize_address" attribute; arguments as in
6901 struct attribute_spec.handler. */
6903 static tree
6906 {
6908 {
6911 }
6914 }
6916 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6917 struct attribute_spec.handler. */
6919 static tree
6922 {
6931 }
6933 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6934 struct attribute_spec.handler. */
6936 static tree
6939 {
6941 {
6944 }
6947 }
6949 /* Handle a "stack_protect" attribute; arguments as in
6950 struct attribute_spec.handler. */
6951 static tree
6954 {
6956 {
6959 }
6960 else
6966 }
6968 /* Handle a "noinline" attribute; arguments as in
6969 struct attribute_spec.handler. */
6971 static tree
6975 {
6977 {
6979 {
6983 }
6984 else
6986 }
6987 else
6988 {
6991 }
6994 }
6996 /* Handle a "noclone" attribute; arguments as in
6997 struct attribute_spec.handler. */
6999 static tree
7003 {
7005 {
7008 }
7011 }
7013 /* Handle a "no_icf" attribute; arguments as in
7014 struct attribute_spec.handler. */
7016 static tree
7020 {
7022 {
7025 }
7028 }
7031 /* Handle a "always_inline" attribute; arguments as in
7032 struct attribute_spec.handler. */
7034 static tree
7039 {
7041 {
7043 {
7047 }
7049 {
7053 }
7054 else
7055 /* Set the attribute and mark it for disregarding inline
7056 limits. */
7058 }
7059 else
7060 {
7063 }
7066 }
7068 /* Handle a "gnu_inline" attribute; arguments as in
7069 struct attribute_spec.handler. */
7071 static tree
7076 {
7078 {
7079 /* Do nothing else, just set the attribute. We'll get at
7080 it later with lookup_attribute. */
7081 }
7082 else
7083 {
7086 }
7089 }
7091 /* Handle a "leaf" attribute; arguments as in
7092 struct attribute_spec.handler. */
7094 static tree
7098 {
7100 {
7103 }
7105 {
7108 }
7111 }
7113 /* Handle an "artificial" attribute; arguments as in
7114 struct attribute_spec.handler. */
7116 static tree
7121 {
7123 {
7124 /* Do nothing else, just set the attribute. We'll get at
7125 it later with lookup_attribute. */
7126 }
7127 else
7128 {
7131 }
7134 }
7136 /* Handle a "flatten" attribute; arguments as in
7137 struct attribute_spec.handler. */
7139 static tree
7141 tree args ATTRIBUTE_UNUSED,
7143 {
7145 /* Do nothing else, just set the attribute. We'll get at
7146 it later with lookup_attribute. */
7147 ;
7148 else
7149 {
7152 }
7155 }
7157 /* Handle a "warning" or "error" attribute; arguments as in
7158 struct attribute_spec.handler. */
7160 static tree
7163 {
7166 /* Do nothing else, just set the attribute. We'll get at
7167 it later with lookup_attribute. */
7168 ;
7169 else
7170 {
7173 }
7176 }
7178 /* Handle a "used" attribute; arguments as in
7179 struct attribute_spec.handler. */
7181 static tree
7184 {
7190 {
7195 }
7196 else
7197 {
7200 }
7203 }
7205 /* Handle a "unused" attribute; arguments as in
7206 struct attribute_spec.handler. */
7208 tree
7211 {
7213 {
7221 {
7225 }
7226 else
7227 {
7230 }
7231 }
7232 else
7233 {
7237 }
7240 }
7242 /* Handle a "externally_visible" attribute; arguments as in
7243 struct attribute_spec.handler. */
7245 static tree
7250 {
7254 {
7257 {
7261 }
7262 }
7263 else
7264 {
7267 }
7270 }
7272 /* Handle the "no_reorder" attribute. Arguments as in
7273 struct attribute_spec.handler. */
7275 static tree
7277 tree name,
7278 tree,
7281 {
7286 {
7289 name);
7291 }
7294 }
7296 /* Handle a "const" attribute; arguments as in
7297 struct attribute_spec.handler. */
7299 static tree
7302 {
7305 /* See FIXME comment on noreturn in c_common_attribute_table. */
7311 = (build_qualified_type
7312 (build_pointer_type
7316 else
7317 {
7320 }
7323 }
7325 /* Handle a "scalar_storage_order" attribute; arguments as in
7326 struct attribute_spec.handler. */
7328 static tree
7331 {
7333 tree type;
7341 {
7345 }
7348 {
7357 else
7358 {
7362 }
7365 {
7367 /* A type variant isn't good enough, since we don't want a cast
7368 to such a type to be removed as a no-op. */
7370 }
7374 }
7379 }
7381 /* Handle a "transparent_union" attribute; arguments as in
7382 struct attribute_spec.handler. */
7384 static tree
7388 {
7389 tree type;
7399 {
7400 /* Make sure that the first field will work for a transparent union.
7401 If the type isn't complete yet, leave the check to the code in
7402 finish_struct. */
7404 {
7410 }
7413 {
7414 /* If the type isn't complete yet, setting the flag
7415 on a variant wouldn't ever be checked. */
7419 /* build_duplicate_type doesn't work for C++. */
7423 /* A type variant isn't good enough, since we don't want a cast
7424 to such a type to be removed as a no-op. */
7426 }
7431 }
7433 ignored:
7436 }
7438 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7439 get the requested priority for a constructor or destructor,
7440 possibly issuing diagnostics for invalid or reserved
7441 priorities. */
7443 static priority_type
7445 {
7446 HOST_WIDE_INT pri;
7447 tree arg;
7453 {
7456 else
7459 }
7476 {
7479 "destructor priorities from 0 to %d are reserved "
7481 MAX_RESERVED_INIT_PRIORITY);
7482 else
7484 "constructor priorities from 0 to %d are reserved "
7486 MAX_RESERVED_INIT_PRIORITY);
7487 }
7490 invalid:
7493 MAX_INIT_PRIORITY);
7494 else
7496 MAX_INIT_PRIORITY);
7498 }
7500 /* Handle a "constructor" attribute; arguments as in
7501 struct attribute_spec.handler. */
7503 static tree
7507 {
7514 {
7515 priority_type priority;
7520 }
7521 else
7522 {
7525 }
7528 }
7530 /* Handle a "destructor" attribute; arguments as in
7531 struct attribute_spec.handler. */
7533 static tree
7537 {
7544 {
7545 priority_type priority;
7550 }
7551 else
7552 {
7555 }
7558 }
7560 /* Nonzero if the mode is a valid vector mode for this architecture.
7561 This returns nonzero even if there is no hardware support for the
7562 vector mode, but we can emulate with narrower modes. */
7564 static int
7566 {
7568 machine_mode innermode;
7570 /* Doh! What's going on? */
7579 /* Hardware support. Woo hoo! */
7585 /* We should probably return 1 if requesting V4DI and we have no DI,
7586 but we have V2DI, but this is probably very unlikely. */
7588 /* If we have support for the inner mode, we can safely emulate it.
7589 We may not have V2DI, but me can emulate with a pair of DIs. */
7591 }
7594 /* Handle a "mode" attribute; arguments as in
7595 struct attribute_spec.handler. */
7597 static tree
7600 {
7608 else
7609 {
7614 tree typefm;
7619 {
7625 }
7627 /* Change this type to have a type with the specified mode.
7628 First check for the special modes. */
7641 else
7644 {
7647 }
7650 {
7653 }
7657 {
7689 }
7691 {
7694 }
7697 {
7702 {
7705 }
7709 else
7712 }
7713 else
7714 {
7715 /* For fixed-point modes, we need to test if the signness of type
7716 and the machine mode are consistent. */
7719 {
7722 }
7723 /* For fixed-point modes, we need to pass saturating info. */
7727 }
7730 {
7733 }
7735 {
7736 /* For enumeral types, copy the precision from the integer
7737 type returned above. If not an INTEGER_TYPE, we can't use
7738 this mode for this type. */
7740 {
7743 }
7746 {
7749 }
7750 else
7751 {
7752 /* We cannot build a type variant, as there's code that assumes
7753 that TYPE_MAIN_VARIANT has the same mode. This includes the
7754 debug generators. Instead, create a subrange type. This
7755 results in all of the enumeral values being emitted only once
7756 in the original, and the subtype gets them by reference. */
7759 else
7762 }
7763 }
7767 {
7770 }
7773 }
7776 }
7778 /* Handle a "section" attribute; arguments as in
7779 struct attribute_spec.handler. */
7781 static tree
7784 {
7788 {
7792 }
7797 {
7800 }
7803 {
7806 }
7811 {
7815 }
7817 /* The decl may have already been given a section attribute
7818 from a previous declaration. Ensure they match. */
7822 {
7825 }
7830 {
7833 }
7838 fail:
7841 }
7843 /* Check whether ALIGN is a valid user-specified alignment. If so,
7844 return its base-2 log; if not, output an error and return -1. If
7845 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7846 no error. */
7847 int
7849 {
7856 {
7859 }
7864 {
7867 }
7869 {
7872 }
7874 }
7876 /* If in c++-11, check if the c++-11 alignment constraint with respect
7877 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7878 c++-11 mode, does nothing.
7880 [dcl.align]2/ says:
7882 [* if the constant expression evaluates to a fundamental alignment,
7883 the alignment requirement of the declared entity shall be the
7884 specified fundamental alignment.
7886 * if the constant expression evaluates to an extended alignment
7887 and the implementation supports that alignment in the context
7888 of the declaration, the alignment of the declared entity shall
7889 be that alignment
7891 * if the constant expression evaluates to an extended alignment
7892 and the implementation does not support that alignment in the
7893 context of the declaration, the program is ill-formed]. */
7895 static bool
7899 {
7912 {
7914 /* For file scope variables and static members, the target supports
7915 alignments that are at most MAX_OFILE_ALIGNMENT. */
7917 else
7918 /* For stack variables, the target supports at most
7919 MAX_STACK_ALIGNMENT. */
7923 }
7924 /* Let's be liberal for types and fields; don't limit their alignment any
7925 more than check_user_alignment already did. */
7933 }
7935 /* Handle a "aligned" attribute; arguments as in
7936 struct attribute_spec.handler. */
7938 static tree
7941 {
7945 tree align_expr;
7949 {
7954 }
7955 else
7959 {
7963 }
7971 {
7974 /* If we have a TYPE_DECL, then copy the type, so that we
7975 don't accidentally modify a builtin type. See pushdecl. */
7978 {
7985 }
7986 else
7991 }
7994 {
7997 }
8000 /* C++-11 [dcl.align/4]:
8002 When multiple alignment-specifiers are specified for an
8003 entity, the alignment requirement shall be set to the
8004 strictest specified alignment.
8006 This formally comes from the c++11 specification but we are
8007 doing it for the GNU attribute syntax as well. */
8011 {
8016 else
8020 }
8021 else
8022 {
8025 }
8028 }
8030 /* Handle a "weak" attribute; arguments as in
8031 struct attribute_spec.handler. */
8033 static tree
8038 {
8041 {
8044 }
8046 {
8050 }
8053 else
8057 }
8059 /* Handle a "noplt" attribute; arguments as in
8060 struct attribute_spec.handler. */
8062 static tree
8067 {
8069 {
8074 }
8076 }
8078 /* Handle an "alias" or "ifunc" attribute; arguments as in
8079 struct attribute_spec.handler, except that IS_ALIAS tells us
8080 whether this is an alias as opposed to ifunc attribute. */
8082 static tree
8085 {
8090 {
8093 }
8097 /* A static variable declaration is always a tentative definition,
8098 but the alias is a non-tentative definition which overrides. */
8101 {
8105 }
8109 {
8113 }
8115 /* Note that the very first time we process a nested declaration,
8116 decl_function_context will not be set. Indeed, *would* never
8117 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8118 we do below. After such frobbery, pushdecl would set the context.
8119 In any case, this is never what we want. */
8121 {
8122 tree id;
8126 {
8130 }
8132 /* This counts as a use of the object pointed to. */
8137 else
8141 /* ifuncs are also aliases, so set that attribute too. */
8144 }
8145 else
8146 {
8149 }
8152 {
8155 {
8158 else
8160 }
8161 }
8165 }
8167 /* Handle an "alias" or "ifunc" attribute; arguments as in
8168 struct attribute_spec.handler. */
8170 static tree
8173 {
8175 }
8177 /* Handle an "alias" or "ifunc" attribute; arguments as in
8178 struct attribute_spec.handler. */
8180 static tree
8183 {
8185 }
8187 /* Handle a "weakref" attribute; arguments as in struct
8188 attribute_spec.handler. */
8190 static tree
8193 {
8196 /* We must ignore the attribute when it is associated with
8197 local-scoped decls, since attribute alias is ignored and many
8198 such symbols do not even have a DECL_WEAK field. */
8200 || current_function_decl
8202 {
8206 }
8209 {
8213 }
8215 /* The idea here is that `weakref("name")' mutates into `weakref,
8216 alias("name")', and weakref without arguments, in turn,
8217 implicitly adds weak. */
8220 {
8227 }
8228 else
8229 {
8234 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8235 and that isn't supported; and because it wants to add it to
8236 the list of weak decls, which isn't helpful. */
8238 }
8241 {
8245 }
8248 }
8250 /* Handle an "visibility" attribute; arguments as in
8251 struct attribute_spec.handler. */
8253 static tree
8257 {
8263 {
8267 {
8269 name);
8271 }
8273 {
8277 }
8278 }
8280 {
8283 }
8286 {
8289 }
8291 /* If this is a type, set the visibility on the type decl. */
8293 {
8298 {
8300 name);
8302 }
8303 }
8313 else
8314 {
8315 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8317 }
8321 {
8335 }
8340 /* Go ahead and attach the attribute to the node as well. This is needed
8341 so we can determine whether we have VISIBILITY_DEFAULT because the
8342 visibility was not specified, or because it was explicitly overridden
8343 from the containing scope. */
8346 }
8348 /* Determine the ELF symbol visibility for DECL, which is either a
8349 variable or a function. It is an error to use this function if a
8350 definition of DECL is not available in this translation unit.
8351 Returns true if the final visibility has been determined by this
8352 function; false if the caller is free to make additional
8353 modifications. */
8355 bool
8357 {
8360 /* If the user explicitly specified the visibility with an
8361 attribute, honor that. DECL_VISIBILITY will have been set during
8362 the processing of the attribute. We check for an explicit
8363 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8364 to distinguish the use of an attribute from the use of a "#pragma
8365 GCC visibility push(...)"; in the latter case we still want other
8366 considerations to be able to overrule the #pragma. */
8368 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8373 /* Set default visibility to whatever the user supplied with
8374 visibility_specified depending on #pragma GCC visibility. */
8376 {
8379 {
8382 /* If visibility changed and DECL already has DECL_RTL, ensure
8383 symbol flags are updated. */
8388 }
8389 }
8391 }
8393 /* Handle an "tls_model" attribute; arguments as in
8394 struct attribute_spec.handler. */
8396 static tree
8399 {
8400 tree id;
8407 {
8410 }
8415 {
8418 }
8428 else
8429 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8433 }
8435 /* Handle a "no_instrument_function" attribute; arguments as in
8436 struct attribute_spec.handler. */
8438 static tree
8443 {
8447 {
8451 }
8452 else
8456 }
8458 /* Handle a "no_profile_instrument_function" attribute; arguments as in
8459 struct attribute_spec.handler. */
8461 static tree
8464 {
8466 {
8469 }
8472 }
8474 /* Handle a "malloc" attribute; arguments as in
8475 struct attribute_spec.handler. */
8477 static tree
8480 {
8484 else
8485 {
8488 }
8491 }
8493 /* Handle a "alloc_size" attribute; arguments as in
8494 struct attribute_spec.handler. */
8496 static tree
8499 {
8502 {
8509 || !arg_count
8511 {
8516 }
8517 }
8519 }
8521 /* Handle a "alloc_align" attribute; arguments as in
8522 struct attribute_spec.handler. */
8524 static tree
8527 {
8535 || !arg_count
8537 {
8542 }
8544 }
8546 /* Handle a "assume_aligned" attribute; arguments as in
8547 struct attribute_spec.handler. */
8549 static tree
8552 {
8554 {
8561 {
8566 }
8567 }
8569 }
8571 /* Handle a "fn spec" attribute; arguments as in
8572 struct attribute_spec.handler. */
8574 static tree
8578 {
8583 }
8585 /* Handle a "bnd_variable_size" attribute; arguments as in
8586 struct attribute_spec.handler. */
8588 static tree
8591 {
8593 {
8596 }
8599 }
8601 /* Handle a "bnd_legacy" attribute; arguments as in
8602 struct attribute_spec.handler. */
8604 static tree
8607 {
8609 {
8612 }
8615 }
8617 /* Handle a "bnd_instrument" attribute; arguments as in
8618 struct attribute_spec.handler. */
8620 static tree
8623 {
8625 {
8628 }
8631 }
8633 /* Handle a "warn_unused" attribute; arguments as in
8634 struct attribute_spec.handler. */
8636 static tree
8638 tree args ATTRIBUTE_UNUSED,
8640 {
8642 /* Do nothing else, just set the attribute. We'll get at
8643 it later with lookup_attribute. */
8644 ;
8645 else
8646 {
8649 }
8652 }
8654 /* Handle an "omp declare simd" attribute; arguments as in
8655 struct attribute_spec.handler. */
8657 static tree
8659 {
8661 }
8663 /* Handle a "simd" attribute. */
8665 static tree
8667 {
8669 {
8672 {
8674 "%<__simd__%> attribute cannot be used in the same "
8677 }
8678 else
8679 {
8683 {
8687 {
8691 }
8695 OMP_CLAUSE_NOTINBRANCH);
8696 else
8699 OMP_CLAUSE_INBRANCH);
8700 else
8701 {
8706 }
8707 }
8711 attr),
8713 }
8714 }
8715 else
8716 {
8719 }
8722 }
8724 /* Handle an "omp declare target" attribute; arguments as in
8725 struct attribute_spec.handler. */
8727 static tree
8729 {
8731 }
8733 /* Handle a "returns_twice" attribute; arguments as in
8734 struct attribute_spec.handler. */
8736 static tree
8739 {
8742 else
8743 {
8746 }
8749 }
8751 /* Handle a "no_limit_stack" attribute; arguments as in
8752 struct attribute_spec.handler. */
8754 static tree
8759 {
8763 {
8767 }
8769 {
8773 }
8774 else
8778 }
8780 /* Handle a "pure" attribute; arguments as in
8781 struct attribute_spec.handler. */
8783 static tree
8786 {
8789 /* ??? TODO: Support types. */
8790 else
8791 {
8794 }
8797 }
8799 /* Digest an attribute list destined for a transactional memory statement.
8800 ALLOWED is the set of attributes that are allowed for this statement;
8801 return the attribute we parsed. Multiple attributes are never allowed. */
8803 int
8805 {
8810 {
8818 {
8821 }
8824 {
8827 }
8830 else
8832 }
8835 }
8837 /* Transform a TM attribute name into a maskable integer and back.
8838 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8839 to how the lack of an attribute is treated. */
8841 int
8843 {
8857 }
8859 tree
8861 {
8864 {
8882 }
8884 }
8886 /* Return the first TM attribute seen in LIST. */
8888 tree
8890 {
8892 {
8896 }
8898 }
8900 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8901 Here we accept only function types, and verify that none of the other
8902 function TM attributes are also applied. */
8903 /* ??? We need to accept class types for C++, but not C. This greatly
8904 complicates this function, since we can no longer rely on the extra
8905 processing given by function_type_required. */
8907 static tree
8910 {
8911 /* Only one path adds the attribute; others don't. */
8915 {
8918 /* Only tm_callable and tm_safe apply to classes. */
8921 /* FALLTHRU */
8925 {
8928 ;
8931 else
8933 }
8937 {
8938 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8939 want to set transaction_safe on the type. */
8943 "%<transaction_safe_dynamic%> may only be specified for "
8948 NULL_TREE),
8951 }
8954 {
8957 {
8962 }
8963 }
8964 /* FALLTHRU */
8967 /* If a function is next, pass it on to be tried next. */
8971 ignored:
8974 }
8977 }
8979 /* Handle the TM_WRAP attribute; arguments as in
8980 struct attribute_spec.handler. */
8982 static tree
8985 {
8988 /* We don't need the attribute even on success, since we
8989 record the entry in an external table. */
8994 else
8995 {
8998 ;
9002 else
9003 {
9007 {
9011 else
9013 }
9014 else
9016 }
9017 }
9020 }
9022 /* Ignore the given attribute. Used when this attribute may be usefully
9023 overridden by the target, but is not used generically. */
9025 static tree
9029 {
9032 }
9034 /* Handle a "no vops" attribute; arguments as in
9035 struct attribute_spec.handler. */
9037 static tree
9041 {
9045 }
9047 /* Handle a "deprecated" attribute; arguments as in
9048 struct attribute_spec.handler. */
9050 static tree
9054 {
9062 {
9065 }
9068 {
9079 else
9081 }
9083 {
9088 }
9089 else
9093 {
9096 {
9102 }
9105 else
9107 }
9110 }
9112 /* Handle a "vector_size" attribute; arguments as in
9113 struct attribute_spec.handler. */
9115 static tree
9119 {
9121 machine_mode orig_mode;
9132 {
9135 }
9137 /* Get the vector size (in bytes). */
9140 /* We need to provide for vector pointers, vector arrays, and
9141 functions returning vectors. For example:
9143 __attribute__((vector_size(16))) short *foo;
9145 In this case, the mode is SI, but the type being modified is
9146 HI, so we need to look further. */
9155 /* Get the mode of the type being modified. */
9166 {
9169 }
9172 {
9175 }
9178 {
9181 }
9183 /* Calculate how many units fit in the vector. */
9186 {
9189 }
9193 /* Build back pointers if needed. */
9197 }
9199 /* Handle the "nonnull" attribute. */
9200 static tree
9204 {
9208 /* If no arguments are specified, all pointer arguments should be
9209 non-null. Verify a full prototype is given so that the arguments
9210 will have the correct types when we actually check them later.
9211 Avoid diagnosing type-generic built-ins since those have no
9212 prototype. */
9214 {
9218 {
9221 }
9223 }
9225 /* Argument list specified. Verify that each argument number references
9226 a pointer argument. */
9228 {
9237 {
9242 }
9245 {
9246 function_args_iterator iter;
9247 tree argument;
9251 {
9255 }
9259 {
9264 }
9267 {
9272 }
9273 }
9274 }
9277 }
9279 /* Check the argument list of a function call for null in argument slots
9280 that are marked as requiring a non-null pointer argument. The NARGS
9281 arguments are passed in the array ARGARRAY. */
9283 static void
9285 {
9286 tree a;
9294 /* See if any of the nonnull attributes has no arguments. If so,
9295 then every pointer argument is checked (in which case the check
9296 for pointer type is done in check_nonnull_arg). */
9298 do
9306 else
9307 {
9308 /* Walk the argument list. If we encounter an argument number we
9309 should check for non-null, do it. */
9311 {
9313 {
9317 }
9322 }
9323 }
9324 }
9326 /* Check that the Nth argument of a function call (counting backwards
9327 from the end) is a (pointer)0. The NARGS arguments are passed in the
9328 array ARGARRAY. */
9330 static void
9332 {
9336 {
9339 tree sentinel;
9340 function_args_iterator iter;
9341 tree t;
9343 /* Skip over the named arguments. */
9345 {
9348 len++;
9349 }
9352 {
9355 }
9357 /* The sentinel must be one of the varargs, i.e.
9358 in position >= the number of fixed arguments. */
9360 {
9364 }
9366 /* Validate the sentinel. */
9370 /* Although __null (in C++) is only an integer we allow it
9371 nevertheless, as we are guaranteed that it's exactly
9372 as wide as a pointer, and we don't want to force
9373 users to cast the NULL they have written there.
9374 We warn with -Wstrict-null-sentinel, though. */
9377 }
9378 }
9380 /* Helper for check_function_nonnull; given a list of operands which
9381 must be non-null in ARGS, determine if operand PARAM_NUM should be
9382 checked. */
9384 static bool
9386 {
9390 {
9397 }
9399 }
9401 /* Check that the function argument PARAM (which is operand number
9402 PARAM_NUM) is non-null. This is called by check_function_nonnull
9403 via check_function_arguments_recurse. */
9405 static void
9407 {
9410 /* Just skip checking the argument if it's not a pointer. This can
9411 happen if the "nonnull" attribute was given without an operand
9412 list (which means to check every pointer argument). */
9420 }
9422 /* Helper for nonnull attribute handling; fetch the operand number
9423 from the attribute argument list. */
9425 static bool
9427 {
9428 /* Verify the arg number is a small constant. */
9430 {
9433 }
9434 else
9436 }
9438 /* Handle a "nothrow" attribute; arguments as in
9439 struct attribute_spec.handler. */
9441 static tree
9444 {
9447 /* ??? TODO: Support types. */
9448 else
9449 {
9452 }
9455 }
9457 /* Handle a "cleanup" attribute; arguments as in
9458 struct attribute_spec.handler. */
9460 static tree
9463 {
9467 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9468 for global destructors in C++. This requires infrastructure that
9469 we don't have generically at the moment. It's also not a feature
9470 we'd be missing too much, since we do have attribute constructor. */
9472 {
9476 }
9478 /* Verify that the argument is a function in scope. */
9479 /* ??? We could support pointers to functions here as well, if
9480 that was considered desirable. */
9483 {
9487 }
9490 {
9494 }
9496 /* That the function has proper type is checked with the
9497 eventual call to build_function_call. */
9500 }
9502 /* Handle a "warn_unused_result" attribute. No special handling. */
9504 static tree
9508 {
9509 /* Ignore the attribute for functions not returning any value. */
9511 {
9514 }
9517 }
9519 /* Handle a "sentinel" attribute. */
9521 static tree
9524 {
9526 {
9530 }
9531 else
9532 {
9534 {
9538 }
9539 }
9542 {
9550 {
9554 }
9555 else
9556 {
9558 {
9562 }
9563 }
9564 }
9567 }
9569 /* Handle a "type_generic" attribute. */
9571 static tree
9575 {
9576 /* Ensure we have a function type. */
9579 /* Ensure we have a variadic function. */
9583 }
9585 /* Handle a "target" attribute. */
9587 static tree
9590 {
9591 /* Ensure we have a function type. */
9593 {
9596 }
9598 {
9602 }
9604 flags))
9608 }
9610 /* Handle a "target_clones" attribute. */
9612 static tree
9615 {
9616 /* Ensure we have a function type. */
9618 {
9620 {
9624 }
9626 {
9630 }
9631 else
9632 /* Do not inline functions with multiple clone targets. */
9634 }
9635 else
9636 {
9639 }
9641 }
9643 /* Arguments being collected for optimization. */
9648 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9649 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9650 false for #pragma GCC optimize. */
9652 bool
9654 {
9661 tree ap;
9663 /* Build up argv vector. Just in case the string is stored away, use garbage
9664 collected strings. */
9669 {
9673 {
9677 }
9680 {
9681 /* Split string into multiple substrings. */
9689 {
9696 {
9700 }
9701 else
9702 {
9705 }
9709 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9710 options. */
9712 {
9717 else
9721 }
9724 {
9727 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9728 itself is -Os, and any other switch begins with a -f. */
9734 }
9739 }
9741 }
9742 }
9750 /* Now parse the options. */
9754 /* Drop non-Optimization options. */
9757 {
9759 {
9765 else
9770 }
9773 j++;
9774 }
9776 /* And apply them. */
9785 }
9787 /* For handling "optimize" attribute. arguments as in
9788 struct attribute_spec.handler. */
9790 static tree
9793 {
9794 /* Ensure we have a function type. */
9796 {
9799 }
9800 else
9801 {
9805 /* Save current options. */
9808 /* If we previously had some optimization options, use them as the
9809 default. */
9814 /* Parse options, and update the vector. */
9819 /* Restore current options. */
9821 }
9824 }
9826 /* Handle a "no_split_stack" attribute. */
9828 static tree
9833 {
9837 {
9841 }
9843 {
9847 }
9850 }
9852 /* Handle a "returns_nonnull" attribute; arguments as in
9853 struct attribute_spec.handler. */
9855 static tree
9858 {
9859 // Even without a prototype we still have a return type we can check.
9861 {
9864 }
9866 }
9868 /* Handle a "designated_init" attribute; arguments as in
9869 struct attribute_spec.handler. */
9871 static tree
9874 {
9876 {
9879 }
9881 }
9884 /* Handle a "fallthrough" attribute; arguments as in struct
9885 attribute_spec.handler. */
9887 static tree
9890 {
9894 }
9896 /* Check whether ATTR is a valid attribute fallthrough. */
9898 bool
9900 {
9904 /* This attribute shall appear at most once in each attribute-list. */
9908 /* No attribute-argument-clause shall be present. */
9912 /* Warn if other attributes are found. */
9914 {
9918 }
9920 }
9922 \f
9923 /* Check for valid arguments being passed to a function with FNTYPE.
9924 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9925 diagnostics. */
9926 void
9929 {
9930 /* Check for null being passed in a pointer argument that must be
9931 non-null. We also need to do this if format checking is enabled. */
9936 /* Check for errors in format strings. */
9943 }
9945 /* Generic argument checking recursion routine. PARAM is the argument to
9946 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9947 once the argument is resolved. CTX is context for the callback. */
9948 void
9953 {
9957 {
9958 /* Strip coercion. */
9962 }
9965 {
9967 tree attrs;
9970 /* See if this is a call to a known internationalization function
9971 that modifies a format arg. Such a function may have multiple
9972 format_arg attributes (for example, ngettext). */
9975 attrs;
9978 {
9979 tree inner_arg;
9980 tree format_num_expr;
9983 call_expr_arg_iterator iter;
9985 /* Extract the argument number, which was previously checked
9986 to be valid. */
9995 {
10000 }
10001 }
10003 /* If we found a format_arg attribute and did a recursive check,
10004 we are done with checking this argument. Otherwise, we continue
10005 and this will be considered a non-literal. */
10008 }
10011 {
10012 /* Simplify to avoid warning for an impossible case. */
10015 {
10016 /* Check both halves of the conditional expression. */
10019 param_num);
10022 param_num);
10024 }
10025 }
10028 }
10030 /* Checks for a builtin function FNDECL that the number of arguments
10031 NARGS against the required number REQUIRED and issues an error if
10032 there is a mismatch. Returns true if the number of arguments is
10033 correct, otherwise false. LOC is the location of FNDECL. */
10035 static bool
10038 {
10040 {
10043 }
10045 {
10048 }
10050 }
10052 /* Helper macro for check_builtin_function_arguments. */
10053 #define ARG_LOCATION(N) \
10054 (arg_loc.is_empty () \
10055 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
10056 : expansion_point_location (arg_loc[(N)]))
10058 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
10059 Returns false if there was an error, otherwise true. LOC is the
10060 location of the function; ARG_LOC is a vector of locations of the
10061 arguments. */
10063 bool
10066 {
10072 {
10074 {
10075 /* Get the requested alignment (in bits) if it's a constant
10076 integer expression. */
10077 unsigned HOST_WIDE_INT align
10080 /* Determine if the requested alignment is a power of 2. */
10084 /* The maximum alignment in bits corresponding to the same
10085 maximum in bytes enforced in check_user_alignment(). */
10088 /* Reject invalid alignments. */
10090 {
10092 "second argument to function %qE must be a constant "
10096 }
10098 }
10110 {
10112 {
10116 }
10118 }
10128 {
10135 {
10139 }
10141 }
10146 {
10149 {
10153 }
10156 {
10160 }
10162 }
10167 {
10169 {
10173 }
10175 }
10182 {
10186 {
10190 }
10193 {
10197 }
10199 {
10203 }
10205 {
10209 }
10211 }
10218 {
10222 {
10226 }
10228 {
10232 }
10234 {
10238 }
10240 }
10245 }
10246 }
10248 /* Function to help qsort sort FIELD_DECLs by name order. */
10250 int
10252 {
10257 /* A nontype is "greater" than a type. */
10266 }
10269 gt_pointer_operator new_value;
10273 /* This routine compares two fields like field_decl_cmp but using the
10274 pointer operator in resort_data. */
10276 static int
10278 {
10283 /* A nontype is "greater" than a type. */
10289 {
10296 }
10298 }
10300 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10302 void
10305 gt_pointer_operator new_value,
10307 {
10312 resort_field_decl_cmp);
10313 }
10315 /* Subroutine of c_parse_error.
10316 Return the result of concatenating LHS and RHS. RHS is really
10317 a string literal, its first character is indicated by RHS_START and
10318 RHS_SIZE is its length (including the terminating NUL character).
10320 The caller is responsible for deleting the returned pointer. */
10324 {
10330 }
10332 /* Issue the error given by GMSGID, indicating that it occurred before
10333 TOKEN, which had the associated VALUE. */
10335 void
10338 {
10339 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10350 {
10355 {
10371 }
10375 else
10381 }
10404 {
10409 }
10417 {
10422 }
10423 else
10427 {
10430 }
10431 #undef catenate_messages
10432 }
10434 /* Return the gcc option code associated with the reason for a cpp
10435 message, or 0 if none. */
10437 static int
10439 {
10443 {
10446 }
10448 }
10450 /* Callback from cpp_error for PFILE to print diagnostics from the
10451 preprocessor. The diagnostic is of type LEVEL, with REASON set
10452 to the reason code if LEVEL is represents a warning, at location
10453 RICHLOC unless this is after lexing and the compiler's location
10454 should be used instead; MSG is the translated message and AP
10455 the arguments. Returns true if a diagnostic was emitted, false
10456 otherwise. */
10458 bool
10462 {
10463 diagnostic_info diagnostic;
10464 diagnostic_t dlevel;
10469 {
10474 /* Fall through. */
10499 }
10510 }
10512 /* Convert a character from the host to the target execution character
10513 set. cpplib handles this, mostly. */
10515 HOST_WIDE_INT
10517 {
10518 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10519 zero-extended under -fno-signed-char. cpplib insists that characters
10520 and character constants are always unsigned. Hence we must convert
10521 back and forth. */
10529 else
10531 }
10533 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10534 references with an INDIRECT_REF of a constant at the bottom; much like the
10535 traditional rendering of offsetof as a macro. Return the folded result. */
10537 tree
10539 {
10543 {
10559 {
10562 }
10572 {
10576 }
10589 /* Check if the offset goes beyond the upper bound of the array. */
10591 {
10597 {
10602 {
10603 tree v;
10610 {
10618 }
10619 /* Don't warn if the array might be considered a poor
10620 man's flexible array member with a very permissive
10621 definition thereof. */
10625 "index %E denotes an offset "
10628 }
10629 }
10630 }
10637 /* Handle static members of volatile structs. */
10644 }
10647 }
10649 /* Likewise, but convert it to the return type of offsetof. */
10651 tree
10653 {
10655 }
10657 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10658 expression, because B will always be true. */
10660 void
10662 {
10663 /* In C++ template declarations it can happen that the type is dependent
10664 and not yet known, thus TREE_TYPE (cond) == NULL_TREE. */
10669 "the omitted middle operand in ?: will always be %<true%>, "
10671 }
10673 /* Give an error for storing into ARG, which is 'const'. USE indicates
10674 how ARG was being used. */
10676 void
10678 {
10681 /* Using this macro rather than (for example) arrays of messages
10682 ensures that all the format strings are checked at compile
10683 time. */
10684 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10685 : (use == lv_increment ? (I) \
10686 : (use == lv_decrement ? (D) : (AS))))
10688 {
10699 else
10705 }
10711 arg);
10717 arg);
10719 {
10729 arg);
10730 }
10736 arg);
10737 else
10742 arg);
10743 }
10745 /* Print an error message for an invalid lvalue. USE says
10746 how the lvalue is being used and so selects the error message. LOC
10747 is the location for the error. */
10749 void
10751 {
10753 {
10771 }
10772 }
10774 /* Print an error message for an invalid indirection of type TYPE.
10775 ERRSTRING is the name of the operator for the indirection. */
10777 void
10779 {
10781 {
10789 type);
10794 type);
10799 type);
10804 type);
10809 type);
10813 }
10814 }
10815 \f
10816 /* *PTYPE is an incomplete array. Complete it with a domain based on
10817 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10818 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10819 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10821 int
10823 {
10831 {
10833 {
10834 int eltsize
10837 }
10839 {
10843 {
10847 }
10848 else
10849 {
10850 tree curindex;
10861 {
10865 else
10866 {
10868 {
10869 /* Since we treat size types now as ordinary
10870 unsigned types, we need an explicit overflow
10871 check. */
10875 }
10877 size_one_node);
10878 }
10881 }
10883 {
10887 }
10888 }
10889 }
10890 else
10891 {
10892 /* Make an error message unless that happened already. */
10895 }
10896 }
10897 else
10898 {
10902 }
10909 else
10912 /* Using build_distinct_type_copy and modifying things afterward instead
10913 of using build_array_type to create a new type preserves all of the
10914 TYPE_LANG_FLAG_? bits that the front end may have set. */
10922 /* Make sure we have the canonical MAIN_TYPE. */
10925 hashcode);
10928 /* Fix the canonical type. */
10938 else
10943 else
10949 {
10951 /* If we proceed with the array type as it is, we'll eventually
10952 crash in tree_to_[su]hwi(). */
10954 }
10958 }
10960 /* Like c_mark_addressable but don't check register qualifier. */
10961 void
10963 {
10971 }
10974 \f
10975 /* Used to help initialize the builtin-types.def table. When a type of
10976 the correct size doesn't exist, use error_mark_node instead of NULL.
10977 The later results in segfaults even when a decl using the type doesn't
10978 get invoked. */
10980 tree
10982 {
10985 }
10987 /* A helper function for resolve_overloaded_builtin in resolving the
10988 overloaded __sync_ builtins. Returns a positive power of 2 if the
10989 first operand of PARAMS is a pointer to a supported data type.
10990 Returns 0 if an error is encountered.
10991 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10992 built-ins. */
10994 static int
10996 {
10997 /* Type of the argument. */
10998 tree argtype;
10999 /* Type the argument points to. */
11000 tree type;
11004 {
11007 }
11011 {
11012 /* Force array-to-pointer decay for C++. */
11016 }
11031 incompatible:
11032 /* Issue the diagnostic only if the argument is valid, otherwise
11033 it would be redundant at best and could be misleading. */
11038 }
11040 /* A helper function for resolve_overloaded_builtin. Adds casts to
11041 PARAMS to make arguments match up with those of FUNCTION. Drops
11042 the variadic arguments at the end. Returns false if some error
11043 was encountered; true on success. */
11045 static bool
11048 {
11049 function_args_iterator iter;
11050 tree ptype;
11054 /* We've declared the implementation functions to use "volatile void *"
11055 as the pointer parameter, so we shouldn't get any complaints from the
11056 call to check_function_arguments what ever type the user used. */
11061 /* For the rest of the values, we need to cast these to FTYPE, so that we
11062 don't get warnings for passing pointer types, etc. */
11065 {
11069 /* XXX void_type_node belies the abstraction. */
11075 {
11078 }
11080 /* Only convert parameters if arg_type is unsigned integer type with
11081 new format sync routines, i.e. don't attempt to convert pointer
11082 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
11083 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
11084 kinds). */
11086 {
11087 /* Ideally for the first conversion we'd use convert_for_assignment
11088 so that we get warnings for anything that doesn't match the pointer
11089 type. This isn't portable across the C and C++ front ends atm. */
11094 }
11097 }
11099 /* __atomic routines are not variadic. */
11101 {
11104 }
11106 /* The definition of these primitives is variadic, with the remaining
11107 being "an optional list of variables protected by the memory barrier".
11108 No clue what that's supposed to mean, precisely, but we consider all
11109 call-clobbered variables to be protected so we're safe. */
11113 }
11115 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11116 RESULT to make it match the type of the first pointer argument in
11117 PARAMS. */
11119 static tree
11121 {
11126 /* New format doesn't require casting unless the types are the same size. */
11129 else
11131 }
11133 /* This function verifies the PARAMS to generic atomic FUNCTION.
11134 It returns the size if all the parameters are the same size, otherwise
11135 0 is returned if the parameters are invalid. */
11137 static int
11140 {
11145 tree type_0;
11147 /* Determine the parameter makeup. */
11149 {
11165 }
11168 {
11171 }
11173 /* Get type of first parameter, and determine its size. */
11176 {
11177 /* Force array-to-pointer decay for C++. */
11181 }
11183 {
11185 function);
11187 }
11189 /* Types must be compile time constant sizes. */
11191 {
11194 function);
11196 }
11200 /* Zero size objects are not allowed. */
11202 {
11205 function);
11207 }
11209 /* Check each other parameter is a pointer and the same size. */
11211 {
11214 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11218 {
11220 function);
11222 }
11226 {
11230 }
11232 {
11236 }
11240 {
11242 function);
11244 }
11245 }
11247 /* Check memory model parameters for validity. */
11249 {
11252 {
11255 {
11258 function);
11259 }
11260 }
11261 else
11263 {
11265 function);
11267 }
11268 }
11271 }
11274 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11275 at the beginning of the parameter list PARAMS representing the size of the
11276 objects. This is to match the library ABI requirement. LOC is the location
11277 of the function call.
11278 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11279 returned to allow the external call to be constructed. */
11281 static tree
11284 {
11285 tree size_node;
11287 /* Insert a SIZE_T parameter as the first param. If there isn't
11288 enough space, allocate a new vector and recursively re-build with that. */
11290 {
11293 tree f;
11303 }
11305 /* Add the size parameter and leave as a function call for processing. */
11309 }
11312 /* Return whether atomic operations for naturally aligned N-byte
11313 arguments are supported, whether inline or through libatomic. */
11314 static bool
11316 {
11318 {
11330 }
11331 }
11333 /* This will process an __atomic_exchange function call, determine whether it
11334 needs to be mapped to the _N variation, or turned into a library call.
11335 LOC is the location of the builtin call.
11336 FUNCTION is the DECL that has been invoked;
11337 PARAMS is the argument list for the call. The return value is non-null
11338 TRUE is returned if it is translated into the proper format for a call to the
11339 external library, and NEW_RETURN is set the tree for that function.
11340 FALSE is returned if processing for the _N variation is required, and
11341 NEW_RETURN is set to the return value the result is copied into. */
11342 static bool
11345 {
11350 /* Size of 0 is an error condition. */
11352 {
11355 }
11357 /* If not a lock-free size, change to the library generic format. */
11359 {
11362 }
11364 /* Otherwise there is a lockfree match, transform the call from:
11365 void fn(T* mem, T* desired, T* return, model)
11366 into
11367 *return = (T) (fn (In* mem, (In) *desired, model)) */
11374 /* Create pointer to appropriate size. */
11378 /* Convert object pointer to required type. */
11381 /* Convert new value to required type, and dereference it. */
11386 /* Move memory model to the 3rd position, and end param list. */
11390 /* Convert return pointer and dereference it for later assignment. */
11394 }
11397 /* This will process an __atomic_compare_exchange function call, determine
11398 whether it needs to be mapped to the _N variation, or turned into a lib call.
11399 LOC is the location of the builtin call.
11400 FUNCTION is the DECL that has been invoked;
11401 PARAMS is the argument list for the call. The return value is non-null
11402 TRUE is returned if it is translated into the proper format for a call to the
11403 external library, and NEW_RETURN is set the tree for that function.
11404 FALSE is returned if processing for the _N variation is required. */
11406 static bool
11410 {
11415 /* Size of 0 is an error condition. */
11417 {
11420 }
11422 /* If not a lock-free size, change to the library generic format. */
11424 {
11425 /* The library generic format does not have the weak parameter, so
11426 remove it from the param list. Since a parameter has been removed,
11427 we can be sure that there is room for the SIZE_T parameter, meaning
11428 there will not be a recursive rebuilding of the parameter list, so
11429 there is no danger this will be done twice. */
11431 {
11435 }
11438 }
11440 /* Otherwise, there is a match, so the call needs to be transformed from:
11441 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11442 into
11443 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11449 /* Create pointer to appropriate size. */
11453 /* Convert object pointer to required type. */
11457 /* Convert expected pointer to required type. */
11461 /* Convert desired value to required type, and dereference it. */
11466 /* The rest of the parameters are fine. NULL means no special return value
11467 processing.*/
11470 }
11473 /* This will process an __atomic_load function call, determine whether it
11474 needs to be mapped to the _N variation, or turned into a library call.
11475 LOC is the location of the builtin call.
11476 FUNCTION is the DECL that has been invoked;
11477 PARAMS is the argument list for the call. The return value is non-null
11478 TRUE is returned if it is translated into the proper format for a call to the
11479 external library, and NEW_RETURN is set the tree for that function.
11480 FALSE is returned if processing for the _N variation is required, and
11481 NEW_RETURN is set to the return value the result is copied into. */
11483 static bool
11486 {
11491 /* Size of 0 is an error condition. */
11493 {
11496 }
11498 /* If not a lock-free size, change to the library generic format. */
11500 {
11503 }
11505 /* Otherwise, there is a match, so the call needs to be transformed from:
11506 void fn(T* mem, T* return, model)
11507 into
11508 *return = (T) (fn ((In *) mem, model)) */
11514 /* Create pointer to appropriate size. */
11518 /* Convert object pointer to required type. */
11522 /* Move memory model to the 2nd position, and end param list. */
11526 /* Convert return pointer and dereference it for later assignment. */
11530 }
11533 /* This will process an __atomic_store function call, determine whether it
11534 needs to be mapped to the _N variation, or turned into a library call.
11535 LOC is the location of the builtin call.
11536 FUNCTION is the DECL that has been invoked;
11537 PARAMS is the argument list for the call. The return value is non-null
11538 TRUE is returned if it is translated into the proper format for a call to the
11539 external library, and NEW_RETURN is set the tree for that function.
11540 FALSE is returned if processing for the _N variation is required, and
11541 NEW_RETURN is set to the return value the result is copied into. */
11543 static bool
11546 {
11551 /* Size of 0 is an error condition. */
11553 {
11556 }
11558 /* If not a lock-free size, change to the library generic format. */
11560 {
11563 }
11565 /* Otherwise, there is a match, so the call needs to be transformed from:
11566 void fn(T* mem, T* value, model)
11567 into
11568 fn ((In *) mem, (In) *value, model) */
11573 /* Create pointer to appropriate size. */
11577 /* Convert object pointer to required type. */
11581 /* Convert new value to required type, and dereference it. */
11586 /* The memory model is in the right spot already. Return is void. */
11590 }
11593 /* Some builtin functions are placeholders for other expressions. This
11594 function should be called immediately after parsing the call expression
11595 before surrounding code has committed to the type of the expression.
11597 LOC is the location of the builtin call.
11599 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11600 PARAMS is the argument list for the call. The return value is non-null
11601 when expansion is complete, and null if normal processing should
11602 continue. */
11604 tree
11607 {
11610 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11611 Those are not valid to call with a pointer to _Bool (or C++ bool)
11612 and so must be rejected. */
11618 {
11624 else
11628 }
11630 /* Handle BUILT_IN_NORMAL here. */
11632 {
11637 {
11638 /* Handle these 4 together so that they can fall through to the next
11639 case if the call is transformed to an _N variant. */
11641 {
11643 {
11647 /* Change to the _N variant. */
11650 }
11653 {
11655 params,
11658 /* Change to the _N variant. */
11661 }
11663 {
11667 /* Change to the _N variant. */
11670 }
11672 {
11676 /* Change to the _N variant. */
11679 }
11682 }
11683 }
11684 /* FALLTHRU */
11690 /* FALLTHRU */
11704 /* FALLTHRU */
11721 {
11722 /* The following are not _FETCH_OPs and must be accepted with
11723 pointers to _Bool (or C++ bool). */
11725 fetch_op =
11741 orig_format))
11746 NULL);
11756 /* Prevent -Wunused-value warning. */
11759 /* If new_return is set, assign function to that expr and cast the
11760 result to void since the generic interface returned void. */
11762 {
11763 /* Cast function result from I{1,2,4,8,16} to the required type. */
11766 result);
11770 }
11772 }
11776 }
11777 }
11779 /* vector_types_compatible_elements_p is used in type checks of vectors
11780 values used as operands of binary operators. Where it returns true, and
11781 the other checks of the caller succeed (being vector types in he first
11782 place, and matching number of elements), we can just treat the types
11783 as essentially the same.
11784 Contrast with vector_targets_convertible_p, which is used for vector
11785 pointer types, and vector_types_convertible_p, which will allow
11786 language-specific matches under the control of flag_lax_vector_conversions,
11787 and might still require a conversion. */
11788 /* True if vector types T1 and T2 can be inputs to the same binary
11789 operator without conversion.
11790 We don't check the overall vector size here because some of our callers
11791 want to give different error messages when the vectors are compatible
11792 except for the element count. */
11794 bool
11796 {
11809 /* Equality works here because c_common_signed_type uses
11810 TYPE_MAIN_VARIANT. */
11818 }
11820 /* Check for missing format attributes on function pointers. LTYPE is
11821 the new type or left-hand side type. RTYPE is the old type or
11822 right-hand side type. Returns TRUE if LTYPE is missing the desired
11823 attribute. */
11825 bool
11827 {
11829 tree ra;
11835 {
11836 tree la;
11841 }
11842 else
11844 }
11846 /* Subscripting with type char is likely to lose on a machine where
11847 chars are signed. So warn on any machine, but optionally. Don't
11848 warn for unsigned char since that type is safe. Don't warn for
11849 signed char because anyone who uses that must have done so
11850 deliberately. Furthermore, we reduce the false positive load by
11851 warning only for non-constant value of type char. */
11853 void
11855 {
11860 }
11862 /* Implement -Wparentheses for the unexpected C precedence rules, to
11863 cover cases like x + y << z which readers are likely to
11864 misinterpret. We have seen an expression in which CODE is a binary
11865 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11866 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11867 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11868 expression was not formed using a binary or unary operator, or it
11869 was enclosed in parentheses. */
11871 void
11875 {
11879 /* This macro tests that the expression ARG with original tree code
11880 CODE appears to be a boolean expression. or the result of folding a
11881 boolean expression. */
11882 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11883 (truth_value_p (TREE_CODE (ARG)) \
11884 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11886 || ((CODE) != INTEGER_CST \
11887 && (integer_onep (ARG) || integer_zerop (ARG))))
11890 {
11939 /* Check cases like x|y==z */
11946 /* Check cases like !x | y */
11950 "suggest parentheses around operand of "
11963 /* Check cases like x^y==z */
11985 /* Check cases like x&y==z */
11992 /* Check cases like !x & y */
11996 "suggest parentheses around operand of "
12019 {
12024 "comparisons like %<X<=Y<=Z%> do not "
12030 "comparisons like %<X<=Y<=Z%> do not "
12032 }
12034 }
12035 #undef NOT_A_BOOLEAN_EXPR_P
12036 }
12038 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
12040 void
12042 {
12044 {
12047 else
12049 }
12050 }
12052 /* Warn for division by zero according to the value of DIVISOR. LOC
12053 is the location of the division operator. */
12055 void
12057 {
12058 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
12059 about division by zero. Do not issue a warning if DIVISOR has a
12060 floating-point type, since we consider 0.0/0.0 a valid way of
12061 generating a NaN. */
12065 }
12067 /* Warn for patterns where memset appears to be used incorrectly. The
12068 warning location should be LOC. ARG0, and ARG2 are the first and
12069 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
12070 each argument that was a literal zero. */
12072 void
12075 {
12081 "%<memset%> used with constant zero length "
12082 "parameter; this could be due to transposed "
12086 {
12092 {
12101 arg2,
12104 "%<memset%> used with length equal to "
12105 "number of elements without multiplication "
12107 }
12108 }
12109 }
12111 /* Subroutine of build_binary_op. Give warnings for comparisons
12112 between signed and unsigned quantities that may fail. Do the
12113 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
12114 so that casts will be considered, but default promotions won't
12115 be.
12117 LOCATION is the location of the comparison operator.
12119 The arguments of this function map directly to local variables
12120 of build_binary_op. */
12122 void
12127 {
12132 /* In C++, check for comparison of different enum types. */
12138 {
12142 }
12144 /* Do not warn if the comparison is being done in a signed type,
12145 since the signed type will only be chosen if it can represent
12146 all the values of the unsigned type. */
12149 /* Do not warn if both operands are unsigned. */
12152 else
12153 {
12159 else
12167 /* Do not warn if the signed quantity is an unsuffixed integer
12168 literal (or some static constant expression involving such
12169 literals or a conditional expression involving such literals)
12170 and it is non-negative. */
12173 /* Do not warn if the comparison is an equality operation, the
12174 unsigned quantity is an integral constant, and it would fit
12175 in the result if the result were signed. */
12180 /* In C, do not warn if the unsigned quantity is an enumeration
12181 constant and its maximum value would fit in the result if the
12182 result were signed. */
12188 else
12190 OPT_Wsign_compare,
12192 }
12194 /* Warn if two unsigned values are being compared in a size larger
12195 than their original size, and one (and only one) is the result of
12196 a `~' operator. This comparison will always fail.
12198 Also warn if one operand is a constant, and the constant does not
12199 have all bits set that are set in the ~ operand when it is
12200 extended. */
12207 {
12214 {
12215 tree primop;
12221 {
12225 }
12226 else
12227 {
12231 }
12236 {
12239 {
12243 else
12246 }
12247 }
12248 }
12256 }
12257 }
12259 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12260 type via c_common_type. If -Wdouble-promotion is in use, and the
12261 conditions for warning have been met, issue a warning. GMSGID is
12262 the warning message. It must have two %T specifiers for the type
12263 that was converted (generally "float") and the type to which it was
12264 converted (generally "double), respectively. LOC is the location
12265 to which the awrning should refer. */
12267 void
12270 {
12271 tree source_type;
12275 /* If the conversion will not occur at run-time, there is no need to
12276 warn about it. */
12288 else
12291 }
12293 /* Possibly warn about unused parameters. */
12295 void
12297 {
12298 tree decl;
12307 }
12310 /* Setup a TYPE_DECL node as a typedef representation.
12312 X is a TYPE_DECL for a typedef statement. Create a brand new
12313 ..._TYPE node (which will be just a variant of the existing
12314 ..._TYPE node with identical properties) and then install X
12315 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12317 The whole point here is to end up with a situation where each
12318 and every ..._TYPE node the compiler creates will be uniquely
12319 associated with AT MOST one node representing a typedef name.
12320 This way, even though the compiler substitutes corresponding
12321 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12322 early on, later parts of the compiler can always do the reverse
12323 translation and get back the corresponding typedef name. For
12324 example, given:
12326 typedef struct S MY_TYPE;
12327 MY_TYPE object;
12329 Later parts of the compiler might only know that `object' was of
12330 type `struct S' if it were not for code just below. With this
12331 code however, later parts of the compiler see something like:
12333 struct S' == struct S
12334 typedef struct S' MY_TYPE;
12335 struct S' object;
12337 And they can then deduce (from the node for type struct S') that
12338 the original object declaration was:
12340 MY_TYPE object;
12342 Being able to do this is important for proper support of protoize,
12343 and also for generating precise symbolic debugging information
12344 which takes full account of the programmer's (typedef) vocabulary.
12346 Obviously, we don't want to generate a duplicate ..._TYPE node if
12347 the TYPE_DECL node that we are now processing really represents a
12348 standard built-in type. */
12350 void
12352 {
12356 {
12359 }
12362 {
12370 }
12371 }
12373 /* Record the types used by the current global variable declaration
12374 being parsed, so that we can decide later to emit their debug info.
12375 Those types are in types_used_by_cur_var_decl, and we are going to
12376 store them in the types_used_by_vars_hash hash table.
12377 DECL is the declaration of the global variable that has been parsed. */
12379 void
12381 {
12385 {
12388 }
12389 }
12391 /* If DECL is a typedef that is declared in the current function,
12392 record it for the purpose of -Wunused-local-typedefs. */
12394 void
12396 {
12401 /* if this is not a locally defined typedef then we are not
12402 interested. */
12409 }
12411 /* If T is a TYPE_DECL declared locally, mark it as used. */
12413 void
12415 {
12420 }
12422 /* Warn if there are some unused locally defined typedefs in the
12423 current function. */
12425 void
12427 {
12429 tree decl;
12430 /* The number of times we have emitted -Wunused-local-typedefs
12431 warnings. If this is different from errorcount, that means some
12432 unrelated errors have been issued. In which case, we'll avoid
12433 emitting "unused-local-typedefs" warnings. */
12445 {
12449 OPT_Wunused_local_typedefs,
12452 }
12455 }
12457 /* Warn about boolean expression compared with an integer value different
12458 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12459 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12460 are the operands of the comparison. The caller must ensure that
12461 either operand is a boolean expression. */
12463 void
12465 tree op1)
12466 {
12477 else
12481 {
12489 else
12492 }
12494 {
12495 /* If the non-constant operand isn't of a boolean type, we
12496 don't want to warn here. */
12498 /* Handle booleans promoted to integers. */
12504 /* Do some magic to get the right diagnostics. */
12513 }
12514 }
12516 /* Warn if signed left shift overflows. We don't warn
12517 about left-shifting 1 into the sign bit in C++14; cf.
12518 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12519 LOC is a location of the shift; OP0 and OP1 are the operands.
12520 Return true if an overflow is detected, false otherwise. */
12522 bool
12524 {
12532 /* Left-hand operand must be signed. */
12538 /* Handle the case of left-shifting 1 into the sign bit.
12539 * However, shifting 1 _out_ of the sign bit, as in
12540 * INT_MIN << 1, is considered an overflow.
12541 */
12543 {
12544 /* Never warn for C++14 onwards. */
12547 /* Otherwise only if -Wshift-overflow=2. But return
12548 true to signal an overflow for the sake of integer
12549 constant expressions. */
12552 }
12557 "result of %qE requires %u bits to represent, "
12563 }
12565 /* The C and C++ parsers both use vectors to hold function arguments.
12566 For efficiency, we keep a cache of unused vectors. This is the
12567 cache. */
12572 /* Return a new vector from the cache. If the cache is empty,
12573 allocate a new vector. These vectors are GC'ed, so it is OK if the
12574 pointer is not released.. */
12578 {
12581 else
12582 {
12583 /* Passing 0 to vec::alloc returns NULL, and our callers require
12584 that we always return a non-NULL value. The vector code uses
12585 4 when growing a NULL vector, so we do too. */
12589 }
12590 }
12592 /* Release a vector of trees back to the cache. */
12594 void
12596 {
12598 {
12601 }
12602 }
12604 /* Get a new tree vector holding a single tree. */
12608 {
12612 }
12614 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12618 {
12623 }
12625 /* Get a new tree vector of the values of a CONSTRUCTOR. */
12629 {
12635 }
12637 /* Get a new tree vector which is a copy of an existing one. */
12641 {
12644 tree t;
12651 }
12653 /* Return true if KEYWORD starts a type specifier. */
12655 bool
12657 {
12659 {
12670 CASE_RID_FLOATN_NX:
12694 }
12695 }
12697 /* Return true if KEYWORD names a type qualifier. */
12699 bool
12701 {
12703 {
12711 }
12712 }
12714 /* Return true if KEYWORD names a storage class specifier.
12716 RID_TYPEDEF is not included in this list despite `typedef' being
12717 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12718 such for syntactic convenience only. */
12720 bool
12722 {
12724 {
12734 }
12735 }
12737 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12739 static bool
12741 {
12743 {
12751 }
12752 }
12754 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12755 declaration-specifier (C99 6.7). */
12757 bool
12759 {
12766 {
12773 }
12774 }
12776 /* Initialize language-specific-bits of tree_contains_struct. */
12778 void
12780 {
12784 }
12786 /* Build a user-defined numeric literal out of an integer constant type VALUE
12787 with identifier SUFFIX. */
12789 tree
12792 {
12799 }
12801 /* For vector[index], convert the vector to an array of the underlying type.
12802 Return true if the resulting ARRAY_REF should not be an lvalue. */
12804 bool
12807 {
12810 {
12820 /* We are building an ARRAY_REF so mark the vector as addressable
12821 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12822 for function parameters. */
12829 }
12831 }
12833 /* Determine which of the operands, if any, is a scalar that needs to be
12834 converted to a vector, for the range of operations. */
12835 enum stv_conv
12838 {
12846 {
12847 /* Most GENERIC binary expressions require homogeneous arguments.
12848 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12849 argument that is a vector and a second one that is a scalar, so
12850 we never return stv_secondarg for them. */
12855 {
12857 {
12862 }
12863 else
12865 }
12872 /* fall through */
12893 /* What about UNLT_EXPR? */
12895 {
12899 }
12903 {
12905 {
12910 }
12912 }
12914 /* Allow integer --> real conversion if safe. */
12918 {
12920 {
12925 }
12927 }
12930 }
12933 }
12935 /* Return the alignment of std::max_align_t.
12937 [support.types.layout] The type max_align_t is a POD type whose alignment
12938 requirement is at least as great as that of every scalar type, and whose
12939 alignment requirement is supported in every context. */
12941 unsigned
12943 {
12949 }
12951 /* Return true iff ALIGN is an integral constant that is a fundamental
12952 alignment, as defined by [basic.align] in the c++-11
12953 specifications.
12955 That is:
12957 [A fundamental alignment is represented by an alignment less than or
12958 equal to the greatest alignment supported by the implementation
12959 in all contexts, which is equal to alignof(max_align_t)]. */
12961 bool
12963 {
12965 }
12967 /* Return true if T is a pointer to a zero-sized aggregate. */
12969 bool
12971 {
12976 }
12978 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12979 with no library fallback or for an ADDR_EXPR whose operand is such type
12980 issues an error pointing to the location LOC.
12981 Returns true when the expression has been diagnosed and false
12982 otherwise. */
12983 bool
12985 {
12992 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12993 false positives for user-declared built-ins such as abs or
12994 strlen, and for C++ operators new and delete.
12995 The c_decl_implicit() test avoids false positives for implicitly
12996 declared built-ins with library fallbacks (such as abs). */
13001 {
13005 /* Reject arguments that are built-in functions with
13006 no library fallback. */
13010 }
13013 }
13015 /* If we're creating an if-else-if condition chain, first see if we
13016 already have this COND in the CHAIN. If so, warn and don't add COND
13017 into the vector, otherwise add the COND there. LOC is the location
13018 of COND. */
13020 void
13022 {
13023 /* No chain has been created yet. Do nothing. */
13028 {
13029 /* Uh-oh! This condition has a side-effect, thus invalidates
13030 the whole chain. */
13034 }
13037 tree t;
13041 {
13047 }
13051 /* Don't infinitely grow the chain. */
13054 }
13056 /* Check if array size calculations overflow or if the array covers more
13057 than half of the address space. Return true if the size of the array
13058 is valid, false otherwise. TYPE is the type of the array and NAME is
13059 the name of the array, or NULL_TREE for unnamed arrays. */
13061 bool
13063 {
13068 {
13071 else
13074 }
13076 }
13078 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
13079 timestamp to replace embedded current dates to get reproducible
13080 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
13082 time_t
13084 {
13094 #if defined(INT64_T_IS_LONG)
13096 #else
13098 #endif
13101 {
13104 MAX_SOURCE_DATE_EPOCH);
13106 }
13109 }
13111 /* Callback for libcpp for offering spelling suggestions for misspelled
13112 directives. GOAL is an unrecognized string; CANDIDATES is a
13113 NULL-terminated array of candidate strings. Return the closest
13114 match to GOAL within CANDIDATES, or NULL if none are good
13115 suggestions. */
13120 {
13125 }
13127 /* Check and possibly warn if two declarations have contradictory
13128 attributes, such as always_inline vs. noinline. */
13130 bool
13132 {
13137 /* An optimization attribute applied on a declaration after the
13138 definition is likely not what the user wanted. */
13143 "optimization attribute on %qD follows "
13145 newdecl);
13147 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
13179 }