| blob | 0f547c683cc7fb6409f9608ccc267203f50142be |
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. */
415 /* Reserved words. The third field is a mask: keywords are disabled
416 if they match the mask.
418 Masks for languages:
419 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
420 C --std=c99: D_CXXONLY | D_OBJC
421 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
422 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
423 C++ --std=c0x: D_CONLY | D_OBJC
424 ObjC++ is like C++ except that D_OBJC is not set
426 If -fno-asm is used, D_ASM is added to the mask. If
427 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
428 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
429 In C with -Wc++-compat, we warn if D_CXXWARN is set.
431 Note the complication of the D_CXX_OBJC keywords. These are
432 reserved words such as 'class'. In C++, 'class' is a reserved
433 word. In Objective-C++ it is too. In Objective-C, it is a
434 reserved word too, but only if it follows an '@' sign.
435 */
437 {
602 /* These Objective-C keywords are recognized only immediately after
603 an '@'. */
620 /* These are recognized only in protocol-qualifier context
621 (see above) */
628 /* These are recognized inside a property attribute list */
637 };
642 /* Table of machine-independent attributes common to all C-like languages.
644 All attributes referencing arguments should be additionally processed
645 in chkp_copy_function_type_adding_bounds for correct instrumentation
646 by Pointer Bounds Checker.
647 Current list of processed common attributes: nonnull. */
649 {
650 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
651 affects_type_identity } */
658 /* FIXME: logically, noreturn attributes should be listed as
659 "false, true, true" and apply to function types. But implementing this
660 would require all the places in the compiler that use TREE_THIS_VOLATILE
661 on a decl to identify non-returning functions to be located and fixed
662 to check the function type instead. */
699 /* The same comments as for noreturn attributes apply to const ones. */
723 handle_no_instrument_function_attribute,
741 /* ??? These two attributes didn't make the transition from the
742 Intel language document to the multi-vendor language document. */
747 /* For internal use (marking of builtins) only. The name contains space
748 to prevent its usage in source code. */
770 /* For internal use (marking of builtins) only. The name contains space
771 to prevent its usage in source code. */
782 handle_no_address_safety_analysis_attribute,
785 handle_no_sanitize_address_attribute,
788 handle_no_sanitize_address_attribute,
791 handle_no_sanitize_undefined_attribute,
801 /* For internal use only. The leading '*' both prevents its usage in
802 source code and signals that it may be overridden by machine tables. */
807 /* For internal use (marking of builtins and runtime functions) only.
808 The name contains space to prevent its usage in source code. */
834 };
836 /* Give the specifications for the format attributes, used by C and all
837 descendants.
839 All attributes referencing arguments should be additionally processed
840 in chkp_copy_function_type_adding_bounds for correct instrumentation
841 by Pointer Bounds Checker.
842 Current list of processed format attributes: format, format_arg. */
844 {
845 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
846 affects_type_identity } */
852 };
854 /* Return identifier for address space AS. */
858 {
862 }
864 /* Push current bindings for the function name VAR_DECLS. */
866 void
868 {
873 {
877 {
879 saved);
881 }
882 }
884 /* Normally they'll have been NULL, so only push if we've got a
885 stack, or they are non-NULL. */
887 saved_function_name_decls);
888 }
890 /* Finish up the current bindings, adding them into the current function's
891 statement tree. This must be done _before_ finish_stmt_tree is called.
892 If there is no current function, we must be at file scope and no statements
893 are involved. Pop the previous bindings. */
895 void
897 {
906 {
914 }
920 {
921 /* We had saved values, restore them. */
922 tree saved;
925 {
930 }
932 }
934 }
936 /* Return the text name of the current function, suitably prettified
937 by PRETTY_P. Return string must be freed by caller. */
941 {
948 {
951 }
964 {
967 }
970 }
972 /* Return the VAR_DECL for a const char array naming the current
973 function. If the VAR_DECL has not yet been created, create it
974 now. RID indicates how it should be formatted and IDENTIFIER_NODE
975 ID is its name (unfortunately C and C++ hold the RID values of
976 keywords in different places, so we can't derive RID from ID in
977 this language independent code. LOC is the location of the
978 function. */
980 tree
982 {
992 {
993 /* If a tree is built here, it would normally have the lineno of
994 the current statement. Later this tree will be moved to the
995 beginning of the function and this line number will be wrong.
996 To avoid this problem set the lineno to 0 here; that prevents
997 it from appearing in the RTL. */
998 tree stmts;
1006 saved_function_name_decls
1010 }
1015 }
1017 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1019 tree
1021 {
1026 /* Compute the number of elements, for the array type. */
1028 {
1031 }
1033 {
1036 }
1038 {
1041 }
1042 else
1043 {
1046 }
1048 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1049 limit in C++98 Annex B is very large (65536) and is not normative,
1050 so we do not diagnose it (warn_overlength_strings is forced off
1051 in c_common_post_options). */
1053 {
1057 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1058 separate the %d from the 'C'. 'ISO' should not be
1059 translated, but it may be moved after 'C%d' in languages
1060 where modifiers follow nouns. */
1062 "string length %qd is greater than the length %qd "
1065 }
1067 /* Create the array type for the string constant. The ISO C++
1068 standard says that a string literal has type `const char[N]' or
1069 `const wchar_t[N]'. We use the same logic when invoked as a C
1070 front-end with -Wwrite-strings.
1071 ??? We should change the type of an expression depending on the
1072 state of a warning flag. We should just be warning -- see how
1073 this is handled in the C++ front-end for the deprecated implicit
1074 conversion from string literals to `char*' or `wchar_t*'.
1076 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1077 array type being the unqualified version of that type.
1078 Therefore, if we are constructing an array of const char, we must
1079 construct the matching unqualified array type first. The C front
1080 end does not require this, but it does no harm, so we do it
1081 unconditionally. */
1092 }
1093 \f
1094 /* If DISABLE is true, stop issuing warnings. This is used when
1095 parsing code that we know will not be executed. This function may
1096 be called multiple times, and works as a stack. */
1098 static void
1100 {
1102 {
1105 }
1106 }
1108 /* If ENABLE is true, reenable issuing warnings. */
1110 static void
1112 {
1114 {
1117 }
1118 }
1120 /* Fully fold EXPR, an expression that was not folded (beyond integer
1121 constant expressions and null pointer constants) when being built
1122 up. If IN_INIT, this is in a static initializer and certain
1123 changes are made to the folding done. Clear *MAYBE_CONST if
1124 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1125 expression because it contains an evaluated operator (in C99) or an
1126 operator outside of sizeof returning an integer constant (in C90)
1127 not permitted in constant expressions, or because it contains an
1128 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1129 set to true by callers before calling this function.) Return the
1130 folded expression. Function arguments have already been folded
1131 before calling this function, as have the contents of SAVE_EXPR,
1132 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1133 C_MAYBE_CONST_EXPR. */
1135 tree
1137 {
1138 tree ret;
1144 /* This function is not relevant to C++ because C++ folds while
1145 parsing, and may need changes to be correct for C++ when C++
1146 stops folding while parsing. */
1153 {
1156 }
1163 }
1165 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1166 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1167 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1168 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1169 both evaluated and unevaluated subexpressions while
1170 *MAYBE_CONST_ITSELF is carried from only evaluated
1171 subexpressions). */
1173 static tree
1176 {
1188 /* This function is not relevant to C++ because C++ folds while
1189 parsing, and may need changes to be correct for C++ when C++
1190 stops folding while parsing. */
1194 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1195 anything else not counted as an expression cannot usefully be
1196 folded further at this point. */
1202 /* Operands of variable-length expressions (function calls) have
1203 already been folded, as have __builtin_* function calls, and such
1204 expressions cannot occur in constant expressions. */
1206 {
1210 }
1213 {
1222 else
1225 }
1227 /* Assignment, increment, decrement, function call and comma
1228 operators, and statement expressions, cannot occur in constant
1229 expressions if evaluated / outside of sizeof. (Function calls
1230 were handled above, though VA_ARG_EXPR is treated like a function
1231 call here, and statement expressions are handled through
1232 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1234 {
1254 }
1256 /* Fold individual tree codes as appropriate. */
1258 {
1260 /* Any non-constancy will have been marked in a containing
1261 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1269 maybe_const_itself);
1274 {
1277 }
1286 maybe_const_itself);
1289 maybe_const_itself);
1295 {
1299 }
1341 /* Binary operations evaluating both arguments (increment and
1342 decrement are binary internally in GCC). */
1346 maybe_const_itself);
1354 /* The RHS of a MODIFY_EXPR was fully folded when building that
1355 expression for the sake of conversion warnings. */
1358 maybe_const_itself);
1362 ret = in_init
1365 else
1386 {
1399 }
1416 CASE_CONVERT:
1427 /* Unary operations. */
1430 maybe_const_itself);
1434 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1435 not prepared to deal with them if they occur in initializers. */
1443 ret = in_init
1446 else
1451 {
1455 }
1457 {
1460 CASE_CONVERT:
1461 /* Don't warn about explicit conversions. We will already
1462 have warned about suspect implicit conversions. */
1469 }
1474 /* Binary operations not necessarily evaluating both
1475 arguments. */
1482 ? truthvalue_false_node
1490 ret = in_init
1493 else
1498 && op0_const
1499 && op0_const_self
1505 && op0_const_self
1531 else
1536 && op0_const
1537 && op0_const_self
1541 && op0_const_self
1545 && op0_const
1546 && op0_const_self
1550 && op0_const_self
1556 /* Each case where an operand with excess precision may be
1557 encountered must remove the EXCESS_PRECISION_EXPR around
1558 inner operands and possibly put one around the whole
1559 expression or possibly convert to the semantic type (which
1560 c_fully_fold does); we cannot tell at this stage which is
1561 appropriate in any particular case. */
1565 /* Various codes may appear through folding built-in functions
1566 and their arguments. */
1568 }
1570 out:
1571 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1572 have been done by this point, so remove them again. */
1576 {
1580 }
1584 }
1586 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1587 return EXP. Otherwise, return either EXP or its known constant
1588 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1589 Is the BLKmode test appropriate? */
1591 tree
1593 {
1594 tree ret;
1596 /* This function is only used by C, for c_fully_fold and other
1597 optimization, and may not be correct for C++. */
1608 /* Avoid unwanted tree sharing between the initializer and current
1609 function's body where the tree can be modified e.g. by the
1610 gimplifier. */
1614 }
1616 /* Print a warning if a constant expression had overflow in folding.
1617 Invoke this function on every expression that the language
1618 requires to be a constant expression.
1619 Note the ANSI C standard says it is erroneous for a
1620 constant expression to overflow. */
1622 void
1624 {
1632 }
1634 /* The same as above but print an unconditional error. */
1635 void
1637 {
1644 }
1646 /* Print a warning if an expression had overflow in folding and its
1647 operands hadn't.
1649 Invoke this function on every expression that
1650 (1) appears in the source code, and
1651 (2) is a constant expression that overflowed, and
1652 (3) is not already checked by convert_and_check;
1653 however, do not invoke this function on operands of explicit casts
1654 or when the expression is the result of an operator and any operand
1655 already overflowed. */
1657 void
1659 {
1664 {
1693 }
1694 }
1696 /* Warn about uses of logical || / && operator in a context where it
1697 is likely that the bitwise equivalent was intended by the
1698 programmer. We have seen an expression in which CODE is a binary
1699 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1700 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1701 void
1705 {
1717 /* We don't want to warn if either operand comes from a macro
1718 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1719 see PR61534. */
1724 /* Warn if &&/|| are being used in a context where it is
1725 likely that the bitwise equivalent was intended by the
1726 programmer. That is, an expression such as op && MASK
1727 where op should not be any boolean expression, nor a
1728 constant, and mask seems to be a non-boolean integer constant. */
1736 {
1740 else
1745 }
1747 /* We do not warn for constants because they are typical of macro
1748 expansions that test for features. */
1752 /* This warning only makes sense with logical operands. */
1759 /* The range computations only work with scalars. */
1764 /* We first test whether either side separately is trivially true
1765 (with OR) or trivially false (with AND). If so, do not warn.
1766 This is a common idiom for testing ranges of data types in
1767 portable code. */
1774 /* If this is an OR operation, invert both sides; now, the result
1775 should be always false to get a warning. */
1789 /* If this is an OR operation, invert both sides; now, the result
1790 should be always false to get a warning. */
1798 /* If both expressions have the same operand, if we can merge the
1799 ranges, ... */
1803 {
1805 /* ... and if the range test is always false, then warn. */
1807 {
1810 "logical %<or%> of collectively exhaustive tests is "
1812 else
1814 "logical %<and%> of mutually exclusive tests is "
1816 }
1817 /* Or warn if the operands have exactly the same range, e.g.
1818 A > 0 && A > 0. */
1820 {
1824 else
1827 }
1828 }
1829 }
1831 /* Warn about logical not used on the left hand side operand of a comparison.
1832 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1833 Do not warn if RHS is of a boolean type. */
1835 void
1837 tree rhs)
1838 {
1844 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1845 !(x == 0) or !(y != 0). */
1851 "logical not is only applied to the left hand side of "
1853 }
1855 /* Warn if EXP contains any computations whose results are not used.
1856 Return true if a warning is printed; false otherwise. LOCUS is the
1857 (potential) location of the expression. */
1859 bool
1861 {
1862 restart:
1866 /* Don't warn about void constructs. This includes casting to void,
1867 void function calls, and statement expressions with a final cast
1868 to void. */
1876 {
1892 /* For a binding, warn if no side effect within it. */
1904 /* In && or ||, warn if 2nd operand has no side effect. */
1911 /* Let people do `(foo (), 0)' without a warning. */
1918 /* If this is an expression with side effects, don't warn; this
1919 case commonly appears in macro expansions. */
1925 /* Don't warn about automatic dereferencing of references, since
1926 the user cannot control it. */
1928 {
1931 }
1932 /* Fall through. */
1935 /* Referencing a volatile value is a side effect, so don't warn. */
1940 /* If this is an expression which has no operands, there is no value
1941 to be unused. There are no such language-independent codes,
1942 but front ends may define such. */
1946 warn:
1948 }
1949 }
1952 /* Print a warning about casts that might indicate violation
1953 of strict aliasing rules if -Wstrict-aliasing is used and
1954 strict aliasing mode is in effect. OTYPE is the original
1955 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1957 bool
1959 {
1960 /* Strip pointer conversion chains and get to the correct original type. */
1968 /* If the type we are casting to is a ref-all pointer
1969 dereferencing it is always valid. */
1976 {
1977 /* Casting the address of an object to non void pointer. Warn
1978 if the cast breaks type based aliasing. */
1980 {
1984 }
1985 else
1986 {
1987 /* warn_strict_aliasing >= 3. This includes the default (3).
1988 Only warn if the cast is dereferenced immediately. */
1989 alias_set_type set1 =
1995 {
1999 }
2002 {
2006 }
2007 }
2008 }
2009 else
2011 {
2012 /* At this level, warn for any conversions, even if an address is
2013 not taken in the same statement. This will likely produce many
2014 false positives, but could be useful to pinpoint problems that
2015 are not revealed at higher levels. */
2020 {
2024 }
2025 }
2028 }
2030 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2031 sizeof as last operand of certain builtins. */
2033 void
2037 {
2041 location_t loc;
2049 {
2053 /* FALLTHRU */
2061 /* FALLTHRU */
2120 }
2148 {
2152 {
2155 "argument to %<sizeof%> in %qD call is the same "
2156 "expression as the destination; did you mean to "
2162 "argument to %<sizeof%> in %qD call is the same "
2163 "expression as the destination; did you mean to "
2165 else
2167 "argument to %<sizeof%> in %qD call is the same "
2168 "expression as the destination; did you mean to "
2171 }
2174 && !strop
2177 {
2179 "argument to %<sizeof%> in %qD call is the same "
2180 "pointer type %qT as the destination; expected %qT "
2184 }
2185 }
2188 {
2192 {
2195 "argument to %<sizeof%> in %qD call is the same "
2196 "expression as the source; did you mean to "
2202 "argument to %<sizeof%> in %qD call is the same "
2203 "expression as the source; did you mean to "
2205 else
2207 "argument to %<sizeof%> in %qD call is the same "
2208 "expression as the source; did you mean to "
2211 }
2214 && !strop
2217 {
2219 "argument to %<sizeof%> in %qD call is the same "
2220 "pointer type %qT as the source; expected %qT "
2224 }
2225 }
2228 {
2232 {
2235 "argument to %<sizeof%> in %qD call is the same "
2236 "expression as the first source; did you mean to "
2242 "argument to %<sizeof%> in %qD call is the same "
2243 "expression as the first source; did you mean to "
2245 else
2247 "argument to %<sizeof%> in %qD call is the same "
2248 "expression as the first source; did you mean to "
2251 }
2254 && !strop
2257 {
2259 "argument to %<sizeof%> in %qD call is the same "
2260 "pointer type %qT as the first source; expected %qT "
2264 }
2265 }
2268 {
2272 {
2275 "argument to %<sizeof%> in %qD call is the same "
2276 "expression as the second source; did you mean to "
2282 "argument to %<sizeof%> in %qD call is the same "
2283 "expression as the second source; did you mean to "
2285 else
2287 "argument to %<sizeof%> in %qD call is the same "
2288 "expression as the second source; did you mean to "
2291 }
2294 && !strop
2297 {
2299 "argument to %<sizeof%> in %qD call is the same "
2300 "pointer type %qT as the second source; expected %qT "
2304 }
2305 }
2307 }
2309 /* Warn for unlikely, improbable, or stupid DECL declarations
2310 of `main'. */
2312 void
2314 {
2315 function_args_iterator iter;
2316 tree type;
2320 {
2321 /* XXX void_type_node belies the abstraction. */
2331 {
2337 }
2341 {
2363 "third argument of %q+D should probably be "
2366 }
2367 }
2369 /* It is intentional that this message does not mention the third
2370 argument because it's only mentioned in an appendix of the
2371 standard. */
2379 }
2381 /* vector_targets_convertible_p is used for vector pointer types. The
2382 callers perform various checks that the qualifiers are satisfactory,
2383 while OTOH vector_targets_convertible_p ignores the number of elements
2384 in the vectors. That's fine with vector pointers as we can consider,
2385 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2386 and that does not require and conversion of the pointer values.
2387 In contrast, vector_types_convertible_p and
2388 vector_types_compatible_elements_p are used for vector value types. */
2389 /* True if pointers to distinct types T1 and T2 can be converted to
2390 each other without an explicit cast. Only returns true for opaque
2391 vector types. */
2392 bool
2394 {
2401 }
2403 /* vector_types_convertible_p is used for vector value types.
2404 It could in principle call vector_targets_convertible_p as a subroutine,
2405 but then the check for vector type would be duplicated with its callers,
2406 and also the purpose of vector_targets_convertible_p would become
2407 muddled.
2408 Where vector_types_convertible_p returns true, a conversion might still be
2409 needed to make the types match.
2410 In contrast, vector_targets_convertible_p is used for vector pointer
2411 values, and vector_types_compatible_elements_p is used specifically
2412 in the context for binary operators, as a check if use is possible without
2413 conversion. */
2414 /* True if vector types T1 and T2 can be converted to each other
2415 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2416 can only be converted with -flax-vector-conversions yet that is not
2417 in effect, emit a note telling the user about that option if such
2418 a note has not previously been emitted. */
2419 bool
2421 {
2429 convertible_lax =
2444 {
2447 "conversions between vectors with differing "
2449 }
2452 }
2454 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2455 and have vector types, V0 has the same type as V1, and the number of
2456 elements of V0, V1, MASK is the same.
2458 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2459 called with two arguments. In this case implementation passes the
2460 first argument twice in order to share the same tree code. This fact
2461 could enable the mask-values being twice the vector length. This is
2462 an implementation accident and this semantics is not guaranteed to
2463 the user. */
2464 tree
2467 {
2468 tree ret;
2474 {
2477 }
2485 {
2490 }
2494 {
2498 }
2501 {
2506 }
2512 {
2515 "argument vector(s) and the mask vector should "
2518 }
2522 {
2527 }
2530 {
2531 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2537 else
2538 {
2541 }
2545 }
2555 }
2557 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2558 to integral type. */
2560 static tree
2562 {
2567 {
2568 /* C++0x scoped enumerations don't implicitly convert to integral
2569 type; if we stripped an explicit conversion to a larger type we
2570 need to replace it so common_type will still work. */
2574 }
2576 }
2578 /* This is a helper function of build_binary_op.
2580 For certain operations if both args were extended from the same
2581 smaller type, do the arithmetic in that type and then extend.
2583 BITWISE indicates a bitwise operation.
2584 For them, this optimization is safe only if
2585 both args are zero-extended or both are sign-extended.
2586 Otherwise, we might change the result.
2587 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2588 but calculated in (unsigned short) it would be (unsigned short)-1.
2589 */
2590 tree
2592 {
2596 tree type;
2598 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2599 excessive narrowing when we call get_narrower below. For
2600 example, suppose that OP0 is of unsigned int extended
2601 from signed char and that RESULT_TYPE is long long int.
2602 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2603 like
2605 (long long int) (unsigned int) signed_char
2607 which get_narrower would narrow down to
2609 (unsigned int) signed char
2611 If we do not cast OP0 first, get_narrower would return
2612 signed_char, which is inconsistent with the case of the
2613 explicit cast. */
2620 /* UNS is 1 if the operation to be done is an unsigned one. */
2623 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2624 but it *requires* conversion to FINAL_TYPE. */
2635 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2637 /* For bitwise operations, signedness of nominal type
2638 does not matter. Consider only how operands were extended. */
2642 /* Note that in all three cases below we refrain from optimizing
2643 an unsigned operation on sign-extended args.
2644 That would not be valid. */
2646 /* Both args variable: if both extended in same way
2647 from same width, do it in that width.
2648 Do it unsigned if args were zero-extended. */
2655 return c_common_signed_or_unsigned_type
2662 && (type
2673 && (type
2681 }
2683 /* Checks if expression EXPR of real/integer type cannot be converted
2684 to the real/integer type TYPE. Function returns non-zero when:
2685 * EXPR is a constant which cannot be exactly converted to TYPE.
2686 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2687 for EXPR type and TYPE being both integers or both real.
2688 * EXPR is not a constant of real type and TYPE is an integer.
2689 * EXPR is not a constant of integer type which cannot be
2690 exactly converted to real type.
2691 Function allows conversions between types of different signedness and
2692 can return SAFE_CONVERSION (zero) in that case. Function can produce
2693 signedness warnings if PRODUCE_WARNS is true. */
2695 enum conversion_safety
2697 {
2703 {
2704 /* Warn for real constant that is not an exact integer converted
2705 to integer type. */
2708 {
2711 }
2712 /* Warn for an integer constant that does not fit into integer type. */
2716 {
2719 {
2723 }
2725 {
2729 }
2730 else
2732 }
2734 {
2735 /* Warn for an integer constant that does not fit into real type. */
2737 {
2741 }
2742 /* Warn for a real constant that does not fit into a smaller
2743 real type. */
2746 {
2750 }
2751 }
2752 }
2753 else
2754 {
2755 /* Warn for real types converted to integer types. */
2762 {
2763 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2767 /* Don't warn for short y; short x = ((int)y & 0xff); */
2771 {
2772 /* If both args were extended from a shortest type,
2773 use that type if that is safe. */
2780 {
2786 /* If one of the operands is a non-negative constant
2787 that fits in the target type, then the type of the
2788 other operand does not matter. */
2797 /* If constant is unsigned and fits in the target
2798 type, then the result will also fit. */
2800 && unsigned0
2803 && unsigned1
2806 }
2807 }
2808 /* Warn for integer types converted to smaller integer types. */
2812 /* When they are the same width but different signedness,
2813 then the value may change. */
2816 /* Even when converted to a bigger type, if the type is
2817 unsigned but expr is signed, then negative values
2818 will be changed. */
2824 }
2826 /* Warn for integer types converted to real types if and only if
2827 all the range of values of the integer type cannot be
2828 represented by the real type. */
2831 {
2835 /* Don't warn about char y = 0xff; float x = (int) y; */
2847 }
2849 /* Warn for real types converted to smaller real types. */
2854 }
2857 }
2859 /* Warns if the conversion of EXPR to TYPE may alter a value.
2860 This is a helper function for warnings_for_convert_and_check. */
2862 static void
2864 {
2871 /* This may happen, because for LHS op= RHS we preevaluate
2872 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2873 means we could no longer see the code of the EXPR. */
2880 {
2893 /* Conversion from boolean to a signed:1 bit-field (which only
2894 can hold the values 0 and -1) doesn't lose information - but
2895 it does change the value. */
2915 {
2916 /* In case of COND_EXPR, we do not care about the type of
2917 COND_EXPR, only about the conversion of each operand. */
2924 }
2936 }
2937 }
2939 /* Produce warnings after a conversion. RESULT is the result of
2940 converting EXPR to TYPE. This is a helper function for
2941 convert_and_check and cp_convert_and_check. */
2943 void
2945 tree result)
2946 {
2953 {
2954 /* Do not diagnose overflow in a constant expression merely
2955 because a conversion overflowed. */
2960 {
2961 /* This detects cases like converting -129 or 256 to
2962 unsigned char. */
2966 else
2968 }
2972 /* No warning for converting 0x80000000 to int. */
2980 else
2982 }
2987 else
2989 }
2992 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2993 Invoke this function on every expression that is converted implicitly,
2994 i.e. because of language rules and not because of an explicit cast. */
2996 tree
2998 {
2999 tree result;
3000 tree expr_for_warning;
3002 /* Convert from a value with possible excess precision rather than
3003 via the semantic type, but do not warn about values not fitting
3004 exactly in the semantic type. */
3006 {
3012 }
3013 else
3027 }
3028 \f
3029 /* A node in a list that describes references to variables (EXPR), which are
3030 either read accesses if WRITER is zero, or write accesses, in which case
3031 WRITER is the parent of EXPR. */
3032 struct tlist
3033 {
3036 };
3038 /* Used to implement a cache the results of a call to verify_tree. We only
3039 use this for SAVE_EXPRs. */
3040 struct tlist_cache
3041 {
3045 tree expr;
3046 };
3048 /* Obstack to use when allocating tlist structures, and corresponding
3049 firstobj. */
3053 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3054 warnings. */
3056 /* SAVE_EXPRs need special treatment. We process them only once and then
3057 cache the results. */
3069 /* Create a new struct tlist and fill in its fields. */
3072 {
3079 }
3081 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3082 is nonnull, we ignore any node we find which has a writer equal to it. */
3084 static void
3086 {
3088 {
3095 }
3096 }
3098 /* Merge the nodes of ADD into TO. This merging process is done so that for
3099 each variable that already exists in TO, no new node is added; however if
3100 there is a write access recorded in ADD, and an occurrence on TO is only
3101 a read access, then the occurrence in TO will be modified to record the
3102 write. */
3104 static void
3106 {
3113 {
3120 {
3124 }
3126 {
3130 }
3132 }
3133 }
3135 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3136 references in list LIST conflict with it, excluding reads if ONLY writers
3137 is nonzero. */
3139 static void
3142 {
3145 /* Avoid duplicate warnings. */
3151 {
3155 {
3160 }
3162 }
3163 }
3165 /* Given a list LIST of references to variables, find whether any of these
3166 can cause conflicts due to missing sequence points. */
3168 static void
3170 {
3174 {
3177 }
3178 }
3180 /* Return nonzero if X is a tree that can be verified by the sequence point
3181 warnings. */
3182 static int
3184 {
3191 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3192 (lvalue_p) crash on TRY/CATCH. */
3199 /* No point to track non-const calls, they will never satisfy
3200 operand_equal_p. */
3208 }
3210 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3211 static bool
3213 {
3215 }
3217 /* Walk the tree X, and record accesses to variables. If X is written by the
3218 parent tree, WRITER is the parent.
3219 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3220 expression or its only operand forces a sequence point, then everything up
3221 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3222 in PNO_SP.
3223 Once we return, we will have emitted warnings if any subexpression before
3224 such a sequence point could be undefined. On a higher level, however, the
3225 sequence point may not be relevant, and we'll merge the two lists.
3227 Example: (b++, a) + b;
3228 The call that processes the COMPOUND_EXPR will store the increment of B
3229 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3230 processes the PLUS_EXPR will need to merge the two lists so that
3231 eventually, all accesses end up on the same list (and we'll warn about the
3232 unordered subexpressions b++ and b.
3234 A note on merging. If we modify the former example so that our expression
3235 becomes
3236 (b++, b) + a
3237 care must be taken not simply to add all three expressions into the final
3238 PNO_SP list. The function merge_tlist takes care of that by merging the
3239 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3240 way, so that no more than one access to B is recorded. */
3242 static void
3244 tree writer)
3245 {
3250 /* X may be NULL if it is the operand of an empty statement expression
3251 ({ }). */
3255 restart:
3263 {
3296 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3297 two first, to avoid warning for (a ? b++ : b++). */
3313 /* Expressions inside the LHS are not ordered wrt. the sequence points
3314 in the RHS. Example:
3315 *a = (a++, 2)
3316 Despite the fact that the modification of "a" is in the before_sp
3317 list (tmp_before), it conflicts with the use of "a" in the LHS.
3318 We can handle this by adding the contents of tmp_list3
3319 to those of tmp_before, and redoing the collision warnings for that
3320 list. */
3323 /* Exclude the LHS itself here; we first have to merge it into the
3324 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3325 didn't exclude the LHS, we'd get it twice, once as a read and once
3326 as a write. */
3337 /* We need to warn about conflicts among arguments and conflicts between
3338 args and the function address. Side effects of the function address,
3339 however, are not ordered by the sequence point of the call. */
3340 {
3341 call_expr_arg_iterator iter;
3342 tree arg;
3346 {
3351 }
3356 }
3359 /* Scan all the list, e.g. indices of multi dimensional array. */
3361 {
3367 }
3371 {
3378 {
3392 }
3396 }
3406 /* For other expressions, simply recurse on their operands.
3407 Manual tail recursion for unary expressions.
3408 Other non-expressions need not be processed. */
3410 {
3414 }
3416 {
3420 {
3425 }
3426 }
3428 }
3429 }
3431 /* Try to warn for undefined behavior in EXPR due to missing sequence
3432 points. */
3434 DEBUG_FUNCTION void
3436 {
3442 {
3445 }
3450 }
3451 \f
3452 /* Validate the expression after `case' and apply default promotions. */
3454 static tree
3456 {
3461 /* Promote char or short to int. */
3464 {
3467 }
3472 }
3473 \f
3474 /* See if the case values LOW and HIGH are in the range of the original
3475 type (i.e. before the default conversion to int) of the switch testing
3476 expression.
3477 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3478 the type before promoting it. CASE_LOW_P is a pointer to the lower
3479 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3480 if the case is not a case range.
3481 The caller has to make sure that we are not called with NULL for
3482 CASE_LOW_P (i.e. the default case).
3483 Returns true if the case label is in range of ORIG_TYPE (saturated or
3484 untouched) or false if the label is out of range. */
3486 static bool
3489 {
3494 /* If there was a problem with the original type, do nothing. */
3501 /* Case label is less than minimum for type. */
3504 {
3508 }
3510 /* Case value is greater than maximum for type. */
3513 {
3516 }
3518 /* Saturate lower case label value to minimum. */
3521 {
3525 }
3527 /* Saturate upper case label value to maximum. */
3530 {
3534 }
3542 }
3543 \f
3544 /* Return an integer type with BITS bits of precision,
3545 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3547 tree
3549 {
3591 }
3593 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3594 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3595 and saturating if SATP is nonzero, otherwise not saturating. */
3597 tree
3600 {
3601 machine_mode mode;
3604 else
3612 {
3614 "fixed-point types that have too many integral and "
3617 }
3620 }
3622 /* Used for communication between c_common_type_for_mode and
3623 c_register_builtin_type. */
3624 tree registered_builtin_types;
3626 /* Return a data type that has machine mode MODE.
3627 If the mode is an integer,
3628 then UNSIGNEDP selects between signed and unsigned types.
3629 If the mode is a fixed-point mode,
3630 then UNSIGNEDP selects between saturating and nonsaturating types. */
3632 tree
3634 {
3635 tree t;
3675 #if HOST_BITS_PER_WIDE_INT >= 64
3678 #endif
3703 {
3704 machine_mode inner_mode;
3705 tree inner_type;
3721 }
3723 {
3728 }
3738 {
3824 }
3832 }
3834 tree
3836 {
3838 }
3840 /* Return a signed type the same as TYPE in other respects. */
3842 tree
3844 {
3846 }
3848 /* Return a type the same as TYPE except unsigned or
3849 signed according to UNSIGNEDP. */
3851 tree
3853 {
3854 tree type1;
3857 /* This block of code emulates the behavior of the old
3858 c_common_unsigned_type. In particular, it returns
3859 long_unsigned_type_node if passed a long, even when a int would
3860 have the same size. This is necessary for warnings to work
3861 correctly in archs where sizeof(int) == sizeof(long) */
3864 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3884 #if HOST_BITS_PER_WIDE_INT >= 64
3887 #endif
3897 #define C_COMMON_FIXED_TYPES(NAME) \
3898 if (type1 == short_ ## NAME ## _type_node \
3899 || type1 == unsigned_short_ ## NAME ## _type_node) \
3900 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3901 : short_ ## NAME ## _type_node; \
3902 if (type1 == NAME ## _type_node \
3903 || type1 == unsigned_ ## NAME ## _type_node) \
3904 return unsignedp ? unsigned_ ## NAME ## _type_node \
3905 : NAME ## _type_node; \
3906 if (type1 == long_ ## NAME ## _type_node \
3907 || type1 == unsigned_long_ ## NAME ## _type_node) \
3908 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3909 : long_ ## NAME ## _type_node; \
3910 if (type1 == long_long_ ## NAME ## _type_node \
3911 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3912 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3913 : long_long_ ## NAME ## _type_node;
3915 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3916 if (type1 == NAME ## _type_node \
3917 || type1 == u ## NAME ## _type_node) \
3918 return unsignedp ? u ## NAME ## _type_node \
3919 : NAME ## _type_node;
3921 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3922 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3923 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3924 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3925 : sat_ ## short_ ## NAME ## _type_node; \
3926 if (type1 == sat_ ## NAME ## _type_node \
3927 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3928 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3929 : sat_ ## NAME ## _type_node; \
3930 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3931 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3932 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3933 : sat_ ## long_ ## NAME ## _type_node; \
3934 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3935 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3936 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3937 : sat_ ## long_long_ ## NAME ## _type_node;
3939 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3940 if (type1 == sat_ ## NAME ## _type_node \
3941 || type1 == sat_ ## u ## NAME ## _type_node) \
3942 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3943 : sat_ ## NAME ## _type_node;
3969 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3970 the precision; they have precision set to match their range, but
3971 may use a wider mode to match an ABI. If we change modes, we may
3972 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3973 the precision as well, so as to yield correct results for
3974 bit-field types. C++ does not have these separate bit-field
3975 types, and producing a signed or unsigned variant of an
3976 ENUMERAL_TYPE may cause other problems as well. */
3982 #define TYPE_OK(node) \
3983 (TYPE_MODE (type) == TYPE_MODE (node) \
3984 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4008 #if HOST_BITS_PER_WIDE_INT >= 64
4011 #endif
4020 #undef TYPE_OK
4023 }
4025 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4027 tree
4029 {
4032 /* Extended integer types of the same width as a standard type have
4033 lesser rank, so those of the same width as int promote to int or
4034 unsigned int and are valid for printf formats expecting int or
4035 unsigned int. To avoid such special cases, avoid creating
4036 extended integer types for bit-fields if a standard integer type
4037 is available. */
4055 }
4057 /* The C version of the register_builtin_type langhook. */
4059 void
4061 {
4062 tree decl;
4072 }
4073 \f
4074 /* Print an error message for invalid operands to arith operation
4075 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4076 LOCATION is the location of the message. */
4078 void
4081 {
4085 {
4130 }
4134 }
4135 \f
4136 /* Given an expression as a tree, return its original type. Do this
4137 by stripping any conversion that preserves the sign and precision. */
4138 static tree
4140 {
4143 }
4145 /* Subroutine of build_binary_op, used for comparison operations.
4146 See if the operands have both been converted from subword integer types
4147 and, if so, perhaps change them both back to their original type.
4148 This function is also responsible for converting the two operands
4149 to the proper common type for comparison.
4151 The arguments of this function are all pointers to local variables
4152 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4153 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4155 LOC is the location of the comparison.
4157 If this function returns nonzero, it means that the comparison has
4158 a constant value. What this function returns is an expression for
4159 that value. */
4161 tree
4164 {
4165 tree type;
4173 /* Throw away any conversions to wider types
4174 already present in the operands. */
4179 /* If primopN is first sign-extended from primopN's precision to opN's
4180 precision, then zero-extended from opN's precision to
4181 *restype_ptr precision, shortenings might be invalid. */
4184 && !unsignedp0
4189 && !unsignedp1
4193 /* Handle the case that OP0 does not *contain* a conversion
4194 but it *requires* conversion to FINAL_TYPE. */
4201 /* If one of the operands must be floated, we cannot optimize. */
4205 /* If first arg is constant, swap the args (changing operation
4206 so value is preserved), for canonicalization. Don't do this if
4207 the second arg is 0. */
4212 {
4229 {
4244 }
4246 }
4248 /* If comparing an integer against a constant more bits wide,
4249 maybe we can deduce a value of 1 or 0 independent of the data.
4250 Or else truncate the constant now
4251 rather than extend the variable at run time.
4253 This is only interesting if the constant is the wider arg.
4254 Also, it is not safe if the constant is unsigned and the
4255 variable arg is signed, since in this case the variable
4256 would be sign-extended and then regarded as unsigned.
4257 Our technique fails in this case because the lowest/highest
4258 possible unsigned results don't follow naturally from the
4259 lowest/highest possible values of the variable operand.
4260 For just EQ_EXPR and NE_EXPR there is another technique that
4261 could be used: see if the constant can be faithfully represented
4262 in the other operand's type, by truncating it and reextending it
4263 and see if that preserves the constant's value. */
4269 {
4272 /* 1 if comparison is nominally unsigned. */
4274 tree val;
4286 {
4287 /* Convert primop1 to target type, but do not introduce
4288 additional overflow. We know primop1 is an int_cst. */
4295 }
4297 {
4300 }
4308 /* This used to be a switch, but Genix compiler can't handle that. */
4310 {
4313 }
4315 {
4318 }
4320 {
4325 }
4327 {
4332 }
4334 {
4339 }
4341 {
4346 }
4348 /* If primop0 was sign-extended and unsigned comparison specd,
4349 we did a signed comparison above using the signed type bounds.
4350 But the comparison we output must be unsigned.
4352 Also, for inequalities, VAL is no good; but if the signed
4353 comparison had *any* fixed result, it follows that the
4354 unsigned comparison just tests the sign in reverse
4355 (positive values are LE, negative ones GE).
4356 So we can generate an unsigned comparison
4357 against an extreme value of the signed type. */
4360 {
4363 {
4378 }
4380 }
4383 {
4390 }
4393 {
4394 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4398 }
4400 /* Value is not predetermined, but do the comparison
4401 in the type of the operand that is not constant.
4402 TYPE is already properly set. */
4403 }
4405 /* If either arg is decimal float and the other is float, find the
4406 proper common type to use for comparison. */
4412 /* If either arg is decimal float and the other is float, fail. */
4423 /* If args' natural types are both narrower than nominal type
4424 and both extend in the same manner, compare them
4425 in the type of the wider arg.
4426 Otherwise must actually extend both to the nominal
4427 common type lest different ways of extending
4428 alter the result.
4429 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4434 {
4438 type);
4439 /* Make sure shorter operand is extended the right way
4440 to match the longer operand. */
4441 primop0
4444 primop0);
4445 primop1
4448 primop1);
4449 }
4450 else
4451 {
4452 /* Here we must do the comparison on the nominal type
4453 using the args exactly as we received them. */
4460 {
4462 /* All unsigned values are >= 0, so we warn. However,
4463 if OP0 is a constant that is >= 0, the signedness of
4464 the comparison isn't an issue, so suppress the
4465 warning. */
4470 primop0)))
4471 /* Do not warn for enumeration types. */
4475 {
4492 }
4495 {
4496 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4501 }
4502 }
4503 }
4511 }
4512 \f
4513 /* Return a tree for the sum or difference (RESULTCODE says which)
4514 of pointer PTROP and integer INTOP. */
4516 tree
4519 {
4522 /* The result is a pointer of the same type that is being added. */
4526 {
4533 }
4535 {
4542 }
4543 else
4546 /* We are manipulating pointer values, so we don't need to warn
4547 about relying on undefined signed overflow. We disable the
4548 warning here because we use integer types so fold won't know that
4549 they are really pointers. */
4552 /* If what we are about to multiply by the size of the elements
4553 contains a constant term, apply distributive law
4554 and multiply that constant term separately.
4555 This helps produce common subexpressions. */
4560 /* If the constant comes from pointer subtraction,
4561 skip this optimization--it would cause an error. */
4563 /* If the constant is unsigned, and smaller than the pointer size,
4564 then we must skip this optimization. This is because it could cause
4565 an overflow error if the constant is negative but INTOP is not. */
4569 {
4574 /* Convert both subexpression types to the type of intop,
4575 because weird cases involving pointer arithmetic
4576 can result in a sum or difference with different type args. */
4581 }
4583 /* Convert the integer argument to a type the same size as sizetype
4584 so the multiply won't overflow spuriously. */
4590 /* Replace the integer argument with a suitable product by the object size.
4591 Do this multiplication as signed, then convert to the appropriate type
4592 for the pointer operation and disregard an overflow that occurred only
4593 because of the sign-extension change in the latter conversion. */
4594 {
4601 }
4603 /* Create the sum or difference. */
4612 }
4613 \f
4614 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4615 and if NON_CONST is known not to be permitted in an evaluated part
4616 of a constant expression. */
4618 tree
4620 {
4624 /* This should never be called for C++. */
4628 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4637 }
4639 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4640 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4641 around the SAVE_EXPR if needed so that c_fully_fold does not need
4642 to look inside SAVE_EXPRs. */
4644 tree
4646 {
4655 }
4657 /* Return whether EXPR is a declaration whose address can never be
4658 NULL. */
4660 bool
4662 {
4667 }
4669 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4670 or for an `if' or `while' statement or ?..: exp. It should already
4671 have been validated to be of suitable type; otherwise, a bad
4672 diagnostic may result.
4674 The EXPR is located at LOCATION.
4676 This preparation consists of taking the ordinary
4677 representation of an expression expr and producing a valid tree
4678 boolean expression describing whether expr is nonzero. We could
4679 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4680 but we optimize comparisons, &&, ||, and !.
4682 The resulting type should always be `truthvalue_type_node'. */
4684 tree
4686 {
4688 {
4730 ? truthvalue_true_node
4736 ? truthvalue_true_node
4741 /* Fall through. */
4744 {
4747 {
4748 /* Common Ada/Pascal programmer's mistake. */
4750 OPT_Waddress,
4752 inner);
4754 }
4756 }
4773 /* These don't change whether an object is nonzero or zero. */
4778 /* These don't change whether an object is zero or nonzero, but
4779 we can't ignore them if their second arg has side-effects. */
4781 {
4784 c_common_truthvalue_conversion
4787 }
4788 else
4793 /* Distribute the conversion into the arms of a COND_EXPR. */
4795 {
4798 /* In C++ one of the arms might have void type if it is throw. */
4806 }
4807 else
4808 {
4809 /* Folding will happen later for C. */
4817 }
4819 CASE_CONVERT:
4820 {
4824 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4825 since that affects how `default_conversion' will behave. */
4829 /* Don't strip a conversion from C++0x scoped enum, since they
4830 don't implicitly convert to other types. */
4834 /* If this isn't narrowing the argument, we can ignore it. */
4838 }
4844 {
4848 }
4853 }
4856 {
4858 expr = (build_binary_op
4862 c_common_truthvalue_conversion
4865 c_common_truthvalue_conversion
4870 }
4873 {
4878 }
4879 else
4882 ret:
4885 }
4886 \f
4895 /* Apply the TYPE_QUALS to the new DECL. */
4897 void
4899 {
4907 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4908 constructor can produce constant init, so rely on cp_finish_decl to
4909 clear TREE_READONLY if the variable has non-constant init. */
4912 {
4915 }
4917 {
4919 /* Allow 'restrict' on arrays of pointers.
4920 FIXME currently we just ignore it. */
4926 }
4927 }
4930 {
4933 };
4935 /* Hash function for the problem of multiple type definitions in
4936 different files. This must hash all types that will compare
4937 equal via comptypes to the same value. In practice it hashes
4938 on some of the simple stuff and leaves the details to comptypes. */
4940 hashval_t
4942 {
4945 tree t2;
4947 {
4948 /* For pointers, hash on pointee type plus some swizzling. */
4951 /* Hash on number of elements and total size. */
4970 }
4971 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4972 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4974 /* We might have a VLA here. */
4977 else
4980 }
4982 bool
4984 {
4986 }
4990 /* Return the typed-based alias set for T, which may be an expression
4991 or a type. Return -1 if we don't do anything special. */
4993 alias_set_type
4995 {
4996 tree u;
4998 /* For VLAs, use the alias set of the element type rather than the
4999 default of alias set 0 for types compared structurally. */
5001 {
5005 }
5007 /* Permit type-punning when accessing a union, provided the access
5008 is directly through the union. For example, this code does not
5009 permit taking the address of a union member and then storing
5010 through it. Even the type-punning allowed here is a GCC
5011 extension, albeit a common and useful one; the C standard says
5012 that such accesses have implementation-defined behavior. */
5020 /* That's all the expressions we handle specially. */
5024 /* The C standard guarantees that any object may be accessed via an
5025 lvalue that has character type. */
5031 /* The C standard specifically allows aliasing between signed and
5032 unsigned variants of the same type. We treat the signed
5033 variant as canonical. */
5035 {
5038 /* t1 == t can happen for boolean nodes which are always unsigned. */
5041 }
5043 /* Handle the case of multiple type nodes referring to "the same" type,
5044 which occurs with IMA. These share an alias set. FIXME: Currently only
5045 C90 is handled. (In C99 type compatibility is not transitive, which
5046 complicates things mightily. The alias set splay trees can theoretically
5047 represent this, but insertion is tricky when you consider all the
5048 different orders things might arrive in.) */
5053 /* Save time if there's only one input file. */
5057 /* Pointers need special handling if they point to any type that
5058 needs special handling (below). */
5060 {
5061 tree t2;
5062 /* Find bottom type under any nested POINTERs. */
5066 ;
5074 }
5075 /* These are the only cases that need special handling. */
5082 /* Undefined? */
5086 /* Look up t in hash table. Only one of the compatible types within each
5087 alias set is recorded in the table. */
5092 {
5095 }
5096 else
5097 /* Our caller will assign and record (in t) a new alias set; all we need
5098 to do is remember t in the hash table. */
5102 }
5103 \f
5104 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5105 the IS_SIZEOF parameter indicates which operator is being applied.
5106 The COMPLAIN flag controls whether we should diagnose possibly
5107 ill-formed constructs or not. LOC is the location of the SIZEOF or
5108 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5109 a type in any context should be returned, rather than the normal
5110 alignment for that type. */
5112 tree
5116 {
5124 {
5126 {
5133 }
5134 else
5135 {
5137 {
5141 else
5144 }
5146 }
5147 }
5149 {
5157 }
5160 {
5165 }
5168 {
5173 }
5174 else
5175 {
5177 /* Convert in case a char is more than one unit. */
5183 else
5185 }
5187 /* VALUE will have the middle-end integer type sizetype.
5188 However, we should really return a value of type `size_t',
5189 which is just a typedef for an ordinary integer type. */
5193 }
5195 /* Implement the __alignof keyword: Return the minimum required
5196 alignment of EXPR, measured in bytes. For VAR_DECLs,
5197 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5198 from an "aligned" __attribute__ specification). LOC is the
5199 location of the ALIGNOF operator. */
5201 tree
5203 {
5204 tree t;
5211 {
5214 }
5220 {
5227 {
5234 }
5236 }
5237 else
5241 }
5242 \f
5243 /* Handle C and C++ default attributes. */
5245 enum built_in_attribute
5246 {
5247 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5248 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5249 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5250 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5251 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5253 #undef DEF_ATTR_NULL_TREE
5254 #undef DEF_ATTR_INT
5255 #undef DEF_ATTR_STRING
5256 #undef DEF_ATTR_IDENT
5257 #undef DEF_ATTR_TREE_LIST
5258 ATTR_LAST
5259 };
5265 enum c_builtin_type
5266 {
5267 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5268 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5269 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5270 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5271 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5272 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5273 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5274 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5275 ARG6) NAME,
5276 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5277 ARG6, ARG7) NAME,
5278 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5279 ARG6, ARG7, ARG8) NAME,
5280 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5281 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5282 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5283 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5284 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5285 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5286 NAME,
5287 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5288 ARG6, ARG7) NAME,
5289 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5290 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5291 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5293 #undef DEF_PRIMITIVE_TYPE
5294 #undef DEF_FUNCTION_TYPE_0
5295 #undef DEF_FUNCTION_TYPE_1
5296 #undef DEF_FUNCTION_TYPE_2
5297 #undef DEF_FUNCTION_TYPE_3
5298 #undef DEF_FUNCTION_TYPE_4
5299 #undef DEF_FUNCTION_TYPE_5
5300 #undef DEF_FUNCTION_TYPE_6
5301 #undef DEF_FUNCTION_TYPE_7
5302 #undef DEF_FUNCTION_TYPE_8
5303 #undef DEF_FUNCTION_TYPE_VAR_0
5304 #undef DEF_FUNCTION_TYPE_VAR_1
5305 #undef DEF_FUNCTION_TYPE_VAR_2
5306 #undef DEF_FUNCTION_TYPE_VAR_3
5307 #undef DEF_FUNCTION_TYPE_VAR_4
5308 #undef DEF_FUNCTION_TYPE_VAR_5
5309 #undef DEF_FUNCTION_TYPE_VAR_7
5310 #undef DEF_FUNCTION_TYPE_VAR_11
5311 #undef DEF_POINTER_TYPE
5312 BT_LAST
5313 };
5317 /* A temporary array for c_common_nodes_and_builtins. Used in
5318 communication with def_fn_type. */
5321 /* A helper function for c_common_nodes_and_builtins. Build function type
5322 for DEF with return type RET and N arguments. If VAR is true, then the
5323 function should be variadic after those N arguments.
5325 Takes special care not to ICE if any of the types involved are
5326 error_mark_node, which indicates that said type is not in fact available
5327 (see builtin_type_for_size). In which case the function type as a whole
5328 should be error_mark_node. */
5330 static void
5332 {
5333 tree t;
5340 {
5346 }
5353 else
5356 egress:
5359 }
5361 /* Build builtin functions common to both C and C++ language
5362 frontends. */
5364 static void
5366 {
5367 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5368 builtin_types[ENUM] = VALUE;
5369 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5370 def_fn_type (ENUM, RETURN, 0, 0);
5371 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5372 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5373 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5374 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5375 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5376 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5377 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5378 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5379 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5380 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5381 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5382 ARG6) \
5383 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5384 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5385 ARG6, ARG7) \
5386 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5387 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5388 ARG6, ARG7, ARG8) \
5389 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5390 ARG7, ARG8);
5391 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5392 def_fn_type (ENUM, RETURN, 1, 0);
5393 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5394 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5395 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5396 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5397 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5398 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5399 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5400 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5401 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5402 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5403 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5404 ARG6, ARG7) \
5405 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5406 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5407 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5408 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5409 ARG7, ARG8, ARG9, ARG10, ARG11);
5410 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5411 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5415 #undef DEF_PRIMITIVE_TYPE
5416 #undef DEF_FUNCTION_TYPE_0
5417 #undef DEF_FUNCTION_TYPE_1
5418 #undef DEF_FUNCTION_TYPE_2
5419 #undef DEF_FUNCTION_TYPE_3
5420 #undef DEF_FUNCTION_TYPE_4
5421 #undef DEF_FUNCTION_TYPE_5
5422 #undef DEF_FUNCTION_TYPE_6
5423 #undef DEF_FUNCTION_TYPE_7
5424 #undef DEF_FUNCTION_TYPE_8
5425 #undef DEF_FUNCTION_TYPE_VAR_0
5426 #undef DEF_FUNCTION_TYPE_VAR_1
5427 #undef DEF_FUNCTION_TYPE_VAR_2
5428 #undef DEF_FUNCTION_TYPE_VAR_3
5429 #undef DEF_FUNCTION_TYPE_VAR_4
5430 #undef DEF_FUNCTION_TYPE_VAR_5
5431 #undef DEF_FUNCTION_TYPE_VAR_7
5432 #undef DEF_FUNCTION_TYPE_VAR_11
5433 #undef DEF_POINTER_TYPE
5438 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5439 NONANSI_P, ATTRS, IMPLICIT, COND) \
5440 if (NAME && COND) \
5441 def_builtin_1 (ENUM, NAME, CLASS, \
5442 builtin_types[(int) TYPE], \
5443 builtin_types[(int) LIBTYPE], \
5444 BOTH_P, FALLBACK_P, NONANSI_P, \
5445 built_in_attributes[(int) ATTRS], IMPLICIT);
5447 #undef DEF_BUILTIN
5455 }
5457 /* Like get_identifier, but avoid warnings about null arguments when
5458 the argument may be NULL for targets where GCC lacks stdint.h type
5459 information. */
5463 {
5465 }
5467 /* Build tree nodes and builtin functions common to both C and C++ language
5468 frontends. */
5470 void
5472 {
5476 tree array_domain_type;
5477 tree va_list_ref_type_node;
5478 tree va_list_arg_type_node;
5483 /* Define `int' and `char' first so that dbx will output them first. */
5487 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5488 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5489 but not C. Are the conditionals here needed? */
5495 long_unsigned_type_node);
5498 {
5506 }
5511 long_long_integer_type_node);
5513 long_long_unsigned_type_node);
5516 long_long_unsigned_type_node);
5519 short_unsigned_type_node);
5522 short_unsigned_type_node);
5524 /* Define both `signed char' and `unsigned char'. */
5528 /* These are types that c_common_type_for_size and
5529 c_common_type_for_mode use. */
5532 intQI_type_node));
5535 intHI_type_node));
5538 intSI_type_node));
5541 intDI_type_node));
5542 #if HOST_BITS_PER_WIDE_INT >= 64
5543 /* Note that this is different than the __int128 type that's part of
5544 the generic __intN support. */
5547 TYPE_DECL,
5549 intTI_type_node));
5550 #endif
5553 unsigned_intQI_type_node));
5556 unsigned_intHI_type_node));
5559 unsigned_intSI_type_node));
5562 unsigned_intDI_type_node));
5563 #if HOST_BITS_PER_WIDE_INT >= 64
5566 TYPE_DECL,
5568 unsigned_intTI_type_node));
5569 #endif
5571 /* Create the widest literal types. */
5572 widest_integer_literal_type_node
5576 widest_integer_literal_type_node));
5578 widest_unsigned_literal_type_node
5582 widest_unsigned_literal_type_node));
5586 pid_type_node =
5593 /* Only supported decimal floating point extension if the target
5594 actually supports underlying modes. */
5598 {
5602 }
5605 {
5610 long_long_fract_type_node);
5612 unsigned_short_fract_type_node);
5614 unsigned_fract_type_node);
5616 unsigned_long_fract_type_node);
5618 unsigned_long_long_fract_type_node);
5620 sat_short_fract_type_node);
5623 sat_long_fract_type_node);
5625 sat_long_long_fract_type_node);
5627 sat_unsigned_short_fract_type_node);
5629 sat_unsigned_fract_type_node);
5631 sat_unsigned_long_fract_type_node);
5633 sat_unsigned_long_long_fract_type_node);
5638 long_long_accum_type_node);
5640 unsigned_short_accum_type_node);
5642 unsigned_accum_type_node);
5644 unsigned_long_accum_type_node);
5646 unsigned_long_long_accum_type_node);
5648 sat_short_accum_type_node);
5651 sat_long_accum_type_node);
5653 sat_long_long_accum_type_node);
5655 sat_unsigned_short_accum_type_node);
5657 sat_unsigned_accum_type_node);
5659 sat_unsigned_long_accum_type_node);
5661 sat_unsigned_long_long_accum_type_node);
5663 }
5666 TYPE_DECL,
5668 complex_integer_type_node));
5670 TYPE_DECL,
5672 complex_float_type_node));
5674 TYPE_DECL,
5676 complex_double_type_node));
5680 complex_long_double_type_node));
5683 /* For C++, make fileptr_type_node a distinct void * type until
5684 FILE type is defined. */
5689 /* Set the TYPE_NAME for any variants that were built before
5690 record_builtin_type gave names to the built-in types. */
5691 {
5697 }
5701 /* Make a type to be the domain of a few array types
5702 whose domains don't really matter.
5703 200 is small enough that it always fits in size_t
5704 and large enough that it can hold most function names for the
5705 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5708 /* Make a type for arrays of characters.
5709 With luck nothing will ever really depend on the length of this
5710 array type. */
5711 char_array_type_node
5715 const_string_type_node
5719 /* This is special for C++ so functions can be overloaded. */
5725 {
5728 else
5731 }
5733 /* This is for wide string constants. */
5734 wchar_array_type_node
5737 /* Define 'char16_t'. */
5742 {
5747 }
5749 /* This is for UTF-16 string constants. */
5750 char16_array_type_node
5753 /* Define 'char32_t'. */
5758 {
5763 }
5765 /* This is for UTF-32 string constants. */
5766 char32_array_type_node
5769 wint_type_node =
5772 intmax_type_node =
5774 uintmax_type_node =
5778 sig_atomic_type_node =
5781 int8_type_node =
5784 int16_type_node =
5787 int32_type_node =
5790 int64_type_node =
5793 uint8_type_node =
5805 int_least8_type_node =
5808 int_least16_type_node =
5811 int_least32_type_node =
5814 int_least64_type_node =
5817 uint_least8_type_node =
5820 uint_least16_type_node =
5823 uint_least32_type_node =
5826 uint_least64_type_node =
5829 int_fast8_type_node =
5832 int_fast16_type_node =
5835 int_fast32_type_node =
5838 int_fast64_type_node =
5841 uint_fast8_type_node =
5844 uint_fast16_type_node =
5847 uint_fast32_type_node =
5850 uint_fast64_type_node =
5853 intptr_type_node =
5856 uintptr_type_node =
5859 default_function_type
5861 ptrdiff_type_node
5868 va_list_type_node));
5870 {
5873 tree ptype;
5876 {
5880 ptype));
5882 }
5883 }
5886 {
5889 }
5890 else
5891 {
5894 }
5901 /* Create the built-in __null node. It is important that this is
5902 not shared. */
5906 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5908 }
5910 /* The number of named compound-literals generated thus far. */
5913 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5915 void
5917 {
5920 compound_literal_number);
5921 compound_literal_number++;
5923 }
5925 tree
5927 {
5928 /* In gimplify_va_arg_expr we take the address of the ap argument, mark it
5929 addressable now. */
5935 }
5938 /* Linked list of disabled built-in functions. */
5941 {
5949 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5950 begins with "__builtin_", give an error. */
5952 void
5954 {
5957 else
5958 {
5963 }
5964 }
5967 /* Return true if the built-in function NAME has been disabled, false
5968 otherwise. */
5970 static bool
5972 {
5975 {
5978 }
5980 }
5983 /* Worker for DEF_BUILTIN.
5984 Possibly define a builtin function with one or two names.
5985 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5986 nonansi_p and flag_no_nonansi_builtin. */
5988 static void
5995 {
5996 tree decl;
6009 fnattrs);
6018 }
6019 \f
6020 /* Nonzero if the type T promotes to int. This is (nearly) the
6021 integral promotions defined in ISO C99 6.3.1.1/2. */
6023 bool
6025 {
6027 {
6037 /* ??? Technically all enumerations not larger than an int
6038 promote to an int. But this is used along code paths
6039 that only want to notice a size change. */
6047 }
6048 }
6050 /* Return 1 if PARMS specifies a fixed number of parameters
6051 and none of their types is affected by default promotions. */
6053 int
6055 {
6056 const_tree t;
6058 {
6075 }
6077 }
6079 /* Recursively remove any '*' or '&' operator from TYPE. */
6080 tree
6082 {
6086 }
6088 /* Recursively remove pointer or array type from TYPE. */
6089 tree
6091 {
6095 }
6097 /* Used to compare case labels. K1 and K2 are actually tree nodes
6098 representing case labels, or NULL_TREE for a `default' label.
6099 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6100 K2, and 0 if K1 and K2 are equal. */
6102 int
6104 {
6105 /* Consider a NULL key (such as arises with a `default' label) to be
6106 smaller than anything else. */
6113 }
6115 /* Process a case label, located at LOC, for the range LOW_VALUE
6116 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6117 then this case label is actually a `default' label. If only
6118 HIGH_VALUE is NULL_TREE, then case label was declared using the
6119 usual C/C++ syntax, rather than the GNU case range extension.
6120 CASES is a tree containing all the case ranges processed so far;
6121 COND is the condition for the switch-statement itself. Returns the
6122 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6123 is created. */
6125 tree
6128 {
6129 tree type;
6130 tree label;
6131 tree case_label;
6132 splay_tree_node node;
6134 /* Create the LABEL_DECL itself. */
6137 /* If there was an error processing the switch condition, bail now
6138 before we get more confused. */
6146 {
6149 }
6151 /* Case ranges are a GNU extension. */
6158 {
6163 }
6165 {
6170 }
6173 {
6174 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6175 really a case range, even though it was written that way.
6176 Remove the HIGH_VALUE to simplify later processing. */
6181 }
6183 /* See if the case is in range of the type of the original testing
6184 expression. If both low_value and high_value are out of range,
6185 don't insert the case label and return NULL_TREE. */
6191 /* Look up the LOW_VALUE in the table of case labels we already
6192 have. */
6194 /* If there was not an exact match, check for overlapping ranges.
6195 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6196 that's a `default' label and the only overlap is an exact match. */
6198 {
6199 splay_tree_node low_bound;
6200 splay_tree_node high_bound;
6202 /* Even though there wasn't an exact match, there might be an
6203 overlap between this case range and another case range.
6204 Since we've (inductively) not allowed any overlapping case
6205 ranges, we simply need to find the greatest low case label
6206 that is smaller that LOW_VALUE, and the smallest low case
6207 label that is greater than LOW_VALUE. If there is an overlap
6208 it will occur in one of these two ranges. */
6214 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6215 the LOW_VALUE, so there is no need to check unless the
6216 LOW_BOUND is in fact itself a case range. */
6222 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6223 range is bigger than the low end of the current range, so we
6224 are only interested if the current range is a real range, and
6225 not an ordinary case label. */
6227 && high_value
6229 high_value)
6232 }
6233 /* If there was an overlap, issue an error. */
6235 {
6239 {
6243 }
6245 {
6248 }
6249 else
6250 {
6254 }
6256 }
6258 /* Add a CASE_LABEL to the statement-tree. */
6260 /* Register this case label in the splay tree. */
6267 error_out:
6268 /* Add a label so that the back-end doesn't think that the beginning of
6269 the switch is unreachable. Note that we do not add a case label, as
6270 that just leads to duplicates and thence to failure later on. */
6272 {
6275 }
6277 }
6279 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6280 Used to verify that case values match up with enumerator values. */
6282 static void
6284 {
6291 else
6298 buf);
6299 else
6304 }
6306 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6307 Used to verify that case values match up with enumerator values. */
6309 static int
6311 {
6315 /* Skip default case. */
6319 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6320 when we did our enum->case scan. Reset our scratch bit after. */
6323 else
6326 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6327 not set, that means that CASE_HIGH did not appear when we did our
6328 enum->case scan. Reset our scratch bit after. */
6330 {
6333 else
6335 }
6338 }
6340 /* Handle -Wswitch*. Called from the front end after parsing the
6341 switch construct. */
6342 /* ??? Should probably be somewhere generic, since other languages
6343 besides C and C++ would want this. At the moment, however, C/C++
6344 are the only tree-ssa languages that support enumerations at all,
6345 so the point is moot. */
6347 void
6350 {
6351 splay_tree_node default_node;
6352 splay_tree_node node;
6353 tree chain;
6363 /* From here on, we only care about about enumerated types. */
6367 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6371 /* Check the cases. Warn about case values which are not members of
6372 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6373 there is no default case, check that exactly all enumeration
6374 literals are covered by the cases. */
6376 /* Clearing COND if it is not an integer constant simplifies
6377 the tests inside the loop below. */
6381 /* The time complexity here is O(N*lg(N)) worst case, but for the
6382 common case of monotonically increasing enumerators, it is
6383 O(N), since the nature of the splay tree will keep the next
6384 element adjacent to the root at all times. */
6387 {
6393 {
6394 /* Mark the CASE_LOW part of the case entry as seen. */
6398 }
6400 /* Even though there wasn't an exact match, there might be a
6401 case range which includes the enumerator's value. */
6404 {
6408 {
6409 /* If we match the upper bound exactly, mark the CASE_HIGH
6410 part of the case entry as seen. */
6414 }
6415 }
6417 /* We've now determined that this enumerated literal isn't
6418 handled by the case labels of the switch statement. */
6420 /* If the switch expression is a constant, we only really care
6421 about whether that constant is handled by the switch. */
6425 /* If there is a default_node, the only relevant option is
6426 Wswitch-enum. Otherwise, if both are enabled then we prefer
6427 to warn using -Wswitch because -Wswitch is enabled by -Wall
6428 while -Wswitch-enum is explicit. */
6431 ? OPT_Wswitch_enum
6435 }
6437 /* Warn if there are case expressions that don't correspond to
6438 enumerators. This can occur since C and C++ don't enforce
6439 type-checking of assignments to enumeration variables.
6441 The time complexity here is now always O(N) worst case, since
6442 we should have marked both the lower bound and upper bound of
6443 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6444 above. This scan also resets those fields. */
6447 }
6449 /* Finish an expression taking the address of LABEL (an
6450 IDENTIFIER_NODE). Returns an expression for the address.
6452 LOC is the location for the expression returned. */
6454 tree
6456 {
6457 tree result;
6467 else
6468 {
6471 /* The current function is not necessarily uninlinable.
6472 Computed gotos are incompatible with inlining, but the value
6473 here could be used only in a diagnostic, for example. */
6475 }
6478 }
6479 \f
6481 /* Given a boolean expression ARG, return a tree representing an increment
6482 or decrement (as indicated by CODE) of ARG. The front end must check for
6483 invalid cases (e.g., decrement in C++). */
6484 tree
6486 {
6487 tree val;
6492 {
6515 }
6518 }
6519 \f
6520 /* Built-in macros for stddef.h and stdint.h, that require macros
6521 defined in this file. */
6522 void
6524 {
6587 }
6589 static void
6591 {
6592 /* Fill in the built_in_attributes array. */
6593 #define DEF_ATTR_NULL_TREE(ENUM) \
6594 built_in_attributes[(int) ENUM] = NULL_TREE;
6595 #define DEF_ATTR_INT(ENUM, VALUE) \
6596 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6597 #define DEF_ATTR_STRING(ENUM, VALUE) \
6598 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6599 #define DEF_ATTR_IDENT(ENUM, STRING) \
6600 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6601 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6602 built_in_attributes[(int) ENUM] \
6603 = tree_cons (built_in_attributes[(int) PURPOSE], \
6604 built_in_attributes[(int) VALUE], \
6605 built_in_attributes[(int) CHAIN]);
6607 #undef DEF_ATTR_NULL_TREE
6608 #undef DEF_ATTR_INT
6609 #undef DEF_ATTR_IDENT
6610 #undef DEF_ATTR_TREE_LIST
6611 }
6613 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6614 identifier as an argument, so the front end shouldn't look it up. */
6616 bool
6618 {
6621 /* Unknown attribute that we'll end up ignoring, return true so we
6622 don't complain about an identifier argument. */
6628 else
6630 }
6632 /* Attribute handlers common to C front ends. */
6634 /* Handle a "packed" attribute; arguments as in
6635 struct attribute_spec.handler. */
6637 static tree
6640 {
6642 {
6646 }
6648 {
6650 /* Still pack bitfields. */
6655 else
6657 }
6658 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6659 used for DECL_REGISTER. It wouldn't mean anything anyway.
6660 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6661 that changes what the typedef is typing. */
6662 else
6663 {
6666 }
6669 }
6671 /* Handle a "nocommon" attribute; arguments as in
6672 struct attribute_spec.handler. */
6674 static tree
6678 {
6681 else
6682 {
6685 }
6688 }
6690 /* Handle a "common" attribute; arguments as in
6691 struct attribute_spec.handler. */
6693 static tree
6696 {
6699 else
6700 {
6703 }
6706 }
6708 /* Handle a "noreturn" attribute; arguments as in
6709 struct attribute_spec.handler. */
6711 static tree
6714 {
6717 /* See FIXME comment in c_common_attribute_table. */
6724 = (build_qualified_type
6725 (build_pointer_type
6729 else
6730 {
6733 }
6736 }
6738 /* Handle a "hot" and attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6744 {
6747 {
6749 {
6753 }
6754 /* Most of the rest of the hot processing is done later with
6755 lookup_attribute. */
6756 }
6757 else
6758 {
6761 }
6764 }
6766 /* Handle a "cold" and attribute; arguments as in
6767 struct attribute_spec.handler. */
6769 static tree
6772 {
6775 {
6777 {
6781 }
6782 /* Most of the rest of the cold processing is done later with
6783 lookup_attribute. */
6784 }
6785 else
6786 {
6789 }
6792 }
6794 /* Handle a "no_sanitize_address" attribute; arguments as in
6795 struct attribute_spec.handler. */
6797 static tree
6800 {
6802 {
6805 }
6808 }
6810 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6811 struct attribute_spec.handler. */
6813 static tree
6816 {
6825 }
6827 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6828 struct attribute_spec.handler. */
6830 static tree
6833 {
6835 {
6838 }
6841 }
6843 /* Handle a "stack_protect" attribute; arguments as in
6844 struct attribute_spec.handler. */
6845 static tree
6848 {
6850 {
6853 }
6854 else
6860 }
6862 /* Handle a "noinline" attribute; arguments as in
6863 struct attribute_spec.handler. */
6865 static tree
6869 {
6871 {
6873 {
6877 }
6878 else
6880 }
6881 else
6882 {
6885 }
6888 }
6890 /* Handle a "noclone" attribute; arguments as in
6891 struct attribute_spec.handler. */
6893 static tree
6897 {
6899 {
6902 }
6905 }
6907 /* Handle a "no_icf" attribute; arguments as in
6908 struct attribute_spec.handler. */
6910 static tree
6914 {
6916 {
6919 }
6922 }
6924 /* Handle a "hsa" attribute; arguments as in
6925 struct attribute_spec.handler. */
6927 static tree
6931 {
6933 {
6937 }
6948 }
6950 /* Handle a "always_inline" attribute; arguments as in
6951 struct attribute_spec.handler. */
6953 static tree
6958 {
6960 {
6962 {
6966 }
6967 else
6968 /* Set the attribute and mark it for disregarding inline
6969 limits. */
6971 }
6972 else
6973 {
6976 }
6979 }
6981 /* Handle a "gnu_inline" attribute; arguments as in
6982 struct attribute_spec.handler. */
6984 static tree
6989 {
6991 {
6992 /* Do nothing else, just set the attribute. We'll get at
6993 it later with lookup_attribute. */
6994 }
6995 else
6996 {
6999 }
7002 }
7004 /* Handle a "leaf" attribute; arguments as in
7005 struct attribute_spec.handler. */
7007 static tree
7011 {
7013 {
7016 }
7018 {
7021 }
7024 }
7026 /* Handle an "artificial" attribute; arguments as in
7027 struct attribute_spec.handler. */
7029 static tree
7034 {
7036 {
7037 /* Do nothing else, just set the attribute. We'll get at
7038 it later with lookup_attribute. */
7039 }
7040 else
7041 {
7044 }
7047 }
7049 /* Handle a "flatten" attribute; arguments as in
7050 struct attribute_spec.handler. */
7052 static tree
7054 tree args ATTRIBUTE_UNUSED,
7056 {
7058 /* Do nothing else, just set the attribute. We'll get at
7059 it later with lookup_attribute. */
7060 ;
7061 else
7062 {
7065 }
7068 }
7070 /* Handle a "warning" or "error" attribute; arguments as in
7071 struct attribute_spec.handler. */
7073 static tree
7076 {
7079 /* Do nothing else, just set the attribute. We'll get at
7080 it later with lookup_attribute. */
7081 ;
7082 else
7083 {
7086 }
7089 }
7091 /* Handle a "used" attribute; arguments as in
7092 struct attribute_spec.handler. */
7094 static tree
7097 {
7103 {
7108 }
7109 else
7110 {
7113 }
7116 }
7118 /* Handle a "unused" attribute; arguments as in
7119 struct attribute_spec.handler. */
7121 static tree
7124 {
7126 {
7134 {
7139 }
7140 else
7141 {
7144 }
7145 }
7146 else
7147 {
7151 }
7154 }
7156 /* Handle a "externally_visible" attribute; arguments as in
7157 struct attribute_spec.handler. */
7159 static tree
7164 {
7168 {
7171 {
7175 }
7176 }
7177 else
7178 {
7181 }
7184 }
7186 /* Handle the "no_reorder" attribute. Arguments as in
7187 struct attribute_spec.handler. */
7189 static tree
7191 tree name,
7192 tree,
7195 {
7200 {
7203 name);
7205 }
7208 }
7210 /* Handle a "const" attribute; arguments as in
7211 struct attribute_spec.handler. */
7213 static tree
7216 {
7219 /* See FIXME comment on noreturn in c_common_attribute_table. */
7225 = (build_qualified_type
7226 (build_pointer_type
7230 else
7231 {
7234 }
7237 }
7239 /* Handle a "transparent_union" attribute; arguments as in
7240 struct attribute_spec.handler. */
7242 static tree
7246 {
7247 tree type;
7258 {
7259 /* Make sure that the first field will work for a transparent union.
7260 If the type isn't complete yet, leave the check to the code in
7261 finish_struct. */
7263 {
7269 }
7272 {
7273 /* If the type isn't complete yet, setting the flag
7274 on a variant wouldn't ever be checked. */
7278 /* build_duplicate_type doesn't work for C++. */
7282 /* A type variant isn't good enough, since we don't a cast
7283 to such a type removed as a no-op. */
7285 }
7289 }
7291 ignored:
7294 }
7296 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7297 get the requested priority for a constructor or destructor,
7298 possibly issuing diagnostics for invalid or reserved
7299 priorities. */
7301 static priority_type
7303 {
7304 HOST_WIDE_INT pri;
7305 tree arg;
7311 {
7314 else
7317 }
7334 {
7337 "destructor priorities from 0 to %d are reserved "
7339 MAX_RESERVED_INIT_PRIORITY);
7340 else
7342 "constructor priorities from 0 to %d are reserved "
7344 MAX_RESERVED_INIT_PRIORITY);
7345 }
7348 invalid:
7351 MAX_INIT_PRIORITY);
7352 else
7354 MAX_INIT_PRIORITY);
7356 }
7358 /* Handle a "constructor" attribute; arguments as in
7359 struct attribute_spec.handler. */
7361 static tree
7365 {
7372 {
7373 priority_type priority;
7378 }
7379 else
7380 {
7383 }
7386 }
7388 /* Handle a "destructor" attribute; arguments as in
7389 struct attribute_spec.handler. */
7391 static tree
7395 {
7402 {
7403 priority_type priority;
7408 }
7409 else
7410 {
7413 }
7416 }
7418 /* Nonzero if the mode is a valid vector mode for this architecture.
7419 This returns nonzero even if there is no hardware support for the
7420 vector mode, but we can emulate with narrower modes. */
7422 static int
7424 {
7426 machine_mode innermode;
7428 /* Doh! What's going on? */
7437 /* Hardware support. Woo hoo! */
7443 /* We should probably return 1 if requesting V4DI and we have no DI,
7444 but we have V2DI, but this is probably very unlikely. */
7446 /* If we have support for the inner mode, we can safely emulate it.
7447 We may not have V2DI, but me can emulate with a pair of DIs. */
7449 }
7452 /* Handle a "mode" attribute; arguments as in
7453 struct attribute_spec.handler. */
7455 static tree
7458 {
7466 else
7467 {
7472 tree typefm;
7477 {
7483 }
7485 /* Change this type to have a type with the specified mode.
7486 First check for the special modes. */
7499 else
7502 {
7505 }
7508 {
7511 }
7515 {
7547 }
7549 {
7552 }
7555 {
7560 {
7563 }
7567 else
7570 }
7571 else
7572 {
7573 /* For fixed-point modes, we need to test if the signness of type
7574 and the machine mode are consistent. */
7577 {
7580 }
7581 /* For fixed-point modes, we need to pass saturating info. */
7585 }
7588 {
7591 }
7593 {
7594 /* For enumeral types, copy the precision from the integer
7595 type returned above. If not an INTEGER_TYPE, we can't use
7596 this mode for this type. */
7598 {
7601 }
7604 {
7607 }
7608 else
7609 {
7610 /* We cannot build a type variant, as there's code that assumes
7611 that TYPE_MAIN_VARIANT has the same mode. This includes the
7612 debug generators. Instead, create a subrange type. This
7613 results in all of the enumeral values being emitted only once
7614 in the original, and the subtype gets them by reference. */
7617 else
7620 }
7621 }
7625 {
7628 }
7631 }
7634 }
7636 /* Handle a "section" attribute; arguments as in
7637 struct attribute_spec.handler. */
7639 static tree
7642 {
7646 {
7650 }
7655 {
7658 }
7661 {
7664 }
7669 {
7673 }
7675 /* The decl may have already been given a section attribute
7676 from a previous declaration. Ensure they match. */
7680 {
7683 }
7688 {
7691 }
7696 fail:
7699 }
7701 /* Check whether ALIGN is a valid user-specified alignment. If so,
7702 return its base-2 log; if not, output an error and return -1. If
7703 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7704 no error. */
7705 int
7707 {
7714 {
7717 }
7722 {
7725 }
7727 {
7730 }
7732 }
7734 /*
7735 If in c++-11, check if the c++-11 alignment constraint with respect
7736 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7737 c++-11 mode, does nothing.
7739 [dcl.align]2/ says:
7741 [* if the constant expression evaluates to a fundamental alignment,
7742 the alignment requirement of the declared entity shall be the
7743 specified fundamental alignment.
7745 * if the constant expression evaluates to an extended alignment
7746 and the implementation supports that alignment in the context
7747 of the declaration, the alignment of the declared entity shall
7748 be that alignment
7750 * if the constant expression evaluates to an extended alignment
7751 and the implementation does not support that alignment in the
7752 context of the declaration, the program is ill-formed]. */
7754 static bool
7758 {
7771 {
7773 {
7774 /* For file scope variables and static members, the target
7775 supports alignments that are at most
7776 MAX_OFILE_ALIGNMENT. */
7779 }
7780 else
7781 {
7782 #ifdef BIGGEST_FIELD_ALIGNMENT
7783 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7784 #else
7785 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7786 #endif
7787 /* For non-static members, the target supports either
7788 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7789 if it is defined or BIGGEST_ALIGNMENT. */
7794 #undef MAX_TARGET_FIELD_ALIGNMENT
7795 /* For stack variables, the target supports at most
7796 MAX_STACK_ALIGNMENT. */
7800 }
7801 }
7803 {
7804 /* Let's be liberal for types. */
7807 }
7815 }
7817 /* Handle a "aligned" attribute; arguments as in
7818 struct attribute_spec.handler. */
7820 static tree
7823 {
7827 tree align_expr;
7831 {
7836 }
7837 else
7841 {
7845 }
7853 {
7856 /* If we have a TYPE_DECL, then copy the type, so that we
7857 don't accidentally modify a builtin type. See pushdecl. */
7860 {
7867 }
7868 else
7873 }
7876 {
7879 }
7882 /* C++-11 [dcl.align/4]:
7884 When multiple alignment-specifiers are specified for an
7885 entity, the alignment requirement shall be set to the
7886 strictest specified alignment.
7888 This formally comes from the c++11 specification but we are
7889 doing it for the GNU attribute syntax as well. */
7893 {
7898 else
7902 }
7903 else
7904 {
7907 }
7910 }
7912 /* Handle a "weak" attribute; arguments as in
7913 struct attribute_spec.handler. */
7915 static tree
7920 {
7923 {
7926 }
7928 {
7932 }
7935 {
7940 }
7941 else
7945 }
7947 /* Handle an "alias" or "ifunc" attribute; arguments as in
7948 struct attribute_spec.handler, except that IS_ALIAS tells us
7949 whether this is an alias as opposed to ifunc attribute. */
7951 static tree
7954 {
7959 {
7962 }
7966 /* A static variable declaration is always a tentative definition,
7967 but the alias is a non-tentative definition which overrides. */
7970 {
7974 }
7978 {
7982 }
7984 /* Note that the very first time we process a nested declaration,
7985 decl_function_context will not be set. Indeed, *would* never
7986 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7987 we do below. After such frobbery, pushdecl would set the context.
7988 In any case, this is never what we want. */
7990 {
7991 tree id;
7995 {
7999 }
8001 /* This counts as a use of the object pointed to. */
8006 else
8010 /* ifuncs are also aliases, so set that attribute too. */
8013 }
8014 else
8015 {
8018 }
8021 {
8024 {
8027 else
8029 }
8030 }
8034 }
8036 /* Handle an "alias" or "ifunc" attribute; arguments as in
8037 struct attribute_spec.handler. */
8039 static tree
8042 {
8044 }
8046 /* Handle an "alias" or "ifunc" attribute; arguments as in
8047 struct attribute_spec.handler. */
8049 static tree
8052 {
8054 }
8056 /* Handle a "weakref" attribute; arguments as in struct
8057 attribute_spec.handler. */
8059 static tree
8062 {
8065 /* We must ignore the attribute when it is associated with
8066 local-scoped decls, since attribute alias is ignored and many
8067 such symbols do not even have a DECL_WEAK field. */
8069 || current_function_decl
8071 {
8075 }
8078 {
8082 }
8084 /* The idea here is that `weakref("name")' mutates into `weakref,
8085 alias("name")', and weakref without arguments, in turn,
8086 implicitly adds weak. */
8089 {
8096 }
8097 else
8098 {
8103 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8104 and that isn't supported; and because it wants to add it to
8105 the list of weak decls, which isn't helpful. */
8107 }
8110 {
8114 }
8117 }
8119 /* Handle an "visibility" attribute; arguments as in
8120 struct attribute_spec.handler. */
8122 static tree
8126 {
8132 {
8136 {
8138 name);
8140 }
8142 {
8146 }
8147 }
8149 {
8152 }
8155 {
8158 }
8160 /* If this is a type, set the visibility on the type decl. */
8162 {
8167 {
8169 name);
8171 }
8172 }
8182 else
8183 {
8184 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8186 }
8190 {
8204 }
8209 /* Go ahead and attach the attribute to the node as well. This is needed
8210 so we can determine whether we have VISIBILITY_DEFAULT because the
8211 visibility was not specified, or because it was explicitly overridden
8212 from the containing scope. */
8215 }
8217 /* Determine the ELF symbol visibility for DECL, which is either a
8218 variable or a function. It is an error to use this function if a
8219 definition of DECL is not available in this translation unit.
8220 Returns true if the final visibility has been determined by this
8221 function; false if the caller is free to make additional
8222 modifications. */
8224 bool
8226 {
8230 /* If the user explicitly specified the visibility with an
8231 attribute, honor that. DECL_VISIBILITY will have been set during
8232 the processing of the attribute. We check for an explicit
8233 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8234 to distinguish the use of an attribute from the use of a "#pragma
8235 GCC visibility push(...)"; in the latter case we still want other
8236 considerations to be able to overrule the #pragma. */
8238 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8243 /* Set default visibility to whatever the user supplied with
8244 visibility_specified depending on #pragma GCC visibility. */
8246 {
8249 {
8252 /* If visibility changed and DECL already has DECL_RTL, ensure
8253 symbol flags are updated. */
8258 }
8259 }
8261 }
8263 /* Handle an "tls_model" attribute; arguments as in
8264 struct attribute_spec.handler. */
8266 static tree
8269 {
8270 tree id;
8277 {
8280 }
8285 {
8288 }
8298 else
8299 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8303 }
8305 /* Handle a "no_instrument_function" attribute; arguments as in
8306 struct attribute_spec.handler. */
8308 static tree
8313 {
8317 {
8321 }
8322 else
8326 }
8328 /* Handle a "malloc" attribute; arguments as in
8329 struct attribute_spec.handler. */
8331 static tree
8334 {
8338 else
8339 {
8342 }
8345 }
8347 /* Handle a "alloc_size" attribute; arguments as in
8348 struct attribute_spec.handler. */
8350 static tree
8353 {
8356 {
8363 || !arg_count
8365 {
8370 }
8371 }
8373 }
8375 /* Handle a "alloc_align" attribute; arguments as in
8376 struct attribute_spec.handler. */
8378 static tree
8381 {
8388 || !arg_count
8390 {
8395 }
8397 }
8399 /* Handle a "assume_aligned" attribute; arguments as in
8400 struct attribute_spec.handler. */
8402 static tree
8405 {
8407 {
8414 {
8419 }
8420 }
8422 }
8424 /* Handle a "fn spec" attribute; arguments as in
8425 struct attribute_spec.handler. */
8427 static tree
8431 {
8436 }
8438 /* Handle a "bnd_variable_size" attribute; arguments as in
8439 struct attribute_spec.handler. */
8441 static tree
8444 {
8446 {
8449 }
8452 }
8454 /* Handle a "bnd_legacy" attribute; arguments as in
8455 struct attribute_spec.handler. */
8457 static tree
8460 {
8462 {
8465 }
8468 }
8470 /* Handle a "bnd_instrument" attribute; arguments as in
8471 struct attribute_spec.handler. */
8473 static tree
8476 {
8478 {
8481 }
8484 }
8486 /* Handle a "warn_unused" attribute; arguments as in
8487 struct attribute_spec.handler. */
8489 static tree
8491 tree args ATTRIBUTE_UNUSED,
8493 {
8495 /* Do nothing else, just set the attribute. We'll get at
8496 it later with lookup_attribute. */
8497 ;
8498 else
8499 {
8502 }
8505 }
8507 /* Handle an "omp declare simd" attribute; arguments as in
8508 struct attribute_spec.handler. */
8510 static tree
8512 {
8514 }
8516 /* Handle an "omp declare target" attribute; arguments as in
8517 struct attribute_spec.handler. */
8519 static tree
8521 {
8523 }
8525 /* Handle a "returns_twice" attribute; arguments as in
8526 struct attribute_spec.handler. */
8528 static tree
8531 {
8534 else
8535 {
8538 }
8541 }
8543 /* Handle a "no_limit_stack" attribute; arguments as in
8544 struct attribute_spec.handler. */
8546 static tree
8551 {
8555 {
8559 }
8561 {
8565 }
8566 else
8570 }
8572 /* Handle a "pure" attribute; arguments as in
8573 struct attribute_spec.handler. */
8575 static tree
8578 {
8581 /* ??? TODO: Support types. */
8582 else
8583 {
8586 }
8589 }
8591 /* Digest an attribute list destined for a transactional memory statement.
8592 ALLOWED is the set of attributes that are allowed for this statement;
8593 return the attribute we parsed. Multiple attributes are never allowed. */
8595 int
8597 {
8602 {
8610 {
8613 }
8616 {
8619 }
8622 else
8624 }
8627 }
8629 /* Transform a TM attribute name into a maskable integer and back.
8630 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8631 to how the lack of an attribute is treated. */
8633 int
8635 {
8649 }
8651 tree
8653 {
8656 {
8674 }
8676 }
8678 /* Return the first TM attribute seen in LIST. */
8680 tree
8682 {
8684 {
8688 }
8690 }
8692 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8693 Here we accept only function types, and verify that none of the other
8694 function TM attributes are also applied. */
8695 /* ??? We need to accept class types for C++, but not C. This greatly
8696 complicates this function, since we can no longer rely on the extra
8697 processing given by function_type_required. */
8699 static tree
8702 {
8703 /* Only one path adds the attribute; others don't. */
8707 {
8710 /* Only tm_callable and tm_safe apply to classes. */
8713 /* FALLTHRU */
8717 {
8720 ;
8723 else
8725 }
8729 {
8732 {
8737 }
8738 }
8739 /* FALLTHRU */
8742 /* If a function is next, pass it on to be tried next. */
8746 ignored:
8749 }
8752 }
8754 /* Handle the TM_WRAP attribute; arguments as in
8755 struct attribute_spec.handler. */
8757 static tree
8760 {
8763 /* We don't need the attribute even on success, since we
8764 record the entry in an external table. */
8769 else
8770 {
8773 ;
8778 else
8779 {
8783 {
8787 else
8789 }
8790 else
8792 }
8793 }
8796 }
8798 /* Ignore the given attribute. Used when this attribute may be usefully
8799 overridden by the target, but is not used generically. */
8801 static tree
8805 {
8808 }
8810 /* Handle a "no vops" attribute; arguments as in
8811 struct attribute_spec.handler. */
8813 static tree
8817 {
8821 }
8823 /* Handle a "deprecated" attribute; arguments as in
8824 struct attribute_spec.handler. */
8826 static tree
8830 {
8838 {
8841 }
8844 {
8855 else
8857 }
8859 {
8864 }
8865 else
8869 {
8872 {
8878 }
8881 else
8883 }
8886 }
8888 /* Handle a "vector_size" attribute; arguments as in
8889 struct attribute_spec.handler. */
8891 static tree
8895 {
8897 machine_mode orig_mode;
8908 {
8911 }
8913 /* Get the vector size (in bytes). */
8916 /* We need to provide for vector pointers, vector arrays, and
8917 functions returning vectors. For example:
8919 __attribute__((vector_size(16))) short *foo;
8921 In this case, the mode is SI, but the type being modified is
8922 HI, so we need to look further. */
8931 /* Get the mode of the type being modified. */
8942 {
8945 }
8948 {
8951 }
8954 {
8957 }
8959 /* Calculate how many units fit in the vector. */
8962 {
8965 }
8969 /* Build back pointers if needed. */
8973 }
8975 /* Handle the "nonnull" attribute. */
8976 static tree
8980 {
8984 /* If no arguments are specified, all pointer arguments should be
8985 non-null. Verify a full prototype is given so that the arguments
8986 will have the correct types when we actually check them later. */
8988 {
8990 {
8993 }
8995 }
8997 /* Argument list specified. Verify that each argument number references
8998 a pointer argument. */
9000 {
9009 {
9014 }
9017 {
9018 function_args_iterator iter;
9019 tree argument;
9023 {
9027 }
9031 {
9036 }
9039 {
9044 }
9045 }
9046 }
9049 }
9051 /* Check the argument list of a function call for null in argument slots
9052 that are marked as requiring a non-null pointer argument. The NARGS
9053 arguments are passed in the array ARGARRAY.
9054 */
9056 static void
9058 {
9059 tree a;
9067 /* See if any of the nonnull attributes has no arguments. If so,
9068 then every pointer argument is checked (in which case the check
9069 for pointer type is done in check_nonnull_arg). */
9071 do
9079 else
9080 {
9081 /* Walk the argument list. If we encounter an argument number we
9082 should check for non-null, do it. */
9084 {
9086 {
9090 }
9095 }
9096 }
9097 }
9099 /* Check that the Nth argument of a function call (counting backwards
9100 from the end) is a (pointer)0. The NARGS arguments are passed in the
9101 array ARGARRAY. */
9103 static void
9105 {
9109 {
9112 tree sentinel;
9113 function_args_iterator iter;
9114 tree t;
9116 /* Skip over the named arguments. */
9118 {
9121 len++;
9122 }
9125 {
9128 }
9130 /* The sentinel must be one of the varargs, i.e.
9131 in position >= the number of fixed arguments. */
9133 {
9137 }
9139 /* Validate the sentinel. */
9143 /* Although __null (in C++) is only an integer we allow it
9144 nevertheless, as we are guaranteed that it's exactly
9145 as wide as a pointer, and we don't want to force
9146 users to cast the NULL they have written there.
9147 We warn with -Wstrict-null-sentinel, though. */
9150 }
9151 }
9153 /* Helper for check_function_nonnull; given a list of operands which
9154 must be non-null in ARGS, determine if operand PARAM_NUM should be
9155 checked. */
9157 static bool
9159 {
9163 {
9170 }
9172 }
9174 /* Check that the function argument PARAM (which is operand number
9175 PARAM_NUM) is non-null. This is called by check_function_nonnull
9176 via check_function_arguments_recurse. */
9178 static void
9181 {
9182 /* Just skip checking the argument if it's not a pointer. This can
9183 happen if the "nonnull" attribute was given without an operand
9184 list (which means to check every pointer argument). */
9192 }
9194 /* Helper for nonnull attribute handling; fetch the operand number
9195 from the attribute argument list. */
9197 static bool
9199 {
9200 /* Verify the arg number is a small constant. */
9202 {
9205 }
9206 else
9208 }
9210 /* Handle a "nothrow" attribute; arguments as in
9211 struct attribute_spec.handler. */
9213 static tree
9216 {
9219 /* ??? TODO: Support types. */
9220 else
9221 {
9224 }
9227 }
9229 /* Handle a "cleanup" attribute; arguments as in
9230 struct attribute_spec.handler. */
9232 static tree
9235 {
9239 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9240 for global destructors in C++. This requires infrastructure that
9241 we don't have generically at the moment. It's also not a feature
9242 we'd be missing too much, since we do have attribute constructor. */
9244 {
9248 }
9250 /* Verify that the argument is a function in scope. */
9251 /* ??? We could support pointers to functions here as well, if
9252 that was considered desirable. */
9255 {
9259 }
9262 {
9266 }
9268 /* That the function has proper type is checked with the
9269 eventual call to build_function_call. */
9272 }
9274 /* Handle a "warn_unused_result" attribute. No special handling. */
9276 static tree
9280 {
9281 /* Ignore the attribute for functions not returning any value. */
9283 {
9286 }
9289 }
9291 /* Handle a "sentinel" attribute. */
9293 static tree
9296 {
9298 {
9302 }
9303 else
9304 {
9306 {
9310 }
9311 }
9314 {
9322 {
9326 }
9327 else
9328 {
9330 {
9334 }
9335 }
9336 }
9339 }
9341 /* Handle a "type_generic" attribute. */
9343 static tree
9347 {
9348 /* Ensure we have a function type. */
9351 /* Ensure we have a variadic function. */
9355 }
9357 /* Handle a "target" attribute. */
9359 static tree
9362 {
9363 /* Ensure we have a function type. */
9365 {
9368 }
9370 flags))
9374 }
9376 /* Arguments being collected for optimization. */
9381 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9382 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9383 false for #pragma GCC optimize. */
9385 bool
9387 {
9395 tree ap;
9397 /* Build up argv vector. Just in case the string is stored away, use garbage
9398 collected strings. */
9403 {
9407 {
9411 }
9414 {
9415 /* Split string into multiple substrings. */
9423 {
9430 {
9434 }
9435 else
9436 {
9439 }
9443 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9444 options. */
9446 {
9451 else
9455 }
9458 {
9461 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9462 itself is -Os, and any other switch begins with a -f. */
9468 }
9473 }
9475 }
9476 }
9486 /* Now parse the options. */
9496 /* Don't allow changing -fstrict-aliasing. */
9501 }
9503 /* For handling "optimize" attribute. arguments as in
9504 struct attribute_spec.handler. */
9506 static tree
9509 {
9510 /* Ensure we have a function type. */
9512 {
9515 }
9516 else
9517 {
9521 /* Save current options. */
9524 /* If we previously had some optimization options, use them as the
9525 default. */
9530 /* Parse options, and update the vector. */
9535 /* Restore current options. */
9537 }
9540 }
9542 /* Handle a "no_split_stack" attribute. */
9544 static tree
9549 {
9553 {
9557 }
9559 {
9563 }
9566 }
9568 /* Handle a "returns_nonnull" attribute; arguments as in
9569 struct attribute_spec.handler. */
9571 static tree
9574 {
9575 // Even without a prototype we still have a return type we can check.
9577 {
9580 }
9582 }
9584 /* Handle a "designated_init" attribute; arguments as in
9585 struct attribute_spec.handler. */
9587 static tree
9590 {
9592 {
9595 }
9597 }
9599 \f
9600 /* Check for valid arguments being passed to a function with FNTYPE.
9601 There are NARGS arguments in the array ARGARRAY. */
9602 void
9604 {
9605 /* Check for null being passed in a pointer argument that must be
9606 non-null. We also need to do this if format checking is enabled. */
9611 /* Check for errors in format strings. */
9618 }
9620 /* Generic argument checking recursion routine. PARAM is the argument to
9621 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9622 once the argument is resolved. CTX is context for the callback. */
9623 void
9628 {
9632 {
9633 /* Strip coercion. */
9637 }
9640 {
9642 tree attrs;
9645 /* See if this is a call to a known internationalization function
9646 that modifies a format arg. Such a function may have multiple
9647 format_arg attributes (for example, ngettext). */
9650 attrs;
9653 {
9654 tree inner_arg;
9655 tree format_num_expr;
9658 call_expr_arg_iterator iter;
9660 /* Extract the argument number, which was previously checked
9661 to be valid. */
9670 {
9675 }
9676 }
9678 /* If we found a format_arg attribute and did a recursive check,
9679 we are done with checking this argument. Otherwise, we continue
9680 and this will be considered a non-literal. */
9683 }
9686 {
9687 /* Check both halves of the conditional expression. */
9693 }
9696 }
9698 /* Checks for a builtin function FNDECL that the number of arguments
9699 NARGS against the required number REQUIRED and issues an error if
9700 there is a mismatch. Returns true if the number of arguments is
9701 correct, otherwise false. */
9703 static bool
9705 {
9707 {
9711 }
9713 {
9717 }
9719 }
9721 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9722 Returns false if there was an error, otherwise true. */
9724 bool
9726 {
9732 {
9742 {
9744 {
9748 }
9750 }
9760 {
9767 {
9771 }
9773 }
9778 {
9783 {
9787 }
9790 {
9792 fndecl);
9794 }
9796 }
9801 {
9803 {
9806 }
9808 }
9815 {
9819 {
9823 }
9826 {
9830 }
9832 }
9837 }
9838 }
9840 /* Function to help qsort sort FIELD_DECLs by name order. */
9842 int
9844 {
9849 /* A nontype is "greater" than a type. */
9858 }
9861 gt_pointer_operator new_value;
9865 /* This routine compares two fields like field_decl_cmp but using the
9866 pointer operator in resort_data. */
9868 static int
9870 {
9875 /* A nontype is "greater" than a type. */
9881 {
9888 }
9890 }
9892 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9894 void
9897 gt_pointer_operator new_value,
9899 {
9904 resort_field_decl_cmp);
9905 }
9907 /* Subroutine of c_parse_error.
9908 Return the result of concatenating LHS and RHS. RHS is really
9909 a string literal, its first character is indicated by RHS_START and
9910 RHS_SIZE is its length (including the terminating NUL character).
9912 The caller is responsible for deleting the returned pointer. */
9916 {
9922 }
9924 /* Issue the error given by GMSGID, indicating that it occurred before
9925 TOKEN, which had the associated VALUE. */
9927 void
9930 {
9931 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9941 {
9946 {
9959 }
9963 else
9969 }
9991 {
9996 }
10004 {
10009 }
10010 else
10014 {
10017 }
10018 #undef catenate_messages
10019 }
10021 /* Return the gcc option code associated with the reason for a cpp
10022 message, or 0 if none. */
10024 static int
10026 {
10030 {
10033 }
10035 }
10037 /* Callback from cpp_error for PFILE to print diagnostics from the
10038 preprocessor. The diagnostic is of type LEVEL, with REASON set
10039 to the reason code if LEVEL is represents a warning, at location
10040 LOCATION unless this is after lexing and the compiler's location
10041 should be used instead, with column number possibly overridden by
10042 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10043 the arguments. Returns true if a diagnostic was emitted, false
10044 otherwise. */
10046 bool
10050 {
10051 diagnostic_info diagnostic;
10052 diagnostic_t dlevel;
10057 {
10062 /* Fall through. */
10087 }
10100 }
10102 /* Convert a character from the host to the target execution character
10103 set. cpplib handles this, mostly. */
10105 HOST_WIDE_INT
10107 {
10108 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10109 zero-extended under -fno-signed-char. cpplib insists that characters
10110 and character constants are always unsigned. Hence we must convert
10111 back and forth. */
10119 else
10121 }
10123 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10124 references with an INDIRECT_REF of a constant at the bottom; much like the
10125 traditional rendering of offsetof as a macro. Return the folded result. */
10127 tree
10129 {
10133 {
10149 {
10152 }
10162 {
10166 }
10179 /* Check if the offset goes beyond the upper bound of the array. */
10181 {
10187 {
10191 {
10192 tree v;
10199 {
10207 }
10208 /* Don't warn if the array might be considered a poor
10209 man's flexible array member with a very permissive
10210 definition thereof. */
10214 "index %E denotes an offset "
10217 }
10218 }
10219 }
10226 /* Handle static members of volatile structs. */
10233 }
10236 }
10238 /* Likewise, but convert it to the return type of offsetof. */
10240 tree
10242 {
10244 }
10246 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10247 expression, because B will always be true. */
10249 void
10251 {
10254 "the omitted middle operand in ?: will always be %<true%>, "
10256 }
10258 /* Give an error for storing into ARG, which is 'const'. USE indicates
10259 how ARG was being used. */
10261 void
10263 {
10266 /* Using this macro rather than (for example) arrays of messages
10267 ensures that all the format strings are checked at compile
10268 time. */
10269 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10270 : (use == lv_increment ? (I) \
10271 : (use == lv_decrement ? (D) : (AS))))
10273 {
10284 else
10290 }
10296 arg);
10302 arg);
10304 {
10314 arg);
10315 }
10321 arg);
10322 else
10327 arg);
10328 }
10330 /* Print an error message for an invalid lvalue. USE says
10331 how the lvalue is being used and so selects the error message. LOC
10332 is the location for the error. */
10334 void
10336 {
10338 {
10356 }
10357 }
10359 /* Print an error message for an invalid indirection of type TYPE.
10360 ERRSTRING is the name of the operator for the indirection. */
10362 void
10364 {
10366 {
10374 type);
10379 type);
10384 type);
10389 type);
10394 type);
10398 }
10399 }
10400 \f
10401 /* *PTYPE is an incomplete array. Complete it with a domain based on
10402 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10403 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10404 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10406 int
10408 {
10416 {
10418 {
10419 int eltsize
10422 }
10424 {
10428 {
10432 }
10433 else
10434 {
10435 tree curindex;
10446 {
10450 else
10451 {
10453 {
10454 /* Since we treat size types now as ordinary
10455 unsigned types, we need an explicit overflow
10456 check. */
10460 }
10462 size_one_node);
10463 }
10466 }
10468 {
10472 }
10473 }
10474 }
10475 else
10476 {
10477 /* Make an error message unless that happened already. */
10480 }
10481 }
10482 else
10483 {
10487 }
10494 else
10497 /* Using build_distinct_type_copy and modifying things afterward instead
10498 of using build_array_type to create a new type preserves all of the
10499 TYPE_LANG_FLAG_? bits that the front end may have set. */
10507 /* Make sure we have the canonical MAIN_TYPE. */
10510 hashcode);
10513 /* Fix the canonical type. */
10523 else
10528 else
10534 {
10536 /* If we proceed with the array type as it is, we'll eventually
10537 crash in tree_to_[su]hwi(). */
10539 }
10543 }
10545 /* Like c_mark_addressable but don't check register qualifier. */
10546 void
10548 {
10554 }
10557 \f
10558 /* Used to help initialize the builtin-types.def table. When a type of
10559 the correct size doesn't exist, use error_mark_node instead of NULL.
10560 The later results in segfaults even when a decl using the type doesn't
10561 get invoked. */
10563 tree
10565 {
10568 }
10570 /* A helper function for resolve_overloaded_builtin in resolving the
10571 overloaded __sync_ builtins. Returns a positive power of 2 if the
10572 first operand of PARAMS is a pointer to a supported data type.
10573 Returns 0 if an error is encountered. */
10575 static int
10577 {
10578 tree type;
10582 {
10585 }
10589 {
10590 /* Force array-to-pointer decay for C++. */
10594 }
10606 incompatible:
10609 }
10611 /* A helper function for resolve_overloaded_builtin. Adds casts to
10612 PARAMS to make arguments match up with those of FUNCTION. Drops
10613 the variadic arguments at the end. Returns false if some error
10614 was encountered; true on success. */
10616 static bool
10619 {
10620 function_args_iterator iter;
10621 tree ptype;
10625 /* We've declared the implementation functions to use "volatile void *"
10626 as the pointer parameter, so we shouldn't get any complaints from the
10627 call to check_function_arguments what ever type the user used. */
10632 /* For the rest of the values, we need to cast these to FTYPE, so that we
10633 don't get warnings for passing pointer types, etc. */
10636 {
10640 /* XXX void_type_node belies the abstraction. */
10646 {
10649 }
10651 /* Only convert parameters if arg_type is unsigned integer type with
10652 new format sync routines, i.e. don't attempt to convert pointer
10653 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10654 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10655 kinds). */
10657 {
10658 /* Ideally for the first conversion we'd use convert_for_assignment
10659 so that we get warnings for anything that doesn't match the pointer
10660 type. This isn't portable across the C and C++ front ends atm. */
10665 }
10668 }
10670 /* __atomic routines are not variadic. */
10672 {
10675 }
10677 /* The definition of these primitives is variadic, with the remaining
10678 being "an optional list of variables protected by the memory barrier".
10679 No clue what that's supposed to mean, precisely, but we consider all
10680 call-clobbered variables to be protected so we're safe. */
10684 }
10686 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10687 RESULT to make it match the type of the first pointer argument in
10688 PARAMS. */
10690 static tree
10692 {
10697 /* New format doesn't require casting unless the types are the same size. */
10700 else
10702 }
10704 /* This function verifies the PARAMS to generic atomic FUNCTION.
10705 It returns the size if all the parameters are the same size, otherwise
10706 0 is returned if the parameters are invalid. */
10708 static int
10711 {
10716 tree type_0;
10718 /* Determine the parameter makeup. */
10720 {
10736 }
10739 {
10742 }
10744 /* Get type of first parameter, and determine its size. */
10747 {
10748 /* Force array-to-pointer decay for C++. */
10752 }
10754 {
10756 function);
10758 }
10760 /* Types must be compile time constant sizes. */
10762 {
10765 function);
10767 }
10771 /* Zero size objects are not allowed. */
10773 {
10776 function);
10778 }
10780 /* Check each other parameter is a pointer and the same size. */
10782 {
10785 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10789 {
10791 function);
10793 }
10797 {
10799 function);
10801 }
10802 }
10804 /* Check memory model parameters for validity. */
10806 {
10809 {
10812 {
10815 function);
10816 }
10817 }
10818 else
10820 {
10822 function);
10824 }
10825 }
10828 }
10831 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10832 at the beginning of the parameter list PARAMS representing the size of the
10833 objects. This is to match the library ABI requirement. LOC is the location
10834 of the function call.
10835 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10836 returned to allow the external call to be constructed. */
10838 static tree
10841 {
10842 tree size_node;
10844 /* Insert a SIZE_T parameter as the first param. If there isn't
10845 enough space, allocate a new vector and recursively re-build with that. */
10847 {
10850 tree f;
10860 }
10862 /* Add the size parameter and leave as a function call for processing. */
10866 }
10869 /* Return whether atomic operations for naturally aligned N-byte
10870 arguments are supported, whether inline or through libatomic. */
10871 static bool
10873 {
10875 {
10887 }
10888 }
10890 /* This will process an __atomic_exchange function call, determine whether it
10891 needs to be mapped to the _N variation, or turned into a library call.
10892 LOC is the location of the builtin call.
10893 FUNCTION is the DECL that has been invoked;
10894 PARAMS is the argument list for the call. The return value is non-null
10895 TRUE is returned if it is translated into the proper format for a call to the
10896 external library, and NEW_RETURN is set the tree for that function.
10897 FALSE is returned if processing for the _N variation is required, and
10898 NEW_RETURN is set to the the return value the result is copied into. */
10899 static bool
10902 {
10907 /* Size of 0 is an error condition. */
10909 {
10912 }
10914 /* If not a lock-free size, change to the library generic format. */
10916 {
10919 }
10921 /* Otherwise there is a lockfree match, transform the call from:
10922 void fn(T* mem, T* desired, T* return, model)
10923 into
10924 *return = (T) (fn (In* mem, (In) *desired, model)) */
10931 /* Create pointer to appropriate size. */
10935 /* Convert object pointer to required type. */
10938 /* Convert new value to required type, and dereference it. */
10943 /* Move memory model to the 3rd position, and end param list. */
10947 /* Convert return pointer and dereference it for later assignment. */
10951 }
10954 /* This will process an __atomic_compare_exchange function call, determine
10955 whether it needs to be mapped to the _N variation, or turned into a lib call.
10956 LOC is the location of the builtin call.
10957 FUNCTION is the DECL that has been invoked;
10958 PARAMS is the argument list for the call. The return value is non-null
10959 TRUE is returned if it is translated into the proper format for a call to the
10960 external library, and NEW_RETURN is set the tree for that function.
10961 FALSE is returned if processing for the _N variation is required. */
10963 static bool
10967 {
10972 /* Size of 0 is an error condition. */
10974 {
10977 }
10979 /* If not a lock-free size, change to the library generic format. */
10981 {
10982 /* The library generic format does not have the weak parameter, so
10983 remove it from the param list. Since a parameter has been removed,
10984 we can be sure that there is room for the SIZE_T parameter, meaning
10985 there will not be a recursive rebuilding of the parameter list, so
10986 there is no danger this will be done twice. */
10988 {
10992 }
10995 }
10997 /* Otherwise, there is a match, so the call needs to be transformed from:
10998 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10999 into
11000 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11006 /* Create pointer to appropriate size. */
11010 /* Convert object pointer to required type. */
11014 /* Convert expected pointer to required type. */
11018 /* Convert desired value to required type, and dereference it. */
11023 /* The rest of the parameters are fine. NULL means no special return value
11024 processing.*/
11027 }
11030 /* This will process an __atomic_load function call, determine whether it
11031 needs to be mapped to the _N variation, or turned into a library call.
11032 LOC is the location of the builtin call.
11033 FUNCTION is the DECL that has been invoked;
11034 PARAMS is the argument list for the call. The return value is non-null
11035 TRUE is returned if it is translated into the proper format for a call to the
11036 external library, and NEW_RETURN is set the tree for that function.
11037 FALSE is returned if processing for the _N variation is required, and
11038 NEW_RETURN is set to the the return value the result is copied into. */
11040 static bool
11043 {
11048 /* Size of 0 is an error condition. */
11050 {
11053 }
11055 /* If not a lock-free size, change to the library generic format. */
11057 {
11060 }
11062 /* Otherwise, there is a match, so the call needs to be transformed from:
11063 void fn(T* mem, T* return, model)
11064 into
11065 *return = (T) (fn ((In *) mem, model)) */
11071 /* Create pointer to appropriate size. */
11075 /* Convert object pointer to required type. */
11079 /* Move memory model to the 2nd position, and end param list. */
11083 /* Convert return pointer and dereference it for later assignment. */
11087 }
11090 /* This will process an __atomic_store function call, determine whether it
11091 needs to be mapped to the _N variation, or turned into a library call.
11092 LOC is the location of the builtin call.
11093 FUNCTION is the DECL that has been invoked;
11094 PARAMS is the argument list for the call. The return value is non-null
11095 TRUE is returned if it is translated into the proper format for a call to the
11096 external library, and NEW_RETURN is set the tree for that function.
11097 FALSE is returned if processing for the _N variation is required, and
11098 NEW_RETURN is set to the the return value the result is copied into. */
11100 static bool
11103 {
11108 /* Size of 0 is an error condition. */
11110 {
11113 }
11115 /* If not a lock-free size, change to the library generic format. */
11117 {
11120 }
11122 /* Otherwise, there is a match, so the call needs to be transformed from:
11123 void fn(T* mem, T* value, model)
11124 into
11125 fn ((In *) mem, (In) *value, model) */
11130 /* Create pointer to appropriate size. */
11134 /* Convert object pointer to required type. */
11138 /* Convert new value to required type, and dereference it. */
11143 /* The memory model is in the right spot already. Return is void. */
11147 }
11150 /* Some builtin functions are placeholders for other expressions. This
11151 function should be called immediately after parsing the call expression
11152 before surrounding code has committed to the type of the expression.
11154 LOC is the location of the builtin call.
11156 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11157 PARAMS is the argument list for the call. The return value is non-null
11158 when expansion is complete, and null if normal processing should
11159 continue. */
11161 tree
11164 {
11170 {
11176 else
11180 }
11182 /* Handle BUILT_IN_NORMAL here. */
11184 {
11189 {
11190 /* Handle these 4 together so that they can fall through to the next
11191 case if the call is transformed to an _N variant. */
11193 {
11195 {
11199 /* Change to the _N variant. */
11202 }
11205 {
11207 params,
11210 /* Change to the _N variant. */
11213 }
11215 {
11219 /* Change to the _N variant. */
11222 }
11224 {
11228 /* Change to the _N variant. */
11231 }
11234 }
11235 /* Fallthrough to the normal processing. */
11236 }
11253 {
11255 /* Fallthru for parameter processing. */
11256 }
11273 {
11284 orig_format))
11289 NULL);
11297 /* If new_return is set, assign function to that expr and cast the
11298 result to void since the generic interface returned void. */
11300 {
11301 /* Cast function result from I{1,2,4,8,16} to the required type. */
11304 result);
11308 }
11310 }
11314 }
11315 }
11317 /* vector_types_compatible_elements_p is used in type checks of vectors
11318 values used as operands of binary operators. Where it returns true, and
11319 the other checks of the caller succeed (being vector types in he first
11320 place, and matching number of elements), we can just treat the types
11321 as essentially the same.
11322 Contrast with vector_targets_convertible_p, which is used for vector
11323 pointer types, and vector_types_convertible_p, which will allow
11324 language-specific matches under the control of flag_lax_vector_conversions,
11325 and might still require a conversion. */
11326 /* True if vector types T1 and T2 can be inputs to the same binary
11327 operator without conversion.
11328 We don't check the overall vector size here because some of our callers
11329 want to give different error messages when the vectors are compatible
11330 except for the element count. */
11332 bool
11334 {
11347 /* Equality works here because c_common_signed_type uses
11348 TYPE_MAIN_VARIANT. */
11356 }
11358 /* Check for missing format attributes on function pointers. LTYPE is
11359 the new type or left-hand side type. RTYPE is the old type or
11360 right-hand side type. Returns TRUE if LTYPE is missing the desired
11361 attribute. */
11363 bool
11365 {
11367 tree ra;
11373 {
11374 tree la;
11379 }
11380 else
11382 }
11384 /* Subscripting with type char is likely to lose on a machine where
11385 chars are signed. So warn on any machine, but optionally. Don't
11386 warn for unsigned char since that type is safe. Don't warn for
11387 signed char because anyone who uses that must have done so
11388 deliberately. Furthermore, we reduce the false positive load by
11389 warning only for non-constant value of type char. */
11391 void
11393 {
11398 }
11400 /* Implement -Wparentheses for the unexpected C precedence rules, to
11401 cover cases like x + y << z which readers are likely to
11402 misinterpret. We have seen an expression in which CODE is a binary
11403 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11404 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11405 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11406 expression was not formed using a binary or unary operator, or it
11407 was enclosed in parentheses. */
11409 void
11413 {
11417 /* This macro tests that the expression ARG with original tree code
11418 CODE appears to be a boolean expression. or the result of folding a
11419 boolean expression. */
11420 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11421 (truth_value_p (TREE_CODE (ARG)) \
11422 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11424 || ((CODE) != INTEGER_CST \
11425 && (integer_onep (ARG) || integer_zerop (ARG))))
11428 {
11477 /* Check cases like x|y==z */
11484 /* Check cases like !x | y */
11488 "suggest parentheses around operand of "
11501 /* Check cases like x^y==z */
11523 /* Check cases like x&y==z */
11530 /* Check cases like !x & y */
11534 "suggest parentheses around operand of "
11557 {
11562 "comparisons like %<X<=Y<=Z%> do not "
11568 "comparisons like %<X<=Y<=Z%> do not "
11570 }
11572 }
11573 #undef NOT_A_BOOLEAN_EXPR_P
11574 }
11576 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11578 void
11580 {
11582 {
11585 else
11587 }
11588 }
11590 /* Warn for division by zero according to the value of DIVISOR. LOC
11591 is the location of the division operator. */
11593 void
11595 {
11596 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11597 about division by zero. Do not issue a warning if DIVISOR has a
11598 floating-point type, since we consider 0.0/0.0 a valid way of
11599 generating a NaN. */
11603 }
11605 /* Subroutine of build_binary_op. Give warnings for comparisons
11606 between signed and unsigned quantities that may fail. Do the
11607 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11608 so that casts will be considered, but default promotions won't
11609 be.
11611 LOCATION is the location of the comparison operator.
11613 The arguments of this function map directly to local variables
11614 of build_binary_op. */
11616 void
11621 {
11626 /* In C++, check for comparison of different enum types. */
11632 {
11636 }
11638 /* Do not warn if the comparison is being done in a signed type,
11639 since the signed type will only be chosen if it can represent
11640 all the values of the unsigned type. */
11643 /* Do not warn if both operands are unsigned. */
11646 else
11647 {
11653 else
11661 /* Do not warn if the signed quantity is an unsuffixed integer
11662 literal (or some static constant expression involving such
11663 literals or a conditional expression involving such literals)
11664 and it is non-negative. */
11667 /* Do not warn if the comparison is an equality operation, the
11668 unsigned quantity is an integral constant, and it would fit
11669 in the result if the result were signed. */
11674 /* In C, do not warn if the unsigned quantity is an enumeration
11675 constant and its maximum value would fit in the result if the
11676 result were signed. */
11682 else
11684 OPT_Wsign_compare,
11686 }
11688 /* Warn if two unsigned values are being compared in a size larger
11689 than their original size, and one (and only one) is the result of
11690 a `~' operator. This comparison will always fail.
11692 Also warn if one operand is a constant, and the constant does not
11693 have all bits set that are set in the ~ operand when it is
11694 extended. */
11701 {
11708 {
11709 tree primop;
11715 {
11719 }
11720 else
11721 {
11725 }
11730 {
11733 {
11737 else
11740 }
11741 }
11742 }
11750 }
11751 }
11753 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11754 type via c_common_type. If -Wdouble-promotion is in use, and the
11755 conditions for warning have been met, issue a warning. GMSGID is
11756 the warning message. It must have two %T specifiers for the type
11757 that was converted (generally "float") and the type to which it was
11758 converted (generally "double), respectively. LOC is the location
11759 to which the awrning should refer. */
11761 void
11764 {
11765 tree source_type;
11769 /* If the conversion will not occur at run-time, there is no need to
11770 warn about it. */
11782 else
11785 }
11787 /* Setup a TYPE_DECL node as a typedef representation.
11789 X is a TYPE_DECL for a typedef statement. Create a brand new
11790 ..._TYPE node (which will be just a variant of the existing
11791 ..._TYPE node with identical properties) and then install X
11792 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11794 The whole point here is to end up with a situation where each
11795 and every ..._TYPE node the compiler creates will be uniquely
11796 associated with AT MOST one node representing a typedef name.
11797 This way, even though the compiler substitutes corresponding
11798 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11799 early on, later parts of the compiler can always do the reverse
11800 translation and get back the corresponding typedef name. For
11801 example, given:
11803 typedef struct S MY_TYPE;
11804 MY_TYPE object;
11806 Later parts of the compiler might only know that `object' was of
11807 type `struct S' if it were not for code just below. With this
11808 code however, later parts of the compiler see something like:
11810 struct S' == struct S
11811 typedef struct S' MY_TYPE;
11812 struct S' object;
11814 And they can then deduce (from the node for type struct S') that
11815 the original object declaration was:
11817 MY_TYPE object;
11819 Being able to do this is important for proper support of protoize,
11820 and also for generating precise symbolic debugging information
11821 which takes full account of the programmer's (typedef) vocabulary.
11823 Obviously, we don't want to generate a duplicate ..._TYPE node if
11824 the TYPE_DECL node that we are now processing really represents a
11825 standard built-in type. */
11827 void
11829 {
11833 {
11836 }
11839 {
11847 }
11848 }
11850 /* Record the types used by the current global variable declaration
11851 being parsed, so that we can decide later to emit their debug info.
11852 Those types are in types_used_by_cur_var_decl, and we are going to
11853 store them in the types_used_by_vars_hash hash table.
11854 DECL is the declaration of the global variable that has been parsed. */
11856 void
11858 {
11862 {
11865 }
11866 }
11868 /* If DECL is a typedef that is declared in the current function,
11869 record it for the purpose of -Wunused-local-typedefs. */
11871 void
11873 {
11878 /* if this is not a locally defined typedef then we are not
11879 interested. */
11886 }
11888 /* If T is a TYPE_DECL declared locally, mark it as used. */
11890 void
11892 {
11897 }
11899 /* Warn if there are some unused locally defined typedefs in the
11900 current function. */
11902 void
11904 {
11906 tree decl;
11907 /* The number of times we have emitted -Wunused-local-typedefs
11908 warnings. If this is different from errorcount, that means some
11909 unrelated errors have been issued. In which case, we'll avoid
11910 emitting "unused-local-typedefs" warnings. */
11922 {
11926 OPT_Wunused_local_typedefs,
11929 }
11932 }
11934 /* Warn about boolean expression compared with an integer value different
11935 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11936 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11937 are the operands of the comparison. The caller must ensure that
11938 either operand is a boolean expression. */
11940 void
11942 tree op1)
11943 {
11953 {
11961 else
11964 }
11966 {
11967 /* If the non-constant operand isn't of a boolean type, we
11968 don't want to warn here. */
11970 /* Handle booleans promoted to integers. */
11978 /* Do some magic to get the right diagnostics. */
11987 }
11988 }
11990 /* The C and C++ parsers both use vectors to hold function arguments.
11991 For efficiency, we keep a cache of unused vectors. This is the
11992 cache. */
11997 /* Return a new vector from the cache. If the cache is empty,
11998 allocate a new vector. These vectors are GC'ed, so it is OK if the
11999 pointer is not released.. */
12003 {
12006 else
12007 {
12008 /* Passing 0 to vec::alloc returns NULL, and our callers require
12009 that we always return a non-NULL value. The vector code uses
12010 4 when growing a NULL vector, so we do too. */
12014 }
12015 }
12017 /* Release a vector of trees back to the cache. */
12019 void
12021 {
12023 {
12026 }
12027 }
12029 /* Get a new tree vector holding a single tree. */
12033 {
12037 }
12039 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12043 {
12048 }
12050 /* Get a new tree vector which is a copy of an existing one. */
12054 {
12057 tree t;
12064 }
12066 /* Return true if KEYWORD starts a type specifier. */
12068 bool
12070 {
12072 {
12106 }
12107 }
12109 /* Return true if KEYWORD names a type qualifier. */
12111 bool
12113 {
12115 {
12123 }
12124 }
12126 /* Return true if KEYWORD names a storage class specifier.
12128 RID_TYPEDEF is not included in this list despite `typedef' being
12129 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12130 such for syntactic convenience only. */
12132 bool
12134 {
12136 {
12146 }
12147 }
12149 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12151 static bool
12153 {
12155 {
12163 }
12164 }
12166 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12167 declaration-specifier (C99 6.7). */
12169 bool
12171 {
12178 {
12185 }
12186 }
12188 /* Initialize language-specific-bits of tree_contains_struct. */
12190 void
12192 {
12196 }
12198 /* Build a user-defined numeric literal out of an integer constant type VALUE
12199 with identifier SUFFIX. */
12201 tree
12204 {
12211 }
12213 /* For vector[index], convert the vector to a
12214 pointer of the underlying type. Return true if the resulting
12215 ARRAY_REF should not be an lvalue. */
12217 bool
12220 {
12223 {
12225 tree type1;
12234 {
12239 {
12242 *vecp
12245 non_const);
12246 }
12247 else
12252 }
12253 else
12260 {
12261 /* If the original vector isn't declared may_alias and it
12262 isn't a bare vector look if the subscripting would
12263 alias the vector we subscript, and if not, force ref-all. */
12269 }
12273 }
12275 }
12277 /* Determine which of the operands, if any, is a scalar that needs to be
12278 converted to a vector, for the range of operations. */
12279 enum stv_conv
12282 {
12291 {
12292 /* Most GENERIC binary expressions require homogeneous arguments.
12293 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12294 argument that is a vector and a second one that is a scalar, so
12295 we never return stv_secondarg for them. */
12300 {
12302 {
12307 }
12308 else
12310 }
12317 /* ... fall through ... */
12338 /* What about UNLT_EXPR? */
12340 {
12341 tree tmp;
12343 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12346 }
12350 {
12352 {
12357 }
12359 }
12361 /* Allow integer --> real conversion if safe. */
12365 {
12367 {
12372 }
12374 }
12377 }
12380 }
12382 /* Return true iff ALIGN is an integral constant that is a fundamental
12383 alignment, as defined by [basic.align] in the c++-11
12384 specifications.
12386 That is:
12388 [A fundamental alignment is represented by an alignment less than or
12389 equal to the greatest alignment supported by the implementation
12390 in all contexts, which is equal to
12391 alignof(max_align_t)]. */
12393 bool
12395 {
12398 }
12400 /* Return true if T is a pointer to a zero-sized aggregate. */
12402 bool
12404 {
12409 }