| blob | 3f12cadf2cdedaba7bfde941287f253e8b9d5988 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2014 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/>. */
67 /* The following symbols are subsumed in the c_global_trees array, and
68 listed here individually for documentation purposes.
70 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
72 tree short_integer_type_node;
73 tree long_integer_type_node;
74 tree long_long_integer_type_node;
76 tree short_unsigned_type_node;
77 tree long_unsigned_type_node;
78 tree long_long_unsigned_type_node;
80 tree truthvalue_type_node;
81 tree truthvalue_false_node;
82 tree truthvalue_true_node;
84 tree ptrdiff_type_node;
86 tree unsigned_char_type_node;
87 tree signed_char_type_node;
88 tree wchar_type_node;
90 tree char16_type_node;
91 tree char32_type_node;
93 tree float_type_node;
94 tree double_type_node;
95 tree long_double_type_node;
97 tree complex_integer_type_node;
98 tree complex_float_type_node;
99 tree complex_double_type_node;
100 tree complex_long_double_type_node;
102 tree dfloat32_type_node;
103 tree dfloat64_type_node;
104 tree_dfloat128_type_node;
106 tree intQI_type_node;
107 tree intHI_type_node;
108 tree intSI_type_node;
109 tree intDI_type_node;
110 tree intTI_type_node;
112 tree unsigned_intQI_type_node;
113 tree unsigned_intHI_type_node;
114 tree unsigned_intSI_type_node;
115 tree unsigned_intDI_type_node;
116 tree unsigned_intTI_type_node;
118 tree widest_integer_literal_type_node;
119 tree widest_unsigned_literal_type_node;
121 Nodes for types `void *' and `const void *'.
123 tree ptr_type_node, const_ptr_type_node;
125 Nodes for types `char *' and `const char *'.
127 tree string_type_node, const_string_type_node;
129 Type `char[SOMENUMBER]'.
130 Used when an array of char is needed and the size is irrelevant.
132 tree char_array_type_node;
134 Type `wchar_t[SOMENUMBER]' or something like it.
135 Used when a wide string literal is created.
137 tree wchar_array_type_node;
139 Type `char16_t[SOMENUMBER]' or something like it.
140 Used when a UTF-16 string literal is created.
142 tree char16_array_type_node;
144 Type `char32_t[SOMENUMBER]' or something like it.
145 Used when a UTF-32 string literal is created.
147 tree char32_array_type_node;
149 Type `int ()' -- used for implicit declaration of functions.
151 tree default_function_type;
153 A VOID_TYPE node, packaged in a TREE_LIST.
155 tree void_list_node;
157 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
158 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
159 VAR_DECLS, but C++ does.)
161 tree function_name_decl_node;
162 tree pretty_function_name_decl_node;
163 tree c99_function_name_decl_node;
165 Stack of nested function name VAR_DECLs.
167 tree saved_function_name_decls;
169 */
172 \f
173 /* Switches common to the C front ends. */
175 /* Nonzero means don't output line number information. */
179 /* Nonzero causes -E output not to be done, but directives such as
180 #define that have side effects are still obeyed. */
184 /* Nonzero means dump macros in some fashion. */
188 /* Nonzero means pass #include lines through to the output. */
192 /* Nonzero means process PCH files while preprocessing. */
196 /* The file name to which we should write a precompiled header, or
197 NULL if no header will be written in this compile. */
201 /* Nonzero if an ISO standard was selected. It rejects macros in the
202 user's namespace. */
205 /* C/ObjC language option variables. */
208 /* Nonzero means allow type mismatches in conditional expressions;
209 just make their values `void'. */
213 /* Nonzero means enable C89 Amendment 1 features. */
217 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
221 /* Nonzero means use the ISO C11 dialect of C. */
225 /* Nonzero means that we have builtin functions, and main is an int. */
230 /* ObjC language option variables. */
233 /* Tells the compiler that this is a special run. Do not perform any
234 compiling, instead we are to test some platform dependent features
235 and output a C header file with appropriate definitions. */
239 /* Tells the compiler what is the constant string class for ObjC. */
244 /* C++ language option variables. */
247 /* Nonzero means generate separate instantiation control files and
248 juggle them at link time. */
252 /* The C++ dialect being used. C++98 is the default. */
256 /* Maximum template instantiation depth. This limit exists to limit the
257 time it takes to notice excessively recursive template instantiations.
259 The default is lower than the 1024 recommended by the C++0x standard
260 because G++ runs out of stack before 1024 with highly recursive template
261 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
265 /* The elements of `ridpointers' are identifier nodes for the reserved
266 type names and storage classes. It is indexed by a RID_... value. */
271 /* Nonzero means don't warn about problems that occur when the code is
272 executed. */
275 /* Whether we are building a boolean conversion inside
276 convert_for_assignment, or some other late binary operation. If
277 build_binary_op is called for C (from code shared by C and C++) in
278 this case, then the operands have already been folded and the
279 result will not be folded again, so C_MAYBE_CONST_EXPR should not
280 be generated. */
283 /* Whether lexing has been completed, so subsequent preprocessor
284 errors should use the compiler's input_location. */
287 /* Information about how a function name is generated. */
288 struct fname_var_t
289 {
293 };
295 /* The three ways of getting then name of the current function. */
298 {
299 /* C99 compliant __func__, must be first. */
301 /* GCC __FUNCTION__ compliant. */
303 /* GCC __PRETTY_FUNCTION__ compliant. */
306 };
308 /* 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, decl_handler,
651 type_handler, affects_type_identity } */
653 handle_packed_decl_attribute,
659 /* FIXME: logically, noreturn attributes should be listed as
660 "false, true, true" and apply to function types. But implementing this
661 would require all the places in the compiler that use TREE_THIS_VOLATILE
662 on a decl to identify non-returning functions to be located and fixed
663 to check the function type instead. */
685 handle_unused_decl_attribute,
692 /* The same comments as for noreturn attributes apply to const ones. */
696 handle_transparent_union_decl_attribute,
707 handle_aligned_decl_attribute,
718 handle_no_instrument_function_attribute,
736 /* ??? These two attributes didn't make the transition from the
737 Intel language document to the multi-vendor language document. */
742 /* For internal use (marking of builtins) only. The name contains space
743 to prevent its usage in source code. */
747 handle_deprecated_decl_attribute,
752 handle_visibility_decl_attribute,
767 /* For internal use (marking of builtins) only. The name contains space
768 to prevent its usage in source code. */
779 handle_no_address_safety_analysis_attribute,
782 handle_no_sanitize_address_attribute,
785 handle_no_sanitize_undefined_attribute,
795 /* For internal use only. The leading '*' both prevents its usage in
796 source code and signals that it may be overridden by machine tables. */
801 /* For internal use (marking of builtins and runtime functions) only.
802 The name contains space to prevent its usage in source code. */
806 handle_warn_unused_decl_attribute,
830 };
832 /* Give the specifications for the format attributes, used by C and all
833 descendants.
835 All attributes referencing arguments should be additionally processed
836 in chkp_copy_function_type_adding_bounds for correct instrumentation
837 by Pointer Bounds Checker.
838 Current list of processed format attributes: format, format_arg. */
840 {
841 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
842 affects_type_identity } */
848 };
850 /* Return identifier for address space AS. */
854 {
858 }
860 /* Push current bindings for the function name VAR_DECLS. */
862 void
864 {
869 {
873 {
875 saved);
877 }
878 }
880 /* Normally they'll have been NULL, so only push if we've got a
881 stack, or they are non-NULL. */
883 saved_function_name_decls);
884 }
886 /* Finish up the current bindings, adding them into the current function's
887 statement tree. This must be done _before_ finish_stmt_tree is called.
888 If there is no current function, we must be at file scope and no statements
889 are involved. Pop the previous bindings. */
891 void
893 {
902 {
910 }
916 {
917 /* We had saved values, restore them. */
918 tree saved;
921 {
926 }
928 }
930 }
932 /* Return the text name of the current function, suitably prettified
933 by PRETTY_P. Return string must be freed by caller. */
937 {
944 {
947 }
960 {
963 }
966 }
968 /* Return the VAR_DECL for a const char array naming the current
969 function. If the VAR_DECL has not yet been created, create it
970 now. RID indicates how it should be formatted and IDENTIFIER_NODE
971 ID is its name (unfortunately C and C++ hold the RID values of
972 keywords in different places, so we can't derive RID from ID in
973 this language independent code. LOC is the location of the
974 function. */
976 tree
978 {
988 {
989 /* If a tree is built here, it would normally have the lineno of
990 the current statement. Later this tree will be moved to the
991 beginning of the function and this line number will be wrong.
992 To avoid this problem set the lineno to 0 here; that prevents
993 it from appearing in the RTL. */
994 tree stmts;
1002 saved_function_name_decls
1006 }
1011 }
1013 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1015 tree
1017 {
1022 /* Compute the number of elements, for the array type. */
1024 {
1027 }
1029 {
1032 }
1034 {
1037 }
1038 else
1039 {
1042 }
1044 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1045 limit in C++98 Annex B is very large (65536) and is not normative,
1046 so we do not diagnose it (warn_overlength_strings is forced off
1047 in c_common_post_options). */
1049 {
1053 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1054 separate the %d from the 'C'. 'ISO' should not be
1055 translated, but it may be moved after 'C%d' in languages
1056 where modifiers follow nouns. */
1058 "string length %qd is greater than the length %qd "
1061 }
1063 /* Create the array type for the string constant. The ISO C++
1064 standard says that a string literal has type `const char[N]' or
1065 `const wchar_t[N]'. We use the same logic when invoked as a C
1066 front-end with -Wwrite-strings.
1067 ??? We should change the type of an expression depending on the
1068 state of a warning flag. We should just be warning -- see how
1069 this is handled in the C++ front-end for the deprecated implicit
1070 conversion from string literals to `char*' or `wchar_t*'.
1072 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1073 array type being the unqualified version of that type.
1074 Therefore, if we are constructing an array of const char, we must
1075 construct the matching unqualified array type first. The C front
1076 end does not require this, but it does no harm, so we do it
1077 unconditionally. */
1088 }
1089 \f
1090 /* If DISABLE is true, stop issuing warnings. This is used when
1091 parsing code that we know will not be executed. This function may
1092 be called multiple times, and works as a stack. */
1094 static void
1096 {
1098 {
1101 }
1102 }
1104 /* If ENABLE is true, reenable issuing warnings. */
1106 static void
1108 {
1110 {
1113 }
1114 }
1116 /* Fully fold EXPR, an expression that was not folded (beyond integer
1117 constant expressions and null pointer constants) when being built
1118 up. If IN_INIT, this is in a static initializer and certain
1119 changes are made to the folding done. Clear *MAYBE_CONST if
1120 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1121 expression because it contains an evaluated operator (in C99) or an
1122 operator outside of sizeof returning an integer constant (in C90)
1123 not permitted in constant expressions, or because it contains an
1124 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1125 set to true by callers before calling this function.) Return the
1126 folded expression. Function arguments have already been folded
1127 before calling this function, as have the contents of SAVE_EXPR,
1128 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1129 C_MAYBE_CONST_EXPR. */
1131 tree
1133 {
1134 tree ret;
1140 /* This function is not relevant to C++ because C++ folds while
1141 parsing, and may need changes to be correct for C++ when C++
1142 stops folding while parsing. */
1149 {
1152 }
1159 }
1161 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1162 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1163 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1164 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1165 both evaluated and unevaluated subexpressions while
1166 *MAYBE_CONST_ITSELF is carried from only evaluated
1167 subexpressions). */
1169 static tree
1172 {
1184 /* This function is not relevant to C++ because C++ folds while
1185 parsing, and may need changes to be correct for C++ when C++
1186 stops folding while parsing. */
1190 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1191 anything else not counted as an expression cannot usefully be
1192 folded further at this point. */
1198 /* Operands of variable-length expressions (function calls) have
1199 already been folded, as have __builtin_* function calls, and such
1200 expressions cannot occur in constant expressions. */
1202 {
1206 }
1209 {
1218 else
1221 }
1223 /* Assignment, increment, decrement, function call and comma
1224 operators, and statement expressions, cannot occur in constant
1225 expressions if evaluated / outside of sizeof. (Function calls
1226 were handled above, though VA_ARG_EXPR is treated like a function
1227 call here, and statement expressions are handled through
1228 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1230 {
1250 }
1252 /* Fold individual tree codes as appropriate. */
1254 {
1256 /* Any non-constancy will have been marked in a containing
1257 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1265 maybe_const_itself);
1270 {
1273 }
1282 maybe_const_itself);
1285 maybe_const_itself);
1291 {
1295 }
1337 /* Binary operations evaluating both arguments (increment and
1338 decrement are binary internally in GCC). */
1342 maybe_const_itself);
1350 /* The RHS of a MODIFY_EXPR was fully folded when building that
1351 expression for the sake of conversion warnings. */
1354 maybe_const_itself);
1358 ret = in_init
1361 else
1374 {
1385 }
1391 CASE_CONVERT:
1402 /* Unary operations. */
1405 maybe_const_itself);
1409 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1410 not prepared to deal with them if they occur in initializers. */
1418 ret = in_init
1421 else
1426 {
1430 }
1432 {
1435 CASE_CONVERT:
1436 /* Don't warn about explicit conversions. We will already
1437 have warned about suspect implicit conversions. */
1444 }
1449 /* Binary operations not necessarily evaluating both
1450 arguments. */
1457 ? truthvalue_false_node
1465 ret = in_init
1468 else
1473 && op0_const
1474 && op0_const_self
1480 && op0_const_self
1506 else
1511 && op0_const
1512 && op0_const_self
1516 && op0_const_self
1520 && op0_const
1521 && op0_const_self
1525 && op0_const_self
1531 /* Each case where an operand with excess precision may be
1532 encountered must remove the EXCESS_PRECISION_EXPR around
1533 inner operands and possibly put one around the whole
1534 expression or possibly convert to the semantic type (which
1535 c_fully_fold does); we cannot tell at this stage which is
1536 appropriate in any particular case. */
1540 /* Various codes may appear through folding built-in functions
1541 and their arguments. */
1543 }
1545 out:
1546 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1547 have been done by this point, so remove them again. */
1551 {
1555 }
1559 }
1561 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1562 return EXP. Otherwise, return either EXP or its known constant
1563 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1564 Is the BLKmode test appropriate? */
1566 tree
1568 {
1569 tree ret;
1571 /* This function is only used by C, for c_fully_fold and other
1572 optimization, and may not be correct for C++. */
1583 /* Avoid unwanted tree sharing between the initializer and current
1584 function's body where the tree can be modified e.g. by the
1585 gimplifier. */
1589 }
1591 /* Print a warning if a constant expression had overflow in folding.
1592 Invoke this function on every expression that the language
1593 requires to be a constant expression.
1594 Note the ANSI C standard says it is erroneous for a
1595 constant expression to overflow. */
1597 void
1599 {
1607 }
1609 /* The same as above but print an unconditional error. */
1610 void
1612 {
1619 }
1621 /* Print a warning if an expression had overflow in folding and its
1622 operands hadn't.
1624 Invoke this function on every expression that
1625 (1) appears in the source code, and
1626 (2) is a constant expression that overflowed, and
1627 (3) is not already checked by convert_and_check;
1628 however, do not invoke this function on operands of explicit casts
1629 or when the expression is the result of an operator and any operand
1630 already overflowed. */
1632 void
1634 {
1639 {
1668 }
1669 }
1671 /* Warn about uses of logical || / && operator in a context where it
1672 is likely that the bitwise equivalent was intended by the
1673 programmer. We have seen an expression in which CODE is a binary
1674 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1675 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1676 void
1680 {
1692 /* Warn if &&/|| are being used in a context where it is
1693 likely that the bitwise equivalent was intended by the
1694 programmer. That is, an expression such as op && MASK
1695 where op should not be any boolean expression, nor a
1696 constant, and mask seems to be a non-boolean integer constant. */
1704 {
1708 else
1713 }
1715 /* We do not warn for constants because they are typical of macro
1716 expansions that test for features. */
1720 /* This warning only makes sense with logical operands. */
1727 /* The range computations only work with scalars. */
1732 /* We first test whether either side separately is trivially true
1733 (with OR) or trivially false (with AND). If so, do not warn.
1734 This is a common idiom for testing ranges of data types in
1735 portable code. */
1742 /* If this is an OR operation, invert both sides; now, the result
1743 should be always false to get a warning. */
1757 /* If this is an OR operation, invert both sides; now, the result
1758 should be always false to get a warning. */
1766 /* If both expressions have the same operand, if we can merge the
1767 ranges, and if the range test is always false, then warn. */
1774 {
1777 "logical %<or%> "
1779 else
1781 "logical %<and%> "
1783 }
1784 }
1786 /* Warn about logical not used on the left hand side operand of a comparison.
1787 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1788 Do not warn if RHS is of a boolean type. */
1790 void
1792 tree rhs)
1793 {
1800 "logical not is only applied to the left hand side of "
1802 }
1804 /* Warn if EXP contains any computations whose results are not used.
1805 Return true if a warning is printed; false otherwise. LOCUS is the
1806 (potential) location of the expression. */
1808 bool
1810 {
1811 restart:
1815 /* Don't warn about void constructs. This includes casting to void,
1816 void function calls, and statement expressions with a final cast
1817 to void. */
1825 {
1841 /* For a binding, warn if no side effect within it. */
1853 /* In && or ||, warn if 2nd operand has no side effect. */
1860 /* Let people do `(foo (), 0)' without a warning. */
1867 /* If this is an expression with side effects, don't warn; this
1868 case commonly appears in macro expansions. */
1874 /* Don't warn about automatic dereferencing of references, since
1875 the user cannot control it. */
1877 {
1880 }
1881 /* Fall through. */
1884 /* Referencing a volatile value is a side effect, so don't warn. */
1889 /* If this is an expression which has no operands, there is no value
1890 to be unused. There are no such language-independent codes,
1891 but front ends may define such. */
1895 warn:
1897 }
1898 }
1901 /* Print a warning about casts that might indicate violation
1902 of strict aliasing rules if -Wstrict-aliasing is used and
1903 strict aliasing mode is in effect. OTYPE is the original
1904 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1906 bool
1908 {
1909 /* Strip pointer conversion chains and get to the correct original type. */
1917 /* If the type we are casting to is a ref-all pointer
1918 dereferencing it is always valid. */
1925 {
1926 /* Casting the address of an object to non void pointer. Warn
1927 if the cast breaks type based aliasing. */
1929 {
1933 }
1934 else
1935 {
1936 /* warn_strict_aliasing >= 3. This includes the default (3).
1937 Only warn if the cast is dereferenced immediately. */
1938 alias_set_type set1 =
1944 {
1948 }
1951 {
1955 }
1956 }
1957 }
1958 else
1960 {
1961 /* At this level, warn for any conversions, even if an address is
1962 not taken in the same statement. This will likely produce many
1963 false positives, but could be useful to pinpoint problems that
1964 are not revealed at higher levels. */
1969 {
1973 }
1974 }
1977 }
1979 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1980 sizeof as last operand of certain builtins. */
1982 void
1986 {
1990 location_t loc;
1998 {
2002 /* FALLTHRU */
2010 /* FALLTHRU */
2069 }
2097 {
2101 {
2104 "argument to %<sizeof%> in %qD call is the same "
2105 "expression as the destination; did you mean to "
2111 "argument to %<sizeof%> in %qD call is the same "
2112 "expression as the destination; did you mean to "
2114 else
2116 "argument to %<sizeof%> in %qD call is the same "
2117 "expression as the destination; did you mean to "
2120 }
2123 && !strop
2126 {
2128 "argument to %<sizeof%> in %qD call is the same "
2129 "pointer type %qT as the destination; expected %qT "
2133 }
2134 }
2137 {
2141 {
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "expression as the source; did you mean to "
2151 "argument to %<sizeof%> in %qD call is the same "
2152 "expression as the source; did you mean to "
2154 else
2156 "argument to %<sizeof%> in %qD call is the same "
2157 "expression as the source; did you mean to "
2160 }
2163 && !strop
2166 {
2168 "argument to %<sizeof%> in %qD call is the same "
2169 "pointer type %qT as the source; expected %qT "
2173 }
2174 }
2177 {
2181 {
2184 "argument to %<sizeof%> in %qD call is the same "
2185 "expression as the first source; did you mean to "
2191 "argument to %<sizeof%> in %qD call is the same "
2192 "expression as the first source; did you mean to "
2194 else
2196 "argument to %<sizeof%> in %qD call is the same "
2197 "expression as the first source; did you mean to "
2200 }
2203 && !strop
2206 {
2208 "argument to %<sizeof%> in %qD call is the same "
2209 "pointer type %qT as the first source; expected %qT "
2213 }
2214 }
2217 {
2221 {
2224 "argument to %<sizeof%> in %qD call is the same "
2225 "expression as the second source; did you mean to "
2231 "argument to %<sizeof%> in %qD call is the same "
2232 "expression as the second source; did you mean to "
2234 else
2236 "argument to %<sizeof%> in %qD call is the same "
2237 "expression as the second source; did you mean to "
2240 }
2243 && !strop
2246 {
2248 "argument to %<sizeof%> in %qD call is the same "
2249 "pointer type %qT as the second source; expected %qT "
2253 }
2254 }
2256 }
2258 /* Warn for unlikely, improbable, or stupid DECL declarations
2259 of `main'. */
2261 void
2263 {
2264 function_args_iterator iter;
2265 tree type;
2269 {
2270 /* XXX void_type_node belies the abstraction. */
2280 {
2286 }
2290 {
2312 "third argument of %q+D should probably be "
2315 }
2316 }
2318 /* It is intentional that this message does not mention the third
2319 argument because it's only mentioned in an appendix of the
2320 standard. */
2328 }
2330 /* vector_targets_convertible_p is used for vector pointer types. The
2331 callers perform various checks that the qualifiers are satisfactory,
2332 while OTOH vector_targets_convertible_p ignores the number of elements
2333 in the vectors. That's fine with vector pointers as we can consider,
2334 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2335 and that does not require and conversion of the pointer values.
2336 In contrast, vector_types_convertible_p and
2337 vector_types_compatible_elements_p are used for vector value types. */
2338 /* True if pointers to distinct types T1 and T2 can be converted to
2339 each other without an explicit cast. Only returns true for opaque
2340 vector types. */
2341 bool
2343 {
2350 }
2352 /* vector_types_convertible_p is used for vector value types.
2353 It could in principle call vector_targets_convertible_p as a subroutine,
2354 but then the check for vector type would be duplicated with its callers,
2355 and also the purpose of vector_targets_convertible_p would become
2356 muddled.
2357 Where vector_types_convertible_p returns true, a conversion might still be
2358 needed to make the types match.
2359 In contrast, vector_targets_convertible_p is used for vector pointer
2360 values, and vector_types_compatible_elements_p is used specifically
2361 in the context for binary operators, as a check if use is possible without
2362 conversion. */
2363 /* True if vector types T1 and T2 can be converted to each other
2364 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2365 can only be converted with -flax-vector-conversions yet that is not
2366 in effect, emit a note telling the user about that option if such
2367 a note has not previously been emitted. */
2368 bool
2370 {
2378 convertible_lax =
2393 {
2396 "conversions between vectors with differing "
2398 }
2401 }
2403 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2404 and have vector types, V0 has the same type as V1, and the number of
2405 elements of V0, V1, MASK is the same.
2407 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2408 called with two arguments. In this case implementation passes the
2409 first argument twice in order to share the same tree code. This fact
2410 could enable the mask-values being twice the vector length. This is
2411 an implementation accident and this semantics is not guaranteed to
2412 the user. */
2413 tree
2416 {
2417 tree ret;
2423 {
2426 }
2434 {
2439 }
2443 {
2447 }
2450 {
2455 }
2461 {
2464 "argument vector(s) and the mask vector should "
2467 }
2471 {
2476 }
2479 {
2480 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2486 else
2487 {
2490 }
2494 }
2504 }
2506 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2507 to integral type. */
2509 static tree
2511 {
2516 {
2517 /* C++0x scoped enumerations don't implicitly convert to integral
2518 type; if we stripped an explicit conversion to a larger type we
2519 need to replace it so common_type will still work. */
2523 }
2525 }
2527 /* This is a helper function of build_binary_op.
2529 For certain operations if both args were extended from the same
2530 smaller type, do the arithmetic in that type and then extend.
2532 BITWISE indicates a bitwise operation.
2533 For them, this optimization is safe only if
2534 both args are zero-extended or both are sign-extended.
2535 Otherwise, we might change the result.
2536 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2537 but calculated in (unsigned short) it would be (unsigned short)-1.
2538 */
2539 tree
2541 {
2545 tree type;
2547 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2548 excessive narrowing when we call get_narrower below. For
2549 example, suppose that OP0 is of unsigned int extended
2550 from signed char and that RESULT_TYPE is long long int.
2551 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2552 like
2554 (long long int) (unsigned int) signed_char
2556 which get_narrower would narrow down to
2558 (unsigned int) signed char
2560 If we do not cast OP0 first, get_narrower would return
2561 signed_char, which is inconsistent with the case of the
2562 explicit cast. */
2569 /* UNS is 1 if the operation to be done is an unsigned one. */
2572 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2573 but it *requires* conversion to FINAL_TYPE. */
2584 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2586 /* For bitwise operations, signedness of nominal type
2587 does not matter. Consider only how operands were extended. */
2591 /* Note that in all three cases below we refrain from optimizing
2592 an unsigned operation on sign-extended args.
2593 That would not be valid. */
2595 /* Both args variable: if both extended in same way
2596 from same width, do it in that width.
2597 Do it unsigned if args were zero-extended. */
2604 return c_common_signed_or_unsigned_type
2611 && (type
2622 && (type
2630 }
2632 /* Checks if expression EXPR of real/integer type cannot be converted
2633 to the real/integer type TYPE. Function returns non-zero when:
2634 * EXPR is a constant which cannot be exactly converted to TYPE.
2635 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2636 for EXPR type and TYPE being both integers or both real.
2637 * EXPR is not a constant of real type and TYPE is an integer.
2638 * EXPR is not a constant of integer type which cannot be
2639 exactly converted to real type.
2640 Function allows conversions between types of different signedness and
2641 can return SAFE_CONVERSION (zero) in that case. Function can produce
2642 signedness warnings if PRODUCE_WARNS is true. */
2644 enum conversion_safety
2646 {
2652 {
2653 /* Warn for real constant that is not an exact integer converted
2654 to integer type. */
2657 {
2660 }
2661 /* Warn for an integer constant that does not fit into integer type. */
2665 {
2668 {
2672 }
2674 {
2678 }
2679 else
2681 }
2683 {
2684 /* Warn for an integer constant that does not fit into real type. */
2686 {
2690 }
2691 /* Warn for a real constant that does not fit into a smaller
2692 real type. */
2695 {
2699 }
2700 }
2701 }
2702 else
2703 {
2704 /* Warn for real types converted to integer types. */
2711 {
2712 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2716 /* Don't warn for short y; short x = ((int)y & 0xff); */
2720 {
2721 /* If both args were extended from a shortest type,
2722 use that type if that is safe. */
2729 {
2735 /* If one of the operands is a non-negative constant
2736 that fits in the target type, then the type of the
2737 other operand does not matter. */
2746 /* If constant is unsigned and fits in the target
2747 type, then the result will also fit. */
2749 && unsigned0
2752 && unsigned1
2755 }
2756 }
2757 /* Warn for integer types converted to smaller integer types. */
2761 /* When they are the same width but different signedness,
2762 then the value may change. */
2765 /* Even when converted to a bigger type, if the type is
2766 unsigned but expr is signed, then negative values
2767 will be changed. */
2773 }
2775 /* Warn for integer types converted to real types if and only if
2776 all the range of values of the integer type cannot be
2777 represented by the real type. */
2780 {
2784 /* Don't warn about char y = 0xff; float x = (int) y; */
2796 }
2798 /* Warn for real types converted to smaller real types. */
2803 }
2806 }
2808 /* Warns if the conversion of EXPR to TYPE may alter a value.
2809 This is a helper function for warnings_for_convert_and_check. */
2811 static void
2813 {
2820 /* This may happen, because for LHS op= RHS we preevaluate
2821 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2822 means we could no longer see the code of the EXPR. */
2829 {
2842 /* Conversion from boolean to a signed:1 bit-field (which only
2843 can hold the values 0 and -1) doesn't lose information - but
2844 it does change the value. */
2864 {
2865 /* In case of COND_EXPR, we do not care about the type of
2866 COND_EXPR, only about the conversion of each operand. */
2873 }
2885 }
2886 }
2888 /* Produce warnings after a conversion. RESULT is the result of
2889 converting EXPR to TYPE. This is a helper function for
2890 convert_and_check and cp_convert_and_check. */
2892 void
2894 tree result)
2895 {
2902 {
2903 /* Do not diagnose overflow in a constant expression merely
2904 because a conversion overflowed. */
2909 {
2910 /* This detects cases like converting -129 or 256 to
2911 unsigned char. */
2915 else
2917 }
2921 /* No warning for converting 0x80000000 to int. */
2929 else
2931 }
2936 else
2938 }
2941 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2942 Invoke this function on every expression that is converted implicitly,
2943 i.e. because of language rules and not because of an explicit cast. */
2945 tree
2947 {
2948 tree result;
2949 tree expr_for_warning;
2951 /* Convert from a value with possible excess precision rather than
2952 via the semantic type, but do not warn about values not fitting
2953 exactly in the semantic type. */
2955 {
2961 }
2962 else
2976 }
2977 \f
2978 /* A node in a list that describes references to variables (EXPR), which are
2979 either read accesses if WRITER is zero, or write accesses, in which case
2980 WRITER is the parent of EXPR. */
2981 struct tlist
2982 {
2985 };
2987 /* Used to implement a cache the results of a call to verify_tree. We only
2988 use this for SAVE_EXPRs. */
2989 struct tlist_cache
2990 {
2994 tree expr;
2995 };
2997 /* Obstack to use when allocating tlist structures, and corresponding
2998 firstobj. */
3002 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3003 warnings. */
3005 /* SAVE_EXPRs need special treatment. We process them only once and then
3006 cache the results. */
3018 /* Create a new struct tlist and fill in its fields. */
3021 {
3028 }
3030 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3031 is nonnull, we ignore any node we find which has a writer equal to it. */
3033 static void
3035 {
3037 {
3044 }
3045 }
3047 /* Merge the nodes of ADD into TO. This merging process is done so that for
3048 each variable that already exists in TO, no new node is added; however if
3049 there is a write access recorded in ADD, and an occurrence on TO is only
3050 a read access, then the occurrence in TO will be modified to record the
3051 write. */
3053 static void
3055 {
3062 {
3069 {
3073 }
3075 {
3079 }
3081 }
3082 }
3084 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3085 references in list LIST conflict with it, excluding reads if ONLY writers
3086 is nonzero. */
3088 static void
3091 {
3094 /* Avoid duplicate warnings. */
3100 {
3104 {
3109 }
3111 }
3112 }
3114 /* Given a list LIST of references to variables, find whether any of these
3115 can cause conflicts due to missing sequence points. */
3117 static void
3119 {
3123 {
3126 }
3127 }
3129 /* Return nonzero if X is a tree that can be verified by the sequence point
3130 warnings. */
3131 static int
3133 {
3140 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3141 (lvalue_p) crash on TRY/CATCH. */
3148 /* No point to track non-const calls, they will never satisfy
3149 operand_equal_p. */
3157 }
3159 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3160 static bool
3162 {
3164 }
3166 /* Walk the tree X, and record accesses to variables. If X is written by the
3167 parent tree, WRITER is the parent.
3168 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3169 expression or its only operand forces a sequence point, then everything up
3170 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3171 in PNO_SP.
3172 Once we return, we will have emitted warnings if any subexpression before
3173 such a sequence point could be undefined. On a higher level, however, the
3174 sequence point may not be relevant, and we'll merge the two lists.
3176 Example: (b++, a) + b;
3177 The call that processes the COMPOUND_EXPR will store the increment of B
3178 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3179 processes the PLUS_EXPR will need to merge the two lists so that
3180 eventually, all accesses end up on the same list (and we'll warn about the
3181 unordered subexpressions b++ and b.
3183 A note on merging. If we modify the former example so that our expression
3184 becomes
3185 (b++, b) + a
3186 care must be taken not simply to add all three expressions into the final
3187 PNO_SP list. The function merge_tlist takes care of that by merging the
3188 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3189 way, so that no more than one access to B is recorded. */
3191 static void
3193 tree writer)
3194 {
3199 /* X may be NULL if it is the operand of an empty statement expression
3200 ({ }). */
3204 restart:
3212 {
3245 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3246 two first, to avoid warning for (a ? b++ : b++). */
3262 /* Expressions inside the LHS are not ordered wrt. the sequence points
3263 in the RHS. Example:
3264 *a = (a++, 2)
3265 Despite the fact that the modification of "a" is in the before_sp
3266 list (tmp_before), it conflicts with the use of "a" in the LHS.
3267 We can handle this by adding the contents of tmp_list3
3268 to those of tmp_before, and redoing the collision warnings for that
3269 list. */
3272 /* Exclude the LHS itself here; we first have to merge it into the
3273 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3274 didn't exclude the LHS, we'd get it twice, once as a read and once
3275 as a write. */
3286 /* We need to warn about conflicts among arguments and conflicts between
3287 args and the function address. Side effects of the function address,
3288 however, are not ordered by the sequence point of the call. */
3289 {
3290 call_expr_arg_iterator iter;
3291 tree arg;
3295 {
3300 }
3305 }
3308 /* Scan all the list, e.g. indices of multi dimensional array. */
3310 {
3316 }
3320 {
3327 {
3341 }
3345 }
3355 /* For other expressions, simply recurse on their operands.
3356 Manual tail recursion for unary expressions.
3357 Other non-expressions need not be processed. */
3359 {
3363 }
3365 {
3369 {
3374 }
3375 }
3377 }
3378 }
3380 /* Try to warn for undefined behavior in EXPR due to missing sequence
3381 points. */
3383 DEBUG_FUNCTION void
3385 {
3391 {
3394 }
3399 }
3400 \f
3401 /* Validate the expression after `case' and apply default promotions. */
3403 static tree
3405 {
3410 /* Promote char or short to int. */
3413 {
3416 }
3421 }
3422 \f
3423 /* See if the case values LOW and HIGH are in the range of the original
3424 type (i.e. before the default conversion to int) of the switch testing
3425 expression.
3426 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3427 the type before promoting it. CASE_LOW_P is a pointer to the lower
3428 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3429 if the case is not a case range.
3430 The caller has to make sure that we are not called with NULL for
3431 CASE_LOW_P (i.e. the default case).
3432 Returns true if the case label is in range of ORIG_TYPE (saturated or
3433 untouched) or false if the label is out of range. */
3435 static bool
3438 {
3443 /* If there was a problem with the original type, do nothing. */
3450 /* Case label is less than minimum for type. */
3453 {
3457 }
3459 /* Case value is greater than maximum for type. */
3462 {
3465 }
3467 /* Saturate lower case label value to minimum. */
3470 {
3474 }
3476 /* Saturate upper case label value to maximum. */
3479 {
3483 }
3491 }
3492 \f
3493 /* Return an integer type with BITS bits of precision,
3494 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3496 tree
3498 {
3540 }
3542 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3543 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3544 and saturating if SATP is nonzero, otherwise not saturating. */
3546 tree
3549 {
3550 machine_mode mode;
3553 else
3561 {
3563 "fixed-point types that have too many integral and "
3566 }
3569 }
3571 /* Used for communication between c_common_type_for_mode and
3572 c_register_builtin_type. */
3573 tree registered_builtin_types;
3575 /* Return a data type that has machine mode MODE.
3576 If the mode is an integer,
3577 then UNSIGNEDP selects between signed and unsigned types.
3578 If the mode is a fixed-point mode,
3579 then UNSIGNEDP selects between saturating and nonsaturating types. */
3581 tree
3583 {
3584 tree t;
3624 #if HOST_BITS_PER_WIDE_INT >= 64
3627 #endif
3652 {
3653 machine_mode inner_mode;
3654 tree inner_type;
3670 }
3672 {
3677 }
3687 {
3773 }
3781 }
3783 tree
3785 {
3787 }
3789 /* Return a signed type the same as TYPE in other respects. */
3791 tree
3793 {
3795 }
3797 /* Return a type the same as TYPE except unsigned or
3798 signed according to UNSIGNEDP. */
3800 tree
3802 {
3803 tree type1;
3806 /* This block of code emulates the behavior of the old
3807 c_common_unsigned_type. In particular, it returns
3808 long_unsigned_type_node if passed a long, even when a int would
3809 have the same size. This is necessary for warnings to work
3810 correctly in archs where sizeof(int) == sizeof(long) */
3813 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3833 #if HOST_BITS_PER_WIDE_INT >= 64
3836 #endif
3846 #define C_COMMON_FIXED_TYPES(NAME) \
3847 if (type1 == short_ ## NAME ## _type_node \
3848 || type1 == unsigned_short_ ## NAME ## _type_node) \
3849 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3850 : short_ ## NAME ## _type_node; \
3851 if (type1 == NAME ## _type_node \
3852 || type1 == unsigned_ ## NAME ## _type_node) \
3853 return unsignedp ? unsigned_ ## NAME ## _type_node \
3854 : NAME ## _type_node; \
3855 if (type1 == long_ ## NAME ## _type_node \
3856 || type1 == unsigned_long_ ## NAME ## _type_node) \
3857 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3858 : long_ ## NAME ## _type_node; \
3859 if (type1 == long_long_ ## NAME ## _type_node \
3860 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3861 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3862 : long_long_ ## NAME ## _type_node;
3864 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3865 if (type1 == NAME ## _type_node \
3866 || type1 == u ## NAME ## _type_node) \
3867 return unsignedp ? u ## NAME ## _type_node \
3868 : NAME ## _type_node;
3870 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3871 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3872 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3873 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3874 : sat_ ## short_ ## NAME ## _type_node; \
3875 if (type1 == sat_ ## NAME ## _type_node \
3876 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3877 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3878 : sat_ ## NAME ## _type_node; \
3879 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3880 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3881 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3882 : sat_ ## long_ ## NAME ## _type_node; \
3883 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3884 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3885 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3886 : sat_ ## long_long_ ## NAME ## _type_node;
3888 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3889 if (type1 == sat_ ## NAME ## _type_node \
3890 || type1 == sat_ ## u ## NAME ## _type_node) \
3891 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3892 : sat_ ## NAME ## _type_node;
3918 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3919 the precision; they have precision set to match their range, but
3920 may use a wider mode to match an ABI. If we change modes, we may
3921 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3922 the precision as well, so as to yield correct results for
3923 bit-field types. C++ does not have these separate bit-field
3924 types, and producing a signed or unsigned variant of an
3925 ENUMERAL_TYPE may cause other problems as well. */
3931 #define TYPE_OK(node) \
3932 (TYPE_MODE (type) == TYPE_MODE (node) \
3933 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3957 #if HOST_BITS_PER_WIDE_INT >= 64
3960 #endif
3969 #undef TYPE_OK
3972 }
3974 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3976 tree
3978 {
3981 /* Extended integer types of the same width as a standard type have
3982 lesser rank, so those of the same width as int promote to int or
3983 unsigned int and are valid for printf formats expecting int or
3984 unsigned int. To avoid such special cases, avoid creating
3985 extended integer types for bit-fields if a standard integer type
3986 is available. */
4004 }
4006 /* The C version of the register_builtin_type langhook. */
4008 void
4010 {
4011 tree decl;
4021 }
4022 \f
4023 /* Print an error message for invalid operands to arith operation
4024 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4025 LOCATION is the location of the message. */
4027 void
4030 {
4034 {
4079 }
4083 }
4084 \f
4085 /* Given an expression as a tree, return its original type. Do this
4086 by stripping any conversion that preserves the sign and precision. */
4087 static tree
4089 {
4092 }
4094 /* Subroutine of build_binary_op, used for comparison operations.
4095 See if the operands have both been converted from subword integer types
4096 and, if so, perhaps change them both back to their original type.
4097 This function is also responsible for converting the two operands
4098 to the proper common type for comparison.
4100 The arguments of this function are all pointers to local variables
4101 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4102 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4104 LOC is the location of the comparison.
4106 If this function returns nonzero, it means that the comparison has
4107 a constant value. What this function returns is an expression for
4108 that value. */
4110 tree
4113 {
4114 tree type;
4122 /* Throw away any conversions to wider types
4123 already present in the operands. */
4128 /* If primopN is first sign-extended from primopN's precision to opN's
4129 precision, then zero-extended from opN's precision to
4130 *restype_ptr precision, shortenings might be invalid. */
4133 && !unsignedp0
4138 && !unsignedp1
4142 /* Handle the case that OP0 does not *contain* a conversion
4143 but it *requires* conversion to FINAL_TYPE. */
4150 /* If one of the operands must be floated, we cannot optimize. */
4154 /* If first arg is constant, swap the args (changing operation
4155 so value is preserved), for canonicalization. Don't do this if
4156 the second arg is 0. */
4161 {
4178 {
4193 }
4195 }
4197 /* If comparing an integer against a constant more bits wide,
4198 maybe we can deduce a value of 1 or 0 independent of the data.
4199 Or else truncate the constant now
4200 rather than extend the variable at run time.
4202 This is only interesting if the constant is the wider arg.
4203 Also, it is not safe if the constant is unsigned and the
4204 variable arg is signed, since in this case the variable
4205 would be sign-extended and then regarded as unsigned.
4206 Our technique fails in this case because the lowest/highest
4207 possible unsigned results don't follow naturally from the
4208 lowest/highest possible values of the variable operand.
4209 For just EQ_EXPR and NE_EXPR there is another technique that
4210 could be used: see if the constant can be faithfully represented
4211 in the other operand's type, by truncating it and reextending it
4212 and see if that preserves the constant's value. */
4218 {
4221 /* 1 if comparison is nominally unsigned. */
4223 tree val;
4235 {
4236 /* Convert primop1 to target type, but do not introduce
4237 additional overflow. We know primop1 is an int_cst. */
4244 }
4246 {
4249 }
4257 /* This used to be a switch, but Genix compiler can't handle that. */
4259 {
4262 }
4264 {
4267 }
4269 {
4274 }
4276 {
4281 }
4283 {
4288 }
4290 {
4295 }
4297 /* If primop0 was sign-extended and unsigned comparison specd,
4298 we did a signed comparison above using the signed type bounds.
4299 But the comparison we output must be unsigned.
4301 Also, for inequalities, VAL is no good; but if the signed
4302 comparison had *any* fixed result, it follows that the
4303 unsigned comparison just tests the sign in reverse
4304 (positive values are LE, negative ones GE).
4305 So we can generate an unsigned comparison
4306 against an extreme value of the signed type. */
4309 {
4312 {
4327 }
4329 }
4332 {
4339 }
4342 {
4343 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4347 }
4349 /* Value is not predetermined, but do the comparison
4350 in the type of the operand that is not constant.
4351 TYPE is already properly set. */
4352 }
4354 /* If either arg is decimal float and the other is float, find the
4355 proper common type to use for comparison. */
4361 /* If either arg is decimal float and the other is float, fail. */
4372 /* If args' natural types are both narrower than nominal type
4373 and both extend in the same manner, compare them
4374 in the type of the wider arg.
4375 Otherwise must actually extend both to the nominal
4376 common type lest different ways of extending
4377 alter the result.
4378 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4383 {
4387 type);
4388 /* Make sure shorter operand is extended the right way
4389 to match the longer operand. */
4390 primop0
4393 primop0);
4394 primop1
4397 primop1);
4398 }
4399 else
4400 {
4401 /* Here we must do the comparison on the nominal type
4402 using the args exactly as we received them. */
4409 {
4411 /* All unsigned values are >= 0, so we warn. However,
4412 if OP0 is a constant that is >= 0, the signedness of
4413 the comparison isn't an issue, so suppress the
4414 warning. */
4419 primop0)))
4420 /* Do not warn for enumeration types. */
4424 {
4441 }
4444 {
4445 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4450 }
4451 }
4452 }
4460 }
4461 \f
4462 /* Return a tree for the sum or difference (RESULTCODE says which)
4463 of pointer PTROP and integer INTOP. */
4465 tree
4468 {
4471 /* The result is a pointer of the same type that is being added. */
4475 {
4482 }
4484 {
4491 }
4492 else
4495 /* We are manipulating pointer values, so we don't need to warn
4496 about relying on undefined signed overflow. We disable the
4497 warning here because we use integer types so fold won't know that
4498 they are really pointers. */
4501 /* If what we are about to multiply by the size of the elements
4502 contains a constant term, apply distributive law
4503 and multiply that constant term separately.
4504 This helps produce common subexpressions. */
4509 /* If the constant comes from pointer subtraction,
4510 skip this optimization--it would cause an error. */
4512 /* If the constant is unsigned, and smaller than the pointer size,
4513 then we must skip this optimization. This is because it could cause
4514 an overflow error if the constant is negative but INTOP is not. */
4518 {
4523 /* Convert both subexpression types to the type of intop,
4524 because weird cases involving pointer arithmetic
4525 can result in a sum or difference with different type args. */
4530 }
4532 /* Convert the integer argument to a type the same size as sizetype
4533 so the multiply won't overflow spuriously. */
4539 /* Replace the integer argument with a suitable product by the object size.
4540 Do this multiplication as signed, then convert to the appropriate type
4541 for the pointer operation and disregard an overflow that occurred only
4542 because of the sign-extension change in the latter conversion. */
4543 {
4550 }
4552 /* Create the sum or difference. */
4561 }
4562 \f
4563 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4564 and if NON_CONST is known not to be permitted in an evaluated part
4565 of a constant expression. */
4567 tree
4569 {
4573 /* This should never be called for C++. */
4577 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4586 }
4588 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4589 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4590 around the SAVE_EXPR if needed so that c_fully_fold does not need
4591 to look inside SAVE_EXPRs. */
4593 tree
4595 {
4604 }
4606 /* Return whether EXPR is a declaration whose address can never be
4607 NULL. */
4609 bool
4611 {
4616 }
4618 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4619 or for an `if' or `while' statement or ?..: exp. It should already
4620 have been validated to be of suitable type; otherwise, a bad
4621 diagnostic may result.
4623 The EXPR is located at LOCATION.
4625 This preparation consists of taking the ordinary
4626 representation of an expression expr and producing a valid tree
4627 boolean expression describing whether expr is nonzero. We could
4628 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4629 but we optimize comparisons, &&, ||, and !.
4631 The resulting type should always be `truthvalue_type_node'. */
4633 tree
4635 {
4637 {
4679 ? truthvalue_true_node
4685 ? truthvalue_true_node
4690 /* Fall through. */
4693 {
4696 {
4697 /* Common Ada/Pascal programmer's mistake. */
4699 OPT_Waddress,
4701 inner);
4703 }
4705 }
4722 /* These don't change whether an object is nonzero or zero. */
4727 /* These don't change whether an object is zero or nonzero, but
4728 we can't ignore them if their second arg has side-effects. */
4730 {
4733 c_common_truthvalue_conversion
4736 }
4737 else
4742 /* Distribute the conversion into the arms of a COND_EXPR. */
4744 {
4747 /* In C++ one of the arms might have void type if it is throw. */
4755 }
4756 else
4757 {
4758 /* Folding will happen later for C. */
4766 }
4768 CASE_CONVERT:
4769 {
4773 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4774 since that affects how `default_conversion' will behave. */
4778 /* Don't strip a conversion from C++0x scoped enum, since they
4779 don't implicitly convert to other types. */
4783 /* If this isn't narrowing the argument, we can ignore it. */
4787 }
4793 {
4797 }
4802 }
4805 {
4807 expr = (build_binary_op
4811 c_common_truthvalue_conversion
4814 c_common_truthvalue_conversion
4819 }
4822 {
4827 }
4828 else
4831 ret:
4834 }
4835 \f
4844 /* Apply the TYPE_QUALS to the new DECL. */
4846 void
4848 {
4856 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4857 constructor can produce constant init, so rely on cp_finish_decl to
4858 clear TREE_READONLY if the variable has non-constant init. */
4861 {
4864 }
4866 {
4868 /* Allow 'restrict' on arrays of pointers.
4869 FIXME currently we just ignore it. */
4875 }
4876 }
4879 {
4882 };
4884 /* Hash function for the problem of multiple type definitions in
4885 different files. This must hash all types that will compare
4886 equal via comptypes to the same value. In practice it hashes
4887 on some of the simple stuff and leaves the details to comptypes. */
4889 hashval_t
4891 {
4894 tree t2;
4896 {
4897 /* For pointers, hash on pointee type plus some swizzling. */
4900 /* Hash on number of elements and total size. */
4919 }
4920 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4921 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4923 /* We might have a VLA here. */
4926 else
4929 }
4931 bool
4933 {
4935 }
4939 /* Return the typed-based alias set for T, which may be an expression
4940 or a type. Return -1 if we don't do anything special. */
4942 alias_set_type
4944 {
4945 tree u;
4947 /* For VLAs, use the alias set of the element type rather than the
4948 default of alias set 0 for types compared structurally. */
4950 {
4954 }
4956 /* Permit type-punning when accessing a union, provided the access
4957 is directly through the union. For example, this code does not
4958 permit taking the address of a union member and then storing
4959 through it. Even the type-punning allowed here is a GCC
4960 extension, albeit a common and useful one; the C standard says
4961 that such accesses have implementation-defined behavior. */
4969 /* That's all the expressions we handle specially. */
4973 /* The C standard guarantees that any object may be accessed via an
4974 lvalue that has character type. */
4980 /* The C standard specifically allows aliasing between signed and
4981 unsigned variants of the same type. We treat the signed
4982 variant as canonical. */
4984 {
4987 /* t1 == t can happen for boolean nodes which are always unsigned. */
4990 }
4992 /* Handle the case of multiple type nodes referring to "the same" type,
4993 which occurs with IMA. These share an alias set. FIXME: Currently only
4994 C90 is handled. (In C99 type compatibility is not transitive, which
4995 complicates things mightily. The alias set splay trees can theoretically
4996 represent this, but insertion is tricky when you consider all the
4997 different orders things might arrive in.) */
5002 /* Save time if there's only one input file. */
5006 /* Pointers need special handling if they point to any type that
5007 needs special handling (below). */
5009 {
5010 tree t2;
5011 /* Find bottom type under any nested POINTERs. */
5015 ;
5023 }
5024 /* These are the only cases that need special handling. */
5031 /* Undefined? */
5035 /* Look up t in hash table. Only one of the compatible types within each
5036 alias set is recorded in the table. */
5041 {
5044 }
5045 else
5046 /* Our caller will assign and record (in t) a new alias set; all we need
5047 to do is remember t in the hash table. */
5051 }
5052 \f
5053 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5054 the IS_SIZEOF parameter indicates which operator is being applied.
5055 The COMPLAIN flag controls whether we should diagnose possibly
5056 ill-formed constructs or not. LOC is the location of the SIZEOF or
5057 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5058 a type in any context should be returned, rather than the normal
5059 alignment for that type. */
5061 tree
5065 {
5073 {
5075 {
5082 }
5083 else
5084 {
5086 {
5090 else
5093 }
5095 }
5096 }
5098 {
5106 }
5109 {
5114 }
5117 {
5122 }
5123 else
5124 {
5126 /* Convert in case a char is more than one unit. */
5132 else
5134 }
5136 /* VALUE will have the middle-end integer type sizetype.
5137 However, we should really return a value of type `size_t',
5138 which is just a typedef for an ordinary integer type. */
5142 }
5144 /* Implement the __alignof keyword: Return the minimum required
5145 alignment of EXPR, measured in bytes. For VAR_DECLs,
5146 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5147 from an "aligned" __attribute__ specification). LOC is the
5148 location of the ALIGNOF operator. */
5150 tree
5152 {
5153 tree t;
5160 {
5163 }
5169 {
5176 {
5183 }
5185 }
5186 else
5190 }
5191 \f
5192 /* Handle C and C++ default attributes. */
5194 enum built_in_attribute
5195 {
5196 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5197 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5198 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5199 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5200 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5202 #undef DEF_ATTR_NULL_TREE
5203 #undef DEF_ATTR_INT
5204 #undef DEF_ATTR_STRING
5205 #undef DEF_ATTR_IDENT
5206 #undef DEF_ATTR_TREE_LIST
5207 ATTR_LAST
5208 };
5214 enum c_builtin_type
5215 {
5216 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5217 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5218 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5219 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5220 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5221 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5222 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5223 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5224 ARG6) NAME,
5225 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5226 ARG6, ARG7) NAME,
5227 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5228 ARG6, ARG7, ARG8) NAME,
5229 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5230 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5231 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5232 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5233 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5234 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5235 NAME,
5236 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5238 #undef DEF_PRIMITIVE_TYPE
5239 #undef DEF_FUNCTION_TYPE_0
5240 #undef DEF_FUNCTION_TYPE_1
5241 #undef DEF_FUNCTION_TYPE_2
5242 #undef DEF_FUNCTION_TYPE_3
5243 #undef DEF_FUNCTION_TYPE_4
5244 #undef DEF_FUNCTION_TYPE_5
5245 #undef DEF_FUNCTION_TYPE_6
5246 #undef DEF_FUNCTION_TYPE_7
5247 #undef DEF_FUNCTION_TYPE_8
5248 #undef DEF_FUNCTION_TYPE_VAR_0
5249 #undef DEF_FUNCTION_TYPE_VAR_1
5250 #undef DEF_FUNCTION_TYPE_VAR_2
5251 #undef DEF_FUNCTION_TYPE_VAR_3
5252 #undef DEF_FUNCTION_TYPE_VAR_4
5253 #undef DEF_FUNCTION_TYPE_VAR_5
5254 #undef DEF_POINTER_TYPE
5255 BT_LAST
5256 };
5260 /* A temporary array for c_common_nodes_and_builtins. Used in
5261 communication with def_fn_type. */
5264 /* A helper function for c_common_nodes_and_builtins. Build function type
5265 for DEF with return type RET and N arguments. If VAR is true, then the
5266 function should be variadic after those N arguments.
5268 Takes special care not to ICE if any of the types involved are
5269 error_mark_node, which indicates that said type is not in fact available
5270 (see builtin_type_for_size). In which case the function type as a whole
5271 should be error_mark_node. */
5273 static void
5275 {
5276 tree t;
5283 {
5289 }
5296 else
5299 egress:
5302 }
5304 /* Build builtin functions common to both C and C++ language
5305 frontends. */
5307 static void
5309 {
5310 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5311 builtin_types[ENUM] = VALUE;
5312 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5313 def_fn_type (ENUM, RETURN, 0, 0);
5314 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5315 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5316 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5317 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5318 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5319 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5320 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5321 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5322 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5323 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5324 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5325 ARG6) \
5326 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5327 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5328 ARG6, ARG7) \
5329 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5330 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5331 ARG6, ARG7, ARG8) \
5332 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5333 ARG7, ARG8);
5334 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5335 def_fn_type (ENUM, RETURN, 1, 0);
5336 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5337 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5338 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5339 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5340 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5341 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5342 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5343 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5344 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5345 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5346 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5347 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5351 #undef DEF_PRIMITIVE_TYPE
5352 #undef DEF_FUNCTION_TYPE_0
5353 #undef DEF_FUNCTION_TYPE_1
5354 #undef DEF_FUNCTION_TYPE_2
5355 #undef DEF_FUNCTION_TYPE_3
5356 #undef DEF_FUNCTION_TYPE_4
5357 #undef DEF_FUNCTION_TYPE_5
5358 #undef DEF_FUNCTION_TYPE_6
5359 #undef DEF_FUNCTION_TYPE_7
5360 #undef DEF_FUNCTION_TYPE_8
5361 #undef DEF_FUNCTION_TYPE_VAR_0
5362 #undef DEF_FUNCTION_TYPE_VAR_1
5363 #undef DEF_FUNCTION_TYPE_VAR_2
5364 #undef DEF_FUNCTION_TYPE_VAR_3
5365 #undef DEF_FUNCTION_TYPE_VAR_4
5366 #undef DEF_FUNCTION_TYPE_VAR_5
5367 #undef DEF_POINTER_TYPE
5372 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5373 NONANSI_P, ATTRS, IMPLICIT, COND) \
5374 if (NAME && COND) \
5375 def_builtin_1 (ENUM, NAME, CLASS, \
5376 builtin_types[(int) TYPE], \
5377 builtin_types[(int) LIBTYPE], \
5378 BOTH_P, FALLBACK_P, NONANSI_P, \
5379 built_in_attributes[(int) ATTRS], IMPLICIT);
5381 #undef DEF_BUILTIN
5389 }
5391 /* Like get_identifier, but avoid warnings about null arguments when
5392 the argument may be NULL for targets where GCC lacks stdint.h type
5393 information. */
5397 {
5399 }
5401 /* Build tree nodes and builtin functions common to both C and C++ language
5402 frontends. */
5404 void
5406 {
5410 tree array_domain_type;
5411 tree va_list_ref_type_node;
5412 tree va_list_arg_type_node;
5417 /* Define `int' and `char' first so that dbx will output them first. */
5421 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5422 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5423 but not C. Are the conditionals here needed? */
5429 long_unsigned_type_node);
5432 {
5441 }
5446 long_long_integer_type_node);
5448 long_long_unsigned_type_node);
5451 long_long_unsigned_type_node);
5454 short_unsigned_type_node);
5457 short_unsigned_type_node);
5459 /* Define both `signed char' and `unsigned char'. */
5463 /* These are types that c_common_type_for_size and
5464 c_common_type_for_mode use. */
5467 intQI_type_node));
5470 intHI_type_node));
5473 intSI_type_node));
5476 intDI_type_node));
5477 #if HOST_BITS_PER_WIDE_INT >= 64
5478 /* Note that this is different than the __int128 type that's part of
5479 the generic __intN support. */
5482 TYPE_DECL,
5484 intTI_type_node));
5485 #endif
5488 unsigned_intQI_type_node));
5491 unsigned_intHI_type_node));
5494 unsigned_intSI_type_node));
5497 unsigned_intDI_type_node));
5498 #if HOST_BITS_PER_WIDE_INT >= 64
5501 TYPE_DECL,
5503 unsigned_intTI_type_node));
5504 #endif
5506 /* Create the widest literal types. */
5507 widest_integer_literal_type_node
5511 widest_integer_literal_type_node));
5513 widest_unsigned_literal_type_node
5517 widest_unsigned_literal_type_node));
5521 pid_type_node =
5528 /* Only supported decimal floating point extension if the target
5529 actually supports underlying modes. */
5533 {
5537 }
5540 {
5545 long_long_fract_type_node);
5547 unsigned_short_fract_type_node);
5549 unsigned_fract_type_node);
5551 unsigned_long_fract_type_node);
5553 unsigned_long_long_fract_type_node);
5555 sat_short_fract_type_node);
5558 sat_long_fract_type_node);
5560 sat_long_long_fract_type_node);
5562 sat_unsigned_short_fract_type_node);
5564 sat_unsigned_fract_type_node);
5566 sat_unsigned_long_fract_type_node);
5568 sat_unsigned_long_long_fract_type_node);
5573 long_long_accum_type_node);
5575 unsigned_short_accum_type_node);
5577 unsigned_accum_type_node);
5579 unsigned_long_accum_type_node);
5581 unsigned_long_long_accum_type_node);
5583 sat_short_accum_type_node);
5586 sat_long_accum_type_node);
5588 sat_long_long_accum_type_node);
5590 sat_unsigned_short_accum_type_node);
5592 sat_unsigned_accum_type_node);
5594 sat_unsigned_long_accum_type_node);
5596 sat_unsigned_long_long_accum_type_node);
5598 }
5601 TYPE_DECL,
5603 complex_integer_type_node));
5605 TYPE_DECL,
5607 complex_float_type_node));
5609 TYPE_DECL,
5611 complex_double_type_node));
5615 complex_long_double_type_node));
5618 /* For C++, make fileptr_type_node a distinct void * type until
5619 FILE type is defined. */
5624 /* Set the TYPE_NAME for any variants that were built before
5625 record_builtin_type gave names to the built-in types. */
5626 {
5632 }
5636 /* Make a type to be the domain of a few array types
5637 whose domains don't really matter.
5638 200 is small enough that it always fits in size_t
5639 and large enough that it can hold most function names for the
5640 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5643 /* Make a type for arrays of characters.
5644 With luck nothing will ever really depend on the length of this
5645 array type. */
5646 char_array_type_node
5650 const_string_type_node
5654 /* This is special for C++ so functions can be overloaded. */
5660 {
5663 else
5666 }
5668 /* This is for wide string constants. */
5669 wchar_array_type_node
5672 /* Define 'char16_t'. */
5677 {
5682 }
5684 /* This is for UTF-16 string constants. */
5685 char16_array_type_node
5688 /* Define 'char32_t'. */
5693 {
5698 }
5700 /* This is for UTF-32 string constants. */
5701 char32_array_type_node
5704 wint_type_node =
5707 intmax_type_node =
5709 uintmax_type_node =
5713 sig_atomic_type_node =
5716 int8_type_node =
5719 int16_type_node =
5722 int32_type_node =
5725 int64_type_node =
5728 uint8_type_node =
5740 int_least8_type_node =
5743 int_least16_type_node =
5746 int_least32_type_node =
5749 int_least64_type_node =
5752 uint_least8_type_node =
5755 uint_least16_type_node =
5758 uint_least32_type_node =
5761 uint_least64_type_node =
5764 int_fast8_type_node =
5767 int_fast16_type_node =
5770 int_fast32_type_node =
5773 int_fast64_type_node =
5776 uint_fast8_type_node =
5779 uint_fast16_type_node =
5782 uint_fast32_type_node =
5785 uint_fast64_type_node =
5788 intptr_type_node =
5791 uintptr_type_node =
5794 default_function_type
5796 ptrdiff_type_node
5803 va_list_type_node));
5805 {
5808 tree ptype;
5811 {
5815 ptype));
5817 }
5818 }
5821 {
5824 }
5825 else
5826 {
5829 }
5836 /* Create the built-in __null node. It is important that this is
5837 not shared. */
5841 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5843 }
5845 /* The number of named compound-literals generated thus far. */
5848 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5850 void
5852 {
5855 compound_literal_number);
5856 compound_literal_number++;
5858 }
5860 tree
5862 {
5866 }
5869 /* Linked list of disabled built-in functions. */
5872 {
5880 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5881 begins with "__builtin_", give an error. */
5883 void
5885 {
5888 else
5889 {
5894 }
5895 }
5898 /* Return true if the built-in function NAME has been disabled, false
5899 otherwise. */
5901 static bool
5903 {
5906 {
5909 }
5911 }
5914 /* Worker for DEF_BUILTIN.
5915 Possibly define a builtin function with one or two names.
5916 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5917 nonansi_p and flag_no_nonansi_builtin. */
5919 static void
5926 {
5927 tree decl;
5940 fnattrs);
5949 }
5950 \f
5951 /* Nonzero if the type T promotes to int. This is (nearly) the
5952 integral promotions defined in ISO C99 6.3.1.1/2. */
5954 bool
5956 {
5958 {
5968 /* ??? Technically all enumerations not larger than an int
5969 promote to an int. But this is used along code paths
5970 that only want to notice a size change. */
5978 }
5979 }
5981 /* Return 1 if PARMS specifies a fixed number of parameters
5982 and none of their types is affected by default promotions. */
5984 int
5986 {
5987 const_tree t;
5989 {
6006 }
6008 }
6010 /* Recursively remove any '*' or '&' operator from TYPE. */
6011 tree
6013 {
6017 }
6019 /* Recursively remove pointer or array type from TYPE. */
6020 tree
6022 {
6026 }
6028 /* Used to compare case labels. K1 and K2 are actually tree nodes
6029 representing case labels, or NULL_TREE for a `default' label.
6030 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6031 K2, and 0 if K1 and K2 are equal. */
6033 int
6035 {
6036 /* Consider a NULL key (such as arises with a `default' label) to be
6037 smaller than anything else. */
6044 }
6046 /* Process a case label, located at LOC, for the range LOW_VALUE
6047 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6048 then this case label is actually a `default' label. If only
6049 HIGH_VALUE is NULL_TREE, then case label was declared using the
6050 usual C/C++ syntax, rather than the GNU case range extension.
6051 CASES is a tree containing all the case ranges processed so far;
6052 COND is the condition for the switch-statement itself. Returns the
6053 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6054 is created. */
6056 tree
6059 {
6060 tree type;
6061 tree label;
6062 tree case_label;
6063 splay_tree_node node;
6065 /* Create the LABEL_DECL itself. */
6068 /* If there was an error processing the switch condition, bail now
6069 before we get more confused. */
6077 {
6080 }
6082 /* Case ranges are a GNU extension. */
6089 {
6094 }
6096 {
6101 }
6104 {
6105 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6106 really a case range, even though it was written that way.
6107 Remove the HIGH_VALUE to simplify later processing. */
6112 }
6114 /* See if the case is in range of the type of the original testing
6115 expression. If both low_value and high_value are out of range,
6116 don't insert the case label and return NULL_TREE. */
6122 /* Look up the LOW_VALUE in the table of case labels we already
6123 have. */
6125 /* If there was not an exact match, check for overlapping ranges.
6126 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6127 that's a `default' label and the only overlap is an exact match. */
6129 {
6130 splay_tree_node low_bound;
6131 splay_tree_node high_bound;
6133 /* Even though there wasn't an exact match, there might be an
6134 overlap between this case range and another case range.
6135 Since we've (inductively) not allowed any overlapping case
6136 ranges, we simply need to find the greatest low case label
6137 that is smaller that LOW_VALUE, and the smallest low case
6138 label that is greater than LOW_VALUE. If there is an overlap
6139 it will occur in one of these two ranges. */
6145 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6146 the LOW_VALUE, so there is no need to check unless the
6147 LOW_BOUND is in fact itself a case range. */
6153 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6154 range is bigger than the low end of the current range, so we
6155 are only interested if the current range is a real range, and
6156 not an ordinary case label. */
6158 && high_value
6160 high_value)
6163 }
6164 /* If there was an overlap, issue an error. */
6166 {
6170 {
6174 }
6176 {
6179 }
6180 else
6181 {
6185 }
6187 }
6189 /* Add a CASE_LABEL to the statement-tree. */
6191 /* Register this case label in the splay tree. */
6198 error_out:
6199 /* Add a label so that the back-end doesn't think that the beginning of
6200 the switch is unreachable. Note that we do not add a case label, as
6201 that just leads to duplicates and thence to failure later on. */
6203 {
6206 }
6208 }
6210 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6211 Used to verify that case values match up with enumerator values. */
6213 static void
6215 {
6222 else
6229 buf);
6230 else
6235 }
6237 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6238 Used to verify that case values match up with enumerator values. */
6240 static int
6242 {
6246 /* Skip default case. */
6250 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6251 when we did our enum->case scan. Reset our scratch bit after. */
6254 else
6257 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6258 not set, that means that CASE_HIGH did not appear when we did our
6259 enum->case scan. Reset our scratch bit after. */
6261 {
6264 else
6266 }
6269 }
6271 /* Handle -Wswitch*. Called from the front end after parsing the
6272 switch construct. */
6273 /* ??? Should probably be somewhere generic, since other languages
6274 besides C and C++ would want this. At the moment, however, C/C++
6275 are the only tree-ssa languages that support enumerations at all,
6276 so the point is moot. */
6278 void
6281 {
6282 splay_tree_node default_node;
6283 splay_tree_node node;
6284 tree chain;
6294 /* From here on, we only care about about enumerated types. */
6298 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6302 /* Check the cases. Warn about case values which are not members of
6303 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6304 there is no default case, check that exactly all enumeration
6305 literals are covered by the cases. */
6307 /* Clearing COND if it is not an integer constant simplifies
6308 the tests inside the loop below. */
6312 /* The time complexity here is O(N*lg(N)) worst case, but for the
6313 common case of monotonically increasing enumerators, it is
6314 O(N), since the nature of the splay tree will keep the next
6315 element adjacent to the root at all times. */
6318 {
6324 {
6325 /* Mark the CASE_LOW part of the case entry as seen. */
6329 }
6331 /* Even though there wasn't an exact match, there might be a
6332 case range which includes the enumerator's value. */
6335 {
6339 {
6340 /* If we match the upper bound exactly, mark the CASE_HIGH
6341 part of the case entry as seen. */
6345 }
6346 }
6348 /* We've now determined that this enumerated literal isn't
6349 handled by the case labels of the switch statement. */
6351 /* If the switch expression is a constant, we only really care
6352 about whether that constant is handled by the switch. */
6356 /* If there is a default_node, the only relevant option is
6357 Wswitch-enum. Otherwise, if both are enabled then we prefer
6358 to warn using -Wswitch because -Wswitch is enabled by -Wall
6359 while -Wswitch-enum is explicit. */
6362 ? OPT_Wswitch_enum
6366 }
6368 /* Warn if there are case expressions that don't correspond to
6369 enumerators. This can occur since C and C++ don't enforce
6370 type-checking of assignments to enumeration variables.
6372 The time complexity here is now always O(N) worst case, since
6373 we should have marked both the lower bound and upper bound of
6374 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6375 above. This scan also resets those fields. */
6378 }
6380 /* Finish an expression taking the address of LABEL (an
6381 IDENTIFIER_NODE). Returns an expression for the address.
6383 LOC is the location for the expression returned. */
6385 tree
6387 {
6388 tree result;
6398 else
6399 {
6402 /* The current function is not necessarily uninlinable.
6403 Computed gotos are incompatible with inlining, but the value
6404 here could be used only in a diagnostic, for example. */
6406 }
6409 }
6410 \f
6412 /* Given a boolean expression ARG, return a tree representing an increment
6413 or decrement (as indicated by CODE) of ARG. The front end must check for
6414 invalid cases (e.g., decrement in C++). */
6415 tree
6417 {
6418 tree val;
6423 {
6446 }
6449 }
6450 \f
6451 /* Built-in macros for stddef.h and stdint.h, that require macros
6452 defined in this file. */
6453 void
6455 {
6518 }
6520 static void
6522 {
6523 /* Fill in the built_in_attributes array. */
6524 #define DEF_ATTR_NULL_TREE(ENUM) \
6525 built_in_attributes[(int) ENUM] = NULL_TREE;
6526 #define DEF_ATTR_INT(ENUM, VALUE) \
6527 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6528 #define DEF_ATTR_STRING(ENUM, VALUE) \
6529 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6530 #define DEF_ATTR_IDENT(ENUM, STRING) \
6531 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6532 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6533 built_in_attributes[(int) ENUM] \
6534 = tree_cons (built_in_attributes[(int) PURPOSE], \
6535 built_in_attributes[(int) VALUE], \
6536 built_in_attributes[(int) CHAIN]);
6538 #undef DEF_ATTR_NULL_TREE
6539 #undef DEF_ATTR_INT
6540 #undef DEF_ATTR_IDENT
6541 #undef DEF_ATTR_TREE_LIST
6542 }
6544 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6545 identifier as an argument, so the front end shouldn't look it up. */
6547 bool
6549 {
6552 /* Unknown attribute that we'll end up ignoring, return true so we
6553 don't complain about an identifier argument. */
6559 else
6561 }
6563 /* Attribute handlers common to C front ends. */
6565 /* Handle a "packed" attribute; arguments as in
6566 struct attribute_spec.handler. */
6568 static tree
6571 {
6573 {
6575 /* Still pack bitfields. */
6580 else
6582 }
6583 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6584 used for DECL_REGISTER. It wouldn't mean anything anyway.
6585 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6586 that changes what the typedef is typing. */
6587 else
6588 {
6591 }
6594 }
6596 static tree
6600 {
6606 }
6608 /* Handle a "nocommon" attribute; arguments as in
6609 struct attribute_spec.handler. */
6611 static tree
6615 {
6618 else
6619 {
6622 }
6625 }
6627 /* Handle a "common" attribute; arguments as in
6628 struct attribute_spec.handler. */
6630 static tree
6633 {
6636 else
6637 {
6640 }
6643 }
6645 /* Handle a "noreturn" attribute; arguments as in
6646 struct attribute_spec.handler. */
6648 static tree
6651 {
6654 /* See FIXME comment in c_common_attribute_table. */
6661 = (build_qualified_type
6662 (build_pointer_type
6666 else
6667 {
6670 }
6673 }
6675 /* Handle a "hot" and attribute; arguments as in
6676 struct attribute_spec.handler. */
6678 static tree
6681 {
6684 {
6686 {
6690 }
6691 /* Most of the rest of the hot processing is done later with
6692 lookup_attribute. */
6693 }
6694 else
6695 {
6698 }
6701 }
6703 /* Handle a "cold" and attribute; arguments as in
6704 struct attribute_spec.handler. */
6706 static tree
6709 {
6712 {
6714 {
6718 }
6719 /* Most of the rest of the cold processing is done later with
6720 lookup_attribute. */
6721 }
6722 else
6723 {
6726 }
6729 }
6731 /* Handle a "no_sanitize_address" attribute; arguments as in
6732 struct attribute_spec.handler. */
6734 static tree
6737 {
6739 {
6742 }
6745 }
6747 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6748 struct attribute_spec.handler. */
6750 static tree
6753 {
6762 }
6764 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6765 struct attribute_spec.handler. */
6767 static tree
6770 {
6772 {
6775 }
6778 }
6780 /* Handle a "noinline" attribute; arguments as in
6781 struct attribute_spec.handler. */
6783 static tree
6787 {
6789 {
6791 {
6795 }
6796 else
6798 }
6799 else
6800 {
6803 }
6806 }
6808 /* Handle a "noclone" attribute; arguments as in
6809 struct attribute_spec.handler. */
6811 static tree
6815 {
6817 {
6820 }
6823 }
6825 /* Handle a "always_inline" attribute; arguments as in
6826 struct attribute_spec.handler. */
6828 static tree
6833 {
6835 {
6837 {
6841 }
6842 else
6843 /* Set the attribute and mark it for disregarding inline
6844 limits. */
6846 }
6847 else
6848 {
6851 }
6854 }
6856 /* Handle a "gnu_inline" attribute; arguments as in
6857 struct attribute_spec.handler. */
6859 static tree
6864 {
6866 {
6867 /* Do nothing else, just set the attribute. We'll get at
6868 it later with lookup_attribute. */
6869 }
6870 else
6871 {
6874 }
6877 }
6879 /* Handle a "leaf" attribute; arguments as in
6880 struct attribute_spec.handler. */
6882 static tree
6886 {
6888 {
6891 }
6893 {
6896 }
6899 }
6901 /* Handle an "artificial" attribute; arguments as in
6902 struct attribute_spec.handler. */
6904 static tree
6909 {
6911 {
6912 /* Do nothing else, just set the attribute. We'll get at
6913 it later with lookup_attribute. */
6914 }
6915 else
6916 {
6919 }
6922 }
6924 /* Handle a "flatten" attribute; arguments as in
6925 struct attribute_spec.handler. */
6927 static tree
6929 tree args ATTRIBUTE_UNUSED,
6931 {
6933 /* Do nothing else, just set the attribute. We'll get at
6934 it later with lookup_attribute. */
6935 ;
6936 else
6937 {
6940 }
6943 }
6945 /* Handle a "warning" or "error" attribute; arguments as in
6946 struct attribute_spec.handler. */
6948 static tree
6951 {
6954 /* Do nothing else, just set the attribute. We'll get at
6955 it later with lookup_attribute. */
6956 ;
6957 else
6958 {
6961 }
6964 }
6966 /* Handle a "used" attribute; arguments as in
6967 struct attribute_spec.handler. */
6969 static tree
6972 {
6978 {
6983 }
6984 else
6985 {
6988 }
6991 }
6993 /* Handle a "unused" attribute; arguments as in
6994 struct attribute_spec.handler. */
6995 static tree
6998 {
7006 {
7011 }
7012 else
7013 {
7016 }
7018 }
7021 static tree
7025 {
7031 }
7033 /* Handle a "externally_visible" attribute; arguments as in
7034 struct attribute_spec.handler. */
7036 static tree
7041 {
7045 {
7048 {
7052 }
7053 }
7054 else
7055 {
7058 }
7061 }
7063 /* Handle the "no_reorder" attribute. Arguments as in
7064 struct attribute_spec.handler. */
7066 static tree
7068 tree name,
7069 tree,
7072 {
7077 {
7080 name);
7082 }
7085 }
7087 /* Handle a "const" attribute; arguments as in
7088 struct attribute_spec.handler. */
7090 static tree
7093 {
7096 /* See FIXME comment on noreturn in c_common_attribute_table. */
7102 = (build_qualified_type
7103 (build_pointer_type
7107 else
7108 {
7111 }
7114 }
7116 /* Handle a "transparent_union" attribute; arguments as in
7117 struct attribute_spec.handler. */
7119 static tree
7123 {
7128 {
7129 /* Make sure that the first field will work for a transparent union.
7130 If the type isn't complete yet, leave the check to the code in
7131 finish_struct. */
7133 {
7139 }
7142 {
7143 /* If the type isn't complete yet, setting the flag
7144 on a variant wouldn't ever be checked. */
7148 /* build_duplicate_type doesn't work for C++. */
7152 /* A type variant isn't good enough, since we don't a cast
7153 to such a type removed as a no-op. */
7155 }
7159 }
7161 ignored:
7164 }
7167 static tree
7170 {
7179 }
7181 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7182 get the requested priority for a constructor or destructor,
7183 possibly issuing diagnostics for invalid or reserved
7184 priorities. */
7186 static priority_type
7188 {
7189 HOST_WIDE_INT pri;
7190 tree arg;
7196 {
7199 else
7202 }
7219 {
7222 "destructor priorities from 0 to %d are reserved "
7224 MAX_RESERVED_INIT_PRIORITY);
7225 else
7227 "constructor priorities from 0 to %d are reserved "
7229 MAX_RESERVED_INIT_PRIORITY);
7230 }
7233 invalid:
7236 MAX_INIT_PRIORITY);
7237 else
7239 MAX_INIT_PRIORITY);
7241 }
7243 /* Handle a "constructor" attribute; arguments as in
7244 struct attribute_spec.handler. */
7246 static tree
7250 {
7257 {
7258 priority_type priority;
7263 }
7264 else
7265 {
7268 }
7271 }
7273 /* Handle a "destructor" attribute; arguments as in
7274 struct attribute_spec.handler. */
7276 static tree
7280 {
7287 {
7288 priority_type priority;
7293 }
7294 else
7295 {
7298 }
7301 }
7303 /* Nonzero if the mode is a valid vector mode for this architecture.
7304 This returns nonzero even if there is no hardware support for the
7305 vector mode, but we can emulate with narrower modes. */
7307 static int
7309 {
7311 machine_mode innermode;
7313 /* Doh! What's going on? */
7322 /* Hardware support. Woo hoo! */
7328 /* We should probably return 1 if requesting V4DI and we have no DI,
7329 but we have V2DI, but this is probably very unlikely. */
7331 /* If we have support for the inner mode, we can safely emulate it.
7332 We may not have V2DI, but me can emulate with a pair of DIs. */
7334 }
7337 /* Handle a "mode" attribute; arguments as in
7338 struct attribute_spec.handler. */
7340 static tree
7343 {
7351 else
7352 {
7357 tree typefm;
7362 {
7368 }
7370 /* Change this type to have a type with the specified mode.
7371 First check for the special modes. */
7384 else
7387 {
7390 }
7393 {
7396 }
7400 {
7432 }
7434 {
7437 }
7440 {
7445 {
7448 }
7452 else
7455 }
7456 else
7457 {
7458 /* For fixed-point modes, we need to test if the signness of type
7459 and the machine mode are consistent. */
7462 {
7465 }
7466 /* For fixed-point modes, we need to pass saturating info. */
7470 }
7473 {
7476 }
7478 {
7479 /* For enumeral types, copy the precision from the integer
7480 type returned above. If not an INTEGER_TYPE, we can't use
7481 this mode for this type. */
7483 {
7486 }
7489 {
7492 }
7493 else
7494 {
7495 /* We cannot build a type variant, as there's code that assumes
7496 that TYPE_MAIN_VARIANT has the same mode. This includes the
7497 debug generators. Instead, create a subrange type. This
7498 results in all of the enumeral values being emitted only once
7499 in the original, and the subtype gets them by reference. */
7502 else
7505 }
7506 }
7510 {
7513 }
7516 }
7519 }
7521 /* Handle a "section" attribute; arguments as in
7522 struct attribute_spec.handler. */
7524 static tree
7527 {
7531 {
7537 {
7541 {
7543 "section attribute cannot be specified for "
7546 }
7548 /* The decl may have already been given a section attribute
7549 from a previous declaration. Ensure they match. */
7553 {
7557 }
7561 {
7564 }
7565 else
7568 }
7569 else
7570 {
7573 }
7574 }
7575 else
7576 {
7580 }
7583 }
7585 /* Check whether ALIGN is a valid user-specified alignment. If so,
7586 return its base-2 log; if not, output an error and return -1. If
7587 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7588 no error. */
7589 int
7591 {
7598 {
7601 }
7606 {
7609 }
7611 {
7614 }
7616 }
7618 /*
7619 If in c++-11, check if the c++-11 alignment constraint with respect
7620 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7621 c++-11 mode, does nothing.
7623 [dcl.align]2/ says:
7625 [* if the constant expression evaluates to a fundamental alignment,
7626 the alignment requirement of the declared entity shall be the
7627 specified fundamental alignment.
7629 * if the constant expression evaluates to an extended alignment
7630 and the implementation supports that alignment in the context
7631 of the declaration, the alignment of the declared entity shall
7632 be that alignment
7634 * if the constant expression evaluates to an extended alignment
7635 and the implementation does not support that alignment in the
7636 context of the declaration, the program is ill-formed]. */
7638 static bool
7642 {
7655 {
7657 {
7658 /* For file scope variables and static members, the target
7659 supports alignments that are at most
7660 MAX_OFILE_ALIGNMENT. */
7663 }
7664 else
7665 {
7666 #ifdef BIGGEST_FIELD_ALIGNMENT
7667 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7668 #else
7669 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7670 #endif
7671 /* For non-static members, the target supports either
7672 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7673 if it is defined or BIGGEST_ALIGNMENT. */
7678 #undef MAX_TARGET_FIELD_ALIGNMENT
7679 /* For stack variables, the target supports at most
7680 MAX_STACK_ALIGNMENT. */
7684 }
7685 }
7687 {
7688 /* Let's be liberal for types. */
7691 }
7699 }
7701 /* Return the alignment expression from tree_list element ARGS. */
7703 static tree
7705 {
7706 tree align_expr;
7709 {
7714 }
7715 else
7719 }
7721 /* Set the type alignment fields of NODE, based on FLAGS to I. */
7723 static void
7725 {
7731 }
7733 /* Handle a "aligned" attribute; arguments as in
7734 struct attribute_spec.handler. */
7736 static tree
7739 {
7740 tree align_expr;
7748 else
7752 }
7755 static tree
7758 {
7759 tree align_expr;
7767 {
7769 }
7774 {
7777 }
7780 /* C++-11 [dcl.align/4]:
7782 When multiple alignment-specifiers are specified for an
7783 entity, the alignment requirement shall be set to the
7784 strictest specified alignment.
7786 This formally comes from the c++11 specification but we are
7787 doing it for the GNU attribute syntax as well. */
7791 {
7796 else
7800 }
7801 else
7802 {
7805 }
7808 }
7810 /* Handle a "weak" attribute; arguments as in
7811 struct attribute_spec.handler. */
7813 static tree
7818 {
7821 {
7824 }
7826 {
7830 }
7833 {
7838 }
7839 else
7843 }
7845 /* Handle an "alias" or "ifunc" attribute; arguments as in
7846 struct attribute_spec.handler, except that IS_ALIAS tells us
7847 whether this is an alias as opposed to ifunc attribute. */
7849 static tree
7852 {
7857 {
7860 }
7864 /* A static variable declaration is always a tentative definition,
7865 but the alias is a non-tentative definition which overrides. */
7868 {
7872 }
7876 {
7880 }
7882 /* Note that the very first time we process a nested declaration,
7883 decl_function_context will not be set. Indeed, *would* never
7884 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7885 we do below. After such frobbery, pushdecl would set the context.
7886 In any case, this is never what we want. */
7888 {
7889 tree id;
7893 {
7897 }
7899 /* This counts as a use of the object pointed to. */
7904 else
7908 /* ifuncs are also aliases, so set that attribute too. */
7911 }
7912 else
7913 {
7916 }
7919 {
7922 {
7925 else
7927 }
7928 }
7932 }
7934 /* Handle an "alias" or "ifunc" attribute; arguments as in
7935 struct attribute_spec.handler. */
7937 static tree
7940 {
7942 }
7944 /* Handle an "alias" or "ifunc" attribute; arguments as in
7945 struct attribute_spec.handler. */
7947 static tree
7950 {
7952 }
7954 /* Handle a "weakref" attribute; arguments as in struct
7955 attribute_spec.handler. */
7957 static tree
7960 {
7963 /* We must ignore the attribute when it is associated with
7964 local-scoped decls, since attribute alias is ignored and many
7965 such symbols do not even have a DECL_WEAK field. */
7967 || current_function_decl
7969 {
7973 }
7976 {
7980 }
7982 /* The idea here is that `weakref("name")' mutates into `weakref,
7983 alias("name")', and weakref without arguments, in turn,
7984 implicitly adds weak. */
7987 {
7994 }
7995 else
7996 {
8001 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8002 and that isn't supported; and because it wants to add it to
8003 the list of weak decls, which isn't helpful. */
8005 }
8008 {
8012 }
8015 }
8017 /* Process the DECL common parts of handle_visibility_attribute. */
8019 static void
8021 {
8032 else
8033 {
8034 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8036 }
8040 {
8051 }
8055 }
8057 /* Handle an "visibility" attribute; arguments as in
8058 struct attribute_spec.handler. */
8059 static tree
8063 {
8068 {
8071 }
8074 {
8077 }
8080 /* Go ahead and attach the attribute to the node as well. This is needed
8081 so we can determine whether we have VISIBILITY_DEFAULT because the
8082 visibility was not specified, or because it was explicitly overridden
8083 from the containing scope. */
8086 }
8089 static tree
8093 {
8094 tree decl;
8100 {
8102 name);
8104 }
8106 {
8110 }
8113 {
8116 }
8123 {
8125 name);
8127 }
8131 /* Go ahead and attach the attribute to the node as well. This is needed
8132 so we can determine whether we have VISIBILITY_DEFAULT because the
8133 visibility was not specified, or because it was explicitly overridden
8134 from the containing scope. */
8137 }
8139 /* Determine the ELF symbol visibility for DECL, which is either a
8140 variable or a function. It is an error to use this function if a
8141 definition of DECL is not available in this translation unit.
8142 Returns true if the final visibility has been determined by this
8143 function; false if the caller is free to make additional
8144 modifications. */
8146 bool
8148 {
8152 /* If the user explicitly specified the visibility with an
8153 attribute, honor that. DECL_VISIBILITY will have been set during
8154 the processing of the attribute. We check for an explicit
8155 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8156 to distinguish the use of an attribute from the use of a "#pragma
8157 GCC visibility push(...)"; in the latter case we still want other
8158 considerations to be able to overrule the #pragma. */
8160 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8165 /* Set default visibility to whatever the user supplied with
8166 visibility_specified depending on #pragma GCC visibility. */
8168 {
8171 {
8174 /* If visibility changed and DECL already has DECL_RTL, ensure
8175 symbol flags are updated. */
8180 }
8181 }
8183 }
8185 /* Handle an "tls_model" attribute; arguments as in
8186 struct attribute_spec.handler. */
8188 static tree
8191 {
8192 tree id;
8199 {
8202 }
8207 {
8210 }
8220 else
8221 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8225 }
8227 /* Handle a "no_instrument_function" attribute; arguments as in
8228 struct attribute_spec.handler. */
8230 static tree
8235 {
8239 {
8243 }
8244 else
8248 }
8250 /* Handle a "malloc" attribute; arguments as in
8251 struct attribute_spec.handler. */
8253 static tree
8256 {
8260 else
8261 {
8264 }
8267 }
8269 /* Handle a "alloc_size" attribute; arguments as in
8270 struct attribute_spec.handler. */
8272 static tree
8275 {
8278 {
8285 || !arg_count
8287 {
8292 }
8293 }
8295 }
8297 /* Handle a "alloc_align" attribute; arguments as in
8298 struct attribute_spec.handler. */
8300 static tree
8303 {
8310 || !arg_count
8312 {
8317 }
8319 }
8321 /* Handle a "assume_aligned" attribute; arguments as in
8322 struct attribute_spec.handler. */
8324 static tree
8327 {
8329 {
8336 {
8341 }
8342 }
8344 }
8346 /* Handle a "fn spec" attribute; arguments as in
8347 struct attribute_spec.handler. */
8349 static tree
8353 {
8358 }
8360 /* Handle a "bnd_variable_size" attribute; arguments as in
8361 struct attribute_spec.handler. */
8363 static tree
8366 {
8368 {
8371 }
8374 }
8376 /* Handle a "bnd_legacy" attribute; arguments as in
8377 struct attribute_spec.handler. */
8379 static tree
8382 {
8384 {
8387 }
8390 }
8392 /* Handle a "bnd_instrument" attribute; arguments as in
8393 struct attribute_spec.handler. */
8395 static tree
8398 {
8400 {
8403 }
8406 }
8408 /* Handle a "warn_unused" attribute; arguments as in
8409 struct attribute_spec.handler. */
8411 static tree
8413 tree name ATTRIBUTE_UNUSED,
8414 tree args ATTRIBUTE_UNUSED,
8417 {
8418 /* Do nothing else, just set the attribute. We'll get at
8419 it later with lookup_attribute. */
8421 }
8423 static tree
8425 tree name ATTRIBUTE_UNUSED,
8426 tree args ATTRIBUTE_UNUSED,
8429 {
8430 /* Do nothing else, just set the attribute. We'll get at
8431 it later with lookup_attribute. */
8433 }
8435 /* Handle an "omp declare simd" attribute; arguments as in
8436 struct attribute_spec.handler. */
8438 static tree
8440 {
8442 }
8444 /* Handle an "omp declare target" attribute; arguments as in
8445 struct attribute_spec.handler. */
8447 static tree
8449 {
8451 }
8453 /* Handle a "returns_twice" attribute; arguments as in
8454 struct attribute_spec.handler. */
8456 static tree
8459 {
8462 else
8463 {
8466 }
8469 }
8471 /* Handle a "no_limit_stack" attribute; arguments as in
8472 struct attribute_spec.handler. */
8474 static tree
8479 {
8483 {
8487 }
8489 {
8493 }
8494 else
8498 }
8500 /* Handle a "pure" attribute; arguments as in
8501 struct attribute_spec.handler. */
8503 static tree
8506 {
8509 /* ??? TODO: Support types. */
8510 else
8511 {
8514 }
8517 }
8519 /* Digest an attribute list destined for a transactional memory statement.
8520 ALLOWED is the set of attributes that are allowed for this statement;
8521 return the attribute we parsed. Multiple attributes are never allowed. */
8523 int
8525 {
8530 {
8538 {
8541 }
8544 {
8547 }
8550 else
8552 }
8555 }
8557 /* Transform a TM attribute name into a maskable integer and back.
8558 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8559 to how the lack of an attribute is treated. */
8561 int
8563 {
8577 }
8579 tree
8581 {
8584 {
8602 }
8604 }
8606 /* Return the first TM attribute seen in LIST. */
8608 tree
8610 {
8612 {
8616 }
8618 }
8620 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8621 Here we accept only function types, and verify that none of the other
8622 function TM attributes are also applied. */
8623 /* ??? We need to accept class types for C++, but not C. This greatly
8624 complicates this function, since we can no longer rely on the extra
8625 processing given by function_type_required. */
8627 static tree
8630 {
8631 /* Only one path adds the attribute; others don't. */
8635 {
8638 /* Only tm_callable and tm_safe apply to classes. */
8641 /* FALLTHRU */
8645 {
8648 ;
8651 else
8653 }
8657 {
8660 {
8665 }
8666 }
8667 /* FALLTHRU */
8670 /* If a function is next, pass it on to be tried next. */
8674 ignored:
8677 }
8680 }
8682 /* Handle the TM_WRAP attribute; arguments as in
8683 struct attribute_spec.handler. */
8685 static tree
8688 {
8691 /* We don't need the attribute even on success, since we
8692 record the entry in an external table. */
8697 else
8698 {
8701 ;
8706 else
8707 {
8711 {
8715 else
8717 }
8718 else
8720 }
8721 }
8724 }
8726 /* Ignore the given attribute. Used when this attribute may be usefully
8727 overridden by the target, but is not used generically. */
8729 static tree
8733 {
8736 }
8738 /* Handle a "no vops" attribute; arguments as in
8739 struct attribute_spec.handler. */
8741 static tree
8745 {
8749 }
8751 /* Handle a "deprecated" attribute; arguments as in
8752 struct attribute_spec.handler. */
8754 static tree
8758 {
8762 {
8765 }
8772 }
8775 static tree
8779 {
8786 {
8789 }
8798 else
8799 {
8803 {
8809 }
8812 else
8814 }
8817 }
8819 /* Handle a "vector_size" attribute; arguments as in
8820 struct attribute_spec.handler. */
8822 static tree
8826 {
8828 machine_mode orig_mode;
8839 {
8842 }
8844 /* Get the vector size (in bytes). */
8847 /* We need to provide for vector pointers, vector arrays, and
8848 functions returning vectors. For example:
8850 __attribute__((vector_size(16))) short *foo;
8852 In this case, the mode is SI, but the type being modified is
8853 HI, so we need to look further. */
8862 /* Get the mode of the type being modified. */
8873 {
8876 }
8879 {
8882 }
8885 {
8888 }
8890 /* Calculate how many units fit in the vector. */
8893 {
8896 }
8900 /* Build back pointers if needed. */
8904 }
8906 /* Handle the "nonnull" attribute. */
8907 static tree
8911 {
8915 /* If no arguments are specified, all pointer arguments should be
8916 non-null. Verify a full prototype is given so that the arguments
8917 will have the correct types when we actually check them later. */
8919 {
8921 {
8924 }
8926 }
8928 /* Argument list specified. Verify that each argument number references
8929 a pointer argument. */
8931 {
8940 {
8945 }
8948 {
8949 function_args_iterator iter;
8950 tree argument;
8954 {
8958 }
8962 {
8967 }
8970 {
8975 }
8976 }
8977 }
8980 }
8982 /* Check the argument list of a function call for null in argument slots
8983 that are marked as requiring a non-null pointer argument. The NARGS
8984 arguments are passed in the array ARGARRAY.
8985 */
8987 static void
8989 {
8990 tree a;
8998 /* See if any of the nonnull attributes has no arguments. If so,
8999 then every pointer argument is checked (in which case the check
9000 for pointer type is done in check_nonnull_arg). */
9002 do
9010 else
9011 {
9012 /* Walk the argument list. If we encounter an argument number we
9013 should check for non-null, do it. */
9015 {
9017 {
9021 }
9026 }
9027 }
9028 }
9030 /* Check that the Nth argument of a function call (counting backwards
9031 from the end) is a (pointer)0. The NARGS arguments are passed in the
9032 array ARGARRAY. */
9034 static void
9036 {
9040 {
9043 tree sentinel;
9044 function_args_iterator iter;
9045 tree t;
9047 /* Skip over the named arguments. */
9049 {
9052 len++;
9053 }
9056 {
9059 }
9061 /* The sentinel must be one of the varargs, i.e.
9062 in position >= the number of fixed arguments. */
9064 {
9068 }
9070 /* Validate the sentinel. */
9074 /* Although __null (in C++) is only an integer we allow it
9075 nevertheless, as we are guaranteed that it's exactly
9076 as wide as a pointer, and we don't want to force
9077 users to cast the NULL they have written there.
9078 We warn with -Wstrict-null-sentinel, though. */
9081 }
9082 }
9084 /* Helper for check_function_nonnull; given a list of operands which
9085 must be non-null in ARGS, determine if operand PARAM_NUM should be
9086 checked. */
9088 static bool
9090 {
9094 {
9101 }
9103 }
9105 /* Check that the function argument PARAM (which is operand number
9106 PARAM_NUM) is non-null. This is called by check_function_nonnull
9107 via check_function_arguments_recurse. */
9109 static void
9112 {
9113 /* Just skip checking the argument if it's not a pointer. This can
9114 happen if the "nonnull" attribute was given without an operand
9115 list (which means to check every pointer argument). */
9123 }
9125 /* Helper for nonnull attribute handling; fetch the operand number
9126 from the attribute argument list. */
9128 static bool
9130 {
9131 /* Verify the arg number is a small constant. */
9133 {
9136 }
9137 else
9139 }
9141 /* Handle a "nothrow" attribute; arguments as in
9142 struct attribute_spec.handler. */
9144 static tree
9147 {
9150 /* ??? TODO: Support types. */
9151 else
9152 {
9155 }
9158 }
9160 /* Handle a "cleanup" attribute; arguments as in
9161 struct attribute_spec.handler. */
9163 static tree
9166 {
9170 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9171 for global destructors in C++. This requires infrastructure that
9172 we don't have generically at the moment. It's also not a feature
9173 we'd be missing too much, since we do have attribute constructor. */
9175 {
9179 }
9181 /* Verify that the argument is a function in scope. */
9182 /* ??? We could support pointers to functions here as well, if
9183 that was considered desirable. */
9186 {
9190 }
9193 {
9197 }
9199 /* That the function has proper type is checked with the
9200 eventual call to build_function_call. */
9203 }
9205 /* Handle a "warn_unused_result" attribute. No special handling. */
9207 static tree
9211 {
9212 /* Ignore the attribute for functions not returning any value. */
9214 {
9217 }
9220 }
9222 /* Handle a "sentinel" attribute. */
9224 static tree
9227 {
9229 {
9233 }
9234 else
9235 {
9237 {
9241 }
9242 }
9245 {
9253 {
9257 }
9258 else
9259 {
9261 {
9265 }
9266 }
9267 }
9270 }
9272 /* Handle a "type_generic" attribute. */
9274 static tree
9278 {
9279 /* Ensure we have a function type. */
9282 /* Ensure we have a variadic function. */
9286 }
9288 /* Handle a "target" attribute. */
9290 static tree
9293 {
9294 /* Ensure we have a function type. */
9296 {
9299 }
9301 flags))
9305 }
9307 /* Arguments being collected for optimization. */
9312 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9313 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9314 false for #pragma GCC optimize. */
9316 bool
9318 {
9326 tree ap;
9328 /* Build up argv vector. Just in case the string is stored away, use garbage
9329 collected strings. */
9334 {
9338 {
9342 }
9345 {
9346 /* Split string into multiple substrings. */
9354 {
9361 {
9365 }
9366 else
9367 {
9370 }
9374 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9375 options. */
9377 {
9382 else
9386 }
9389 {
9392 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9393 itself is -Os, and any other switch begins with a -f. */
9399 }
9404 }
9406 }
9407 }
9417 /* Now parse the options. */
9427 /* Don't allow changing -fstrict-aliasing. */
9432 }
9434 /* For handling "optimize" attribute. arguments as in
9435 struct attribute_spec.handler. */
9437 static tree
9440 {
9441 /* Ensure we have a function type. */
9443 {
9446 }
9447 else
9448 {
9452 /* Save current options. */
9455 /* If we previously had some optimization options, use them as the
9456 default. */
9461 /* Parse options, and update the vector. */
9466 /* Restore current options. */
9468 }
9471 }
9473 /* Handle a "no_split_stack" attribute. */
9475 static tree
9480 {
9484 {
9488 }
9490 {
9494 }
9497 }
9499 /* Handle a "returns_nonnull" attribute; arguments as in
9500 struct attribute_spec.handler. */
9502 static tree
9505 {
9506 // Even without a prototype we still have a return type we can check.
9508 {
9511 }
9513 }
9515 /* Handle a "designated_init" attribute; arguments as in
9516 struct attribute_spec.handler. */
9518 static tree
9521 {
9523 {
9526 }
9528 }
9530 \f
9531 /* Check for valid arguments being passed to a function with FNTYPE.
9532 There are NARGS arguments in the array ARGARRAY. */
9533 void
9535 {
9536 /* Check for null being passed in a pointer argument that must be
9537 non-null. We also need to do this if format checking is enabled. */
9542 /* Check for errors in format strings. */
9549 }
9551 /* Generic argument checking recursion routine. PARAM is the argument to
9552 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9553 once the argument is resolved. CTX is context for the callback. */
9554 void
9559 {
9563 {
9564 /* Strip coercion. */
9568 }
9571 {
9573 tree attrs;
9576 /* See if this is a call to a known internationalization function
9577 that modifies a format arg. Such a function may have multiple
9578 format_arg attributes (for example, ngettext). */
9581 attrs;
9584 {
9585 tree inner_arg;
9586 tree format_num_expr;
9589 call_expr_arg_iterator iter;
9591 /* Extract the argument number, which was previously checked
9592 to be valid. */
9601 {
9606 }
9607 }
9609 /* If we found a format_arg attribute and did a recursive check,
9610 we are done with checking this argument. Otherwise, we continue
9611 and this will be considered a non-literal. */
9614 }
9617 {
9618 /* Check both halves of the conditional expression. */
9624 }
9627 }
9629 /* Checks for a builtin function FNDECL that the number of arguments
9630 NARGS against the required number REQUIRED and issues an error if
9631 there is a mismatch. Returns true if the number of arguments is
9632 correct, otherwise false. */
9634 static bool
9636 {
9638 {
9642 }
9644 {
9648 }
9650 }
9652 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9653 Returns false if there was an error, otherwise true. */
9655 bool
9657 {
9663 {
9673 {
9675 {
9679 }
9681 }
9691 {
9698 {
9702 }
9704 }
9709 {
9714 {
9718 }
9721 {
9723 fndecl);
9725 }
9727 }
9732 {
9734 {
9737 }
9739 }
9746 {
9750 {
9754 }
9757 {
9761 }
9763 }
9768 }
9769 }
9771 /* Function to help qsort sort FIELD_DECLs by name order. */
9773 int
9775 {
9780 /* A nontype is "greater" than a type. */
9789 }
9792 gt_pointer_operator new_value;
9796 /* This routine compares two fields like field_decl_cmp but using the
9797 pointer operator in resort_data. */
9799 static int
9801 {
9806 /* A nontype is "greater" than a type. */
9812 {
9819 }
9821 }
9823 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9825 void
9828 gt_pointer_operator new_value,
9830 {
9835 resort_field_decl_cmp);
9836 }
9838 /* Subroutine of c_parse_error.
9839 Return the result of concatenating LHS and RHS. RHS is really
9840 a string literal, its first character is indicated by RHS_START and
9841 RHS_SIZE is its length (including the terminating NUL character).
9843 The caller is responsible for deleting the returned pointer. */
9847 {
9853 }
9855 /* Issue the error given by GMSGID, indicating that it occurred before
9856 TOKEN, which had the associated VALUE. */
9858 void
9861 {
9862 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9872 {
9877 {
9890 }
9894 else
9900 }
9922 {
9927 }
9935 {
9940 }
9941 else
9945 {
9948 }
9949 #undef catenate_messages
9950 }
9952 /* Return the gcc option code associated with the reason for a cpp
9953 message, or 0 if none. */
9955 static int
9957 {
9961 {
9964 }
9966 }
9968 /* Callback from cpp_error for PFILE to print diagnostics from the
9969 preprocessor. The diagnostic is of type LEVEL, with REASON set
9970 to the reason code if LEVEL is represents a warning, at location
9971 LOCATION unless this is after lexing and the compiler's location
9972 should be used instead, with column number possibly overridden by
9973 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9974 the arguments. Returns true if a diagnostic was emitted, false
9975 otherwise. */
9977 bool
9981 {
9982 diagnostic_info diagnostic;
9983 diagnostic_t dlevel;
9988 {
9993 /* Fall through. */
10018 }
10031 }
10033 /* Convert a character from the host to the target execution character
10034 set. cpplib handles this, mostly. */
10036 HOST_WIDE_INT
10038 {
10039 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10040 zero-extended under -fno-signed-char. cpplib insists that characters
10041 and character constants are always unsigned. Hence we must convert
10042 back and forth. */
10050 else
10052 }
10054 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10055 references with an INDIRECT_REF of a constant at the bottom; much like the
10056 traditional rendering of offsetof as a macro. Return the folded result. */
10058 tree
10060 {
10064 {
10080 {
10083 }
10093 {
10097 }
10110 /* Check if the offset goes beyond the upper bound of the array. */
10112 {
10118 {
10122 {
10123 tree v;
10130 {
10138 }
10139 /* Don't warn if the array might be considered a poor
10140 man's flexible array member with a very permissive
10141 definition thereof. */
10145 "index %E denotes an offset "
10148 }
10149 }
10150 }
10157 /* Handle static members of volatile structs. */
10164 }
10167 }
10169 /* Likewise, but convert it to the return type of offsetof. */
10171 tree
10173 {
10175 }
10177 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10178 expression, because B will always be true. */
10180 void
10182 {
10185 "the omitted middle operand in ?: will always be %<true%>, "
10187 }
10189 /* Give an error for storing into ARG, which is 'const'. USE indicates
10190 how ARG was being used. */
10192 void
10194 {
10197 /* Using this macro rather than (for example) arrays of messages
10198 ensures that all the format strings are checked at compile
10199 time. */
10200 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10201 : (use == lv_increment ? (I) \
10202 : (use == lv_decrement ? (D) : (AS))))
10204 {
10215 else
10221 }
10227 arg);
10233 arg);
10235 {
10245 arg);
10246 }
10252 arg);
10253 else
10258 arg);
10259 }
10261 /* Print an error message for an invalid lvalue. USE says
10262 how the lvalue is being used and so selects the error message. LOC
10263 is the location for the error. */
10265 void
10267 {
10269 {
10287 }
10288 }
10290 /* Print an error message for an invalid indirection of type TYPE.
10291 ERRSTRING is the name of the operator for the indirection. */
10293 void
10295 {
10297 {
10305 type);
10310 type);
10315 type);
10320 type);
10325 type);
10329 }
10330 }
10331 \f
10332 /* *PTYPE is an incomplete array. Complete it with a domain based on
10333 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10334 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10335 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10337 int
10339 {
10347 {
10349 {
10350 int eltsize
10353 }
10355 {
10359 {
10363 }
10364 else
10365 {
10366 tree curindex;
10377 {
10381 else
10382 {
10384 {
10385 /* Since we treat size types now as ordinary
10386 unsigned types, we need an explicit overflow
10387 check. */
10391 }
10393 size_one_node);
10394 }
10397 }
10399 {
10403 }
10404 }
10405 }
10406 else
10407 {
10408 /* Make an error message unless that happened already. */
10411 }
10412 }
10413 else
10414 {
10418 }
10425 else
10428 /* Using build_distinct_type_copy and modifying things afterward instead
10429 of using build_array_type to create a new type preserves all of the
10430 TYPE_LANG_FLAG_? bits that the front end may have set. */
10438 /* Make sure we have the canonical MAIN_TYPE. */
10441 hashcode);
10444 /* Fix the canonical type. */
10454 else
10459 else
10465 {
10467 /* If we proceed with the array type as it is, we'll eventually
10468 crash in tree_to_[su]hwi(). */
10470 }
10474 }
10476 /* Like c_mark_addressable but don't check register qualifier. */
10477 void
10479 {
10485 }
10488 \f
10489 /* Used to help initialize the builtin-types.def table. When a type of
10490 the correct size doesn't exist, use error_mark_node instead of NULL.
10491 The later results in segfaults even when a decl using the type doesn't
10492 get invoked. */
10494 tree
10496 {
10499 }
10501 /* A helper function for resolve_overloaded_builtin in resolving the
10502 overloaded __sync_ builtins. Returns a positive power of 2 if the
10503 first operand of PARAMS is a pointer to a supported data type.
10504 Returns 0 if an error is encountered. */
10506 static int
10508 {
10509 tree type;
10513 {
10516 }
10520 {
10521 /* Force array-to-pointer decay for C++. */
10525 }
10537 incompatible:
10540 }
10542 /* A helper function for resolve_overloaded_builtin. Adds casts to
10543 PARAMS to make arguments match up with those of FUNCTION. Drops
10544 the variadic arguments at the end. Returns false if some error
10545 was encountered; true on success. */
10547 static bool
10550 {
10551 function_args_iterator iter;
10552 tree ptype;
10556 /* We've declared the implementation functions to use "volatile void *"
10557 as the pointer parameter, so we shouldn't get any complaints from the
10558 call to check_function_arguments what ever type the user used. */
10563 /* For the rest of the values, we need to cast these to FTYPE, so that we
10564 don't get warnings for passing pointer types, etc. */
10567 {
10571 /* XXX void_type_node belies the abstraction. */
10577 {
10580 }
10582 /* Only convert parameters if arg_type is unsigned integer type with
10583 new format sync routines, i.e. don't attempt to convert pointer
10584 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10585 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10586 kinds). */
10588 {
10589 /* Ideally for the first conversion we'd use convert_for_assignment
10590 so that we get warnings for anything that doesn't match the pointer
10591 type. This isn't portable across the C and C++ front ends atm. */
10596 }
10599 }
10601 /* __atomic routines are not variadic. */
10603 {
10606 }
10608 /* The definition of these primitives is variadic, with the remaining
10609 being "an optional list of variables protected by the memory barrier".
10610 No clue what that's supposed to mean, precisely, but we consider all
10611 call-clobbered variables to be protected so we're safe. */
10615 }
10617 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10618 RESULT to make it match the type of the first pointer argument in
10619 PARAMS. */
10621 static tree
10623 {
10628 /* New format doesn't require casting unless the types are the same size. */
10631 else
10633 }
10635 /* This function verifies the PARAMS to generic atomic FUNCTION.
10636 It returns the size if all the parameters are the same size, otherwise
10637 0 is returned if the parameters are invalid. */
10639 static int
10642 {
10647 tree type_0;
10649 /* Determine the parameter makeup. */
10651 {
10667 }
10670 {
10673 }
10675 /* Get type of first parameter, and determine its size. */
10678 {
10679 /* Force array-to-pointer decay for C++. */
10683 }
10685 {
10687 function);
10689 }
10691 /* Types must be compile time constant sizes. */
10693 {
10696 function);
10698 }
10702 /* Zero size objects are not allowed. */
10704 {
10707 function);
10709 }
10711 /* Check each other parameter is a pointer and the same size. */
10713 {
10716 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10720 {
10722 function);
10724 }
10728 {
10730 function);
10732 }
10733 }
10735 /* Check memory model parameters for validity. */
10737 {
10740 {
10743 {
10746 function);
10747 }
10748 }
10749 else
10751 {
10753 function);
10755 }
10756 }
10759 }
10762 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10763 at the beginning of the parameter list PARAMS representing the size of the
10764 objects. This is to match the library ABI requirement. LOC is the location
10765 of the function call.
10766 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10767 returned to allow the external call to be constructed. */
10769 static tree
10772 {
10773 tree size_node;
10775 /* Insert a SIZE_T parameter as the first param. If there isn't
10776 enough space, allocate a new vector and recursively re-build with that. */
10778 {
10781 tree f;
10791 }
10793 /* Add the size parameter and leave as a function call for processing. */
10797 }
10800 /* Return whether atomic operations for naturally aligned N-byte
10801 arguments are supported, whether inline or through libatomic. */
10802 static bool
10804 {
10806 {
10818 }
10819 }
10821 /* This will process an __atomic_exchange function call, determine whether it
10822 needs to be mapped to the _N variation, or turned into a library call.
10823 LOC is the location of the builtin call.
10824 FUNCTION is the DECL that has been invoked;
10825 PARAMS is the argument list for the call. The return value is non-null
10826 TRUE is returned if it is translated into the proper format for a call to the
10827 external library, and NEW_RETURN is set the tree for that function.
10828 FALSE is returned if processing for the _N variation is required, and
10829 NEW_RETURN is set to the the return value the result is copied into. */
10830 static bool
10833 {
10838 /* Size of 0 is an error condition. */
10840 {
10843 }
10845 /* If not a lock-free size, change to the library generic format. */
10847 {
10850 }
10852 /* Otherwise there is a lockfree match, transform the call from:
10853 void fn(T* mem, T* desired, T* return, model)
10854 into
10855 *return = (T) (fn (In* mem, (In) *desired, model)) */
10862 /* Create pointer to appropriate size. */
10866 /* Convert object pointer to required type. */
10869 /* Convert new value to required type, and dereference it. */
10874 /* Move memory model to the 3rd position, and end param list. */
10878 /* Convert return pointer and dereference it for later assignment. */
10882 }
10885 /* This will process an __atomic_compare_exchange function call, determine
10886 whether it needs to be mapped to the _N variation, or turned into a lib call.
10887 LOC is the location of the builtin call.
10888 FUNCTION is the DECL that has been invoked;
10889 PARAMS is the argument list for the call. The return value is non-null
10890 TRUE is returned if it is translated into the proper format for a call to the
10891 external library, and NEW_RETURN is set the tree for that function.
10892 FALSE is returned if processing for the _N variation is required. */
10894 static bool
10898 {
10903 /* Size of 0 is an error condition. */
10905 {
10908 }
10910 /* If not a lock-free size, change to the library generic format. */
10912 {
10913 /* The library generic format does not have the weak parameter, so
10914 remove it from the param list. Since a parameter has been removed,
10915 we can be sure that there is room for the SIZE_T parameter, meaning
10916 there will not be a recursive rebuilding of the parameter list, so
10917 there is no danger this will be done twice. */
10919 {
10923 }
10926 }
10928 /* Otherwise, there is a match, so the call needs to be transformed from:
10929 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10930 into
10931 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10937 /* Create pointer to appropriate size. */
10941 /* Convert object pointer to required type. */
10945 /* Convert expected pointer to required type. */
10949 /* Convert desired value to required type, and dereference it. */
10954 /* The rest of the parameters are fine. NULL means no special return value
10955 processing.*/
10958 }
10961 /* This will process an __atomic_load function call, determine whether it
10962 needs to be mapped to the _N variation, or turned into a library call.
10963 LOC is the location of the builtin call.
10964 FUNCTION is the DECL that has been invoked;
10965 PARAMS is the argument list for the call. The return value is non-null
10966 TRUE is returned if it is translated into the proper format for a call to the
10967 external library, and NEW_RETURN is set the tree for that function.
10968 FALSE is returned if processing for the _N variation is required, and
10969 NEW_RETURN is set to the the return value the result is copied into. */
10971 static bool
10974 {
10979 /* Size of 0 is an error condition. */
10981 {
10984 }
10986 /* If not a lock-free size, change to the library generic format. */
10988 {
10991 }
10993 /* Otherwise, there is a match, so the call needs to be transformed from:
10994 void fn(T* mem, T* return, model)
10995 into
10996 *return = (T) (fn ((In *) mem, model)) */
11002 /* Create pointer to appropriate size. */
11006 /* Convert object pointer to required type. */
11010 /* Move memory model to the 2nd position, and end param list. */
11014 /* Convert return pointer and dereference it for later assignment. */
11018 }
11021 /* This will process an __atomic_store function call, determine whether it
11022 needs to be mapped to the _N variation, or turned into a library call.
11023 LOC is the location of the builtin call.
11024 FUNCTION is the DECL that has been invoked;
11025 PARAMS is the argument list for the call. The return value is non-null
11026 TRUE is returned if it is translated into the proper format for a call to the
11027 external library, and NEW_RETURN is set the tree for that function.
11028 FALSE is returned if processing for the _N variation is required, and
11029 NEW_RETURN is set to the the return value the result is copied into. */
11031 static bool
11034 {
11039 /* Size of 0 is an error condition. */
11041 {
11044 }
11046 /* If not a lock-free size, change to the library generic format. */
11048 {
11051 }
11053 /* Otherwise, there is a match, so the call needs to be transformed from:
11054 void fn(T* mem, T* value, model)
11055 into
11056 fn ((In *) mem, (In) *value, model) */
11061 /* Create pointer to appropriate size. */
11065 /* Convert object pointer to required type. */
11069 /* Convert new value to required type, and dereference it. */
11074 /* The memory model is in the right spot already. Return is void. */
11078 }
11081 /* Some builtin functions are placeholders for other expressions. This
11082 function should be called immediately after parsing the call expression
11083 before surrounding code has committed to the type of the expression.
11085 LOC is the location of the builtin call.
11087 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11088 PARAMS is the argument list for the call. The return value is non-null
11089 when expansion is complete, and null if normal processing should
11090 continue. */
11092 tree
11095 {
11101 {
11107 else
11111 }
11113 /* Handle BUILT_IN_NORMAL here. */
11115 {
11120 {
11121 /* Handle these 4 together so that they can fall through to the next
11122 case if the call is transformed to an _N variant. */
11124 {
11126 {
11130 /* Change to the _N variant. */
11133 }
11136 {
11138 params,
11141 /* Change to the _N variant. */
11144 }
11146 {
11150 /* Change to the _N variant. */
11153 }
11155 {
11159 /* Change to the _N variant. */
11162 }
11165 }
11166 /* Fallthrough to the normal processing. */
11167 }
11184 {
11186 /* Fallthru for parameter processing. */
11187 }
11204 {
11215 orig_format))
11220 NULL);
11228 /* If new_return is set, assign function to that expr and cast the
11229 result to void since the generic interface returned void. */
11231 {
11232 /* Cast function result from I{1,2,4,8,16} to the required type. */
11235 result);
11239 }
11241 }
11245 }
11246 }
11248 /* vector_types_compatible_elements_p is used in type checks of vectors
11249 values used as operands of binary operators. Where it returns true, and
11250 the other checks of the caller succeed (being vector types in he first
11251 place, and matching number of elements), we can just treat the types
11252 as essentially the same.
11253 Contrast with vector_targets_convertible_p, which is used for vector
11254 pointer types, and vector_types_convertible_p, which will allow
11255 language-specific matches under the control of flag_lax_vector_conversions,
11256 and might still require a conversion. */
11257 /* True if vector types T1 and T2 can be inputs to the same binary
11258 operator without conversion.
11259 We don't check the overall vector size here because some of our callers
11260 want to give different error messages when the vectors are compatible
11261 except for the element count. */
11263 bool
11265 {
11278 /* Equality works here because c_common_signed_type uses
11279 TYPE_MAIN_VARIANT. */
11287 }
11289 /* Check for missing format attributes on function pointers. LTYPE is
11290 the new type or left-hand side type. RTYPE is the old type or
11291 right-hand side type. Returns TRUE if LTYPE is missing the desired
11292 attribute. */
11294 bool
11296 {
11298 tree ra;
11304 {
11305 tree la;
11310 }
11311 else
11313 }
11315 /* Subscripting with type char is likely to lose on a machine where
11316 chars are signed. So warn on any machine, but optionally. Don't
11317 warn for unsigned char since that type is safe. Don't warn for
11318 signed char because anyone who uses that must have done so
11319 deliberately. Furthermore, we reduce the false positive load by
11320 warning only for non-constant value of type char. */
11322 void
11324 {
11328 }
11330 /* Implement -Wparentheses for the unexpected C precedence rules, to
11331 cover cases like x + y << z which readers are likely to
11332 misinterpret. We have seen an expression in which CODE is a binary
11333 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11334 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11335 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11336 expression was not formed using a binary or unary operator, or it
11337 was enclosed in parentheses. */
11339 void
11343 {
11347 /* This macro tests that the expression ARG with original tree code
11348 CODE appears to be a boolean expression. or the result of folding a
11349 boolean expression. */
11350 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11351 (truth_value_p (TREE_CODE (ARG)) \
11352 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11354 || ((CODE) != INTEGER_CST \
11355 && (integer_onep (ARG) || integer_zerop (ARG))))
11358 {
11407 /* Check cases like x|y==z */
11414 /* Check cases like !x | y */
11418 "suggest parentheses around operand of "
11431 /* Check cases like x^y==z */
11453 /* Check cases like x&y==z */
11460 /* Check cases like !x & y */
11464 "suggest parentheses around operand of "
11487 {
11492 "comparisons like %<X<=Y<=Z%> do not "
11498 "comparisons like %<X<=Y<=Z%> do not "
11500 }
11502 }
11503 #undef NOT_A_BOOLEAN_EXPR_P
11504 }
11506 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11508 void
11510 {
11512 {
11515 else
11517 }
11518 }
11520 /* Warn for division by zero according to the value of DIVISOR. LOC
11521 is the location of the division operator. */
11523 void
11525 {
11526 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11527 about division by zero. Do not issue a warning if DIVISOR has a
11528 floating-point type, since we consider 0.0/0.0 a valid way of
11529 generating a NaN. */
11533 }
11535 /* Subroutine of build_binary_op. Give warnings for comparisons
11536 between signed and unsigned quantities that may fail. Do the
11537 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11538 so that casts will be considered, but default promotions won't
11539 be.
11541 LOCATION is the location of the comparison operator.
11543 The arguments of this function map directly to local variables
11544 of build_binary_op. */
11546 void
11551 {
11556 /* In C++, check for comparison of different enum types. */
11562 {
11566 }
11568 /* Do not warn if the comparison is being done in a signed type,
11569 since the signed type will only be chosen if it can represent
11570 all the values of the unsigned type. */
11573 /* Do not warn if both operands are unsigned. */
11576 else
11577 {
11583 else
11591 /* Do not warn if the signed quantity is an unsuffixed integer
11592 literal (or some static constant expression involving such
11593 literals or a conditional expression involving such literals)
11594 and it is non-negative. */
11597 /* Do not warn if the comparison is an equality operation, the
11598 unsigned quantity is an integral constant, and it would fit
11599 in the result if the result were signed. */
11604 /* In C, do not warn if the unsigned quantity is an enumeration
11605 constant and its maximum value would fit in the result if the
11606 result were signed. */
11612 else
11614 OPT_Wsign_compare,
11616 }
11618 /* Warn if two unsigned values are being compared in a size larger
11619 than their original size, and one (and only one) is the result of
11620 a `~' operator. This comparison will always fail.
11622 Also warn if one operand is a constant, and the constant does not
11623 have all bits set that are set in the ~ operand when it is
11624 extended. */
11631 {
11638 {
11639 tree primop;
11645 {
11649 }
11650 else
11651 {
11655 }
11660 {
11663 {
11667 else
11670 }
11671 }
11672 }
11680 }
11681 }
11683 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11684 type via c_common_type. If -Wdouble-promotion is in use, and the
11685 conditions for warning have been met, issue a warning. GMSGID is
11686 the warning message. It must have two %T specifiers for the type
11687 that was converted (generally "float") and the type to which it was
11688 converted (generally "double), respectively. LOC is the location
11689 to which the awrning should refer. */
11691 void
11694 {
11695 tree source_type;
11699 /* If the conversion will not occur at run-time, there is no need to
11700 warn about it. */
11712 else
11715 }
11717 /* Setup a TYPE_DECL node as a typedef representation.
11719 X is a TYPE_DECL for a typedef statement. Create a brand new
11720 ..._TYPE node (which will be just a variant of the existing
11721 ..._TYPE node with identical properties) and then install X
11722 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11724 The whole point here is to end up with a situation where each
11725 and every ..._TYPE node the compiler creates will be uniquely
11726 associated with AT MOST one node representing a typedef name.
11727 This way, even though the compiler substitutes corresponding
11728 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11729 early on, later parts of the compiler can always do the reverse
11730 translation and get back the corresponding typedef name. For
11731 example, given:
11733 typedef struct S MY_TYPE;
11734 MY_TYPE object;
11736 Later parts of the compiler might only know that `object' was of
11737 type `struct S' if it were not for code just below. With this
11738 code however, later parts of the compiler see something like:
11740 struct S' == struct S
11741 typedef struct S' MY_TYPE;
11742 struct S' object;
11744 And they can then deduce (from the node for type struct S') that
11745 the original object declaration was:
11747 MY_TYPE object;
11749 Being able to do this is important for proper support of protoize,
11750 and also for generating precise symbolic debugging information
11751 which takes full account of the programmer's (typedef) vocabulary.
11753 Obviously, we don't want to generate a duplicate ..._TYPE node if
11754 the TYPE_DECL node that we are now processing really represents a
11755 standard built-in type. */
11757 void
11759 {
11763 {
11766 }
11769 {
11777 }
11778 }
11780 /* Record the types used by the current global variable declaration
11781 being parsed, so that we can decide later to emit their debug info.
11782 Those types are in types_used_by_cur_var_decl, and we are going to
11783 store them in the types_used_by_vars_hash hash table.
11784 DECL is the declaration of the global variable that has been parsed. */
11786 void
11788 {
11792 {
11795 }
11796 }
11798 /* If DECL is a typedef that is declared in the current function,
11799 record it for the purpose of -Wunused-local-typedefs. */
11801 void
11803 {
11808 /* if this is not a locally defined typedef then we are not
11809 interested. */
11816 }
11818 /* If T is a TYPE_DECL declared locally, mark it as used. */
11820 void
11822 {
11827 }
11829 /* Warn if there are some unused locally defined typedefs in the
11830 current function. */
11832 void
11834 {
11836 tree decl;
11837 /* The number of times we have emitted -Wunused-local-typedefs
11838 warnings. If this is different from errorcount, that means some
11839 unrelated errors have been issued. In which case, we'll avoid
11840 emitting "unused-local-typedefs" warnings. */
11852 {
11856 OPT_Wunused_local_typedefs,
11859 }
11862 }
11864 /* Warn about boolean expression compared with an integer value different
11865 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11866 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11867 are the operands of the comparison. The caller must ensure that
11868 either operand is a boolean expression. */
11870 void
11872 tree op1)
11873 {
11883 {
11891 else
11894 }
11895 }
11897 /* The C and C++ parsers both use vectors to hold function arguments.
11898 For efficiency, we keep a cache of unused vectors. This is the
11899 cache. */
11904 /* Return a new vector from the cache. If the cache is empty,
11905 allocate a new vector. These vectors are GC'ed, so it is OK if the
11906 pointer is not released.. */
11910 {
11913 else
11914 {
11915 /* Passing 0 to vec::alloc returns NULL, and our callers require
11916 that we always return a non-NULL value. The vector code uses
11917 4 when growing a NULL vector, so we do too. */
11921 }
11922 }
11924 /* Release a vector of trees back to the cache. */
11926 void
11928 {
11930 {
11933 }
11934 }
11936 /* Get a new tree vector holding a single tree. */
11940 {
11944 }
11946 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11950 {
11955 }
11957 /* Get a new tree vector which is a copy of an existing one. */
11961 {
11964 tree t;
11971 }
11973 /* Return true if KEYWORD starts a type specifier. */
11975 bool
11977 {
11979 {
12013 }
12014 }
12016 /* Return true if KEYWORD names a type qualifier. */
12018 bool
12020 {
12022 {
12030 }
12031 }
12033 /* Return true if KEYWORD names a storage class specifier.
12035 RID_TYPEDEF is not included in this list despite `typedef' being
12036 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12037 such for syntactic convenience only. */
12039 bool
12041 {
12043 {
12053 }
12054 }
12056 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12058 static bool
12060 {
12062 {
12070 }
12071 }
12073 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12074 declaration-specifier (C99 6.7). */
12076 bool
12078 {
12085 {
12092 }
12093 }
12095 /* Initialize language-specific-bits of tree_contains_struct. */
12097 void
12099 {
12103 }
12105 /* Build a user-defined numeric literal out of an integer constant type VALUE
12106 with identifier SUFFIX. */
12108 tree
12111 {
12118 }
12120 /* For vector[index], convert the vector to a
12121 pointer of the underlying type. Return true if the resulting
12122 ARRAY_REF should not be an lvalue. */
12124 bool
12127 {
12130 {
12132 tree type1;
12141 {
12146 {
12149 *vecp
12152 non_const);
12153 }
12154 else
12159 }
12160 else
12167 {
12168 /* If the original vector isn't declared may_alias and it
12169 isn't a bare vector look if the subscripting would
12170 alias the vector we subscript, and if not, force ref-all. */
12176 }
12180 }
12182 }
12184 /* Determine which of the operands, if any, is a scalar that needs to be
12185 converted to a vector, for the range of operations. */
12186 enum stv_conv
12189 {
12198 {
12199 /* Most GENERIC binary expressions require homogeneous arguments.
12200 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12201 argument that is a vector and a second one that is a scalar, so
12202 we never return stv_secondarg for them. */
12207 {
12209 {
12214 }
12215 else
12217 }
12224 /* ... fall through ... */
12245 /* What about UNLT_EXPR? */
12247 {
12248 tree tmp;
12250 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12253 }
12257 {
12259 {
12264 }
12266 }
12268 /* Allow integer --> real conversion if safe. */
12272 {
12274 {
12279 }
12281 }
12284 }
12287 }
12289 /* Return true iff ALIGN is an integral constant that is a fundamental
12290 alignment, as defined by [basic.align] in the c++-11
12291 specifications.
12293 That is:
12295 [A fundamental alignment is represented by an alignment less than or
12296 equal to the greatest alignment supported by the implementation
12297 in all contexts, which is equal to
12298 alignof(max_align_t)]. */
12300 bool
12302 {
12305 }
12307 /* Return true if T is a pointer to a zero-sized aggregate. */
12309 bool
12311 {
12316 }