| blob | a2b37931911c0516f9be3cf03a6c269dcbb07fcc |
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
70 /* Mode used to build pointers (VOIDmode means ptr_mode). */
74 /* The following symbols are subsumed in the c_global_trees array, and
75 listed here individually for documentation purposes.
77 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
79 tree short_integer_type_node;
80 tree long_integer_type_node;
81 tree long_long_integer_type_node;
83 tree short_unsigned_type_node;
84 tree long_unsigned_type_node;
85 tree long_long_unsigned_type_node;
87 tree truthvalue_type_node;
88 tree truthvalue_false_node;
89 tree truthvalue_true_node;
91 tree ptrdiff_type_node;
93 tree unsigned_char_type_node;
94 tree signed_char_type_node;
95 tree wchar_type_node;
97 tree char16_type_node;
98 tree char32_type_node;
100 tree float_type_node;
101 tree double_type_node;
102 tree long_double_type_node;
104 tree complex_integer_type_node;
105 tree complex_float_type_node;
106 tree complex_double_type_node;
107 tree complex_long_double_type_node;
109 tree dfloat32_type_node;
110 tree dfloat64_type_node;
111 tree_dfloat128_type_node;
113 tree intQI_type_node;
114 tree intHI_type_node;
115 tree intSI_type_node;
116 tree intDI_type_node;
117 tree intTI_type_node;
119 tree unsigned_intQI_type_node;
120 tree unsigned_intHI_type_node;
121 tree unsigned_intSI_type_node;
122 tree unsigned_intDI_type_node;
123 tree unsigned_intTI_type_node;
125 tree widest_integer_literal_type_node;
126 tree widest_unsigned_literal_type_node;
128 Nodes for types `void *' and `const void *'.
130 tree ptr_type_node, const_ptr_type_node;
132 Nodes for types `char *' and `const char *'.
134 tree string_type_node, const_string_type_node;
136 Type `char[SOMENUMBER]'.
137 Used when an array of char is needed and the size is irrelevant.
139 tree char_array_type_node;
141 Type `wchar_t[SOMENUMBER]' or something like it.
142 Used when a wide string literal is created.
144 tree wchar_array_type_node;
146 Type `char16_t[SOMENUMBER]' or something like it.
147 Used when a UTF-16 string literal is created.
149 tree char16_array_type_node;
151 Type `char32_t[SOMENUMBER]' or something like it.
152 Used when a UTF-32 string literal is created.
154 tree char32_array_type_node;
156 Type `int ()' -- used for implicit declaration of functions.
158 tree default_function_type;
160 A VOID_TYPE node, packaged in a TREE_LIST.
162 tree void_list_node;
164 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
165 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
166 VAR_DECLS, but C++ does.)
168 tree function_name_decl_node;
169 tree pretty_function_name_decl_node;
170 tree c99_function_name_decl_node;
172 Stack of nested function name VAR_DECLs.
174 tree saved_function_name_decls;
176 */
179 \f
180 /* Switches common to the C front ends. */
182 /* Nonzero means don't output line number information. */
186 /* Nonzero causes -E output not to be done, but directives such as
187 #define that have side effects are still obeyed. */
191 /* Nonzero means dump macros in some fashion. */
195 /* Nonzero means pass #include lines through to the output. */
199 /* Nonzero means process PCH files while preprocessing. */
203 /* The file name to which we should write a precompiled header, or
204 NULL if no header will be written in this compile. */
208 /* Nonzero if an ISO standard was selected. It rejects macros in the
209 user's namespace. */
212 /* C/ObjC language option variables. */
215 /* Nonzero means allow type mismatches in conditional expressions;
216 just make their values `void'. */
220 /* Nonzero means enable C89 Amendment 1 features. */
224 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
228 /* Nonzero means use the ISO C11 dialect of C. */
232 /* Nonzero means that we have builtin functions, and main is an int. */
237 /* ObjC language option variables. */
240 /* Tells the compiler that this is a special run. Do not perform any
241 compiling, instead we are to test some platform dependent features
242 and output a C header file with appropriate definitions. */
246 /* Tells the compiler what is the constant string class for ObjC. */
251 /* C++ language option variables. */
254 /* Nonzero means generate separate instantiation control files and
255 juggle them at link time. */
259 /* The C++ dialect being used. Default set in c_common_post_options. */
263 /* Maximum template instantiation depth. This limit exists to limit the
264 time it takes to notice excessively recursive template instantiations.
266 The default is lower than the 1024 recommended by the C++0x standard
267 because G++ runs out of stack before 1024 with highly recursive template
268 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
272 /* The elements of `ridpointers' are identifier nodes for the reserved
273 type names and storage classes. It is indexed by a RID_... value. */
278 /* Nonzero means don't warn about problems that occur when the code is
279 executed. */
282 /* Whether we are building a boolean conversion inside
283 convert_for_assignment, or some other late binary operation. If
284 build_binary_op is called for C (from code shared by C and C++) in
285 this case, then the operands have already been folded and the
286 result will not be folded again, so C_MAYBE_CONST_EXPR should not
287 be generated. */
290 /* Whether lexing has been completed, so subsequent preprocessor
291 errors should use the compiler's input_location. */
294 /* Information about how a function name is generated. */
295 struct fname_var_t
296 {
300 };
302 /* The three ways of getting then name of the current function. */
305 {
306 /* C99 compliant __func__, must be first. */
308 /* GCC __FUNCTION__ compliant. */
310 /* GCC __PRETTY_FUNCTION__ compliant. */
313 };
315 /* Global visibility options. */
414 /* Reserved words. The third field is a mask: keywords are disabled
415 if they match the mask.
417 Masks for languages:
418 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
419 C --std=c99: D_CXXONLY | D_OBJC
420 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
421 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
422 C++ --std=c0x: D_CONLY | D_OBJC
423 ObjC++ is like C++ except that D_OBJC is not set
425 If -fno-asm is used, D_ASM is added to the mask. If
426 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
427 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
428 In C with -Wc++-compat, we warn if D_CXXWARN is set.
430 Note the complication of the D_CXX_OBJC keywords. These are
431 reserved words such as 'class'. In C++, 'class' is a reserved
432 word. In Objective-C++ it is too. In Objective-C, it is a
433 reserved word too, but only if it follows an '@' sign.
434 */
436 {
601 /* These Objective-C keywords are recognized only immediately after
602 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. */
716 handle_no_instrument_function_attribute,
734 /* ??? These two attributes didn't make the transition from the
735 Intel language document to the multi-vendor language document. */
740 /* For internal use (marking of builtins) only. The name contains space
741 to prevent its usage in source code. */
763 /* For internal use (marking of builtins) only. The name contains space
764 to prevent its usage in source code. */
775 handle_no_address_safety_analysis_attribute,
778 handle_no_sanitize_address_attribute,
781 handle_no_sanitize_address_attribute,
784 handle_no_sanitize_undefined_attribute,
794 /* For internal use only. The leading '*' both prevents its usage in
795 source code and signals that it may be overridden by machine tables. */
800 /* For internal use (marking of builtins and runtime functions) only.
801 The name contains space to prevent its usage in source code. */
827 };
829 /* Give the specifications for the format attributes, used by C and all
830 descendants.
832 All attributes referencing arguments should be additionally processed
833 in chkp_copy_function_type_adding_bounds for correct instrumentation
834 by Pointer Bounds Checker.
835 Current list of processed format attributes: format, format_arg. */
837 {
838 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
839 affects_type_identity } */
845 };
847 /* Return identifier for address space AS. */
851 {
855 }
857 /* Push current bindings for the function name VAR_DECLS. */
859 void
861 {
866 {
870 {
872 saved);
874 }
875 }
877 /* Normally they'll have been NULL, so only push if we've got a
878 stack, or they are non-NULL. */
880 saved_function_name_decls);
881 }
883 /* Finish up the current bindings, adding them into the current function's
884 statement tree. This must be done _before_ finish_stmt_tree is called.
885 If there is no current function, we must be at file scope and no statements
886 are involved. Pop the previous bindings. */
888 void
890 {
899 {
907 }
913 {
914 /* We had saved values, restore them. */
915 tree saved;
918 {
923 }
925 }
927 }
929 /* Return the text name of the current function, suitably prettified
930 by PRETTY_P. Return string must be freed by caller. */
934 {
941 {
944 }
957 {
960 }
963 }
965 /* Return the VAR_DECL for a const char array naming the current
966 function. If the VAR_DECL has not yet been created, create it
967 now. RID indicates how it should be formatted and IDENTIFIER_NODE
968 ID is its name (unfortunately C and C++ hold the RID values of
969 keywords in different places, so we can't derive RID from ID in
970 this language independent code. LOC is the location of the
971 function. */
973 tree
975 {
985 {
986 /* If a tree is built here, it would normally have the lineno of
987 the current statement. Later this tree will be moved to the
988 beginning of the function and this line number will be wrong.
989 To avoid this problem set the lineno to 0 here; that prevents
990 it from appearing in the RTL. */
991 tree stmts;
999 saved_function_name_decls
1003 }
1008 }
1010 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1012 tree
1014 {
1019 /* Compute the number of elements, for the array type. */
1021 {
1024 }
1026 {
1029 }
1031 {
1034 }
1035 else
1036 {
1039 }
1041 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1042 limit in C++98 Annex B is very large (65536) and is not normative,
1043 so we do not diagnose it (warn_overlength_strings is forced off
1044 in c_common_post_options). */
1046 {
1050 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1051 separate the %d from the 'C'. 'ISO' should not be
1052 translated, but it may be moved after 'C%d' in languages
1053 where modifiers follow nouns. */
1055 "string length %qd is greater than the length %qd "
1058 }
1060 /* Create the array type for the string constant. The ISO C++
1061 standard says that a string literal has type `const char[N]' or
1062 `const wchar_t[N]'. We use the same logic when invoked as a C
1063 front-end with -Wwrite-strings.
1064 ??? We should change the type of an expression depending on the
1065 state of a warning flag. We should just be warning -- see how
1066 this is handled in the C++ front-end for the deprecated implicit
1067 conversion from string literals to `char*' or `wchar_t*'.
1069 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1070 array type being the unqualified version of that type.
1071 Therefore, if we are constructing an array of const char, we must
1072 construct the matching unqualified array type first. The C front
1073 end does not require this, but it does no harm, so we do it
1074 unconditionally. */
1085 }
1086 \f
1087 /* If DISABLE is true, stop issuing warnings. This is used when
1088 parsing code that we know will not be executed. This function may
1089 be called multiple times, and works as a stack. */
1091 static void
1093 {
1095 {
1098 }
1099 }
1101 /* If ENABLE is true, reenable issuing warnings. */
1103 static void
1105 {
1107 {
1110 }
1111 }
1113 /* Fully fold EXPR, an expression that was not folded (beyond integer
1114 constant expressions and null pointer constants) when being built
1115 up. If IN_INIT, this is in a static initializer and certain
1116 changes are made to the folding done. Clear *MAYBE_CONST if
1117 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1118 expression because it contains an evaluated operator (in C99) or an
1119 operator outside of sizeof returning an integer constant (in C90)
1120 not permitted in constant expressions, or because it contains an
1121 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1122 set to true by callers before calling this function.) Return the
1123 folded expression. Function arguments have already been folded
1124 before calling this function, as have the contents of SAVE_EXPR,
1125 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1126 C_MAYBE_CONST_EXPR. */
1128 tree
1130 {
1131 tree ret;
1137 /* This function is not relevant to C++ because C++ folds while
1138 parsing, and may need changes to be correct for C++ when C++
1139 stops folding while parsing. */
1146 {
1149 }
1156 }
1158 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1159 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1160 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1161 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1162 both evaluated and unevaluated subexpressions while
1163 *MAYBE_CONST_ITSELF is carried from only evaluated
1164 subexpressions). FOR_INT_CONST indicates if EXPR is an expression
1165 with integer constant operands, and if any of the operands doesn't
1166 get folded to an integer constant, don't fold the expression itself. */
1168 static tree
1171 {
1183 /* This function is not relevant to C++ because C++ folds while
1184 parsing, and may need changes to be correct for C++ when C++
1185 stops folding while parsing. */
1189 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1190 anything else not counted as an expression cannot usefully be
1191 folded further at this point. */
1197 /* Operands of variable-length expressions (function calls) have
1198 already been folded, as have __builtin_* function calls, and such
1199 expressions cannot occur in constant expressions. */
1201 {
1205 }
1208 {
1214 {
1218 }
1221 else
1224 }
1226 /* Assignment, increment, decrement, function call and comma
1227 operators, and statement expressions, cannot occur in constant
1228 expressions if evaluated / outside of sizeof. (Function calls
1229 were handled above, though VA_ARG_EXPR is treated like a function
1230 call here, and statement expressions are handled through
1231 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1233 {
1253 }
1255 /* Fold individual tree codes as appropriate. */
1257 {
1259 /* Any non-constancy will have been marked in a containing
1260 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1273 {
1276 }
1294 {
1298 }
1340 /* Binary operations evaluating both arguments (increment and
1341 decrement are binary internally in GCC). */
1353 /* The RHS of a MODIFY_EXPR was fully folded when building that
1354 expression for the sake of conversion warnings. */
1366 ret = in_init
1369 else
1390 {
1403 }
1420 CASE_CONVERT:
1431 /* Unary operations. */
1442 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1443 not prepared to deal with them if they occur in initializers. */
1451 ret = in_init
1454 else
1459 {
1463 }
1465 {
1468 CASE_CONVERT:
1469 /* Don't warn about explicit conversions. We will already
1470 have warned about suspect implicit conversions. */
1477 }
1482 /* Binary operations not necessarily evaluating both
1483 arguments. */
1487 for_int_const);
1491 ? truthvalue_false_node
1495 for_int_const);
1501 /* Require OP1 be an INTEGER_CST only if it's evaluated. */
1506 ret = in_init
1509 else
1514 && op0_const
1515 && op0_const_self
1521 && op0_const_self
1533 for_int_const);
1538 for_int_const);
1544 for_int_const);
1550 /* Only the evaluated operand must be an INTEGER_CST. */
1558 else
1563 && op0_const
1564 && op0_const_self
1568 && op0_const_self
1572 && op0_const
1573 && op0_const_self
1577 && op0_const_self
1583 /* Each case where an operand with excess precision may be
1584 encountered must remove the EXCESS_PRECISION_EXPR around
1585 inner operands and possibly put one around the whole
1586 expression or possibly convert to the semantic type (which
1587 c_fully_fold does); we cannot tell at this stage which is
1588 appropriate in any particular case. */
1592 /* Various codes may appear through folding built-in functions
1593 and their arguments. */
1595 }
1597 out:
1598 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1599 have been done by this point, so remove them again. */
1603 {
1607 }
1611 }
1613 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1614 return EXP. Otherwise, return either EXP or its known constant
1615 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1616 Is the BLKmode test appropriate? */
1618 tree
1620 {
1621 tree ret;
1623 /* This function is only used by C, for c_fully_fold and other
1624 optimization, and may not be correct for C++. */
1635 /* Avoid unwanted tree sharing between the initializer and current
1636 function's body where the tree can be modified e.g. by the
1637 gimplifier. */
1641 }
1643 /* Print a warning if a constant expression had overflow in folding.
1644 Invoke this function on every expression that the language
1645 requires to be a constant expression.
1646 Note the ANSI C standard says it is erroneous for a
1647 constant expression to overflow. */
1649 void
1651 {
1659 }
1661 /* The same as above but print an unconditional error. */
1662 void
1664 {
1671 }
1673 /* Print a warning if an expression had overflow in folding and its
1674 operands hadn't.
1676 Invoke this function on every expression that
1677 (1) appears in the source code, and
1678 (2) is a constant expression that overflowed, and
1679 (3) is not already checked by convert_and_check;
1680 however, do not invoke this function on operands of explicit casts
1681 or when the expression is the result of an operator and any operand
1682 already overflowed. */
1684 void
1686 {
1691 {
1720 }
1721 }
1723 /* Warn about uses of logical || / && operator in a context where it
1724 is likely that the bitwise equivalent was intended by the
1725 programmer. We have seen an expression in which CODE is a binary
1726 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1727 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1728 void
1732 {
1744 /* We don't want to warn if either operand comes from a macro
1745 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1746 see PR61534. */
1751 /* Warn if &&/|| are being used in a context where it is
1752 likely that the bitwise equivalent was intended by the
1753 programmer. That is, an expression such as op && MASK
1754 where op should not be any boolean expression, nor a
1755 constant, and mask seems to be a non-boolean integer constant. */
1763 {
1767 else
1772 }
1774 /* We do not warn for constants because they are typical of macro
1775 expansions that test for features. */
1779 /* This warning only makes sense with logical operands. */
1786 /* The range computations only work with scalars. */
1791 /* We first test whether either side separately is trivially true
1792 (with OR) or trivially false (with AND). If so, do not warn.
1793 This is a common idiom for testing ranges of data types in
1794 portable code. */
1801 /* If this is an OR operation, invert both sides; now, the result
1802 should be always false to get a warning. */
1816 /* If this is an OR operation, invert both sides; now, the result
1817 should be always false to get a warning. */
1825 /* If both expressions have the same operand, if we can merge the
1826 ranges, ... */
1830 {
1832 /* ... and if the range test is always false, then warn. */
1834 {
1837 "logical %<or%> of collectively exhaustive tests is "
1839 else
1841 "logical %<and%> of mutually exclusive tests is "
1843 }
1844 /* Or warn if the operands have exactly the same range, e.g.
1845 A > 0 && A > 0. */
1847 {
1851 else
1854 }
1855 }
1856 }
1858 /* Warn about logical not used on the left hand side operand of a comparison.
1859 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1860 Do not warn if RHS is of a boolean type. */
1862 void
1864 tree rhs)
1865 {
1871 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1872 !(x == 0) or !(y != 0). */
1878 "logical not is only applied to the left hand side of "
1880 }
1882 /* Warn if EXP contains any computations whose results are not used.
1883 Return true if a warning is printed; false otherwise. LOCUS is the
1884 (potential) location of the expression. */
1886 bool
1888 {
1889 restart:
1893 /* Don't warn about void constructs. This includes casting to void,
1894 void function calls, and statement expressions with a final cast
1895 to void. */
1903 {
1919 /* For a binding, warn if no side effect within it. */
1931 /* In && or ||, warn if 2nd operand has no side effect. */
1938 /* Let people do `(foo (), 0)' without a warning. */
1945 /* If this is an expression with side effects, don't warn; this
1946 case commonly appears in macro expansions. */
1952 /* Don't warn about automatic dereferencing of references, since
1953 the user cannot control it. */
1955 {
1958 }
1959 /* Fall through. */
1962 /* Referencing a volatile value is a side effect, so don't warn. */
1967 /* If this is an expression which has no operands, there is no value
1968 to be unused. There are no such language-independent codes,
1969 but front ends may define such. */
1973 warn:
1975 }
1976 }
1979 /* Print a warning about casts that might indicate violation
1980 of strict aliasing rules if -Wstrict-aliasing is used and
1981 strict aliasing mode is in effect. OTYPE is the original
1982 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1984 bool
1986 {
1987 /* Strip pointer conversion chains and get to the correct original type. */
1995 /* If the type we are casting to is a ref-all pointer
1996 dereferencing it is always valid. */
2003 {
2004 /* Casting the address of an object to non void pointer. Warn
2005 if the cast breaks type based aliasing. */
2007 {
2011 }
2012 else
2013 {
2014 /* warn_strict_aliasing >= 3. This includes the default (3).
2015 Only warn if the cast is dereferenced immediately. */
2016 alias_set_type set1 =
2022 {
2026 }
2029 {
2033 }
2034 }
2035 }
2036 else
2038 {
2039 /* At this level, warn for any conversions, even if an address is
2040 not taken in the same statement. This will likely produce many
2041 false positives, but could be useful to pinpoint problems that
2042 are not revealed at higher levels. */
2047 {
2051 }
2052 }
2055 }
2057 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2058 sizeof as last operand of certain builtins. */
2060 void
2064 {
2068 location_t loc;
2076 {
2080 /* FALLTHRU */
2088 /* FALLTHRU */
2147 }
2175 {
2179 {
2182 "argument to %<sizeof%> in %qD call is the same "
2183 "expression as the destination; did you mean to "
2189 "argument to %<sizeof%> in %qD call is the same "
2190 "expression as the destination; did you mean to "
2192 else
2194 "argument to %<sizeof%> in %qD call is the same "
2195 "expression as the destination; did you mean to "
2198 }
2201 && !strop
2204 {
2206 "argument to %<sizeof%> in %qD call is the same "
2207 "pointer type %qT as the destination; expected %qT "
2211 }
2212 }
2215 {
2219 {
2222 "argument to %<sizeof%> in %qD call is the same "
2223 "expression as the source; did you mean to "
2229 "argument to %<sizeof%> in %qD call is the same "
2230 "expression as the source; did you mean to "
2232 else
2234 "argument to %<sizeof%> in %qD call is the same "
2235 "expression as the source; did you mean to "
2238 }
2241 && !strop
2244 {
2246 "argument to %<sizeof%> in %qD call is the same "
2247 "pointer type %qT as the source; expected %qT "
2251 }
2252 }
2255 {
2259 {
2262 "argument to %<sizeof%> in %qD call is the same "
2263 "expression as the first source; did you mean to "
2269 "argument to %<sizeof%> in %qD call is the same "
2270 "expression as the first source; did you mean to "
2272 else
2274 "argument to %<sizeof%> in %qD call is the same "
2275 "expression as the first source; did you mean to "
2278 }
2281 && !strop
2284 {
2286 "argument to %<sizeof%> in %qD call is the same "
2287 "pointer type %qT as the first source; expected %qT "
2291 }
2292 }
2295 {
2299 {
2302 "argument to %<sizeof%> in %qD call is the same "
2303 "expression as the second source; did you mean to "
2309 "argument to %<sizeof%> in %qD call is the same "
2310 "expression as the second source; did you mean to "
2312 else
2314 "argument to %<sizeof%> in %qD call is the same "
2315 "expression as the second source; did you mean to "
2318 }
2321 && !strop
2324 {
2326 "argument to %<sizeof%> in %qD call is the same "
2327 "pointer type %qT as the second source; expected %qT "
2331 }
2332 }
2334 }
2336 /* Warn for unlikely, improbable, or stupid DECL declarations
2337 of `main'. */
2339 void
2341 {
2342 function_args_iterator iter;
2343 tree type;
2347 {
2348 /* XXX void_type_node belies the abstraction. */
2358 {
2364 }
2368 {
2390 "third argument of %q+D should probably be "
2393 }
2394 }
2396 /* It is intentional that this message does not mention the third
2397 argument because it's only mentioned in an appendix of the
2398 standard. */
2406 }
2408 /* vector_targets_convertible_p is used for vector pointer types. The
2409 callers perform various checks that the qualifiers are satisfactory,
2410 while OTOH vector_targets_convertible_p ignores the number of elements
2411 in the vectors. That's fine with vector pointers as we can consider,
2412 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2413 and that does not require and conversion of the pointer values.
2414 In contrast, vector_types_convertible_p and
2415 vector_types_compatible_elements_p are used for vector value types. */
2416 /* True if pointers to distinct types T1 and T2 can be converted to
2417 each other without an explicit cast. Only returns true for opaque
2418 vector types. */
2419 bool
2421 {
2428 }
2430 /* vector_types_convertible_p is used for vector value types.
2431 It could in principle call vector_targets_convertible_p as a subroutine,
2432 but then the check for vector type would be duplicated with its callers,
2433 and also the purpose of vector_targets_convertible_p would become
2434 muddled.
2435 Where vector_types_convertible_p returns true, a conversion might still be
2436 needed to make the types match.
2437 In contrast, vector_targets_convertible_p is used for vector pointer
2438 values, and vector_types_compatible_elements_p is used specifically
2439 in the context for binary operators, as a check if use is possible without
2440 conversion. */
2441 /* True if vector types T1 and T2 can be converted to each other
2442 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2443 can only be converted with -flax-vector-conversions yet that is not
2444 in effect, emit a note telling the user about that option if such
2445 a note has not previously been emitted. */
2446 bool
2448 {
2456 convertible_lax =
2471 {
2474 "conversions between vectors with differing "
2476 }
2479 }
2481 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2482 and have vector types, V0 has the same type as V1, and the number of
2483 elements of V0, V1, MASK is the same.
2485 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2486 called with two arguments. In this case implementation passes the
2487 first argument twice in order to share the same tree code. This fact
2488 could enable the mask-values being twice the vector length. This is
2489 an implementation accident and this semantics is not guaranteed to
2490 the user. */
2491 tree
2494 {
2495 tree ret;
2501 {
2504 }
2512 {
2517 }
2521 {
2525 }
2528 {
2533 }
2539 {
2542 "argument vector(s) and the mask vector should "
2545 }
2549 {
2554 }
2557 {
2558 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2564 else
2565 {
2568 }
2572 }
2582 }
2584 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2585 to integral type. */
2587 static tree
2589 {
2594 {
2595 /* C++0x scoped enumerations don't implicitly convert to integral
2596 type; if we stripped an explicit conversion to a larger type we
2597 need to replace it so common_type will still work. */
2601 }
2603 }
2605 /* This is a helper function of build_binary_op.
2607 For certain operations if both args were extended from the same
2608 smaller type, do the arithmetic in that type and then extend.
2610 BITWISE indicates a bitwise operation.
2611 For them, this optimization is safe only if
2612 both args are zero-extended or both are sign-extended.
2613 Otherwise, we might change the result.
2614 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2615 but calculated in (unsigned short) it would be (unsigned short)-1.
2616 */
2617 tree
2619 {
2623 tree type;
2625 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2626 excessive narrowing when we call get_narrower below. For
2627 example, suppose that OP0 is of unsigned int extended
2628 from signed char and that RESULT_TYPE is long long int.
2629 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2630 like
2632 (long long int) (unsigned int) signed_char
2634 which get_narrower would narrow down to
2636 (unsigned int) signed char
2638 If we do not cast OP0 first, get_narrower would return
2639 signed_char, which is inconsistent with the case of the
2640 explicit cast. */
2647 /* UNS is 1 if the operation to be done is an unsigned one. */
2650 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2651 but it *requires* conversion to FINAL_TYPE. */
2662 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2664 /* For bitwise operations, signedness of nominal type
2665 does not matter. Consider only how operands were extended. */
2669 /* Note that in all three cases below we refrain from optimizing
2670 an unsigned operation on sign-extended args.
2671 That would not be valid. */
2673 /* Both args variable: if both extended in same way
2674 from same width, do it in that width.
2675 Do it unsigned if args were zero-extended. */
2682 return c_common_signed_or_unsigned_type
2689 && (type
2700 && (type
2708 }
2710 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2711 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2713 static bool
2715 {
2718 REAL_VALUE_TYPE real_low_bound =
2720 REAL_VALUE_TYPE real_high_bound =
2725 }
2727 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2728 to the complex/real/integer type TYPE. Function returns non-zero when:
2729 * EXPR is a constant which cannot be exactly converted to TYPE.
2730 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2731 for EXPR type and TYPE being both integers or both real, or both
2732 complex.
2733 * EXPR is not a constant of complex type and TYPE is a real or
2734 an integer.
2735 * EXPR is not a constant of real type and TYPE is an integer.
2736 * EXPR is not a constant of integer type which cannot be
2737 exactly converted to real type.
2739 Function allows conversions between types of different signedness and
2740 can return SAFE_CONVERSION (zero) in that case. Function can produce
2741 signedness warnings if PRODUCE_WARNS is true.
2743 Function allows conversions from complex constants to non-complex types,
2744 provided that imaginary part is zero and real part can be safely converted
2745 to TYPE. */
2747 enum conversion_safety
2749 {
2755 {
2756 /* If type is complex, we are interested in compatibility with
2757 underlying type. */
2761 /* Warn for real constant that is not an exact integer converted
2762 to integer type. */
2765 {
2768 }
2769 /* Warn for an integer constant that does not fit into integer type. */
2773 {
2776 {
2780 }
2782 {
2786 }
2787 else
2789 }
2791 {
2792 /* Warn for an integer constant that does not fit into real type. */
2794 {
2798 }
2799 /* Warn for a real constant that does not fit into a smaller
2800 real type. */
2803 {
2807 }
2808 }
2809 }
2812 {
2814 /* Conversion from complex constant with zero imaginary part,
2815 perform check for conversion of real part. */
2820 /* Note: in this branch we use recursive call to unsafe_conversion_p
2821 with different type of EXPR, but it is still safe, because when EXPR
2822 is a constant, it's type is not used in text of generated warnings
2823 (otherwise they could sound misleading). */
2825 produce_warns);
2826 /* Conversion from complex constant with non-zero imaginary part. */
2827 else
2828 {
2829 /* Conversion to complex type.
2830 Perform checks for both real and imaginary parts. */
2832 {
2833 /* Unfortunately, produce_warns must be false in two subsequent
2834 calls of unsafe_conversion_p, because otherwise we could
2835 produce strange "double" warnings, if both real and imaginary
2836 parts have conversion problems related to signedness.
2838 For example:
2839 int32_t _Complex a = 0x80000000 + 0x80000000i;
2841 Possible solution: add a separate function for checking
2842 constants and combine result of two calls appropriately. */
2848 /* Merge the results into appropriate single warning. */
2850 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2857 else
2859 }
2860 /* Warn about conversion from complex to real or integer type. */
2861 else
2863 }
2864 }
2866 /* Checks for remaining case: EXPR is not constant. */
2867 else
2868 {
2869 /* Warn for real types converted to integer types. */
2876 {
2877 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2881 /* Don't warn for short y; short x = ((int)y & 0xff); */
2885 {
2886 /* If both args were extended from a shortest type,
2887 use that type if that is safe. */
2894 {
2900 /* If one of the operands is a non-negative constant
2901 that fits in the target type, then the type of the
2902 other operand does not matter. */
2911 /* If constant is unsigned and fits in the target
2912 type, then the result will also fit. */
2914 && unsigned0
2917 && unsigned1
2920 }
2921 }
2922 /* Warn for integer types converted to smaller integer types. */
2926 /* When they are the same width but different signedness,
2927 then the value may change. */
2930 /* Even when converted to a bigger type, if the type is
2931 unsigned but expr is signed, then negative values
2932 will be changed. */
2938 }
2940 /* Warn for integer types converted to real types if and only if
2941 all the range of values of the integer type cannot be
2942 represented by the real type. */
2945 {
2946 /* Don't warn about char y = 0xff; float x = (int) y; */
2952 }
2954 /* Warn for real types converted to smaller real types. */
2960 /* Check conversion between two complex types. */
2963 {
2964 /* Extract underlying types (i.e., type of real and imaginary
2965 parts) of expr_type and type. */
2969 /* Warn for real types converted to integer types. */
2974 /* Warn for real types converted to smaller real types. */
2980 /* Check conversion for complex integer types. Here implementation
2981 is simpler than for real-domain integers because it does not
2982 involve sophisticated cases, such as bitmasks, casts, etc. */
2985 {
2986 /* Warn for integer types converted to smaller integer types. */
2990 /* Check for different signedness, see case for real-domain
2991 integers (above) for a more detailed comment. */
2997 "conversion to %qT from %qT "
3000 }
3005 }
3007 /* Warn for complex types converted to real or integer types. */
3011 }
3014 }
3016 /* Warns if the conversion of EXPR to TYPE may alter a value.
3017 This is a helper function for warnings_for_convert_and_check. */
3019 static void
3021 {
3028 /* This may happen, because for LHS op= RHS we preevaluate
3029 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
3030 means we could no longer see the code of the EXPR. */
3037 {
3050 /* Conversion from boolean to a signed:1 bit-field (which only
3051 can hold the values 0 and -1) doesn't lose information - but
3052 it does change the value. */
3073 {
3074 /* In case of COND_EXPR, we do not care about the type of
3075 COND_EXPR, only about the conversion of each operand. */
3082 }
3098 }
3099 }
3101 /* Produce warnings after a conversion. RESULT is the result of
3102 converting EXPR to TYPE. This is a helper function for
3103 convert_and_check and cp_convert_and_check. */
3105 void
3107 tree result)
3108 {
3115 {
3116 /* Do not diagnose overflow in a constant expression merely
3117 because a conversion overflowed. */
3122 {
3123 /* This detects cases like converting -129 or 256 to
3124 unsigned char. */
3128 else
3130 }
3134 /* No warning for converting 0x80000000 to int. */
3142 else
3144 }
3149 else
3151 }
3154 /* Convert EXPR to TYPE, warning about conversion problems with constants.
3155 Invoke this function on every expression that is converted implicitly,
3156 i.e. because of language rules and not because of an explicit cast. */
3158 tree
3160 {
3161 tree result;
3162 tree expr_for_warning;
3164 /* Convert from a value with possible excess precision rather than
3165 via the semantic type, but do not warn about values not fitting
3166 exactly in the semantic type. */
3168 {
3174 }
3175 else
3189 }
3190 \f
3191 /* A node in a list that describes references to variables (EXPR), which are
3192 either read accesses if WRITER is zero, or write accesses, in which case
3193 WRITER is the parent of EXPR. */
3194 struct tlist
3195 {
3198 };
3200 /* Used to implement a cache the results of a call to verify_tree. We only
3201 use this for SAVE_EXPRs. */
3202 struct tlist_cache
3203 {
3207 tree expr;
3208 };
3210 /* Obstack to use when allocating tlist structures, and corresponding
3211 firstobj. */
3215 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3216 warnings. */
3218 /* SAVE_EXPRs need special treatment. We process them only once and then
3219 cache the results. */
3231 /* Create a new struct tlist and fill in its fields. */
3234 {
3241 }
3243 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3244 is nonnull, we ignore any node we find which has a writer equal to it. */
3246 static void
3248 {
3250 {
3257 }
3258 }
3260 /* Merge the nodes of ADD into TO. This merging process is done so that for
3261 each variable that already exists in TO, no new node is added; however if
3262 there is a write access recorded in ADD, and an occurrence on TO is only
3263 a read access, then the occurrence in TO will be modified to record the
3264 write. */
3266 static void
3268 {
3275 {
3282 {
3286 }
3288 {
3292 }
3294 }
3295 }
3297 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3298 references in list LIST conflict with it, excluding reads if ONLY writers
3299 is nonzero. */
3301 static void
3304 {
3307 /* Avoid duplicate warnings. */
3313 {
3317 {
3322 }
3324 }
3325 }
3327 /* Given a list LIST of references to variables, find whether any of these
3328 can cause conflicts due to missing sequence points. */
3330 static void
3332 {
3336 {
3339 }
3340 }
3342 /* Return nonzero if X is a tree that can be verified by the sequence point
3343 warnings. */
3344 static int
3346 {
3353 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3354 (lvalue_p) crash on TRY/CATCH. */
3361 /* No point to track non-const calls, they will never satisfy
3362 operand_equal_p. */
3370 }
3372 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3373 static bool
3375 {
3377 }
3379 /* Walk the tree X, and record accesses to variables. If X is written by the
3380 parent tree, WRITER is the parent.
3381 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3382 expression or its only operand forces a sequence point, then everything up
3383 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3384 in PNO_SP.
3385 Once we return, we will have emitted warnings if any subexpression before
3386 such a sequence point could be undefined. On a higher level, however, the
3387 sequence point may not be relevant, and we'll merge the two lists.
3389 Example: (b++, a) + b;
3390 The call that processes the COMPOUND_EXPR will store the increment of B
3391 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3392 processes the PLUS_EXPR will need to merge the two lists so that
3393 eventually, all accesses end up on the same list (and we'll warn about the
3394 unordered subexpressions b++ and b.
3396 A note on merging. If we modify the former example so that our expression
3397 becomes
3398 (b++, b) + a
3399 care must be taken not simply to add all three expressions into the final
3400 PNO_SP list. The function merge_tlist takes care of that by merging the
3401 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3402 way, so that no more than one access to B is recorded. */
3404 static void
3406 tree writer)
3407 {
3412 /* X may be NULL if it is the operand of an empty statement expression
3413 ({ }). */
3417 restart:
3425 {
3458 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3459 two first, to avoid warning for (a ? b++ : b++). */
3475 /* Expressions inside the LHS are not ordered wrt. the sequence points
3476 in the RHS. Example:
3477 *a = (a++, 2)
3478 Despite the fact that the modification of "a" is in the before_sp
3479 list (tmp_before), it conflicts with the use of "a" in the LHS.
3480 We can handle this by adding the contents of tmp_list3
3481 to those of tmp_before, and redoing the collision warnings for that
3482 list. */
3485 /* Exclude the LHS itself here; we first have to merge it into the
3486 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3487 didn't exclude the LHS, we'd get it twice, once as a read and once
3488 as a write. */
3499 /* We need to warn about conflicts among arguments and conflicts between
3500 args and the function address. Side effects of the function address,
3501 however, are not ordered by the sequence point of the call. */
3502 {
3503 call_expr_arg_iterator iter;
3504 tree arg;
3508 {
3513 }
3518 }
3521 /* Scan all the list, e.g. indices of multi dimensional array. */
3523 {
3529 }
3533 {
3540 {
3554 }
3558 }
3568 /* For other expressions, simply recurse on their operands.
3569 Manual tail recursion for unary expressions.
3570 Other non-expressions need not be processed. */
3572 {
3576 }
3578 {
3582 {
3587 }
3588 }
3590 }
3591 }
3593 /* Try to warn for undefined behavior in EXPR due to missing sequence
3594 points. */
3596 DEBUG_FUNCTION void
3598 {
3604 {
3607 }
3612 }
3613 \f
3614 /* Validate the expression after `case' and apply default promotions. */
3616 static tree
3618 {
3623 /* Promote char or short to int. */
3626 {
3629 }
3634 }
3635 \f
3636 /* See if the case values LOW and HIGH are in the range of the original
3637 type (i.e. before the default conversion to int) of the switch testing
3638 expression.
3639 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3640 the type before promoting it. CASE_LOW_P is a pointer to the lower
3641 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3642 if the case is not a case range.
3643 The caller has to make sure that we are not called with NULL for
3644 CASE_LOW_P (i.e. the default case).
3645 Returns true if the case label is in range of ORIG_TYPE (saturated or
3646 untouched) or false if the label is out of range. */
3648 static bool
3651 {
3656 /* If there was a problem with the original type, do nothing. */
3663 /* Case label is less than minimum for type. */
3666 {
3670 }
3672 /* Case value is greater than maximum for type. */
3675 {
3678 }
3680 /* Saturate lower case label value to minimum. */
3683 {
3687 }
3689 /* Saturate upper case label value to maximum. */
3692 {
3696 }
3704 }
3705 \f
3706 /* Return an integer type with BITS bits of precision,
3707 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3709 tree
3711 {
3753 }
3755 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3756 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3757 and saturating if SATP is nonzero, otherwise not saturating. */
3759 tree
3762 {
3763 machine_mode mode;
3766 else
3774 {
3776 "fixed-point types that have too many integral and "
3779 }
3782 }
3784 /* Used for communication between c_common_type_for_mode and
3785 c_register_builtin_type. */
3786 tree registered_builtin_types;
3788 /* Return a data type that has machine mode MODE.
3789 If the mode is an integer,
3790 then UNSIGNEDP selects between signed and unsigned types.
3791 If the mode is a fixed-point mode,
3792 then UNSIGNEDP selects between saturating and nonsaturating types. */
3794 tree
3796 {
3797 tree t;
3837 #if HOST_BITS_PER_WIDE_INT >= 64
3840 #endif
3865 {
3866 machine_mode inner_mode;
3867 tree inner_type;
3883 }
3885 {
3890 }
3900 {
3986 }
3994 }
3996 tree
3998 {
4000 }
4002 /* Return a signed type the same as TYPE in other respects. */
4004 tree
4006 {
4008 }
4010 /* Return a type the same as TYPE except unsigned or
4011 signed according to UNSIGNEDP. */
4013 tree
4015 {
4016 tree type1;
4019 /* This block of code emulates the behavior of the old
4020 c_common_unsigned_type. In particular, it returns
4021 long_unsigned_type_node if passed a long, even when a int would
4022 have the same size. This is necessary for warnings to work
4023 correctly in archs where sizeof(int) == sizeof(long) */
4026 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
4046 #if HOST_BITS_PER_WIDE_INT >= 64
4049 #endif
4059 #define C_COMMON_FIXED_TYPES(NAME) \
4060 if (type1 == short_ ## NAME ## _type_node \
4061 || type1 == unsigned_short_ ## NAME ## _type_node) \
4062 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4063 : short_ ## NAME ## _type_node; \
4064 if (type1 == NAME ## _type_node \
4065 || type1 == unsigned_ ## NAME ## _type_node) \
4066 return unsignedp ? unsigned_ ## NAME ## _type_node \
4067 : NAME ## _type_node; \
4068 if (type1 == long_ ## NAME ## _type_node \
4069 || type1 == unsigned_long_ ## NAME ## _type_node) \
4070 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4071 : long_ ## NAME ## _type_node; \
4072 if (type1 == long_long_ ## NAME ## _type_node \
4073 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4074 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4075 : long_long_ ## NAME ## _type_node;
4077 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
4078 if (type1 == NAME ## _type_node \
4079 || type1 == u ## NAME ## _type_node) \
4080 return unsignedp ? u ## NAME ## _type_node \
4081 : NAME ## _type_node;
4083 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
4084 if (type1 == sat_ ## short_ ## NAME ## _type_node \
4085 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
4086 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
4087 : sat_ ## short_ ## NAME ## _type_node; \
4088 if (type1 == sat_ ## NAME ## _type_node \
4089 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
4090 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
4091 : sat_ ## NAME ## _type_node; \
4092 if (type1 == sat_ ## long_ ## NAME ## _type_node \
4093 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
4094 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
4095 : sat_ ## long_ ## NAME ## _type_node; \
4096 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
4097 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
4098 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
4099 : sat_ ## long_long_ ## NAME ## _type_node;
4101 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
4102 if (type1 == sat_ ## NAME ## _type_node \
4103 || type1 == sat_ ## u ## NAME ## _type_node) \
4104 return unsignedp ? sat_ ## u ## NAME ## _type_node \
4105 : sat_ ## NAME ## _type_node;
4131 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
4132 the precision; they have precision set to match their range, but
4133 may use a wider mode to match an ABI. If we change modes, we may
4134 wind up with bad conversions. For INTEGER_TYPEs in C, must check
4135 the precision as well, so as to yield correct results for
4136 bit-field types. C++ does not have these separate bit-field
4137 types, and producing a signed or unsigned variant of an
4138 ENUMERAL_TYPE may cause other problems as well. */
4144 #define TYPE_OK(node) \
4145 (TYPE_MODE (type) == TYPE_MODE (node) \
4146 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4170 #if HOST_BITS_PER_WIDE_INT >= 64
4173 #endif
4182 #undef TYPE_OK
4185 }
4187 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4189 tree
4191 {
4194 /* Extended integer types of the same width as a standard type have
4195 lesser rank, so those of the same width as int promote to int or
4196 unsigned int and are valid for printf formats expecting int or
4197 unsigned int. To avoid such special cases, avoid creating
4198 extended integer types for bit-fields if a standard integer type
4199 is available. */
4217 }
4219 /* The C version of the register_builtin_type langhook. */
4221 void
4223 {
4224 tree decl;
4234 }
4235 \f
4236 /* Print an error message for invalid operands to arith operation
4237 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4238 LOCATION is the location of the message. */
4240 void
4243 {
4247 {
4292 }
4296 }
4297 \f
4298 /* Given an expression as a tree, return its original type. Do this
4299 by stripping any conversion that preserves the sign and precision. */
4300 static tree
4302 {
4305 }
4307 /* Subroutine of build_binary_op, used for comparison operations.
4308 See if the operands have both been converted from subword integer types
4309 and, if so, perhaps change them both back to their original type.
4310 This function is also responsible for converting the two operands
4311 to the proper common type for comparison.
4313 The arguments of this function are all pointers to local variables
4314 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4315 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4317 LOC is the location of the comparison.
4319 If this function returns nonzero, it means that the comparison has
4320 a constant value. What this function returns is an expression for
4321 that value. */
4323 tree
4326 {
4327 tree type;
4335 /* Throw away any conversions to wider types
4336 already present in the operands. */
4341 /* If primopN is first sign-extended from primopN's precision to opN's
4342 precision, then zero-extended from opN's precision to
4343 *restype_ptr precision, shortenings might be invalid. */
4346 && !unsignedp0
4351 && !unsignedp1
4355 /* Handle the case that OP0 does not *contain* a conversion
4356 but it *requires* conversion to FINAL_TYPE. */
4363 /* If one of the operands must be floated, we cannot optimize. */
4367 /* If first arg is constant, swap the args (changing operation
4368 so value is preserved), for canonicalization. Don't do this if
4369 the second arg is 0. */
4374 {
4383 {
4398 }
4400 }
4402 /* If comparing an integer against a constant more bits wide,
4403 maybe we can deduce a value of 1 or 0 independent of the data.
4404 Or else truncate the constant now
4405 rather than extend the variable at run time.
4407 This is only interesting if the constant is the wider arg.
4408 Also, it is not safe if the constant is unsigned and the
4409 variable arg is signed, since in this case the variable
4410 would be sign-extended and then regarded as unsigned.
4411 Our technique fails in this case because the lowest/highest
4412 possible unsigned results don't follow naturally from the
4413 lowest/highest possible values of the variable operand.
4414 For just EQ_EXPR and NE_EXPR there is another technique that
4415 could be used: see if the constant can be faithfully represented
4416 in the other operand's type, by truncating it and reextending it
4417 and see if that preserves the constant's value. */
4423 {
4426 /* 1 if comparison is nominally unsigned. */
4428 tree val;
4440 {
4441 /* Convert primop1 to target type, but do not introduce
4442 additional overflow. We know primop1 is an int_cst. */
4449 }
4451 {
4454 }
4462 /* This used to be a switch, but Genix compiler can't handle that. */
4464 {
4467 }
4469 {
4472 }
4474 {
4479 }
4481 {
4486 }
4488 {
4493 }
4495 {
4500 }
4502 /* If primop0 was sign-extended and unsigned comparison specd,
4503 we did a signed comparison above using the signed type bounds.
4504 But the comparison we output must be unsigned.
4506 Also, for inequalities, VAL is no good; but if the signed
4507 comparison had *any* fixed result, it follows that the
4508 unsigned comparison just tests the sign in reverse
4509 (positive values are LE, negative ones GE).
4510 So we can generate an unsigned comparison
4511 against an extreme value of the signed type. */
4514 {
4517 {
4532 }
4534 }
4537 {
4544 }
4547 {
4548 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4552 }
4554 /* Value is not predetermined, but do the comparison
4555 in the type of the operand that is not constant.
4556 TYPE is already properly set. */
4557 }
4559 /* If either arg is decimal float and the other is float, find the
4560 proper common type to use for comparison. */
4566 /* If either arg is decimal float and the other is float, fail. */
4577 /* If args' natural types are both narrower than nominal type
4578 and both extend in the same manner, compare them
4579 in the type of the wider arg.
4580 Otherwise must actually extend both to the nominal
4581 common type lest different ways of extending
4582 alter the result.
4583 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4588 {
4592 type);
4593 /* Make sure shorter operand is extended the right way
4594 to match the longer operand. */
4595 primop0
4598 primop0);
4599 primop1
4602 primop1);
4603 }
4604 else
4605 {
4606 /* Here we must do the comparison on the nominal type
4607 using the args exactly as we received them. */
4614 {
4616 /* All unsigned values are >= 0, so we warn. However,
4617 if OP0 is a constant that is >= 0, the signedness of
4618 the comparison isn't an issue, so suppress the
4619 warning. */
4624 primop0)))
4625 /* Do not warn for enumeration types. */
4629 {
4646 }
4649 {
4650 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4655 }
4656 }
4657 }
4665 }
4666 \f
4667 /* Return a tree for the sum or difference (RESULTCODE says which)
4668 of pointer PTROP and integer INTOP. */
4670 tree
4673 {
4676 /* The result is a pointer of the same type that is being added. */
4680 {
4687 }
4689 {
4696 }
4697 else
4700 /* We are manipulating pointer values, so we don't need to warn
4701 about relying on undefined signed overflow. We disable the
4702 warning here because we use integer types so fold won't know that
4703 they are really pointers. */
4706 /* If what we are about to multiply by the size of the elements
4707 contains a constant term, apply distributive law
4708 and multiply that constant term separately.
4709 This helps produce common subexpressions. */
4714 /* If the constant comes from pointer subtraction,
4715 skip this optimization--it would cause an error. */
4717 /* If the constant is unsigned, and smaller than the pointer size,
4718 then we must skip this optimization. This is because it could cause
4719 an overflow error if the constant is negative but INTOP is not. */
4723 {
4728 /* Convert both subexpression types to the type of intop,
4729 because weird cases involving pointer arithmetic
4730 can result in a sum or difference with different type args. */
4735 }
4737 /* Convert the integer argument to a type the same size as sizetype
4738 so the multiply won't overflow spuriously. */
4744 /* Replace the integer argument with a suitable product by the object size.
4745 Do this multiplication as signed, then convert to the appropriate type
4746 for the pointer operation and disregard an overflow that occurred only
4747 because of the sign-extension change in the latter conversion. */
4748 {
4755 }
4757 /* Create the sum or difference. */
4766 }
4767 \f
4768 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4769 and if NON_CONST is known not to be permitted in an evaluated part
4770 of a constant expression. */
4772 tree
4774 {
4778 /* This should never be called for C++. */
4782 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4791 }
4793 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4794 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4795 around the SAVE_EXPR if needed so that c_fully_fold does not need
4796 to look inside SAVE_EXPRs. */
4798 tree
4800 {
4809 }
4811 /* Return whether EXPR is a declaration whose address can never be
4812 NULL. */
4814 bool
4816 {
4821 }
4823 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4824 or for an `if' or `while' statement or ?..: exp. It should already
4825 have been validated to be of suitable type; otherwise, a bad
4826 diagnostic may result.
4828 The EXPR is located at LOCATION.
4830 This preparation consists of taking the ordinary
4831 representation of an expression expr and producing a valid tree
4832 boolean expression describing whether expr is nonzero. We could
4833 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4834 but we optimize comparisons, &&, ||, and !.
4836 The resulting type should always be `truthvalue_type_node'. */
4838 tree
4840 {
4842 {
4884 ? truthvalue_true_node
4890 ? truthvalue_true_node
4895 /* Fall through. */
4898 {
4901 {
4902 /* Common Ada/Pascal programmer's mistake. */
4904 OPT_Waddress,
4906 inner);
4908 }
4910 }
4927 /* These don't change whether an object is nonzero or zero. */
4932 /* These don't change whether an object is zero or nonzero, but
4933 we can't ignore them if their second arg has side-effects. */
4935 {
4938 c_common_truthvalue_conversion
4941 }
4942 else
4947 /* Distribute the conversion into the arms of a COND_EXPR. */
4949 {
4952 /* In C++ one of the arms might have void type if it is throw. */
4960 }
4961 else
4962 {
4963 /* Folding will happen later for C. */
4971 }
4973 CASE_CONVERT:
4974 {
4978 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4979 since that affects how `default_conversion' will behave. */
4983 /* Don't strip a conversion from C++0x scoped enum, since they
4984 don't implicitly convert to other types. */
4988 /* If this isn't narrowing the argument, we can ignore it. */
4992 }
4998 {
5002 }
5007 }
5010 {
5012 expr = (build_binary_op
5016 c_common_truthvalue_conversion
5019 c_common_truthvalue_conversion
5024 }
5027 {
5032 }
5033 else
5036 ret:
5039 }
5040 \f
5049 /* Apply the TYPE_QUALS to the new DECL. */
5051 void
5053 {
5061 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
5062 constructor can produce constant init, so rely on cp_finish_decl to
5063 clear TREE_READONLY if the variable has non-constant init. */
5066 {
5069 }
5071 {
5073 /* Allow 'restrict' on arrays of pointers.
5074 FIXME currently we just ignore it. */
5080 }
5081 }
5084 {
5087 };
5089 /* Hash function for the problem of multiple type definitions in
5090 different files. This must hash all types that will compare
5091 equal via comptypes to the same value. In practice it hashes
5092 on some of the simple stuff and leaves the details to comptypes. */
5094 hashval_t
5096 {
5099 tree t2;
5101 {
5102 /* For pointers, hash on pointee type plus some swizzling. */
5105 /* Hash on number of elements and total size. */
5124 }
5125 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
5126 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
5128 /* We might have a VLA here. */
5131 else
5134 }
5136 bool
5138 {
5140 }
5144 /* Return the typed-based alias set for T, which may be an expression
5145 or a type. Return -1 if we don't do anything special. */
5147 alias_set_type
5149 {
5150 tree u;
5152 /* For VLAs, use the alias set of the element type rather than the
5153 default of alias set 0 for types compared structurally. */
5155 {
5159 }
5161 /* Permit type-punning when accessing a union, provided the access
5162 is directly through the union. For example, this code does not
5163 permit taking the address of a union member and then storing
5164 through it. Even the type-punning allowed here is a GCC
5165 extension, albeit a common and useful one; the C standard says
5166 that such accesses have implementation-defined behavior. */
5174 /* That's all the expressions we handle specially. */
5178 /* The C standard guarantees that any object may be accessed via an
5179 lvalue that has character type. */
5185 /* The C standard specifically allows aliasing between signed and
5186 unsigned variants of the same type. We treat the signed
5187 variant as canonical. */
5189 {
5192 /* t1 == t can happen for boolean nodes which are always unsigned. */
5195 }
5197 /* Handle the case of multiple type nodes referring to "the same" type,
5198 which occurs with IMA. These share an alias set. FIXME: Currently only
5199 C90 is handled. (In C99 type compatibility is not transitive, which
5200 complicates things mightily. The alias set splay trees can theoretically
5201 represent this, but insertion is tricky when you consider all the
5202 different orders things might arrive in.) */
5207 /* Save time if there's only one input file. */
5211 /* Pointers need special handling if they point to any type that
5212 needs special handling (below). */
5214 {
5215 tree t2;
5216 /* Find bottom type under any nested POINTERs. */
5220 ;
5228 }
5229 /* These are the only cases that need special handling. */
5236 /* Undefined? */
5240 /* Look up t in hash table. Only one of the compatible types within each
5241 alias set is recorded in the table. */
5246 {
5249 }
5250 else
5251 /* Our caller will assign and record (in t) a new alias set; all we need
5252 to do is remember t in the hash table. */
5256 }
5257 \f
5258 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5259 the IS_SIZEOF parameter indicates which operator is being applied.
5260 The COMPLAIN flag controls whether we should diagnose possibly
5261 ill-formed constructs or not. LOC is the location of the SIZEOF or
5262 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5263 a type in any context should be returned, rather than the normal
5264 alignment for that type. */
5266 tree
5270 {
5278 {
5280 {
5287 }
5288 else
5289 {
5291 {
5295 else
5298 }
5300 }
5301 }
5303 {
5311 }
5314 {
5319 }
5322 {
5327 }
5328 else
5329 {
5331 /* Convert in case a char is more than one unit. */
5337 else
5339 }
5341 /* VALUE will have the middle-end integer type sizetype.
5342 However, we should really return a value of type `size_t',
5343 which is just a typedef for an ordinary integer type. */
5347 }
5349 /* Implement the __alignof keyword: Return the minimum required
5350 alignment of EXPR, measured in bytes. For VAR_DECLs,
5351 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5352 from an "aligned" __attribute__ specification). LOC is the
5353 location of the ALIGNOF operator. */
5355 tree
5357 {
5358 tree t;
5365 {
5368 }
5374 {
5381 {
5388 }
5390 }
5391 else
5395 }
5396 \f
5397 /* Handle C and C++ default attributes. */
5399 enum built_in_attribute
5400 {
5401 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5402 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5403 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5404 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5405 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5407 #undef DEF_ATTR_NULL_TREE
5408 #undef DEF_ATTR_INT
5409 #undef DEF_ATTR_STRING
5410 #undef DEF_ATTR_IDENT
5411 #undef DEF_ATTR_TREE_LIST
5412 ATTR_LAST
5413 };
5419 enum c_builtin_type
5420 {
5421 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5422 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5423 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5424 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5425 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5426 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5427 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5428 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5429 ARG6) NAME,
5430 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5431 ARG6, ARG7) NAME,
5432 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5433 ARG6, ARG7, ARG8) NAME,
5434 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5435 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5436 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5437 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5438 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5439 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5440 NAME,
5441 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5442 ARG6, ARG7) NAME,
5443 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5444 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5445 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5447 #undef DEF_PRIMITIVE_TYPE
5448 #undef DEF_FUNCTION_TYPE_0
5449 #undef DEF_FUNCTION_TYPE_1
5450 #undef DEF_FUNCTION_TYPE_2
5451 #undef DEF_FUNCTION_TYPE_3
5452 #undef DEF_FUNCTION_TYPE_4
5453 #undef DEF_FUNCTION_TYPE_5
5454 #undef DEF_FUNCTION_TYPE_6
5455 #undef DEF_FUNCTION_TYPE_7
5456 #undef DEF_FUNCTION_TYPE_8
5457 #undef DEF_FUNCTION_TYPE_VAR_0
5458 #undef DEF_FUNCTION_TYPE_VAR_1
5459 #undef DEF_FUNCTION_TYPE_VAR_2
5460 #undef DEF_FUNCTION_TYPE_VAR_3
5461 #undef DEF_FUNCTION_TYPE_VAR_4
5462 #undef DEF_FUNCTION_TYPE_VAR_5
5463 #undef DEF_FUNCTION_TYPE_VAR_7
5464 #undef DEF_FUNCTION_TYPE_VAR_11
5465 #undef DEF_POINTER_TYPE
5466 BT_LAST
5467 };
5471 /* A temporary array for c_common_nodes_and_builtins. Used in
5472 communication with def_fn_type. */
5475 /* A helper function for c_common_nodes_and_builtins. Build function type
5476 for DEF with return type RET and N arguments. If VAR is true, then the
5477 function should be variadic after those N arguments.
5479 Takes special care not to ICE if any of the types involved are
5480 error_mark_node, which indicates that said type is not in fact available
5481 (see builtin_type_for_size). In which case the function type as a whole
5482 should be error_mark_node. */
5484 static void
5486 {
5487 tree t;
5494 {
5500 }
5507 else
5510 egress:
5513 }
5515 /* Build builtin functions common to both C and C++ language
5516 frontends. */
5518 static void
5520 {
5521 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5522 builtin_types[ENUM] = VALUE;
5523 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5524 def_fn_type (ENUM, RETURN, 0, 0);
5525 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5526 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5527 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5528 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5529 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5530 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5531 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5532 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5533 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5534 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5535 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5536 ARG6) \
5537 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5538 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5539 ARG6, ARG7) \
5540 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5541 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5542 ARG6, ARG7, ARG8) \
5543 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5544 ARG7, ARG8);
5545 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5546 def_fn_type (ENUM, RETURN, 1, 0);
5547 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5548 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5549 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5550 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5551 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5552 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5553 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5554 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5555 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5556 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5557 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5558 ARG6, ARG7) \
5559 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5560 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5561 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5562 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5563 ARG7, ARG8, ARG9, ARG10, ARG11);
5564 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5565 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5569 #undef DEF_PRIMITIVE_TYPE
5570 #undef DEF_FUNCTION_TYPE_0
5571 #undef DEF_FUNCTION_TYPE_1
5572 #undef DEF_FUNCTION_TYPE_2
5573 #undef DEF_FUNCTION_TYPE_3
5574 #undef DEF_FUNCTION_TYPE_4
5575 #undef DEF_FUNCTION_TYPE_5
5576 #undef DEF_FUNCTION_TYPE_6
5577 #undef DEF_FUNCTION_TYPE_7
5578 #undef DEF_FUNCTION_TYPE_8
5579 #undef DEF_FUNCTION_TYPE_VAR_0
5580 #undef DEF_FUNCTION_TYPE_VAR_1
5581 #undef DEF_FUNCTION_TYPE_VAR_2
5582 #undef DEF_FUNCTION_TYPE_VAR_3
5583 #undef DEF_FUNCTION_TYPE_VAR_4
5584 #undef DEF_FUNCTION_TYPE_VAR_5
5585 #undef DEF_FUNCTION_TYPE_VAR_7
5586 #undef DEF_FUNCTION_TYPE_VAR_11
5587 #undef DEF_POINTER_TYPE
5592 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5593 NONANSI_P, ATTRS, IMPLICIT, COND) \
5594 if (NAME && COND) \
5595 def_builtin_1 (ENUM, NAME, CLASS, \
5596 builtin_types[(int) TYPE], \
5597 builtin_types[(int) LIBTYPE], \
5598 BOTH_P, FALLBACK_P, NONANSI_P, \
5599 built_in_attributes[(int) ATTRS], IMPLICIT);
5601 #undef DEF_BUILTIN
5609 }
5611 /* Like get_identifier, but avoid warnings about null arguments when
5612 the argument may be NULL for targets where GCC lacks stdint.h type
5613 information. */
5617 {
5619 }
5621 /* Build tree nodes and builtin functions common to both C and C++ language
5622 frontends. */
5624 void
5626 {
5630 tree array_domain_type;
5631 tree va_list_ref_type_node;
5632 tree va_list_arg_type_node;
5637 /* Define `int' and `char' first so that dbx will output them first. */
5641 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5642 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5643 but not C. Are the conditionals here needed? */
5649 long_unsigned_type_node);
5652 {
5660 }
5665 long_long_integer_type_node);
5667 long_long_unsigned_type_node);
5670 long_long_unsigned_type_node);
5673 short_unsigned_type_node);
5676 short_unsigned_type_node);
5678 /* Define both `signed char' and `unsigned char'. */
5682 /* These are types that c_common_type_for_size and
5683 c_common_type_for_mode use. */
5686 intQI_type_node));
5689 intHI_type_node));
5692 intSI_type_node));
5695 intDI_type_node));
5696 #if HOST_BITS_PER_WIDE_INT >= 64
5697 /* Note that this is different than the __int128 type that's part of
5698 the generic __intN support. */
5701 TYPE_DECL,
5703 intTI_type_node));
5704 #endif
5707 unsigned_intQI_type_node));
5710 unsigned_intHI_type_node));
5713 unsigned_intSI_type_node));
5716 unsigned_intDI_type_node));
5717 #if HOST_BITS_PER_WIDE_INT >= 64
5720 TYPE_DECL,
5722 unsigned_intTI_type_node));
5723 #endif
5725 /* Create the widest literal types. */
5726 widest_integer_literal_type_node
5730 widest_integer_literal_type_node));
5732 widest_unsigned_literal_type_node
5736 widest_unsigned_literal_type_node));
5740 pid_type_node =
5747 /* Only supported decimal floating point extension if the target
5748 actually supports underlying modes. */
5752 {
5756 }
5759 {
5764 long_long_fract_type_node);
5766 unsigned_short_fract_type_node);
5768 unsigned_fract_type_node);
5770 unsigned_long_fract_type_node);
5772 unsigned_long_long_fract_type_node);
5774 sat_short_fract_type_node);
5777 sat_long_fract_type_node);
5779 sat_long_long_fract_type_node);
5781 sat_unsigned_short_fract_type_node);
5783 sat_unsigned_fract_type_node);
5785 sat_unsigned_long_fract_type_node);
5787 sat_unsigned_long_long_fract_type_node);
5792 long_long_accum_type_node);
5794 unsigned_short_accum_type_node);
5796 unsigned_accum_type_node);
5798 unsigned_long_accum_type_node);
5800 unsigned_long_long_accum_type_node);
5802 sat_short_accum_type_node);
5805 sat_long_accum_type_node);
5807 sat_long_long_accum_type_node);
5809 sat_unsigned_short_accum_type_node);
5811 sat_unsigned_accum_type_node);
5813 sat_unsigned_long_accum_type_node);
5815 sat_unsigned_long_long_accum_type_node);
5817 }
5820 TYPE_DECL,
5822 complex_integer_type_node));
5824 TYPE_DECL,
5826 complex_float_type_node));
5828 TYPE_DECL,
5830 complex_double_type_node));
5834 complex_long_double_type_node));
5837 /* For C++, make fileptr_type_node a distinct void * type until
5838 FILE type is defined. */
5843 /* Set the TYPE_NAME for any variants that were built before
5844 record_builtin_type gave names to the built-in types. */
5845 {
5851 }
5855 /* Make a type to be the domain of a few array types
5856 whose domains don't really matter.
5857 200 is small enough that it always fits in size_t
5858 and large enough that it can hold most function names for the
5859 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5862 /* Make a type for arrays of characters.
5863 With luck nothing will ever really depend on the length of this
5864 array type. */
5865 char_array_type_node
5869 const_string_type_node
5873 /* This is special for C++ so functions can be overloaded. */
5879 {
5882 else
5885 }
5887 /* This is for wide string constants. */
5888 wchar_array_type_node
5891 /* Define 'char16_t'. */
5896 {
5901 }
5903 /* This is for UTF-16 string constants. */
5904 char16_array_type_node
5907 /* Define 'char32_t'. */
5912 {
5917 }
5919 /* This is for UTF-32 string constants. */
5920 char32_array_type_node
5923 wint_type_node =
5926 intmax_type_node =
5928 uintmax_type_node =
5932 sig_atomic_type_node =
5935 int8_type_node =
5938 int16_type_node =
5941 int32_type_node =
5944 int64_type_node =
5947 uint8_type_node =
5959 int_least8_type_node =
5962 int_least16_type_node =
5965 int_least32_type_node =
5968 int_least64_type_node =
5971 uint_least8_type_node =
5974 uint_least16_type_node =
5977 uint_least32_type_node =
5980 uint_least64_type_node =
5983 int_fast8_type_node =
5986 int_fast16_type_node =
5989 int_fast32_type_node =
5992 int_fast64_type_node =
5995 uint_fast8_type_node =
5998 uint_fast16_type_node =
6001 uint_fast32_type_node =
6004 uint_fast64_type_node =
6007 intptr_type_node =
6010 uintptr_type_node =
6013 default_function_type
6015 ptrdiff_type_node
6022 va_list_type_node));
6024 {
6027 tree ptype;
6030 {
6034 ptype));
6036 }
6037 }
6040 {
6043 }
6044 else
6045 {
6048 }
6055 /* Create the built-in __null node. It is important that this is
6056 not shared. */
6060 /* Since builtin_types isn't gc'ed, don't export these nodes. */
6062 }
6064 /* The number of named compound-literals generated thus far. */
6067 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
6069 void
6071 {
6074 compound_literal_number);
6075 compound_literal_number++;
6077 }
6079 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
6080 TYPE and operand OP. */
6082 static tree
6084 {
6088 }
6090 /* Return a VA_ARG_EXPR corresponding to a source-level expression
6091 va_arg (EXPR, TYPE) at source location LOC. */
6093 tree
6095 {
6098 ? NULL_TREE
6103 {
6104 /* Let's handle things neutrallly, if expr:
6105 - has undeclared type, or
6106 - is not an va_list type. */
6108 }
6111 {
6112 /* Case 1: Not an array type. */
6114 /* Take the address, to get '&ap'. */
6118 /* Verify that &ap is still recognized as having va_list type. */
6119 tree canon_expr_type
6124 }
6126 /* Case 2: Array type.
6128 Background:
6130 For contrast, let's start with the simple case (case 1). If
6131 canon_va_type is not an array type, but say a char *, then when
6132 passing-by-value a va_list, the type of the va_list param decl is
6133 the same as for another va_list decl (all ap's are char *):
6135 f2_1 (char * ap)
6136 D.1815 = VA_ARG (&ap, 0B, 1);
6137 return D.1815;
6139 f2 (int i)
6140 char * ap.0;
6141 char * ap;
6142 __builtin_va_start (&ap, 0);
6143 ap.0 = ap;
6144 res = f2_1 (ap.0);
6145 __builtin_va_end (&ap);
6146 D.1812 = res;
6147 return D.1812;
6149 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
6150 va_list the type of the va_list param decl (case 2b, struct * ap) is not
6151 the same as for another va_list decl (case 2a, struct ap[1]).
6153 f2_1 (struct * ap)
6154 D.1844 = VA_ARG (ap, 0B, 0);
6155 return D.1844;
6157 f2 (int i)
6158 struct ap[1];
6159 __builtin_va_start (&ap, 0);
6160 res = f2_1 (&ap);
6161 __builtin_va_end (&ap);
6162 D.1841 = res;
6163 return D.1841;
6165 Case 2b is different because:
6166 - on the callee side, the parm decl has declared type va_list, but
6167 grokdeclarator changes the type of the parm decl to a pointer to the
6168 array elem type.
6169 - on the caller side, the pass-by-value uses &ap.
6171 We unify these two cases (case 2a: va_list is array type,
6172 case 2b: va_list is pointer to array elem type), by adding '&' for the
6173 array type case, such that we have a pointer to array elem in both
6174 cases. */
6177 {
6178 /* Case 2a: va_list is array type. */
6180 /* Take the address, to get '&ap'. Make sure it's a pointer to array
6181 elem type. */
6184 expr);
6186 /* Verify that &ap is still recognized as having va_list type. */
6187 tree canon_expr_type
6190 }
6191 else
6192 {
6193 /* Case 2b: va_list is pointer to array elem type. */
6197 /* Don't take the address. We've already got '&ap'. */
6198 ;
6199 }
6202 }
6205 /* Linked list of disabled built-in functions. */
6208 {
6216 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6217 begins with "__builtin_", give an error. */
6219 void
6221 {
6224 else
6225 {
6230 }
6231 }
6234 /* Return true if the built-in function NAME has been disabled, false
6235 otherwise. */
6237 static bool
6239 {
6242 {
6245 }
6247 }
6250 /* Worker for DEF_BUILTIN.
6251 Possibly define a builtin function with one or two names.
6252 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6253 nonansi_p and flag_no_nonansi_builtin. */
6255 static void
6262 {
6263 tree decl;
6276 fnattrs);
6285 }
6286 \f
6287 /* Nonzero if the type T promotes to int. This is (nearly) the
6288 integral promotions defined in ISO C99 6.3.1.1/2. */
6290 bool
6292 {
6294 {
6304 /* ??? Technically all enumerations not larger than an int
6305 promote to an int. But this is used along code paths
6306 that only want to notice a size change. */
6314 }
6315 }
6317 /* Return 1 if PARMS specifies a fixed number of parameters
6318 and none of their types is affected by default promotions. */
6320 int
6322 {
6323 const_tree t;
6325 {
6342 }
6344 }
6346 /* Recursively remove any '*' or '&' operator from TYPE. */
6347 tree
6349 {
6353 }
6355 /* Recursively remove pointer or array type from TYPE. */
6356 tree
6358 {
6362 }
6364 /* Used to compare case labels. K1 and K2 are actually tree nodes
6365 representing case labels, or NULL_TREE for a `default' label.
6366 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6367 K2, and 0 if K1 and K2 are equal. */
6369 int
6371 {
6372 /* Consider a NULL key (such as arises with a `default' label) to be
6373 smaller than anything else. */
6380 }
6382 /* Process a case label, located at LOC, for the range LOW_VALUE
6383 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6384 then this case label is actually a `default' label. If only
6385 HIGH_VALUE is NULL_TREE, then case label was declared using the
6386 usual C/C++ syntax, rather than the GNU case range extension.
6387 CASES is a tree containing all the case ranges processed so far;
6388 COND is the condition for the switch-statement itself. Returns the
6389 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6390 is created. */
6392 tree
6395 {
6396 tree type;
6397 tree label;
6398 tree case_label;
6399 splay_tree_node node;
6401 /* Create the LABEL_DECL itself. */
6404 /* If there was an error processing the switch condition, bail now
6405 before we get more confused. */
6413 {
6416 }
6418 /* Case ranges are a GNU extension. */
6425 {
6430 }
6432 {
6437 }
6440 {
6441 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6442 really a case range, even though it was written that way.
6443 Remove the HIGH_VALUE to simplify later processing. */
6448 }
6450 /* See if the case is in range of the type of the original testing
6451 expression. If both low_value and high_value are out of range,
6452 don't insert the case label and return NULL_TREE. */
6458 /* Look up the LOW_VALUE in the table of case labels we already
6459 have. */
6461 /* If there was not an exact match, check for overlapping ranges.
6462 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6463 that's a `default' label and the only overlap is an exact match. */
6465 {
6466 splay_tree_node low_bound;
6467 splay_tree_node high_bound;
6469 /* Even though there wasn't an exact match, there might be an
6470 overlap between this case range and another case range.
6471 Since we've (inductively) not allowed any overlapping case
6472 ranges, we simply need to find the greatest low case label
6473 that is smaller that LOW_VALUE, and the smallest low case
6474 label that is greater than LOW_VALUE. If there is an overlap
6475 it will occur in one of these two ranges. */
6481 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6482 the LOW_VALUE, so there is no need to check unless the
6483 LOW_BOUND is in fact itself a case range. */
6489 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6490 range is bigger than the low end of the current range, so we
6491 are only interested if the current range is a real range, and
6492 not an ordinary case label. */
6494 && high_value
6496 high_value)
6499 }
6500 /* If there was an overlap, issue an error. */
6502 {
6506 {
6510 }
6512 {
6515 }
6516 else
6517 {
6521 }
6523 }
6525 /* Add a CASE_LABEL to the statement-tree. */
6527 /* Register this case label in the splay tree. */
6534 error_out:
6535 /* Add a label so that the back-end doesn't think that the beginning of
6536 the switch is unreachable. Note that we do not add a case label, as
6537 that just leads to duplicates and thence to failure later on. */
6539 {
6542 }
6544 }
6546 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6547 Used to verify that case values match up with enumerator values. */
6549 static void
6551 {
6558 else
6565 buf);
6566 else
6571 }
6573 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6574 Used to verify that case values match up with enumerator values. */
6576 static int
6578 {
6582 /* Skip default case. */
6586 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6587 when we did our enum->case scan. Reset our scratch bit after. */
6590 else
6593 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6594 not set, that means that CASE_HIGH did not appear when we did our
6595 enum->case scan. Reset our scratch bit after. */
6597 {
6600 else
6602 }
6605 }
6607 /* Handle -Wswitch*. Called from the front end after parsing the
6608 switch construct. */
6609 /* ??? Should probably be somewhere generic, since other languages
6610 besides C and C++ would want this. At the moment, however, C/C++
6611 are the only tree-ssa languages that support enumerations at all,
6612 so the point is moot. */
6614 void
6617 {
6618 splay_tree_node default_node;
6619 splay_tree_node node;
6620 tree chain;
6630 /* From here on, we only care about about enumerated types. */
6634 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6638 /* Check the cases. Warn about case values which are not members of
6639 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6640 there is no default case, check that exactly all enumeration
6641 literals are covered by the cases. */
6643 /* Clearing COND if it is not an integer constant simplifies
6644 the tests inside the loop below. */
6648 /* The time complexity here is O(N*lg(N)) worst case, but for the
6649 common case of monotonically increasing enumerators, it is
6650 O(N), since the nature of the splay tree will keep the next
6651 element adjacent to the root at all times. */
6654 {
6660 {
6661 /* Mark the CASE_LOW part of the case entry as seen. */
6665 }
6667 /* Even though there wasn't an exact match, there might be a
6668 case range which includes the enumerator's value. */
6671 {
6675 {
6676 /* If we match the upper bound exactly, mark the CASE_HIGH
6677 part of the case entry as seen. */
6681 }
6682 }
6684 /* We've now determined that this enumerated literal isn't
6685 handled by the case labels of the switch statement. */
6687 /* If the switch expression is a constant, we only really care
6688 about whether that constant is handled by the switch. */
6692 /* If there is a default_node, the only relevant option is
6693 Wswitch-enum. Otherwise, if both are enabled then we prefer
6694 to warn using -Wswitch because -Wswitch is enabled by -Wall
6695 while -Wswitch-enum is explicit. */
6698 ? OPT_Wswitch_enum
6702 }
6704 /* Warn if there are case expressions that don't correspond to
6705 enumerators. This can occur since C and C++ don't enforce
6706 type-checking of assignments to enumeration variables.
6708 The time complexity here is now always O(N) worst case, since
6709 we should have marked both the lower bound and upper bound of
6710 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6711 above. This scan also resets those fields. */
6714 }
6716 /* Finish an expression taking the address of LABEL (an
6717 IDENTIFIER_NODE). Returns an expression for the address.
6719 LOC is the location for the expression returned. */
6721 tree
6723 {
6724 tree result;
6734 else
6735 {
6738 /* The current function is not necessarily uninlinable.
6739 Computed gotos are incompatible with inlining, but the value
6740 here could be used only in a diagnostic, for example. */
6742 }
6745 }
6746 \f
6748 /* Given a boolean expression ARG, return a tree representing an increment
6749 or decrement (as indicated by CODE) of ARG. The front end must check for
6750 invalid cases (e.g., decrement in C++). */
6751 tree
6753 {
6754 tree val;
6759 {
6782 }
6785 }
6786 \f
6787 /* Built-in macros for stddef.h and stdint.h, that require macros
6788 defined in this file. */
6789 void
6791 {
6854 }
6856 static void
6858 {
6859 /* Fill in the built_in_attributes array. */
6860 #define DEF_ATTR_NULL_TREE(ENUM) \
6861 built_in_attributes[(int) ENUM] = NULL_TREE;
6862 #define DEF_ATTR_INT(ENUM, VALUE) \
6863 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6864 #define DEF_ATTR_STRING(ENUM, VALUE) \
6865 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6866 #define DEF_ATTR_IDENT(ENUM, STRING) \
6867 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6868 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6869 built_in_attributes[(int) ENUM] \
6870 = tree_cons (built_in_attributes[(int) PURPOSE], \
6871 built_in_attributes[(int) VALUE], \
6872 built_in_attributes[(int) CHAIN]);
6874 #undef DEF_ATTR_NULL_TREE
6875 #undef DEF_ATTR_INT
6876 #undef DEF_ATTR_IDENT
6877 #undef DEF_ATTR_TREE_LIST
6878 }
6880 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6881 identifier as an argument, so the front end shouldn't look it up. */
6883 bool
6885 {
6888 /* Unknown attribute that we'll end up ignoring, return true so we
6889 don't complain about an identifier argument. */
6895 else
6897 }
6899 /* Attribute handlers common to C front ends. */
6901 /* Handle a "packed" attribute; arguments as in
6902 struct attribute_spec.handler. */
6904 static tree
6907 {
6909 {
6913 }
6915 {
6917 /* Still pack bitfields. */
6922 else
6924 }
6925 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6926 used for DECL_REGISTER. It wouldn't mean anything anyway.
6927 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6928 that changes what the typedef is typing. */
6929 else
6930 {
6933 }
6936 }
6938 /* Handle a "nocommon" attribute; arguments as in
6939 struct attribute_spec.handler. */
6941 static tree
6945 {
6948 else
6949 {
6952 }
6955 }
6957 /* Handle a "common" attribute; arguments as in
6958 struct attribute_spec.handler. */
6960 static tree
6963 {
6966 else
6967 {
6970 }
6973 }
6975 /* Handle a "noreturn" attribute; arguments as in
6976 struct attribute_spec.handler. */
6978 static tree
6981 {
6984 /* See FIXME comment in c_common_attribute_table. */
6991 = (build_qualified_type
6992 (build_pointer_type
6996 else
6997 {
7000 }
7003 }
7005 /* Handle a "hot" and attribute; arguments as in
7006 struct attribute_spec.handler. */
7008 static tree
7011 {
7014 {
7016 {
7020 }
7021 /* Most of the rest of the hot processing is done later with
7022 lookup_attribute. */
7023 }
7024 else
7025 {
7028 }
7031 }
7033 /* Handle a "cold" and attribute; arguments as in
7034 struct attribute_spec.handler. */
7036 static tree
7039 {
7042 {
7044 {
7048 }
7049 /* Most of the rest of the cold processing is done later with
7050 lookup_attribute. */
7051 }
7052 else
7053 {
7056 }
7059 }
7061 /* Handle a "no_sanitize_address" attribute; arguments as in
7062 struct attribute_spec.handler. */
7064 static tree
7067 {
7069 {
7072 }
7075 }
7077 /* Handle a "no_address_safety_analysis" attribute; arguments as in
7078 struct attribute_spec.handler. */
7080 static tree
7083 {
7092 }
7094 /* Handle a "no_sanitize_undefined" attribute; arguments as in
7095 struct attribute_spec.handler. */
7097 static tree
7100 {
7102 {
7105 }
7108 }
7110 /* Handle a "stack_protect" attribute; arguments as in
7111 struct attribute_spec.handler. */
7112 static tree
7115 {
7117 {
7120 }
7121 else
7127 }
7129 /* Handle a "noinline" attribute; arguments as in
7130 struct attribute_spec.handler. */
7132 static tree
7136 {
7138 {
7140 {
7144 }
7145 else
7147 }
7148 else
7149 {
7152 }
7155 }
7157 /* Handle a "noclone" attribute; arguments as in
7158 struct attribute_spec.handler. */
7160 static tree
7164 {
7166 {
7169 }
7172 }
7174 /* Handle a "no_icf" attribute; arguments as in
7175 struct attribute_spec.handler. */
7177 static tree
7181 {
7183 {
7186 }
7189 }
7192 /* Handle a "always_inline" attribute; arguments as in
7193 struct attribute_spec.handler. */
7195 static tree
7200 {
7202 {
7204 {
7208 }
7209 else
7210 /* Set the attribute and mark it for disregarding inline
7211 limits. */
7213 }
7214 else
7215 {
7218 }
7221 }
7223 /* Handle a "gnu_inline" attribute; arguments as in
7224 struct attribute_spec.handler. */
7226 static tree
7231 {
7233 {
7234 /* Do nothing else, just set the attribute. We'll get at
7235 it later with lookup_attribute. */
7236 }
7237 else
7238 {
7241 }
7244 }
7246 /* Handle a "leaf" attribute; arguments as in
7247 struct attribute_spec.handler. */
7249 static tree
7253 {
7255 {
7258 }
7260 {
7263 }
7266 }
7268 /* Handle an "artificial" attribute; arguments as in
7269 struct attribute_spec.handler. */
7271 static tree
7276 {
7278 {
7279 /* Do nothing else, just set the attribute. We'll get at
7280 it later with lookup_attribute. */
7281 }
7282 else
7283 {
7286 }
7289 }
7291 /* Handle a "flatten" attribute; arguments as in
7292 struct attribute_spec.handler. */
7294 static tree
7296 tree args ATTRIBUTE_UNUSED,
7298 {
7300 /* Do nothing else, just set the attribute. We'll get at
7301 it later with lookup_attribute. */
7302 ;
7303 else
7304 {
7307 }
7310 }
7312 /* Handle a "warning" or "error" attribute; arguments as in
7313 struct attribute_spec.handler. */
7315 static tree
7318 {
7321 /* Do nothing else, just set the attribute. We'll get at
7322 it later with lookup_attribute. */
7323 ;
7324 else
7325 {
7328 }
7331 }
7333 /* Handle a "used" attribute; arguments as in
7334 struct attribute_spec.handler. */
7336 static tree
7339 {
7345 {
7350 }
7351 else
7352 {
7355 }
7358 }
7360 /* Handle a "unused" attribute; arguments as in
7361 struct attribute_spec.handler. */
7363 static tree
7366 {
7368 {
7376 {
7381 }
7382 else
7383 {
7386 }
7387 }
7388 else
7389 {
7393 }
7396 }
7398 /* Handle a "externally_visible" attribute; arguments as in
7399 struct attribute_spec.handler. */
7401 static tree
7406 {
7410 {
7413 {
7417 }
7418 }
7419 else
7420 {
7423 }
7426 }
7428 /* Handle the "no_reorder" attribute. Arguments as in
7429 struct attribute_spec.handler. */
7431 static tree
7433 tree name,
7434 tree,
7437 {
7442 {
7445 name);
7447 }
7450 }
7452 /* Handle a "const" attribute; arguments as in
7453 struct attribute_spec.handler. */
7455 static tree
7458 {
7461 /* See FIXME comment on noreturn in c_common_attribute_table. */
7467 = (build_qualified_type
7468 (build_pointer_type
7472 else
7473 {
7476 }
7479 }
7481 /* Handle a "transparent_union" attribute; arguments as in
7482 struct attribute_spec.handler. */
7484 static tree
7488 {
7489 tree type;
7500 {
7501 /* Make sure that the first field will work for a transparent union.
7502 If the type isn't complete yet, leave the check to the code in
7503 finish_struct. */
7505 {
7511 }
7514 {
7515 /* If the type isn't complete yet, setting the flag
7516 on a variant wouldn't ever be checked. */
7520 /* build_duplicate_type doesn't work for C++. */
7524 /* A type variant isn't good enough, since we don't a cast
7525 to such a type removed as a no-op. */
7527 }
7531 }
7533 ignored:
7536 }
7538 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7539 get the requested priority for a constructor or destructor,
7540 possibly issuing diagnostics for invalid or reserved
7541 priorities. */
7543 static priority_type
7545 {
7546 HOST_WIDE_INT pri;
7547 tree arg;
7553 {
7556 else
7559 }
7576 {
7579 "destructor priorities from 0 to %d are reserved "
7581 MAX_RESERVED_INIT_PRIORITY);
7582 else
7584 "constructor priorities from 0 to %d are reserved "
7586 MAX_RESERVED_INIT_PRIORITY);
7587 }
7590 invalid:
7593 MAX_INIT_PRIORITY);
7594 else
7596 MAX_INIT_PRIORITY);
7598 }
7600 /* Handle a "constructor" attribute; arguments as in
7601 struct attribute_spec.handler. */
7603 static tree
7607 {
7614 {
7615 priority_type priority;
7620 }
7621 else
7622 {
7625 }
7628 }
7630 /* Handle a "destructor" attribute; arguments as in
7631 struct attribute_spec.handler. */
7633 static tree
7637 {
7644 {
7645 priority_type priority;
7650 }
7651 else
7652 {
7655 }
7658 }
7660 /* Nonzero if the mode is a valid vector mode for this architecture.
7661 This returns nonzero even if there is no hardware support for the
7662 vector mode, but we can emulate with narrower modes. */
7664 static int
7666 {
7668 machine_mode innermode;
7670 /* Doh! What's going on? */
7679 /* Hardware support. Woo hoo! */
7685 /* We should probably return 1 if requesting V4DI and we have no DI,
7686 but we have V2DI, but this is probably very unlikely. */
7688 /* If we have support for the inner mode, we can safely emulate it.
7689 We may not have V2DI, but me can emulate with a pair of DIs. */
7691 }
7694 /* Handle a "mode" attribute; arguments as in
7695 struct attribute_spec.handler. */
7697 static tree
7700 {
7708 else
7709 {
7714 tree typefm;
7719 {
7725 }
7727 /* Change this type to have a type with the specified mode.
7728 First check for the special modes. */
7741 else
7744 {
7747 }
7750 {
7753 }
7757 {
7789 }
7791 {
7794 }
7797 {
7802 {
7805 }
7809 else
7812 }
7813 else
7814 {
7815 /* For fixed-point modes, we need to test if the signness of type
7816 and the machine mode are consistent. */
7819 {
7822 }
7823 /* For fixed-point modes, we need to pass saturating info. */
7827 }
7830 {
7833 }
7835 {
7836 /* For enumeral types, copy the precision from the integer
7837 type returned above. If not an INTEGER_TYPE, we can't use
7838 this mode for this type. */
7840 {
7843 }
7846 {
7849 }
7850 else
7851 {
7852 /* We cannot build a type variant, as there's code that assumes
7853 that TYPE_MAIN_VARIANT has the same mode. This includes the
7854 debug generators. Instead, create a subrange type. This
7855 results in all of the enumeral values being emitted only once
7856 in the original, and the subtype gets them by reference. */
7859 else
7862 }
7863 }
7867 {
7870 }
7873 }
7876 }
7878 /* Handle a "section" attribute; arguments as in
7879 struct attribute_spec.handler. */
7881 static tree
7884 {
7888 {
7892 }
7897 {
7900 }
7903 {
7906 }
7911 {
7915 }
7917 /* The decl may have already been given a section attribute
7918 from a previous declaration. Ensure they match. */
7922 {
7925 }
7930 {
7933 }
7938 fail:
7941 }
7943 /* Check whether ALIGN is a valid user-specified alignment. If so,
7944 return its base-2 log; if not, output an error and return -1. If
7945 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7946 no error. */
7947 int
7949 {
7956 {
7959 }
7964 {
7967 }
7969 {
7972 }
7974 }
7976 /*
7977 If in c++-11, check if the c++-11 alignment constraint with respect
7978 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7979 c++-11 mode, does nothing.
7981 [dcl.align]2/ says:
7983 [* if the constant expression evaluates to a fundamental alignment,
7984 the alignment requirement of the declared entity shall be the
7985 specified fundamental alignment.
7987 * if the constant expression evaluates to an extended alignment
7988 and the implementation supports that alignment in the context
7989 of the declaration, the alignment of the declared entity shall
7990 be that alignment
7992 * if the constant expression evaluates to an extended alignment
7993 and the implementation does not support that alignment in the
7994 context of the declaration, the program is ill-formed]. */
7996 static bool
8000 {
8013 {
8015 {
8016 /* For file scope variables and static members, the target
8017 supports alignments that are at most
8018 MAX_OFILE_ALIGNMENT. */
8021 }
8022 else
8023 {
8024 #ifdef BIGGEST_FIELD_ALIGNMENT
8025 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
8026 #else
8027 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
8028 #endif
8029 /* For non-static members, the target supports either
8030 alignments that at most either BIGGEST_FIELD_ALIGNMENT
8031 if it is defined or BIGGEST_ALIGNMENT. */
8036 #undef MAX_TARGET_FIELD_ALIGNMENT
8037 /* For stack variables, the target supports at most
8038 MAX_STACK_ALIGNMENT. */
8042 }
8043 }
8045 {
8046 /* Let's be liberal for types. */
8049 }
8057 }
8059 /* Handle a "aligned" attribute; arguments as in
8060 struct attribute_spec.handler. */
8062 static tree
8065 {
8069 tree align_expr;
8073 {
8078 }
8079 else
8083 {
8087 }
8095 {
8098 /* If we have a TYPE_DECL, then copy the type, so that we
8099 don't accidentally modify a builtin type. See pushdecl. */
8102 {
8109 }
8110 else
8115 }
8118 {
8121 }
8124 /* C++-11 [dcl.align/4]:
8126 When multiple alignment-specifiers are specified for an
8127 entity, the alignment requirement shall be set to the
8128 strictest specified alignment.
8130 This formally comes from the c++11 specification but we are
8131 doing it for the GNU attribute syntax as well. */
8135 {
8140 else
8144 }
8145 else
8146 {
8149 }
8152 }
8154 /* Handle a "weak" attribute; arguments as in
8155 struct attribute_spec.handler. */
8157 static tree
8162 {
8165 {
8168 }
8170 {
8174 }
8176 {
8181 }
8182 else
8186 }
8188 /* Handle an "alias" or "ifunc" attribute; arguments as in
8189 struct attribute_spec.handler, except that IS_ALIAS tells us
8190 whether this is an alias as opposed to ifunc attribute. */
8192 static tree
8195 {
8200 {
8203 }
8207 /* A static variable declaration is always a tentative definition,
8208 but the alias is a non-tentative definition which overrides. */
8211 {
8215 }
8219 {
8223 }
8225 /* Note that the very first time we process a nested declaration,
8226 decl_function_context will not be set. Indeed, *would* never
8227 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8228 we do below. After such frobbery, pushdecl would set the context.
8229 In any case, this is never what we want. */
8231 {
8232 tree id;
8236 {
8240 }
8242 /* This counts as a use of the object pointed to. */
8247 else
8251 /* ifuncs are also aliases, so set that attribute too. */
8254 }
8255 else
8256 {
8259 }
8262 {
8265 {
8268 else
8270 }
8271 }
8275 }
8277 /* Handle an "alias" or "ifunc" attribute; arguments as in
8278 struct attribute_spec.handler. */
8280 static tree
8283 {
8285 }
8287 /* Handle an "alias" or "ifunc" attribute; arguments as in
8288 struct attribute_spec.handler. */
8290 static tree
8293 {
8295 }
8297 /* Handle a "weakref" attribute; arguments as in struct
8298 attribute_spec.handler. */
8300 static tree
8303 {
8306 /* We must ignore the attribute when it is associated with
8307 local-scoped decls, since attribute alias is ignored and many
8308 such symbols do not even have a DECL_WEAK field. */
8310 || current_function_decl
8312 {
8316 }
8319 {
8323 }
8325 /* The idea here is that `weakref("name")' mutates into `weakref,
8326 alias("name")', and weakref without arguments, in turn,
8327 implicitly adds weak. */
8330 {
8337 }
8338 else
8339 {
8344 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8345 and that isn't supported; and because it wants to add it to
8346 the list of weak decls, which isn't helpful. */
8348 }
8351 {
8355 }
8358 }
8360 /* Handle an "visibility" attribute; arguments as in
8361 struct attribute_spec.handler. */
8363 static tree
8367 {
8373 {
8377 {
8379 name);
8381 }
8383 {
8387 }
8388 }
8390 {
8393 }
8396 {
8399 }
8401 /* If this is a type, set the visibility on the type decl. */
8403 {
8408 {
8410 name);
8412 }
8413 }
8423 else
8424 {
8425 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8427 }
8431 {
8445 }
8450 /* Go ahead and attach the attribute to the node as well. This is needed
8451 so we can determine whether we have VISIBILITY_DEFAULT because the
8452 visibility was not specified, or because it was explicitly overridden
8453 from the containing scope. */
8456 }
8458 /* Determine the ELF symbol visibility for DECL, which is either a
8459 variable or a function. It is an error to use this function if a
8460 definition of DECL is not available in this translation unit.
8461 Returns true if the final visibility has been determined by this
8462 function; false if the caller is free to make additional
8463 modifications. */
8465 bool
8467 {
8470 /* If the user explicitly specified the visibility with an
8471 attribute, honor that. DECL_VISIBILITY will have been set during
8472 the processing of the attribute. We check for an explicit
8473 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8474 to distinguish the use of an attribute from the use of a "#pragma
8475 GCC visibility push(...)"; in the latter case we still want other
8476 considerations to be able to overrule the #pragma. */
8478 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8483 /* Set default visibility to whatever the user supplied with
8484 visibility_specified depending on #pragma GCC visibility. */
8486 {
8489 {
8492 /* If visibility changed and DECL already has DECL_RTL, ensure
8493 symbol flags are updated. */
8498 }
8499 }
8501 }
8503 /* Handle an "tls_model" attribute; arguments as in
8504 struct attribute_spec.handler. */
8506 static tree
8509 {
8510 tree id;
8517 {
8520 }
8525 {
8528 }
8538 else
8539 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8543 }
8545 /* Handle a "no_instrument_function" attribute; arguments as in
8546 struct attribute_spec.handler. */
8548 static tree
8553 {
8557 {
8561 }
8562 else
8566 }
8568 /* Handle a "malloc" attribute; arguments as in
8569 struct attribute_spec.handler. */
8571 static tree
8574 {
8578 else
8579 {
8582 }
8585 }
8587 /* Handle a "alloc_size" attribute; arguments as in
8588 struct attribute_spec.handler. */
8590 static tree
8593 {
8596 {
8603 || !arg_count
8605 {
8610 }
8611 }
8613 }
8615 /* Handle a "alloc_align" attribute; arguments as in
8616 struct attribute_spec.handler. */
8618 static tree
8621 {
8628 || !arg_count
8630 {
8635 }
8637 }
8639 /* Handle a "assume_aligned" attribute; arguments as in
8640 struct attribute_spec.handler. */
8642 static tree
8645 {
8647 {
8654 {
8659 }
8660 }
8662 }
8664 /* Handle a "fn spec" attribute; arguments as in
8665 struct attribute_spec.handler. */
8667 static tree
8671 {
8676 }
8678 /* Handle a "bnd_variable_size" attribute; arguments as in
8679 struct attribute_spec.handler. */
8681 static tree
8684 {
8686 {
8689 }
8692 }
8694 /* Handle a "bnd_legacy" attribute; arguments as in
8695 struct attribute_spec.handler. */
8697 static tree
8700 {
8702 {
8705 }
8708 }
8710 /* Handle a "bnd_instrument" attribute; arguments as in
8711 struct attribute_spec.handler. */
8713 static tree
8716 {
8718 {
8721 }
8724 }
8726 /* Handle a "warn_unused" attribute; arguments as in
8727 struct attribute_spec.handler. */
8729 static tree
8731 tree args ATTRIBUTE_UNUSED,
8733 {
8735 /* Do nothing else, just set the attribute. We'll get at
8736 it later with lookup_attribute. */
8737 ;
8738 else
8739 {
8742 }
8745 }
8747 /* Handle an "omp declare simd" attribute; arguments as in
8748 struct attribute_spec.handler. */
8750 static tree
8752 {
8754 }
8756 /* Handle an "omp declare target" attribute; arguments as in
8757 struct attribute_spec.handler. */
8759 static tree
8761 {
8763 }
8765 /* Handle a "returns_twice" attribute; arguments as in
8766 struct attribute_spec.handler. */
8768 static tree
8771 {
8774 else
8775 {
8778 }
8781 }
8783 /* Handle a "no_limit_stack" attribute; arguments as in
8784 struct attribute_spec.handler. */
8786 static tree
8791 {
8795 {
8799 }
8801 {
8805 }
8806 else
8810 }
8812 /* Handle a "pure" attribute; arguments as in
8813 struct attribute_spec.handler. */
8815 static tree
8818 {
8821 /* ??? TODO: Support types. */
8822 else
8823 {
8826 }
8829 }
8831 /* Digest an attribute list destined for a transactional memory statement.
8832 ALLOWED is the set of attributes that are allowed for this statement;
8833 return the attribute we parsed. Multiple attributes are never allowed. */
8835 int
8837 {
8842 {
8850 {
8853 }
8856 {
8859 }
8862 else
8864 }
8867 }
8869 /* Transform a TM attribute name into a maskable integer and back.
8870 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8871 to how the lack of an attribute is treated. */
8873 int
8875 {
8889 }
8891 tree
8893 {
8896 {
8914 }
8916 }
8918 /* Return the first TM attribute seen in LIST. */
8920 tree
8922 {
8924 {
8928 }
8930 }
8932 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8933 Here we accept only function types, and verify that none of the other
8934 function TM attributes are also applied. */
8935 /* ??? We need to accept class types for C++, but not C. This greatly
8936 complicates this function, since we can no longer rely on the extra
8937 processing given by function_type_required. */
8939 static tree
8942 {
8943 /* Only one path adds the attribute; others don't. */
8947 {
8950 /* Only tm_callable and tm_safe apply to classes. */
8953 /* FALLTHRU */
8957 {
8960 ;
8963 else
8965 }
8969 {
8972 {
8977 }
8978 }
8979 /* FALLTHRU */
8982 /* If a function is next, pass it on to be tried next. */
8986 ignored:
8989 }
8992 }
8994 /* Handle the TM_WRAP attribute; arguments as in
8995 struct attribute_spec.handler. */
8997 static tree
9000 {
9003 /* We don't need the attribute even on success, since we
9004 record the entry in an external table. */
9009 else
9010 {
9013 ;
9017 else
9018 {
9022 {
9026 else
9028 }
9029 else
9031 }
9032 }
9035 }
9037 /* Ignore the given attribute. Used when this attribute may be usefully
9038 overridden by the target, but is not used generically. */
9040 static tree
9044 {
9047 }
9049 /* Handle a "no vops" attribute; arguments as in
9050 struct attribute_spec.handler. */
9052 static tree
9056 {
9060 }
9062 /* Handle a "deprecated" attribute; arguments as in
9063 struct attribute_spec.handler. */
9065 static tree
9069 {
9077 {
9080 }
9083 {
9093 else
9095 }
9097 {
9102 }
9103 else
9107 {
9110 {
9116 }
9119 else
9121 }
9124 }
9126 /* Handle a "vector_size" attribute; arguments as in
9127 struct attribute_spec.handler. */
9129 static tree
9133 {
9135 machine_mode orig_mode;
9146 {
9149 }
9151 /* Get the vector size (in bytes). */
9154 /* We need to provide for vector pointers, vector arrays, and
9155 functions returning vectors. For example:
9157 __attribute__((vector_size(16))) short *foo;
9159 In this case, the mode is SI, but the type being modified is
9160 HI, so we need to look further. */
9169 /* Get the mode of the type being modified. */
9180 {
9183 }
9186 {
9189 }
9192 {
9195 }
9197 /* Calculate how many units fit in the vector. */
9200 {
9203 }
9207 /* Build back pointers if needed. */
9211 }
9213 /* Handle the "nonnull" attribute. */
9214 static tree
9218 {
9222 /* If no arguments are specified, all pointer arguments should be
9223 non-null. Verify a full prototype is given so that the arguments
9224 will have the correct types when we actually check them later. */
9226 {
9228 {
9231 }
9233 }
9235 /* Argument list specified. Verify that each argument number references
9236 a pointer argument. */
9238 {
9247 {
9252 }
9255 {
9256 function_args_iterator iter;
9257 tree argument;
9261 {
9265 }
9269 {
9274 }
9277 {
9282 }
9283 }
9284 }
9287 }
9289 /* Check the argument list of a function call for null in argument slots
9290 that are marked as requiring a non-null pointer argument. The NARGS
9291 arguments are passed in the array ARGARRAY.
9292 */
9294 static void
9296 {
9297 tree a;
9305 /* See if any of the nonnull attributes has no arguments. If so,
9306 then every pointer argument is checked (in which case the check
9307 for pointer type is done in check_nonnull_arg). */
9309 do
9317 else
9318 {
9319 /* Walk the argument list. If we encounter an argument number we
9320 should check for non-null, do it. */
9322 {
9324 {
9328 }
9333 }
9334 }
9335 }
9337 /* Check that the Nth argument of a function call (counting backwards
9338 from the end) is a (pointer)0. The NARGS arguments are passed in the
9339 array ARGARRAY. */
9341 static void
9343 {
9347 {
9350 tree sentinel;
9351 function_args_iterator iter;
9352 tree t;
9354 /* Skip over the named arguments. */
9356 {
9359 len++;
9360 }
9363 {
9366 }
9368 /* The sentinel must be one of the varargs, i.e.
9369 in position >= the number of fixed arguments. */
9371 {
9375 }
9377 /* Validate the sentinel. */
9381 /* Although __null (in C++) is only an integer we allow it
9382 nevertheless, as we are guaranteed that it's exactly
9383 as wide as a pointer, and we don't want to force
9384 users to cast the NULL they have written there.
9385 We warn with -Wstrict-null-sentinel, though. */
9388 }
9389 }
9391 /* Helper for check_function_nonnull; given a list of operands which
9392 must be non-null in ARGS, determine if operand PARAM_NUM should be
9393 checked. */
9395 static bool
9397 {
9401 {
9408 }
9410 }
9412 /* Check that the function argument PARAM (which is operand number
9413 PARAM_NUM) is non-null. This is called by check_function_nonnull
9414 via check_function_arguments_recurse. */
9416 static void
9419 {
9420 /* Just skip checking the argument if it's not a pointer. This can
9421 happen if the "nonnull" attribute was given without an operand
9422 list (which means to check every pointer argument). */
9430 }
9432 /* Helper for nonnull attribute handling; fetch the operand number
9433 from the attribute argument list. */
9435 static bool
9437 {
9438 /* Verify the arg number is a small constant. */
9440 {
9443 }
9444 else
9446 }
9448 /* Handle a "nothrow" attribute; arguments as in
9449 struct attribute_spec.handler. */
9451 static tree
9454 {
9457 /* ??? TODO: Support types. */
9458 else
9459 {
9462 }
9465 }
9467 /* Handle a "cleanup" attribute; arguments as in
9468 struct attribute_spec.handler. */
9470 static tree
9473 {
9477 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9478 for global destructors in C++. This requires infrastructure that
9479 we don't have generically at the moment. It's also not a feature
9480 we'd be missing too much, since we do have attribute constructor. */
9482 {
9486 }
9488 /* Verify that the argument is a function in scope. */
9489 /* ??? We could support pointers to functions here as well, if
9490 that was considered desirable. */
9493 {
9497 }
9500 {
9504 }
9506 /* That the function has proper type is checked with the
9507 eventual call to build_function_call. */
9510 }
9512 /* Handle a "warn_unused_result" attribute. No special handling. */
9514 static tree
9518 {
9519 /* Ignore the attribute for functions not returning any value. */
9521 {
9524 }
9527 }
9529 /* Handle a "sentinel" attribute. */
9531 static tree
9534 {
9536 {
9540 }
9541 else
9542 {
9544 {
9548 }
9549 }
9552 {
9560 {
9564 }
9565 else
9566 {
9568 {
9572 }
9573 }
9574 }
9577 }
9579 /* Handle a "type_generic" attribute. */
9581 static tree
9585 {
9586 /* Ensure we have a function type. */
9589 /* Ensure we have a variadic function. */
9593 }
9595 /* Handle a "target" attribute. */
9597 static tree
9600 {
9601 /* Ensure we have a function type. */
9603 {
9606 }
9608 flags))
9612 }
9614 /* Arguments being collected for optimization. */
9619 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9620 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9621 false for #pragma GCC optimize. */
9623 bool
9625 {
9633 tree ap;
9635 /* Build up argv vector. Just in case the string is stored away, use garbage
9636 collected strings. */
9641 {
9645 {
9649 }
9652 {
9653 /* Split string into multiple substrings. */
9661 {
9668 {
9672 }
9673 else
9674 {
9677 }
9681 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9682 options. */
9684 {
9689 else
9693 }
9696 {
9699 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9700 itself is -Os, and any other switch begins with a -f. */
9706 }
9711 }
9713 }
9714 }
9724 /* Now parse the options. */
9734 /* Don't allow changing -fstrict-aliasing. */
9739 }
9741 /* For handling "optimize" attribute. arguments as in
9742 struct attribute_spec.handler. */
9744 static tree
9747 {
9748 /* Ensure we have a function type. */
9750 {
9753 }
9754 else
9755 {
9759 /* Save current options. */
9762 /* If we previously had some optimization options, use them as the
9763 default. */
9768 /* Parse options, and update the vector. */
9773 /* Restore current options. */
9775 }
9778 }
9780 /* Handle a "no_split_stack" attribute. */
9782 static tree
9787 {
9791 {
9795 }
9797 {
9801 }
9804 }
9806 /* Handle a "returns_nonnull" attribute; arguments as in
9807 struct attribute_spec.handler. */
9809 static tree
9812 {
9813 // Even without a prototype we still have a return type we can check.
9815 {
9818 }
9820 }
9822 /* Handle a "designated_init" attribute; arguments as in
9823 struct attribute_spec.handler. */
9825 static tree
9828 {
9830 {
9833 }
9835 }
9837 \f
9838 /* Check for valid arguments being passed to a function with FNTYPE.
9839 There are NARGS arguments in the array ARGARRAY. */
9840 void
9842 {
9843 /* Check for null being passed in a pointer argument that must be
9844 non-null. We also need to do this if format checking is enabled. */
9849 /* Check for errors in format strings. */
9856 }
9858 /* Generic argument checking recursion routine. PARAM is the argument to
9859 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9860 once the argument is resolved. CTX is context for the callback. */
9861 void
9866 {
9870 {
9871 /* Strip coercion. */
9875 }
9878 {
9880 tree attrs;
9883 /* See if this is a call to a known internationalization function
9884 that modifies a format arg. Such a function may have multiple
9885 format_arg attributes (for example, ngettext). */
9888 attrs;
9891 {
9892 tree inner_arg;
9893 tree format_num_expr;
9896 call_expr_arg_iterator iter;
9898 /* Extract the argument number, which was previously checked
9899 to be valid. */
9908 {
9913 }
9914 }
9916 /* If we found a format_arg attribute and did a recursive check,
9917 we are done with checking this argument. Otherwise, we continue
9918 and this will be considered a non-literal. */
9921 }
9924 {
9925 /* Check both halves of the conditional expression. */
9931 }
9934 }
9936 /* Checks for a builtin function FNDECL that the number of arguments
9937 NARGS against the required number REQUIRED and issues an error if
9938 there is a mismatch. Returns true if the number of arguments is
9939 correct, otherwise false. */
9941 static bool
9943 {
9945 {
9949 }
9951 {
9955 }
9957 }
9959 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9960 Returns false if there was an error, otherwise true. */
9962 bool
9964 {
9970 {
9980 {
9982 {
9986 }
9988 }
9998 {
10005 {
10009 }
10011 }
10016 {
10021 {
10025 }
10028 {
10030 fndecl);
10032 }
10034 }
10039 {
10041 {
10044 }
10046 }
10053 {
10057 {
10061 }
10064 {
10068 }
10070 }
10075 }
10076 }
10078 /* Function to help qsort sort FIELD_DECLs by name order. */
10080 int
10082 {
10087 /* A nontype is "greater" than a type. */
10096 }
10099 gt_pointer_operator new_value;
10103 /* This routine compares two fields like field_decl_cmp but using the
10104 pointer operator in resort_data. */
10106 static int
10108 {
10113 /* A nontype is "greater" than a type. */
10119 {
10126 }
10128 }
10130 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10132 void
10135 gt_pointer_operator new_value,
10137 {
10142 resort_field_decl_cmp);
10143 }
10145 /* Subroutine of c_parse_error.
10146 Return the result of concatenating LHS and RHS. RHS is really
10147 a string literal, its first character is indicated by RHS_START and
10148 RHS_SIZE is its length (including the terminating NUL character).
10150 The caller is responsible for deleting the returned pointer. */
10154 {
10160 }
10162 /* Issue the error given by GMSGID, indicating that it occurred before
10163 TOKEN, which had the associated VALUE. */
10165 void
10168 {
10169 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10179 {
10184 {
10197 }
10201 else
10207 }
10229 {
10234 }
10242 {
10247 }
10248 else
10252 {
10255 }
10256 #undef catenate_messages
10257 }
10259 /* Return the gcc option code associated with the reason for a cpp
10260 message, or 0 if none. */
10262 static int
10264 {
10268 {
10271 }
10273 }
10275 /* Callback from cpp_error for PFILE to print diagnostics from the
10276 preprocessor. The diagnostic is of type LEVEL, with REASON set
10277 to the reason code if LEVEL is represents a warning, at location
10278 LOCATION unless this is after lexing and the compiler's location
10279 should be used instead, with column number possibly overridden by
10280 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10281 the arguments. Returns true if a diagnostic was emitted, false
10282 otherwise. */
10284 bool
10288 {
10289 diagnostic_info diagnostic;
10290 diagnostic_t dlevel;
10295 {
10300 /* Fall through. */
10325 }
10338 }
10340 /* Convert a character from the host to the target execution character
10341 set. cpplib handles this, mostly. */
10343 HOST_WIDE_INT
10345 {
10346 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10347 zero-extended under -fno-signed-char. cpplib insists that characters
10348 and character constants are always unsigned. Hence we must convert
10349 back and forth. */
10357 else
10359 }
10361 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10362 references with an INDIRECT_REF of a constant at the bottom; much like the
10363 traditional rendering of offsetof as a macro. Return the folded result. */
10365 tree
10367 {
10371 {
10387 {
10390 }
10400 {
10404 }
10417 /* Check if the offset goes beyond the upper bound of the array. */
10419 {
10425 {
10429 {
10430 tree v;
10437 {
10445 }
10446 /* Don't warn if the array might be considered a poor
10447 man's flexible array member with a very permissive
10448 definition thereof. */
10452 "index %E denotes an offset "
10455 }
10456 }
10457 }
10464 /* Handle static members of volatile structs. */
10471 }
10474 }
10476 /* Likewise, but convert it to the return type of offsetof. */
10478 tree
10480 {
10482 }
10484 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10485 expression, because B will always be true. */
10487 void
10489 {
10492 "the omitted middle operand in ?: will always be %<true%>, "
10494 }
10496 /* Give an error for storing into ARG, which is 'const'. USE indicates
10497 how ARG was being used. */
10499 void
10501 {
10504 /* Using this macro rather than (for example) arrays of messages
10505 ensures that all the format strings are checked at compile
10506 time. */
10507 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10508 : (use == lv_increment ? (I) \
10509 : (use == lv_decrement ? (D) : (AS))))
10511 {
10522 else
10528 }
10534 arg);
10540 arg);
10542 {
10552 arg);
10553 }
10559 arg);
10560 else
10565 arg);
10566 }
10568 /* Print an error message for an invalid lvalue. USE says
10569 how the lvalue is being used and so selects the error message. LOC
10570 is the location for the error. */
10572 void
10574 {
10576 {
10594 }
10595 }
10597 /* Print an error message for an invalid indirection of type TYPE.
10598 ERRSTRING is the name of the operator for the indirection. */
10600 void
10602 {
10604 {
10612 type);
10617 type);
10622 type);
10627 type);
10632 type);
10636 }
10637 }
10638 \f
10639 /* *PTYPE is an incomplete array. Complete it with a domain based on
10640 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10641 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10642 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10644 int
10646 {
10654 {
10656 {
10657 int eltsize
10660 }
10662 {
10666 {
10670 }
10671 else
10672 {
10673 tree curindex;
10684 {
10688 else
10689 {
10691 {
10692 /* Since we treat size types now as ordinary
10693 unsigned types, we need an explicit overflow
10694 check. */
10698 }
10700 size_one_node);
10701 }
10704 }
10706 {
10710 }
10711 }
10712 }
10713 else
10714 {
10715 /* Make an error message unless that happened already. */
10718 }
10719 }
10720 else
10721 {
10725 }
10732 else
10735 /* Using build_distinct_type_copy and modifying things afterward instead
10736 of using build_array_type to create a new type preserves all of the
10737 TYPE_LANG_FLAG_? bits that the front end may have set. */
10745 /* Make sure we have the canonical MAIN_TYPE. */
10748 hashcode);
10751 /* Fix the canonical type. */
10761 else
10766 else
10772 {
10774 /* If we proceed with the array type as it is, we'll eventually
10775 crash in tree_to_[su]hwi(). */
10777 }
10781 }
10783 /* Like c_mark_addressable but don't check register qualifier. */
10784 void
10786 {
10792 }
10795 \f
10796 /* Used to help initialize the builtin-types.def table. When a type of
10797 the correct size doesn't exist, use error_mark_node instead of NULL.
10798 The later results in segfaults even when a decl using the type doesn't
10799 get invoked. */
10801 tree
10803 {
10806 }
10808 /* A helper function for resolve_overloaded_builtin in resolving the
10809 overloaded __sync_ builtins. Returns a positive power of 2 if the
10810 first operand of PARAMS is a pointer to a supported data type.
10811 Returns 0 if an error is encountered. */
10813 static int
10815 {
10816 tree type;
10820 {
10823 }
10827 {
10828 /* Force array-to-pointer decay for C++. */
10832 }
10844 incompatible:
10847 }
10849 /* A helper function for resolve_overloaded_builtin. Adds casts to
10850 PARAMS to make arguments match up with those of FUNCTION. Drops
10851 the variadic arguments at the end. Returns false if some error
10852 was encountered; true on success. */
10854 static bool
10857 {
10858 function_args_iterator iter;
10859 tree ptype;
10863 /* We've declared the implementation functions to use "volatile void *"
10864 as the pointer parameter, so we shouldn't get any complaints from the
10865 call to check_function_arguments what ever type the user used. */
10870 /* For the rest of the values, we need to cast these to FTYPE, so that we
10871 don't get warnings for passing pointer types, etc. */
10874 {
10878 /* XXX void_type_node belies the abstraction. */
10884 {
10887 }
10889 /* Only convert parameters if arg_type is unsigned integer type with
10890 new format sync routines, i.e. don't attempt to convert pointer
10891 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10892 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10893 kinds). */
10895 {
10896 /* Ideally for the first conversion we'd use convert_for_assignment
10897 so that we get warnings for anything that doesn't match the pointer
10898 type. This isn't portable across the C and C++ front ends atm. */
10903 }
10906 }
10908 /* __atomic routines are not variadic. */
10910 {
10913 }
10915 /* The definition of these primitives is variadic, with the remaining
10916 being "an optional list of variables protected by the memory barrier".
10917 No clue what that's supposed to mean, precisely, but we consider all
10918 call-clobbered variables to be protected so we're safe. */
10922 }
10924 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10925 RESULT to make it match the type of the first pointer argument in
10926 PARAMS. */
10928 static tree
10930 {
10935 /* New format doesn't require casting unless the types are the same size. */
10938 else
10940 }
10942 /* This function verifies the PARAMS to generic atomic FUNCTION.
10943 It returns the size if all the parameters are the same size, otherwise
10944 0 is returned if the parameters are invalid. */
10946 static int
10949 {
10954 tree type_0;
10956 /* Determine the parameter makeup. */
10958 {
10974 }
10977 {
10980 }
10982 /* Get type of first parameter, and determine its size. */
10985 {
10986 /* Force array-to-pointer decay for C++. */
10990 }
10992 {
10994 function);
10996 }
10998 /* Types must be compile time constant sizes. */
11000 {
11003 function);
11005 }
11009 /* Zero size objects are not allowed. */
11011 {
11014 function);
11016 }
11018 /* Check each other parameter is a pointer and the same size. */
11020 {
11023 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11027 {
11029 function);
11031 }
11035 {
11037 function);
11039 }
11040 }
11042 /* Check memory model parameters for validity. */
11044 {
11047 {
11050 {
11053 function);
11054 }
11055 }
11056 else
11058 {
11060 function);
11062 }
11063 }
11066 }
11069 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11070 at the beginning of the parameter list PARAMS representing the size of the
11071 objects. This is to match the library ABI requirement. LOC is the location
11072 of the function call.
11073 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11074 returned to allow the external call to be constructed. */
11076 static tree
11079 {
11080 tree size_node;
11082 /* Insert a SIZE_T parameter as the first param. If there isn't
11083 enough space, allocate a new vector and recursively re-build with that. */
11085 {
11088 tree f;
11098 }
11100 /* Add the size parameter and leave as a function call for processing. */
11104 }
11107 /* Return whether atomic operations for naturally aligned N-byte
11108 arguments are supported, whether inline or through libatomic. */
11109 static bool
11111 {
11113 {
11125 }
11126 }
11128 /* This will process an __atomic_exchange function call, determine whether it
11129 needs to be mapped to the _N variation, or turned into a library call.
11130 LOC is the location of the builtin call.
11131 FUNCTION is the DECL that has been invoked;
11132 PARAMS is the argument list for the call. The return value is non-null
11133 TRUE is returned if it is translated into the proper format for a call to the
11134 external library, and NEW_RETURN is set the tree for that function.
11135 FALSE is returned if processing for the _N variation is required, and
11136 NEW_RETURN is set to the the return value the result is copied into. */
11137 static bool
11140 {
11145 /* Size of 0 is an error condition. */
11147 {
11150 }
11152 /* If not a lock-free size, change to the library generic format. */
11154 {
11157 }
11159 /* Otherwise there is a lockfree match, transform the call from:
11160 void fn(T* mem, T* desired, T* return, model)
11161 into
11162 *return = (T) (fn (In* mem, (In) *desired, model)) */
11169 /* Create pointer to appropriate size. */
11173 /* Convert object pointer to required type. */
11176 /* Convert new value to required type, and dereference it. */
11181 /* Move memory model to the 3rd position, and end param list. */
11185 /* Convert return pointer and dereference it for later assignment. */
11189 }
11192 /* This will process an __atomic_compare_exchange function call, determine
11193 whether it needs to be mapped to the _N variation, or turned into a lib call.
11194 LOC is the location of the builtin call.
11195 FUNCTION is the DECL that has been invoked;
11196 PARAMS is the argument list for the call. The return value is non-null
11197 TRUE is returned if it is translated into the proper format for a call to the
11198 external library, and NEW_RETURN is set the tree for that function.
11199 FALSE is returned if processing for the _N variation is required. */
11201 static bool
11205 {
11210 /* Size of 0 is an error condition. */
11212 {
11215 }
11217 /* If not a lock-free size, change to the library generic format. */
11219 {
11220 /* The library generic format does not have the weak parameter, so
11221 remove it from the param list. Since a parameter has been removed,
11222 we can be sure that there is room for the SIZE_T parameter, meaning
11223 there will not be a recursive rebuilding of the parameter list, so
11224 there is no danger this will be done twice. */
11226 {
11230 }
11233 }
11235 /* Otherwise, there is a match, so the call needs to be transformed from:
11236 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11237 into
11238 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11244 /* Create pointer to appropriate size. */
11248 /* Convert object pointer to required type. */
11252 /* Convert expected pointer to required type. */
11256 /* Convert desired value to required type, and dereference it. */
11261 /* The rest of the parameters are fine. NULL means no special return value
11262 processing.*/
11265 }
11268 /* This will process an __atomic_load function call, determine whether it
11269 needs to be mapped to the _N variation, or turned into a library call.
11270 LOC is the location of the builtin call.
11271 FUNCTION is the DECL that has been invoked;
11272 PARAMS is the argument list for the call. The return value is non-null
11273 TRUE is returned if it is translated into the proper format for a call to the
11274 external library, and NEW_RETURN is set the tree for that function.
11275 FALSE is returned if processing for the _N variation is required, and
11276 NEW_RETURN is set to the the return value the result is copied into. */
11278 static bool
11281 {
11286 /* Size of 0 is an error condition. */
11288 {
11291 }
11293 /* If not a lock-free size, change to the library generic format. */
11295 {
11298 }
11300 /* Otherwise, there is a match, so the call needs to be transformed from:
11301 void fn(T* mem, T* return, model)
11302 into
11303 *return = (T) (fn ((In *) mem, model)) */
11309 /* Create pointer to appropriate size. */
11313 /* Convert object pointer to required type. */
11317 /* Move memory model to the 2nd position, and end param list. */
11321 /* Convert return pointer and dereference it for later assignment. */
11325 }
11328 /* This will process an __atomic_store function call, determine whether it
11329 needs to be mapped to the _N variation, or turned into a library call.
11330 LOC is the location of the builtin call.
11331 FUNCTION is the DECL that has been invoked;
11332 PARAMS is the argument list for the call. The return value is non-null
11333 TRUE is returned if it is translated into the proper format for a call to the
11334 external library, and NEW_RETURN is set the tree for that function.
11335 FALSE is returned if processing for the _N variation is required, and
11336 NEW_RETURN is set to the the return value the result is copied into. */
11338 static bool
11341 {
11346 /* Size of 0 is an error condition. */
11348 {
11351 }
11353 /* If not a lock-free size, change to the library generic format. */
11355 {
11358 }
11360 /* Otherwise, there is a match, so the call needs to be transformed from:
11361 void fn(T* mem, T* value, model)
11362 into
11363 fn ((In *) mem, (In) *value, model) */
11368 /* Create pointer to appropriate size. */
11372 /* Convert object pointer to required type. */
11376 /* Convert new value to required type, and dereference it. */
11381 /* The memory model is in the right spot already. Return is void. */
11385 }
11388 /* Some builtin functions are placeholders for other expressions. This
11389 function should be called immediately after parsing the call expression
11390 before surrounding code has committed to the type of the expression.
11392 LOC is the location of the builtin call.
11394 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11395 PARAMS is the argument list for the call. The return value is non-null
11396 when expansion is complete, and null if normal processing should
11397 continue. */
11399 tree
11402 {
11408 {
11414 else
11418 }
11420 /* Handle BUILT_IN_NORMAL here. */
11422 {
11427 {
11428 /* Handle these 4 together so that they can fall through to the next
11429 case if the call is transformed to an _N variant. */
11431 {
11433 {
11437 /* Change to the _N variant. */
11440 }
11443 {
11445 params,
11448 /* Change to the _N variant. */
11451 }
11453 {
11457 /* Change to the _N variant. */
11460 }
11462 {
11466 /* Change to the _N variant. */
11469 }
11472 }
11473 /* Fallthrough to the normal processing. */
11474 }
11491 {
11493 /* Fallthru for parameter processing. */
11494 }
11511 {
11522 orig_format))
11527 NULL);
11535 /* If new_return is set, assign function to that expr and cast the
11536 result to void since the generic interface returned void. */
11538 {
11539 /* Cast function result from I{1,2,4,8,16} to the required type. */
11542 result);
11546 }
11548 }
11552 }
11553 }
11555 /* vector_types_compatible_elements_p is used in type checks of vectors
11556 values used as operands of binary operators. Where it returns true, and
11557 the other checks of the caller succeed (being vector types in he first
11558 place, and matching number of elements), we can just treat the types
11559 as essentially the same.
11560 Contrast with vector_targets_convertible_p, which is used for vector
11561 pointer types, and vector_types_convertible_p, which will allow
11562 language-specific matches under the control of flag_lax_vector_conversions,
11563 and might still require a conversion. */
11564 /* True if vector types T1 and T2 can be inputs to the same binary
11565 operator without conversion.
11566 We don't check the overall vector size here because some of our callers
11567 want to give different error messages when the vectors are compatible
11568 except for the element count. */
11570 bool
11572 {
11585 /* Equality works here because c_common_signed_type uses
11586 TYPE_MAIN_VARIANT. */
11594 }
11596 /* Check for missing format attributes on function pointers. LTYPE is
11597 the new type or left-hand side type. RTYPE is the old type or
11598 right-hand side type. Returns TRUE if LTYPE is missing the desired
11599 attribute. */
11601 bool
11603 {
11605 tree ra;
11611 {
11612 tree la;
11617 }
11618 else
11620 }
11622 /* Subscripting with type char is likely to lose on a machine where
11623 chars are signed. So warn on any machine, but optionally. Don't
11624 warn for unsigned char since that type is safe. Don't warn for
11625 signed char because anyone who uses that must have done so
11626 deliberately. Furthermore, we reduce the false positive load by
11627 warning only for non-constant value of type char. */
11629 void
11631 {
11636 }
11638 /* Implement -Wparentheses for the unexpected C precedence rules, to
11639 cover cases like x + y << z which readers are likely to
11640 misinterpret. We have seen an expression in which CODE is a binary
11641 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11642 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11643 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11644 expression was not formed using a binary or unary operator, or it
11645 was enclosed in parentheses. */
11647 void
11651 {
11655 /* This macro tests that the expression ARG with original tree code
11656 CODE appears to be a boolean expression. or the result of folding a
11657 boolean expression. */
11658 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11659 (truth_value_p (TREE_CODE (ARG)) \
11660 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11662 || ((CODE) != INTEGER_CST \
11663 && (integer_onep (ARG) || integer_zerop (ARG))))
11666 {
11715 /* Check cases like x|y==z */
11722 /* Check cases like !x | y */
11726 "suggest parentheses around operand of "
11739 /* Check cases like x^y==z */
11761 /* Check cases like x&y==z */
11768 /* Check cases like !x & y */
11772 "suggest parentheses around operand of "
11795 {
11800 "comparisons like %<X<=Y<=Z%> do not "
11806 "comparisons like %<X<=Y<=Z%> do not "
11808 }
11810 }
11811 #undef NOT_A_BOOLEAN_EXPR_P
11812 }
11814 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11816 void
11818 {
11820 {
11823 else
11825 }
11826 }
11828 /* Warn for division by zero according to the value of DIVISOR. LOC
11829 is the location of the division operator. */
11831 void
11833 {
11834 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11835 about division by zero. Do not issue a warning if DIVISOR has a
11836 floating-point type, since we consider 0.0/0.0 a valid way of
11837 generating a NaN. */
11841 }
11843 /* Subroutine of build_binary_op. Give warnings for comparisons
11844 between signed and unsigned quantities that may fail. Do the
11845 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11846 so that casts will be considered, but default promotions won't
11847 be.
11849 LOCATION is the location of the comparison operator.
11851 The arguments of this function map directly to local variables
11852 of build_binary_op. */
11854 void
11859 {
11864 /* In C++, check for comparison of different enum types. */
11870 {
11874 }
11876 /* Do not warn if the comparison is being done in a signed type,
11877 since the signed type will only be chosen if it can represent
11878 all the values of the unsigned type. */
11881 /* Do not warn if both operands are unsigned. */
11884 else
11885 {
11891 else
11899 /* Do not warn if the signed quantity is an unsuffixed integer
11900 literal (or some static constant expression involving such
11901 literals or a conditional expression involving such literals)
11902 and it is non-negative. */
11905 /* Do not warn if the comparison is an equality operation, the
11906 unsigned quantity is an integral constant, and it would fit
11907 in the result if the result were signed. */
11912 /* In C, do not warn if the unsigned quantity is an enumeration
11913 constant and its maximum value would fit in the result if the
11914 result were signed. */
11920 else
11922 OPT_Wsign_compare,
11924 }
11926 /* Warn if two unsigned values are being compared in a size larger
11927 than their original size, and one (and only one) is the result of
11928 a `~' operator. This comparison will always fail.
11930 Also warn if one operand is a constant, and the constant does not
11931 have all bits set that are set in the ~ operand when it is
11932 extended. */
11939 {
11946 {
11947 tree primop;
11953 {
11957 }
11958 else
11959 {
11963 }
11968 {
11971 {
11975 else
11978 }
11979 }
11980 }
11988 }
11989 }
11991 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11992 type via c_common_type. If -Wdouble-promotion is in use, and the
11993 conditions for warning have been met, issue a warning. GMSGID is
11994 the warning message. It must have two %T specifiers for the type
11995 that was converted (generally "float") and the type to which it was
11996 converted (generally "double), respectively. LOC is the location
11997 to which the awrning should refer. */
11999 void
12002 {
12003 tree source_type;
12007 /* If the conversion will not occur at run-time, there is no need to
12008 warn about it. */
12020 else
12023 }
12025 /* Setup a TYPE_DECL node as a typedef representation.
12027 X is a TYPE_DECL for a typedef statement. Create a brand new
12028 ..._TYPE node (which will be just a variant of the existing
12029 ..._TYPE node with identical properties) and then install X
12030 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12032 The whole point here is to end up with a situation where each
12033 and every ..._TYPE node the compiler creates will be uniquely
12034 associated with AT MOST one node representing a typedef name.
12035 This way, even though the compiler substitutes corresponding
12036 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12037 early on, later parts of the compiler can always do the reverse
12038 translation and get back the corresponding typedef name. For
12039 example, given:
12041 typedef struct S MY_TYPE;
12042 MY_TYPE object;
12044 Later parts of the compiler might only know that `object' was of
12045 type `struct S' if it were not for code just below. With this
12046 code however, later parts of the compiler see something like:
12048 struct S' == struct S
12049 typedef struct S' MY_TYPE;
12050 struct S' object;
12052 And they can then deduce (from the node for type struct S') that
12053 the original object declaration was:
12055 MY_TYPE object;
12057 Being able to do this is important for proper support of protoize,
12058 and also for generating precise symbolic debugging information
12059 which takes full account of the programmer's (typedef) vocabulary.
12061 Obviously, we don't want to generate a duplicate ..._TYPE node if
12062 the TYPE_DECL node that we are now processing really represents a
12063 standard built-in type. */
12065 void
12067 {
12071 {
12074 }
12077 {
12085 }
12086 }
12088 /* Record the types used by the current global variable declaration
12089 being parsed, so that we can decide later to emit their debug info.
12090 Those types are in types_used_by_cur_var_decl, and we are going to
12091 store them in the types_used_by_vars_hash hash table.
12092 DECL is the declaration of the global variable that has been parsed. */
12094 void
12096 {
12100 {
12103 }
12104 }
12106 /* If DECL is a typedef that is declared in the current function,
12107 record it for the purpose of -Wunused-local-typedefs. */
12109 void
12111 {
12116 /* if this is not a locally defined typedef then we are not
12117 interested. */
12124 }
12126 /* If T is a TYPE_DECL declared locally, mark it as used. */
12128 void
12130 {
12135 }
12137 /* Warn if there are some unused locally defined typedefs in the
12138 current function. */
12140 void
12142 {
12144 tree decl;
12145 /* The number of times we have emitted -Wunused-local-typedefs
12146 warnings. If this is different from errorcount, that means some
12147 unrelated errors have been issued. In which case, we'll avoid
12148 emitting "unused-local-typedefs" warnings. */
12160 {
12164 OPT_Wunused_local_typedefs,
12167 }
12170 }
12172 /* Warn about boolean expression compared with an integer value different
12173 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12174 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12175 are the operands of the comparison. The caller must ensure that
12176 either operand is a boolean expression. */
12178 void
12180 tree op1)
12181 {
12191 {
12199 else
12202 }
12204 {
12205 /* If the non-constant operand isn't of a boolean type, we
12206 don't want to warn here. */
12208 /* Handle booleans promoted to integers. */
12216 /* Do some magic to get the right diagnostics. */
12225 }
12226 }
12228 /* The C and C++ parsers both use vectors to hold function arguments.
12229 For efficiency, we keep a cache of unused vectors. This is the
12230 cache. */
12235 /* Return a new vector from the cache. If the cache is empty,
12236 allocate a new vector. These vectors are GC'ed, so it is OK if the
12237 pointer is not released.. */
12241 {
12244 else
12245 {
12246 /* Passing 0 to vec::alloc returns NULL, and our callers require
12247 that we always return a non-NULL value. The vector code uses
12248 4 when growing a NULL vector, so we do too. */
12252 }
12253 }
12255 /* Release a vector of trees back to the cache. */
12257 void
12259 {
12261 {
12264 }
12265 }
12267 /* Get a new tree vector holding a single tree. */
12271 {
12275 }
12277 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12281 {
12286 }
12288 /* Get a new tree vector which is a copy of an existing one. */
12292 {
12295 tree t;
12302 }
12304 /* Return true if KEYWORD starts a type specifier. */
12306 bool
12308 {
12310 {
12344 }
12345 }
12347 /* Return true if KEYWORD names a type qualifier. */
12349 bool
12351 {
12353 {
12361 }
12362 }
12364 /* Return true if KEYWORD names a storage class specifier.
12366 RID_TYPEDEF is not included in this list despite `typedef' being
12367 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12368 such for syntactic convenience only. */
12370 bool
12372 {
12374 {
12384 }
12385 }
12387 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12389 static bool
12391 {
12393 {
12401 }
12402 }
12404 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12405 declaration-specifier (C99 6.7). */
12407 bool
12409 {
12416 {
12423 }
12424 }
12426 /* Initialize language-specific-bits of tree_contains_struct. */
12428 void
12430 {
12434 }
12436 /* Build a user-defined numeric literal out of an integer constant type VALUE
12437 with identifier SUFFIX. */
12439 tree
12442 {
12449 }
12451 /* For vector[index], convert the vector to a
12452 pointer of the underlying type. Return true if the resulting
12453 ARRAY_REF should not be an lvalue. */
12455 bool
12458 {
12461 {
12463 tree type1;
12472 {
12477 {
12480 *vecp
12483 non_const);
12484 }
12485 else
12490 }
12491 else
12498 {
12499 /* If the original vector isn't declared may_alias and it
12500 isn't a bare vector look if the subscripting would
12501 alias the vector we subscript, and if not, force ref-all. */
12507 }
12511 }
12513 }
12515 /* Determine which of the operands, if any, is a scalar that needs to be
12516 converted to a vector, for the range of operations. */
12517 enum stv_conv
12520 {
12529 {
12530 /* Most GENERIC binary expressions require homogeneous arguments.
12531 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12532 argument that is a vector and a second one that is a scalar, so
12533 we never return stv_secondarg for them. */
12538 {
12540 {
12545 }
12546 else
12548 }
12555 /* ... fall through ... */
12576 /* What about UNLT_EXPR? */
12578 {
12579 tree tmp;
12581 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12584 }
12588 {
12590 {
12595 }
12597 }
12599 /* Allow integer --> real conversion if safe. */
12603 {
12605 {
12610 }
12612 }
12615 }
12618 }
12620 /* Return true iff ALIGN is an integral constant that is a fundamental
12621 alignment, as defined by [basic.align] in the c++-11
12622 specifications.
12624 That is:
12626 [A fundamental alignment is represented by an alignment less than or
12627 equal to the greatest alignment supported by the implementation
12628 in all contexts, which is equal to
12629 alignof(max_align_t)]. */
12631 bool
12633 {
12636 }
12638 /* Return true if T is a pointer to a zero-sized aggregate. */
12640 bool
12642 {
12647 }