| blob | f89deb32889f649a9554a8676fe6c2599e59cbf0 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2015 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
51 /* Mode used to build pointers (VOIDmode means ptr_mode). */
55 /* The following symbols are subsumed in the c_global_trees array, and
56 listed here individually for documentation purposes.
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
64 tree short_unsigned_type_node;
65 tree long_unsigned_type_node;
66 tree long_long_unsigned_type_node;
68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
72 tree ptrdiff_type_node;
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
76 tree wchar_type_node;
78 tree char16_type_node;
79 tree char32_type_node;
81 tree float_type_node;
82 tree double_type_node;
83 tree long_double_type_node;
85 tree complex_integer_type_node;
86 tree complex_float_type_node;
87 tree complex_double_type_node;
88 tree complex_long_double_type_node;
90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
94 tree intQI_type_node;
95 tree intHI_type_node;
96 tree intSI_type_node;
97 tree intDI_type_node;
98 tree intTI_type_node;
100 tree unsigned_intQI_type_node;
101 tree unsigned_intHI_type_node;
102 tree unsigned_intSI_type_node;
103 tree unsigned_intDI_type_node;
104 tree unsigned_intTI_type_node;
106 tree widest_integer_literal_type_node;
107 tree widest_unsigned_literal_type_node;
109 Nodes for types `void *' and `const void *'.
111 tree ptr_type_node, const_ptr_type_node;
113 Nodes for types `char *' and `const char *'.
115 tree string_type_node, const_string_type_node;
117 Type `char[SOMENUMBER]'.
118 Used when an array of char is needed and the size is irrelevant.
120 tree char_array_type_node;
122 Type `wchar_t[SOMENUMBER]' or something like it.
123 Used when a wide string literal is created.
125 tree wchar_array_type_node;
127 Type `char16_t[SOMENUMBER]' or something like it.
128 Used when a UTF-16 string literal is created.
130 tree char16_array_type_node;
132 Type `char32_t[SOMENUMBER]' or something like it.
133 Used when a UTF-32 string literal is created.
135 tree char32_array_type_node;
137 Type `int ()' -- used for implicit declaration of functions.
139 tree default_function_type;
141 A VOID_TYPE node, packaged in a TREE_LIST.
143 tree void_list_node;
145 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
146 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
147 VAR_DECLS, but C++ does.)
149 tree function_name_decl_node;
150 tree pretty_function_name_decl_node;
151 tree c99_function_name_decl_node;
153 Stack of nested function name VAR_DECLs.
155 tree saved_function_name_decls;
157 */
160 \f
161 /* Switches common to the C front ends. */
163 /* Nonzero means don't output line number information. */
167 /* Nonzero causes -E output not to be done, but directives such as
168 #define that have side effects are still obeyed. */
172 /* Nonzero means dump macros in some fashion. */
176 /* Nonzero means pass #include lines through to the output. */
180 /* Nonzero means process PCH files while preprocessing. */
184 /* The file name to which we should write a precompiled header, or
185 NULL if no header will be written in this compile. */
189 /* Nonzero if an ISO standard was selected. It rejects macros in the
190 user's namespace. */
193 /* C/ObjC language option variables. */
196 /* Nonzero means allow type mismatches in conditional expressions;
197 just make their values `void'. */
201 /* Nonzero means enable C89 Amendment 1 features. */
205 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
209 /* Nonzero means use the ISO C11 dialect of C. */
213 /* Nonzero means that we have builtin functions, and main is an int. */
218 /* ObjC language option variables. */
221 /* Tells the compiler that this is a special run. Do not perform any
222 compiling, instead we are to test some platform dependent features
223 and output a C header file with appropriate definitions. */
227 /* Tells the compiler what is the constant string class for ObjC. */
232 /* C++ language option variables. */
234 /* The reference version of the ABI for -Wabi. */
238 /* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
243 /* The C++ dialect being used. Default set in c_common_post_options. */
247 /* Maximum template instantiation depth. This limit exists to limit the
248 time it takes to notice excessively recursive template instantiations.
250 The default is lower than the 1024 recommended by the C++0x standard
251 because G++ runs out of stack before 1024 with highly recursive template
252 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
256 /* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
262 /* Nonzero means don't warn about problems that occur when the code is
263 executed. */
266 /* Whether we are building a boolean conversion inside
267 convert_for_assignment, or some other late binary operation. If
268 build_binary_op is called for C (from code shared by C and C++) in
269 this case, then the operands have already been folded and the
270 result will not be folded again, so C_MAYBE_CONST_EXPR should not
271 be generated. */
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
278 /* Information about how a function name is generated. */
279 struct fname_var_t
280 {
284 };
286 /* The three ways of getting then name of the current function. */
289 {
290 /* C99 compliant __func__, must be first. */
292 /* GCC __FUNCTION__ compliant. */
294 /* GCC __PRETTY_FUNCTION__ compliant. */
297 };
299 /* Global visibility options. */
403 /* Reserved words. The third field is a mask: keywords are disabled
404 if they match the mask.
406 Masks for languages:
407 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
408 C --std=c99: D_CXXONLY | D_OBJC
409 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
410 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
411 C++ --std=c0x: D_CONLY | D_OBJC
412 ObjC++ is like C++ except that D_OBJC is not set
414 If -fno-asm is used, D_ASM is added to the mask. If
415 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
416 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
417 In C with -Wc++-compat, we warn if D_CXXWARN is set.
419 Note the complication of the D_CXX_OBJC keywords. These are
420 reserved words such as 'class'. In C++, 'class' is a reserved
421 word. In Objective-C++ it is too. In Objective-C, it is a
422 reserved word too, but only if it follows an '@' sign.
423 */
425 {
592 /* C++ transactional memory. */
598 /* Concepts-related keywords */
602 /* These Objective-C keywords are recognized only immediately after
603 an '@'. */
619 /* These are recognized only in protocol-qualifier context
620 (see above) */
627 /* These are recognized inside a property attribute list */
636 };
641 /* Table of machine-independent attributes common to all C-like languages.
643 All attributes referencing arguments should be additionally processed
644 in chkp_copy_function_type_adding_bounds for correct instrumentation
645 by Pointer Bounds Checker.
646 Current list of processed common attributes: nonnull. */
648 {
649 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
650 affects_type_identity } */
657 /* FIXME: logically, noreturn attributes should be listed as
658 "false, true, true" and apply to function types. But implementing this
659 would require all the places in the compiler that use TREE_THIS_VOLATILE
660 on a decl to identify non-returning functions to be located and fixed
661 to check the function type instead. */
692 /* The same comments as for noreturn attributes apply to const ones. */
720 handle_no_instrument_function_attribute,
740 /* ??? These two attributes didn't make the transition from the
741 Intel language document to the multi-vendor language document. */
746 /* For internal use (marking of builtins) only. The name contains space
747 to prevent its usage in source code. */
769 /* For internal use (marking of builtins) only. The name contains space
770 to prevent its usage in source code. */
781 handle_no_address_safety_analysis_attribute,
784 handle_no_sanitize_address_attribute,
787 handle_no_sanitize_address_attribute,
790 handle_no_sanitize_undefined_attribute,
802 /* For internal use only. The leading '*' both prevents its usage in
803 source code and signals that it may be overridden by machine tables. */
808 /* For internal use (marking of builtins and runtime functions) only.
809 The name contains space to prevent its usage in source code. */
837 };
839 /* Give the specifications for the format attributes, used by C and all
840 descendants.
842 All attributes referencing arguments should be additionally processed
843 in chkp_copy_function_type_adding_bounds for correct instrumentation
844 by Pointer Bounds Checker.
845 Current list of processed format attributes: format, format_arg. */
847 {
848 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
849 affects_type_identity } */
855 };
857 /* Return identifier for address space AS. */
861 {
865 }
867 /* Push current bindings for the function name VAR_DECLS. */
869 void
871 {
876 {
880 {
882 saved);
884 }
885 }
887 /* Normally they'll have been NULL, so only push if we've got a
888 stack, or they are non-NULL. */
890 saved_function_name_decls);
891 }
893 /* Finish up the current bindings, adding them into the current function's
894 statement tree. This must be done _before_ finish_stmt_tree is called.
895 If there is no current function, we must be at file scope and no statements
896 are involved. Pop the previous bindings. */
898 void
900 {
909 {
917 }
923 {
924 /* We had saved values, restore them. */
925 tree saved;
928 {
933 }
935 }
937 }
939 /* Return the text name of the current function, suitably prettified
940 by PRETTY_P. Return string must be freed by caller. */
944 {
951 {
954 }
967 {
970 }
973 }
975 /* Return the VAR_DECL for a const char array naming the current
976 function. If the VAR_DECL has not yet been created, create it
977 now. RID indicates how it should be formatted and IDENTIFIER_NODE
978 ID is its name (unfortunately C and C++ hold the RID values of
979 keywords in different places, so we can't derive RID from ID in
980 this language independent code. LOC is the location of the
981 function. */
983 tree
985 {
995 {
996 /* If a tree is built here, it would normally have the lineno of
997 the current statement. Later this tree will be moved to the
998 beginning of the function and this line number will be wrong.
999 To avoid this problem set the lineno to 0 here; that prevents
1000 it from appearing in the RTL. */
1001 tree stmts;
1009 saved_function_name_decls
1013 }
1018 }
1020 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1022 tree
1024 {
1029 /* Compute the number of elements, for the array type. */
1031 {
1034 }
1036 {
1039 }
1041 {
1044 }
1045 else
1046 {
1049 }
1051 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1052 limit in C++98 Annex B is very large (65536) and is not normative,
1053 so we do not diagnose it (warn_overlength_strings is forced off
1054 in c_common_post_options). */
1056 {
1060 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1061 separate the %d from the 'C'. 'ISO' should not be
1062 translated, but it may be moved after 'C%d' in languages
1063 where modifiers follow nouns. */
1065 "string length %qd is greater than the length %qd "
1068 }
1070 /* Create the array type for the string constant. The ISO C++
1071 standard says that a string literal has type `const char[N]' or
1072 `const wchar_t[N]'. We use the same logic when invoked as a C
1073 front-end with -Wwrite-strings.
1074 ??? We should change the type of an expression depending on the
1075 state of a warning flag. We should just be warning -- see how
1076 this is handled in the C++ front-end for the deprecated implicit
1077 conversion from string literals to `char*' or `wchar_t*'.
1079 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1080 array type being the unqualified version of that type.
1081 Therefore, if we are constructing an array of const char, we must
1082 construct the matching unqualified array type first. The C front
1083 end does not require this, but it does no harm, so we do it
1084 unconditionally. */
1095 }
1096 \f
1097 /* Fold X for consideration by one of the warning functions when checking
1098 whether an expression has a constant value. */
1100 static tree
1102 {
1105 else
1106 /* The C front-end has already folded X appropriately. */
1108 }
1110 /* Print a warning if a constant expression had overflow in folding.
1111 Invoke this function on every expression that the language
1112 requires to be a constant expression.
1113 Note the ANSI C standard says it is erroneous for a
1114 constant expression to overflow. */
1116 void
1118 {
1126 }
1128 /* The same as above but print an unconditional error. */
1129 void
1131 {
1138 }
1140 /* Print a warning if an expression had overflow in folding and its
1141 operands hadn't.
1143 Invoke this function on every expression that
1144 (1) appears in the source code, and
1145 (2) is a constant expression that overflowed, and
1146 (3) is not already checked by convert_and_check;
1147 however, do not invoke this function on operands of explicit casts
1148 or when the expression is the result of an operator and any operand
1149 already overflowed. */
1151 void
1153 {
1158 {
1187 }
1188 }
1190 /* Warn about uses of logical || / && operator in a context where it
1191 is likely that the bitwise equivalent was intended by the
1192 programmer. We have seen an expression in which CODE is a binary
1193 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1194 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1195 void
1199 {
1211 /* We don't want to warn if either operand comes from a macro
1212 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1213 see PR61534. */
1218 /* Warn if &&/|| are being used in a context where it is
1219 likely that the bitwise equivalent was intended by the
1220 programmer. That is, an expression such as op && MASK
1221 where op should not be any boolean expression, nor a
1222 constant, and mask seems to be a non-boolean integer constant. */
1224 /* An enumerator counts as a constant. */
1233 {
1237 else
1242 }
1244 /* We do not warn for constants because they are typical of macro
1245 expansions that test for features. */
1250 /* This warning only makes sense with logical operands. */
1257 /* The range computations only work with scalars. */
1262 /* We first test whether either side separately is trivially true
1263 (with OR) or trivially false (with AND). If so, do not warn.
1264 This is a common idiom for testing ranges of data types in
1265 portable code. */
1272 /* If this is an OR operation, invert both sides; now, the result
1273 should be always false to get a warning. */
1287 /* If this is an OR operation, invert both sides; now, the result
1288 should be always false to get a warning. */
1296 /* If both expressions have the same operand, if we can merge the
1297 ranges, ... */
1301 {
1303 /* ... and if the range test is always false, then warn. */
1305 {
1308 "logical %<or%> of collectively exhaustive tests is "
1310 else
1312 "logical %<and%> of mutually exclusive tests is "
1314 }
1315 /* Or warn if the operands have exactly the same range, e.g.
1316 A > 0 && A > 0. */
1319 {
1323 else
1326 }
1327 }
1328 }
1330 /* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1331 with constant indices. */
1333 static tree
1335 {
1341 {
1344 }
1347 }
1349 /* Warn if a self-comparison always evaluates to true or false. LOC
1350 is the location of the comparison with code CODE, LHS and RHS are
1351 operands of the comparison. */
1353 void
1355 {
1359 /* Don't warn for various macro expansions. */
1365 /* We do not warn for constants because they are typical of macro
1366 expansions that test for features, sizeof, and similar. */
1371 /* Don't warn for e.g.
1372 HOST_WIDE_INT n;
1373 ...
1374 if (n == (long) n) ...
1375 */
1380 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1381 It could be a NaN, and NaN never compares equal to anything, even
1382 itself. */
1387 {
1388 /* Don't warn about array references with constant indices;
1389 these are likely to come from a macro. */
1401 else
1404 }
1405 }
1407 /* Warn about logical not used on the left hand side operand of a comparison.
1408 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1409 Do not warn if RHS is of a boolean type. */
1411 void
1413 tree rhs)
1414 {
1420 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1421 !(x == 0) or !(y != 0). */
1427 "logical not is only applied to the left hand side of "
1429 }
1431 /* Warn if EXP contains any computations whose results are not used.
1432 Return true if a warning is printed; false otherwise. LOCUS is the
1433 (potential) location of the expression. */
1435 bool
1437 {
1438 restart:
1442 /* Don't warn about void constructs. This includes casting to void,
1443 void function calls, and statement expressions with a final cast
1444 to void. */
1452 {
1468 /* For a binding, warn if no side effect within it. */
1480 /* In && or ||, warn if 2nd operand has no side effect. */
1487 /* Let people do `(foo (), 0)' without a warning. */
1494 /* If this is an expression with side effects, don't warn; this
1495 case commonly appears in macro expansions. */
1501 /* Don't warn about automatic dereferencing of references, since
1502 the user cannot control it. */
1504 {
1507 }
1508 /* Fall through. */
1511 /* Referencing a volatile value is a side effect, so don't warn. */
1516 /* If this is an expression which has no operands, there is no value
1517 to be unused. There are no such language-independent codes,
1518 but front ends may define such. */
1522 warn:
1524 }
1525 }
1528 /* Print a warning about casts that might indicate violation
1529 of strict aliasing rules if -Wstrict-aliasing is used and
1530 strict aliasing mode is in effect. OTYPE is the original
1531 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1533 bool
1535 {
1536 /* Strip pointer conversion chains and get to the correct original type. */
1544 /* If the type we are casting to is a ref-all pointer
1545 dereferencing it is always valid. */
1552 {
1553 /* Casting the address of an object to non void pointer. Warn
1554 if the cast breaks type based aliasing. */
1556 {
1560 }
1561 else
1562 {
1563 /* warn_strict_aliasing >= 3. This includes the default (3).
1564 Only warn if the cast is dereferenced immediately. */
1565 alias_set_type set1 =
1571 {
1575 }
1578 {
1582 }
1583 }
1584 }
1585 else
1587 {
1588 /* At this level, warn for any conversions, even if an address is
1589 not taken in the same statement. This will likely produce many
1590 false positives, but could be useful to pinpoint problems that
1591 are not revealed at higher levels. */
1596 {
1600 }
1601 }
1604 }
1606 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1607 sizeof as last operand of certain builtins. */
1609 void
1613 {
1617 location_t loc;
1625 {
1629 /* FALLTHRU */
1637 /* FALLTHRU */
1696 }
1724 {
1728 {
1731 "argument to %<sizeof%> in %qD call is the same "
1732 "expression as the destination; did you mean to "
1738 "argument to %<sizeof%> in %qD call is the same "
1739 "expression as the destination; did you mean to "
1741 else
1743 "argument to %<sizeof%> in %qD call is the same "
1744 "expression as the destination; did you mean to "
1747 }
1750 && !strop
1753 {
1755 "argument to %<sizeof%> in %qD call is the same "
1756 "pointer type %qT as the destination; expected %qT "
1760 }
1761 }
1764 {
1768 {
1771 "argument to %<sizeof%> in %qD call is the same "
1772 "expression as the source; did you mean to "
1778 "argument to %<sizeof%> in %qD call is the same "
1779 "expression as the source; did you mean to "
1781 else
1783 "argument to %<sizeof%> in %qD call is the same "
1784 "expression as the source; did you mean to "
1787 }
1790 && !strop
1793 {
1795 "argument to %<sizeof%> in %qD call is the same "
1796 "pointer type %qT as the source; expected %qT "
1800 }
1801 }
1804 {
1808 {
1811 "argument to %<sizeof%> in %qD call is the same "
1812 "expression as the first source; did you mean to "
1818 "argument to %<sizeof%> in %qD call is the same "
1819 "expression as the first source; did you mean to "
1821 else
1823 "argument to %<sizeof%> in %qD call is the same "
1824 "expression as the first source; did you mean to "
1827 }
1830 && !strop
1833 {
1835 "argument to %<sizeof%> in %qD call is the same "
1836 "pointer type %qT as the first source; expected %qT "
1840 }
1841 }
1844 {
1848 {
1851 "argument to %<sizeof%> in %qD call is the same "
1852 "expression as the second source; did you mean to "
1858 "argument to %<sizeof%> in %qD call is the same "
1859 "expression as the second source; did you mean to "
1861 else
1863 "argument to %<sizeof%> in %qD call is the same "
1864 "expression as the second source; did you mean to "
1867 }
1870 && !strop
1873 {
1875 "argument to %<sizeof%> in %qD call is the same "
1876 "pointer type %qT as the second source; expected %qT "
1880 }
1881 }
1883 }
1885 /* Warn for unlikely, improbable, or stupid DECL declarations
1886 of `main'. */
1888 void
1890 {
1891 function_args_iterator iter;
1892 tree type;
1896 {
1897 /* XXX void_type_node belies the abstraction. */
1907 {
1913 }
1917 {
1939 "third argument of %q+D should probably be "
1942 }
1943 }
1945 /* It is intentional that this message does not mention the third
1946 argument because it's only mentioned in an appendix of the
1947 standard. */
1955 }
1957 /* vector_targets_convertible_p is used for vector pointer types. The
1958 callers perform various checks that the qualifiers are satisfactory,
1959 while OTOH vector_targets_convertible_p ignores the number of elements
1960 in the vectors. That's fine with vector pointers as we can consider,
1961 say, a vector of 8 elements as two consecutive vectors of 4 elements,
1962 and that does not require and conversion of the pointer values.
1963 In contrast, vector_types_convertible_p and
1964 vector_types_compatible_elements_p are used for vector value types. */
1965 /* True if pointers to distinct types T1 and T2 can be converted to
1966 each other without an explicit cast. Only returns true for opaque
1967 vector types. */
1968 bool
1970 {
1977 }
1979 /* vector_types_convertible_p is used for vector value types.
1980 It could in principle call vector_targets_convertible_p as a subroutine,
1981 but then the check for vector type would be duplicated with its callers,
1982 and also the purpose of vector_targets_convertible_p would become
1983 muddled.
1984 Where vector_types_convertible_p returns true, a conversion might still be
1985 needed to make the types match.
1986 In contrast, vector_targets_convertible_p is used for vector pointer
1987 values, and vector_types_compatible_elements_p is used specifically
1988 in the context for binary operators, as a check if use is possible without
1989 conversion. */
1990 /* True if vector types T1 and T2 can be converted to each other
1991 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1992 can only be converted with -flax-vector-conversions yet that is not
1993 in effect, emit a note telling the user about that option if such
1994 a note has not previously been emitted. */
1995 bool
1997 {
2005 convertible_lax =
2020 {
2023 "conversions between vectors with differing "
2025 }
2028 }
2030 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2031 and have vector types, V0 has the same type as V1, and the number of
2032 elements of V0, V1, MASK is the same.
2034 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2035 called with two arguments. In this case implementation passes the
2036 first argument twice in order to share the same tree code. This fact
2037 could enable the mask-values being twice the vector length. This is
2038 an implementation accident and this semantics is not guaranteed to
2039 the user. */
2040 tree
2043 {
2044 tree ret;
2050 {
2053 }
2060 {
2065 }
2069 {
2073 }
2076 {
2081 }
2087 {
2090 "argument vector(s) and the mask vector should "
2093 }
2097 {
2102 }
2105 {
2106 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2112 else
2113 {
2116 }
2120 }
2130 }
2132 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2133 to integral type. */
2135 static tree
2137 {
2142 {
2143 /* C++0x scoped enumerations don't implicitly convert to integral
2144 type; if we stripped an explicit conversion to a larger type we
2145 need to replace it so common_type will still work. */
2149 }
2151 }
2153 /* This is a helper function of build_binary_op.
2155 For certain operations if both args were extended from the same
2156 smaller type, do the arithmetic in that type and then extend.
2158 BITWISE indicates a bitwise operation.
2159 For them, this optimization is safe only if
2160 both args are zero-extended or both are sign-extended.
2161 Otherwise, we might change the result.
2162 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2163 but calculated in (unsigned short) it would be (unsigned short)-1.
2164 */
2165 tree
2167 {
2171 tree type;
2173 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2174 excessive narrowing when we call get_narrower below. For
2175 example, suppose that OP0 is of unsigned int extended
2176 from signed char and that RESULT_TYPE is long long int.
2177 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2178 like
2180 (long long int) (unsigned int) signed_char
2182 which get_narrower would narrow down to
2184 (unsigned int) signed char
2186 If we do not cast OP0 first, get_narrower would return
2187 signed_char, which is inconsistent with the case of the
2188 explicit cast. */
2195 /* UNS is 1 if the operation to be done is an unsigned one. */
2198 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2199 but it *requires* conversion to FINAL_TYPE. */
2210 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2212 /* For bitwise operations, signedness of nominal type
2213 does not matter. Consider only how operands were extended. */
2217 /* Note that in all three cases below we refrain from optimizing
2218 an unsigned operation on sign-extended args.
2219 That would not be valid. */
2221 /* Both args variable: if both extended in same way
2222 from same width, do it in that width.
2223 Do it unsigned if args were zero-extended. */
2230 return c_common_signed_or_unsigned_type
2237 && (type
2248 && (type
2256 }
2258 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2259 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2261 static bool
2263 {
2266 REAL_VALUE_TYPE real_low_bound =
2268 REAL_VALUE_TYPE real_high_bound =
2273 }
2275 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2276 to the complex/real/integer type TYPE. Function returns non-zero when:
2277 * EXPR is a constant which cannot be exactly converted to TYPE.
2278 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2279 for EXPR type and TYPE being both integers or both real, or both
2280 complex.
2281 * EXPR is not a constant of complex type and TYPE is a real or
2282 an integer.
2283 * EXPR is not a constant of real type and TYPE is an integer.
2284 * EXPR is not a constant of integer type which cannot be
2285 exactly converted to real type.
2287 Function allows conversions between types of different signedness and
2288 can return SAFE_CONVERSION (zero) in that case. Function can produce
2289 signedness warnings if PRODUCE_WARNS is true.
2291 Function allows conversions from complex constants to non-complex types,
2292 provided that imaginary part is zero and real part can be safely converted
2293 to TYPE. */
2295 enum conversion_safety
2297 {
2303 {
2304 /* If type is complex, we are interested in compatibility with
2305 underlying type. */
2309 /* Warn for real constant that is not an exact integer converted
2310 to integer type. */
2313 {
2316 }
2317 /* Warn for an integer constant that does not fit into integer type. */
2321 {
2324 {
2328 }
2330 {
2334 }
2335 else
2337 }
2339 {
2340 /* Warn for an integer constant that does not fit into real type. */
2342 {
2346 }
2347 /* Warn for a real constant that does not fit into a smaller
2348 real type. */
2351 {
2355 }
2356 }
2357 }
2360 {
2362 /* Conversion from complex constant with zero imaginary part,
2363 perform check for conversion of real part. */
2368 /* Note: in this branch we use recursive call to unsafe_conversion_p
2369 with different type of EXPR, but it is still safe, because when EXPR
2370 is a constant, it's type is not used in text of generated warnings
2371 (otherwise they could sound misleading). */
2373 produce_warns);
2374 /* Conversion from complex constant with non-zero imaginary part. */
2375 else
2376 {
2377 /* Conversion to complex type.
2378 Perform checks for both real and imaginary parts. */
2380 {
2381 /* Unfortunately, produce_warns must be false in two subsequent
2382 calls of unsafe_conversion_p, because otherwise we could
2383 produce strange "double" warnings, if both real and imaginary
2384 parts have conversion problems related to signedness.
2386 For example:
2387 int32_t _Complex a = 0x80000000 + 0x80000000i;
2389 Possible solution: add a separate function for checking
2390 constants and combine result of two calls appropriately. */
2396 /* Merge the results into appropriate single warning. */
2398 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2405 else
2407 }
2408 /* Warn about conversion from complex to real or integer type. */
2409 else
2411 }
2412 }
2414 /* Checks for remaining case: EXPR is not constant. */
2415 else
2416 {
2417 /* Warn for real types converted to integer types. */
2424 {
2425 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2429 /* Don't warn for short y; short x = ((int)y & 0xff); */
2433 {
2434 /* If both args were extended from a shortest type,
2435 use that type if that is safe. */
2442 {
2448 /* If one of the operands is a non-negative constant
2449 that fits in the target type, then the type of the
2450 other operand does not matter. */
2459 /* If constant is unsigned and fits in the target
2460 type, then the result will also fit. */
2462 && unsigned0
2465 && unsigned1
2468 }
2469 }
2470 /* Warn for integer types converted to smaller integer types. */
2474 /* When they are the same width but different signedness,
2475 then the value may change. */
2478 /* Even when converted to a bigger type, if the type is
2479 unsigned but expr is signed, then negative values
2480 will be changed. */
2486 }
2488 /* Warn for integer types converted to real types if and only if
2489 all the range of values of the integer type cannot be
2490 represented by the real type. */
2493 {
2494 /* Don't warn about char y = 0xff; float x = (int) y; */
2500 }
2502 /* Warn for real types converted to smaller real types. */
2508 /* Check conversion between two complex types. */
2511 {
2512 /* Extract underlying types (i.e., type of real and imaginary
2513 parts) of expr_type and type. */
2517 /* Warn for real types converted to integer types. */
2522 /* Warn for real types converted to smaller real types. */
2528 /* Check conversion for complex integer types. Here implementation
2529 is simpler than for real-domain integers because it does not
2530 involve sophisticated cases, such as bitmasks, casts, etc. */
2533 {
2534 /* Warn for integer types converted to smaller integer types. */
2538 /* Check for different signedness, see case for real-domain
2539 integers (above) for a more detailed comment. */
2545 "conversion to %qT from %qT "
2548 }
2553 }
2555 /* Warn for complex types converted to real or integer types. */
2559 }
2562 }
2564 /* Warns if the conversion of EXPR to TYPE may alter a value.
2565 This is a helper function for warnings_for_convert_and_check. */
2567 static void
2569 {
2576 /* This may happen, because for LHS op= RHS we preevaluate
2577 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2578 means we could no longer see the code of the EXPR. */
2585 {
2598 /* Conversion from boolean to a signed:1 bit-field (which only
2599 can hold the values 0 and -1) doesn't lose information - but
2600 it does change the value. */
2621 {
2622 /* In case of COND_EXPR, we do not care about the type of
2623 COND_EXPR, only about the conversion of each operand. */
2630 }
2646 }
2647 }
2649 /* Produce warnings after a conversion. RESULT is the result of
2650 converting EXPR to TYPE. This is a helper function for
2651 convert_and_check and cp_convert_and_check. */
2653 void
2655 tree result)
2656 {
2663 {
2664 /* Do not diagnose overflow in a constant expression merely
2665 because a conversion overflowed. */
2670 {
2671 /* This detects cases like converting -129 or 256 to
2672 unsigned char. */
2676 else
2678 }
2682 /* No warning for converting 0x80000000 to int. */
2690 else
2692 }
2697 else
2699 }
2702 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2703 Invoke this function on every expression that is converted implicitly,
2704 i.e. because of language rules and not because of an explicit cast. */
2706 tree
2708 {
2709 tree result;
2710 tree expr_for_warning;
2712 /* Convert from a value with possible excess precision rather than
2713 via the semantic type, but do not warn about values not fitting
2714 exactly in the semantic type. */
2716 {
2722 }
2723 else
2737 }
2738 \f
2739 /* A node in a list that describes references to variables (EXPR), which are
2740 either read accesses if WRITER is zero, or write accesses, in which case
2741 WRITER is the parent of EXPR. */
2742 struct tlist
2743 {
2746 };
2748 /* Used to implement a cache the results of a call to verify_tree. We only
2749 use this for SAVE_EXPRs. */
2750 struct tlist_cache
2751 {
2755 tree expr;
2756 };
2758 /* Obstack to use when allocating tlist structures, and corresponding
2759 firstobj. */
2763 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2764 warnings. */
2766 /* SAVE_EXPRs need special treatment. We process them only once and then
2767 cache the results. */
2779 /* Create a new struct tlist and fill in its fields. */
2782 {
2789 }
2791 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2792 is nonnull, we ignore any node we find which has a writer equal to it. */
2794 static void
2796 {
2798 {
2805 }
2806 }
2808 /* Merge the nodes of ADD into TO. This merging process is done so that for
2809 each variable that already exists in TO, no new node is added; however if
2810 there is a write access recorded in ADD, and an occurrence on TO is only
2811 a read access, then the occurrence in TO will be modified to record the
2812 write. */
2814 static void
2816 {
2823 {
2830 {
2834 }
2836 {
2840 }
2842 }
2843 }
2845 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2846 references in list LIST conflict with it, excluding reads if ONLY writers
2847 is nonzero. */
2849 static void
2852 {
2855 /* Avoid duplicate warnings. */
2861 {
2865 {
2870 }
2872 }
2873 }
2875 /* Given a list LIST of references to variables, find whether any of these
2876 can cause conflicts due to missing sequence points. */
2878 static void
2880 {
2884 {
2887 }
2888 }
2890 /* Return nonzero if X is a tree that can be verified by the sequence point
2891 warnings. */
2892 static int
2894 {
2901 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2902 (lvalue_p) crash on TRY/CATCH. */
2909 /* No point to track non-const calls, they will never satisfy
2910 operand_equal_p. */
2918 }
2920 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2921 static bool
2923 {
2925 }
2927 /* Walk the tree X, and record accesses to variables. If X is written by the
2928 parent tree, WRITER is the parent.
2929 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2930 expression or its only operand forces a sequence point, then everything up
2931 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2932 in PNO_SP.
2933 Once we return, we will have emitted warnings if any subexpression before
2934 such a sequence point could be undefined. On a higher level, however, the
2935 sequence point may not be relevant, and we'll merge the two lists.
2937 Example: (b++, a) + b;
2938 The call that processes the COMPOUND_EXPR will store the increment of B
2939 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2940 processes the PLUS_EXPR will need to merge the two lists so that
2941 eventually, all accesses end up on the same list (and we'll warn about the
2942 unordered subexpressions b++ and b.
2944 A note on merging. If we modify the former example so that our expression
2945 becomes
2946 (b++, b) + a
2947 care must be taken not simply to add all three expressions into the final
2948 PNO_SP list. The function merge_tlist takes care of that by merging the
2949 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2950 way, so that no more than one access to B is recorded. */
2952 static void
2954 tree writer)
2955 {
2960 /* X may be NULL if it is the operand of an empty statement expression
2961 ({ }). */
2965 restart:
2973 {
3006 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3007 two first, to avoid warning for (a ? b++ : b++). */
3023 /* Expressions inside the LHS are not ordered wrt. the sequence points
3024 in the RHS. Example:
3025 *a = (a++, 2)
3026 Despite the fact that the modification of "a" is in the before_sp
3027 list (tmp_before), it conflicts with the use of "a" in the LHS.
3028 We can handle this by adding the contents of tmp_list3
3029 to those of tmp_before, and redoing the collision warnings for that
3030 list. */
3033 /* Exclude the LHS itself here; we first have to merge it into the
3034 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3035 didn't exclude the LHS, we'd get it twice, once as a read and once
3036 as a write. */
3047 /* We need to warn about conflicts among arguments and conflicts between
3048 args and the function address. Side effects of the function address,
3049 however, are not ordered by the sequence point of the call. */
3050 {
3051 call_expr_arg_iterator iter;
3052 tree arg;
3056 {
3061 }
3066 }
3069 /* Scan all the list, e.g. indices of multi dimensional array. */
3071 {
3077 }
3081 {
3088 {
3102 }
3106 }
3116 /* For other expressions, simply recurse on their operands.
3117 Manual tail recursion for unary expressions.
3118 Other non-expressions need not be processed. */
3120 {
3124 }
3126 {
3130 {
3135 }
3136 }
3138 }
3139 }
3141 /* Try to warn for undefined behavior in EXPR due to missing sequence
3142 points. */
3144 DEBUG_FUNCTION void
3146 {
3152 {
3155 }
3160 }
3161 \f
3162 /* Validate the expression after `case' and apply default promotions. */
3164 static tree
3166 {
3171 /* Promote char or short to int. */
3174 {
3177 }
3182 }
3183 \f
3184 /* See if the case values LOW and HIGH are in the range of the original
3185 type (i.e. before the default conversion to int) of the switch testing
3186 expression.
3187 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3188 the type before promoting it. CASE_LOW_P is a pointer to the lower
3189 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3190 if the case is not a case range.
3191 The caller has to make sure that we are not called with NULL for
3192 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3193 was a case value that doesn't fit into the range of the ORIG_TYPE.
3194 Returns true if the case label is in range of ORIG_TYPE (saturated or
3195 untouched) or false if the label is out of range. */
3197 static bool
3201 {
3206 /* If there was a problem with the original type, do nothing. */
3213 /* We'll really need integer constants here. */
3217 /* Case label is less than minimum for type. */
3220 {
3225 }
3227 /* Case value is greater than maximum for type. */
3230 {
3234 }
3236 /* Saturate lower case label value to minimum. */
3239 {
3244 }
3246 /* Saturate upper case label value to maximum. */
3249 {
3254 }
3262 }
3263 \f
3264 /* Return an integer type with BITS bits of precision,
3265 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3267 tree
3269 {
3311 }
3313 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3314 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3315 and saturating if SATP is nonzero, otherwise not saturating. */
3317 tree
3320 {
3321 machine_mode mode;
3324 else
3332 {
3334 "fixed-point types that have too many integral and "
3337 }
3340 }
3342 /* Used for communication between c_common_type_for_mode and
3343 c_register_builtin_type. */
3344 tree registered_builtin_types;
3346 /* Return a data type that has machine mode MODE.
3347 If the mode is an integer,
3348 then UNSIGNEDP selects between signed and unsigned types.
3349 If the mode is a fixed-point mode,
3350 then UNSIGNEDP selects between saturating and nonsaturating types. */
3352 tree
3354 {
3355 tree t;
3395 #if HOST_BITS_PER_WIDE_INT >= 64
3398 #endif
3423 {
3424 machine_mode inner_mode;
3425 tree inner_type;
3441 }
3443 {
3448 }
3458 {
3544 }
3552 }
3554 tree
3556 {
3558 }
3560 /* Return a signed type the same as TYPE in other respects. */
3562 tree
3564 {
3566 }
3568 /* Return a type the same as TYPE except unsigned or
3569 signed according to UNSIGNEDP. */
3571 tree
3573 {
3574 tree type1;
3577 /* This block of code emulates the behavior of the old
3578 c_common_unsigned_type. In particular, it returns
3579 long_unsigned_type_node if passed a long, even when a int would
3580 have the same size. This is necessary for warnings to work
3581 correctly in archs where sizeof(int) == sizeof(long) */
3584 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3604 #if HOST_BITS_PER_WIDE_INT >= 64
3607 #endif
3617 #define C_COMMON_FIXED_TYPES(NAME) \
3618 if (type1 == short_ ## NAME ## _type_node \
3619 || type1 == unsigned_short_ ## NAME ## _type_node) \
3620 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3621 : short_ ## NAME ## _type_node; \
3622 if (type1 == NAME ## _type_node \
3623 || type1 == unsigned_ ## NAME ## _type_node) \
3624 return unsignedp ? unsigned_ ## NAME ## _type_node \
3625 : NAME ## _type_node; \
3626 if (type1 == long_ ## NAME ## _type_node \
3627 || type1 == unsigned_long_ ## NAME ## _type_node) \
3628 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3629 : long_ ## NAME ## _type_node; \
3630 if (type1 == long_long_ ## NAME ## _type_node \
3631 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3632 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3633 : long_long_ ## NAME ## _type_node;
3635 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3636 if (type1 == NAME ## _type_node \
3637 || type1 == u ## NAME ## _type_node) \
3638 return unsignedp ? u ## NAME ## _type_node \
3639 : NAME ## _type_node;
3641 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3642 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3643 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3644 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3645 : sat_ ## short_ ## NAME ## _type_node; \
3646 if (type1 == sat_ ## NAME ## _type_node \
3647 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3648 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3649 : sat_ ## NAME ## _type_node; \
3650 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3651 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3652 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3653 : sat_ ## long_ ## NAME ## _type_node; \
3654 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3655 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3656 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3657 : sat_ ## long_long_ ## NAME ## _type_node;
3659 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3660 if (type1 == sat_ ## NAME ## _type_node \
3661 || type1 == sat_ ## u ## NAME ## _type_node) \
3662 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3663 : sat_ ## NAME ## _type_node;
3689 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3690 the precision; they have precision set to match their range, but
3691 may use a wider mode to match an ABI. If we change modes, we may
3692 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3693 the precision as well, so as to yield correct results for
3694 bit-field types. C++ does not have these separate bit-field
3695 types, and producing a signed or unsigned variant of an
3696 ENUMERAL_TYPE may cause other problems as well. */
3702 #define TYPE_OK(node) \
3703 (TYPE_MODE (type) == TYPE_MODE (node) \
3704 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3728 #if HOST_BITS_PER_WIDE_INT >= 64
3731 #endif
3740 #undef TYPE_OK
3743 }
3745 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3747 tree
3749 {
3752 /* Extended integer types of the same width as a standard type have
3753 lesser rank, so those of the same width as int promote to int or
3754 unsigned int and are valid for printf formats expecting int or
3755 unsigned int. To avoid such special cases, avoid creating
3756 extended integer types for bit-fields if a standard integer type
3757 is available. */
3775 }
3777 /* The C version of the register_builtin_type langhook. */
3779 void
3781 {
3782 tree decl;
3792 }
3793 \f
3794 /* Print an error message for invalid operands to arith operation
3795 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3796 LOCATION is the location of the message. */
3798 void
3801 {
3805 {
3850 }
3854 }
3855 \f
3856 /* Given an expression as a tree, return its original type. Do this
3857 by stripping any conversion that preserves the sign and precision. */
3858 static tree
3860 {
3863 }
3865 /* Subroutine of build_binary_op, used for comparison operations.
3866 See if the operands have both been converted from subword integer types
3867 and, if so, perhaps change them both back to their original type.
3868 This function is also responsible for converting the two operands
3869 to the proper common type for comparison.
3871 The arguments of this function are all pointers to local variables
3872 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3873 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3875 LOC is the location of the comparison.
3877 If this function returns nonzero, it means that the comparison has
3878 a constant value. What this function returns is an expression for
3879 that value. */
3881 tree
3884 {
3885 tree type;
3893 /* Throw away any conversions to wider types
3894 already present in the operands. */
3899 /* If primopN is first sign-extended from primopN's precision to opN's
3900 precision, then zero-extended from opN's precision to
3901 *restype_ptr precision, shortenings might be invalid. */
3904 && !unsignedp0
3909 && !unsignedp1
3913 /* Handle the case that OP0 does not *contain* a conversion
3914 but it *requires* conversion to FINAL_TYPE. */
3921 /* If one of the operands must be floated, we cannot optimize. */
3925 /* If first arg is constant, swap the args (changing operation
3926 so value is preserved), for canonicalization. Don't do this if
3927 the second arg is 0. */
3932 {
3941 {
3956 }
3958 }
3960 /* If comparing an integer against a constant more bits wide,
3961 maybe we can deduce a value of 1 or 0 independent of the data.
3962 Or else truncate the constant now
3963 rather than extend the variable at run time.
3965 This is only interesting if the constant is the wider arg.
3966 Also, it is not safe if the constant is unsigned and the
3967 variable arg is signed, since in this case the variable
3968 would be sign-extended and then regarded as unsigned.
3969 Our technique fails in this case because the lowest/highest
3970 possible unsigned results don't follow naturally from the
3971 lowest/highest possible values of the variable operand.
3972 For just EQ_EXPR and NE_EXPR there is another technique that
3973 could be used: see if the constant can be faithfully represented
3974 in the other operand's type, by truncating it and reextending it
3975 and see if that preserves the constant's value. */
3981 {
3984 /* 1 if comparison is nominally unsigned. */
3986 tree val;
3998 {
3999 /* Convert primop1 to target type, but do not introduce
4000 additional overflow. We know primop1 is an int_cst. */
4007 }
4009 {
4012 }
4020 /* This used to be a switch, but Genix compiler can't handle that. */
4022 {
4025 }
4027 {
4030 }
4032 {
4037 }
4039 {
4044 }
4046 {
4051 }
4053 {
4058 }
4060 /* If primop0 was sign-extended and unsigned comparison specd,
4061 we did a signed comparison above using the signed type bounds.
4062 But the comparison we output must be unsigned.
4064 Also, for inequalities, VAL is no good; but if the signed
4065 comparison had *any* fixed result, it follows that the
4066 unsigned comparison just tests the sign in reverse
4067 (positive values are LE, negative ones GE).
4068 So we can generate an unsigned comparison
4069 against an extreme value of the signed type. */
4072 {
4075 {
4090 }
4092 }
4095 /* Don't warn if it's from a (non-system) macro. */
4096 && !(from_macro_expansion_at
4097 (expansion_point_location_if_in_system_header
4099 {
4106 }
4109 {
4110 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4114 }
4116 /* Value is not predetermined, but do the comparison
4117 in the type of the operand that is not constant.
4118 TYPE is already properly set. */
4119 }
4121 /* If either arg is decimal float and the other is float, find the
4122 proper common type to use for comparison. */
4128 /* If either arg is decimal float and the other is float, fail. */
4139 /* If args' natural types are both narrower than nominal type
4140 and both extend in the same manner, compare them
4141 in the type of the wider arg.
4142 Otherwise must actually extend both to the nominal
4143 common type lest different ways of extending
4144 alter the result.
4145 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4150 {
4154 type);
4155 /* Make sure shorter operand is extended the right way
4156 to match the longer operand. */
4157 primop0
4160 primop0);
4161 primop1
4164 primop1);
4165 }
4166 else
4167 {
4168 /* Here we must do the comparison on the nominal type
4169 using the args exactly as we received them. */
4176 {
4178 /* All unsigned values are >= 0, so we warn. However,
4179 if OP0 is a constant that is >= 0, the signedness of
4180 the comparison isn't an issue, so suppress the
4181 warning. */
4186 primop0)))
4187 /* Do not warn for enumeration types. */
4191 {
4208 }
4211 {
4212 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4217 }
4218 }
4219 }
4227 }
4228 \f
4229 /* Return a tree for the sum or difference (RESULTCODE says which)
4230 of pointer PTROP and integer INTOP. */
4232 tree
4235 {
4238 /* The result is a pointer of the same type that is being added. */
4242 {
4249 }
4251 {
4258 }
4259 else
4262 /* We are manipulating pointer values, so we don't need to warn
4263 about relying on undefined signed overflow. We disable the
4264 warning here because we use integer types so fold won't know that
4265 they are really pointers. */
4268 /* If what we are about to multiply by the size of the elements
4269 contains a constant term, apply distributive law
4270 and multiply that constant term separately.
4271 This helps produce common subexpressions. */
4276 /* If the constant comes from pointer subtraction,
4277 skip this optimization--it would cause an error. */
4279 /* If the constant is unsigned, and smaller than the pointer size,
4280 then we must skip this optimization. This is because it could cause
4281 an overflow error if the constant is negative but INTOP is not. */
4285 {
4290 /* Convert both subexpression types to the type of intop,
4291 because weird cases involving pointer arithmetic
4292 can result in a sum or difference with different type args. */
4297 }
4299 /* Convert the integer argument to a type the same size as sizetype
4300 so the multiply won't overflow spuriously. */
4306 /* Replace the integer argument with a suitable product by the object size.
4307 Do this multiplication as signed, then convert to the appropriate type
4308 for the pointer operation and disregard an overflow that occurred only
4309 because of the sign-extension change in the latter conversion. */
4310 {
4316 }
4318 /* Create the sum or difference. */
4327 }
4328 \f
4329 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4330 and if NON_CONST is known not to be permitted in an evaluated part
4331 of a constant expression. */
4333 tree
4335 {
4339 /* This should never be called for C++. */
4343 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4352 }
4354 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4355 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4356 around the SAVE_EXPR if needed so that c_fully_fold does not need
4357 to look inside SAVE_EXPRs. */
4359 tree
4361 {
4370 }
4372 /* Return whether EXPR is a declaration whose address can never be
4373 NULL. */
4375 bool
4377 {
4382 }
4384 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4385 or for an `if' or `while' statement or ?..: exp. It should already
4386 have been validated to be of suitable type; otherwise, a bad
4387 diagnostic may result.
4389 The EXPR is located at LOCATION.
4391 This preparation consists of taking the ordinary
4392 representation of an expression expr and producing a valid tree
4393 boolean expression describing whether expr is nonzero. We could
4394 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4395 but we optimize comparisons, &&, ||, and !.
4397 The resulting type should always be `truthvalue_type_node'. */
4399 tree
4401 {
4403 {
4445 ? truthvalue_true_node
4451 ? truthvalue_true_node
4456 /* Fall through. */
4459 {
4462 {
4463 /* Common Ada/Pascal programmer's mistake. */
4465 OPT_Waddress,
4467 inner);
4469 }
4471 }
4488 /* These don't change whether an object is nonzero or zero. */
4493 /* These don't change whether an object is zero or nonzero, but
4494 we can't ignore them if their second arg has side-effects. */
4496 {
4499 c_common_truthvalue_conversion
4502 }
4503 else
4508 /* Distribute the conversion into the arms of a COND_EXPR. */
4510 {
4513 /* In C++ one of the arms might have void type if it is throw. */
4521 }
4522 else
4523 {
4524 /* Folding will happen later for C. */
4532 }
4534 CASE_CONVERT:
4535 {
4541 {
4547 OPT_Waddress,
4548 "the compiler can assume that the address of "
4550 inner);
4551 }
4553 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4554 since that affects how `default_conversion' will behave. */
4558 /* Don't strip a conversion from C++0x scoped enum, since they
4559 don't implicitly convert to other types. */
4563 /* If this isn't narrowing the argument, we can ignore it. */
4567 }
4573 {
4577 }
4582 }
4585 {
4587 expr = (build_binary_op
4591 c_common_truthvalue_conversion
4594 c_common_truthvalue_conversion
4599 }
4602 {
4607 }
4608 else
4611 ret:
4614 }
4615 \f
4624 /* Apply the TYPE_QUALS to the new DECL. */
4626 void
4628 {
4636 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4637 constructor can produce constant init, so rely on cp_finish_decl to
4638 clear TREE_READONLY if the variable has non-constant init. */
4641 {
4644 }
4646 {
4648 /* Allow 'restrict' on arrays of pointers.
4649 FIXME currently we just ignore it. */
4655 }
4656 }
4659 {
4662 };
4664 /* Hash function for the problem of multiple type definitions in
4665 different files. This must hash all types that will compare
4666 equal via comptypes to the same value. In practice it hashes
4667 on some of the simple stuff and leaves the details to comptypes. */
4669 hashval_t
4671 {
4674 tree t2;
4676 {
4677 /* For pointers, hash on pointee type plus some swizzling. */
4680 /* Hash on number of elements and total size. */
4699 }
4700 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4701 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4703 /* We might have a VLA here. */
4706 else
4709 }
4711 bool
4713 {
4715 }
4719 /* Return the typed-based alias set for T, which may be an expression
4720 or a type. Return -1 if we don't do anything special. */
4722 alias_set_type
4724 {
4725 tree u;
4727 /* For VLAs, use the alias set of the element type rather than the
4728 default of alias set 0 for types compared structurally. */
4730 {
4734 }
4736 /* Permit type-punning when accessing a union, provided the access
4737 is directly through the union. For example, this code does not
4738 permit taking the address of a union member and then storing
4739 through it. Even the type-punning allowed here is a GCC
4740 extension, albeit a common and useful one; the C standard says
4741 that such accesses have implementation-defined behavior. */
4749 /* That's all the expressions we handle specially. */
4753 /* The C standard guarantees that any object may be accessed via an
4754 lvalue that has character type. */
4760 /* The C standard specifically allows aliasing between signed and
4761 unsigned variants of the same type. We treat the signed
4762 variant as canonical. */
4764 {
4767 /* t1 == t can happen for boolean nodes which are always unsigned. */
4770 }
4772 /* Handle the case of multiple type nodes referring to "the same" type,
4773 which occurs with IMA. These share an alias set. FIXME: Currently only
4774 C90 is handled. (In C99 type compatibility is not transitive, which
4775 complicates things mightily. The alias set splay trees can theoretically
4776 represent this, but insertion is tricky when you consider all the
4777 different orders things might arrive in.) */
4782 /* Save time if there's only one input file. */
4786 /* Pointers need special handling if they point to any type that
4787 needs special handling (below). */
4789 {
4790 tree t2;
4791 /* Find bottom type under any nested POINTERs. */
4795 ;
4801 }
4802 /* These are the only cases that need special handling. */
4807 /* Undefined? */
4811 /* Look up t in hash table. Only one of the compatible types within each
4812 alias set is recorded in the table. */
4817 {
4820 }
4821 else
4822 /* Our caller will assign and record (in t) a new alias set; all we need
4823 to do is remember t in the hash table. */
4827 }
4828 \f
4829 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4830 the IS_SIZEOF parameter indicates which operator is being applied.
4831 The COMPLAIN flag controls whether we should diagnose possibly
4832 ill-formed constructs or not. LOC is the location of the SIZEOF or
4833 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4834 a type in any context should be returned, rather than the normal
4835 alignment for that type. */
4837 tree
4841 {
4849 {
4851 {
4858 }
4859 else
4860 {
4862 {
4866 else
4869 }
4871 }
4872 }
4874 {
4882 }
4885 {
4890 }
4893 {
4898 }
4899 else
4900 {
4902 /* Convert in case a char is more than one unit. */
4908 else
4910 }
4912 /* VALUE will have the middle-end integer type sizetype.
4913 However, we should really return a value of type `size_t',
4914 which is just a typedef for an ordinary integer type. */
4918 }
4920 /* Implement the __alignof keyword: Return the minimum required
4921 alignment of EXPR, measured in bytes. For VAR_DECLs,
4922 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4923 from an "aligned" __attribute__ specification). LOC is the
4924 location of the ALIGNOF operator. */
4926 tree
4928 {
4929 tree t;
4936 {
4939 }
4945 {
4952 {
4959 }
4961 }
4962 else
4966 }
4967 \f
4968 /* Handle C and C++ default attributes. */
4970 enum built_in_attribute
4971 {
4972 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4973 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4974 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4975 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4976 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4978 #undef DEF_ATTR_NULL_TREE
4979 #undef DEF_ATTR_INT
4980 #undef DEF_ATTR_STRING
4981 #undef DEF_ATTR_IDENT
4982 #undef DEF_ATTR_TREE_LIST
4983 ATTR_LAST
4984 };
4990 enum c_builtin_type
4991 {
4992 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4993 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4994 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4995 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4996 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4997 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4998 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4999 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5000 ARG6) NAME,
5001 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5002 ARG6, ARG7) NAME,
5003 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5004 ARG6, ARG7, ARG8) NAME,
5005 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5006 ARG6, ARG7, ARG8, ARG9) NAME,
5007 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5008 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5009 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5010 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5011 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5012 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5013 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5014 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5015 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5016 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5017 NAME,
5018 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5019 ARG6) NAME,
5020 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5021 ARG6, ARG7) NAME,
5022 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5024 #undef DEF_PRIMITIVE_TYPE
5025 #undef DEF_FUNCTION_TYPE_0
5026 #undef DEF_FUNCTION_TYPE_1
5027 #undef DEF_FUNCTION_TYPE_2
5028 #undef DEF_FUNCTION_TYPE_3
5029 #undef DEF_FUNCTION_TYPE_4
5030 #undef DEF_FUNCTION_TYPE_5
5031 #undef DEF_FUNCTION_TYPE_6
5032 #undef DEF_FUNCTION_TYPE_7
5033 #undef DEF_FUNCTION_TYPE_8
5034 #undef DEF_FUNCTION_TYPE_9
5035 #undef DEF_FUNCTION_TYPE_10
5036 #undef DEF_FUNCTION_TYPE_11
5037 #undef DEF_FUNCTION_TYPE_VAR_0
5038 #undef DEF_FUNCTION_TYPE_VAR_1
5039 #undef DEF_FUNCTION_TYPE_VAR_2
5040 #undef DEF_FUNCTION_TYPE_VAR_3
5041 #undef DEF_FUNCTION_TYPE_VAR_4
5042 #undef DEF_FUNCTION_TYPE_VAR_5
5043 #undef DEF_FUNCTION_TYPE_VAR_6
5044 #undef DEF_FUNCTION_TYPE_VAR_7
5045 #undef DEF_POINTER_TYPE
5046 BT_LAST
5047 };
5051 /* A temporary array for c_common_nodes_and_builtins. Used in
5052 communication with def_fn_type. */
5055 /* A helper function for c_common_nodes_and_builtins. Build function type
5056 for DEF with return type RET and N arguments. If VAR is true, then the
5057 function should be variadic after those N arguments.
5059 Takes special care not to ICE if any of the types involved are
5060 error_mark_node, which indicates that said type is not in fact available
5061 (see builtin_type_for_size). In which case the function type as a whole
5062 should be error_mark_node. */
5064 static void
5066 {
5067 tree t;
5074 {
5080 }
5087 else
5090 egress:
5093 }
5095 /* Build builtin functions common to both C and C++ language
5096 frontends. */
5098 static void
5100 {
5101 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5102 builtin_types[ENUM] = VALUE;
5103 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5104 def_fn_type (ENUM, RETURN, 0, 0);
5105 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5106 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5107 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5108 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5109 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5110 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5111 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5112 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5113 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5114 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5115 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5116 ARG6) \
5117 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5118 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5119 ARG6, ARG7) \
5120 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5121 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5122 ARG6, ARG7, ARG8) \
5123 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5124 ARG7, ARG8);
5125 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5126 ARG6, ARG7, ARG8, ARG9) \
5127 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5128 ARG7, ARG8, ARG9);
5129 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5130 ARG6, ARG7, ARG8, ARG9, ARG10) \
5131 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5132 ARG7, ARG8, ARG9, ARG10);
5133 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5134 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5135 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5136 ARG7, ARG8, ARG9, ARG10, ARG11);
5137 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5138 def_fn_type (ENUM, RETURN, 1, 0);
5139 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5140 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5141 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5142 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5143 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5144 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5145 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5146 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5147 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5148 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5149 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5150 ARG6) \
5151 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5152 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5153 ARG6, ARG7) \
5154 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5155 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5156 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5160 #undef DEF_PRIMITIVE_TYPE
5161 #undef DEF_FUNCTION_TYPE_0
5162 #undef DEF_FUNCTION_TYPE_1
5163 #undef DEF_FUNCTION_TYPE_2
5164 #undef DEF_FUNCTION_TYPE_3
5165 #undef DEF_FUNCTION_TYPE_4
5166 #undef DEF_FUNCTION_TYPE_5
5167 #undef DEF_FUNCTION_TYPE_6
5168 #undef DEF_FUNCTION_TYPE_7
5169 #undef DEF_FUNCTION_TYPE_8
5170 #undef DEF_FUNCTION_TYPE_9
5171 #undef DEF_FUNCTION_TYPE_10
5172 #undef DEF_FUNCTION_TYPE_11
5173 #undef DEF_FUNCTION_TYPE_VAR_0
5174 #undef DEF_FUNCTION_TYPE_VAR_1
5175 #undef DEF_FUNCTION_TYPE_VAR_2
5176 #undef DEF_FUNCTION_TYPE_VAR_3
5177 #undef DEF_FUNCTION_TYPE_VAR_4
5178 #undef DEF_FUNCTION_TYPE_VAR_5
5179 #undef DEF_FUNCTION_TYPE_VAR_6
5180 #undef DEF_FUNCTION_TYPE_VAR_7
5181 #undef DEF_POINTER_TYPE
5186 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5187 NONANSI_P, ATTRS, IMPLICIT, COND) \
5188 if (NAME && COND) \
5189 def_builtin_1 (ENUM, NAME, CLASS, \
5190 builtin_types[(int) TYPE], \
5191 builtin_types[(int) LIBTYPE], \
5192 BOTH_P, FALLBACK_P, NONANSI_P, \
5193 built_in_attributes[(int) ATTRS], IMPLICIT);
5202 }
5204 /* Like get_identifier, but avoid warnings about null arguments when
5205 the argument may be NULL for targets where GCC lacks stdint.h type
5206 information. */
5210 {
5212 }
5214 /* Build tree nodes and builtin functions common to both C and C++ language
5215 frontends. */
5217 void
5219 {
5223 tree array_domain_type;
5224 tree va_list_ref_type_node;
5225 tree va_list_arg_type_node;
5230 /* Define `int' and `char' first so that dbx will output them first. */
5234 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5235 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5236 but not C. Are the conditionals here needed? */
5242 long_unsigned_type_node);
5245 {
5253 }
5258 long_long_integer_type_node);
5260 long_long_unsigned_type_node);
5263 long_long_unsigned_type_node);
5266 short_unsigned_type_node);
5269 short_unsigned_type_node);
5271 /* Define both `signed char' and `unsigned char'. */
5275 /* These are types that c_common_type_for_size and
5276 c_common_type_for_mode use. */
5279 intQI_type_node));
5282 intHI_type_node));
5285 intSI_type_node));
5288 intDI_type_node));
5289 #if HOST_BITS_PER_WIDE_INT >= 64
5290 /* Note that this is different than the __int128 type that's part of
5291 the generic __intN support. */
5294 TYPE_DECL,
5296 intTI_type_node));
5297 #endif
5300 unsigned_intQI_type_node));
5303 unsigned_intHI_type_node));
5306 unsigned_intSI_type_node));
5309 unsigned_intDI_type_node));
5310 #if HOST_BITS_PER_WIDE_INT >= 64
5313 TYPE_DECL,
5315 unsigned_intTI_type_node));
5316 #endif
5318 /* Create the widest literal types. */
5319 widest_integer_literal_type_node
5323 widest_integer_literal_type_node));
5325 widest_unsigned_literal_type_node
5329 widest_unsigned_literal_type_node));
5333 pid_type_node =
5340 /* Only supported decimal floating point extension if the target
5341 actually supports underlying modes. */
5345 {
5349 }
5352 {
5357 long_long_fract_type_node);
5359 unsigned_short_fract_type_node);
5361 unsigned_fract_type_node);
5363 unsigned_long_fract_type_node);
5365 unsigned_long_long_fract_type_node);
5367 sat_short_fract_type_node);
5370 sat_long_fract_type_node);
5372 sat_long_long_fract_type_node);
5374 sat_unsigned_short_fract_type_node);
5376 sat_unsigned_fract_type_node);
5378 sat_unsigned_long_fract_type_node);
5380 sat_unsigned_long_long_fract_type_node);
5385 long_long_accum_type_node);
5387 unsigned_short_accum_type_node);
5389 unsigned_accum_type_node);
5391 unsigned_long_accum_type_node);
5393 unsigned_long_long_accum_type_node);
5395 sat_short_accum_type_node);
5398 sat_long_accum_type_node);
5400 sat_long_long_accum_type_node);
5402 sat_unsigned_short_accum_type_node);
5404 sat_unsigned_accum_type_node);
5406 sat_unsigned_long_accum_type_node);
5408 sat_unsigned_long_long_accum_type_node);
5410 }
5413 TYPE_DECL,
5415 complex_integer_type_node));
5417 TYPE_DECL,
5419 complex_float_type_node));
5421 TYPE_DECL,
5423 complex_double_type_node));
5427 complex_long_double_type_node));
5430 /* For C++, make fileptr_type_node a distinct void * type until
5431 FILE type is defined. */
5436 /* Set the TYPE_NAME for any variants that were built before
5437 record_builtin_type gave names to the built-in types. */
5438 {
5444 }
5448 /* Make a type to be the domain of a few array types
5449 whose domains don't really matter.
5450 200 is small enough that it always fits in size_t
5451 and large enough that it can hold most function names for the
5452 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5455 /* Make a type for arrays of characters.
5456 With luck nothing will ever really depend on the length of this
5457 array type. */
5458 char_array_type_node
5462 const_string_type_node
5466 /* This is special for C++ so functions can be overloaded. */
5472 {
5475 else
5478 }
5480 /* This is for wide string constants. */
5481 wchar_array_type_node
5484 /* Define 'char16_t'. */
5489 {
5494 }
5496 /* This is for UTF-16 string constants. */
5497 char16_array_type_node
5500 /* Define 'char32_t'. */
5505 {
5510 }
5512 /* This is for UTF-32 string constants. */
5513 char32_array_type_node
5516 wint_type_node =
5519 intmax_type_node =
5521 uintmax_type_node =
5525 sig_atomic_type_node =
5528 int8_type_node =
5531 int16_type_node =
5534 int32_type_node =
5537 int64_type_node =
5540 uint8_type_node =
5552 int_least8_type_node =
5555 int_least16_type_node =
5558 int_least32_type_node =
5561 int_least64_type_node =
5564 uint_least8_type_node =
5567 uint_least16_type_node =
5570 uint_least32_type_node =
5573 uint_least64_type_node =
5576 int_fast8_type_node =
5579 int_fast16_type_node =
5582 int_fast32_type_node =
5585 int_fast64_type_node =
5588 uint_fast8_type_node =
5591 uint_fast16_type_node =
5594 uint_fast32_type_node =
5597 uint_fast64_type_node =
5600 intptr_type_node =
5603 uintptr_type_node =
5606 default_function_type
5608 ptrdiff_type_node
5615 va_list_type_node));
5617 {
5620 tree ptype;
5623 {
5627 ptype));
5629 }
5630 }
5633 {
5636 }
5637 else
5638 {
5641 }
5648 /* Create the built-in __null node. It is important that this is
5649 not shared. */
5653 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5655 }
5657 /* The number of named compound-literals generated thus far. */
5660 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5662 void
5664 {
5667 compound_literal_number);
5668 compound_literal_number++;
5670 }
5672 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5673 TYPE and operand OP. */
5675 static tree
5677 {
5681 }
5683 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5684 va_arg (EXPR, TYPE) at source location LOC. */
5686 tree
5688 {
5691 ? NULL_TREE
5696 {
5697 /* Let's handle things neutrallly, if expr:
5698 - has undeclared type, or
5699 - is not an va_list type. */
5701 }
5704 {
5705 /* Case 1: Not an array type. */
5707 /* Take the address, to get '&ap'. */
5711 /* Verify that &ap is still recognized as having va_list type. */
5712 tree canon_expr_type
5717 }
5719 /* Case 2: Array type.
5721 Background:
5723 For contrast, let's start with the simple case (case 1). If
5724 canon_va_type is not an array type, but say a char *, then when
5725 passing-by-value a va_list, the type of the va_list param decl is
5726 the same as for another va_list decl (all ap's are char *):
5728 f2_1 (char * ap)
5729 D.1815 = VA_ARG (&ap, 0B, 1);
5730 return D.1815;
5732 f2 (int i)
5733 char * ap.0;
5734 char * ap;
5735 __builtin_va_start (&ap, 0);
5736 ap.0 = ap;
5737 res = f2_1 (ap.0);
5738 __builtin_va_end (&ap);
5739 D.1812 = res;
5740 return D.1812;
5742 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5743 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5744 the same as for another va_list decl (case 2a, struct ap[1]).
5746 f2_1 (struct * ap)
5747 D.1844 = VA_ARG (ap, 0B, 0);
5748 return D.1844;
5750 f2 (int i)
5751 struct ap[1];
5752 __builtin_va_start (&ap, 0);
5753 res = f2_1 (&ap);
5754 __builtin_va_end (&ap);
5755 D.1841 = res;
5756 return D.1841;
5758 Case 2b is different because:
5759 - on the callee side, the parm decl has declared type va_list, but
5760 grokdeclarator changes the type of the parm decl to a pointer to the
5761 array elem type.
5762 - on the caller side, the pass-by-value uses &ap.
5764 We unify these two cases (case 2a: va_list is array type,
5765 case 2b: va_list is pointer to array elem type), by adding '&' for the
5766 array type case, such that we have a pointer to array elem in both
5767 cases. */
5770 {
5771 /* Case 2a: va_list is array type. */
5773 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5774 elem type. */
5777 expr);
5779 /* Verify that &ap is still recognized as having va_list type. */
5780 tree canon_expr_type
5783 }
5784 else
5785 {
5786 /* Case 2b: va_list is pointer to array elem type. */
5790 /* Don't take the address. We've already got '&ap'. */
5791 ;
5792 }
5795 }
5798 /* Linked list of disabled built-in functions. */
5800 struct disabled_builtin
5801 {
5804 };
5809 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5810 begins with "__builtin_", give an error. */
5812 void
5814 {
5817 else
5818 {
5823 }
5824 }
5827 /* Return true if the built-in function NAME has been disabled, false
5828 otherwise. */
5830 static bool
5832 {
5835 {
5838 }
5840 }
5843 /* Worker for DEF_BUILTIN.
5844 Possibly define a builtin function with one or two names.
5845 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5846 nonansi_p and flag_no_nonansi_builtin. */
5848 static void
5855 {
5856 tree decl;
5869 fnattrs);
5878 }
5879 \f
5880 /* Nonzero if the type T promotes to int. This is (nearly) the
5881 integral promotions defined in ISO C99 6.3.1.1/2. */
5883 bool
5885 {
5887 {
5897 /* ??? Technically all enumerations not larger than an int
5898 promote to an int. But this is used along code paths
5899 that only want to notice a size change. */
5907 }
5908 }
5910 /* Return 1 if PARMS specifies a fixed number of parameters
5911 and none of their types is affected by default promotions. */
5913 int
5915 {
5916 const_tree t;
5918 {
5935 }
5937 }
5939 /* Recursively remove any '*' or '&' operator from TYPE. */
5940 tree
5942 {
5946 }
5948 /* Recursively remove pointer or array type from TYPE. */
5949 tree
5951 {
5955 }
5957 /* Used to compare case labels. K1 and K2 are actually tree nodes
5958 representing case labels, or NULL_TREE for a `default' label.
5959 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5960 K2, and 0 if K1 and K2 are equal. */
5962 int
5964 {
5965 /* Consider a NULL key (such as arises with a `default' label) to be
5966 smaller than anything else. */
5973 }
5975 /* Process a case label, located at LOC, for the range LOW_VALUE
5976 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5977 then this case label is actually a `default' label. If only
5978 HIGH_VALUE is NULL_TREE, then case label was declared using the
5979 usual C/C++ syntax, rather than the GNU case range extension.
5980 CASES is a tree containing all the case ranges processed so far;
5981 COND is the condition for the switch-statement itself.
5982 OUTSIDE_RANGE_P says whether there was a case value that doesn't
5983 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
5984 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
5986 tree
5989 {
5990 tree type;
5991 tree label;
5992 tree case_label;
5993 splay_tree_node node;
5995 /* Create the LABEL_DECL itself. */
5998 /* If there was an error processing the switch condition, bail now
5999 before we get more confused. */
6007 {
6010 }
6012 /* Case ranges are a GNU extension. */
6019 {
6024 }
6026 {
6031 }
6034 {
6035 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6036 really a case range, even though it was written that way.
6037 Remove the HIGH_VALUE to simplify later processing. */
6042 }
6044 /* See if the case is in range of the type of the original testing
6045 expression. If both low_value and high_value are out of range,
6046 don't insert the case label and return NULL_TREE. */
6050 outside_range_p))
6053 /* Look up the LOW_VALUE in the table of case labels we already
6054 have. */
6056 /* If there was not an exact match, check for overlapping ranges.
6057 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6058 that's a `default' label and the only overlap is an exact match. */
6060 {
6061 splay_tree_node low_bound;
6062 splay_tree_node high_bound;
6064 /* Even though there wasn't an exact match, there might be an
6065 overlap between this case range and another case range.
6066 Since we've (inductively) not allowed any overlapping case
6067 ranges, we simply need to find the greatest low case label
6068 that is smaller that LOW_VALUE, and the smallest low case
6069 label that is greater than LOW_VALUE. If there is an overlap
6070 it will occur in one of these two ranges. */
6076 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6077 the LOW_VALUE, so there is no need to check unless the
6078 LOW_BOUND is in fact itself a case range. */
6084 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6085 range is bigger than the low end of the current range, so we
6086 are only interested if the current range is a real range, and
6087 not an ordinary case label. */
6089 && high_value
6091 high_value)
6094 }
6095 /* If there was an overlap, issue an error. */
6097 {
6101 {
6105 }
6107 {
6110 }
6111 else
6112 {
6116 }
6118 }
6120 /* Add a CASE_LABEL to the statement-tree. */
6122 /* Register this case label in the splay tree. */
6129 error_out:
6130 /* Add a label so that the back-end doesn't think that the beginning of
6131 the switch is unreachable. Note that we do not add a case label, as
6132 that just leads to duplicates and thence to failure later on. */
6134 {
6137 }
6139 }
6141 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6142 Used to verify that case values match up with enumerator values. */
6144 static void
6146 {
6153 else
6160 buf);
6161 else
6166 }
6168 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6169 Used to verify that case values match up with enumerator values. */
6171 static int
6173 {
6177 /* Skip default case. */
6181 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6182 when we did our enum->case scan. Reset our scratch bit after. */
6185 else
6188 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6189 not set, that means that CASE_HIGH did not appear when we did our
6190 enum->case scan. Reset our scratch bit after. */
6192 {
6195 else
6197 }
6200 }
6202 /* Handle -Wswitch*. Called from the front end after parsing the
6203 switch construct. */
6204 /* ??? Should probably be somewhere generic, since other languages
6205 besides C and C++ would want this. At the moment, however, C/C++
6206 are the only tree-ssa languages that support enumerations at all,
6207 so the point is moot. */
6209 void
6213 {
6214 splay_tree_node default_node;
6215 splay_tree_node node;
6216 tree chain;
6227 /* There are certain cases where -Wswitch-bool warnings aren't
6228 desirable, such as
6229 switch (boolean)
6230 {
6231 case true: ...
6232 case false: ...
6233 }
6234 so be careful here. */
6236 {
6237 splay_tree_node min_node;
6238 /* If there's a default node, it's also the value with the minimal
6239 key. So look at the penultimate key (if any). */
6242 else
6247 /* This might be a case range, so look at the value with the
6248 maximal key and then check CASE_HIGH. */
6253 /* If there's a case value > 1 or < 0, that is outside bool
6254 range, warn. */
6258 /* And handle the
6259 switch (boolean)
6260 {
6261 case true: ...
6262 case false: ...
6263 default: ...
6264 }
6265 case, where we want to warn. */
6266 || (default_node
6271 }
6273 /* From here on, we only care about enumerated types. */
6277 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6281 /* Check the cases. Warn about case values which are not members of
6282 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6283 there is no default case, check that exactly all enumeration
6284 literals are covered by the cases. */
6286 /* Clearing COND if it is not an integer constant simplifies
6287 the tests inside the loop below. */
6291 /* The time complexity here is O(N*lg(N)) worst case, but for the
6292 common case of monotonically increasing enumerators, it is
6293 O(N), since the nature of the splay tree will keep the next
6294 element adjacent to the root at all times. */
6297 {
6303 {
6304 /* Mark the CASE_LOW part of the case entry as seen. */
6308 }
6310 /* Even though there wasn't an exact match, there might be a
6311 case range which includes the enumerator's value. */
6314 {
6318 {
6319 /* If we match the upper bound exactly, mark the CASE_HIGH
6320 part of the case entry as seen. */
6324 }
6325 }
6327 /* We've now determined that this enumerated literal isn't
6328 handled by the case labels of the switch statement. */
6330 /* If the switch expression is a constant, we only really care
6331 about whether that constant is handled by the switch. */
6335 /* If there is a default_node, the only relevant option is
6336 Wswitch-enum. Otherwise, if both are enabled then we prefer
6337 to warn using -Wswitch because -Wswitch is enabled by -Wall
6338 while -Wswitch-enum is explicit. */
6341 ? OPT_Wswitch_enum
6345 }
6347 /* Warn if there are case expressions that don't correspond to
6348 enumerators. This can occur since C and C++ don't enforce
6349 type-checking of assignments to enumeration variables.
6351 The time complexity here is now always O(N) worst case, since
6352 we should have marked both the lower bound and upper bound of
6353 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6354 above. This scan also resets those fields. */
6357 }
6359 /* Finish an expression taking the address of LABEL (an
6360 IDENTIFIER_NODE). Returns an expression for the address.
6362 LOC is the location for the expression returned. */
6364 tree
6366 {
6367 tree result;
6377 else
6378 {
6381 /* The current function is not necessarily uninlinable.
6382 Computed gotos are incompatible with inlining, but the value
6383 here could be used only in a diagnostic, for example. */
6385 }
6388 }
6389 \f
6391 /* Given a boolean expression ARG, return a tree representing an increment
6392 or decrement (as indicated by CODE) of ARG. The front end must check for
6393 invalid cases (e.g., decrement in C++). */
6394 tree
6396 {
6397 tree val;
6402 {
6425 }
6428 }
6429 \f
6430 /* Built-in macros for stddef.h and stdint.h, that require macros
6431 defined in this file. */
6432 void
6434 {
6497 }
6499 static void
6501 {
6502 /* Fill in the built_in_attributes array. */
6503 #define DEF_ATTR_NULL_TREE(ENUM) \
6504 built_in_attributes[(int) ENUM] = NULL_TREE;
6505 #define DEF_ATTR_INT(ENUM, VALUE) \
6506 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6507 #define DEF_ATTR_STRING(ENUM, VALUE) \
6508 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6509 #define DEF_ATTR_IDENT(ENUM, STRING) \
6510 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6511 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6512 built_in_attributes[(int) ENUM] \
6513 = tree_cons (built_in_attributes[(int) PURPOSE], \
6514 built_in_attributes[(int) VALUE], \
6515 built_in_attributes[(int) CHAIN]);
6517 #undef DEF_ATTR_NULL_TREE
6518 #undef DEF_ATTR_INT
6519 #undef DEF_ATTR_IDENT
6520 #undef DEF_ATTR_TREE_LIST
6521 }
6523 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6524 identifier as an argument, so the front end shouldn't look it up. */
6526 bool
6528 {
6531 /* Unknown attribute that we'll end up ignoring, return true so we
6532 don't complain about an identifier argument. */
6538 else
6540 }
6542 /* Attribute handlers common to C front ends. */
6544 /* Handle a "packed" attribute; arguments as in
6545 struct attribute_spec.handler. */
6547 static tree
6550 {
6552 {
6556 }
6558 {
6560 /* Still pack bitfields. */
6565 else
6567 }
6568 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6569 used for DECL_REGISTER. It wouldn't mean anything anyway.
6570 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6571 that changes what the typedef is typing. */
6572 else
6573 {
6576 }
6579 }
6581 /* Handle a "nocommon" attribute; arguments as in
6582 struct attribute_spec.handler. */
6584 static tree
6588 {
6591 else
6592 {
6595 }
6598 }
6600 /* Handle a "common" attribute; arguments as in
6601 struct attribute_spec.handler. */
6603 static tree
6606 {
6609 else
6610 {
6613 }
6616 }
6618 /* Handle a "noreturn" attribute; arguments as in
6619 struct attribute_spec.handler. */
6621 static tree
6624 {
6627 /* See FIXME comment in c_common_attribute_table. */
6634 = (build_qualified_type
6635 (build_pointer_type
6639 else
6640 {
6643 }
6646 }
6648 /* Handle a "hot" and attribute; arguments as in
6649 struct attribute_spec.handler. */
6651 static tree
6654 {
6657 {
6659 {
6663 }
6664 /* Most of the rest of the hot processing is done later with
6665 lookup_attribute. */
6666 }
6667 else
6668 {
6671 }
6674 }
6676 /* Handle a "cold" and attribute; arguments as in
6677 struct attribute_spec.handler. */
6679 static tree
6682 {
6685 {
6687 {
6691 }
6692 /* Most of the rest of the cold processing is done later with
6693 lookup_attribute. */
6694 }
6695 else
6696 {
6699 }
6702 }
6704 /* Handle a "no_sanitize_address" attribute; arguments as in
6705 struct attribute_spec.handler. */
6707 static tree
6710 {
6712 {
6715 }
6718 }
6720 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6721 struct attribute_spec.handler. */
6723 static tree
6726 {
6735 }
6737 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6738 struct attribute_spec.handler. */
6740 static tree
6743 {
6745 {
6748 }
6751 }
6753 /* Handle a "stack_protect" attribute; arguments as in
6754 struct attribute_spec.handler. */
6755 static tree
6758 {
6760 {
6763 }
6764 else
6770 }
6772 /* Handle a "noinline" attribute; arguments as in
6773 struct attribute_spec.handler. */
6775 static tree
6779 {
6781 {
6783 {
6787 }
6788 else
6790 }
6791 else
6792 {
6795 }
6798 }
6800 /* Handle a "noclone" attribute; arguments as in
6801 struct attribute_spec.handler. */
6803 static tree
6807 {
6809 {
6812 }
6815 }
6817 /* Handle a "no_icf" attribute; arguments as in
6818 struct attribute_spec.handler. */
6820 static tree
6824 {
6826 {
6829 }
6832 }
6835 /* Handle a "always_inline" attribute; arguments as in
6836 struct attribute_spec.handler. */
6838 static tree
6843 {
6845 {
6847 {
6851 }
6853 {
6857 }
6858 else
6859 /* Set the attribute and mark it for disregarding inline
6860 limits. */
6862 }
6863 else
6864 {
6867 }
6870 }
6872 /* Handle a "gnu_inline" attribute; arguments as in
6873 struct attribute_spec.handler. */
6875 static tree
6880 {
6882 {
6883 /* Do nothing else, just set the attribute. We'll get at
6884 it later with lookup_attribute. */
6885 }
6886 else
6887 {
6890 }
6893 }
6895 /* Handle a "leaf" attribute; arguments as in
6896 struct attribute_spec.handler. */
6898 static tree
6902 {
6904 {
6907 }
6909 {
6912 }
6915 }
6917 /* Handle an "artificial" attribute; arguments as in
6918 struct attribute_spec.handler. */
6920 static tree
6925 {
6927 {
6928 /* Do nothing else, just set the attribute. We'll get at
6929 it later with lookup_attribute. */
6930 }
6931 else
6932 {
6935 }
6938 }
6940 /* Handle a "flatten" attribute; arguments as in
6941 struct attribute_spec.handler. */
6943 static tree
6945 tree args ATTRIBUTE_UNUSED,
6947 {
6949 /* Do nothing else, just set the attribute. We'll get at
6950 it later with lookup_attribute. */
6951 ;
6952 else
6953 {
6956 }
6959 }
6961 /* Handle a "warning" or "error" attribute; arguments as in
6962 struct attribute_spec.handler. */
6964 static tree
6967 {
6970 /* Do nothing else, just set the attribute. We'll get at
6971 it later with lookup_attribute. */
6972 ;
6973 else
6974 {
6977 }
6980 }
6982 /* Handle a "used" attribute; arguments as in
6983 struct attribute_spec.handler. */
6985 static tree
6988 {
6994 {
6999 }
7000 else
7001 {
7004 }
7007 }
7009 /* Handle a "unused" attribute; arguments as in
7010 struct attribute_spec.handler. */
7012 static tree
7015 {
7017 {
7024 {
7028 }
7029 else
7030 {
7033 }
7034 }
7035 else
7036 {
7040 }
7043 }
7045 /* Handle a "externally_visible" attribute; arguments as in
7046 struct attribute_spec.handler. */
7048 static tree
7053 {
7057 {
7060 {
7064 }
7065 }
7066 else
7067 {
7070 }
7073 }
7075 /* Handle the "no_reorder" attribute. Arguments as in
7076 struct attribute_spec.handler. */
7078 static tree
7080 tree name,
7081 tree,
7084 {
7089 {
7092 name);
7094 }
7097 }
7099 /* Handle a "const" attribute; arguments as in
7100 struct attribute_spec.handler. */
7102 static tree
7105 {
7108 /* See FIXME comment on noreturn in c_common_attribute_table. */
7114 = (build_qualified_type
7115 (build_pointer_type
7119 else
7120 {
7123 }
7126 }
7128 /* Handle a "scalar_storage_order" attribute; arguments as in
7129 struct attribute_spec.handler. */
7131 static tree
7134 {
7136 tree type;
7144 {
7148 }
7151 {
7160 else
7161 {
7165 }
7168 {
7170 /* A type variant isn't good enough, since we don't want a cast
7171 to such a type to be removed as a no-op. */
7173 }
7177 }
7182 }
7184 /* Handle a "transparent_union" attribute; arguments as in
7185 struct attribute_spec.handler. */
7187 static tree
7191 {
7192 tree type;
7202 {
7203 /* Make sure that the first field will work for a transparent union.
7204 If the type isn't complete yet, leave the check to the code in
7205 finish_struct. */
7207 {
7213 }
7216 {
7217 /* If the type isn't complete yet, setting the flag
7218 on a variant wouldn't ever be checked. */
7222 /* build_duplicate_type doesn't work for C++. */
7226 /* A type variant isn't good enough, since we don't want a cast
7227 to such a type to be removed as a no-op. */
7229 }
7234 }
7236 ignored:
7239 }
7241 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7242 get the requested priority for a constructor or destructor,
7243 possibly issuing diagnostics for invalid or reserved
7244 priorities. */
7246 static priority_type
7248 {
7249 HOST_WIDE_INT pri;
7250 tree arg;
7256 {
7259 else
7262 }
7279 {
7282 "destructor priorities from 0 to %d are reserved "
7284 MAX_RESERVED_INIT_PRIORITY);
7285 else
7287 "constructor priorities from 0 to %d are reserved "
7289 MAX_RESERVED_INIT_PRIORITY);
7290 }
7293 invalid:
7296 MAX_INIT_PRIORITY);
7297 else
7299 MAX_INIT_PRIORITY);
7301 }
7303 /* Handle a "constructor" attribute; arguments as in
7304 struct attribute_spec.handler. */
7306 static tree
7310 {
7317 {
7318 priority_type priority;
7323 }
7324 else
7325 {
7328 }
7331 }
7333 /* Handle a "destructor" attribute; arguments as in
7334 struct attribute_spec.handler. */
7336 static tree
7340 {
7347 {
7348 priority_type priority;
7353 }
7354 else
7355 {
7358 }
7361 }
7363 /* Nonzero if the mode is a valid vector mode for this architecture.
7364 This returns nonzero even if there is no hardware support for the
7365 vector mode, but we can emulate with narrower modes. */
7367 static int
7369 {
7371 machine_mode innermode;
7373 /* Doh! What's going on? */
7382 /* Hardware support. Woo hoo! */
7388 /* We should probably return 1 if requesting V4DI and we have no DI,
7389 but we have V2DI, but this is probably very unlikely. */
7391 /* If we have support for the inner mode, we can safely emulate it.
7392 We may not have V2DI, but me can emulate with a pair of DIs. */
7394 }
7397 /* Handle a "mode" attribute; arguments as in
7398 struct attribute_spec.handler. */
7400 static tree
7403 {
7411 else
7412 {
7417 tree typefm;
7422 {
7428 }
7430 /* Change this type to have a type with the specified mode.
7431 First check for the special modes. */
7444 else
7447 {
7450 }
7453 {
7456 }
7460 {
7492 }
7494 {
7497 }
7500 {
7505 {
7508 }
7512 else
7515 }
7516 else
7517 {
7518 /* For fixed-point modes, we need to test if the signness of type
7519 and the machine mode are consistent. */
7522 {
7525 }
7526 /* For fixed-point modes, we need to pass saturating info. */
7530 }
7533 {
7536 }
7538 {
7539 /* For enumeral types, copy the precision from the integer
7540 type returned above. If not an INTEGER_TYPE, we can't use
7541 this mode for this type. */
7543 {
7546 }
7549 {
7552 }
7553 else
7554 {
7555 /* We cannot build a type variant, as there's code that assumes
7556 that TYPE_MAIN_VARIANT has the same mode. This includes the
7557 debug generators. Instead, create a subrange type. This
7558 results in all of the enumeral values being emitted only once
7559 in the original, and the subtype gets them by reference. */
7562 else
7565 }
7566 }
7570 {
7573 }
7576 }
7579 }
7581 /* Handle a "section" attribute; arguments as in
7582 struct attribute_spec.handler. */
7584 static tree
7587 {
7591 {
7595 }
7600 {
7603 }
7606 {
7609 }
7614 {
7618 }
7620 /* The decl may have already been given a section attribute
7621 from a previous declaration. Ensure they match. */
7625 {
7628 }
7633 {
7636 }
7641 fail:
7644 }
7646 /* Check whether ALIGN is a valid user-specified alignment. If so,
7647 return its base-2 log; if not, output an error and return -1. If
7648 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7649 no error. */
7650 int
7652 {
7659 {
7662 }
7667 {
7670 }
7672 {
7675 }
7677 }
7679 /*
7680 If in c++-11, check if the c++-11 alignment constraint with respect
7681 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7682 c++-11 mode, does nothing.
7684 [dcl.align]2/ says:
7686 [* if the constant expression evaluates to a fundamental alignment,
7687 the alignment requirement of the declared entity shall be the
7688 specified fundamental alignment.
7690 * if the constant expression evaluates to an extended alignment
7691 and the implementation supports that alignment in the context
7692 of the declaration, the alignment of the declared entity shall
7693 be that alignment
7695 * if the constant expression evaluates to an extended alignment
7696 and the implementation does not support that alignment in the
7697 context of the declaration, the program is ill-formed]. */
7699 static bool
7703 {
7716 {
7718 {
7719 /* For file scope variables and static members, the target
7720 supports alignments that are at most
7721 MAX_OFILE_ALIGNMENT. */
7724 }
7725 else
7726 {
7727 #ifdef BIGGEST_FIELD_ALIGNMENT
7728 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7729 #else
7730 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7731 #endif
7732 /* For non-static members, the target supports either
7733 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7734 if it is defined or BIGGEST_ALIGNMENT. */
7739 #undef MAX_TARGET_FIELD_ALIGNMENT
7740 /* For stack variables, the target supports at most
7741 MAX_STACK_ALIGNMENT. */
7745 }
7746 }
7748 {
7749 /* Let's be liberal for types. */
7752 }
7760 }
7762 /* Handle a "aligned" attribute; arguments as in
7763 struct attribute_spec.handler. */
7765 static tree
7768 {
7772 tree align_expr;
7776 {
7781 }
7782 else
7786 {
7790 }
7798 {
7801 /* If we have a TYPE_DECL, then copy the type, so that we
7802 don't accidentally modify a builtin type. See pushdecl. */
7805 {
7812 }
7813 else
7818 }
7821 {
7824 }
7827 /* C++-11 [dcl.align/4]:
7829 When multiple alignment-specifiers are specified for an
7830 entity, the alignment requirement shall be set to the
7831 strictest specified alignment.
7833 This formally comes from the c++11 specification but we are
7834 doing it for the GNU attribute syntax as well. */
7838 {
7843 else
7847 }
7848 else
7849 {
7852 }
7855 }
7857 /* Handle a "weak" attribute; arguments as in
7858 struct attribute_spec.handler. */
7860 static tree
7865 {
7868 {
7871 }
7873 {
7877 }
7880 else
7884 }
7886 /* Handle a "noplt" attribute; arguments as in
7887 struct attribute_spec.handler. */
7889 static tree
7894 {
7896 {
7901 }
7903 }
7905 /* Handle an "alias" or "ifunc" attribute; arguments as in
7906 struct attribute_spec.handler, except that IS_ALIAS tells us
7907 whether this is an alias as opposed to ifunc attribute. */
7909 static tree
7912 {
7917 {
7920 }
7924 /* A static variable declaration is always a tentative definition,
7925 but the alias is a non-tentative definition which overrides. */
7928 {
7932 }
7936 {
7940 }
7942 /* Note that the very first time we process a nested declaration,
7943 decl_function_context will not be set. Indeed, *would* never
7944 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7945 we do below. After such frobbery, pushdecl would set the context.
7946 In any case, this is never what we want. */
7948 {
7949 tree id;
7953 {
7957 }
7959 /* This counts as a use of the object pointed to. */
7964 else
7968 /* ifuncs are also aliases, so set that attribute too. */
7971 }
7972 else
7973 {
7976 }
7979 {
7982 {
7985 else
7987 }
7988 }
7992 }
7994 /* Handle an "alias" or "ifunc" attribute; arguments as in
7995 struct attribute_spec.handler. */
7997 static tree
8000 {
8002 }
8004 /* Handle an "alias" or "ifunc" attribute; arguments as in
8005 struct attribute_spec.handler. */
8007 static tree
8010 {
8012 }
8014 /* Handle a "weakref" attribute; arguments as in struct
8015 attribute_spec.handler. */
8017 static tree
8020 {
8023 /* We must ignore the attribute when it is associated with
8024 local-scoped decls, since attribute alias is ignored and many
8025 such symbols do not even have a DECL_WEAK field. */
8027 || current_function_decl
8029 {
8033 }
8036 {
8040 }
8042 /* The idea here is that `weakref("name")' mutates into `weakref,
8043 alias("name")', and weakref without arguments, in turn,
8044 implicitly adds weak. */
8047 {
8054 }
8055 else
8056 {
8061 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8062 and that isn't supported; and because it wants to add it to
8063 the list of weak decls, which isn't helpful. */
8065 }
8068 {
8072 }
8075 }
8077 /* Handle an "visibility" attribute; arguments as in
8078 struct attribute_spec.handler. */
8080 static tree
8084 {
8090 {
8094 {
8096 name);
8098 }
8100 {
8104 }
8105 }
8107 {
8110 }
8113 {
8116 }
8118 /* If this is a type, set the visibility on the type decl. */
8120 {
8125 {
8127 name);
8129 }
8130 }
8140 else
8141 {
8142 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8144 }
8148 {
8162 }
8167 /* Go ahead and attach the attribute to the node as well. This is needed
8168 so we can determine whether we have VISIBILITY_DEFAULT because the
8169 visibility was not specified, or because it was explicitly overridden
8170 from the containing scope. */
8173 }
8175 /* Determine the ELF symbol visibility for DECL, which is either a
8176 variable or a function. It is an error to use this function if a
8177 definition of DECL is not available in this translation unit.
8178 Returns true if the final visibility has been determined by this
8179 function; false if the caller is free to make additional
8180 modifications. */
8182 bool
8184 {
8187 /* If the user explicitly specified the visibility with an
8188 attribute, honor that. DECL_VISIBILITY will have been set during
8189 the processing of the attribute. We check for an explicit
8190 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8191 to distinguish the use of an attribute from the use of a "#pragma
8192 GCC visibility push(...)"; in the latter case we still want other
8193 considerations to be able to overrule the #pragma. */
8195 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8200 /* Set default visibility to whatever the user supplied with
8201 visibility_specified depending on #pragma GCC visibility. */
8203 {
8206 {
8209 /* If visibility changed and DECL already has DECL_RTL, ensure
8210 symbol flags are updated. */
8215 }
8216 }
8218 }
8220 /* Handle an "tls_model" attribute; arguments as in
8221 struct attribute_spec.handler. */
8223 static tree
8226 {
8227 tree id;
8234 {
8237 }
8242 {
8245 }
8255 else
8256 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8260 }
8262 /* Handle a "no_instrument_function" attribute; arguments as in
8263 struct attribute_spec.handler. */
8265 static tree
8270 {
8274 {
8278 }
8279 else
8283 }
8285 /* Handle a "malloc" attribute; arguments as in
8286 struct attribute_spec.handler. */
8288 static tree
8291 {
8295 else
8296 {
8299 }
8302 }
8304 /* Handle a "alloc_size" attribute; arguments as in
8305 struct attribute_spec.handler. */
8307 static tree
8310 {
8313 {
8320 || !arg_count
8322 {
8327 }
8328 }
8330 }
8332 /* Handle a "alloc_align" attribute; arguments as in
8333 struct attribute_spec.handler. */
8335 static tree
8338 {
8345 || !arg_count
8347 {
8352 }
8354 }
8356 /* Handle a "assume_aligned" attribute; arguments as in
8357 struct attribute_spec.handler. */
8359 static tree
8362 {
8364 {
8371 {
8376 }
8377 }
8379 }
8381 /* Handle a "fn spec" attribute; arguments as in
8382 struct attribute_spec.handler. */
8384 static tree
8388 {
8393 }
8395 /* Handle a "bnd_variable_size" attribute; arguments as in
8396 struct attribute_spec.handler. */
8398 static tree
8401 {
8403 {
8406 }
8409 }
8411 /* Handle a "bnd_legacy" attribute; arguments as in
8412 struct attribute_spec.handler. */
8414 static tree
8417 {
8419 {
8422 }
8425 }
8427 /* Handle a "bnd_instrument" attribute; arguments as in
8428 struct attribute_spec.handler. */
8430 static tree
8433 {
8435 {
8438 }
8441 }
8443 /* Handle a "warn_unused" attribute; arguments as in
8444 struct attribute_spec.handler. */
8446 static tree
8448 tree args ATTRIBUTE_UNUSED,
8450 {
8452 /* Do nothing else, just set the attribute. We'll get at
8453 it later with lookup_attribute. */
8454 ;
8455 else
8456 {
8459 }
8462 }
8464 /* Handle an "omp declare simd" attribute; arguments as in
8465 struct attribute_spec.handler. */
8467 static tree
8469 {
8471 }
8473 /* Handle a "simd" attribute. */
8475 static tree
8477 {
8479 {
8482 {
8484 "%<__simd__%> attribute cannot be used in the same "
8487 }
8488 else
8489 {
8493 {
8497 {
8501 }
8505 OMP_CLAUSE_NOTINBRANCH);
8506 else
8509 OMP_CLAUSE_INBRANCH);
8510 else
8511 {
8516 }
8517 }
8521 attr),
8523 }
8524 }
8525 else
8526 {
8529 }
8532 }
8534 /* Handle an "omp declare target" attribute; arguments as in
8535 struct attribute_spec.handler. */
8537 static tree
8539 {
8541 }
8543 /* Handle a "returns_twice" attribute; arguments as in
8544 struct attribute_spec.handler. */
8546 static tree
8549 {
8552 else
8553 {
8556 }
8559 }
8561 /* Handle a "no_limit_stack" attribute; arguments as in
8562 struct attribute_spec.handler. */
8564 static tree
8569 {
8573 {
8577 }
8579 {
8583 }
8584 else
8588 }
8590 /* Handle a "pure" attribute; arguments as in
8591 struct attribute_spec.handler. */
8593 static tree
8596 {
8599 /* ??? TODO: Support types. */
8600 else
8601 {
8604 }
8607 }
8609 /* Digest an attribute list destined for a transactional memory statement.
8610 ALLOWED is the set of attributes that are allowed for this statement;
8611 return the attribute we parsed. Multiple attributes are never allowed. */
8613 int
8615 {
8620 {
8628 {
8631 }
8634 {
8637 }
8640 else
8642 }
8645 }
8647 /* Transform a TM attribute name into a maskable integer and back.
8648 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8649 to how the lack of an attribute is treated. */
8651 int
8653 {
8667 }
8669 tree
8671 {
8674 {
8692 }
8694 }
8696 /* Return the first TM attribute seen in LIST. */
8698 tree
8700 {
8702 {
8706 }
8708 }
8710 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8711 Here we accept only function types, and verify that none of the other
8712 function TM attributes are also applied. */
8713 /* ??? We need to accept class types for C++, but not C. This greatly
8714 complicates this function, since we can no longer rely on the extra
8715 processing given by function_type_required. */
8717 static tree
8720 {
8721 /* Only one path adds the attribute; others don't. */
8725 {
8728 /* Only tm_callable and tm_safe apply to classes. */
8731 /* FALLTHRU */
8735 {
8738 ;
8741 else
8743 }
8747 {
8748 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8749 want to set transaction_safe on the type. */
8753 "%<transaction_safe_dynamic%> may only be specified for "
8758 NULL_TREE),
8761 }
8764 {
8767 {
8772 }
8773 }
8774 /* FALLTHRU */
8777 /* If a function is next, pass it on to be tried next. */
8781 ignored:
8784 }
8787 }
8789 /* Handle the TM_WRAP attribute; arguments as in
8790 struct attribute_spec.handler. */
8792 static tree
8795 {
8798 /* We don't need the attribute even on success, since we
8799 record the entry in an external table. */
8804 else
8805 {
8808 ;
8812 else
8813 {
8817 {
8821 else
8823 }
8824 else
8826 }
8827 }
8830 }
8832 /* Ignore the given attribute. Used when this attribute may be usefully
8833 overridden by the target, but is not used generically. */
8835 static tree
8839 {
8842 }
8844 /* Handle a "no vops" attribute; arguments as in
8845 struct attribute_spec.handler. */
8847 static tree
8851 {
8855 }
8857 /* Handle a "deprecated" attribute; arguments as in
8858 struct attribute_spec.handler. */
8860 static tree
8864 {
8872 {
8875 }
8878 {
8889 else
8891 }
8893 {
8898 }
8899 else
8903 {
8906 {
8912 }
8915 else
8917 }
8920 }
8922 /* Handle a "vector_size" attribute; arguments as in
8923 struct attribute_spec.handler. */
8925 static tree
8929 {
8931 machine_mode orig_mode;
8942 {
8945 }
8947 /* Get the vector size (in bytes). */
8950 /* We need to provide for vector pointers, vector arrays, and
8951 functions returning vectors. For example:
8953 __attribute__((vector_size(16))) short *foo;
8955 In this case, the mode is SI, but the type being modified is
8956 HI, so we need to look further. */
8965 /* Get the mode of the type being modified. */
8976 {
8979 }
8982 {
8985 }
8988 {
8991 }
8993 /* Calculate how many units fit in the vector. */
8996 {
8999 }
9003 /* Build back pointers if needed. */
9007 }
9009 /* Handle the "nonnull" attribute. */
9010 static tree
9014 {
9018 /* If no arguments are specified, all pointer arguments should be
9019 non-null. Verify a full prototype is given so that the arguments
9020 will have the correct types when we actually check them later. */
9022 {
9024 {
9027 }
9029 }
9031 /* Argument list specified. Verify that each argument number references
9032 a pointer argument. */
9034 {
9043 {
9048 }
9051 {
9052 function_args_iterator iter;
9053 tree argument;
9057 {
9061 }
9065 {
9070 }
9073 {
9078 }
9079 }
9080 }
9083 }
9085 /* Check the argument list of a function call for null in argument slots
9086 that are marked as requiring a non-null pointer argument. The NARGS
9087 arguments are passed in the array ARGARRAY.
9088 */
9090 static void
9092 {
9093 tree a;
9101 /* See if any of the nonnull attributes has no arguments. If so,
9102 then every pointer argument is checked (in which case the check
9103 for pointer type is done in check_nonnull_arg). */
9105 do
9113 else
9114 {
9115 /* Walk the argument list. If we encounter an argument number we
9116 should check for non-null, do it. */
9118 {
9120 {
9124 }
9129 }
9130 }
9131 }
9133 /* Check that the Nth argument of a function call (counting backwards
9134 from the end) is a (pointer)0. The NARGS arguments are passed in the
9135 array ARGARRAY. */
9137 static void
9139 {
9143 {
9146 tree sentinel;
9147 function_args_iterator iter;
9148 tree t;
9150 /* Skip over the named arguments. */
9152 {
9155 len++;
9156 }
9159 {
9162 }
9164 /* The sentinel must be one of the varargs, i.e.
9165 in position >= the number of fixed arguments. */
9167 {
9171 }
9173 /* Validate the sentinel. */
9177 /* Although __null (in C++) is only an integer we allow it
9178 nevertheless, as we are guaranteed that it's exactly
9179 as wide as a pointer, and we don't want to force
9180 users to cast the NULL they have written there.
9181 We warn with -Wstrict-null-sentinel, though. */
9184 }
9185 }
9187 /* Helper for check_function_nonnull; given a list of operands which
9188 must be non-null in ARGS, determine if operand PARAM_NUM should be
9189 checked. */
9191 static bool
9193 {
9197 {
9204 }
9206 }
9208 /* Check that the function argument PARAM (which is operand number
9209 PARAM_NUM) is non-null. This is called by check_function_nonnull
9210 via check_function_arguments_recurse. */
9212 static void
9215 {
9216 /* Just skip checking the argument if it's not a pointer. This can
9217 happen if the "nonnull" attribute was given without an operand
9218 list (which means to check every pointer argument). */
9226 }
9228 /* Helper for nonnull attribute handling; fetch the operand number
9229 from the attribute argument list. */
9231 static bool
9233 {
9234 /* Verify the arg number is a small constant. */
9236 {
9239 }
9240 else
9242 }
9244 /* Handle a "nothrow" attribute; arguments as in
9245 struct attribute_spec.handler. */
9247 static tree
9250 {
9253 /* ??? TODO: Support types. */
9254 else
9255 {
9258 }
9261 }
9263 /* Handle a "cleanup" attribute; arguments as in
9264 struct attribute_spec.handler. */
9266 static tree
9269 {
9273 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9274 for global destructors in C++. This requires infrastructure that
9275 we don't have generically at the moment. It's also not a feature
9276 we'd be missing too much, since we do have attribute constructor. */
9278 {
9282 }
9284 /* Verify that the argument is a function in scope. */
9285 /* ??? We could support pointers to functions here as well, if
9286 that was considered desirable. */
9289 {
9293 }
9296 {
9300 }
9302 /* That the function has proper type is checked with the
9303 eventual call to build_function_call. */
9306 }
9308 /* Handle a "warn_unused_result" attribute. No special handling. */
9310 static tree
9314 {
9315 /* Ignore the attribute for functions not returning any value. */
9317 {
9320 }
9323 }
9325 /* Handle a "sentinel" attribute. */
9327 static tree
9330 {
9332 {
9336 }
9337 else
9338 {
9340 {
9344 }
9345 }
9348 {
9356 {
9360 }
9361 else
9362 {
9364 {
9368 }
9369 }
9370 }
9373 }
9375 /* Handle a "type_generic" attribute. */
9377 static tree
9381 {
9382 /* Ensure we have a function type. */
9385 /* Ensure we have a variadic function. */
9389 }
9391 /* Handle a "target" attribute. */
9393 static tree
9396 {
9397 /* Ensure we have a function type. */
9399 {
9402 }
9404 {
9408 }
9410 flags))
9414 }
9416 /* Handle a "target_clones" attribute. */
9418 static tree
9421 {
9422 /* Ensure we have a function type. */
9424 {
9426 {
9430 }
9432 {
9436 }
9437 else
9438 /* Do not inline functions with multiple clone targets. */
9440 }
9441 else
9442 {
9445 }
9447 }
9449 /* Arguments being collected for optimization. */
9454 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9455 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9456 false for #pragma GCC optimize. */
9458 bool
9460 {
9467 tree ap;
9469 /* Build up argv vector. Just in case the string is stored away, use garbage
9470 collected strings. */
9475 {
9479 {
9483 }
9486 {
9487 /* Split string into multiple substrings. */
9495 {
9502 {
9506 }
9507 else
9508 {
9511 }
9515 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9516 options. */
9518 {
9523 else
9527 }
9530 {
9533 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9534 itself is -Os, and any other switch begins with a -f. */
9540 }
9545 }
9547 }
9548 }
9556 /* Now parse the options. */
9568 }
9570 /* For handling "optimize" attribute. arguments as in
9571 struct attribute_spec.handler. */
9573 static tree
9576 {
9577 /* Ensure we have a function type. */
9579 {
9582 }
9583 else
9584 {
9588 /* Save current options. */
9591 /* If we previously had some optimization options, use them as the
9592 default. */
9597 /* Parse options, and update the vector. */
9602 /* Restore current options. */
9604 }
9607 }
9609 /* Handle a "no_split_stack" attribute. */
9611 static tree
9616 {
9620 {
9624 }
9626 {
9630 }
9633 }
9635 /* Handle a "returns_nonnull" attribute; arguments as in
9636 struct attribute_spec.handler. */
9638 static tree
9641 {
9642 // Even without a prototype we still have a return type we can check.
9644 {
9647 }
9649 }
9651 /* Handle a "designated_init" attribute; arguments as in
9652 struct attribute_spec.handler. */
9654 static tree
9657 {
9659 {
9662 }
9664 }
9666 \f
9667 /* Check for valid arguments being passed to a function with FNTYPE.
9668 There are NARGS arguments in the array ARGARRAY. */
9669 void
9671 {
9672 /* Check for null being passed in a pointer argument that must be
9673 non-null. We also need to do this if format checking is enabled. */
9678 /* Check for errors in format strings. */
9685 }
9687 /* Generic argument checking recursion routine. PARAM is the argument to
9688 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9689 once the argument is resolved. CTX is context for the callback. */
9690 void
9695 {
9699 {
9700 /* Strip coercion. */
9704 }
9707 {
9709 tree attrs;
9712 /* See if this is a call to a known internationalization function
9713 that modifies a format arg. Such a function may have multiple
9714 format_arg attributes (for example, ngettext). */
9717 attrs;
9720 {
9721 tree inner_arg;
9722 tree format_num_expr;
9725 call_expr_arg_iterator iter;
9727 /* Extract the argument number, which was previously checked
9728 to be valid. */
9737 {
9742 }
9743 }
9745 /* If we found a format_arg attribute and did a recursive check,
9746 we are done with checking this argument. Otherwise, we continue
9747 and this will be considered a non-literal. */
9750 }
9753 {
9755 /* Check both halves of the conditional expression. */
9763 }
9766 }
9768 /* Checks for a builtin function FNDECL that the number of arguments
9769 NARGS against the required number REQUIRED and issues an error if
9770 there is a mismatch. Returns true if the number of arguments is
9771 correct, otherwise false. */
9773 static bool
9775 {
9777 {
9781 }
9783 {
9787 }
9789 }
9791 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9792 Returns false if there was an error, otherwise true. */
9794 bool
9796 {
9802 {
9813 {
9815 {
9819 }
9821 }
9831 {
9838 {
9842 }
9844 }
9849 {
9854 {
9858 }
9861 {
9863 fndecl);
9865 }
9867 }
9872 {
9874 {
9877 }
9879 }
9886 {
9890 {
9894 }
9897 {
9901 }
9903 }
9908 }
9909 }
9911 /* Function to help qsort sort FIELD_DECLs by name order. */
9913 int
9915 {
9920 /* A nontype is "greater" than a type. */
9929 }
9932 gt_pointer_operator new_value;
9936 /* This routine compares two fields like field_decl_cmp but using the
9937 pointer operator in resort_data. */
9939 static int
9941 {
9946 /* A nontype is "greater" than a type. */
9952 {
9959 }
9961 }
9963 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9965 void
9968 gt_pointer_operator new_value,
9970 {
9975 resort_field_decl_cmp);
9976 }
9978 /* Subroutine of c_parse_error.
9979 Return the result of concatenating LHS and RHS. RHS is really
9980 a string literal, its first character is indicated by RHS_START and
9981 RHS_SIZE is its length (including the terminating NUL character).
9983 The caller is responsible for deleting the returned pointer. */
9987 {
9993 }
9995 /* Issue the error given by GMSGID, indicating that it occurred before
9996 TOKEN, which had the associated VALUE. */
9998 void
10001 {
10002 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10013 {
10018 {
10034 }
10038 else
10044 }
10067 {
10072 }
10080 {
10085 }
10086 else
10090 {
10093 }
10094 #undef catenate_messages
10095 }
10097 /* Return the gcc option code associated with the reason for a cpp
10098 message, or 0 if none. */
10100 static int
10102 {
10106 {
10109 }
10111 }
10113 /* Callback from cpp_error for PFILE to print diagnostics from the
10114 preprocessor. The diagnostic is of type LEVEL, with REASON set
10115 to the reason code if LEVEL is represents a warning, at location
10116 RICHLOC unless this is after lexing and the compiler's location
10117 should be used instead; MSG is the translated message and AP
10118 the arguments. Returns true if a diagnostic was emitted, false
10119 otherwise. */
10121 bool
10125 {
10126 diagnostic_info diagnostic;
10127 diagnostic_t dlevel;
10132 {
10137 /* Fall through. */
10162 }
10175 }
10177 /* Convert a character from the host to the target execution character
10178 set. cpplib handles this, mostly. */
10180 HOST_WIDE_INT
10182 {
10183 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10184 zero-extended under -fno-signed-char. cpplib insists that characters
10185 and character constants are always unsigned. Hence we must convert
10186 back and forth. */
10194 else
10196 }
10198 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10199 references with an INDIRECT_REF of a constant at the bottom; much like the
10200 traditional rendering of offsetof as a macro. Return the folded result. */
10202 tree
10204 {
10208 {
10224 {
10227 }
10237 {
10241 }
10254 /* Check if the offset goes beyond the upper bound of the array. */
10256 {
10262 {
10267 {
10268 tree v;
10275 {
10283 }
10284 /* Don't warn if the array might be considered a poor
10285 man's flexible array member with a very permissive
10286 definition thereof. */
10290 "index %E denotes an offset "
10293 }
10294 }
10295 }
10302 /* Handle static members of volatile structs. */
10309 }
10312 }
10314 /* Likewise, but convert it to the return type of offsetof. */
10316 tree
10318 {
10320 }
10322 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10323 expression, because B will always be true. */
10325 void
10327 {
10330 "the omitted middle operand in ?: will always be %<true%>, "
10332 }
10334 /* Give an error for storing into ARG, which is 'const'. USE indicates
10335 how ARG was being used. */
10337 void
10339 {
10342 /* Using this macro rather than (for example) arrays of messages
10343 ensures that all the format strings are checked at compile
10344 time. */
10345 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10346 : (use == lv_increment ? (I) \
10347 : (use == lv_decrement ? (D) : (AS))))
10349 {
10360 else
10366 }
10372 arg);
10378 arg);
10380 {
10390 arg);
10391 }
10397 arg);
10398 else
10403 arg);
10404 }
10406 /* Print an error message for an invalid lvalue. USE says
10407 how the lvalue is being used and so selects the error message. LOC
10408 is the location for the error. */
10410 void
10412 {
10414 {
10432 }
10433 }
10435 /* Print an error message for an invalid indirection of type TYPE.
10436 ERRSTRING is the name of the operator for the indirection. */
10438 void
10440 {
10442 {
10450 type);
10455 type);
10460 type);
10465 type);
10470 type);
10474 }
10475 }
10476 \f
10477 /* *PTYPE is an incomplete array. Complete it with a domain based on
10478 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10479 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10480 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10482 int
10484 {
10492 {
10494 {
10495 int eltsize
10498 }
10500 {
10504 {
10508 }
10509 else
10510 {
10511 tree curindex;
10522 {
10526 else
10527 {
10529 {
10530 /* Since we treat size types now as ordinary
10531 unsigned types, we need an explicit overflow
10532 check. */
10536 }
10538 size_one_node);
10539 }
10542 }
10544 {
10548 }
10549 }
10550 }
10551 else
10552 {
10553 /* Make an error message unless that happened already. */
10556 }
10557 }
10558 else
10559 {
10563 }
10570 else
10573 /* Using build_distinct_type_copy and modifying things afterward instead
10574 of using build_array_type to create a new type preserves all of the
10575 TYPE_LANG_FLAG_? bits that the front end may have set. */
10583 /* Make sure we have the canonical MAIN_TYPE. */
10586 hashcode);
10589 /* Fix the canonical type. */
10599 else
10604 else
10610 {
10612 /* If we proceed with the array type as it is, we'll eventually
10613 crash in tree_to_[su]hwi(). */
10615 }
10619 }
10621 /* Like c_mark_addressable but don't check register qualifier. */
10622 void
10624 {
10630 }
10633 \f
10634 /* Used to help initialize the builtin-types.def table. When a type of
10635 the correct size doesn't exist, use error_mark_node instead of NULL.
10636 The later results in segfaults even when a decl using the type doesn't
10637 get invoked. */
10639 tree
10641 {
10644 }
10646 /* A helper function for resolve_overloaded_builtin in resolving the
10647 overloaded __sync_ builtins. Returns a positive power of 2 if the
10648 first operand of PARAMS is a pointer to a supported data type.
10649 Returns 0 if an error is encountered. */
10651 static int
10653 {
10654 tree type;
10658 {
10661 }
10665 {
10666 /* Force array-to-pointer decay for C++. */
10670 }
10682 incompatible:
10685 }
10687 /* A helper function for resolve_overloaded_builtin. Adds casts to
10688 PARAMS to make arguments match up with those of FUNCTION. Drops
10689 the variadic arguments at the end. Returns false if some error
10690 was encountered; true on success. */
10692 static bool
10695 {
10696 function_args_iterator iter;
10697 tree ptype;
10701 /* We've declared the implementation functions to use "volatile void *"
10702 as the pointer parameter, so we shouldn't get any complaints from the
10703 call to check_function_arguments what ever type the user used. */
10708 /* For the rest of the values, we need to cast these to FTYPE, so that we
10709 don't get warnings for passing pointer types, etc. */
10712 {
10716 /* XXX void_type_node belies the abstraction. */
10722 {
10725 }
10727 /* Only convert parameters if arg_type is unsigned integer type with
10728 new format sync routines, i.e. don't attempt to convert pointer
10729 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10730 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10731 kinds). */
10733 {
10734 /* Ideally for the first conversion we'd use convert_for_assignment
10735 so that we get warnings for anything that doesn't match the pointer
10736 type. This isn't portable across the C and C++ front ends atm. */
10741 }
10744 }
10746 /* __atomic routines are not variadic. */
10748 {
10751 }
10753 /* The definition of these primitives is variadic, with the remaining
10754 being "an optional list of variables protected by the memory barrier".
10755 No clue what that's supposed to mean, precisely, but we consider all
10756 call-clobbered variables to be protected so we're safe. */
10760 }
10762 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10763 RESULT to make it match the type of the first pointer argument in
10764 PARAMS. */
10766 static tree
10768 {
10773 /* New format doesn't require casting unless the types are the same size. */
10776 else
10778 }
10780 /* This function verifies the PARAMS to generic atomic FUNCTION.
10781 It returns the size if all the parameters are the same size, otherwise
10782 0 is returned if the parameters are invalid. */
10784 static int
10787 {
10792 tree type_0;
10794 /* Determine the parameter makeup. */
10796 {
10812 }
10815 {
10818 }
10820 /* Get type of first parameter, and determine its size. */
10823 {
10824 /* Force array-to-pointer decay for C++. */
10828 }
10830 {
10832 function);
10834 }
10836 /* Types must be compile time constant sizes. */
10838 {
10841 function);
10843 }
10847 /* Zero size objects are not allowed. */
10849 {
10852 function);
10854 }
10856 /* Check each other parameter is a pointer and the same size. */
10858 {
10861 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10865 {
10867 function);
10869 }
10873 {
10875 function);
10877 }
10878 }
10880 /* Check memory model parameters for validity. */
10882 {
10885 {
10888 {
10891 function);
10892 }
10893 }
10894 else
10896 {
10898 function);
10900 }
10901 }
10904 }
10907 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10908 at the beginning of the parameter list PARAMS representing the size of the
10909 objects. This is to match the library ABI requirement. LOC is the location
10910 of the function call.
10911 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10912 returned to allow the external call to be constructed. */
10914 static tree
10917 {
10918 tree size_node;
10920 /* Insert a SIZE_T parameter as the first param. If there isn't
10921 enough space, allocate a new vector and recursively re-build with that. */
10923 {
10926 tree f;
10936 }
10938 /* Add the size parameter and leave as a function call for processing. */
10942 }
10945 /* Return whether atomic operations for naturally aligned N-byte
10946 arguments are supported, whether inline or through libatomic. */
10947 static bool
10949 {
10951 {
10963 }
10964 }
10966 /* This will process an __atomic_exchange function call, determine whether it
10967 needs to be mapped to the _N variation, or turned into a library call.
10968 LOC is the location of the builtin call.
10969 FUNCTION is the DECL that has been invoked;
10970 PARAMS is the argument list for the call. The return value is non-null
10971 TRUE is returned if it is translated into the proper format for a call to the
10972 external library, and NEW_RETURN is set the tree for that function.
10973 FALSE is returned if processing for the _N variation is required, and
10974 NEW_RETURN is set to the return value the result is copied into. */
10975 static bool
10978 {
10983 /* Size of 0 is an error condition. */
10985 {
10988 }
10990 /* If not a lock-free size, change to the library generic format. */
10992 {
10995 }
10997 /* Otherwise there is a lockfree match, transform the call from:
10998 void fn(T* mem, T* desired, T* return, model)
10999 into
11000 *return = (T) (fn (In* mem, (In) *desired, model)) */
11007 /* Create pointer to appropriate size. */
11011 /* Convert object pointer to required type. */
11014 /* Convert new value to required type, and dereference it. */
11019 /* Move memory model to the 3rd position, and end param list. */
11023 /* Convert return pointer and dereference it for later assignment. */
11027 }
11030 /* This will process an __atomic_compare_exchange function call, determine
11031 whether it needs to be mapped to the _N variation, or turned into a lib call.
11032 LOC is the location of the builtin call.
11033 FUNCTION is the DECL that has been invoked;
11034 PARAMS is the argument list for the call. The return value is non-null
11035 TRUE is returned if it is translated into the proper format for a call to the
11036 external library, and NEW_RETURN is set the tree for that function.
11037 FALSE is returned if processing for the _N variation is required. */
11039 static bool
11043 {
11048 /* Size of 0 is an error condition. */
11050 {
11053 }
11055 /* If not a lock-free size, change to the library generic format. */
11057 {
11058 /* The library generic format does not have the weak parameter, so
11059 remove it from the param list. Since a parameter has been removed,
11060 we can be sure that there is room for the SIZE_T parameter, meaning
11061 there will not be a recursive rebuilding of the parameter list, so
11062 there is no danger this will be done twice. */
11064 {
11068 }
11071 }
11073 /* Otherwise, there is a match, so the call needs to be transformed from:
11074 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11075 into
11076 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11082 /* Create pointer to appropriate size. */
11086 /* Convert object pointer to required type. */
11090 /* Convert expected pointer to required type. */
11094 /* Convert desired value to required type, and dereference it. */
11099 /* The rest of the parameters are fine. NULL means no special return value
11100 processing.*/
11103 }
11106 /* This will process an __atomic_load function call, determine whether it
11107 needs to be mapped to the _N variation, or turned into a library call.
11108 LOC is the location of the builtin call.
11109 FUNCTION is the DECL that has been invoked;
11110 PARAMS is the argument list for the call. The return value is non-null
11111 TRUE is returned if it is translated into the proper format for a call to the
11112 external library, and NEW_RETURN is set the tree for that function.
11113 FALSE is returned if processing for the _N variation is required, and
11114 NEW_RETURN is set to the return value the result is copied into. */
11116 static bool
11119 {
11124 /* Size of 0 is an error condition. */
11126 {
11129 }
11131 /* If not a lock-free size, change to the library generic format. */
11133 {
11136 }
11138 /* Otherwise, there is a match, so the call needs to be transformed from:
11139 void fn(T* mem, T* return, model)
11140 into
11141 *return = (T) (fn ((In *) mem, model)) */
11147 /* Create pointer to appropriate size. */
11151 /* Convert object pointer to required type. */
11155 /* Move memory model to the 2nd position, and end param list. */
11159 /* Convert return pointer and dereference it for later assignment. */
11163 }
11166 /* This will process an __atomic_store function call, determine whether it
11167 needs to be mapped to the _N variation, or turned into a library call.
11168 LOC is the location of the builtin call.
11169 FUNCTION is the DECL that has been invoked;
11170 PARAMS is the argument list for the call. The return value is non-null
11171 TRUE is returned if it is translated into the proper format for a call to the
11172 external library, and NEW_RETURN is set the tree for that function.
11173 FALSE is returned if processing for the _N variation is required, and
11174 NEW_RETURN is set to the return value the result is copied into. */
11176 static bool
11179 {
11184 /* Size of 0 is an error condition. */
11186 {
11189 }
11191 /* If not a lock-free size, change to the library generic format. */
11193 {
11196 }
11198 /* Otherwise, there is a match, so the call needs to be transformed from:
11199 void fn(T* mem, T* value, model)
11200 into
11201 fn ((In *) mem, (In) *value, model) */
11206 /* Create pointer to appropriate size. */
11210 /* Convert object pointer to required type. */
11214 /* Convert new value to required type, and dereference it. */
11219 /* The memory model is in the right spot already. Return is void. */
11223 }
11226 /* Some builtin functions are placeholders for other expressions. This
11227 function should be called immediately after parsing the call expression
11228 before surrounding code has committed to the type of the expression.
11230 LOC is the location of the builtin call.
11232 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11233 PARAMS is the argument list for the call. The return value is non-null
11234 when expansion is complete, and null if normal processing should
11235 continue. */
11237 tree
11240 {
11246 {
11252 else
11256 }
11258 /* Handle BUILT_IN_NORMAL here. */
11260 {
11265 {
11266 /* Handle these 4 together so that they can fall through to the next
11267 case if the call is transformed to an _N variant. */
11269 {
11271 {
11275 /* Change to the _N variant. */
11278 }
11281 {
11283 params,
11286 /* Change to the _N variant. */
11289 }
11291 {
11295 /* Change to the _N variant. */
11298 }
11300 {
11304 /* Change to the _N variant. */
11307 }
11310 }
11311 /* Fallthrough to the normal processing. */
11312 }
11329 {
11331 /* Fallthru for parameter processing. */
11332 }
11349 {
11360 orig_format))
11365 NULL);
11373 /* If new_return is set, assign function to that expr and cast the
11374 result to void since the generic interface returned void. */
11376 {
11377 /* Cast function result from I{1,2,4,8,16} to the required type. */
11380 result);
11384 }
11386 }
11390 }
11391 }
11393 /* vector_types_compatible_elements_p is used in type checks of vectors
11394 values used as operands of binary operators. Where it returns true, and
11395 the other checks of the caller succeed (being vector types in he first
11396 place, and matching number of elements), we can just treat the types
11397 as essentially the same.
11398 Contrast with vector_targets_convertible_p, which is used for vector
11399 pointer types, and vector_types_convertible_p, which will allow
11400 language-specific matches under the control of flag_lax_vector_conversions,
11401 and might still require a conversion. */
11402 /* True if vector types T1 and T2 can be inputs to the same binary
11403 operator without conversion.
11404 We don't check the overall vector size here because some of our callers
11405 want to give different error messages when the vectors are compatible
11406 except for the element count. */
11408 bool
11410 {
11423 /* Equality works here because c_common_signed_type uses
11424 TYPE_MAIN_VARIANT. */
11432 }
11434 /* Check for missing format attributes on function pointers. LTYPE is
11435 the new type or left-hand side type. RTYPE is the old type or
11436 right-hand side type. Returns TRUE if LTYPE is missing the desired
11437 attribute. */
11439 bool
11441 {
11443 tree ra;
11449 {
11450 tree la;
11455 }
11456 else
11458 }
11460 /* Subscripting with type char is likely to lose on a machine where
11461 chars are signed. So warn on any machine, but optionally. Don't
11462 warn for unsigned char since that type is safe. Don't warn for
11463 signed char because anyone who uses that must have done so
11464 deliberately. Furthermore, we reduce the false positive load by
11465 warning only for non-constant value of type char. */
11467 void
11469 {
11474 }
11476 /* Implement -Wparentheses for the unexpected C precedence rules, to
11477 cover cases like x + y << z which readers are likely to
11478 misinterpret. We have seen an expression in which CODE is a binary
11479 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11480 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11481 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11482 expression was not formed using a binary or unary operator, or it
11483 was enclosed in parentheses. */
11485 void
11489 {
11493 /* This macro tests that the expression ARG with original tree code
11494 CODE appears to be a boolean expression. or the result of folding a
11495 boolean expression. */
11496 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11497 (truth_value_p (TREE_CODE (ARG)) \
11498 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11500 || ((CODE) != INTEGER_CST \
11501 && (integer_onep (ARG) || integer_zerop (ARG))))
11504 {
11553 /* Check cases like x|y==z */
11560 /* Check cases like !x | y */
11564 "suggest parentheses around operand of "
11577 /* Check cases like x^y==z */
11599 /* Check cases like x&y==z */
11606 /* Check cases like !x & y */
11610 "suggest parentheses around operand of "
11633 {
11638 "comparisons like %<X<=Y<=Z%> do not "
11644 "comparisons like %<X<=Y<=Z%> do not "
11646 }
11648 }
11649 #undef NOT_A_BOOLEAN_EXPR_P
11650 }
11652 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11654 void
11656 {
11658 {
11661 else
11663 }
11664 }
11666 /* Warn for division by zero according to the value of DIVISOR. LOC
11667 is the location of the division operator. */
11669 void
11671 {
11672 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11673 about division by zero. Do not issue a warning if DIVISOR has a
11674 floating-point type, since we consider 0.0/0.0 a valid way of
11675 generating a NaN. */
11679 }
11681 /* Subroutine of build_binary_op. Give warnings for comparisons
11682 between signed and unsigned quantities that may fail. Do the
11683 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11684 so that casts will be considered, but default promotions won't
11685 be.
11687 LOCATION is the location of the comparison operator.
11689 The arguments of this function map directly to local variables
11690 of build_binary_op. */
11692 void
11697 {
11702 /* In C++, check for comparison of different enum types. */
11708 {
11712 }
11714 /* Do not warn if the comparison is being done in a signed type,
11715 since the signed type will only be chosen if it can represent
11716 all the values of the unsigned type. */
11719 /* Do not warn if both operands are unsigned. */
11722 else
11723 {
11729 else
11737 /* Do not warn if the signed quantity is an unsuffixed integer
11738 literal (or some static constant expression involving such
11739 literals or a conditional expression involving such literals)
11740 and it is non-negative. */
11743 /* Do not warn if the comparison is an equality operation, the
11744 unsigned quantity is an integral constant, and it would fit
11745 in the result if the result were signed. */
11750 /* In C, do not warn if the unsigned quantity is an enumeration
11751 constant and its maximum value would fit in the result if the
11752 result were signed. */
11758 else
11760 OPT_Wsign_compare,
11762 }
11764 /* Warn if two unsigned values are being compared in a size larger
11765 than their original size, and one (and only one) is the result of
11766 a `~' operator. This comparison will always fail.
11768 Also warn if one operand is a constant, and the constant does not
11769 have all bits set that are set in the ~ operand when it is
11770 extended. */
11777 {
11784 {
11785 tree primop;
11791 {
11795 }
11796 else
11797 {
11801 }
11806 {
11809 {
11813 else
11816 }
11817 }
11818 }
11826 }
11827 }
11829 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11830 type via c_common_type. If -Wdouble-promotion is in use, and the
11831 conditions for warning have been met, issue a warning. GMSGID is
11832 the warning message. It must have two %T specifiers for the type
11833 that was converted (generally "float") and the type to which it was
11834 converted (generally "double), respectively. LOC is the location
11835 to which the awrning should refer. */
11837 void
11840 {
11841 tree source_type;
11845 /* If the conversion will not occur at run-time, there is no need to
11846 warn about it. */
11858 else
11861 }
11863 /* Possibly warn about unused parameters. */
11865 void
11867 {
11868 tree decl;
11877 }
11880 /* Setup a TYPE_DECL node as a typedef representation.
11882 X is a TYPE_DECL for a typedef statement. Create a brand new
11883 ..._TYPE node (which will be just a variant of the existing
11884 ..._TYPE node with identical properties) and then install X
11885 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11887 The whole point here is to end up with a situation where each
11888 and every ..._TYPE node the compiler creates will be uniquely
11889 associated with AT MOST one node representing a typedef name.
11890 This way, even though the compiler substitutes corresponding
11891 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11892 early on, later parts of the compiler can always do the reverse
11893 translation and get back the corresponding typedef name. For
11894 example, given:
11896 typedef struct S MY_TYPE;
11897 MY_TYPE object;
11899 Later parts of the compiler might only know that `object' was of
11900 type `struct S' if it were not for code just below. With this
11901 code however, later parts of the compiler see something like:
11903 struct S' == struct S
11904 typedef struct S' MY_TYPE;
11905 struct S' object;
11907 And they can then deduce (from the node for type struct S') that
11908 the original object declaration was:
11910 MY_TYPE object;
11912 Being able to do this is important for proper support of protoize,
11913 and also for generating precise symbolic debugging information
11914 which takes full account of the programmer's (typedef) vocabulary.
11916 Obviously, we don't want to generate a duplicate ..._TYPE node if
11917 the TYPE_DECL node that we are now processing really represents a
11918 standard built-in type. */
11920 void
11922 {
11926 {
11929 }
11932 {
11940 }
11941 }
11943 /* Record the types used by the current global variable declaration
11944 being parsed, so that we can decide later to emit their debug info.
11945 Those types are in types_used_by_cur_var_decl, and we are going to
11946 store them in the types_used_by_vars_hash hash table.
11947 DECL is the declaration of the global variable that has been parsed. */
11949 void
11951 {
11955 {
11958 }
11959 }
11961 /* If DECL is a typedef that is declared in the current function,
11962 record it for the purpose of -Wunused-local-typedefs. */
11964 void
11966 {
11971 /* if this is not a locally defined typedef then we are not
11972 interested. */
11979 }
11981 /* If T is a TYPE_DECL declared locally, mark it as used. */
11983 void
11985 {
11990 }
11992 /* Warn if there are some unused locally defined typedefs in the
11993 current function. */
11995 void
11997 {
11999 tree decl;
12000 /* The number of times we have emitted -Wunused-local-typedefs
12001 warnings. If this is different from errorcount, that means some
12002 unrelated errors have been issued. In which case, we'll avoid
12003 emitting "unused-local-typedefs" warnings. */
12015 {
12019 OPT_Wunused_local_typedefs,
12022 }
12025 }
12027 /* Warn about boolean expression compared with an integer value different
12028 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12029 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12030 are the operands of the comparison. The caller must ensure that
12031 either operand is a boolean expression. */
12033 void
12035 tree op1)
12036 {
12047 else
12051 {
12059 else
12062 }
12064 {
12065 /* If the non-constant operand isn't of a boolean type, we
12066 don't want to warn here. */
12068 /* Handle booleans promoted to integers. */
12076 /* Do some magic to get the right diagnostics. */
12085 }
12086 }
12088 /* Warn if signed left shift overflows. We don't warn
12089 about left-shifting 1 into the sign bit in C++14; cf.
12090 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12091 LOC is a location of the shift; OP0 and OP1 are the operands.
12092 Return true if an overflow is detected, false otherwise. */
12094 bool
12096 {
12104 /* Left-hand operand must be signed. */
12110 /* Handle the case of left-shifting 1 into the sign bit.
12111 * However, shifting 1 _out_ of the sign bit, as in
12112 * INT_MIN << 1, is considered an overflow.
12113 */
12115 {
12116 /* Never warn for C++14 onwards. */
12119 /* Otherwise only if -Wshift-overflow=2. But return
12120 true to signal an overflow for the sake of integer
12121 constant expressions. */
12124 }
12129 "result of %qE requires %u bits to represent, "
12135 }
12137 /* The C and C++ parsers both use vectors to hold function arguments.
12138 For efficiency, we keep a cache of unused vectors. This is the
12139 cache. */
12144 /* Return a new vector from the cache. If the cache is empty,
12145 allocate a new vector. These vectors are GC'ed, so it is OK if the
12146 pointer is not released.. */
12150 {
12153 else
12154 {
12155 /* Passing 0 to vec::alloc returns NULL, and our callers require
12156 that we always return a non-NULL value. The vector code uses
12157 4 when growing a NULL vector, so we do too. */
12161 }
12162 }
12164 /* Release a vector of trees back to the cache. */
12166 void
12168 {
12170 {
12173 }
12174 }
12176 /* Get a new tree vector holding a single tree. */
12180 {
12184 }
12186 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12190 {
12195 }
12197 /* Get a new tree vector which is a copy of an existing one. */
12201 {
12204 tree t;
12211 }
12213 /* Return true if KEYWORD starts a type specifier. */
12215 bool
12217 {
12219 {
12253 }
12254 }
12256 /* Return true if KEYWORD names a type qualifier. */
12258 bool
12260 {
12262 {
12270 }
12271 }
12273 /* Return true if KEYWORD names a storage class specifier.
12275 RID_TYPEDEF is not included in this list despite `typedef' being
12276 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12277 such for syntactic convenience only. */
12279 bool
12281 {
12283 {
12293 }
12294 }
12296 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12298 static bool
12300 {
12302 {
12310 }
12311 }
12313 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12314 declaration-specifier (C99 6.7). */
12316 bool
12318 {
12325 {
12332 }
12333 }
12335 /* Initialize language-specific-bits of tree_contains_struct. */
12337 void
12339 {
12343 }
12345 /* Build a user-defined numeric literal out of an integer constant type VALUE
12346 with identifier SUFFIX. */
12348 tree
12351 {
12358 }
12360 /* For vector[index], convert the vector to a
12361 pointer of the underlying type. Return true if the resulting
12362 ARRAY_REF should not be an lvalue. */
12364 bool
12367 {
12370 {
12372 tree type1;
12381 {
12386 {
12389 *vecp
12392 non_const);
12393 }
12394 else
12399 }
12400 else
12407 {
12408 /* If the original vector isn't declared may_alias and it
12409 isn't a bare vector look if the subscripting would
12410 alias the vector we subscript, and if not, force ref-all. */
12416 }
12420 }
12422 }
12424 /* Determine which of the operands, if any, is a scalar that needs to be
12425 converted to a vector, for the range of operations. */
12426 enum stv_conv
12429 {
12437 {
12438 /* Most GENERIC binary expressions require homogeneous arguments.
12439 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12440 argument that is a vector and a second one that is a scalar, so
12441 we never return stv_secondarg for them. */
12446 {
12448 {
12453 }
12454 else
12456 }
12463 /* ... fall through ... */
12484 /* What about UNLT_EXPR? */
12486 {
12490 }
12494 {
12496 {
12501 }
12503 }
12505 /* Allow integer --> real conversion if safe. */
12509 {
12511 {
12516 }
12518 }
12521 }
12524 }
12526 /* Return true iff ALIGN is an integral constant that is a fundamental
12527 alignment, as defined by [basic.align] in the c++-11
12528 specifications.
12530 That is:
12532 [A fundamental alignment is represented by an alignment less than or
12533 equal to the greatest alignment supported by the implementation
12534 in all contexts, which is equal to
12535 alignof(max_align_t)]. */
12537 bool
12539 {
12542 }
12544 /* Return true if T is a pointer to a zero-sized aggregate. */
12546 bool
12548 {
12553 }
12555 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12556 with no library fallback or for an ADDR_EXPR whose operand is such type
12557 issues an error pointing to the location LOC.
12558 Returns true when the expression has been diagnosed and false
12559 otherwise. */
12560 bool
12562 {
12569 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12570 false positives for user-declared built-ins such as abs or
12571 strlen, and for C++ operators new and delete.
12572 The c_decl_implicit() test avoids false positives for implicitly
12573 declared built-ins with library fallbacks (such as abs). */
12578 {
12582 /* Reject arguments that are built-in functions with
12583 no library fallback. */
12587 }
12590 }
12592 /* If we're creating an if-else-if condition chain, first see if we
12593 already have this COND in the CHAIN. If so, warn and don't add COND
12594 into the vector, otherwise add the COND there. LOC is the location
12595 of COND. */
12597 void
12599 {
12600 /* No chain has been created yet. Do nothing. */
12605 {
12606 /* Uh-oh! This condition has a side-effect, thus invalidates
12607 the whole chain. */
12611 }
12614 tree t;
12618 {
12624 }
12628 /* Don't infinitely grow the chain. */
12631 }
12633 /* Check if array size calculations overflow or if the array covers more
12634 than half of the address space. Return true if the size of the array
12635 is valid, false otherwise. TYPE is the type of the array and NAME is
12636 the name of the array, or NULL_TREE for unnamed arrays. */
12638 bool
12640 {
12645 {
12648 else
12651 }
12653 }