| blob | 1066c6b96a799f152427f9f352a3709063683bca |
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. */
405 /* Reserved words. The third field is a mask: keywords are disabled
406 if they match the mask.
408 Masks for languages:
409 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
410 C --std=c99: D_CXXONLY | D_OBJC
411 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
412 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
413 C++ --std=c0x: D_CONLY | D_OBJC
414 ObjC++ is like C++ except that D_OBJC is not set
416 If -fno-asm is used, D_ASM is added to the mask. If
417 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
418 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
419 In C with -Wc++-compat, we warn if D_CXXWARN is set.
421 Note the complication of the D_CXX_OBJC keywords. These are
422 reserved words such as 'class'. In C++, 'class' is a reserved
423 word. In Objective-C++ it is too. In Objective-C, it is a
424 reserved word too, but only if it follows an '@' sign.
425 */
427 {
592 /* These Objective-C keywords are recognized only immediately after
593 an '@'. */
610 /* These are recognized only in protocol-qualifier context
611 (see above) */
618 /* These are recognized inside a property attribute list */
627 };
632 /* Table of machine-independent attributes common to all C-like languages.
634 All attributes referencing arguments should be additionally processed
635 in chkp_copy_function_type_adding_bounds for correct instrumentation
636 by Pointer Bounds Checker.
637 Current list of processed common attributes: nonnull. */
639 {
640 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
641 affects_type_identity } */
648 /* FIXME: logically, noreturn attributes should be listed as
649 "false, true, true" and apply to function types. But implementing this
650 would require all the places in the compiler that use TREE_THIS_VOLATILE
651 on a decl to identify non-returning functions to be located and fixed
652 to check the function type instead. */
679 /* The same comments as for noreturn attributes apply to const ones. */
703 handle_no_instrument_function_attribute,
721 /* ??? These two attributes didn't make the transition from the
722 Intel language document to the multi-vendor language document. */
727 /* For internal use (marking of builtins) only. The name contains space
728 to prevent its usage in source code. */
750 /* For internal use (marking of builtins) only. The name contains space
751 to prevent its usage in source code. */
762 handle_no_address_safety_analysis_attribute,
765 handle_no_sanitize_address_attribute,
768 handle_no_sanitize_undefined_attribute,
778 /* For internal use only. The leading '*' both prevents its usage in
779 source code and signals that it may be overridden by machine tables. */
784 /* For internal use (marking of builtins and runtime functions) only.
785 The name contains space to prevent its usage in source code. */
811 };
813 /* Give the specifications for the format attributes, used by C and all
814 descendants.
816 All attributes referencing arguments should be additionally processed
817 in chkp_copy_function_type_adding_bounds for correct instrumentation
818 by Pointer Bounds Checker.
819 Current list of processed format attributes: format, format_arg. */
821 {
822 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
823 affects_type_identity } */
829 };
831 /* Return identifier for address space AS. */
835 {
839 }
841 /* Push current bindings for the function name VAR_DECLS. */
843 void
845 {
850 {
854 {
856 saved);
858 }
859 }
861 /* Normally they'll have been NULL, so only push if we've got a
862 stack, or they are non-NULL. */
864 saved_function_name_decls);
865 }
867 /* Finish up the current bindings, adding them into the current function's
868 statement tree. This must be done _before_ finish_stmt_tree is called.
869 If there is no current function, we must be at file scope and no statements
870 are involved. Pop the previous bindings. */
872 void
874 {
883 {
891 }
897 {
898 /* We had saved values, restore them. */
899 tree saved;
902 {
907 }
909 }
911 }
913 /* Return the text name of the current function, suitably prettified
914 by PRETTY_P. Return string must be freed by caller. */
918 {
925 {
928 }
941 {
944 }
947 }
949 /* Return the VAR_DECL for a const char array naming the current
950 function. If the VAR_DECL has not yet been created, create it
951 now. RID indicates how it should be formatted and IDENTIFIER_NODE
952 ID is its name (unfortunately C and C++ hold the RID values of
953 keywords in different places, so we can't derive RID from ID in
954 this language independent code. LOC is the location of the
955 function. */
957 tree
959 {
969 {
970 /* If a tree is built here, it would normally have the lineno of
971 the current statement. Later this tree will be moved to the
972 beginning of the function and this line number will be wrong.
973 To avoid this problem set the lineno to 0 here; that prevents
974 it from appearing in the RTL. */
975 tree stmts;
983 saved_function_name_decls
987 }
992 }
994 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
996 tree
998 {
1003 /* Compute the number of elements, for the array type. */
1005 {
1008 }
1010 {
1013 }
1015 {
1018 }
1019 else
1020 {
1023 }
1025 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1026 limit in C++98 Annex B is very large (65536) and is not normative,
1027 so we do not diagnose it (warn_overlength_strings is forced off
1028 in c_common_post_options). */
1030 {
1034 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1035 separate the %d from the 'C'. 'ISO' should not be
1036 translated, but it may be moved after 'C%d' in languages
1037 where modifiers follow nouns. */
1039 "string length %qd is greater than the length %qd "
1042 }
1044 /* Create the array type for the string constant. The ISO C++
1045 standard says that a string literal has type `const char[N]' or
1046 `const wchar_t[N]'. We use the same logic when invoked as a C
1047 front-end with -Wwrite-strings.
1048 ??? We should change the type of an expression depending on the
1049 state of a warning flag. We should just be warning -- see how
1050 this is handled in the C++ front-end for the deprecated implicit
1051 conversion from string literals to `char*' or `wchar_t*'.
1053 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1054 array type being the unqualified version of that type.
1055 Therefore, if we are constructing an array of const char, we must
1056 construct the matching unqualified array type first. The C front
1057 end does not require this, but it does no harm, so we do it
1058 unconditionally. */
1069 }
1070 \f
1071 /* If DISABLE is true, stop issuing warnings. This is used when
1072 parsing code that we know will not be executed. This function may
1073 be called multiple times, and works as a stack. */
1075 static void
1077 {
1079 {
1082 }
1083 }
1085 /* If ENABLE is true, reenable issuing warnings. */
1087 static void
1089 {
1091 {
1094 }
1095 }
1097 /* Fully fold EXPR, an expression that was not folded (beyond integer
1098 constant expressions and null pointer constants) when being built
1099 up. If IN_INIT, this is in a static initializer and certain
1100 changes are made to the folding done. Clear *MAYBE_CONST if
1101 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1102 expression because it contains an evaluated operator (in C99) or an
1103 operator outside of sizeof returning an integer constant (in C90)
1104 not permitted in constant expressions, or because it contains an
1105 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1106 set to true by callers before calling this function.) Return the
1107 folded expression. Function arguments have already been folded
1108 before calling this function, as have the contents of SAVE_EXPR,
1109 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1110 C_MAYBE_CONST_EXPR. */
1112 tree
1114 {
1115 tree ret;
1121 /* This function is not relevant to C++ because C++ folds while
1122 parsing, and may need changes to be correct for C++ when C++
1123 stops folding while parsing. */
1130 {
1133 }
1140 }
1142 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1143 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1144 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1145 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1146 both evaluated and unevaluated subexpressions while
1147 *MAYBE_CONST_ITSELF is carried from only evaluated
1148 subexpressions). */
1150 static tree
1153 {
1165 /* This function is not relevant to C++ because C++ folds while
1166 parsing, and may need changes to be correct for C++ when C++
1167 stops folding while parsing. */
1171 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1172 anything else not counted as an expression cannot usefully be
1173 folded further at this point. */
1179 /* Operands of variable-length expressions (function calls) have
1180 already been folded, as have __builtin_* function calls, and such
1181 expressions cannot occur in constant expressions. */
1183 {
1187 }
1190 {
1199 else
1202 }
1204 /* Assignment, increment, decrement, function call and comma
1205 operators, and statement expressions, cannot occur in constant
1206 expressions if evaluated / outside of sizeof. (Function calls
1207 were handled above, though VA_ARG_EXPR is treated like a function
1208 call here, and statement expressions are handled through
1209 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1211 {
1231 }
1233 /* Fold individual tree codes as appropriate. */
1235 {
1237 /* Any non-constancy will have been marked in a containing
1238 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1246 maybe_const_itself);
1251 {
1254 }
1263 maybe_const_itself);
1266 maybe_const_itself);
1272 {
1276 }
1318 /* Binary operations evaluating both arguments (increment and
1319 decrement are binary internally in GCC). */
1323 maybe_const_itself);
1331 /* The RHS of a MODIFY_EXPR was fully folded when building that
1332 expression for the sake of conversion warnings. */
1335 maybe_const_itself);
1339 ret = in_init
1342 else
1355 {
1366 }
1372 CASE_CONVERT:
1383 /* Unary operations. */
1386 maybe_const_itself);
1390 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1391 not prepared to deal with them if they occur in initializers. */
1399 ret = in_init
1402 else
1407 {
1411 }
1413 {
1416 CASE_CONVERT:
1417 /* Don't warn about explicit conversions. We will already
1418 have warned about suspect implicit conversions. */
1425 }
1430 /* Binary operations not necessarily evaluating both
1431 arguments. */
1438 ? truthvalue_false_node
1446 ret = in_init
1449 else
1454 && op0_const
1455 && op0_const_self
1461 && op0_const_self
1487 else
1492 && op0_const
1493 && op0_const_self
1497 && op0_const_self
1501 && op0_const
1502 && op0_const_self
1506 && op0_const_self
1512 /* Each case where an operand with excess precision may be
1513 encountered must remove the EXCESS_PRECISION_EXPR around
1514 inner operands and possibly put one around the whole
1515 expression or possibly convert to the semantic type (which
1516 c_fully_fold does); we cannot tell at this stage which is
1517 appropriate in any particular case. */
1521 /* Various codes may appear through folding built-in functions
1522 and their arguments. */
1524 }
1526 out:
1527 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1528 have been done by this point, so remove them again. */
1532 {
1536 }
1540 }
1542 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1543 return EXP. Otherwise, return either EXP or its known constant
1544 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1545 Is the BLKmode test appropriate? */
1547 tree
1549 {
1550 tree ret;
1552 /* This function is only used by C, for c_fully_fold and other
1553 optimization, and may not be correct for C++. */
1564 /* Avoid unwanted tree sharing between the initializer and current
1565 function's body where the tree can be modified e.g. by the
1566 gimplifier. */
1570 }
1572 /* Print a warning if a constant expression had overflow in folding.
1573 Invoke this function on every expression that the language
1574 requires to be a constant expression.
1575 Note the ANSI C standard says it is erroneous for a
1576 constant expression to overflow. */
1578 void
1580 {
1588 }
1590 /* The same as above but print an unconditional error. */
1591 void
1593 {
1600 }
1602 /* Print a warning if an expression had overflow in folding and its
1603 operands hadn't.
1605 Invoke this function on every expression that
1606 (1) appears in the source code, and
1607 (2) is a constant expression that overflowed, and
1608 (3) is not already checked by convert_and_check;
1609 however, do not invoke this function on operands of explicit casts
1610 or when the expression is the result of an operator and any operand
1611 already overflowed. */
1613 void
1615 {
1620 {
1649 }
1650 }
1652 /* Warn about uses of logical || / && operator in a context where it
1653 is likely that the bitwise equivalent was intended by the
1654 programmer. We have seen an expression in which CODE is a binary
1655 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1656 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1657 void
1661 {
1673 /* Warn if &&/|| are being used in a context where it is
1674 likely that the bitwise equivalent was intended by the
1675 programmer. That is, an expression such as op && MASK
1676 where op should not be any boolean expression, nor a
1677 constant, and mask seems to be a non-boolean integer constant. */
1685 {
1689 else
1694 }
1696 /* We do not warn for constants because they are typical of macro
1697 expansions that test for features. */
1701 /* This warning only makes sense with logical operands. */
1708 /* The range computations only work with scalars. */
1713 /* We first test whether either side separately is trivially true
1714 (with OR) or trivially false (with AND). If so, do not warn.
1715 This is a common idiom for testing ranges of data types in
1716 portable code. */
1723 /* If this is an OR operation, invert both sides; now, the result
1724 should be always false to get a warning. */
1738 /* If this is an OR operation, invert both sides; now, the result
1739 should be always false to get a warning. */
1747 /* If both expressions have the same operand, if we can merge the
1748 ranges, and if the range test is always false, then warn. */
1755 {
1758 "logical %<or%> "
1760 else
1762 "logical %<and%> "
1764 }
1765 }
1767 /* Warn about logical not used on the left hand side operand of a comparison.
1768 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1769 Do not warn if RHS is of a boolean type. */
1771 void
1773 tree rhs)
1774 {
1781 "logical not is only applied to the left hand side of "
1783 }
1785 /* Warn if EXP contains any computations whose results are not used.
1786 Return true if a warning is printed; false otherwise. LOCUS is the
1787 (potential) location of the expression. */
1789 bool
1791 {
1792 restart:
1796 /* Don't warn about void constructs. This includes casting to void,
1797 void function calls, and statement expressions with a final cast
1798 to void. */
1806 {
1822 /* For a binding, warn if no side effect within it. */
1834 /* In && or ||, warn if 2nd operand has no side effect. */
1841 /* Let people do `(foo (), 0)' without a warning. */
1848 /* If this is an expression with side effects, don't warn; this
1849 case commonly appears in macro expansions. */
1855 /* Don't warn about automatic dereferencing of references, since
1856 the user cannot control it. */
1858 {
1861 }
1862 /* Fall through. */
1865 /* Referencing a volatile value is a side effect, so don't warn. */
1870 /* If this is an expression which has no operands, there is no value
1871 to be unused. There are no such language-independent codes,
1872 but front ends may define such. */
1876 warn:
1878 }
1879 }
1882 /* Print a warning about casts that might indicate violation
1883 of strict aliasing rules if -Wstrict-aliasing is used and
1884 strict aliasing mode is in effect. OTYPE is the original
1885 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1887 bool
1889 {
1890 /* Strip pointer conversion chains and get to the correct original type. */
1898 /* If the type we are casting to is a ref-all pointer
1899 dereferencing it is always valid. */
1906 {
1907 /* Casting the address of an object to non void pointer. Warn
1908 if the cast breaks type based aliasing. */
1910 {
1914 }
1915 else
1916 {
1917 /* warn_strict_aliasing >= 3. This includes the default (3).
1918 Only warn if the cast is dereferenced immediately. */
1919 alias_set_type set1 =
1925 {
1929 }
1932 {
1936 }
1937 }
1938 }
1939 else
1941 {
1942 /* At this level, warn for any conversions, even if an address is
1943 not taken in the same statement. This will likely produce many
1944 false positives, but could be useful to pinpoint problems that
1945 are not revealed at higher levels. */
1950 {
1954 }
1955 }
1958 }
1960 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1961 sizeof as last operand of certain builtins. */
1963 void
1967 {
1971 location_t loc;
1979 {
1983 /* FALLTHRU */
1991 /* FALLTHRU */
2050 }
2078 {
2082 {
2085 "argument to %<sizeof%> in %qD call is the same "
2086 "expression as the destination; did you mean to "
2092 "argument to %<sizeof%> in %qD call is the same "
2093 "expression as the destination; did you mean to "
2095 else
2097 "argument to %<sizeof%> in %qD call is the same "
2098 "expression as the destination; did you mean to "
2101 }
2104 && !strop
2107 {
2109 "argument to %<sizeof%> in %qD call is the same "
2110 "pointer type %qT as the destination; expected %qT "
2114 }
2115 }
2118 {
2122 {
2125 "argument to %<sizeof%> in %qD call is the same "
2126 "expression as the source; did you mean to "
2132 "argument to %<sizeof%> in %qD call is the same "
2133 "expression as the source; did you mean to "
2135 else
2137 "argument to %<sizeof%> in %qD call is the same "
2138 "expression as the source; did you mean to "
2141 }
2144 && !strop
2147 {
2149 "argument to %<sizeof%> in %qD call is the same "
2150 "pointer type %qT as the source; expected %qT "
2154 }
2155 }
2158 {
2162 {
2165 "argument to %<sizeof%> in %qD call is the same "
2166 "expression as the first source; did you mean to "
2172 "argument to %<sizeof%> in %qD call is the same "
2173 "expression as the first source; did you mean to "
2175 else
2177 "argument to %<sizeof%> in %qD call is the same "
2178 "expression as the first source; did you mean to "
2181 }
2184 && !strop
2187 {
2189 "argument to %<sizeof%> in %qD call is the same "
2190 "pointer type %qT as the first source; expected %qT "
2194 }
2195 }
2198 {
2202 {
2205 "argument to %<sizeof%> in %qD call is the same "
2206 "expression as the second source; did you mean to "
2212 "argument to %<sizeof%> in %qD call is the same "
2213 "expression as the second source; did you mean to "
2215 else
2217 "argument to %<sizeof%> in %qD call is the same "
2218 "expression as the second source; did you mean to "
2221 }
2224 && !strop
2227 {
2229 "argument to %<sizeof%> in %qD call is the same "
2230 "pointer type %qT as the second source; expected %qT "
2234 }
2235 }
2237 }
2239 /* Warn for unlikely, improbable, or stupid DECL declarations
2240 of `main'. */
2242 void
2244 {
2245 function_args_iterator iter;
2246 tree type;
2250 {
2251 /* XXX void_type_node belies the abstraction. */
2261 {
2267 }
2271 {
2293 "third argument of %q+D should probably be "
2296 }
2297 }
2299 /* It is intentional that this message does not mention the third
2300 argument because it's only mentioned in an appendix of the
2301 standard. */
2309 }
2311 /* vector_targets_convertible_p is used for vector pointer types. The
2312 callers perform various checks that the qualifiers are satisfactory,
2313 while OTOH vector_targets_convertible_p ignores the number of elements
2314 in the vectors. That's fine with vector pointers as we can consider,
2315 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2316 and that does not require and conversion of the pointer values.
2317 In contrast, vector_types_convertible_p and
2318 vector_types_compatible_elements_p are used for vector value types. */
2319 /* True if pointers to distinct types T1 and T2 can be converted to
2320 each other without an explicit cast. Only returns true for opaque
2321 vector types. */
2322 bool
2324 {
2331 }
2333 /* vector_types_convertible_p is used for vector value types.
2334 It could in principle call vector_targets_convertible_p as a subroutine,
2335 but then the check for vector type would be duplicated with its callers,
2336 and also the purpose of vector_targets_convertible_p would become
2337 muddled.
2338 Where vector_types_convertible_p returns true, a conversion might still be
2339 needed to make the types match.
2340 In contrast, vector_targets_convertible_p is used for vector pointer
2341 values, and vector_types_compatible_elements_p is used specifically
2342 in the context for binary operators, as a check if use is possible without
2343 conversion. */
2344 /* True if vector types T1 and T2 can be converted to each other
2345 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2346 can only be converted with -flax-vector-conversions yet that is not
2347 in effect, emit a note telling the user about that option if such
2348 a note has not previously been emitted. */
2349 bool
2351 {
2359 convertible_lax =
2374 {
2377 "conversions between vectors with differing "
2379 }
2382 }
2384 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2385 and have vector types, V0 has the same type as V1, and the number of
2386 elements of V0, V1, MASK is the same.
2388 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2389 called with two arguments. In this case implementation passes the
2390 first argument twice in order to share the same tree code. This fact
2391 could enable the mask-values being twice the vector length. This is
2392 an implementation accident and this semantics is not guaranteed to
2393 the user. */
2394 tree
2397 {
2398 tree ret;
2404 {
2407 }
2415 {
2420 }
2424 {
2428 }
2431 {
2436 }
2442 {
2445 "argument vector(s) and the mask vector should "
2448 }
2452 {
2457 }
2460 {
2461 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2467 else
2468 {
2471 }
2475 }
2485 }
2487 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2488 to integral type. */
2490 static tree
2492 {
2497 {
2498 /* C++0x scoped enumerations don't implicitly convert to integral
2499 type; if we stripped an explicit conversion to a larger type we
2500 need to replace it so common_type will still work. */
2504 }
2506 }
2508 /* This is a helper function of build_binary_op.
2510 For certain operations if both args were extended from the same
2511 smaller type, do the arithmetic in that type and then extend.
2513 BITWISE indicates a bitwise operation.
2514 For them, this optimization is safe only if
2515 both args are zero-extended or both are sign-extended.
2516 Otherwise, we might change the result.
2517 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2518 but calculated in (unsigned short) it would be (unsigned short)-1.
2519 */
2520 tree
2522 {
2526 tree type;
2528 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2529 excessive narrowing when we call get_narrower below. For
2530 example, suppose that OP0 is of unsigned int extended
2531 from signed char and that RESULT_TYPE is long long int.
2532 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2533 like
2535 (long long int) (unsigned int) signed_char
2537 which get_narrower would narrow down to
2539 (unsigned int) signed char
2541 If we do not cast OP0 first, get_narrower would return
2542 signed_char, which is inconsistent with the case of the
2543 explicit cast. */
2550 /* UNS is 1 if the operation to be done is an unsigned one. */
2553 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2554 but it *requires* conversion to FINAL_TYPE. */
2565 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2567 /* For bitwise operations, signedness of nominal type
2568 does not matter. Consider only how operands were extended. */
2572 /* Note that in all three cases below we refrain from optimizing
2573 an unsigned operation on sign-extended args.
2574 That would not be valid. */
2576 /* Both args variable: if both extended in same way
2577 from same width, do it in that width.
2578 Do it unsigned if args were zero-extended. */
2585 return c_common_signed_or_unsigned_type
2592 && (type
2603 && (type
2611 }
2613 /* Checks if expression EXPR of real/integer type cannot be converted
2614 to the real/integer type TYPE. Function returns non-zero when:
2615 * EXPR is a constant which cannot be exactly converted to TYPE.
2616 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2617 for EXPR type and TYPE being both integers or both real.
2618 * EXPR is not a constant of real type and TYPE is an integer.
2619 * EXPR is not a constant of integer type which cannot be
2620 exactly converted to real type.
2621 Function allows conversions between types of different signedness and
2622 can return SAFE_CONVERSION (zero) in that case. Function can produce
2623 signedness warnings if PRODUCE_WARNS is true. */
2625 enum conversion_safety
2627 {
2633 {
2634 /* Warn for real constant that is not an exact integer converted
2635 to integer type. */
2638 {
2641 }
2642 /* Warn for an integer constant that does not fit into integer type. */
2646 {
2649 {
2653 }
2655 {
2659 }
2660 else
2662 }
2664 {
2665 /* Warn for an integer constant that does not fit into real type. */
2667 {
2671 }
2672 /* Warn for a real constant that does not fit into a smaller
2673 real type. */
2676 {
2680 }
2681 }
2682 }
2683 else
2684 {
2685 /* Warn for real types converted to integer types. */
2692 {
2693 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2697 /* Don't warn for short y; short x = ((int)y & 0xff); */
2701 {
2702 /* If both args were extended from a shortest type,
2703 use that type if that is safe. */
2710 {
2716 /* If one of the operands is a non-negative constant
2717 that fits in the target type, then the type of the
2718 other operand does not matter. */
2727 /* If constant is unsigned and fits in the target
2728 type, then the result will also fit. */
2730 && unsigned0
2733 && unsigned1
2736 }
2737 }
2738 /* Warn for integer types converted to smaller integer types. */
2742 /* When they are the same width but different signedness,
2743 then the value may change. */
2746 /* Even when converted to a bigger type, if the type is
2747 unsigned but expr is signed, then negative values
2748 will be changed. */
2754 }
2756 /* Warn for integer types converted to real types if and only if
2757 all the range of values of the integer type cannot be
2758 represented by the real type. */
2761 {
2765 /* Don't warn about char y = 0xff; float x = (int) y; */
2777 }
2779 /* Warn for real types converted to smaller real types. */
2784 }
2787 }
2789 /* Warns if the conversion of EXPR to TYPE may alter a value.
2790 This is a helper function for warnings_for_convert_and_check. */
2792 static void
2794 {
2801 /* This may happen, because for LHS op= RHS we preevaluate
2802 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2803 means we could no longer see the code of the EXPR. */
2810 {
2823 /* Conversion from boolean to a signed:1 bit-field (which only
2824 can hold the values 0 and -1) doesn't lose information - but
2825 it does change the value. */
2845 {
2846 /* In case of COND_EXPR, we do not care about the type of
2847 COND_EXPR, only about the conversion of each operand. */
2854 }
2866 }
2867 }
2869 /* Produce warnings after a conversion. RESULT is the result of
2870 converting EXPR to TYPE. This is a helper function for
2871 convert_and_check and cp_convert_and_check. */
2873 void
2875 tree result)
2876 {
2883 {
2884 /* Do not diagnose overflow in a constant expression merely
2885 because a conversion overflowed. */
2890 {
2891 /* This detects cases like converting -129 or 256 to
2892 unsigned char. */
2896 else
2898 }
2902 /* No warning for converting 0x80000000 to int. */
2910 else
2912 }
2917 else
2919 }
2922 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2923 Invoke this function on every expression that is converted implicitly,
2924 i.e. because of language rules and not because of an explicit cast. */
2926 tree
2928 {
2929 tree result;
2930 tree expr_for_warning;
2932 /* Convert from a value with possible excess precision rather than
2933 via the semantic type, but do not warn about values not fitting
2934 exactly in the semantic type. */
2936 {
2942 }
2943 else
2957 }
2958 \f
2959 /* A node in a list that describes references to variables (EXPR), which are
2960 either read accesses if WRITER is zero, or write accesses, in which case
2961 WRITER is the parent of EXPR. */
2962 struct tlist
2963 {
2966 };
2968 /* Used to implement a cache the results of a call to verify_tree. We only
2969 use this for SAVE_EXPRs. */
2970 struct tlist_cache
2971 {
2975 tree expr;
2976 };
2978 /* Obstack to use when allocating tlist structures, and corresponding
2979 firstobj. */
2983 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2984 warnings. */
2986 /* SAVE_EXPRs need special treatment. We process them only once and then
2987 cache the results. */
2999 /* Create a new struct tlist and fill in its fields. */
3002 {
3009 }
3011 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3012 is nonnull, we ignore any node we find which has a writer equal to it. */
3014 static void
3016 {
3018 {
3025 }
3026 }
3028 /* Merge the nodes of ADD into TO. This merging process is done so that for
3029 each variable that already exists in TO, no new node is added; however if
3030 there is a write access recorded in ADD, and an occurrence on TO is only
3031 a read access, then the occurrence in TO will be modified to record the
3032 write. */
3034 static void
3036 {
3043 {
3050 {
3054 }
3056 {
3060 }
3062 }
3063 }
3065 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3066 references in list LIST conflict with it, excluding reads if ONLY writers
3067 is nonzero. */
3069 static void
3072 {
3075 /* Avoid duplicate warnings. */
3081 {
3085 {
3090 }
3092 }
3093 }
3095 /* Given a list LIST of references to variables, find whether any of these
3096 can cause conflicts due to missing sequence points. */
3098 static void
3100 {
3104 {
3107 }
3108 }
3110 /* Return nonzero if X is a tree that can be verified by the sequence point
3111 warnings. */
3112 static int
3114 {
3121 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3122 (lvalue_p) crash on TRY/CATCH. */
3129 /* No point to track non-const calls, they will never satisfy
3130 operand_equal_p. */
3138 }
3140 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3141 static bool
3143 {
3145 }
3147 /* Walk the tree X, and record accesses to variables. If X is written by the
3148 parent tree, WRITER is the parent.
3149 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3150 expression or its only operand forces a sequence point, then everything up
3151 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3152 in PNO_SP.
3153 Once we return, we will have emitted warnings if any subexpression before
3154 such a sequence point could be undefined. On a higher level, however, the
3155 sequence point may not be relevant, and we'll merge the two lists.
3157 Example: (b++, a) + b;
3158 The call that processes the COMPOUND_EXPR will store the increment of B
3159 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3160 processes the PLUS_EXPR will need to merge the two lists so that
3161 eventually, all accesses end up on the same list (and we'll warn about the
3162 unordered subexpressions b++ and b.
3164 A note on merging. If we modify the former example so that our expression
3165 becomes
3166 (b++, b) + a
3167 care must be taken not simply to add all three expressions into the final
3168 PNO_SP list. The function merge_tlist takes care of that by merging the
3169 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3170 way, so that no more than one access to B is recorded. */
3172 static void
3174 tree writer)
3175 {
3180 /* X may be NULL if it is the operand of an empty statement expression
3181 ({ }). */
3185 restart:
3193 {
3226 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3227 two first, to avoid warning for (a ? b++ : b++). */
3243 /* Expressions inside the LHS are not ordered wrt. the sequence points
3244 in the RHS. Example:
3245 *a = (a++, 2)
3246 Despite the fact that the modification of "a" is in the before_sp
3247 list (tmp_before), it conflicts with the use of "a" in the LHS.
3248 We can handle this by adding the contents of tmp_list3
3249 to those of tmp_before, and redoing the collision warnings for that
3250 list. */
3253 /* Exclude the LHS itself here; we first have to merge it into the
3254 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3255 didn't exclude the LHS, we'd get it twice, once as a read and once
3256 as a write. */
3267 /* We need to warn about conflicts among arguments and conflicts between
3268 args and the function address. Side effects of the function address,
3269 however, are not ordered by the sequence point of the call. */
3270 {
3271 call_expr_arg_iterator iter;
3272 tree arg;
3276 {
3281 }
3286 }
3289 /* Scan all the list, e.g. indices of multi dimensional array. */
3291 {
3297 }
3301 {
3308 {
3322 }
3326 }
3336 /* For other expressions, simply recurse on their operands.
3337 Manual tail recursion for unary expressions.
3338 Other non-expressions need not be processed. */
3340 {
3344 }
3346 {
3350 {
3355 }
3356 }
3358 }
3359 }
3361 /* Try to warn for undefined behavior in EXPR due to missing sequence
3362 points. */
3364 DEBUG_FUNCTION void
3366 {
3372 {
3375 }
3380 }
3381 \f
3382 /* Validate the expression after `case' and apply default promotions. */
3384 static tree
3386 {
3391 /* Promote char or short to int. */
3394 {
3397 }
3402 }
3403 \f
3404 /* See if the case values LOW and HIGH are in the range of the original
3405 type (i.e. before the default conversion to int) of the switch testing
3406 expression.
3407 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3408 the type before promoting it. CASE_LOW_P is a pointer to the lower
3409 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3410 if the case is not a case range.
3411 The caller has to make sure that we are not called with NULL for
3412 CASE_LOW_P (i.e. the default case).
3413 Returns true if the case label is in range of ORIG_TYPE (saturated or
3414 untouched) or false if the label is out of range. */
3416 static bool
3419 {
3424 /* If there was a problem with the original type, do nothing. */
3431 /* Case label is less than minimum for type. */
3434 {
3438 }
3440 /* Case value is greater than maximum for type. */
3443 {
3446 }
3448 /* Saturate lower case label value to minimum. */
3451 {
3455 }
3457 /* Saturate upper case label value to maximum. */
3460 {
3464 }
3472 }
3473 \f
3474 /* Return an integer type with BITS bits of precision,
3475 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3477 tree
3479 {
3521 }
3523 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3524 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3525 and saturating if SATP is nonzero, otherwise not saturating. */
3527 tree
3530 {
3531 machine_mode mode;
3534 else
3542 {
3544 "fixed-point types that have too many integral and "
3547 }
3550 }
3552 /* Used for communication between c_common_type_for_mode and
3553 c_register_builtin_type. */
3554 tree registered_builtin_types;
3556 /* Return a data type that has machine mode MODE.
3557 If the mode is an integer,
3558 then UNSIGNEDP selects between signed and unsigned types.
3559 If the mode is a fixed-point mode,
3560 then UNSIGNEDP selects between saturating and nonsaturating types. */
3562 tree
3564 {
3565 tree t;
3605 #if HOST_BITS_PER_WIDE_INT >= 64
3608 #endif
3633 {
3634 machine_mode inner_mode;
3635 tree inner_type;
3651 }
3653 {
3658 }
3668 {
3754 }
3762 }
3764 tree
3766 {
3768 }
3770 /* Return a signed type the same as TYPE in other respects. */
3772 tree
3774 {
3776 }
3778 /* Return a type the same as TYPE except unsigned or
3779 signed according to UNSIGNEDP. */
3781 tree
3783 {
3784 tree type1;
3787 /* This block of code emulates the behavior of the old
3788 c_common_unsigned_type. In particular, it returns
3789 long_unsigned_type_node if passed a long, even when a int would
3790 have the same size. This is necessary for warnings to work
3791 correctly in archs where sizeof(int) == sizeof(long) */
3794 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3814 #if HOST_BITS_PER_WIDE_INT >= 64
3817 #endif
3827 #define C_COMMON_FIXED_TYPES(NAME) \
3828 if (type1 == short_ ## NAME ## _type_node \
3829 || type1 == unsigned_short_ ## NAME ## _type_node) \
3830 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3831 : short_ ## NAME ## _type_node; \
3832 if (type1 == NAME ## _type_node \
3833 || type1 == unsigned_ ## NAME ## _type_node) \
3834 return unsignedp ? unsigned_ ## NAME ## _type_node \
3835 : NAME ## _type_node; \
3836 if (type1 == long_ ## NAME ## _type_node \
3837 || type1 == unsigned_long_ ## NAME ## _type_node) \
3838 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3839 : long_ ## NAME ## _type_node; \
3840 if (type1 == long_long_ ## NAME ## _type_node \
3841 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3842 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3843 : long_long_ ## NAME ## _type_node;
3845 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3846 if (type1 == NAME ## _type_node \
3847 || type1 == u ## NAME ## _type_node) \
3848 return unsignedp ? u ## NAME ## _type_node \
3849 : NAME ## _type_node;
3851 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3852 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3853 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3854 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3855 : sat_ ## short_ ## NAME ## _type_node; \
3856 if (type1 == sat_ ## NAME ## _type_node \
3857 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3858 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3859 : sat_ ## NAME ## _type_node; \
3860 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3861 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3862 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3863 : sat_ ## long_ ## NAME ## _type_node; \
3864 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3865 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3866 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3867 : sat_ ## long_long_ ## NAME ## _type_node;
3869 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3870 if (type1 == sat_ ## NAME ## _type_node \
3871 || type1 == sat_ ## u ## NAME ## _type_node) \
3872 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3873 : sat_ ## NAME ## _type_node;
3899 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3900 the precision; they have precision set to match their range, but
3901 may use a wider mode to match an ABI. If we change modes, we may
3902 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3903 the precision as well, so as to yield correct results for
3904 bit-field types. C++ does not have these separate bit-field
3905 types, and producing a signed or unsigned variant of an
3906 ENUMERAL_TYPE may cause other problems as well. */
3912 #define TYPE_OK(node) \
3913 (TYPE_MODE (type) == TYPE_MODE (node) \
3914 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3938 #if HOST_BITS_PER_WIDE_INT >= 64
3941 #endif
3950 #undef TYPE_OK
3953 }
3955 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3957 tree
3959 {
3962 /* Extended integer types of the same width as a standard type have
3963 lesser rank, so those of the same width as int promote to int or
3964 unsigned int and are valid for printf formats expecting int or
3965 unsigned int. To avoid such special cases, avoid creating
3966 extended integer types for bit-fields if a standard integer type
3967 is available. */
3985 }
3987 /* The C version of the register_builtin_type langhook. */
3989 void
3991 {
3992 tree decl;
4002 }
4003 \f
4004 /* Print an error message for invalid operands to arith operation
4005 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4006 LOCATION is the location of the message. */
4008 void
4011 {
4015 {
4060 }
4064 }
4065 \f
4066 /* Given an expression as a tree, return its original type. Do this
4067 by stripping any conversion that preserves the sign and precision. */
4068 static tree
4070 {
4073 }
4075 /* Subroutine of build_binary_op, used for comparison operations.
4076 See if the operands have both been converted from subword integer types
4077 and, if so, perhaps change them both back to their original type.
4078 This function is also responsible for converting the two operands
4079 to the proper common type for comparison.
4081 The arguments of this function are all pointers to local variables
4082 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4083 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4085 LOC is the location of the comparison.
4087 If this function returns nonzero, it means that the comparison has
4088 a constant value. What this function returns is an expression for
4089 that value. */
4091 tree
4094 {
4095 tree type;
4103 /* Throw away any conversions to wider types
4104 already present in the operands. */
4109 /* If primopN is first sign-extended from primopN's precision to opN's
4110 precision, then zero-extended from opN's precision to
4111 *restype_ptr precision, shortenings might be invalid. */
4114 && !unsignedp0
4119 && !unsignedp1
4123 /* Handle the case that OP0 does not *contain* a conversion
4124 but it *requires* conversion to FINAL_TYPE. */
4131 /* If one of the operands must be floated, we cannot optimize. */
4135 /* If first arg is constant, swap the args (changing operation
4136 so value is preserved), for canonicalization. Don't do this if
4137 the second arg is 0. */
4142 {
4159 {
4174 }
4176 }
4178 /* If comparing an integer against a constant more bits wide,
4179 maybe we can deduce a value of 1 or 0 independent of the data.
4180 Or else truncate the constant now
4181 rather than extend the variable at run time.
4183 This is only interesting if the constant is the wider arg.
4184 Also, it is not safe if the constant is unsigned and the
4185 variable arg is signed, since in this case the variable
4186 would be sign-extended and then regarded as unsigned.
4187 Our technique fails in this case because the lowest/highest
4188 possible unsigned results don't follow naturally from the
4189 lowest/highest possible values of the variable operand.
4190 For just EQ_EXPR and NE_EXPR there is another technique that
4191 could be used: see if the constant can be faithfully represented
4192 in the other operand's type, by truncating it and reextending it
4193 and see if that preserves the constant's value. */
4199 {
4202 /* 1 if comparison is nominally unsigned. */
4204 tree val;
4216 {
4217 /* Convert primop1 to target type, but do not introduce
4218 additional overflow. We know primop1 is an int_cst. */
4225 }
4227 {
4230 }
4238 /* This used to be a switch, but Genix compiler can't handle that. */
4240 {
4243 }
4245 {
4248 }
4250 {
4255 }
4257 {
4262 }
4264 {
4269 }
4271 {
4276 }
4278 /* If primop0 was sign-extended and unsigned comparison specd,
4279 we did a signed comparison above using the signed type bounds.
4280 But the comparison we output must be unsigned.
4282 Also, for inequalities, VAL is no good; but if the signed
4283 comparison had *any* fixed result, it follows that the
4284 unsigned comparison just tests the sign in reverse
4285 (positive values are LE, negative ones GE).
4286 So we can generate an unsigned comparison
4287 against an extreme value of the signed type. */
4290 {
4293 {
4308 }
4310 }
4313 {
4320 }
4323 {
4324 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4328 }
4330 /* Value is not predetermined, but do the comparison
4331 in the type of the operand that is not constant.
4332 TYPE is already properly set. */
4333 }
4335 /* If either arg is decimal float and the other is float, find the
4336 proper common type to use for comparison. */
4342 /* If either arg is decimal float and the other is float, fail. */
4353 /* If args' natural types are both narrower than nominal type
4354 and both extend in the same manner, compare them
4355 in the type of the wider arg.
4356 Otherwise must actually extend both to the nominal
4357 common type lest different ways of extending
4358 alter the result.
4359 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4364 {
4368 type);
4369 /* Make sure shorter operand is extended the right way
4370 to match the longer operand. */
4371 primop0
4374 primop0);
4375 primop1
4378 primop1);
4379 }
4380 else
4381 {
4382 /* Here we must do the comparison on the nominal type
4383 using the args exactly as we received them. */
4390 {
4392 /* All unsigned values are >= 0, so we warn. However,
4393 if OP0 is a constant that is >= 0, the signedness of
4394 the comparison isn't an issue, so suppress the
4395 warning. */
4400 primop0)))
4401 /* Do not warn for enumeration types. */
4405 {
4422 }
4425 {
4426 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4431 }
4432 }
4433 }
4441 }
4442 \f
4443 /* Return a tree for the sum or difference (RESULTCODE says which)
4444 of pointer PTROP and integer INTOP. */
4446 tree
4449 {
4452 /* The result is a pointer of the same type that is being added. */
4456 {
4463 }
4465 {
4472 }
4473 else
4476 /* We are manipulating pointer values, so we don't need to warn
4477 about relying on undefined signed overflow. We disable the
4478 warning here because we use integer types so fold won't know that
4479 they are really pointers. */
4482 /* If what we are about to multiply by the size of the elements
4483 contains a constant term, apply distributive law
4484 and multiply that constant term separately.
4485 This helps produce common subexpressions. */
4490 /* If the constant comes from pointer subtraction,
4491 skip this optimization--it would cause an error. */
4493 /* If the constant is unsigned, and smaller than the pointer size,
4494 then we must skip this optimization. This is because it could cause
4495 an overflow error if the constant is negative but INTOP is not. */
4499 {
4504 /* Convert both subexpression types to the type of intop,
4505 because weird cases involving pointer arithmetic
4506 can result in a sum or difference with different type args. */
4511 }
4513 /* Convert the integer argument to a type the same size as sizetype
4514 so the multiply won't overflow spuriously. */
4520 /* Replace the integer argument with a suitable product by the object size.
4521 Do this multiplication as signed, then convert to the appropriate type
4522 for the pointer operation and disregard an overflow that occurred only
4523 because of the sign-extension change in the latter conversion. */
4524 {
4531 }
4533 /* Create the sum or difference. */
4542 }
4543 \f
4544 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4545 and if NON_CONST is known not to be permitted in an evaluated part
4546 of a constant expression. */
4548 tree
4550 {
4554 /* This should never be called for C++. */
4558 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4567 }
4569 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4570 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4571 around the SAVE_EXPR if needed so that c_fully_fold does not need
4572 to look inside SAVE_EXPRs. */
4574 tree
4576 {
4585 }
4587 /* Return whether EXPR is a declaration whose address can never be
4588 NULL. */
4590 bool
4592 {
4597 }
4599 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4600 or for an `if' or `while' statement or ?..: exp. It should already
4601 have been validated to be of suitable type; otherwise, a bad
4602 diagnostic may result.
4604 The EXPR is located at LOCATION.
4606 This preparation consists of taking the ordinary
4607 representation of an expression expr and producing a valid tree
4608 boolean expression describing whether expr is nonzero. We could
4609 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4610 but we optimize comparisons, &&, ||, and !.
4612 The resulting type should always be `truthvalue_type_node'. */
4614 tree
4616 {
4618 {
4660 ? truthvalue_true_node
4666 ? truthvalue_true_node
4671 /* Fall through. */
4674 {
4677 {
4678 /* Common Ada/Pascal programmer's mistake. */
4680 OPT_Waddress,
4682 inner);
4684 }
4686 }
4703 /* These don't change whether an object is nonzero or zero. */
4708 /* These don't change whether an object is zero or nonzero, but
4709 we can't ignore them if their second arg has side-effects. */
4711 {
4714 c_common_truthvalue_conversion
4717 }
4718 else
4723 /* Distribute the conversion into the arms of a COND_EXPR. */
4725 {
4728 /* In C++ one of the arms might have void type if it is throw. */
4736 }
4737 else
4738 {
4739 /* Folding will happen later for C. */
4747 }
4749 CASE_CONVERT:
4750 {
4754 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4755 since that affects how `default_conversion' will behave. */
4759 /* Don't strip a conversion from C++0x scoped enum, since they
4760 don't implicitly convert to other types. */
4764 /* If this isn't narrowing the argument, we can ignore it. */
4768 }
4774 {
4778 }
4783 }
4786 {
4788 expr = (build_binary_op
4792 c_common_truthvalue_conversion
4795 c_common_truthvalue_conversion
4800 }
4803 {
4808 }
4809 else
4812 ret:
4815 }
4816 \f
4825 /* Apply the TYPE_QUALS to the new DECL. */
4827 void
4829 {
4837 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4838 constructor can produce constant init, so rely on cp_finish_decl to
4839 clear TREE_READONLY if the variable has non-constant init. */
4842 {
4845 }
4847 {
4849 /* Allow 'restrict' on arrays of pointers.
4850 FIXME currently we just ignore it. */
4856 }
4857 }
4860 {
4863 };
4865 /* Hash function for the problem of multiple type definitions in
4866 different files. This must hash all types that will compare
4867 equal via comptypes to the same value. In practice it hashes
4868 on some of the simple stuff and leaves the details to comptypes. */
4870 hashval_t
4872 {
4875 tree t2;
4877 {
4878 /* For pointers, hash on pointee type plus some swizzling. */
4881 /* Hash on number of elements and total size. */
4900 }
4901 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4902 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4904 /* We might have a VLA here. */
4907 else
4910 }
4912 bool
4914 {
4916 }
4920 /* Return the typed-based alias set for T, which may be an expression
4921 or a type. Return -1 if we don't do anything special. */
4923 alias_set_type
4925 {
4926 tree u;
4928 /* For VLAs, use the alias set of the element type rather than the
4929 default of alias set 0 for types compared structurally. */
4931 {
4935 }
4937 /* Permit type-punning when accessing a union, provided the access
4938 is directly through the union. For example, this code does not
4939 permit taking the address of a union member and then storing
4940 through it. Even the type-punning allowed here is a GCC
4941 extension, albeit a common and useful one; the C standard says
4942 that such accesses have implementation-defined behavior. */
4950 /* That's all the expressions we handle specially. */
4954 /* The C standard guarantees that any object may be accessed via an
4955 lvalue that has character type. */
4961 /* The C standard specifically allows aliasing between signed and
4962 unsigned variants of the same type. We treat the signed
4963 variant as canonical. */
4965 {
4968 /* t1 == t can happen for boolean nodes which are always unsigned. */
4971 }
4973 /* Handle the case of multiple type nodes referring to "the same" type,
4974 which occurs with IMA. These share an alias set. FIXME: Currently only
4975 C90 is handled. (In C99 type compatibility is not transitive, which
4976 complicates things mightily. The alias set splay trees can theoretically
4977 represent this, but insertion is tricky when you consider all the
4978 different orders things might arrive in.) */
4983 /* Save time if there's only one input file. */
4987 /* Pointers need special handling if they point to any type that
4988 needs special handling (below). */
4990 {
4991 tree t2;
4992 /* Find bottom type under any nested POINTERs. */
4996 ;
5004 }
5005 /* These are the only cases that need special handling. */
5012 /* Undefined? */
5016 /* Look up t in hash table. Only one of the compatible types within each
5017 alias set is recorded in the table. */
5022 {
5025 }
5026 else
5027 /* Our caller will assign and record (in t) a new alias set; all we need
5028 to do is remember t in the hash table. */
5032 }
5033 \f
5034 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5035 the IS_SIZEOF parameter indicates which operator is being applied.
5036 The COMPLAIN flag controls whether we should diagnose possibly
5037 ill-formed constructs or not. LOC is the location of the SIZEOF or
5038 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5039 a type in any context should be returned, rather than the normal
5040 alignment for that type. */
5042 tree
5046 {
5054 {
5056 {
5063 }
5064 else
5065 {
5067 {
5071 else
5074 }
5076 }
5077 }
5079 {
5087 }
5090 {
5095 }
5098 {
5103 }
5104 else
5105 {
5107 /* Convert in case a char is more than one unit. */
5113 else
5115 }
5117 /* VALUE will have the middle-end integer type sizetype.
5118 However, we should really return a value of type `size_t',
5119 which is just a typedef for an ordinary integer type. */
5123 }
5125 /* Implement the __alignof keyword: Return the minimum required
5126 alignment of EXPR, measured in bytes. For VAR_DECLs,
5127 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5128 from an "aligned" __attribute__ specification). LOC is the
5129 location of the ALIGNOF operator. */
5131 tree
5133 {
5134 tree t;
5141 {
5144 }
5150 {
5157 {
5164 }
5166 }
5167 else
5171 }
5172 \f
5173 /* Handle C and C++ default attributes. */
5175 enum built_in_attribute
5176 {
5177 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5178 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5179 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5180 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5181 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5183 #undef DEF_ATTR_NULL_TREE
5184 #undef DEF_ATTR_INT
5185 #undef DEF_ATTR_STRING
5186 #undef DEF_ATTR_IDENT
5187 #undef DEF_ATTR_TREE_LIST
5188 ATTR_LAST
5189 };
5195 enum c_builtin_type
5196 {
5197 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5198 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5199 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5200 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5201 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5202 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5203 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5204 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5205 ARG6) NAME,
5206 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5207 ARG6, ARG7) NAME,
5208 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5209 ARG6, ARG7, ARG8) NAME,
5210 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5211 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5212 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5213 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5214 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5215 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5216 NAME,
5217 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5219 #undef DEF_PRIMITIVE_TYPE
5220 #undef DEF_FUNCTION_TYPE_0
5221 #undef DEF_FUNCTION_TYPE_1
5222 #undef DEF_FUNCTION_TYPE_2
5223 #undef DEF_FUNCTION_TYPE_3
5224 #undef DEF_FUNCTION_TYPE_4
5225 #undef DEF_FUNCTION_TYPE_5
5226 #undef DEF_FUNCTION_TYPE_6
5227 #undef DEF_FUNCTION_TYPE_7
5228 #undef DEF_FUNCTION_TYPE_8
5229 #undef DEF_FUNCTION_TYPE_VAR_0
5230 #undef DEF_FUNCTION_TYPE_VAR_1
5231 #undef DEF_FUNCTION_TYPE_VAR_2
5232 #undef DEF_FUNCTION_TYPE_VAR_3
5233 #undef DEF_FUNCTION_TYPE_VAR_4
5234 #undef DEF_FUNCTION_TYPE_VAR_5
5235 #undef DEF_POINTER_TYPE
5236 BT_LAST
5237 };
5241 /* A temporary array for c_common_nodes_and_builtins. Used in
5242 communication with def_fn_type. */
5245 /* A helper function for c_common_nodes_and_builtins. Build function type
5246 for DEF with return type RET and N arguments. If VAR is true, then the
5247 function should be variadic after those N arguments.
5249 Takes special care not to ICE if any of the types involved are
5250 error_mark_node, which indicates that said type is not in fact available
5251 (see builtin_type_for_size). In which case the function type as a whole
5252 should be error_mark_node. */
5254 static void
5256 {
5257 tree t;
5264 {
5270 }
5277 else
5280 egress:
5283 }
5285 /* Build builtin functions common to both C and C++ language
5286 frontends. */
5288 static void
5290 {
5291 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5292 builtin_types[ENUM] = VALUE;
5293 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5294 def_fn_type (ENUM, RETURN, 0, 0);
5295 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5296 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5297 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5298 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5299 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5300 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5301 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5302 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5303 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5304 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5305 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5306 ARG6) \
5307 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5308 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5309 ARG6, ARG7) \
5310 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5311 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5312 ARG6, ARG7, ARG8) \
5313 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5314 ARG7, ARG8);
5315 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5316 def_fn_type (ENUM, RETURN, 1, 0);
5317 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5318 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5319 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5320 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5321 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5322 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5323 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5324 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5325 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5326 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5327 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5328 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5332 #undef DEF_PRIMITIVE_TYPE
5333 #undef DEF_FUNCTION_TYPE_0
5334 #undef DEF_FUNCTION_TYPE_1
5335 #undef DEF_FUNCTION_TYPE_2
5336 #undef DEF_FUNCTION_TYPE_3
5337 #undef DEF_FUNCTION_TYPE_4
5338 #undef DEF_FUNCTION_TYPE_5
5339 #undef DEF_FUNCTION_TYPE_6
5340 #undef DEF_FUNCTION_TYPE_7
5341 #undef DEF_FUNCTION_TYPE_8
5342 #undef DEF_FUNCTION_TYPE_VAR_0
5343 #undef DEF_FUNCTION_TYPE_VAR_1
5344 #undef DEF_FUNCTION_TYPE_VAR_2
5345 #undef DEF_FUNCTION_TYPE_VAR_3
5346 #undef DEF_FUNCTION_TYPE_VAR_4
5347 #undef DEF_FUNCTION_TYPE_VAR_5
5348 #undef DEF_POINTER_TYPE
5353 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5354 NONANSI_P, ATTRS, IMPLICIT, COND) \
5355 if (NAME && COND) \
5356 def_builtin_1 (ENUM, NAME, CLASS, \
5357 builtin_types[(int) TYPE], \
5358 builtin_types[(int) LIBTYPE], \
5359 BOTH_P, FALLBACK_P, NONANSI_P, \
5360 built_in_attributes[(int) ATTRS], IMPLICIT);
5362 #undef DEF_BUILTIN
5370 }
5372 /* Like get_identifier, but avoid warnings about null arguments when
5373 the argument may be NULL for targets where GCC lacks stdint.h type
5374 information. */
5378 {
5380 }
5382 /* Build tree nodes and builtin functions common to both C and C++ language
5383 frontends. */
5385 void
5387 {
5391 tree array_domain_type;
5392 tree va_list_ref_type_node;
5393 tree va_list_arg_type_node;
5398 /* Define `int' and `char' first so that dbx will output them first. */
5402 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5403 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5404 but not C. Are the conditionals here needed? */
5410 long_unsigned_type_node);
5413 {
5422 }
5427 long_long_integer_type_node);
5429 long_long_unsigned_type_node);
5432 long_long_unsigned_type_node);
5435 short_unsigned_type_node);
5438 short_unsigned_type_node);
5440 /* Define both `signed char' and `unsigned char'. */
5444 /* These are types that c_common_type_for_size and
5445 c_common_type_for_mode use. */
5448 intQI_type_node));
5451 intHI_type_node));
5454 intSI_type_node));
5457 intDI_type_node));
5458 #if HOST_BITS_PER_WIDE_INT >= 64
5459 /* Note that this is different than the __int128 type that's part of
5460 the generic __intN support. */
5463 TYPE_DECL,
5465 intTI_type_node));
5466 #endif
5469 unsigned_intQI_type_node));
5472 unsigned_intHI_type_node));
5475 unsigned_intSI_type_node));
5478 unsigned_intDI_type_node));
5479 #if HOST_BITS_PER_WIDE_INT >= 64
5482 TYPE_DECL,
5484 unsigned_intTI_type_node));
5485 #endif
5487 /* Create the widest literal types. */
5488 widest_integer_literal_type_node
5492 widest_integer_literal_type_node));
5494 widest_unsigned_literal_type_node
5498 widest_unsigned_literal_type_node));
5502 pid_type_node =
5509 /* Only supported decimal floating point extension if the target
5510 actually supports underlying modes. */
5514 {
5518 }
5521 {
5526 long_long_fract_type_node);
5528 unsigned_short_fract_type_node);
5530 unsigned_fract_type_node);
5532 unsigned_long_fract_type_node);
5534 unsigned_long_long_fract_type_node);
5536 sat_short_fract_type_node);
5539 sat_long_fract_type_node);
5541 sat_long_long_fract_type_node);
5543 sat_unsigned_short_fract_type_node);
5545 sat_unsigned_fract_type_node);
5547 sat_unsigned_long_fract_type_node);
5549 sat_unsigned_long_long_fract_type_node);
5554 long_long_accum_type_node);
5556 unsigned_short_accum_type_node);
5558 unsigned_accum_type_node);
5560 unsigned_long_accum_type_node);
5562 unsigned_long_long_accum_type_node);
5564 sat_short_accum_type_node);
5567 sat_long_accum_type_node);
5569 sat_long_long_accum_type_node);
5571 sat_unsigned_short_accum_type_node);
5573 sat_unsigned_accum_type_node);
5575 sat_unsigned_long_accum_type_node);
5577 sat_unsigned_long_long_accum_type_node);
5579 }
5582 TYPE_DECL,
5584 complex_integer_type_node));
5586 TYPE_DECL,
5588 complex_float_type_node));
5590 TYPE_DECL,
5592 complex_double_type_node));
5596 complex_long_double_type_node));
5599 /* For C++, make fileptr_type_node a distinct void * type until
5600 FILE type is defined. */
5605 /* Set the TYPE_NAME for any variants that were built before
5606 record_builtin_type gave names to the built-in types. */
5607 {
5613 }
5617 /* Make a type to be the domain of a few array types
5618 whose domains don't really matter.
5619 200 is small enough that it always fits in size_t
5620 and large enough that it can hold most function names for the
5621 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5624 /* Make a type for arrays of characters.
5625 With luck nothing will ever really depend on the length of this
5626 array type. */
5627 char_array_type_node
5631 const_string_type_node
5635 /* This is special for C++ so functions can be overloaded. */
5641 {
5644 else
5647 }
5649 /* This is for wide string constants. */
5650 wchar_array_type_node
5653 /* Define 'char16_t'. */
5658 {
5663 }
5665 /* This is for UTF-16 string constants. */
5666 char16_array_type_node
5669 /* Define 'char32_t'. */
5674 {
5679 }
5681 /* This is for UTF-32 string constants. */
5682 char32_array_type_node
5685 wint_type_node =
5688 intmax_type_node =
5690 uintmax_type_node =
5694 sig_atomic_type_node =
5697 int8_type_node =
5700 int16_type_node =
5703 int32_type_node =
5706 int64_type_node =
5709 uint8_type_node =
5721 int_least8_type_node =
5724 int_least16_type_node =
5727 int_least32_type_node =
5730 int_least64_type_node =
5733 uint_least8_type_node =
5736 uint_least16_type_node =
5739 uint_least32_type_node =
5742 uint_least64_type_node =
5745 int_fast8_type_node =
5748 int_fast16_type_node =
5751 int_fast32_type_node =
5754 int_fast64_type_node =
5757 uint_fast8_type_node =
5760 uint_fast16_type_node =
5763 uint_fast32_type_node =
5766 uint_fast64_type_node =
5769 intptr_type_node =
5772 uintptr_type_node =
5775 default_function_type
5777 ptrdiff_type_node
5784 va_list_type_node));
5786 {
5789 tree ptype;
5792 {
5796 ptype));
5798 }
5799 }
5802 {
5805 }
5806 else
5807 {
5810 }
5817 /* Create the built-in __null node. It is important that this is
5818 not shared. */
5822 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5824 }
5826 /* The number of named compound-literals generated thus far. */
5829 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5831 void
5833 {
5836 compound_literal_number);
5837 compound_literal_number++;
5839 }
5841 tree
5843 {
5847 }
5850 /* Linked list of disabled built-in functions. */
5853 {
5861 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5862 begins with "__builtin_", give an error. */
5864 void
5866 {
5869 else
5870 {
5875 }
5876 }
5879 /* Return true if the built-in function NAME has been disabled, false
5880 otherwise. */
5882 static bool
5884 {
5887 {
5890 }
5892 }
5895 /* Worker for DEF_BUILTIN.
5896 Possibly define a builtin function with one or two names.
5897 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5898 nonansi_p and flag_no_nonansi_builtin. */
5900 static void
5907 {
5908 tree decl;
5921 fnattrs);
5930 }
5931 \f
5932 /* Nonzero if the type T promotes to int. This is (nearly) the
5933 integral promotions defined in ISO C99 6.3.1.1/2. */
5935 bool
5937 {
5939 {
5949 /* ??? Technically all enumerations not larger than an int
5950 promote to an int. But this is used along code paths
5951 that only want to notice a size change. */
5959 }
5960 }
5962 /* Return 1 if PARMS specifies a fixed number of parameters
5963 and none of their types is affected by default promotions. */
5965 int
5967 {
5968 const_tree t;
5970 {
5987 }
5989 }
5991 /* Recursively remove any '*' or '&' operator from TYPE. */
5992 tree
5994 {
5998 }
6000 /* Recursively remove pointer or array type from TYPE. */
6001 tree
6003 {
6007 }
6009 /* Used to compare case labels. K1 and K2 are actually tree nodes
6010 representing case labels, or NULL_TREE for a `default' label.
6011 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6012 K2, and 0 if K1 and K2 are equal. */
6014 int
6016 {
6017 /* Consider a NULL key (such as arises with a `default' label) to be
6018 smaller than anything else. */
6025 }
6027 /* Process a case label, located at LOC, for the range LOW_VALUE
6028 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6029 then this case label is actually a `default' label. If only
6030 HIGH_VALUE is NULL_TREE, then case label was declared using the
6031 usual C/C++ syntax, rather than the GNU case range extension.
6032 CASES is a tree containing all the case ranges processed so far;
6033 COND is the condition for the switch-statement itself. Returns the
6034 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6035 is created. */
6037 tree
6040 {
6041 tree type;
6042 tree label;
6043 tree case_label;
6044 splay_tree_node node;
6046 /* Create the LABEL_DECL itself. */
6049 /* If there was an error processing the switch condition, bail now
6050 before we get more confused. */
6058 {
6061 }
6063 /* Case ranges are a GNU extension. */
6070 {
6075 }
6077 {
6082 }
6085 {
6086 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6087 really a case range, even though it was written that way.
6088 Remove the HIGH_VALUE to simplify later processing. */
6093 }
6095 /* See if the case is in range of the type of the original testing
6096 expression. If both low_value and high_value are out of range,
6097 don't insert the case label and return NULL_TREE. */
6103 /* Look up the LOW_VALUE in the table of case labels we already
6104 have. */
6106 /* If there was not an exact match, check for overlapping ranges.
6107 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6108 that's a `default' label and the only overlap is an exact match. */
6110 {
6111 splay_tree_node low_bound;
6112 splay_tree_node high_bound;
6114 /* Even though there wasn't an exact match, there might be an
6115 overlap between this case range and another case range.
6116 Since we've (inductively) not allowed any overlapping case
6117 ranges, we simply need to find the greatest low case label
6118 that is smaller that LOW_VALUE, and the smallest low case
6119 label that is greater than LOW_VALUE. If there is an overlap
6120 it will occur in one of these two ranges. */
6126 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6127 the LOW_VALUE, so there is no need to check unless the
6128 LOW_BOUND is in fact itself a case range. */
6134 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6135 range is bigger than the low end of the current range, so we
6136 are only interested if the current range is a real range, and
6137 not an ordinary case label. */
6139 && high_value
6141 high_value)
6144 }
6145 /* If there was an overlap, issue an error. */
6147 {
6151 {
6155 }
6157 {
6160 }
6161 else
6162 {
6166 }
6168 }
6170 /* Add a CASE_LABEL to the statement-tree. */
6172 /* Register this case label in the splay tree. */
6179 error_out:
6180 /* Add a label so that the back-end doesn't think that the beginning of
6181 the switch is unreachable. Note that we do not add a case label, as
6182 that just leads to duplicates and thence to failure later on. */
6184 {
6187 }
6189 }
6191 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6192 Used to verify that case values match up with enumerator values. */
6194 static void
6196 {
6203 else
6210 buf);
6211 else
6216 }
6218 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6219 Used to verify that case values match up with enumerator values. */
6221 static int
6223 {
6227 /* Skip default case. */
6231 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6232 when we did our enum->case scan. Reset our scratch bit after. */
6235 else
6238 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6239 not set, that means that CASE_HIGH did not appear when we did our
6240 enum->case scan. Reset our scratch bit after. */
6242 {
6245 else
6247 }
6250 }
6252 /* Handle -Wswitch*. Called from the front end after parsing the
6253 switch construct. */
6254 /* ??? Should probably be somewhere generic, since other languages
6255 besides C and C++ would want this. At the moment, however, C/C++
6256 are the only tree-ssa languages that support enumerations at all,
6257 so the point is moot. */
6259 void
6262 {
6263 splay_tree_node default_node;
6264 splay_tree_node node;
6265 tree chain;
6275 /* From here on, we only care about about enumerated types. */
6279 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6283 /* Check the cases. Warn about case values which are not members of
6284 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6285 there is no default case, check that exactly all enumeration
6286 literals are covered by the cases. */
6288 /* Clearing COND if it is not an integer constant simplifies
6289 the tests inside the loop below. */
6293 /* The time complexity here is O(N*lg(N)) worst case, but for the
6294 common case of monotonically increasing enumerators, it is
6295 O(N), since the nature of the splay tree will keep the next
6296 element adjacent to the root at all times. */
6299 {
6305 {
6306 /* Mark the CASE_LOW part of the case entry as seen. */
6310 }
6312 /* Even though there wasn't an exact match, there might be a
6313 case range which includes the enumerator's value. */
6316 {
6320 {
6321 /* If we match the upper bound exactly, mark the CASE_HIGH
6322 part of the case entry as seen. */
6326 }
6327 }
6329 /* We've now determined that this enumerated literal isn't
6330 handled by the case labels of the switch statement. */
6332 /* If the switch expression is a constant, we only really care
6333 about whether that constant is handled by the switch. */
6337 /* If there is a default_node, the only relevant option is
6338 Wswitch-enum. Otherwise, if both are enabled then we prefer
6339 to warn using -Wswitch because -Wswitch is enabled by -Wall
6340 while -Wswitch-enum is explicit. */
6343 ? OPT_Wswitch_enum
6347 }
6349 /* Warn if there are case expressions that don't correspond to
6350 enumerators. This can occur since C and C++ don't enforce
6351 type-checking of assignments to enumeration variables.
6353 The time complexity here is now always O(N) worst case, since
6354 we should have marked both the lower bound and upper bound of
6355 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6356 above. This scan also resets those fields. */
6359 }
6361 /* Finish an expression taking the address of LABEL (an
6362 IDENTIFIER_NODE). Returns an expression for the address.
6364 LOC is the location for the expression returned. */
6366 tree
6368 {
6369 tree result;
6379 else
6380 {
6383 /* The current function is not necessarily uninlinable.
6384 Computed gotos are incompatible with inlining, but the value
6385 here could be used only in a diagnostic, for example. */
6387 }
6390 }
6391 \f
6393 /* Given a boolean expression ARG, return a tree representing an increment
6394 or decrement (as indicated by CODE) of ARG. The front end must check for
6395 invalid cases (e.g., decrement in C++). */
6396 tree
6398 {
6399 tree val;
6404 {
6427 }
6430 }
6431 \f
6432 /* Built-in macros for stddef.h and stdint.h, that require macros
6433 defined in this file. */
6434 void
6436 {
6499 }
6501 static void
6503 {
6504 /* Fill in the built_in_attributes array. */
6505 #define DEF_ATTR_NULL_TREE(ENUM) \
6506 built_in_attributes[(int) ENUM] = NULL_TREE;
6507 #define DEF_ATTR_INT(ENUM, VALUE) \
6508 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6509 #define DEF_ATTR_STRING(ENUM, VALUE) \
6510 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6511 #define DEF_ATTR_IDENT(ENUM, STRING) \
6512 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6513 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6514 built_in_attributes[(int) ENUM] \
6515 = tree_cons (built_in_attributes[(int) PURPOSE], \
6516 built_in_attributes[(int) VALUE], \
6517 built_in_attributes[(int) CHAIN]);
6519 #undef DEF_ATTR_NULL_TREE
6520 #undef DEF_ATTR_INT
6521 #undef DEF_ATTR_IDENT
6522 #undef DEF_ATTR_TREE_LIST
6523 }
6525 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6526 identifier as an argument, so the front end shouldn't look it up. */
6528 bool
6530 {
6533 /* Unknown attribute that we'll end up ignoring, return true so we
6534 don't complain about an identifier argument. */
6540 else
6542 }
6544 /* Attribute handlers common to C front ends. */
6546 /* Handle a "packed" attribute; arguments as in
6547 struct attribute_spec.handler. */
6549 static tree
6552 {
6554 {
6558 }
6560 {
6562 /* Still pack bitfields. */
6567 else
6569 }
6570 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6571 used for DECL_REGISTER. It wouldn't mean anything anyway.
6572 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6573 that changes what the typedef is typing. */
6574 else
6575 {
6578 }
6581 }
6583 /* Handle a "nocommon" attribute; arguments as in
6584 struct attribute_spec.handler. */
6586 static tree
6590 {
6593 else
6594 {
6597 }
6600 }
6602 /* Handle a "common" attribute; arguments as in
6603 struct attribute_spec.handler. */
6605 static tree
6608 {
6611 else
6612 {
6615 }
6618 }
6620 /* Handle a "noreturn" attribute; arguments as in
6621 struct attribute_spec.handler. */
6623 static tree
6626 {
6629 /* See FIXME comment in c_common_attribute_table. */
6636 = (build_qualified_type
6637 (build_pointer_type
6641 else
6642 {
6645 }
6648 }
6650 /* Handle a "hot" and attribute; arguments as in
6651 struct attribute_spec.handler. */
6653 static tree
6656 {
6659 {
6661 {
6665 }
6666 /* Most of the rest of the hot processing is done later with
6667 lookup_attribute. */
6668 }
6669 else
6670 {
6673 }
6676 }
6678 /* Handle a "cold" and attribute; arguments as in
6679 struct attribute_spec.handler. */
6681 static tree
6684 {
6687 {
6689 {
6693 }
6694 /* Most of the rest of the cold processing is done later with
6695 lookup_attribute. */
6696 }
6697 else
6698 {
6701 }
6704 }
6706 /* Handle a "no_sanitize_address" attribute; arguments as in
6707 struct attribute_spec.handler. */
6709 static tree
6712 {
6714 {
6717 }
6720 }
6722 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6723 struct attribute_spec.handler. */
6725 static tree
6728 {
6737 }
6739 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6740 struct attribute_spec.handler. */
6742 static tree
6745 {
6747 {
6750 }
6753 }
6755 /* Handle a "noinline" attribute; arguments as in
6756 struct attribute_spec.handler. */
6758 static tree
6762 {
6764 {
6766 {
6770 }
6771 else
6773 }
6774 else
6775 {
6778 }
6781 }
6783 /* Handle a "noclone" attribute; arguments as in
6784 struct attribute_spec.handler. */
6786 static tree
6790 {
6792 {
6795 }
6798 }
6800 /* Handle a "always_inline" attribute; arguments as in
6801 struct attribute_spec.handler. */
6803 static tree
6808 {
6810 {
6812 {
6816 }
6817 else
6818 /* Set the attribute and mark it for disregarding inline
6819 limits. */
6821 }
6822 else
6823 {
6826 }
6829 }
6831 /* Handle a "gnu_inline" attribute; arguments as in
6832 struct attribute_spec.handler. */
6834 static tree
6839 {
6841 {
6842 /* Do nothing else, just set the attribute. We'll get at
6843 it later with lookup_attribute. */
6844 }
6845 else
6846 {
6849 }
6852 }
6854 /* Handle a "leaf" attribute; arguments as in
6855 struct attribute_spec.handler. */
6857 static tree
6861 {
6863 {
6866 }
6868 {
6871 }
6874 }
6876 /* Handle an "artificial" attribute; arguments as in
6877 struct attribute_spec.handler. */
6879 static tree
6884 {
6886 {
6887 /* Do nothing else, just set the attribute. We'll get at
6888 it later with lookup_attribute. */
6889 }
6890 else
6891 {
6894 }
6897 }
6899 /* Handle a "flatten" attribute; arguments as in
6900 struct attribute_spec.handler. */
6902 static tree
6904 tree args ATTRIBUTE_UNUSED,
6906 {
6908 /* Do nothing else, just set the attribute. We'll get at
6909 it later with lookup_attribute. */
6910 ;
6911 else
6912 {
6915 }
6918 }
6920 /* Handle a "warning" or "error" attribute; arguments as in
6921 struct attribute_spec.handler. */
6923 static tree
6926 {
6929 /* Do nothing else, just set the attribute. We'll get at
6930 it later with lookup_attribute. */
6931 ;
6932 else
6933 {
6936 }
6939 }
6941 /* Handle a "used" attribute; arguments as in
6942 struct attribute_spec.handler. */
6944 static tree
6947 {
6953 {
6958 }
6959 else
6960 {
6963 }
6966 }
6968 /* Handle a "unused" attribute; arguments as in
6969 struct attribute_spec.handler. */
6971 static tree
6974 {
6976 {
6984 {
6989 }
6990 else
6991 {
6994 }
6995 }
6996 else
6997 {
7001 }
7004 }
7006 /* Handle a "externally_visible" attribute; arguments as in
7007 struct attribute_spec.handler. */
7009 static tree
7014 {
7018 {
7021 {
7025 }
7026 }
7027 else
7028 {
7031 }
7034 }
7036 /* Handle the "no_reorder" attribute. Arguments as in
7037 struct attribute_spec.handler. */
7039 static tree
7041 tree name,
7042 tree,
7045 {
7050 {
7053 name);
7055 }
7058 }
7060 /* Handle a "const" attribute; arguments as in
7061 struct attribute_spec.handler. */
7063 static tree
7066 {
7069 /* See FIXME comment on noreturn in c_common_attribute_table. */
7075 = (build_qualified_type
7076 (build_pointer_type
7080 else
7081 {
7084 }
7087 }
7089 /* Handle a "transparent_union" attribute; arguments as in
7090 struct attribute_spec.handler. */
7092 static tree
7096 {
7097 tree type;
7108 {
7109 /* Make sure that the first field will work for a transparent union.
7110 If the type isn't complete yet, leave the check to the code in
7111 finish_struct. */
7113 {
7119 }
7122 {
7123 /* If the type isn't complete yet, setting the flag
7124 on a variant wouldn't ever be checked. */
7128 /* build_duplicate_type doesn't work for C++. */
7132 /* A type variant isn't good enough, since we don't a cast
7133 to such a type removed as a no-op. */
7135 }
7139 }
7141 ignored:
7144 }
7146 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7147 get the requested priority for a constructor or destructor,
7148 possibly issuing diagnostics for invalid or reserved
7149 priorities. */
7151 static priority_type
7153 {
7154 HOST_WIDE_INT pri;
7155 tree arg;
7161 {
7164 else
7167 }
7184 {
7187 "destructor priorities from 0 to %d are reserved "
7189 MAX_RESERVED_INIT_PRIORITY);
7190 else
7192 "constructor priorities from 0 to %d are reserved "
7194 MAX_RESERVED_INIT_PRIORITY);
7195 }
7198 invalid:
7201 MAX_INIT_PRIORITY);
7202 else
7204 MAX_INIT_PRIORITY);
7206 }
7208 /* Handle a "constructor" attribute; arguments as in
7209 struct attribute_spec.handler. */
7211 static tree
7215 {
7222 {
7223 priority_type priority;
7228 }
7229 else
7230 {
7233 }
7236 }
7238 /* Handle a "destructor" attribute; arguments as in
7239 struct attribute_spec.handler. */
7241 static tree
7245 {
7252 {
7253 priority_type priority;
7258 }
7259 else
7260 {
7263 }
7266 }
7268 /* Nonzero if the mode is a valid vector mode for this architecture.
7269 This returns nonzero even if there is no hardware support for the
7270 vector mode, but we can emulate with narrower modes. */
7272 static int
7274 {
7276 machine_mode innermode;
7278 /* Doh! What's going on? */
7287 /* Hardware support. Woo hoo! */
7293 /* We should probably return 1 if requesting V4DI and we have no DI,
7294 but we have V2DI, but this is probably very unlikely. */
7296 /* If we have support for the inner mode, we can safely emulate it.
7297 We may not have V2DI, but me can emulate with a pair of DIs. */
7299 }
7302 /* Handle a "mode" attribute; arguments as in
7303 struct attribute_spec.handler. */
7305 static tree
7308 {
7316 else
7317 {
7322 tree typefm;
7327 {
7333 }
7335 /* Change this type to have a type with the specified mode.
7336 First check for the special modes. */
7349 else
7352 {
7355 }
7358 {
7361 }
7365 {
7397 }
7399 {
7402 }
7405 {
7410 {
7413 }
7417 else
7420 }
7421 else
7422 {
7423 /* For fixed-point modes, we need to test if the signness of type
7424 and the machine mode are consistent. */
7427 {
7430 }
7431 /* For fixed-point modes, we need to pass saturating info. */
7435 }
7438 {
7441 }
7443 {
7444 /* For enumeral types, copy the precision from the integer
7445 type returned above. If not an INTEGER_TYPE, we can't use
7446 this mode for this type. */
7448 {
7451 }
7454 {
7457 }
7458 else
7459 {
7460 /* We cannot build a type variant, as there's code that assumes
7461 that TYPE_MAIN_VARIANT has the same mode. This includes the
7462 debug generators. Instead, create a subrange type. This
7463 results in all of the enumeral values being emitted only once
7464 in the original, and the subtype gets them by reference. */
7467 else
7470 }
7471 }
7475 {
7478 }
7481 }
7484 }
7486 /* Handle a "section" attribute; arguments as in
7487 struct attribute_spec.handler. */
7489 static tree
7492 {
7496 {
7502 {
7506 {
7508 "section attribute cannot be specified for "
7511 }
7513 /* The decl may have already been given a section attribute
7514 from a previous declaration. Ensure they match. */
7518 {
7522 }
7526 {
7529 }
7530 else
7533 }
7534 else
7535 {
7538 }
7539 }
7540 else
7541 {
7545 }
7548 }
7550 /* Check whether ALIGN is a valid user-specified alignment. If so,
7551 return its base-2 log; if not, output an error and return -1. If
7552 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7553 no error. */
7554 int
7556 {
7563 {
7566 }
7571 {
7574 }
7576 {
7579 }
7581 }
7583 /*
7584 If in c++-11, check if the c++-11 alignment constraint with respect
7585 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7586 c++-11 mode, does nothing.
7588 [dcl.align]2/ says:
7590 [* if the constant expression evaluates to a fundamental alignment,
7591 the alignment requirement of the declared entity shall be the
7592 specified fundamental alignment.
7594 * if the constant expression evaluates to an extended alignment
7595 and the implementation supports that alignment in the context
7596 of the declaration, the alignment of the declared entity shall
7597 be that alignment
7599 * if the constant expression evaluates to an extended alignment
7600 and the implementation does not support that alignment in the
7601 context of the declaration, the program is ill-formed]. */
7603 static bool
7607 {
7620 {
7622 {
7623 /* For file scope variables and static members, the target
7624 supports alignments that are at most
7625 MAX_OFILE_ALIGNMENT. */
7628 }
7629 else
7630 {
7631 #ifdef BIGGEST_FIELD_ALIGNMENT
7632 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7633 #else
7634 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7635 #endif
7636 /* For non-static members, the target supports either
7637 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7638 if it is defined or BIGGEST_ALIGNMENT. */
7643 #undef MAX_TARGET_FIELD_ALIGNMENT
7644 /* For stack variables, the target supports at most
7645 MAX_STACK_ALIGNMENT. */
7649 }
7650 }
7652 {
7653 /* Let's be liberal for types. */
7656 }
7664 }
7666 /* Handle a "aligned" attribute; arguments as in
7667 struct attribute_spec.handler. */
7669 static tree
7672 {
7676 tree align_expr;
7680 {
7685 }
7686 else
7690 {
7694 }
7702 {
7705 /* If we have a TYPE_DECL, then copy the type, so that we
7706 don't accidentally modify a builtin type. See pushdecl. */
7709 {
7716 }
7717 else
7722 }
7725 {
7728 }
7731 /* C++-11 [dcl.align/4]:
7733 When multiple alignment-specifiers are specified for an
7734 entity, the alignment requirement shall be set to the
7735 strictest specified alignment.
7737 This formally comes from the c++11 specification but we are
7738 doing it for the GNU attribute syntax as well. */
7742 {
7747 else
7751 }
7752 else
7753 {
7756 }
7759 }
7761 /* Handle a "weak" attribute; arguments as in
7762 struct attribute_spec.handler. */
7764 static tree
7769 {
7772 {
7775 }
7777 {
7781 }
7784 {
7789 }
7790 else
7794 }
7796 /* Handle an "alias" or "ifunc" attribute; arguments as in
7797 struct attribute_spec.handler, except that IS_ALIAS tells us
7798 whether this is an alias as opposed to ifunc attribute. */
7800 static tree
7803 {
7808 {
7811 }
7815 /* A static variable declaration is always a tentative definition,
7816 but the alias is a non-tentative definition which overrides. */
7819 {
7823 }
7827 {
7831 }
7833 /* Note that the very first time we process a nested declaration,
7834 decl_function_context will not be set. Indeed, *would* never
7835 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7836 we do below. After such frobbery, pushdecl would set the context.
7837 In any case, this is never what we want. */
7839 {
7840 tree id;
7844 {
7848 }
7850 /* This counts as a use of the object pointed to. */
7855 else
7859 /* ifuncs are also aliases, so set that attribute too. */
7862 }
7863 else
7864 {
7867 }
7870 {
7873 {
7876 else
7878 }
7879 }
7883 }
7885 /* Handle an "alias" or "ifunc" attribute; arguments as in
7886 struct attribute_spec.handler. */
7888 static tree
7891 {
7893 }
7895 /* Handle an "alias" or "ifunc" attribute; arguments as in
7896 struct attribute_spec.handler. */
7898 static tree
7901 {
7903 }
7905 /* Handle a "weakref" attribute; arguments as in struct
7906 attribute_spec.handler. */
7908 static tree
7911 {
7914 /* We must ignore the attribute when it is associated with
7915 local-scoped decls, since attribute alias is ignored and many
7916 such symbols do not even have a DECL_WEAK field. */
7918 || current_function_decl
7920 {
7924 }
7927 {
7931 }
7933 /* The idea here is that `weakref("name")' mutates into `weakref,
7934 alias("name")', and weakref without arguments, in turn,
7935 implicitly adds weak. */
7938 {
7945 }
7946 else
7947 {
7952 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7953 and that isn't supported; and because it wants to add it to
7954 the list of weak decls, which isn't helpful. */
7956 }
7959 {
7963 }
7966 }
7968 /* Handle an "visibility" attribute; arguments as in
7969 struct attribute_spec.handler. */
7971 static tree
7975 {
7981 {
7985 {
7987 name);
7989 }
7991 {
7995 }
7996 }
7998 {
8001 }
8004 {
8007 }
8009 /* If this is a type, set the visibility on the type decl. */
8011 {
8016 {
8018 name);
8020 }
8021 }
8031 else
8032 {
8033 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8035 }
8039 {
8053 }
8058 /* Go ahead and attach the attribute to the node as well. This is needed
8059 so we can determine whether we have VISIBILITY_DEFAULT because the
8060 visibility was not specified, or because it was explicitly overridden
8061 from the containing scope. */
8064 }
8066 /* Determine the ELF symbol visibility for DECL, which is either a
8067 variable or a function. It is an error to use this function if a
8068 definition of DECL is not available in this translation unit.
8069 Returns true if the final visibility has been determined by this
8070 function; false if the caller is free to make additional
8071 modifications. */
8073 bool
8075 {
8079 /* If the user explicitly specified the visibility with an
8080 attribute, honor that. DECL_VISIBILITY will have been set during
8081 the processing of the attribute. We check for an explicit
8082 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8083 to distinguish the use of an attribute from the use of a "#pragma
8084 GCC visibility push(...)"; in the latter case we still want other
8085 considerations to be able to overrule the #pragma. */
8087 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8092 /* Set default visibility to whatever the user supplied with
8093 visibility_specified depending on #pragma GCC visibility. */
8095 {
8098 {
8101 /* If visibility changed and DECL already has DECL_RTL, ensure
8102 symbol flags are updated. */
8107 }
8108 }
8110 }
8112 /* Handle an "tls_model" attribute; arguments as in
8113 struct attribute_spec.handler. */
8115 static tree
8118 {
8119 tree id;
8126 {
8129 }
8134 {
8137 }
8147 else
8148 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8152 }
8154 /* Handle a "no_instrument_function" attribute; arguments as in
8155 struct attribute_spec.handler. */
8157 static tree
8162 {
8166 {
8170 }
8171 else
8175 }
8177 /* Handle a "malloc" attribute; arguments as in
8178 struct attribute_spec.handler. */
8180 static tree
8183 {
8187 else
8188 {
8191 }
8194 }
8196 /* Handle a "alloc_size" attribute; arguments as in
8197 struct attribute_spec.handler. */
8199 static tree
8202 {
8205 {
8212 || !arg_count
8214 {
8219 }
8220 }
8222 }
8224 /* Handle a "alloc_align" attribute; arguments as in
8225 struct attribute_spec.handler. */
8227 static tree
8230 {
8237 || !arg_count
8239 {
8244 }
8246 }
8248 /* Handle a "assume_aligned" attribute; arguments as in
8249 struct attribute_spec.handler. */
8251 static tree
8254 {
8256 {
8263 {
8268 }
8269 }
8271 }
8273 /* Handle a "fn spec" attribute; arguments as in
8274 struct attribute_spec.handler. */
8276 static tree
8280 {
8285 }
8287 /* Handle a "bnd_variable_size" attribute; arguments as in
8288 struct attribute_spec.handler. */
8290 static tree
8293 {
8295 {
8298 }
8301 }
8303 /* Handle a "bnd_legacy" attribute; arguments as in
8304 struct attribute_spec.handler. */
8306 static tree
8309 {
8311 {
8314 }
8317 }
8319 /* Handle a "bnd_instrument" attribute; arguments as in
8320 struct attribute_spec.handler. */
8322 static tree
8325 {
8327 {
8330 }
8333 }
8335 /* Handle a "warn_unused" attribute; arguments as in
8336 struct attribute_spec.handler. */
8338 static tree
8340 tree args ATTRIBUTE_UNUSED,
8342 {
8344 /* Do nothing else, just set the attribute. We'll get at
8345 it later with lookup_attribute. */
8346 ;
8347 else
8348 {
8351 }
8354 }
8356 /* Handle an "omp declare simd" attribute; arguments as in
8357 struct attribute_spec.handler. */
8359 static tree
8361 {
8363 }
8365 /* Handle an "omp declare target" attribute; arguments as in
8366 struct attribute_spec.handler. */
8368 static tree
8370 {
8372 }
8374 /* Handle a "returns_twice" attribute; arguments as in
8375 struct attribute_spec.handler. */
8377 static tree
8380 {
8383 else
8384 {
8387 }
8390 }
8392 /* Handle a "no_limit_stack" attribute; arguments as in
8393 struct attribute_spec.handler. */
8395 static tree
8400 {
8404 {
8408 }
8410 {
8414 }
8415 else
8419 }
8421 /* Handle a "pure" attribute; arguments as in
8422 struct attribute_spec.handler. */
8424 static tree
8427 {
8430 /* ??? TODO: Support types. */
8431 else
8432 {
8435 }
8438 }
8440 /* Digest an attribute list destined for a transactional memory statement.
8441 ALLOWED is the set of attributes that are allowed for this statement;
8442 return the attribute we parsed. Multiple attributes are never allowed. */
8444 int
8446 {
8451 {
8459 {
8462 }
8465 {
8468 }
8471 else
8473 }
8476 }
8478 /* Transform a TM attribute name into a maskable integer and back.
8479 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8480 to how the lack of an attribute is treated. */
8482 int
8484 {
8498 }
8500 tree
8502 {
8505 {
8523 }
8525 }
8527 /* Return the first TM attribute seen in LIST. */
8529 tree
8531 {
8533 {
8537 }
8539 }
8541 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8542 Here we accept only function types, and verify that none of the other
8543 function TM attributes are also applied. */
8544 /* ??? We need to accept class types for C++, but not C. This greatly
8545 complicates this function, since we can no longer rely on the extra
8546 processing given by function_type_required. */
8548 static tree
8551 {
8552 /* Only one path adds the attribute; others don't. */
8556 {
8559 /* Only tm_callable and tm_safe apply to classes. */
8562 /* FALLTHRU */
8566 {
8569 ;
8572 else
8574 }
8578 {
8581 {
8586 }
8587 }
8588 /* FALLTHRU */
8591 /* If a function is next, pass it on to be tried next. */
8595 ignored:
8598 }
8601 }
8603 /* Handle the TM_WRAP attribute; arguments as in
8604 struct attribute_spec.handler. */
8606 static tree
8609 {
8612 /* We don't need the attribute even on success, since we
8613 record the entry in an external table. */
8618 else
8619 {
8622 ;
8627 else
8628 {
8632 {
8636 else
8638 }
8639 else
8641 }
8642 }
8645 }
8647 /* Ignore the given attribute. Used when this attribute may be usefully
8648 overridden by the target, but is not used generically. */
8650 static tree
8654 {
8657 }
8659 /* Handle a "no vops" attribute; arguments as in
8660 struct attribute_spec.handler. */
8662 static tree
8666 {
8670 }
8672 /* Handle a "deprecated" attribute; arguments as in
8673 struct attribute_spec.handler. */
8675 static tree
8679 {
8687 {
8690 }
8693 {
8704 else
8706 }
8708 {
8713 }
8714 else
8718 {
8721 {
8727 }
8730 else
8732 }
8735 }
8737 /* Handle a "vector_size" attribute; arguments as in
8738 struct attribute_spec.handler. */
8740 static tree
8744 {
8746 machine_mode orig_mode;
8757 {
8760 }
8762 /* Get the vector size (in bytes). */
8765 /* We need to provide for vector pointers, vector arrays, and
8766 functions returning vectors. For example:
8768 __attribute__((vector_size(16))) short *foo;
8770 In this case, the mode is SI, but the type being modified is
8771 HI, so we need to look further. */
8780 /* Get the mode of the type being modified. */
8791 {
8794 }
8797 {
8800 }
8803 {
8806 }
8808 /* Calculate how many units fit in the vector. */
8811 {
8814 }
8818 /* Build back pointers if needed. */
8822 }
8824 /* Handle the "nonnull" attribute. */
8825 static tree
8829 {
8833 /* If no arguments are specified, all pointer arguments should be
8834 non-null. Verify a full prototype is given so that the arguments
8835 will have the correct types when we actually check them later. */
8837 {
8839 {
8842 }
8844 }
8846 /* Argument list specified. Verify that each argument number references
8847 a pointer argument. */
8849 {
8858 {
8863 }
8866 {
8867 function_args_iterator iter;
8868 tree argument;
8872 {
8876 }
8880 {
8885 }
8888 {
8893 }
8894 }
8895 }
8898 }
8900 /* Check the argument list of a function call for null in argument slots
8901 that are marked as requiring a non-null pointer argument. The NARGS
8902 arguments are passed in the array ARGARRAY.
8903 */
8905 static void
8907 {
8908 tree a;
8916 /* See if any of the nonnull attributes has no arguments. If so,
8917 then every pointer argument is checked (in which case the check
8918 for pointer type is done in check_nonnull_arg). */
8920 do
8928 else
8929 {
8930 /* Walk the argument list. If we encounter an argument number we
8931 should check for non-null, do it. */
8933 {
8935 {
8939 }
8944 }
8945 }
8946 }
8948 /* Check that the Nth argument of a function call (counting backwards
8949 from the end) is a (pointer)0. The NARGS arguments are passed in the
8950 array ARGARRAY. */
8952 static void
8954 {
8958 {
8961 tree sentinel;
8962 function_args_iterator iter;
8963 tree t;
8965 /* Skip over the named arguments. */
8967 {
8970 len++;
8971 }
8974 {
8977 }
8979 /* The sentinel must be one of the varargs, i.e.
8980 in position >= the number of fixed arguments. */
8982 {
8986 }
8988 /* Validate the sentinel. */
8992 /* Although __null (in C++) is only an integer we allow it
8993 nevertheless, as we are guaranteed that it's exactly
8994 as wide as a pointer, and we don't want to force
8995 users to cast the NULL they have written there.
8996 We warn with -Wstrict-null-sentinel, though. */
8999 }
9000 }
9002 /* Helper for check_function_nonnull; given a list of operands which
9003 must be non-null in ARGS, determine if operand PARAM_NUM should be
9004 checked. */
9006 static bool
9008 {
9012 {
9019 }
9021 }
9023 /* Check that the function argument PARAM (which is operand number
9024 PARAM_NUM) is non-null. This is called by check_function_nonnull
9025 via check_function_arguments_recurse. */
9027 static void
9030 {
9031 /* Just skip checking the argument if it's not a pointer. This can
9032 happen if the "nonnull" attribute was given without an operand
9033 list (which means to check every pointer argument). */
9041 }
9043 /* Helper for nonnull attribute handling; fetch the operand number
9044 from the attribute argument list. */
9046 static bool
9048 {
9049 /* Verify the arg number is a small constant. */
9051 {
9054 }
9055 else
9057 }
9059 /* Handle a "nothrow" attribute; arguments as in
9060 struct attribute_spec.handler. */
9062 static tree
9065 {
9068 /* ??? TODO: Support types. */
9069 else
9070 {
9073 }
9076 }
9078 /* Handle a "cleanup" attribute; arguments as in
9079 struct attribute_spec.handler. */
9081 static tree
9084 {
9088 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9089 for global destructors in C++. This requires infrastructure that
9090 we don't have generically at the moment. It's also not a feature
9091 we'd be missing too much, since we do have attribute constructor. */
9093 {
9097 }
9099 /* Verify that the argument is a function in scope. */
9100 /* ??? We could support pointers to functions here as well, if
9101 that was considered desirable. */
9104 {
9108 }
9111 {
9115 }
9117 /* That the function has proper type is checked with the
9118 eventual call to build_function_call. */
9121 }
9123 /* Handle a "warn_unused_result" attribute. No special handling. */
9125 static tree
9129 {
9130 /* Ignore the attribute for functions not returning any value. */
9132 {
9135 }
9138 }
9140 /* Handle a "sentinel" attribute. */
9142 static tree
9145 {
9147 {
9151 }
9152 else
9153 {
9155 {
9159 }
9160 }
9163 {
9171 {
9175 }
9176 else
9177 {
9179 {
9183 }
9184 }
9185 }
9188 }
9190 /* Handle a "type_generic" attribute. */
9192 static tree
9196 {
9197 /* Ensure we have a function type. */
9200 /* Ensure we have a variadic function. */
9204 }
9206 /* Handle a "target" attribute. */
9208 static tree
9211 {
9212 /* Ensure we have a function type. */
9214 {
9217 }
9219 flags))
9223 }
9225 /* Arguments being collected for optimization. */
9230 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9231 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9232 false for #pragma GCC optimize. */
9234 bool
9236 {
9244 tree ap;
9246 /* Build up argv vector. Just in case the string is stored away, use garbage
9247 collected strings. */
9252 {
9256 {
9260 }
9263 {
9264 /* Split string into multiple substrings. */
9272 {
9279 {
9283 }
9284 else
9285 {
9288 }
9292 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9293 options. */
9295 {
9300 else
9304 }
9307 {
9310 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9311 itself is -Os, and any other switch begins with a -f. */
9317 }
9322 }
9324 }
9325 }
9335 /* Now parse the options. */
9345 /* Don't allow changing -fstrict-aliasing. */
9350 }
9352 /* For handling "optimize" attribute. arguments as in
9353 struct attribute_spec.handler. */
9355 static tree
9358 {
9359 /* Ensure we have a function type. */
9361 {
9364 }
9365 else
9366 {
9370 /* Save current options. */
9373 /* If we previously had some optimization options, use them as the
9374 default. */
9379 /* Parse options, and update the vector. */
9384 /* Restore current options. */
9386 }
9389 }
9391 /* Handle a "no_split_stack" attribute. */
9393 static tree
9398 {
9402 {
9406 }
9408 {
9412 }
9415 }
9417 /* Handle a "returns_nonnull" attribute; arguments as in
9418 struct attribute_spec.handler. */
9420 static tree
9423 {
9424 // Even without a prototype we still have a return type we can check.
9426 {
9429 }
9431 }
9433 /* Handle a "designated_init" attribute; arguments as in
9434 struct attribute_spec.handler. */
9436 static tree
9439 {
9441 {
9444 }
9446 }
9448 \f
9449 /* Check for valid arguments being passed to a function with FNTYPE.
9450 There are NARGS arguments in the array ARGARRAY. */
9451 void
9453 {
9454 /* Check for null being passed in a pointer argument that must be
9455 non-null. We also need to do this if format checking is enabled. */
9460 /* Check for errors in format strings. */
9467 }
9469 /* Generic argument checking recursion routine. PARAM is the argument to
9470 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9471 once the argument is resolved. CTX is context for the callback. */
9472 void
9477 {
9481 {
9482 /* Strip coercion. */
9486 }
9489 {
9491 tree attrs;
9494 /* See if this is a call to a known internationalization function
9495 that modifies a format arg. Such a function may have multiple
9496 format_arg attributes (for example, ngettext). */
9499 attrs;
9502 {
9503 tree inner_arg;
9504 tree format_num_expr;
9507 call_expr_arg_iterator iter;
9509 /* Extract the argument number, which was previously checked
9510 to be valid. */
9519 {
9524 }
9525 }
9527 /* If we found a format_arg attribute and did a recursive check,
9528 we are done with checking this argument. Otherwise, we continue
9529 and this will be considered a non-literal. */
9532 }
9535 {
9536 /* Check both halves of the conditional expression. */
9542 }
9545 }
9547 /* Checks for a builtin function FNDECL that the number of arguments
9548 NARGS against the required number REQUIRED and issues an error if
9549 there is a mismatch. Returns true if the number of arguments is
9550 correct, otherwise false. */
9552 static bool
9554 {
9556 {
9560 }
9562 {
9566 }
9568 }
9570 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9571 Returns false if there was an error, otherwise true. */
9573 bool
9575 {
9581 {
9591 {
9593 {
9597 }
9599 }
9609 {
9616 {
9620 }
9622 }
9627 {
9632 {
9636 }
9639 {
9641 fndecl);
9643 }
9645 }
9650 {
9652 {
9655 }
9657 }
9664 {
9668 {
9672 }
9675 {
9679 }
9681 }
9686 }
9687 }
9689 /* Function to help qsort sort FIELD_DECLs by name order. */
9691 int
9693 {
9698 /* A nontype is "greater" than a type. */
9707 }
9710 gt_pointer_operator new_value;
9714 /* This routine compares two fields like field_decl_cmp but using the
9715 pointer operator in resort_data. */
9717 static int
9719 {
9724 /* A nontype is "greater" than a type. */
9730 {
9737 }
9739 }
9741 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9743 void
9746 gt_pointer_operator new_value,
9748 {
9753 resort_field_decl_cmp);
9754 }
9756 /* Subroutine of c_parse_error.
9757 Return the result of concatenating LHS and RHS. RHS is really
9758 a string literal, its first character is indicated by RHS_START and
9759 RHS_SIZE is its length (including the terminating NUL character).
9761 The caller is responsible for deleting the returned pointer. */
9765 {
9771 }
9773 /* Issue the error given by GMSGID, indicating that it occurred before
9774 TOKEN, which had the associated VALUE. */
9776 void
9779 {
9780 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9790 {
9795 {
9808 }
9812 else
9818 }
9840 {
9845 }
9853 {
9858 }
9859 else
9863 {
9866 }
9867 #undef catenate_messages
9868 }
9870 /* Return the gcc option code associated with the reason for a cpp
9871 message, or 0 if none. */
9873 static int
9875 {
9879 {
9882 }
9884 }
9886 /* Callback from cpp_error for PFILE to print diagnostics from the
9887 preprocessor. The diagnostic is of type LEVEL, with REASON set
9888 to the reason code if LEVEL is represents a warning, at location
9889 LOCATION unless this is after lexing and the compiler's location
9890 should be used instead, with column number possibly overridden by
9891 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9892 the arguments. Returns true if a diagnostic was emitted, false
9893 otherwise. */
9895 bool
9899 {
9900 diagnostic_info diagnostic;
9901 diagnostic_t dlevel;
9906 {
9911 /* Fall through. */
9936 }
9949 }
9951 /* Convert a character from the host to the target execution character
9952 set. cpplib handles this, mostly. */
9954 HOST_WIDE_INT
9956 {
9957 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9958 zero-extended under -fno-signed-char. cpplib insists that characters
9959 and character constants are always unsigned. Hence we must convert
9960 back and forth. */
9968 else
9970 }
9972 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9973 references with an INDIRECT_REF of a constant at the bottom; much like the
9974 traditional rendering of offsetof as a macro. Return the folded result. */
9976 tree
9978 {
9982 {
9998 {
10001 }
10011 {
10015 }
10028 /* Check if the offset goes beyond the upper bound of the array. */
10030 {
10036 {
10040 {
10041 tree v;
10048 {
10056 }
10057 /* Don't warn if the array might be considered a poor
10058 man's flexible array member with a very permissive
10059 definition thereof. */
10063 "index %E denotes an offset "
10066 }
10067 }
10068 }
10075 /* Handle static members of volatile structs. */
10082 }
10085 }
10087 /* Likewise, but convert it to the return type of offsetof. */
10089 tree
10091 {
10093 }
10095 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10096 expression, because B will always be true. */
10098 void
10100 {
10103 "the omitted middle operand in ?: will always be %<true%>, "
10105 }
10107 /* Give an error for storing into ARG, which is 'const'. USE indicates
10108 how ARG was being used. */
10110 void
10112 {
10115 /* Using this macro rather than (for example) arrays of messages
10116 ensures that all the format strings are checked at compile
10117 time. */
10118 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10119 : (use == lv_increment ? (I) \
10120 : (use == lv_decrement ? (D) : (AS))))
10122 {
10133 else
10139 }
10145 arg);
10151 arg);
10153 {
10163 arg);
10164 }
10170 arg);
10171 else
10176 arg);
10177 }
10179 /* Print an error message for an invalid lvalue. USE says
10180 how the lvalue is being used and so selects the error message. LOC
10181 is the location for the error. */
10183 void
10185 {
10187 {
10205 }
10206 }
10208 /* Print an error message for an invalid indirection of type TYPE.
10209 ERRSTRING is the name of the operator for the indirection. */
10211 void
10213 {
10215 {
10223 type);
10228 type);
10233 type);
10238 type);
10243 type);
10247 }
10248 }
10249 \f
10250 /* *PTYPE is an incomplete array. Complete it with a domain based on
10251 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10252 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10253 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10255 int
10257 {
10265 {
10267 {
10268 int eltsize
10271 }
10273 {
10277 {
10281 }
10282 else
10283 {
10284 tree curindex;
10295 {
10299 else
10300 {
10302 {
10303 /* Since we treat size types now as ordinary
10304 unsigned types, we need an explicit overflow
10305 check. */
10309 }
10311 size_one_node);
10312 }
10315 }
10317 {
10321 }
10322 }
10323 }
10324 else
10325 {
10326 /* Make an error message unless that happened already. */
10329 }
10330 }
10331 else
10332 {
10336 }
10343 else
10346 /* Using build_distinct_type_copy and modifying things afterward instead
10347 of using build_array_type to create a new type preserves all of the
10348 TYPE_LANG_FLAG_? bits that the front end may have set. */
10356 /* Make sure we have the canonical MAIN_TYPE. */
10359 hashcode);
10362 /* Fix the canonical type. */
10372 else
10377 else
10383 {
10385 /* If we proceed with the array type as it is, we'll eventually
10386 crash in tree_to_[su]hwi(). */
10388 }
10392 }
10394 /* Like c_mark_addressable but don't check register qualifier. */
10395 void
10397 {
10403 }
10406 \f
10407 /* Used to help initialize the builtin-types.def table. When a type of
10408 the correct size doesn't exist, use error_mark_node instead of NULL.
10409 The later results in segfaults even when a decl using the type doesn't
10410 get invoked. */
10412 tree
10414 {
10417 }
10419 /* A helper function for resolve_overloaded_builtin in resolving the
10420 overloaded __sync_ builtins. Returns a positive power of 2 if the
10421 first operand of PARAMS is a pointer to a supported data type.
10422 Returns 0 if an error is encountered. */
10424 static int
10426 {
10427 tree type;
10431 {
10434 }
10438 {
10439 /* Force array-to-pointer decay for C++. */
10443 }
10455 incompatible:
10458 }
10460 /* A helper function for resolve_overloaded_builtin. Adds casts to
10461 PARAMS to make arguments match up with those of FUNCTION. Drops
10462 the variadic arguments at the end. Returns false if some error
10463 was encountered; true on success. */
10465 static bool
10468 {
10469 function_args_iterator iter;
10470 tree ptype;
10474 /* We've declared the implementation functions to use "volatile void *"
10475 as the pointer parameter, so we shouldn't get any complaints from the
10476 call to check_function_arguments what ever type the user used. */
10481 /* For the rest of the values, we need to cast these to FTYPE, so that we
10482 don't get warnings for passing pointer types, etc. */
10485 {
10489 /* XXX void_type_node belies the abstraction. */
10495 {
10498 }
10500 /* Only convert parameters if arg_type is unsigned integer type with
10501 new format sync routines, i.e. don't attempt to convert pointer
10502 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10503 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10504 kinds). */
10506 {
10507 /* Ideally for the first conversion we'd use convert_for_assignment
10508 so that we get warnings for anything that doesn't match the pointer
10509 type. This isn't portable across the C and C++ front ends atm. */
10514 }
10517 }
10519 /* __atomic routines are not variadic. */
10521 {
10524 }
10526 /* The definition of these primitives is variadic, with the remaining
10527 being "an optional list of variables protected by the memory barrier".
10528 No clue what that's supposed to mean, precisely, but we consider all
10529 call-clobbered variables to be protected so we're safe. */
10533 }
10535 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10536 RESULT to make it match the type of the first pointer argument in
10537 PARAMS. */
10539 static tree
10541 {
10546 /* New format doesn't require casting unless the types are the same size. */
10549 else
10551 }
10553 /* This function verifies the PARAMS to generic atomic FUNCTION.
10554 It returns the size if all the parameters are the same size, otherwise
10555 0 is returned if the parameters are invalid. */
10557 static int
10560 {
10565 tree type_0;
10567 /* Determine the parameter makeup. */
10569 {
10585 }
10588 {
10591 }
10593 /* Get type of first parameter, and determine its size. */
10596 {
10597 /* Force array-to-pointer decay for C++. */
10601 }
10603 {
10605 function);
10607 }
10609 /* Types must be compile time constant sizes. */
10611 {
10614 function);
10616 }
10620 /* Zero size objects are not allowed. */
10622 {
10625 function);
10627 }
10629 /* Check each other parameter is a pointer and the same size. */
10631 {
10634 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10638 {
10640 function);
10642 }
10646 {
10648 function);
10650 }
10651 }
10653 /* Check memory model parameters for validity. */
10655 {
10658 {
10661 {
10664 function);
10665 }
10666 }
10667 else
10669 {
10671 function);
10673 }
10674 }
10677 }
10680 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10681 at the beginning of the parameter list PARAMS representing the size of the
10682 objects. This is to match the library ABI requirement. LOC is the location
10683 of the function call.
10684 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10685 returned to allow the external call to be constructed. */
10687 static tree
10690 {
10691 tree size_node;
10693 /* Insert a SIZE_T parameter as the first param. If there isn't
10694 enough space, allocate a new vector and recursively re-build with that. */
10696 {
10699 tree f;
10709 }
10711 /* Add the size parameter and leave as a function call for processing. */
10715 }
10718 /* Return whether atomic operations for naturally aligned N-byte
10719 arguments are supported, whether inline or through libatomic. */
10720 static bool
10722 {
10724 {
10736 }
10737 }
10739 /* This will process an __atomic_exchange function call, determine whether it
10740 needs to be mapped to the _N variation, or turned into a library call.
10741 LOC is the location of the builtin call.
10742 FUNCTION is the DECL that has been invoked;
10743 PARAMS is the argument list for the call. The return value is non-null
10744 TRUE is returned if it is translated into the proper format for a call to the
10745 external library, and NEW_RETURN is set the tree for that function.
10746 FALSE is returned if processing for the _N variation is required, and
10747 NEW_RETURN is set to the the return value the result is copied into. */
10748 static bool
10751 {
10756 /* Size of 0 is an error condition. */
10758 {
10761 }
10763 /* If not a lock-free size, change to the library generic format. */
10765 {
10768 }
10770 /* Otherwise there is a lockfree match, transform the call from:
10771 void fn(T* mem, T* desired, T* return, model)
10772 into
10773 *return = (T) (fn (In* mem, (In) *desired, model)) */
10780 /* Create pointer to appropriate size. */
10784 /* Convert object pointer to required type. */
10787 /* Convert new value to required type, and dereference it. */
10792 /* Move memory model to the 3rd position, and end param list. */
10796 /* Convert return pointer and dereference it for later assignment. */
10800 }
10803 /* This will process an __atomic_compare_exchange function call, determine
10804 whether it needs to be mapped to the _N variation, or turned into a lib call.
10805 LOC is the location of the builtin call.
10806 FUNCTION is the DECL that has been invoked;
10807 PARAMS is the argument list for the call. The return value is non-null
10808 TRUE is returned if it is translated into the proper format for a call to the
10809 external library, and NEW_RETURN is set the tree for that function.
10810 FALSE is returned if processing for the _N variation is required. */
10812 static bool
10816 {
10821 /* Size of 0 is an error condition. */
10823 {
10826 }
10828 /* If not a lock-free size, change to the library generic format. */
10830 {
10831 /* The library generic format does not have the weak parameter, so
10832 remove it from the param list. Since a parameter has been removed,
10833 we can be sure that there is room for the SIZE_T parameter, meaning
10834 there will not be a recursive rebuilding of the parameter list, so
10835 there is no danger this will be done twice. */
10837 {
10841 }
10844 }
10846 /* Otherwise, there is a match, so the call needs to be transformed from:
10847 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10848 into
10849 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10855 /* Create pointer to appropriate size. */
10859 /* Convert object pointer to required type. */
10863 /* Convert expected pointer to required type. */
10867 /* Convert desired value to required type, and dereference it. */
10872 /* The rest of the parameters are fine. NULL means no special return value
10873 processing.*/
10876 }
10879 /* This will process an __atomic_load function call, determine whether it
10880 needs to be mapped to the _N variation, or turned into a library call.
10881 LOC is the location of the builtin call.
10882 FUNCTION is the DECL that has been invoked;
10883 PARAMS is the argument list for the call. The return value is non-null
10884 TRUE is returned if it is translated into the proper format for a call to the
10885 external library, and NEW_RETURN is set the tree for that function.
10886 FALSE is returned if processing for the _N variation is required, and
10887 NEW_RETURN is set to the the return value the result is copied into. */
10889 static bool
10892 {
10897 /* Size of 0 is an error condition. */
10899 {
10902 }
10904 /* If not a lock-free size, change to the library generic format. */
10906 {
10909 }
10911 /* Otherwise, there is a match, so the call needs to be transformed from:
10912 void fn(T* mem, T* return, model)
10913 into
10914 *return = (T) (fn ((In *) mem, model)) */
10920 /* Create pointer to appropriate size. */
10924 /* Convert object pointer to required type. */
10928 /* Move memory model to the 2nd position, and end param list. */
10932 /* Convert return pointer and dereference it for later assignment. */
10936 }
10939 /* This will process an __atomic_store function call, determine whether it
10940 needs to be mapped to the _N variation, or turned into a library call.
10941 LOC is the location of the builtin call.
10942 FUNCTION is the DECL that has been invoked;
10943 PARAMS is the argument list for the call. The return value is non-null
10944 TRUE is returned if it is translated into the proper format for a call to the
10945 external library, and NEW_RETURN is set the tree for that function.
10946 FALSE is returned if processing for the _N variation is required, and
10947 NEW_RETURN is set to the the return value the result is copied into. */
10949 static bool
10952 {
10957 /* Size of 0 is an error condition. */
10959 {
10962 }
10964 /* If not a lock-free size, change to the library generic format. */
10966 {
10969 }
10971 /* Otherwise, there is a match, so the call needs to be transformed from:
10972 void fn(T* mem, T* value, model)
10973 into
10974 fn ((In *) mem, (In) *value, model) */
10979 /* Create pointer to appropriate size. */
10983 /* Convert object pointer to required type. */
10987 /* Convert new value to required type, and dereference it. */
10992 /* The memory model is in the right spot already. Return is void. */
10996 }
10999 /* Some builtin functions are placeholders for other expressions. This
11000 function should be called immediately after parsing the call expression
11001 before surrounding code has committed to the type of the expression.
11003 LOC is the location of the builtin call.
11005 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11006 PARAMS is the argument list for the call. The return value is non-null
11007 when expansion is complete, and null if normal processing should
11008 continue. */
11010 tree
11013 {
11019 {
11025 else
11029 }
11031 /* Handle BUILT_IN_NORMAL here. */
11033 {
11038 {
11039 /* Handle these 4 together so that they can fall through to the next
11040 case if the call is transformed to an _N variant. */
11042 {
11044 {
11048 /* Change to the _N variant. */
11051 }
11054 {
11056 params,
11059 /* Change to the _N variant. */
11062 }
11064 {
11068 /* Change to the _N variant. */
11071 }
11073 {
11077 /* Change to the _N variant. */
11080 }
11083 }
11084 /* Fallthrough to the normal processing. */
11085 }
11102 {
11104 /* Fallthru for parameter processing. */
11105 }
11122 {
11133 orig_format))
11138 NULL);
11146 /* If new_return is set, assign function to that expr and cast the
11147 result to void since the generic interface returned void. */
11149 {
11150 /* Cast function result from I{1,2,4,8,16} to the required type. */
11153 result);
11157 }
11159 }
11163 }
11164 }
11166 /* vector_types_compatible_elements_p is used in type checks of vectors
11167 values used as operands of binary operators. Where it returns true, and
11168 the other checks of the caller succeed (being vector types in he first
11169 place, and matching number of elements), we can just treat the types
11170 as essentially the same.
11171 Contrast with vector_targets_convertible_p, which is used for vector
11172 pointer types, and vector_types_convertible_p, which will allow
11173 language-specific matches under the control of flag_lax_vector_conversions,
11174 and might still require a conversion. */
11175 /* True if vector types T1 and T2 can be inputs to the same binary
11176 operator without conversion.
11177 We don't check the overall vector size here because some of our callers
11178 want to give different error messages when the vectors are compatible
11179 except for the element count. */
11181 bool
11183 {
11196 /* Equality works here because c_common_signed_type uses
11197 TYPE_MAIN_VARIANT. */
11205 }
11207 /* Check for missing format attributes on function pointers. LTYPE is
11208 the new type or left-hand side type. RTYPE is the old type or
11209 right-hand side type. Returns TRUE if LTYPE is missing the desired
11210 attribute. */
11212 bool
11214 {
11216 tree ra;
11222 {
11223 tree la;
11228 }
11229 else
11231 }
11233 /* Subscripting with type char is likely to lose on a machine where
11234 chars are signed. So warn on any machine, but optionally. Don't
11235 warn for unsigned char since that type is safe. Don't warn for
11236 signed char because anyone who uses that must have done so
11237 deliberately. Furthermore, we reduce the false positive load by
11238 warning only for non-constant value of type char. */
11240 void
11242 {
11246 }
11248 /* Implement -Wparentheses for the unexpected C precedence rules, to
11249 cover cases like x + y << z which readers are likely to
11250 misinterpret. We have seen an expression in which CODE is a binary
11251 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11252 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11253 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11254 expression was not formed using a binary or unary operator, or it
11255 was enclosed in parentheses. */
11257 void
11261 {
11265 /* This macro tests that the expression ARG with original tree code
11266 CODE appears to be a boolean expression. or the result of folding a
11267 boolean expression. */
11268 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11269 (truth_value_p (TREE_CODE (ARG)) \
11270 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11272 || ((CODE) != INTEGER_CST \
11273 && (integer_onep (ARG) || integer_zerop (ARG))))
11276 {
11325 /* Check cases like x|y==z */
11332 /* Check cases like !x | y */
11336 "suggest parentheses around operand of "
11349 /* Check cases like x^y==z */
11371 /* Check cases like x&y==z */
11378 /* Check cases like !x & y */
11382 "suggest parentheses around operand of "
11405 {
11410 "comparisons like %<X<=Y<=Z%> do not "
11416 "comparisons like %<X<=Y<=Z%> do not "
11418 }
11420 }
11421 #undef NOT_A_BOOLEAN_EXPR_P
11422 }
11424 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11426 void
11428 {
11430 {
11433 else
11435 }
11436 }
11438 /* Warn for division by zero according to the value of DIVISOR. LOC
11439 is the location of the division operator. */
11441 void
11443 {
11444 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11445 about division by zero. Do not issue a warning if DIVISOR has a
11446 floating-point type, since we consider 0.0/0.0 a valid way of
11447 generating a NaN. */
11451 }
11453 /* Subroutine of build_binary_op. Give warnings for comparisons
11454 between signed and unsigned quantities that may fail. Do the
11455 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11456 so that casts will be considered, but default promotions won't
11457 be.
11459 LOCATION is the location of the comparison operator.
11461 The arguments of this function map directly to local variables
11462 of build_binary_op. */
11464 void
11469 {
11474 /* In C++, check for comparison of different enum types. */
11480 {
11484 }
11486 /* Do not warn if the comparison is being done in a signed type,
11487 since the signed type will only be chosen if it can represent
11488 all the values of the unsigned type. */
11491 /* Do not warn if both operands are unsigned. */
11494 else
11495 {
11501 else
11509 /* Do not warn if the signed quantity is an unsuffixed integer
11510 literal (or some static constant expression involving such
11511 literals or a conditional expression involving such literals)
11512 and it is non-negative. */
11515 /* Do not warn if the comparison is an equality operation, the
11516 unsigned quantity is an integral constant, and it would fit
11517 in the result if the result were signed. */
11522 /* In C, do not warn if the unsigned quantity is an enumeration
11523 constant and its maximum value would fit in the result if the
11524 result were signed. */
11530 else
11532 OPT_Wsign_compare,
11534 }
11536 /* Warn if two unsigned values are being compared in a size larger
11537 than their original size, and one (and only one) is the result of
11538 a `~' operator. This comparison will always fail.
11540 Also warn if one operand is a constant, and the constant does not
11541 have all bits set that are set in the ~ operand when it is
11542 extended. */
11549 {
11556 {
11557 tree primop;
11563 {
11567 }
11568 else
11569 {
11573 }
11578 {
11581 {
11585 else
11588 }
11589 }
11590 }
11598 }
11599 }
11601 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11602 type via c_common_type. If -Wdouble-promotion is in use, and the
11603 conditions for warning have been met, issue a warning. GMSGID is
11604 the warning message. It must have two %T specifiers for the type
11605 that was converted (generally "float") and the type to which it was
11606 converted (generally "double), respectively. LOC is the location
11607 to which the awrning should refer. */
11609 void
11612 {
11613 tree source_type;
11617 /* If the conversion will not occur at run-time, there is no need to
11618 warn about it. */
11630 else
11633 }
11635 /* Setup a TYPE_DECL node as a typedef representation.
11637 X is a TYPE_DECL for a typedef statement. Create a brand new
11638 ..._TYPE node (which will be just a variant of the existing
11639 ..._TYPE node with identical properties) and then install X
11640 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11642 The whole point here is to end up with a situation where each
11643 and every ..._TYPE node the compiler creates will be uniquely
11644 associated with AT MOST one node representing a typedef name.
11645 This way, even though the compiler substitutes corresponding
11646 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11647 early on, later parts of the compiler can always do the reverse
11648 translation and get back the corresponding typedef name. For
11649 example, given:
11651 typedef struct S MY_TYPE;
11652 MY_TYPE object;
11654 Later parts of the compiler might only know that `object' was of
11655 type `struct S' if it were not for code just below. With this
11656 code however, later parts of the compiler see something like:
11658 struct S' == struct S
11659 typedef struct S' MY_TYPE;
11660 struct S' object;
11662 And they can then deduce (from the node for type struct S') that
11663 the original object declaration was:
11665 MY_TYPE object;
11667 Being able to do this is important for proper support of protoize,
11668 and also for generating precise symbolic debugging information
11669 which takes full account of the programmer's (typedef) vocabulary.
11671 Obviously, we don't want to generate a duplicate ..._TYPE node if
11672 the TYPE_DECL node that we are now processing really represents a
11673 standard built-in type. */
11675 void
11677 {
11681 {
11684 }
11687 {
11695 }
11696 }
11698 /* Record the types used by the current global variable declaration
11699 being parsed, so that we can decide later to emit their debug info.
11700 Those types are in types_used_by_cur_var_decl, and we are going to
11701 store them in the types_used_by_vars_hash hash table.
11702 DECL is the declaration of the global variable that has been parsed. */
11704 void
11706 {
11710 {
11713 }
11714 }
11716 /* If DECL is a typedef that is declared in the current function,
11717 record it for the purpose of -Wunused-local-typedefs. */
11719 void
11721 {
11726 /* if this is not a locally defined typedef then we are not
11727 interested. */
11734 }
11736 /* If T is a TYPE_DECL declared locally, mark it as used. */
11738 void
11740 {
11745 }
11747 /* Warn if there are some unused locally defined typedefs in the
11748 current function. */
11750 void
11752 {
11754 tree decl;
11755 /* The number of times we have emitted -Wunused-local-typedefs
11756 warnings. If this is different from errorcount, that means some
11757 unrelated errors have been issued. In which case, we'll avoid
11758 emitting "unused-local-typedefs" warnings. */
11770 {
11774 OPT_Wunused_local_typedefs,
11777 }
11780 }
11782 /* Warn about boolean expression compared with an integer value different
11783 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11784 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11785 are the operands of the comparison. The caller must ensure that
11786 either operand is a boolean expression. */
11788 void
11790 tree op1)
11791 {
11801 {
11809 else
11812 }
11813 }
11815 /* The C and C++ parsers both use vectors to hold function arguments.
11816 For efficiency, we keep a cache of unused vectors. This is the
11817 cache. */
11822 /* Return a new vector from the cache. If the cache is empty,
11823 allocate a new vector. These vectors are GC'ed, so it is OK if the
11824 pointer is not released.. */
11828 {
11831 else
11832 {
11833 /* Passing 0 to vec::alloc returns NULL, and our callers require
11834 that we always return a non-NULL value. The vector code uses
11835 4 when growing a NULL vector, so we do too. */
11839 }
11840 }
11842 /* Release a vector of trees back to the cache. */
11844 void
11846 {
11848 {
11851 }
11852 }
11854 /* Get a new tree vector holding a single tree. */
11858 {
11862 }
11864 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11868 {
11873 }
11875 /* Get a new tree vector which is a copy of an existing one. */
11879 {
11882 tree t;
11889 }
11891 /* Return true if KEYWORD starts a type specifier. */
11893 bool
11895 {
11897 {
11931 }
11932 }
11934 /* Return true if KEYWORD names a type qualifier. */
11936 bool
11938 {
11940 {
11948 }
11949 }
11951 /* Return true if KEYWORD names a storage class specifier.
11953 RID_TYPEDEF is not included in this list despite `typedef' being
11954 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11955 such for syntactic convenience only. */
11957 bool
11959 {
11961 {
11971 }
11972 }
11974 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11976 static bool
11978 {
11980 {
11988 }
11989 }
11991 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11992 declaration-specifier (C99 6.7). */
11994 bool
11996 {
12003 {
12010 }
12011 }
12013 /* Initialize language-specific-bits of tree_contains_struct. */
12015 void
12017 {
12021 }
12023 /* Build a user-defined numeric literal out of an integer constant type VALUE
12024 with identifier SUFFIX. */
12026 tree
12029 {
12036 }
12038 /* For vector[index], convert the vector to a
12039 pointer of the underlying type. Return true if the resulting
12040 ARRAY_REF should not be an lvalue. */
12042 bool
12045 {
12048 {
12050 tree type1;
12059 {
12064 {
12067 *vecp
12070 non_const);
12071 }
12072 else
12077 }
12078 else
12085 {
12086 /* If the original vector isn't declared may_alias and it
12087 isn't a bare vector look if the subscripting would
12088 alias the vector we subscript, and if not, force ref-all. */
12094 }
12098 }
12100 }
12102 /* Determine which of the operands, if any, is a scalar that needs to be
12103 converted to a vector, for the range of operations. */
12104 enum stv_conv
12107 {
12116 {
12117 /* Most GENERIC binary expressions require homogeneous arguments.
12118 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12119 argument that is a vector and a second one that is a scalar, so
12120 we never return stv_secondarg for them. */
12125 {
12127 {
12132 }
12133 else
12135 }
12142 /* ... fall through ... */
12163 /* What about UNLT_EXPR? */
12165 {
12166 tree tmp;
12168 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12171 }
12175 {
12177 {
12182 }
12184 }
12186 /* Allow integer --> real conversion if safe. */
12190 {
12192 {
12197 }
12199 }
12202 }
12205 }
12207 /* Return true iff ALIGN is an integral constant that is a fundamental
12208 alignment, as defined by [basic.align] in the c++-11
12209 specifications.
12211 That is:
12213 [A fundamental alignment is represented by an alignment less than or
12214 equal to the greatest alignment supported by the implementation
12215 in all contexts, which is equal to
12216 alignof(max_align_t)]. */
12218 bool
12220 {
12223 }
12225 /* Return true if T is a pointer to a zero-sized aggregate. */
12227 bool
12229 {
12234 }