| blob | 64f1edba5604569ab238f411d9a7801ae4de4479 |
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/>. */
66 /* The following symbols are subsumed in the c_global_trees array, and
67 listed here individually for documentation purposes.
69 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
71 tree short_integer_type_node;
72 tree long_integer_type_node;
73 tree long_long_integer_type_node;
75 tree short_unsigned_type_node;
76 tree long_unsigned_type_node;
77 tree long_long_unsigned_type_node;
79 tree truthvalue_type_node;
80 tree truthvalue_false_node;
81 tree truthvalue_true_node;
83 tree ptrdiff_type_node;
85 tree unsigned_char_type_node;
86 tree signed_char_type_node;
87 tree wchar_type_node;
89 tree char16_type_node;
90 tree char32_type_node;
92 tree float_type_node;
93 tree double_type_node;
94 tree long_double_type_node;
96 tree complex_integer_type_node;
97 tree complex_float_type_node;
98 tree complex_double_type_node;
99 tree complex_long_double_type_node;
101 tree dfloat32_type_node;
102 tree dfloat64_type_node;
103 tree_dfloat128_type_node;
105 tree intQI_type_node;
106 tree intHI_type_node;
107 tree intSI_type_node;
108 tree intDI_type_node;
109 tree intTI_type_node;
111 tree unsigned_intQI_type_node;
112 tree unsigned_intHI_type_node;
113 tree unsigned_intSI_type_node;
114 tree unsigned_intDI_type_node;
115 tree unsigned_intTI_type_node;
117 tree widest_integer_literal_type_node;
118 tree widest_unsigned_literal_type_node;
120 Nodes for types `void *' and `const void *'.
122 tree ptr_type_node, const_ptr_type_node;
124 Nodes for types `char *' and `const char *'.
126 tree string_type_node, const_string_type_node;
128 Type `char[SOMENUMBER]'.
129 Used when an array of char is needed and the size is irrelevant.
131 tree char_array_type_node;
133 Type `wchar_t[SOMENUMBER]' or something like it.
134 Used when a wide string literal is created.
136 tree wchar_array_type_node;
138 Type `char16_t[SOMENUMBER]' or something like it.
139 Used when a UTF-16 string literal is created.
141 tree char16_array_type_node;
143 Type `char32_t[SOMENUMBER]' or something like it.
144 Used when a UTF-32 string literal is created.
146 tree char32_array_type_node;
148 Type `int ()' -- used for implicit declaration of functions.
150 tree default_function_type;
152 A VOID_TYPE node, packaged in a TREE_LIST.
154 tree void_list_node;
156 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
157 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
158 VAR_DECLS, but C++ does.)
160 tree function_name_decl_node;
161 tree pretty_function_name_decl_node;
162 tree c99_function_name_decl_node;
164 Stack of nested function name VAR_DECLs.
166 tree saved_function_name_decls;
168 */
171 \f
172 /* Switches common to the C front ends. */
174 /* Nonzero means don't output line number information. */
178 /* Nonzero causes -E output not to be done, but directives such as
179 #define that have side effects are still obeyed. */
183 /* Nonzero means dump macros in some fashion. */
187 /* Nonzero means pass #include lines through to the output. */
191 /* Nonzero means process PCH files while preprocessing. */
195 /* The file name to which we should write a precompiled header, or
196 NULL if no header will be written in this compile. */
200 /* Nonzero if an ISO standard was selected. It rejects macros in the
201 user's namespace. */
204 /* C/ObjC language option variables. */
207 /* Nonzero means allow type mismatches in conditional expressions;
208 just make their values `void'. */
212 /* Nonzero means enable C89 Amendment 1 features. */
216 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
220 /* Nonzero means use the ISO C11 dialect of C. */
224 /* Nonzero means that we have builtin functions, and main is an int. */
229 /* ObjC language option variables. */
232 /* Tells the compiler that this is a special run. Do not perform any
233 compiling, instead we are to test some platform dependent features
234 and output a C header file with appropriate definitions. */
238 /* Tells the compiler what is the constant string class for ObjC. */
243 /* C++ language option variables. */
246 /* Nonzero means generate separate instantiation control files and
247 juggle them at link time. */
251 /* The C++ dialect being used. C++98 is the default. */
255 /* Maximum template instantiation depth. This limit exists to limit the
256 time it takes to notice excessively recursive template instantiations.
258 The default is lower than the 1024 recommended by the C++0x standard
259 because G++ runs out of stack before 1024 with highly recursive template
260 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
264 /* The elements of `ridpointers' are identifier nodes for the reserved
265 type names and storage classes. It is indexed by a RID_... value. */
270 /* Nonzero means don't warn about problems that occur when the code is
271 executed. */
274 /* Whether we are building a boolean conversion inside
275 convert_for_assignment, or some other late binary operation. If
276 build_binary_op is called for C (from code shared by C and C++) in
277 this case, then the operands have already been folded and the
278 result will not be folded again, so C_MAYBE_CONST_EXPR should not
279 be generated. */
282 /* Whether lexing has been completed, so subsequent preprocessor
283 errors should use the compiler's input_location. */
286 /* Information about how a function name is generated. */
287 struct fname_var_t
288 {
292 };
294 /* The three ways of getting then name of the current function. */
297 {
298 /* C99 compliant __func__, must be first. */
300 /* GCC __FUNCTION__ compliant. */
302 /* GCC __PRETTY_FUNCTION__ compliant. */
305 };
307 /* Global visibility options. */
401 /* Reserved words. The third field is a mask: keywords are disabled
402 if they match the mask.
404 Masks for languages:
405 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
406 C --std=c99: D_CXXONLY | D_OBJC
407 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
408 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
409 C++ --std=c0x: D_CONLY | D_OBJC
410 ObjC++ is like C++ except that D_OBJC is not set
412 If -fno-asm is used, D_ASM is added to the mask. If
413 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
414 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
415 In C with -Wc++-compat, we warn if D_CXXWARN is set.
417 Note the complication of the D_CXX_OBJC keywords. These are
418 reserved words such as 'class'. In C++, 'class' is a reserved
419 word. In Objective-C++ it is too. In Objective-C, it is a
420 reserved word too, but only if it follows an '@' sign.
421 */
423 {
586 /* These Objective-C keywords are recognized only immediately after
587 an '@'. */
604 /* These are recognized only in protocol-qualifier context
605 (see above) */
612 /* These are recognized inside a property attribute list */
621 };
626 /* Table of machine-independent attributes common to all C-like languages. */
628 {
629 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
630 affects_type_identity } */
637 /* FIXME: logically, noreturn attributes should be listed as
638 "false, true, true" and apply to function types. But implementing this
639 would require all the places in the compiler that use TREE_THIS_VOLATILE
640 on a decl to identify non-returning functions to be located and fixed
641 to check the function type instead. */
668 /* The same comments as for noreturn attributes apply to const ones. */
692 handle_no_instrument_function_attribute,
710 /* ??? These two attributes didn't make the transition from the
711 Intel language document to the multi-vendor language document. */
716 /* For internal use (marking of builtins) only. The name contains space
717 to prevent its usage in source code. */
739 /* For internal use (marking of builtins) only. The name contains space
740 to prevent its usage in source code. */
751 handle_no_address_safety_analysis_attribute,
754 handle_no_sanitize_address_attribute,
757 handle_no_sanitize_undefined_attribute,
767 /* For internal use only. The leading '*' both prevents its usage in
768 source code and signals that it may be overridden by machine tables. */
773 /* For internal use (marking of builtins and runtime functions) only.
774 The name contains space to prevent its usage in source code. */
794 };
796 /* Give the specifications for the format attributes, used by C and all
797 descendants. */
800 {
801 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
802 affects_type_identity } */
808 };
810 /* Return identifier for address space AS. */
814 {
818 }
820 /* Push current bindings for the function name VAR_DECLS. */
822 void
824 {
829 {
833 {
835 saved);
837 }
838 }
840 /* Normally they'll have been NULL, so only push if we've got a
841 stack, or they are non-NULL. */
843 saved_function_name_decls);
844 }
846 /* Finish up the current bindings, adding them into the current function's
847 statement tree. This must be done _before_ finish_stmt_tree is called.
848 If there is no current function, we must be at file scope and no statements
849 are involved. Pop the previous bindings. */
851 void
853 {
862 {
870 }
876 {
877 /* We had saved values, restore them. */
878 tree saved;
881 {
886 }
888 }
890 }
892 /* Return the text name of the current function, suitably prettified
893 by PRETTY_P. Return string must be freed by caller. */
897 {
904 {
907 }
920 {
923 }
926 }
928 /* Return the VAR_DECL for a const char array naming the current
929 function. If the VAR_DECL has not yet been created, create it
930 now. RID indicates how it should be formatted and IDENTIFIER_NODE
931 ID is its name (unfortunately C and C++ hold the RID values of
932 keywords in different places, so we can't derive RID from ID in
933 this language independent code. LOC is the location of the
934 function. */
936 tree
938 {
948 {
949 /* If a tree is built here, it would normally have the lineno of
950 the current statement. Later this tree will be moved to the
951 beginning of the function and this line number will be wrong.
952 To avoid this problem set the lineno to 0 here; that prevents
953 it from appearing in the RTL. */
954 tree stmts;
962 saved_function_name_decls
966 }
971 }
973 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
975 tree
977 {
982 /* Compute the number of elements, for the array type. */
984 {
987 }
989 {
992 }
994 {
997 }
998 else
999 {
1002 }
1004 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1005 limit in C++98 Annex B is very large (65536) and is not normative,
1006 so we do not diagnose it (warn_overlength_strings is forced off
1007 in c_common_post_options). */
1009 {
1013 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1014 separate the %d from the 'C'. 'ISO' should not be
1015 translated, but it may be moved after 'C%d' in languages
1016 where modifiers follow nouns. */
1018 "string length %qd is greater than the length %qd "
1021 }
1023 /* Create the array type for the string constant. The ISO C++
1024 standard says that a string literal has type `const char[N]' or
1025 `const wchar_t[N]'. We use the same logic when invoked as a C
1026 front-end with -Wwrite-strings.
1027 ??? We should change the type of an expression depending on the
1028 state of a warning flag. We should just be warning -- see how
1029 this is handled in the C++ front-end for the deprecated implicit
1030 conversion from string literals to `char*' or `wchar_t*'.
1032 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1033 array type being the unqualified version of that type.
1034 Therefore, if we are constructing an array of const char, we must
1035 construct the matching unqualified array type first. The C front
1036 end does not require this, but it does no harm, so we do it
1037 unconditionally. */
1048 }
1049 \f
1050 /* If DISABLE is true, stop issuing warnings. This is used when
1051 parsing code that we know will not be executed. This function may
1052 be called multiple times, and works as a stack. */
1054 static void
1056 {
1058 {
1061 }
1062 }
1064 /* If ENABLE is true, reenable issuing warnings. */
1066 static void
1068 {
1070 {
1073 }
1074 }
1076 /* Fully fold EXPR, an expression that was not folded (beyond integer
1077 constant expressions and null pointer constants) when being built
1078 up. If IN_INIT, this is in a static initializer and certain
1079 changes are made to the folding done. Clear *MAYBE_CONST if
1080 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1081 expression because it contains an evaluated operator (in C99) or an
1082 operator outside of sizeof returning an integer constant (in C90)
1083 not permitted in constant expressions, or because it contains an
1084 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1085 set to true by callers before calling this function.) Return the
1086 folded expression. Function arguments have already been folded
1087 before calling this function, as have the contents of SAVE_EXPR,
1088 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1089 C_MAYBE_CONST_EXPR. */
1091 tree
1093 {
1094 tree ret;
1100 /* This function is not relevant to C++ because C++ folds while
1101 parsing, and may need changes to be correct for C++ when C++
1102 stops folding while parsing. */
1109 {
1112 }
1119 }
1121 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1122 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1123 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1124 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1125 both evaluated and unevaluated subexpressions while
1126 *MAYBE_CONST_ITSELF is carried from only evaluated
1127 subexpressions). */
1129 static tree
1132 {
1144 /* This function is not relevant to C++ because C++ folds while
1145 parsing, and may need changes to be correct for C++ when C++
1146 stops folding while parsing. */
1150 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1151 anything else not counted as an expression cannot usefully be
1152 folded further at this point. */
1158 /* Operands of variable-length expressions (function calls) have
1159 already been folded, as have __builtin_* function calls, and such
1160 expressions cannot occur in constant expressions. */
1162 {
1166 }
1169 {
1178 else
1181 }
1183 /* Assignment, increment, decrement, function call and comma
1184 operators, and statement expressions, cannot occur in constant
1185 expressions if evaluated / outside of sizeof. (Function calls
1186 were handled above, though VA_ARG_EXPR is treated like a function
1187 call here, and statement expressions are handled through
1188 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1190 {
1210 }
1212 /* Fold individual tree codes as appropriate. */
1214 {
1216 /* Any non-constancy will have been marked in a containing
1217 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1225 maybe_const_itself);
1230 {
1233 }
1242 maybe_const_itself);
1245 maybe_const_itself);
1251 {
1255 }
1297 /* Binary operations evaluating both arguments (increment and
1298 decrement are binary internally in GCC). */
1302 maybe_const_itself);
1310 /* The RHS of a MODIFY_EXPR was fully folded when building that
1311 expression for the sake of conversion warnings. */
1314 maybe_const_itself);
1318 ret = in_init
1321 else
1334 {
1345 }
1351 CASE_CONVERT:
1362 /* Unary operations. */
1365 maybe_const_itself);
1369 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1370 not prepared to deal with them if they occur in initializers. */
1378 ret = in_init
1381 else
1386 {
1390 }
1392 {
1395 CASE_CONVERT:
1396 /* Don't warn about explicit conversions. We will already
1397 have warned about suspect implicit conversions. */
1404 }
1409 /* Binary operations not necessarily evaluating both
1410 arguments. */
1417 ? truthvalue_false_node
1425 ret = in_init
1428 else
1433 && op0_const
1434 && op0_const_self
1440 && op0_const_self
1466 else
1471 && op0_const
1472 && op0_const_self
1476 && op0_const_self
1480 && op0_const
1481 && op0_const_self
1485 && op0_const_self
1491 /* Each case where an operand with excess precision may be
1492 encountered must remove the EXCESS_PRECISION_EXPR around
1493 inner operands and possibly put one around the whole
1494 expression or possibly convert to the semantic type (which
1495 c_fully_fold does); we cannot tell at this stage which is
1496 appropriate in any particular case. */
1500 /* Various codes may appear through folding built-in functions
1501 and their arguments. */
1503 }
1505 out:
1506 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1507 have been done by this point, so remove them again. */
1511 {
1515 }
1519 }
1521 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1522 return EXP. Otherwise, return either EXP or its known constant
1523 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1524 Is the BLKmode test appropriate? */
1526 tree
1528 {
1529 tree ret;
1531 /* This function is only used by C, for c_fully_fold and other
1532 optimization, and may not be correct for C++. */
1543 /* Avoid unwanted tree sharing between the initializer and current
1544 function's body where the tree can be modified e.g. by the
1545 gimplifier. */
1549 }
1551 /* Print a warning if a constant expression had overflow in folding.
1552 Invoke this function on every expression that the language
1553 requires to be a constant expression.
1554 Note the ANSI C standard says it is erroneous for a
1555 constant expression to overflow. */
1557 void
1559 {
1567 }
1569 /* The same as above but print an unconditional error. */
1570 void
1572 {
1579 }
1581 /* Print a warning if an expression had overflow in folding and its
1582 operands hadn't.
1584 Invoke this function on every expression that
1585 (1) appears in the source code, and
1586 (2) is a constant expression that overflowed, and
1587 (3) is not already checked by convert_and_check;
1588 however, do not invoke this function on operands of explicit casts
1589 or when the expression is the result of an operator and any operand
1590 already overflowed. */
1592 void
1594 {
1599 {
1628 }
1629 }
1631 /* Warn about uses of logical || / && operator in a context where it
1632 is likely that the bitwise equivalent was intended by the
1633 programmer. We have seen an expression in which CODE is a binary
1634 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1635 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1636 void
1640 {
1652 /* Warn if &&/|| are being used in a context where it is
1653 likely that the bitwise equivalent was intended by the
1654 programmer. That is, an expression such as op && MASK
1655 where op should not be any boolean expression, nor a
1656 constant, and mask seems to be a non-boolean integer constant. */
1664 {
1668 else
1673 }
1675 /* We do not warn for constants because they are typical of macro
1676 expansions that test for features. */
1680 /* This warning only makes sense with logical operands. */
1687 /* The range computations only work with scalars. */
1692 /* We first test whether either side separately is trivially true
1693 (with OR) or trivially false (with AND). If so, do not warn.
1694 This is a common idiom for testing ranges of data types in
1695 portable code. */
1702 /* If this is an OR operation, invert both sides; now, the result
1703 should be always false to get a warning. */
1717 /* If this is an OR operation, invert both sides; now, the result
1718 should be always false to get a warning. */
1726 /* If both expressions have the same operand, if we can merge the
1727 ranges, and if the range test is always false, then warn. */
1734 {
1737 "logical %<or%> "
1739 else
1741 "logical %<and%> "
1743 }
1744 }
1746 /* Warn about logical not used on the left hand side operand of a comparison.
1747 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1748 Do not warn if RHS is of a boolean type. */
1750 void
1752 tree rhs)
1753 {
1760 "logical not is only applied to the left hand side of "
1762 }
1764 /* Warn if EXP contains any computations whose results are not used.
1765 Return true if a warning is printed; false otherwise. LOCUS is the
1766 (potential) location of the expression. */
1768 bool
1770 {
1771 restart:
1775 /* Don't warn about void constructs. This includes casting to void,
1776 void function calls, and statement expressions with a final cast
1777 to void. */
1785 {
1801 /* For a binding, warn if no side effect within it. */
1813 /* In && or ||, warn if 2nd operand has no side effect. */
1820 /* Let people do `(foo (), 0)' without a warning. */
1827 /* If this is an expression with side effects, don't warn; this
1828 case commonly appears in macro expansions. */
1834 /* Don't warn about automatic dereferencing of references, since
1835 the user cannot control it. */
1837 {
1840 }
1841 /* Fall through. */
1844 /* Referencing a volatile value is a side effect, so don't warn. */
1849 /* If this is an expression which has no operands, there is no value
1850 to be unused. There are no such language-independent codes,
1851 but front ends may define such. */
1855 warn:
1857 }
1858 }
1861 /* Print a warning about casts that might indicate violation
1862 of strict aliasing rules if -Wstrict-aliasing is used and
1863 strict aliasing mode is in effect. OTYPE is the original
1864 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1866 bool
1868 {
1869 /* Strip pointer conversion chains and get to the correct original type. */
1877 /* If the type we are casting to is a ref-all pointer
1878 dereferencing it is always valid. */
1885 {
1886 /* Casting the address of an object to non void pointer. Warn
1887 if the cast breaks type based aliasing. */
1889 {
1893 }
1894 else
1895 {
1896 /* warn_strict_aliasing >= 3. This includes the default (3).
1897 Only warn if the cast is dereferenced immediately. */
1898 alias_set_type set1 =
1904 {
1908 }
1911 {
1915 }
1916 }
1917 }
1918 else
1920 {
1921 /* At this level, warn for any conversions, even if an address is
1922 not taken in the same statement. This will likely produce many
1923 false positives, but could be useful to pinpoint problems that
1924 are not revealed at higher levels. */
1929 {
1933 }
1934 }
1937 }
1939 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1940 sizeof as last operand of certain builtins. */
1942 void
1946 {
1950 location_t loc;
1958 {
1962 /* FALLTHRU */
1970 /* FALLTHRU */
2029 }
2057 {
2061 {
2064 "argument to %<sizeof%> in %qD call is the same "
2065 "expression as the destination; did you mean to "
2071 "argument to %<sizeof%> in %qD call is the same "
2072 "expression as the destination; did you mean to "
2074 else
2076 "argument to %<sizeof%> in %qD call is the same "
2077 "expression as the destination; did you mean to "
2080 }
2083 && !strop
2086 {
2088 "argument to %<sizeof%> in %qD call is the same "
2089 "pointer type %qT as the destination; expected %qT "
2093 }
2094 }
2097 {
2101 {
2104 "argument to %<sizeof%> in %qD call is the same "
2105 "expression as the source; did you mean to "
2111 "argument to %<sizeof%> in %qD call is the same "
2112 "expression as the source; did you mean to "
2114 else
2116 "argument to %<sizeof%> in %qD call is the same "
2117 "expression as the source; did you mean to "
2120 }
2123 && !strop
2126 {
2128 "argument to %<sizeof%> in %qD call is the same "
2129 "pointer type %qT as the source; expected %qT "
2133 }
2134 }
2137 {
2141 {
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "expression as the first source; did you mean to "
2151 "argument to %<sizeof%> in %qD call is the same "
2152 "expression as the first source; did you mean to "
2154 else
2156 "argument to %<sizeof%> in %qD call is the same "
2157 "expression as the first source; did you mean to "
2160 }
2163 && !strop
2166 {
2168 "argument to %<sizeof%> in %qD call is the same "
2169 "pointer type %qT as the first source; expected %qT "
2173 }
2174 }
2177 {
2181 {
2184 "argument to %<sizeof%> in %qD call is the same "
2185 "expression as the second source; did you mean to "
2191 "argument to %<sizeof%> in %qD call is the same "
2192 "expression as the second source; did you mean to "
2194 else
2196 "argument to %<sizeof%> in %qD call is the same "
2197 "expression as the second source; did you mean to "
2200 }
2203 && !strop
2206 {
2208 "argument to %<sizeof%> in %qD call is the same "
2209 "pointer type %qT as the second source; expected %qT "
2213 }
2214 }
2216 }
2218 /* Warn for unlikely, improbable, or stupid DECL declarations
2219 of `main'. */
2221 void
2223 {
2224 function_args_iterator iter;
2225 tree type;
2229 {
2230 /* XXX void_type_node belies the abstraction. */
2240 {
2246 }
2250 {
2272 "third argument of %q+D should probably be "
2275 }
2276 }
2278 /* It is intentional that this message does not mention the third
2279 argument because it's only mentioned in an appendix of the
2280 standard. */
2288 }
2290 /* vector_targets_convertible_p is used for vector pointer types. The
2291 callers perform various checks that the qualifiers are satisfactory,
2292 while OTOH vector_targets_convertible_p ignores the number of elements
2293 in the vectors. That's fine with vector pointers as we can consider,
2294 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2295 and that does not require and conversion of the pointer values.
2296 In contrast, vector_types_convertible_p and
2297 vector_types_compatible_elements_p are used for vector value types. */
2298 /* True if pointers to distinct types T1 and T2 can be converted to
2299 each other without an explicit cast. Only returns true for opaque
2300 vector types. */
2301 bool
2303 {
2310 }
2312 /* vector_types_convertible_p is used for vector value types.
2313 It could in principle call vector_targets_convertible_p as a subroutine,
2314 but then the check for vector type would be duplicated with its callers,
2315 and also the purpose of vector_targets_convertible_p would become
2316 muddled.
2317 Where vector_types_convertible_p returns true, a conversion might still be
2318 needed to make the types match.
2319 In contrast, vector_targets_convertible_p is used for vector pointer
2320 values, and vector_types_compatible_elements_p is used specifically
2321 in the context for binary operators, as a check if use is possible without
2322 conversion. */
2323 /* True if vector types T1 and T2 can be converted to each other
2324 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2325 can only be converted with -flax-vector-conversions yet that is not
2326 in effect, emit a note telling the user about that option if such
2327 a note has not previously been emitted. */
2328 bool
2330 {
2338 convertible_lax =
2353 {
2356 "conversions between vectors with differing "
2358 }
2361 }
2363 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2364 and have vector types, V0 has the same type as V1, and the number of
2365 elements of V0, V1, MASK is the same.
2367 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2368 called with two arguments. In this case implementation passes the
2369 first argument twice in order to share the same tree code. This fact
2370 could enable the mask-values being twice the vector length. This is
2371 an implementation accident and this semantics is not guaranteed to
2372 the user. */
2373 tree
2376 {
2377 tree ret;
2383 {
2386 }
2394 {
2399 }
2403 {
2407 }
2410 {
2415 }
2421 {
2424 "argument vector(s) and the mask vector should "
2427 }
2431 {
2436 }
2439 {
2440 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2446 else
2447 {
2450 }
2454 }
2464 }
2466 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2467 to integral type. */
2469 static tree
2471 {
2476 {
2477 /* C++0x scoped enumerations don't implicitly convert to integral
2478 type; if we stripped an explicit conversion to a larger type we
2479 need to replace it so common_type will still work. */
2483 }
2485 }
2487 /* This is a helper function of build_binary_op.
2489 For certain operations if both args were extended from the same
2490 smaller type, do the arithmetic in that type and then extend.
2492 BITWISE indicates a bitwise operation.
2493 For them, this optimization is safe only if
2494 both args are zero-extended or both are sign-extended.
2495 Otherwise, we might change the result.
2496 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2497 but calculated in (unsigned short) it would be (unsigned short)-1.
2498 */
2499 tree
2501 {
2505 tree type;
2507 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2508 excessive narrowing when we call get_narrower below. For
2509 example, suppose that OP0 is of unsigned int extended
2510 from signed char and that RESULT_TYPE is long long int.
2511 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2512 like
2514 (long long int) (unsigned int) signed_char
2516 which get_narrower would narrow down to
2518 (unsigned int) signed char
2520 If we do not cast OP0 first, get_narrower would return
2521 signed_char, which is inconsistent with the case of the
2522 explicit cast. */
2529 /* UNS is 1 if the operation to be done is an unsigned one. */
2532 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2533 but it *requires* conversion to FINAL_TYPE. */
2544 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2546 /* For bitwise operations, signedness of nominal type
2547 does not matter. Consider only how operands were extended. */
2551 /* Note that in all three cases below we refrain from optimizing
2552 an unsigned operation on sign-extended args.
2553 That would not be valid. */
2555 /* Both args variable: if both extended in same way
2556 from same width, do it in that width.
2557 Do it unsigned if args were zero-extended. */
2564 return c_common_signed_or_unsigned_type
2571 && (type
2582 && (type
2590 }
2592 /* Checks if expression EXPR of real/integer type cannot be converted
2593 to the real/integer type TYPE. Function returns non-zero when:
2594 * EXPR is a constant which cannot be exactly converted to TYPE.
2595 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2596 for EXPR type and TYPE being both integers or both real.
2597 * EXPR is not a constant of real type and TYPE is an integer.
2598 * EXPR is not a constant of integer type which cannot be
2599 exactly converted to real type.
2600 Function allows conversions between types of different signedness and
2601 can return SAFE_CONVERSION (zero) in that case. Function can produce
2602 signedness warnings if PRODUCE_WARNS is true. */
2604 enum conversion_safety
2606 {
2612 {
2613 /* Warn for real constant that is not an exact integer converted
2614 to integer type. */
2617 {
2620 }
2621 /* Warn for an integer constant that does not fit into integer type. */
2625 {
2628 {
2632 }
2634 {
2638 }
2639 else
2641 }
2643 {
2644 /* Warn for an integer constant that does not fit into real type. */
2646 {
2650 }
2651 /* Warn for a real constant that does not fit into a smaller
2652 real type. */
2655 {
2659 }
2660 }
2661 }
2662 else
2663 {
2664 /* Warn for real types converted to integer types. */
2671 {
2672 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2676 /* Don't warn for short y; short x = ((int)y & 0xff); */
2680 {
2681 /* If both args were extended from a shortest type,
2682 use that type if that is safe. */
2689 {
2695 /* If one of the operands is a non-negative constant
2696 that fits in the target type, then the type of the
2697 other operand does not matter. */
2706 /* If constant is unsigned and fits in the target
2707 type, then the result will also fit. */
2709 && unsigned0
2712 && unsigned1
2715 }
2716 }
2717 /* Warn for integer types converted to smaller integer types. */
2721 /* When they are the same width but different signedness,
2722 then the value may change. */
2725 /* Even when converted to a bigger type, if the type is
2726 unsigned but expr is signed, then negative values
2727 will be changed. */
2733 }
2735 /* Warn for integer types converted to real types if and only if
2736 all the range of values of the integer type cannot be
2737 represented by the real type. */
2740 {
2744 /* Don't warn about char y = 0xff; float x = (int) y; */
2756 }
2758 /* Warn for real types converted to smaller real types. */
2763 }
2766 }
2768 /* Warns if the conversion of EXPR to TYPE may alter a value.
2769 This is a helper function for warnings_for_convert_and_check. */
2771 static void
2773 {
2780 /* This may happen, because for LHS op= RHS we preevaluate
2781 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2782 means we could no longer see the code of the EXPR. */
2789 {
2802 /* Conversion from boolean to a signed:1 bit-field (which only
2803 can hold the values 0 and -1) doesn't lose information - but
2804 it does change the value. */
2824 {
2825 /* In case of COND_EXPR, we do not care about the type of
2826 COND_EXPR, only about the conversion of each operand. */
2833 }
2845 }
2846 }
2848 /* Produce warnings after a conversion. RESULT is the result of
2849 converting EXPR to TYPE. This is a helper function for
2850 convert_and_check and cp_convert_and_check. */
2852 void
2854 tree result)
2855 {
2862 {
2863 /* Do not diagnose overflow in a constant expression merely
2864 because a conversion overflowed. */
2869 {
2870 /* This detects cases like converting -129 or 256 to
2871 unsigned char. */
2875 else
2877 }
2881 /* No warning for converting 0x80000000 to int. */
2889 else
2891 }
2896 else
2898 }
2901 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2902 Invoke this function on every expression that is converted implicitly,
2903 i.e. because of language rules and not because of an explicit cast. */
2905 tree
2907 {
2908 tree result;
2909 tree expr_for_warning;
2911 /* Convert from a value with possible excess precision rather than
2912 via the semantic type, but do not warn about values not fitting
2913 exactly in the semantic type. */
2915 {
2921 }
2922 else
2936 }
2937 \f
2938 /* A node in a list that describes references to variables (EXPR), which are
2939 either read accesses if WRITER is zero, or write accesses, in which case
2940 WRITER is the parent of EXPR. */
2941 struct tlist
2942 {
2945 };
2947 /* Used to implement a cache the results of a call to verify_tree. We only
2948 use this for SAVE_EXPRs. */
2949 struct tlist_cache
2950 {
2954 tree expr;
2955 };
2957 /* Obstack to use when allocating tlist structures, and corresponding
2958 firstobj. */
2962 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2963 warnings. */
2965 /* SAVE_EXPRs need special treatment. We process them only once and then
2966 cache the results. */
2978 /* Create a new struct tlist and fill in its fields. */
2981 {
2988 }
2990 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2991 is nonnull, we ignore any node we find which has a writer equal to it. */
2993 static void
2995 {
2997 {
3004 }
3005 }
3007 /* Merge the nodes of ADD into TO. This merging process is done so that for
3008 each variable that already exists in TO, no new node is added; however if
3009 there is a write access recorded in ADD, and an occurrence on TO is only
3010 a read access, then the occurrence in TO will be modified to record the
3011 write. */
3013 static void
3015 {
3022 {
3029 {
3033 }
3035 {
3039 }
3041 }
3042 }
3044 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3045 references in list LIST conflict with it, excluding reads if ONLY writers
3046 is nonzero. */
3048 static void
3051 {
3054 /* Avoid duplicate warnings. */
3060 {
3064 {
3069 }
3071 }
3072 }
3074 /* Given a list LIST of references to variables, find whether any of these
3075 can cause conflicts due to missing sequence points. */
3077 static void
3079 {
3083 {
3086 }
3087 }
3089 /* Return nonzero if X is a tree that can be verified by the sequence point
3090 warnings. */
3091 static int
3093 {
3100 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3101 (lvalue_p) crash on TRY/CATCH. */
3108 /* No point to track non-const calls, they will never satisfy
3109 operand_equal_p. */
3117 }
3119 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3120 static bool
3122 {
3124 }
3126 /* Walk the tree X, and record accesses to variables. If X is written by the
3127 parent tree, WRITER is the parent.
3128 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3129 expression or its only operand forces a sequence point, then everything up
3130 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3131 in PNO_SP.
3132 Once we return, we will have emitted warnings if any subexpression before
3133 such a sequence point could be undefined. On a higher level, however, the
3134 sequence point may not be relevant, and we'll merge the two lists.
3136 Example: (b++, a) + b;
3137 The call that processes the COMPOUND_EXPR will store the increment of B
3138 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3139 processes the PLUS_EXPR will need to merge the two lists so that
3140 eventually, all accesses end up on the same list (and we'll warn about the
3141 unordered subexpressions b++ and b.
3143 A note on merging. If we modify the former example so that our expression
3144 becomes
3145 (b++, b) + a
3146 care must be taken not simply to add all three expressions into the final
3147 PNO_SP list. The function merge_tlist takes care of that by merging the
3148 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3149 way, so that no more than one access to B is recorded. */
3151 static void
3153 tree writer)
3154 {
3159 /* X may be NULL if it is the operand of an empty statement expression
3160 ({ }). */
3164 restart:
3172 {
3205 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3206 two first, to avoid warning for (a ? b++ : b++). */
3222 /* Expressions inside the LHS are not ordered wrt. the sequence points
3223 in the RHS. Example:
3224 *a = (a++, 2)
3225 Despite the fact that the modification of "a" is in the before_sp
3226 list (tmp_before), it conflicts with the use of "a" in the LHS.
3227 We can handle this by adding the contents of tmp_list3
3228 to those of tmp_before, and redoing the collision warnings for that
3229 list. */
3232 /* Exclude the LHS itself here; we first have to merge it into the
3233 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3234 didn't exclude the LHS, we'd get it twice, once as a read and once
3235 as a write. */
3246 /* We need to warn about conflicts among arguments and conflicts between
3247 args and the function address. Side effects of the function address,
3248 however, are not ordered by the sequence point of the call. */
3249 {
3250 call_expr_arg_iterator iter;
3251 tree arg;
3255 {
3260 }
3265 }
3268 /* Scan all the list, e.g. indices of multi dimensional array. */
3270 {
3276 }
3280 {
3287 {
3301 }
3305 }
3315 /* For other expressions, simply recurse on their operands.
3316 Manual tail recursion for unary expressions.
3317 Other non-expressions need not be processed. */
3319 {
3323 }
3325 {
3329 {
3334 }
3335 }
3337 }
3338 }
3340 /* Try to warn for undefined behavior in EXPR due to missing sequence
3341 points. */
3343 DEBUG_FUNCTION void
3345 {
3351 {
3354 }
3359 }
3360 \f
3361 /* Validate the expression after `case' and apply default promotions. */
3363 static tree
3365 {
3370 /* Promote char or short to int. */
3373 {
3376 }
3381 }
3382 \f
3383 /* See if the case values LOW and HIGH are in the range of the original
3384 type (i.e. before the default conversion to int) of the switch testing
3385 expression.
3386 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3387 the type before promoting it. CASE_LOW_P is a pointer to the lower
3388 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3389 if the case is not a case range.
3390 The caller has to make sure that we are not called with NULL for
3391 CASE_LOW_P (i.e. the default case).
3392 Returns true if the case label is in range of ORIG_TYPE (saturated or
3393 untouched) or false if the label is out of range. */
3395 static bool
3398 {
3403 /* If there was a problem with the original type, do nothing. */
3410 /* Case label is less than minimum for type. */
3413 {
3417 }
3419 /* Case value is greater than maximum for type. */
3422 {
3425 }
3427 /* Saturate lower case label value to minimum. */
3430 {
3434 }
3436 /* Saturate upper case label value to maximum. */
3439 {
3443 }
3451 }
3452 \f
3453 /* Return an integer type with BITS bits of precision,
3454 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3456 tree
3458 {
3500 }
3502 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3503 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3504 and saturating if SATP is nonzero, otherwise not saturating. */
3506 tree
3509 {
3510 machine_mode mode;
3513 else
3521 {
3523 "fixed-point types that have too many integral and "
3526 }
3529 }
3531 /* Used for communication between c_common_type_for_mode and
3532 c_register_builtin_type. */
3533 tree registered_builtin_types;
3535 /* Return a data type that has machine mode MODE.
3536 If the mode is an integer,
3537 then UNSIGNEDP selects between signed and unsigned types.
3538 If the mode is a fixed-point mode,
3539 then UNSIGNEDP selects between saturating and nonsaturating types. */
3541 tree
3543 {
3544 tree t;
3584 #if HOST_BITS_PER_WIDE_INT >= 64
3587 #endif
3612 {
3613 machine_mode inner_mode;
3614 tree inner_type;
3630 }
3632 {
3637 }
3647 {
3733 }
3741 }
3743 tree
3745 {
3747 }
3749 /* Return a signed type the same as TYPE in other respects. */
3751 tree
3753 {
3755 }
3757 /* Return a type the same as TYPE except unsigned or
3758 signed according to UNSIGNEDP. */
3760 tree
3762 {
3763 tree type1;
3766 /* This block of code emulates the behavior of the old
3767 c_common_unsigned_type. In particular, it returns
3768 long_unsigned_type_node if passed a long, even when a int would
3769 have the same size. This is necessary for warnings to work
3770 correctly in archs where sizeof(int) == sizeof(long) */
3773 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3793 #if HOST_BITS_PER_WIDE_INT >= 64
3796 #endif
3806 #define C_COMMON_FIXED_TYPES(NAME) \
3807 if (type1 == short_ ## NAME ## _type_node \
3808 || type1 == unsigned_short_ ## NAME ## _type_node) \
3809 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3810 : short_ ## NAME ## _type_node; \
3811 if (type1 == NAME ## _type_node \
3812 || type1 == unsigned_ ## NAME ## _type_node) \
3813 return unsignedp ? unsigned_ ## NAME ## _type_node \
3814 : NAME ## _type_node; \
3815 if (type1 == long_ ## NAME ## _type_node \
3816 || type1 == unsigned_long_ ## NAME ## _type_node) \
3817 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3818 : long_ ## NAME ## _type_node; \
3819 if (type1 == long_long_ ## NAME ## _type_node \
3820 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3821 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3822 : long_long_ ## NAME ## _type_node;
3824 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3825 if (type1 == NAME ## _type_node \
3826 || type1 == u ## NAME ## _type_node) \
3827 return unsignedp ? u ## NAME ## _type_node \
3828 : NAME ## _type_node;
3830 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3831 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3832 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3833 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3834 : sat_ ## short_ ## NAME ## _type_node; \
3835 if (type1 == sat_ ## NAME ## _type_node \
3836 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3837 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3838 : sat_ ## NAME ## _type_node; \
3839 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3840 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3841 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3842 : sat_ ## long_ ## NAME ## _type_node; \
3843 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3844 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3845 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3846 : sat_ ## long_long_ ## NAME ## _type_node;
3848 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3849 if (type1 == sat_ ## NAME ## _type_node \
3850 || type1 == sat_ ## u ## NAME ## _type_node) \
3851 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3852 : sat_ ## NAME ## _type_node;
3878 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3879 the precision; they have precision set to match their range, but
3880 may use a wider mode to match an ABI. If we change modes, we may
3881 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3882 the precision as well, so as to yield correct results for
3883 bit-field types. C++ does not have these separate bit-field
3884 types, and producing a signed or unsigned variant of an
3885 ENUMERAL_TYPE may cause other problems as well. */
3891 #define TYPE_OK(node) \
3892 (TYPE_MODE (type) == TYPE_MODE (node) \
3893 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3917 #if HOST_BITS_PER_WIDE_INT >= 64
3920 #endif
3929 #undef TYPE_OK
3932 }
3934 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3936 tree
3938 {
3941 /* Extended integer types of the same width as a standard type have
3942 lesser rank, so those of the same width as int promote to int or
3943 unsigned int and are valid for printf formats expecting int or
3944 unsigned int. To avoid such special cases, avoid creating
3945 extended integer types for bit-fields if a standard integer type
3946 is available. */
3964 }
3966 /* The C version of the register_builtin_type langhook. */
3968 void
3970 {
3971 tree decl;
3981 }
3982 \f
3983 /* Print an error message for invalid operands to arith operation
3984 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3985 LOCATION is the location of the message. */
3987 void
3990 {
3994 {
4039 }
4043 }
4044 \f
4045 /* Given an expression as a tree, return its original type. Do this
4046 by stripping any conversion that preserves the sign and precision. */
4047 static tree
4049 {
4052 }
4054 /* Subroutine of build_binary_op, used for comparison operations.
4055 See if the operands have both been converted from subword integer types
4056 and, if so, perhaps change them both back to their original type.
4057 This function is also responsible for converting the two operands
4058 to the proper common type for comparison.
4060 The arguments of this function are all pointers to local variables
4061 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4062 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4064 LOC is the location of the comparison.
4066 If this function returns nonzero, it means that the comparison has
4067 a constant value. What this function returns is an expression for
4068 that value. */
4070 tree
4073 {
4074 tree type;
4082 /* Throw away any conversions to wider types
4083 already present in the operands. */
4088 /* If primopN is first sign-extended from primopN's precision to opN's
4089 precision, then zero-extended from opN's precision to
4090 *restype_ptr precision, shortenings might be invalid. */
4093 && !unsignedp0
4098 && !unsignedp1
4102 /* Handle the case that OP0 does not *contain* a conversion
4103 but it *requires* conversion to FINAL_TYPE. */
4110 /* If one of the operands must be floated, we cannot optimize. */
4114 /* If first arg is constant, swap the args (changing operation
4115 so value is preserved), for canonicalization. Don't do this if
4116 the second arg is 0. */
4121 {
4138 {
4153 }
4155 }
4157 /* If comparing an integer against a constant more bits wide,
4158 maybe we can deduce a value of 1 or 0 independent of the data.
4159 Or else truncate the constant now
4160 rather than extend the variable at run time.
4162 This is only interesting if the constant is the wider arg.
4163 Also, it is not safe if the constant is unsigned and the
4164 variable arg is signed, since in this case the variable
4165 would be sign-extended and then regarded as unsigned.
4166 Our technique fails in this case because the lowest/highest
4167 possible unsigned results don't follow naturally from the
4168 lowest/highest possible values of the variable operand.
4169 For just EQ_EXPR and NE_EXPR there is another technique that
4170 could be used: see if the constant can be faithfully represented
4171 in the other operand's type, by truncating it and reextending it
4172 and see if that preserves the constant's value. */
4178 {
4181 /* 1 if comparison is nominally unsigned. */
4183 tree val;
4195 {
4196 /* Convert primop1 to target type, but do not introduce
4197 additional overflow. We know primop1 is an int_cst. */
4204 }
4206 {
4209 }
4217 /* This used to be a switch, but Genix compiler can't handle that. */
4219 {
4222 }
4224 {
4227 }
4229 {
4234 }
4236 {
4241 }
4243 {
4248 }
4250 {
4255 }
4257 /* If primop0 was sign-extended and unsigned comparison specd,
4258 we did a signed comparison above using the signed type bounds.
4259 But the comparison we output must be unsigned.
4261 Also, for inequalities, VAL is no good; but if the signed
4262 comparison had *any* fixed result, it follows that the
4263 unsigned comparison just tests the sign in reverse
4264 (positive values are LE, negative ones GE).
4265 So we can generate an unsigned comparison
4266 against an extreme value of the signed type. */
4269 {
4272 {
4287 }
4289 }
4292 {
4299 }
4302 {
4303 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4307 }
4309 /* Value is not predetermined, but do the comparison
4310 in the type of the operand that is not constant.
4311 TYPE is already properly set. */
4312 }
4314 /* If either arg is decimal float and the other is float, find the
4315 proper common type to use for comparison. */
4326 /* If args' natural types are both narrower than nominal type
4327 and both extend in the same manner, compare them
4328 in the type of the wider arg.
4329 Otherwise must actually extend both to the nominal
4330 common type lest different ways of extending
4331 alter the result.
4332 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4337 {
4341 type);
4342 /* Make sure shorter operand is extended the right way
4343 to match the longer operand. */
4344 primop0
4347 primop0);
4348 primop1
4351 primop1);
4352 }
4353 else
4354 {
4355 /* Here we must do the comparison on the nominal type
4356 using the args exactly as we received them. */
4363 {
4365 /* All unsigned values are >= 0, so we warn. However,
4366 if OP0 is a constant that is >= 0, the signedness of
4367 the comparison isn't an issue, so suppress the
4368 warning. */
4373 primop0)))
4374 /* Do not warn for enumeration types. */
4378 {
4395 }
4398 {
4399 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4404 }
4405 }
4406 }
4414 }
4415 \f
4416 /* Return a tree for the sum or difference (RESULTCODE says which)
4417 of pointer PTROP and integer INTOP. */
4419 tree
4422 {
4425 /* The result is a pointer of the same type that is being added. */
4429 {
4436 }
4438 {
4445 }
4446 else
4449 /* We are manipulating pointer values, so we don't need to warn
4450 about relying on undefined signed overflow. We disable the
4451 warning here because we use integer types so fold won't know that
4452 they are really pointers. */
4455 /* If what we are about to multiply by the size of the elements
4456 contains a constant term, apply distributive law
4457 and multiply that constant term separately.
4458 This helps produce common subexpressions. */
4463 /* If the constant comes from pointer subtraction,
4464 skip this optimization--it would cause an error. */
4466 /* If the constant is unsigned, and smaller than the pointer size,
4467 then we must skip this optimization. This is because it could cause
4468 an overflow error if the constant is negative but INTOP is not. */
4472 {
4477 /* Convert both subexpression types to the type of intop,
4478 because weird cases involving pointer arithmetic
4479 can result in a sum or difference with different type args. */
4484 }
4486 /* Convert the integer argument to a type the same size as sizetype
4487 so the multiply won't overflow spuriously. */
4493 /* Replace the integer argument with a suitable product by the object size.
4494 Do this multiplication as signed, then convert to the appropriate type
4495 for the pointer operation and disregard an overflow that occurred only
4496 because of the sign-extension change in the latter conversion. */
4497 {
4504 }
4506 /* Create the sum or difference. */
4515 }
4516 \f
4517 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4518 and if NON_CONST is known not to be permitted in an evaluated part
4519 of a constant expression. */
4521 tree
4523 {
4527 /* This should never be called for C++. */
4531 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4540 }
4542 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4543 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4544 around the SAVE_EXPR if needed so that c_fully_fold does not need
4545 to look inside SAVE_EXPRs. */
4547 tree
4549 {
4558 }
4560 /* Return whether EXPR is a declaration whose address can never be
4561 NULL. */
4563 bool
4565 {
4570 }
4572 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4573 or for an `if' or `while' statement or ?..: exp. It should already
4574 have been validated to be of suitable type; otherwise, a bad
4575 diagnostic may result.
4577 The EXPR is located at LOCATION.
4579 This preparation consists of taking the ordinary
4580 representation of an expression expr and producing a valid tree
4581 boolean expression describing whether expr is nonzero. We could
4582 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4583 but we optimize comparisons, &&, ||, and !.
4585 The resulting type should always be `truthvalue_type_node'. */
4587 tree
4589 {
4591 {
4633 ? truthvalue_true_node
4639 ? truthvalue_true_node
4644 /* Fall through. */
4647 {
4650 {
4651 /* Common Ada/Pascal programmer's mistake. */
4653 OPT_Waddress,
4655 inner);
4657 }
4659 }
4676 /* These don't change whether an object is nonzero or zero. */
4681 /* These don't change whether an object is zero or nonzero, but
4682 we can't ignore them if their second arg has side-effects. */
4684 {
4687 c_common_truthvalue_conversion
4690 }
4691 else
4696 /* Distribute the conversion into the arms of a COND_EXPR. */
4698 {
4701 /* In C++ one of the arms might have void type if it is throw. */
4709 }
4710 else
4711 {
4712 /* Folding will happen later for C. */
4720 }
4722 CASE_CONVERT:
4723 {
4727 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4728 since that affects how `default_conversion' will behave. */
4732 /* Don't strip a conversion from C++0x scoped enum, since they
4733 don't implicitly convert to other types. */
4737 /* If this isn't narrowing the argument, we can ignore it. */
4741 }
4747 {
4751 }
4756 }
4759 {
4761 expr = (build_binary_op
4765 c_common_truthvalue_conversion
4768 c_common_truthvalue_conversion
4773 }
4776 {
4781 }
4782 else
4785 ret:
4788 }
4789 \f
4798 /* Apply the TYPE_QUALS to the new DECL. */
4800 void
4802 {
4810 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4811 constructor can produce constant init, so rely on cp_finish_decl to
4812 clear TREE_READONLY if the variable has non-constant init. */
4815 {
4818 }
4820 {
4822 /* Allow 'restrict' on arrays of pointers.
4823 FIXME currently we just ignore it. */
4829 }
4830 }
4833 {
4836 };
4838 /* Hash function for the problem of multiple type definitions in
4839 different files. This must hash all types that will compare
4840 equal via comptypes to the same value. In practice it hashes
4841 on some of the simple stuff and leaves the details to comptypes. */
4843 hashval_t
4845 {
4848 tree t2;
4850 {
4851 /* For pointers, hash on pointee type plus some swizzling. */
4854 /* Hash on number of elements and total size. */
4873 }
4874 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4875 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4877 /* We might have a VLA here. */
4880 else
4883 }
4885 bool
4887 {
4889 }
4893 /* Return the typed-based alias set for T, which may be an expression
4894 or a type. Return -1 if we don't do anything special. */
4896 alias_set_type
4898 {
4899 tree u;
4901 /* For VLAs, use the alias set of the element type rather than the
4902 default of alias set 0 for types compared structurally. */
4904 {
4908 }
4910 /* Permit type-punning when accessing a union, provided the access
4911 is directly through the union. For example, this code does not
4912 permit taking the address of a union member and then storing
4913 through it. Even the type-punning allowed here is a GCC
4914 extension, albeit a common and useful one; the C standard says
4915 that such accesses have implementation-defined behavior. */
4923 /* That's all the expressions we handle specially. */
4927 /* The C standard guarantees that any object may be accessed via an
4928 lvalue that has character type. */
4934 /* The C standard specifically allows aliasing between signed and
4935 unsigned variants of the same type. We treat the signed
4936 variant as canonical. */
4938 {
4941 /* t1 == t can happen for boolean nodes which are always unsigned. */
4944 }
4946 /* Handle the case of multiple type nodes referring to "the same" type,
4947 which occurs with IMA. These share an alias set. FIXME: Currently only
4948 C90 is handled. (In C99 type compatibility is not transitive, which
4949 complicates things mightily. The alias set splay trees can theoretically
4950 represent this, but insertion is tricky when you consider all the
4951 different orders things might arrive in.) */
4956 /* Save time if there's only one input file. */
4960 /* Pointers need special handling if they point to any type that
4961 needs special handling (below). */
4963 {
4964 tree t2;
4965 /* Find bottom type under any nested POINTERs. */
4969 ;
4977 }
4978 /* These are the only cases that need special handling. */
4985 /* Undefined? */
4989 /* Look up t in hash table. Only one of the compatible types within each
4990 alias set is recorded in the table. */
4995 {
4998 }
4999 else
5000 /* Our caller will assign and record (in t) a new alias set; all we need
5001 to do is remember t in the hash table. */
5005 }
5006 \f
5007 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5008 the IS_SIZEOF parameter indicates which operator is being applied.
5009 The COMPLAIN flag controls whether we should diagnose possibly
5010 ill-formed constructs or not. LOC is the location of the SIZEOF or
5011 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5012 a type in any context should be returned, rather than the normal
5013 alignment for that type. */
5015 tree
5019 {
5027 {
5029 {
5036 }
5037 else
5038 {
5040 {
5044 else
5047 }
5049 }
5050 }
5052 {
5060 }
5063 {
5068 }
5071 {
5076 }
5077 else
5078 {
5080 /* Convert in case a char is more than one unit. */
5086 else
5088 }
5090 /* VALUE will have the middle-end integer type sizetype.
5091 However, we should really return a value of type `size_t',
5092 which is just a typedef for an ordinary integer type. */
5096 }
5098 /* Implement the __alignof keyword: Return the minimum required
5099 alignment of EXPR, measured in bytes. For VAR_DECLs,
5100 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5101 from an "aligned" __attribute__ specification). LOC is the
5102 location of the ALIGNOF operator. */
5104 tree
5106 {
5107 tree t;
5114 {
5117 }
5123 {
5130 {
5137 }
5139 }
5140 else
5144 }
5145 \f
5146 /* Handle C and C++ default attributes. */
5148 enum built_in_attribute
5149 {
5150 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5151 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5152 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5153 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5154 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5156 #undef DEF_ATTR_NULL_TREE
5157 #undef DEF_ATTR_INT
5158 #undef DEF_ATTR_STRING
5159 #undef DEF_ATTR_IDENT
5160 #undef DEF_ATTR_TREE_LIST
5161 ATTR_LAST
5162 };
5168 enum c_builtin_type
5169 {
5170 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5171 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5172 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5173 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5174 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5175 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5176 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5177 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5178 ARG6) NAME,
5179 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5180 ARG6, ARG7) NAME,
5181 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5182 ARG6, ARG7, ARG8) NAME,
5183 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5184 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5185 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5186 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5187 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5188 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5189 NAME,
5190 #define DEF_FUNCTION_TYPE_VAR_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5191 ARG6, ARG7, ARG8) NAME,
5192 #define DEF_FUNCTION_TYPE_VAR_12(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5193 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11, \
5194 ARG12) NAME,
5195 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5197 #undef DEF_PRIMITIVE_TYPE
5198 #undef DEF_FUNCTION_TYPE_0
5199 #undef DEF_FUNCTION_TYPE_1
5200 #undef DEF_FUNCTION_TYPE_2
5201 #undef DEF_FUNCTION_TYPE_3
5202 #undef DEF_FUNCTION_TYPE_4
5203 #undef DEF_FUNCTION_TYPE_5
5204 #undef DEF_FUNCTION_TYPE_6
5205 #undef DEF_FUNCTION_TYPE_7
5206 #undef DEF_FUNCTION_TYPE_8
5207 #undef DEF_FUNCTION_TYPE_VAR_0
5208 #undef DEF_FUNCTION_TYPE_VAR_1
5209 #undef DEF_FUNCTION_TYPE_VAR_2
5210 #undef DEF_FUNCTION_TYPE_VAR_3
5211 #undef DEF_FUNCTION_TYPE_VAR_4
5212 #undef DEF_FUNCTION_TYPE_VAR_5
5213 #undef DEF_FUNCTION_TYPE_VAR_8
5214 #undef DEF_FUNCTION_TYPE_VAR_12
5215 #undef DEF_POINTER_TYPE
5216 BT_LAST
5217 };
5221 /* A temporary array for c_common_nodes_and_builtins. Used in
5222 communication with def_fn_type. */
5225 /* A helper function for c_common_nodes_and_builtins. Build function type
5226 for DEF with return type RET and N arguments. If VAR is true, then the
5227 function should be variadic after those N arguments.
5229 Takes special care not to ICE if any of the types involved are
5230 error_mark_node, which indicates that said type is not in fact available
5231 (see builtin_type_for_size). In which case the function type as a whole
5232 should be error_mark_node. */
5234 static void
5236 {
5237 tree t;
5244 {
5250 }
5257 else
5260 egress:
5263 }
5265 /* Build builtin functions common to both C and C++ language
5266 frontends. */
5268 static void
5270 {
5271 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5272 builtin_types[ENUM] = VALUE;
5273 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5274 def_fn_type (ENUM, RETURN, 0, 0);
5275 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5276 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5277 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5278 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5279 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5280 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5281 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5282 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5283 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5284 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5285 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5286 ARG6) \
5287 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5288 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5289 ARG6, ARG7) \
5290 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5291 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5292 ARG6, ARG7, ARG8) \
5293 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5294 ARG7, ARG8);
5295 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5296 def_fn_type (ENUM, RETURN, 1, 0);
5297 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5298 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5299 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5300 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5301 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5302 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5303 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5304 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5305 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5306 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5307 #define DEF_FUNCTION_TYPE_VAR_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5308 ARG6, ARG7, ARG8) \
5309 def_fn_type (ENUM, RETURN, 1, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5310 ARG7, ARG8);
5311 #define DEF_FUNCTION_TYPE_VAR_12(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5312 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11, ARG12) \
5313 def_fn_type (ENUM, RETURN, 1, 12, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5314 ARG7, ARG8, ARG9, ARG10, ARG11, ARG12);
5315 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5316 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5320 #undef DEF_PRIMITIVE_TYPE
5321 #undef DEF_FUNCTION_TYPE_0
5322 #undef DEF_FUNCTION_TYPE_1
5323 #undef DEF_FUNCTION_TYPE_2
5324 #undef DEF_FUNCTION_TYPE_3
5325 #undef DEF_FUNCTION_TYPE_4
5326 #undef DEF_FUNCTION_TYPE_5
5327 #undef DEF_FUNCTION_TYPE_6
5328 #undef DEF_FUNCTION_TYPE_7
5329 #undef DEF_FUNCTION_TYPE_8
5330 #undef DEF_FUNCTION_TYPE_VAR_0
5331 #undef DEF_FUNCTION_TYPE_VAR_1
5332 #undef DEF_FUNCTION_TYPE_VAR_2
5333 #undef DEF_FUNCTION_TYPE_VAR_3
5334 #undef DEF_FUNCTION_TYPE_VAR_4
5335 #undef DEF_FUNCTION_TYPE_VAR_5
5336 #undef DEF_FUNCTION_TYPE_VAR_8
5337 #undef DEF_FUNCTION_TYPE_VAR_12
5338 #undef DEF_POINTER_TYPE
5343 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5344 NONANSI_P, ATTRS, IMPLICIT, COND) \
5345 if (NAME && COND) \
5346 def_builtin_1 (ENUM, NAME, CLASS, \
5347 builtin_types[(int) TYPE], \
5348 builtin_types[(int) LIBTYPE], \
5349 BOTH_P, FALLBACK_P, NONANSI_P, \
5350 built_in_attributes[(int) ATTRS], IMPLICIT);
5352 #undef DEF_BUILTIN
5360 }
5362 /* Like get_identifier, but avoid warnings about null arguments when
5363 the argument may be NULL for targets where GCC lacks stdint.h type
5364 information. */
5368 {
5370 }
5372 /* Build tree nodes and builtin functions common to both C and C++ language
5373 frontends. */
5375 void
5377 {
5381 tree array_domain_type;
5382 tree va_list_ref_type_node;
5383 tree va_list_arg_type_node;
5388 /* Define `int' and `char' first so that dbx will output them first. */
5392 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5393 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5394 but not C. Are the conditionals here needed? */
5400 long_unsigned_type_node);
5403 {
5412 }
5417 long_long_integer_type_node);
5419 long_long_unsigned_type_node);
5422 long_long_unsigned_type_node);
5425 short_unsigned_type_node);
5428 short_unsigned_type_node);
5430 /* Define both `signed char' and `unsigned char'. */
5434 /* These are types that c_common_type_for_size and
5435 c_common_type_for_mode use. */
5438 intQI_type_node));
5441 intHI_type_node));
5444 intSI_type_node));
5447 intDI_type_node));
5448 #if HOST_BITS_PER_WIDE_INT >= 64
5449 /* Note that this is different than the __int128 type that's part of
5450 the generic __intN support. */
5453 TYPE_DECL,
5455 intTI_type_node));
5456 #endif
5459 unsigned_intQI_type_node));
5462 unsigned_intHI_type_node));
5465 unsigned_intSI_type_node));
5468 unsigned_intDI_type_node));
5469 #if HOST_BITS_PER_WIDE_INT >= 64
5472 TYPE_DECL,
5474 unsigned_intTI_type_node));
5475 #endif
5477 /* Create the widest literal types. */
5478 widest_integer_literal_type_node
5482 widest_integer_literal_type_node));
5484 widest_unsigned_literal_type_node
5488 widest_unsigned_literal_type_node));
5492 pid_type_node =
5499 /* Only supported decimal floating point extension if the target
5500 actually supports underlying modes. */
5504 {
5508 }
5511 {
5516 long_long_fract_type_node);
5518 unsigned_short_fract_type_node);
5520 unsigned_fract_type_node);
5522 unsigned_long_fract_type_node);
5524 unsigned_long_long_fract_type_node);
5526 sat_short_fract_type_node);
5529 sat_long_fract_type_node);
5531 sat_long_long_fract_type_node);
5533 sat_unsigned_short_fract_type_node);
5535 sat_unsigned_fract_type_node);
5537 sat_unsigned_long_fract_type_node);
5539 sat_unsigned_long_long_fract_type_node);
5544 long_long_accum_type_node);
5546 unsigned_short_accum_type_node);
5548 unsigned_accum_type_node);
5550 unsigned_long_accum_type_node);
5552 unsigned_long_long_accum_type_node);
5554 sat_short_accum_type_node);
5557 sat_long_accum_type_node);
5559 sat_long_long_accum_type_node);
5561 sat_unsigned_short_accum_type_node);
5563 sat_unsigned_accum_type_node);
5565 sat_unsigned_long_accum_type_node);
5567 sat_unsigned_long_long_accum_type_node);
5569 }
5572 TYPE_DECL,
5574 complex_integer_type_node));
5576 TYPE_DECL,
5578 complex_float_type_node));
5580 TYPE_DECL,
5582 complex_double_type_node));
5586 complex_long_double_type_node));
5589 /* For C++, make fileptr_type_node a distinct void * type until
5590 FILE type is defined. */
5595 /* Set the TYPE_NAME for any variants that were built before
5596 record_builtin_type gave names to the built-in types. */
5597 {
5603 }
5607 /* Make a type to be the domain of a few array types
5608 whose domains don't really matter.
5609 200 is small enough that it always fits in size_t
5610 and large enough that it can hold most function names for the
5611 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5614 /* Make a type for arrays of characters.
5615 With luck nothing will ever really depend on the length of this
5616 array type. */
5617 char_array_type_node
5621 const_string_type_node
5625 /* This is special for C++ so functions can be overloaded. */
5631 {
5634 else
5637 }
5639 /* This is for wide string constants. */
5640 wchar_array_type_node
5643 /* Define 'char16_t'. */
5648 {
5653 }
5655 /* This is for UTF-16 string constants. */
5656 char16_array_type_node
5659 /* Define 'char32_t'. */
5664 {
5669 }
5671 /* This is for UTF-32 string constants. */
5672 char32_array_type_node
5675 wint_type_node =
5678 intmax_type_node =
5680 uintmax_type_node =
5684 sig_atomic_type_node =
5687 int8_type_node =
5690 int16_type_node =
5693 int32_type_node =
5696 int64_type_node =
5699 uint8_type_node =
5711 int_least8_type_node =
5714 int_least16_type_node =
5717 int_least32_type_node =
5720 int_least64_type_node =
5723 uint_least8_type_node =
5726 uint_least16_type_node =
5729 uint_least32_type_node =
5732 uint_least64_type_node =
5735 int_fast8_type_node =
5738 int_fast16_type_node =
5741 int_fast32_type_node =
5744 int_fast64_type_node =
5747 uint_fast8_type_node =
5750 uint_fast16_type_node =
5753 uint_fast32_type_node =
5756 uint_fast64_type_node =
5759 intptr_type_node =
5762 uintptr_type_node =
5765 default_function_type
5767 ptrdiff_type_node
5774 va_list_type_node));
5776 {
5779 tree ptype;
5782 {
5786 ptype));
5788 }
5789 }
5792 {
5795 }
5796 else
5797 {
5800 }
5807 /* Create the built-in __null node. It is important that this is
5808 not shared. */
5812 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5814 }
5816 /* The number of named compound-literals generated thus far. */
5819 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5821 void
5823 {
5826 compound_literal_number);
5827 compound_literal_number++;
5829 }
5831 tree
5833 {
5837 }
5840 /* Linked list of disabled built-in functions. */
5843 {
5851 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5852 begins with "__builtin_", give an error. */
5854 void
5856 {
5859 else
5860 {
5865 }
5866 }
5869 /* Return true if the built-in function NAME has been disabled, false
5870 otherwise. */
5872 static bool
5874 {
5877 {
5880 }
5882 }
5885 /* Worker for DEF_BUILTIN.
5886 Possibly define a builtin function with one or two names.
5887 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5888 nonansi_p and flag_no_nonansi_builtin. */
5890 static void
5897 {
5898 tree decl;
5911 fnattrs);
5920 }
5921 \f
5922 /* Nonzero if the type T promotes to int. This is (nearly) the
5923 integral promotions defined in ISO C99 6.3.1.1/2. */
5925 bool
5927 {
5929 {
5939 /* ??? Technically all enumerations not larger than an int
5940 promote to an int. But this is used along code paths
5941 that only want to notice a size change. */
5949 }
5950 }
5952 /* Return 1 if PARMS specifies a fixed number of parameters
5953 and none of their types is affected by default promotions. */
5955 int
5957 {
5958 const_tree t;
5960 {
5977 }
5979 }
5981 /* Recursively remove any '*' or '&' operator from TYPE. */
5982 tree
5984 {
5988 }
5990 /* Recursively remove pointer or array type from TYPE. */
5991 tree
5993 {
5997 }
5999 /* Used to compare case labels. K1 and K2 are actually tree nodes
6000 representing case labels, or NULL_TREE for a `default' label.
6001 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6002 K2, and 0 if K1 and K2 are equal. */
6004 int
6006 {
6007 /* Consider a NULL key (such as arises with a `default' label) to be
6008 smaller than anything else. */
6015 }
6017 /* Process a case label, located at LOC, for the range LOW_VALUE
6018 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6019 then this case label is actually a `default' label. If only
6020 HIGH_VALUE is NULL_TREE, then case label was declared using the
6021 usual C/C++ syntax, rather than the GNU case range extension.
6022 CASES is a tree containing all the case ranges processed so far;
6023 COND is the condition for the switch-statement itself. Returns the
6024 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6025 is created. */
6027 tree
6030 {
6031 tree type;
6032 tree label;
6033 tree case_label;
6034 splay_tree_node node;
6036 /* Create the LABEL_DECL itself. */
6039 /* If there was an error processing the switch condition, bail now
6040 before we get more confused. */
6048 {
6051 }
6053 /* Case ranges are a GNU extension. */
6060 {
6065 }
6067 {
6072 }
6075 {
6076 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6077 really a case range, even though it was written that way.
6078 Remove the HIGH_VALUE to simplify later processing. */
6083 }
6085 /* See if the case is in range of the type of the original testing
6086 expression. If both low_value and high_value are out of range,
6087 don't insert the case label and return NULL_TREE. */
6093 /* Look up the LOW_VALUE in the table of case labels we already
6094 have. */
6096 /* If there was not an exact match, check for overlapping ranges.
6097 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6098 that's a `default' label and the only overlap is an exact match. */
6100 {
6101 splay_tree_node low_bound;
6102 splay_tree_node high_bound;
6104 /* Even though there wasn't an exact match, there might be an
6105 overlap between this case range and another case range.
6106 Since we've (inductively) not allowed any overlapping case
6107 ranges, we simply need to find the greatest low case label
6108 that is smaller that LOW_VALUE, and the smallest low case
6109 label that is greater than LOW_VALUE. If there is an overlap
6110 it will occur in one of these two ranges. */
6116 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6117 the LOW_VALUE, so there is no need to check unless the
6118 LOW_BOUND is in fact itself a case range. */
6124 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6125 range is bigger than the low end of the current range, so we
6126 are only interested if the current range is a real range, and
6127 not an ordinary case label. */
6129 && high_value
6131 high_value)
6134 }
6135 /* If there was an overlap, issue an error. */
6137 {
6141 {
6145 }
6147 {
6150 }
6151 else
6152 {
6156 }
6158 }
6160 /* Add a CASE_LABEL to the statement-tree. */
6162 /* Register this case label in the splay tree. */
6169 error_out:
6170 /* Add a label so that the back-end doesn't think that the beginning of
6171 the switch is unreachable. Note that we do not add a case label, as
6172 that just leads to duplicates and thence to failure later on. */
6174 {
6177 }
6179 }
6181 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6182 Used to verify that case values match up with enumerator values. */
6184 static void
6186 {
6193 else
6200 buf);
6201 else
6206 }
6208 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6209 Used to verify that case values match up with enumerator values. */
6211 static int
6213 {
6217 /* Skip default case. */
6221 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6222 when we did our enum->case scan. Reset our scratch bit after. */
6225 else
6228 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6229 not set, that means that CASE_HIGH did not appear when we did our
6230 enum->case scan. Reset our scratch bit after. */
6232 {
6235 else
6237 }
6240 }
6242 /* Handle -Wswitch*. Called from the front end after parsing the
6243 switch construct. */
6244 /* ??? Should probably be somewhere generic, since other languages
6245 besides C and C++ would want this. At the moment, however, C/C++
6246 are the only tree-ssa languages that support enumerations at all,
6247 so the point is moot. */
6249 void
6252 {
6253 splay_tree_node default_node;
6254 splay_tree_node node;
6255 tree chain;
6265 /* From here on, we only care about about enumerated types. */
6269 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6273 /* Check the cases. Warn about case values which are not members of
6274 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6275 there is no default case, check that exactly all enumeration
6276 literals are covered by the cases. */
6278 /* Clearing COND if it is not an integer constant simplifies
6279 the tests inside the loop below. */
6283 /* The time complexity here is O(N*lg(N)) worst case, but for the
6284 common case of monotonically increasing enumerators, it is
6285 O(N), since the nature of the splay tree will keep the next
6286 element adjacent to the root at all times. */
6289 {
6295 {
6296 /* Mark the CASE_LOW part of the case entry as seen. */
6300 }
6302 /* Even though there wasn't an exact match, there might be a
6303 case range which includes the enumerator's value. */
6306 {
6310 {
6311 /* If we match the upper bound exactly, mark the CASE_HIGH
6312 part of the case entry as seen. */
6316 }
6317 }
6319 /* We've now determined that this enumerated literal isn't
6320 handled by the case labels of the switch statement. */
6322 /* If the switch expression is a constant, we only really care
6323 about whether that constant is handled by the switch. */
6327 /* If there is a default_node, the only relevant option is
6328 Wswitch-enum. Otherwise, if both are enabled then we prefer
6329 to warn using -Wswitch because -Wswitch is enabled by -Wall
6330 while -Wswitch-enum is explicit. */
6333 ? OPT_Wswitch_enum
6337 }
6339 /* Warn if there are case expressions that don't correspond to
6340 enumerators. This can occur since C and C++ don't enforce
6341 type-checking of assignments to enumeration variables.
6343 The time complexity here is now always O(N) worst case, since
6344 we should have marked both the lower bound and upper bound of
6345 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6346 above. This scan also resets those fields. */
6349 }
6351 /* Finish an expression taking the address of LABEL (an
6352 IDENTIFIER_NODE). Returns an expression for the address.
6354 LOC is the location for the expression returned. */
6356 tree
6358 {
6359 tree result;
6369 else
6370 {
6373 /* The current function is not necessarily uninlinable.
6374 Computed gotos are incompatible with inlining, but the value
6375 here could be used only in a diagnostic, for example. */
6377 }
6380 }
6381 \f
6383 /* Given a boolean expression ARG, return a tree representing an increment
6384 or decrement (as indicated by CODE) of ARG. The front end must check for
6385 invalid cases (e.g., decrement in C++). */
6386 tree
6388 {
6389 tree val;
6394 {
6417 }
6420 }
6421 \f
6422 /* Built-in macros for stddef.h and stdint.h, that require macros
6423 defined in this file. */
6424 void
6426 {
6489 }
6491 static void
6493 {
6494 /* Fill in the built_in_attributes array. */
6495 #define DEF_ATTR_NULL_TREE(ENUM) \
6496 built_in_attributes[(int) ENUM] = NULL_TREE;
6497 #define DEF_ATTR_INT(ENUM, VALUE) \
6498 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6499 #define DEF_ATTR_STRING(ENUM, VALUE) \
6500 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6501 #define DEF_ATTR_IDENT(ENUM, STRING) \
6502 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6503 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6504 built_in_attributes[(int) ENUM] \
6505 = tree_cons (built_in_attributes[(int) PURPOSE], \
6506 built_in_attributes[(int) VALUE], \
6507 built_in_attributes[(int) CHAIN]);
6509 #undef DEF_ATTR_NULL_TREE
6510 #undef DEF_ATTR_INT
6511 #undef DEF_ATTR_IDENT
6512 #undef DEF_ATTR_TREE_LIST
6513 }
6515 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6516 identifier as an argument, so the front end shouldn't look it up. */
6518 bool
6520 {
6523 /* Unknown attribute that we'll end up ignoring, return true so we
6524 don't complain about an identifier argument. */
6530 else
6532 }
6534 /* Attribute handlers common to C front ends. */
6536 /* Handle a "packed" attribute; arguments as in
6537 struct attribute_spec.handler. */
6539 static tree
6542 {
6544 {
6548 }
6550 {
6552 /* Still pack bitfields. */
6557 else
6559 }
6560 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6561 used for DECL_REGISTER. It wouldn't mean anything anyway.
6562 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6563 that changes what the typedef is typing. */
6564 else
6565 {
6568 }
6571 }
6573 /* Handle a "nocommon" attribute; arguments as in
6574 struct attribute_spec.handler. */
6576 static tree
6580 {
6583 else
6584 {
6587 }
6590 }
6592 /* Handle a "common" attribute; arguments as in
6593 struct attribute_spec.handler. */
6595 static tree
6598 {
6601 else
6602 {
6605 }
6608 }
6610 /* Handle a "noreturn" attribute; arguments as in
6611 struct attribute_spec.handler. */
6613 static tree
6616 {
6619 /* See FIXME comment in c_common_attribute_table. */
6626 = (build_qualified_type
6627 (build_pointer_type
6631 else
6632 {
6635 }
6638 }
6640 /* Handle a "hot" and attribute; arguments as in
6641 struct attribute_spec.handler. */
6643 static tree
6646 {
6649 {
6651 {
6655 }
6656 /* Most of the rest of the hot processing is done later with
6657 lookup_attribute. */
6658 }
6659 else
6660 {
6663 }
6666 }
6668 /* Handle a "cold" and attribute; arguments as in
6669 struct attribute_spec.handler. */
6671 static tree
6674 {
6677 {
6679 {
6683 }
6684 /* Most of the rest of the cold processing is done later with
6685 lookup_attribute. */
6686 }
6687 else
6688 {
6691 }
6694 }
6696 /* Handle a "no_sanitize_address" attribute; arguments as in
6697 struct attribute_spec.handler. */
6699 static tree
6702 {
6704 {
6707 }
6710 }
6712 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6713 struct attribute_spec.handler. */
6715 static tree
6718 {
6727 }
6729 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6730 struct attribute_spec.handler. */
6732 static tree
6735 {
6737 {
6740 }
6743 }
6745 /* Handle a "noinline" attribute; arguments as in
6746 struct attribute_spec.handler. */
6748 static tree
6752 {
6754 {
6756 {
6760 }
6761 else
6763 }
6764 else
6765 {
6768 }
6771 }
6773 /* Handle a "noclone" attribute; arguments as in
6774 struct attribute_spec.handler. */
6776 static tree
6780 {
6782 {
6785 }
6788 }
6790 /* Handle a "always_inline" attribute; arguments as in
6791 struct attribute_spec.handler. */
6793 static tree
6798 {
6800 {
6802 {
6806 }
6807 else
6808 /* Set the attribute and mark it for disregarding inline
6809 limits. */
6811 }
6812 else
6813 {
6816 }
6819 }
6821 /* Handle a "gnu_inline" attribute; arguments as in
6822 struct attribute_spec.handler. */
6824 static tree
6829 {
6831 {
6832 /* Do nothing else, just set the attribute. We'll get at
6833 it later with lookup_attribute. */
6834 }
6835 else
6836 {
6839 }
6842 }
6844 /* Handle a "leaf" attribute; arguments as in
6845 struct attribute_spec.handler. */
6847 static tree
6851 {
6853 {
6856 }
6858 {
6861 }
6864 }
6866 /* Handle an "artificial" attribute; arguments as in
6867 struct attribute_spec.handler. */
6869 static tree
6874 {
6876 {
6877 /* Do nothing else, just set the attribute. We'll get at
6878 it later with lookup_attribute. */
6879 }
6880 else
6881 {
6884 }
6887 }
6889 /* Handle a "flatten" attribute; arguments as in
6890 struct attribute_spec.handler. */
6892 static tree
6894 tree args ATTRIBUTE_UNUSED,
6896 {
6898 /* Do nothing else, just set the attribute. We'll get at
6899 it later with lookup_attribute. */
6900 ;
6901 else
6902 {
6905 }
6908 }
6910 /* Handle a "warning" or "error" attribute; arguments as in
6911 struct attribute_spec.handler. */
6913 static tree
6916 {
6919 /* Do nothing else, just set the attribute. We'll get at
6920 it later with lookup_attribute. */
6921 ;
6922 else
6923 {
6926 }
6929 }
6931 /* Handle a "used" attribute; arguments as in
6932 struct attribute_spec.handler. */
6934 static tree
6937 {
6943 {
6948 }
6949 else
6950 {
6953 }
6956 }
6958 /* Handle a "unused" attribute; arguments as in
6959 struct attribute_spec.handler. */
6961 static tree
6964 {
6966 {
6974 {
6979 }
6980 else
6981 {
6984 }
6985 }
6986 else
6987 {
6991 }
6994 }
6996 /* Handle a "externally_visible" attribute; arguments as in
6997 struct attribute_spec.handler. */
6999 static tree
7004 {
7008 {
7011 {
7015 }
7016 }
7017 else
7018 {
7021 }
7024 }
7026 /* Handle the "no_reorder" attribute. Arguments as in
7027 struct attribute_spec.handler. */
7029 static tree
7031 tree name,
7032 tree,
7035 {
7040 {
7043 name);
7045 }
7048 }
7050 /* Handle a "const" attribute; arguments as in
7051 struct attribute_spec.handler. */
7053 static tree
7056 {
7059 /* See FIXME comment on noreturn in c_common_attribute_table. */
7065 = (build_qualified_type
7066 (build_pointer_type
7070 else
7071 {
7074 }
7077 }
7079 /* Handle a "transparent_union" attribute; arguments as in
7080 struct attribute_spec.handler. */
7082 static tree
7086 {
7087 tree type;
7098 {
7099 /* Make sure that the first field will work for a transparent union.
7100 If the type isn't complete yet, leave the check to the code in
7101 finish_struct. */
7103 {
7109 }
7112 {
7113 /* If the type isn't complete yet, setting the flag
7114 on a variant wouldn't ever be checked. */
7118 /* build_duplicate_type doesn't work for C++. */
7122 /* A type variant isn't good enough, since we don't a cast
7123 to such a type removed as a no-op. */
7125 }
7129 }
7131 ignored:
7134 }
7136 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7137 get the requested priority for a constructor or destructor,
7138 possibly issuing diagnostics for invalid or reserved
7139 priorities. */
7141 static priority_type
7143 {
7144 HOST_WIDE_INT pri;
7145 tree arg;
7151 {
7154 else
7157 }
7174 {
7177 "destructor priorities from 0 to %d are reserved "
7179 MAX_RESERVED_INIT_PRIORITY);
7180 else
7182 "constructor priorities from 0 to %d are reserved "
7184 MAX_RESERVED_INIT_PRIORITY);
7185 }
7188 invalid:
7191 MAX_INIT_PRIORITY);
7192 else
7194 MAX_INIT_PRIORITY);
7196 }
7198 /* Handle a "constructor" attribute; arguments as in
7199 struct attribute_spec.handler. */
7201 static tree
7205 {
7212 {
7213 priority_type priority;
7218 }
7219 else
7220 {
7223 }
7226 }
7228 /* Handle a "destructor" attribute; arguments as in
7229 struct attribute_spec.handler. */
7231 static tree
7235 {
7242 {
7243 priority_type priority;
7248 }
7249 else
7250 {
7253 }
7256 }
7258 /* Nonzero if the mode is a valid vector mode for this architecture.
7259 This returns nonzero even if there is no hardware support for the
7260 vector mode, but we can emulate with narrower modes. */
7262 static int
7264 {
7266 machine_mode innermode;
7268 /* Doh! What's going on? */
7277 /* Hardware support. Woo hoo! */
7283 /* We should probably return 1 if requesting V4DI and we have no DI,
7284 but we have V2DI, but this is probably very unlikely. */
7286 /* If we have support for the inner mode, we can safely emulate it.
7287 We may not have V2DI, but me can emulate with a pair of DIs. */
7289 }
7292 /* Handle a "mode" attribute; arguments as in
7293 struct attribute_spec.handler. */
7295 static tree
7298 {
7306 else
7307 {
7312 tree typefm;
7317 {
7323 }
7325 /* Change this type to have a type with the specified mode.
7326 First check for the special modes. */
7339 else
7342 {
7345 }
7348 {
7351 }
7355 {
7387 }
7389 {
7392 }
7395 {
7400 {
7403 }
7407 else
7410 }
7411 else
7412 {
7413 /* For fixed-point modes, we need to test if the signness of type
7414 and the machine mode are consistent. */
7417 {
7420 }
7421 /* For fixed-point modes, we need to pass saturating info. */
7425 }
7428 {
7431 }
7433 {
7434 /* For enumeral types, copy the precision from the integer
7435 type returned above. If not an INTEGER_TYPE, we can't use
7436 this mode for this type. */
7438 {
7441 }
7444 {
7447 }
7448 else
7449 {
7450 /* We cannot build a type variant, as there's code that assumes
7451 that TYPE_MAIN_VARIANT has the same mode. This includes the
7452 debug generators. Instead, create a subrange type. This
7453 results in all of the enumeral values being emitted only once
7454 in the original, and the subtype gets them by reference. */
7457 else
7460 }
7461 }
7465 {
7468 }
7471 }
7474 }
7476 /* Handle a "section" attribute; arguments as in
7477 struct attribute_spec.handler. */
7479 static tree
7482 {
7486 {
7492 {
7496 {
7498 "section attribute cannot be specified for "
7501 }
7503 /* The decl may have already been given a section attribute
7504 from a previous declaration. Ensure they match. */
7508 {
7512 }
7516 {
7519 }
7520 else
7523 }
7524 else
7525 {
7528 }
7529 }
7530 else
7531 {
7535 }
7538 }
7540 /* Check whether ALIGN is a valid user-specified alignment. If so,
7541 return its base-2 log; if not, output an error and return -1. If
7542 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7543 no error. */
7544 int
7546 {
7553 {
7556 }
7561 {
7564 }
7566 {
7569 }
7571 }
7573 /*
7574 If in c++-11, check if the c++-11 alignment constraint with respect
7575 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7576 c++-11 mode, does nothing.
7578 [dcl.align]2/ says:
7580 [* if the constant expression evaluates to a fundamental alignment,
7581 the alignment requirement of the declared entity shall be the
7582 specified fundamental alignment.
7584 * if the constant expression evaluates to an extended alignment
7585 and the implementation supports that alignment in the context
7586 of the declaration, the alignment of the declared entity shall
7587 be that alignment
7589 * if the constant expression evaluates to an extended alignment
7590 and the implementation does not support that alignment in the
7591 context of the declaration, the program is ill-formed]. */
7593 static bool
7597 {
7610 {
7612 {
7613 /* For file scope variables and static members, the target
7614 supports alignments that are at most
7615 MAX_OFILE_ALIGNMENT. */
7618 }
7619 else
7620 {
7621 #ifdef BIGGEST_FIELD_ALIGNMENT
7622 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7623 #else
7624 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7625 #endif
7626 /* For non-static members, the target supports either
7627 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7628 if it is defined or BIGGEST_ALIGNMENT. */
7633 #undef MAX_TARGET_FIELD_ALIGNMENT
7634 /* For stack variables, the target supports at most
7635 MAX_STACK_ALIGNMENT. */
7639 }
7640 }
7642 {
7643 /* Let's be liberal for types. */
7646 }
7654 }
7656 /* Handle a "aligned" attribute; arguments as in
7657 struct attribute_spec.handler. */
7659 static tree
7662 {
7666 tree align_expr;
7670 {
7675 }
7676 else
7680 {
7684 }
7692 {
7695 /* If we have a TYPE_DECL, then copy the type, so that we
7696 don't accidentally modify a builtin type. See pushdecl. */
7699 {
7706 }
7707 else
7712 }
7715 {
7718 }
7721 /* C++-11 [dcl.align/4]:
7723 When multiple alignment-specifiers are specified for an
7724 entity, the alignment requirement shall be set to the
7725 strictest specified alignment.
7727 This formally comes from the c++11 specification but we are
7728 doing it for the GNU attribute syntax as well. */
7732 {
7737 else
7741 }
7742 else
7743 {
7746 }
7749 }
7751 /* Handle a "weak" attribute; arguments as in
7752 struct attribute_spec.handler. */
7754 static tree
7759 {
7762 {
7765 }
7767 {
7771 }
7775 else
7779 }
7781 /* Handle an "alias" or "ifunc" attribute; arguments as in
7782 struct attribute_spec.handler, except that IS_ALIAS tells us
7783 whether this is an alias as opposed to ifunc attribute. */
7785 static tree
7788 {
7793 {
7796 }
7800 /* A static variable declaration is always a tentative definition,
7801 but the alias is a non-tentative definition which overrides. */
7804 {
7808 }
7812 {
7816 }
7818 /* Note that the very first time we process a nested declaration,
7819 decl_function_context will not be set. Indeed, *would* never
7820 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7821 we do below. After such frobbery, pushdecl would set the context.
7822 In any case, this is never what we want. */
7824 {
7825 tree id;
7829 {
7833 }
7835 /* This counts as a use of the object pointed to. */
7840 else
7844 /* ifuncs are also aliases, so set that attribute too. */
7847 }
7848 else
7849 {
7852 }
7855 {
7858 {
7861 else
7863 }
7864 }
7868 }
7870 /* Handle an "alias" or "ifunc" attribute; arguments as in
7871 struct attribute_spec.handler. */
7873 static tree
7876 {
7878 }
7880 /* Handle an "alias" or "ifunc" attribute; arguments as in
7881 struct attribute_spec.handler. */
7883 static tree
7886 {
7888 }
7890 /* Handle a "weakref" attribute; arguments as in struct
7891 attribute_spec.handler. */
7893 static tree
7896 {
7899 /* We must ignore the attribute when it is associated with
7900 local-scoped decls, since attribute alias is ignored and many
7901 such symbols do not even have a DECL_WEAK field. */
7903 || current_function_decl
7905 {
7909 }
7912 {
7916 }
7918 /* The idea here is that `weakref("name")' mutates into `weakref,
7919 alias("name")', and weakref without arguments, in turn,
7920 implicitly adds weak. */
7923 {
7930 }
7931 else
7932 {
7937 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7938 and that isn't supported; and because it wants to add it to
7939 the list of weak decls, which isn't helpful. */
7941 }
7944 {
7948 }
7951 }
7953 /* Handle an "visibility" attribute; arguments as in
7954 struct attribute_spec.handler. */
7956 static tree
7960 {
7966 {
7970 {
7972 name);
7974 }
7976 {
7980 }
7981 }
7983 {
7986 }
7989 {
7992 }
7994 /* If this is a type, set the visibility on the type decl. */
7996 {
8001 {
8003 name);
8005 }
8006 }
8016 else
8017 {
8018 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8020 }
8024 {
8038 }
8043 /* Go ahead and attach the attribute to the node as well. This is needed
8044 so we can determine whether we have VISIBILITY_DEFAULT because the
8045 visibility was not specified, or because it was explicitly overridden
8046 from the containing scope. */
8049 }
8051 /* Determine the ELF symbol visibility for DECL, which is either a
8052 variable or a function. It is an error to use this function if a
8053 definition of DECL is not available in this translation unit.
8054 Returns true if the final visibility has been determined by this
8055 function; false if the caller is free to make additional
8056 modifications. */
8058 bool
8060 {
8064 /* If the user explicitly specified the visibility with an
8065 attribute, honor that. DECL_VISIBILITY will have been set during
8066 the processing of the attribute. We check for an explicit
8067 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8068 to distinguish the use of an attribute from the use of a "#pragma
8069 GCC visibility push(...)"; in the latter case we still want other
8070 considerations to be able to overrule the #pragma. */
8072 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8077 /* Set default visibility to whatever the user supplied with
8078 visibility_specified depending on #pragma GCC visibility. */
8080 {
8083 {
8086 /* If visibility changed and DECL already has DECL_RTL, ensure
8087 symbol flags are updated. */
8092 }
8093 }
8095 }
8097 /* Handle an "tls_model" attribute; arguments as in
8098 struct attribute_spec.handler. */
8100 static tree
8103 {
8104 tree id;
8111 {
8114 }
8119 {
8122 }
8132 else
8133 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8137 }
8139 /* Handle a "no_instrument_function" attribute; arguments as in
8140 struct attribute_spec.handler. */
8142 static tree
8147 {
8151 {
8155 }
8156 else
8160 }
8162 /* Handle a "malloc" attribute; arguments as in
8163 struct attribute_spec.handler. */
8165 static tree
8168 {
8172 else
8173 {
8176 }
8179 }
8181 /* Handle a "alloc_size" attribute; arguments as in
8182 struct attribute_spec.handler. */
8184 static tree
8187 {
8190 {
8197 || !arg_count
8199 {
8204 }
8205 }
8207 }
8209 /* Handle a "alloc_align" attribute; arguments as in
8210 struct attribute_spec.handler. */
8212 static tree
8215 {
8222 || !arg_count
8224 {
8229 }
8231 }
8233 /* Handle a "assume_aligned" attribute; arguments as in
8234 struct attribute_spec.handler. */
8236 static tree
8239 {
8241 {
8248 {
8253 }
8254 }
8256 }
8258 /* Handle a "fn spec" attribute; arguments as in
8259 struct attribute_spec.handler. */
8261 static tree
8265 {
8270 }
8272 /* Handle a "warn_unused" attribute; arguments as in
8273 struct attribute_spec.handler. */
8275 static tree
8277 tree args ATTRIBUTE_UNUSED,
8279 {
8281 /* Do nothing else, just set the attribute. We'll get at
8282 it later with lookup_attribute. */
8283 ;
8284 else
8285 {
8288 }
8291 }
8293 /* Handle an "omp declare simd" attribute; arguments as in
8294 struct attribute_spec.handler. */
8296 static tree
8298 {
8300 }
8302 /* Handle an "omp declare target" attribute; arguments as in
8303 struct attribute_spec.handler. */
8305 static tree
8307 {
8309 }
8311 /* Handle a "returns_twice" attribute; arguments as in
8312 struct attribute_spec.handler. */
8314 static tree
8317 {
8320 else
8321 {
8324 }
8327 }
8329 /* Handle a "no_limit_stack" attribute; arguments as in
8330 struct attribute_spec.handler. */
8332 static tree
8337 {
8341 {
8345 }
8347 {
8351 }
8352 else
8356 }
8358 /* Handle a "pure" attribute; arguments as in
8359 struct attribute_spec.handler. */
8361 static tree
8364 {
8367 /* ??? TODO: Support types. */
8368 else
8369 {
8372 }
8375 }
8377 /* Digest an attribute list destined for a transactional memory statement.
8378 ALLOWED is the set of attributes that are allowed for this statement;
8379 return the attribute we parsed. Multiple attributes are never allowed. */
8381 int
8383 {
8388 {
8396 {
8399 }
8402 {
8405 }
8408 else
8410 }
8413 }
8415 /* Transform a TM attribute name into a maskable integer and back.
8416 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8417 to how the lack of an attribute is treated. */
8419 int
8421 {
8435 }
8437 tree
8439 {
8442 {
8460 }
8462 }
8464 /* Return the first TM attribute seen in LIST. */
8466 tree
8468 {
8470 {
8474 }
8476 }
8478 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8479 Here we accept only function types, and verify that none of the other
8480 function TM attributes are also applied. */
8481 /* ??? We need to accept class types for C++, but not C. This greatly
8482 complicates this function, since we can no longer rely on the extra
8483 processing given by function_type_required. */
8485 static tree
8488 {
8489 /* Only one path adds the attribute; others don't. */
8493 {
8496 /* Only tm_callable and tm_safe apply to classes. */
8499 /* FALLTHRU */
8503 {
8506 ;
8509 else
8511 }
8515 {
8518 {
8523 }
8524 }
8525 /* FALLTHRU */
8528 /* If a function is next, pass it on to be tried next. */
8532 ignored:
8535 }
8538 }
8540 /* Handle the TM_WRAP attribute; arguments as in
8541 struct attribute_spec.handler. */
8543 static tree
8546 {
8549 /* We don't need the attribute even on success, since we
8550 record the entry in an external table. */
8555 else
8556 {
8559 ;
8564 else
8565 {
8569 {
8573 else
8575 }
8576 else
8578 }
8579 }
8582 }
8584 /* Ignore the given attribute. Used when this attribute may be usefully
8585 overridden by the target, but is not used generically. */
8587 static tree
8591 {
8594 }
8596 /* Handle a "no vops" attribute; arguments as in
8597 struct attribute_spec.handler. */
8599 static tree
8603 {
8607 }
8609 /* Handle a "deprecated" attribute; arguments as in
8610 struct attribute_spec.handler. */
8612 static tree
8616 {
8624 {
8627 }
8630 {
8641 else
8643 }
8645 {
8650 }
8651 else
8655 {
8658 {
8664 }
8667 else
8669 }
8672 }
8674 /* Handle a "vector_size" attribute; arguments as in
8675 struct attribute_spec.handler. */
8677 static tree
8681 {
8683 machine_mode orig_mode;
8694 {
8697 }
8699 /* Get the vector size (in bytes). */
8702 /* We need to provide for vector pointers, vector arrays, and
8703 functions returning vectors. For example:
8705 __attribute__((vector_size(16))) short *foo;
8707 In this case, the mode is SI, but the type being modified is
8708 HI, so we need to look further. */
8717 /* Get the mode of the type being modified. */
8728 {
8731 }
8734 {
8737 }
8740 {
8743 }
8745 /* Calculate how many units fit in the vector. */
8748 {
8751 }
8755 /* Build back pointers if needed. */
8759 }
8761 /* Handle the "nonnull" attribute. */
8762 static tree
8766 {
8770 /* If no arguments are specified, all pointer arguments should be
8771 non-null. Verify a full prototype is given so that the arguments
8772 will have the correct types when we actually check them later. */
8774 {
8776 {
8779 }
8781 }
8783 /* Argument list specified. Verify that each argument number references
8784 a pointer argument. */
8786 {
8795 {
8800 }
8803 {
8804 function_args_iterator iter;
8805 tree argument;
8809 {
8813 }
8817 {
8822 }
8825 {
8830 }
8831 }
8832 }
8835 }
8837 /* Check the argument list of a function call for null in argument slots
8838 that are marked as requiring a non-null pointer argument. The NARGS
8839 arguments are passed in the array ARGARRAY.
8840 */
8842 static void
8844 {
8845 tree a;
8853 /* See if any of the nonnull attributes has no arguments. If so,
8854 then every pointer argument is checked (in which case the check
8855 for pointer type is done in check_nonnull_arg). */
8857 do
8865 else
8866 {
8867 /* Walk the argument list. If we encounter an argument number we
8868 should check for non-null, do it. */
8870 {
8872 {
8876 }
8881 }
8882 }
8883 }
8885 /* Check that the Nth argument of a function call (counting backwards
8886 from the end) is a (pointer)0. The NARGS arguments are passed in the
8887 array ARGARRAY. */
8889 static void
8891 {
8895 {
8898 tree sentinel;
8899 function_args_iterator iter;
8900 tree t;
8902 /* Skip over the named arguments. */
8904 {
8907 len++;
8908 }
8911 {
8914 }
8916 /* The sentinel must be one of the varargs, i.e.
8917 in position >= the number of fixed arguments. */
8919 {
8923 }
8925 /* Validate the sentinel. */
8929 /* Although __null (in C++) is only an integer we allow it
8930 nevertheless, as we are guaranteed that it's exactly
8931 as wide as a pointer, and we don't want to force
8932 users to cast the NULL they have written there.
8933 We warn with -Wstrict-null-sentinel, though. */
8936 }
8937 }
8939 /* Helper for check_function_nonnull; given a list of operands which
8940 must be non-null in ARGS, determine if operand PARAM_NUM should be
8941 checked. */
8943 static bool
8945 {
8949 {
8956 }
8958 }
8960 /* Check that the function argument PARAM (which is operand number
8961 PARAM_NUM) is non-null. This is called by check_function_nonnull
8962 via check_function_arguments_recurse. */
8964 static void
8967 {
8968 /* Just skip checking the argument if it's not a pointer. This can
8969 happen if the "nonnull" attribute was given without an operand
8970 list (which means to check every pointer argument). */
8978 }
8980 /* Helper for nonnull attribute handling; fetch the operand number
8981 from the attribute argument list. */
8983 static bool
8985 {
8986 /* Verify the arg number is a small constant. */
8988 {
8991 }
8992 else
8994 }
8996 /* Handle a "nothrow" attribute; arguments as in
8997 struct attribute_spec.handler. */
8999 static tree
9002 {
9005 /* ??? TODO: Support types. */
9006 else
9007 {
9010 }
9013 }
9015 /* Handle a "cleanup" attribute; arguments as in
9016 struct attribute_spec.handler. */
9018 static tree
9021 {
9025 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9026 for global destructors in C++. This requires infrastructure that
9027 we don't have generically at the moment. It's also not a feature
9028 we'd be missing too much, since we do have attribute constructor. */
9030 {
9034 }
9036 /* Verify that the argument is a function in scope. */
9037 /* ??? We could support pointers to functions here as well, if
9038 that was considered desirable. */
9041 {
9045 }
9048 {
9052 }
9054 /* That the function has proper type is checked with the
9055 eventual call to build_function_call. */
9058 }
9060 /* Handle a "warn_unused_result" attribute. No special handling. */
9062 static tree
9066 {
9067 /* Ignore the attribute for functions not returning any value. */
9069 {
9072 }
9075 }
9077 /* Handle a "sentinel" attribute. */
9079 static tree
9082 {
9084 {
9088 }
9089 else
9090 {
9092 {
9096 }
9097 }
9100 {
9108 {
9112 }
9113 else
9114 {
9116 {
9120 }
9121 }
9122 }
9125 }
9127 /* Handle a "type_generic" attribute. */
9129 static tree
9133 {
9134 /* Ensure we have a function type. */
9137 /* Ensure we have a variadic function. */
9141 }
9143 /* Handle a "target" attribute. */
9145 static tree
9148 {
9149 /* Ensure we have a function type. */
9151 {
9154 }
9156 flags))
9160 }
9162 /* Arguments being collected for optimization. */
9167 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9168 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9169 false for #pragma GCC optimize. */
9171 bool
9173 {
9181 tree ap;
9183 /* Build up argv vector. Just in case the string is stored away, use garbage
9184 collected strings. */
9189 {
9193 {
9197 }
9200 {
9201 /* Split string into multiple substrings. */
9209 {
9216 {
9220 }
9221 else
9222 {
9225 }
9229 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9230 options. */
9232 {
9237 else
9241 }
9244 {
9247 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9248 itself is -Os, and any other switch begins with a -f. */
9254 }
9259 }
9261 }
9262 }
9272 /* Now parse the options. */
9282 /* Don't allow changing -fstrict-aliasing. */
9287 }
9289 /* For handling "optimize" attribute. arguments as in
9290 struct attribute_spec.handler. */
9292 static tree
9295 {
9296 /* Ensure we have a function type. */
9298 {
9301 }
9302 else
9303 {
9307 /* Save current options. */
9310 /* If we previously had some optimization options, use them as the
9311 default. */
9316 /* Parse options, and update the vector. */
9321 /* Restore current options. */
9323 }
9326 }
9328 /* Handle a "no_split_stack" attribute. */
9330 static tree
9335 {
9339 {
9343 }
9345 {
9349 }
9352 }
9354 /* Handle a "returns_nonnull" attribute; arguments as in
9355 struct attribute_spec.handler. */
9357 static tree
9360 {
9361 // Even without a prototype we still have a return type we can check.
9363 {
9366 }
9368 }
9370 /* Handle a "designated_init" attribute; arguments as in
9371 struct attribute_spec.handler. */
9373 static tree
9376 {
9378 {
9381 }
9383 }
9385 \f
9386 /* Check for valid arguments being passed to a function with FNTYPE.
9387 There are NARGS arguments in the array ARGARRAY. */
9388 void
9390 {
9391 /* Check for null being passed in a pointer argument that must be
9392 non-null. We also need to do this if format checking is enabled. */
9397 /* Check for errors in format strings. */
9404 }
9406 /* Generic argument checking recursion routine. PARAM is the argument to
9407 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9408 once the argument is resolved. CTX is context for the callback. */
9409 void
9414 {
9418 {
9419 /* Strip coercion. */
9423 }
9426 {
9428 tree attrs;
9431 /* See if this is a call to a known internationalization function
9432 that modifies a format arg. Such a function may have multiple
9433 format_arg attributes (for example, ngettext). */
9436 attrs;
9439 {
9440 tree inner_arg;
9441 tree format_num_expr;
9444 call_expr_arg_iterator iter;
9446 /* Extract the argument number, which was previously checked
9447 to be valid. */
9456 {
9461 }
9462 }
9464 /* If we found a format_arg attribute and did a recursive check,
9465 we are done with checking this argument. Otherwise, we continue
9466 and this will be considered a non-literal. */
9469 }
9472 {
9473 /* Check both halves of the conditional expression. */
9479 }
9482 }
9484 /* Checks for a builtin function FNDECL that the number of arguments
9485 NARGS against the required number REQUIRED and issues an error if
9486 there is a mismatch. Returns true if the number of arguments is
9487 correct, otherwise false. */
9489 static bool
9491 {
9493 {
9497 }
9499 {
9503 }
9505 }
9507 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9508 Returns false if there was an error, otherwise true. */
9510 bool
9512 {
9518 {
9528 {
9530 {
9534 }
9536 }
9546 {
9553 {
9557 }
9559 }
9564 {
9569 {
9573 }
9576 {
9578 fndecl);
9580 }
9582 }
9587 {
9589 {
9592 }
9594 }
9599 }
9600 }
9602 /* Function to help qsort sort FIELD_DECLs by name order. */
9604 int
9606 {
9611 /* A nontype is "greater" than a type. */
9620 }
9623 gt_pointer_operator new_value;
9627 /* This routine compares two fields like field_decl_cmp but using the
9628 pointer operator in resort_data. */
9630 static int
9632 {
9637 /* A nontype is "greater" than a type. */
9643 {
9650 }
9652 }
9654 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9656 void
9659 gt_pointer_operator new_value,
9661 {
9666 resort_field_decl_cmp);
9667 }
9669 /* Subroutine of c_parse_error.
9670 Return the result of concatenating LHS and RHS. RHS is really
9671 a string literal, its first character is indicated by RHS_START and
9672 RHS_SIZE is its length (including the terminating NUL character).
9674 The caller is responsible for deleting the returned pointer. */
9678 {
9684 }
9686 /* Issue the error given by GMSGID, indicating that it occurred before
9687 TOKEN, which had the associated VALUE. */
9689 void
9692 {
9693 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9703 {
9708 {
9721 }
9725 else
9731 }
9753 {
9758 }
9766 {
9771 }
9772 else
9776 {
9779 }
9780 #undef catenate_messages
9781 }
9783 /* Return the gcc option code associated with the reason for a cpp
9784 message, or 0 if none. */
9786 static int
9788 {
9792 {
9795 }
9797 }
9799 /* Callback from cpp_error for PFILE to print diagnostics from the
9800 preprocessor. The diagnostic is of type LEVEL, with REASON set
9801 to the reason code if LEVEL is represents a warning, at location
9802 LOCATION unless this is after lexing and the compiler's location
9803 should be used instead, with column number possibly overridden by
9804 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9805 the arguments. Returns true if a diagnostic was emitted, false
9806 otherwise. */
9808 bool
9812 {
9813 diagnostic_info diagnostic;
9814 diagnostic_t dlevel;
9819 {
9824 /* Fall through. */
9849 }
9862 }
9864 /* Convert a character from the host to the target execution character
9865 set. cpplib handles this, mostly. */
9867 HOST_WIDE_INT
9869 {
9870 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9871 zero-extended under -fno-signed-char. cpplib insists that characters
9872 and character constants are always unsigned. Hence we must convert
9873 back and forth. */
9881 else
9883 }
9885 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9886 references with an INDIRECT_REF of a constant at the bottom; much like the
9887 traditional rendering of offsetof as a macro. Return the folded result. */
9889 tree
9891 {
9895 {
9911 {
9914 }
9924 {
9928 }
9941 /* Check if the offset goes beyond the upper bound of the array. */
9943 {
9949 {
9953 {
9954 tree v;
9961 {
9969 }
9970 /* Don't warn if the array might be considered a poor
9971 man's flexible array member with a very permissive
9972 definition thereof. */
9976 "index %E denotes an offset "
9979 }
9980 }
9981 }
9988 /* Handle static members of volatile structs. */
9995 }
9998 }
10000 /* Likewise, but convert it to the return type of offsetof. */
10002 tree
10004 {
10006 }
10008 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10009 expression, because B will always be true. */
10011 void
10013 {
10016 "the omitted middle operand in ?: will always be %<true%>, "
10018 }
10020 /* Give an error for storing into ARG, which is 'const'. USE indicates
10021 how ARG was being used. */
10023 void
10025 {
10028 /* Using this macro rather than (for example) arrays of messages
10029 ensures that all the format strings are checked at compile
10030 time. */
10031 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10032 : (use == lv_increment ? (I) \
10033 : (use == lv_decrement ? (D) : (AS))))
10035 {
10046 else
10052 }
10058 arg);
10064 arg);
10066 {
10076 arg);
10077 }
10083 arg);
10084 else
10089 arg);
10090 }
10092 /* Print an error message for an invalid lvalue. USE says
10093 how the lvalue is being used and so selects the error message. LOC
10094 is the location for the error. */
10096 void
10098 {
10100 {
10118 }
10119 }
10121 /* Print an error message for an invalid indirection of type TYPE.
10122 ERRSTRING is the name of the operator for the indirection. */
10124 void
10126 {
10128 {
10136 type);
10141 type);
10146 type);
10151 type);
10156 type);
10160 }
10161 }
10162 \f
10163 /* *PTYPE is an incomplete array. Complete it with a domain based on
10164 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10165 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10166 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10168 int
10170 {
10178 {
10180 {
10181 int eltsize
10184 }
10186 {
10190 {
10194 }
10195 else
10196 {
10197 tree curindex;
10208 {
10212 else
10213 {
10215 {
10216 /* Since we treat size types now as ordinary
10217 unsigned types, we need an explicit overflow
10218 check. */
10222 }
10224 size_one_node);
10225 }
10228 }
10230 {
10234 }
10235 }
10236 }
10237 else
10238 {
10239 /* Make an error message unless that happened already. */
10242 }
10243 }
10244 else
10245 {
10249 }
10256 else
10259 /* Using build_distinct_type_copy and modifying things afterward instead
10260 of using build_array_type to create a new type preserves all of the
10261 TYPE_LANG_FLAG_? bits that the front end may have set. */
10269 /* Make sure we have the canonical MAIN_TYPE. */
10272 hashcode);
10275 /* Fix the canonical type. */
10285 else
10290 else
10296 {
10298 /* If we proceed with the array type as it is, we'll eventually
10299 crash in tree_to_[su]hwi(). */
10301 }
10305 }
10307 /* Like c_mark_addressable but don't check register qualifier. */
10308 void
10310 {
10316 }
10319 \f
10320 /* Used to help initialize the builtin-types.def table. When a type of
10321 the correct size doesn't exist, use error_mark_node instead of NULL.
10322 The later results in segfaults even when a decl using the type doesn't
10323 get invoked. */
10325 tree
10327 {
10330 }
10332 /* A helper function for resolve_overloaded_builtin in resolving the
10333 overloaded __sync_ builtins. Returns a positive power of 2 if the
10334 first operand of PARAMS is a pointer to a supported data type.
10335 Returns 0 if an error is encountered. */
10337 static int
10339 {
10340 tree type;
10344 {
10347 }
10351 {
10352 /* Force array-to-pointer decay for C++. */
10356 }
10368 incompatible:
10371 }
10373 /* A helper function for resolve_overloaded_builtin. Adds casts to
10374 PARAMS to make arguments match up with those of FUNCTION. Drops
10375 the variadic arguments at the end. Returns false if some error
10376 was encountered; true on success. */
10378 static bool
10381 {
10382 function_args_iterator iter;
10383 tree ptype;
10387 /* We've declared the implementation functions to use "volatile void *"
10388 as the pointer parameter, so we shouldn't get any complaints from the
10389 call to check_function_arguments what ever type the user used. */
10394 /* For the rest of the values, we need to cast these to FTYPE, so that we
10395 don't get warnings for passing pointer types, etc. */
10398 {
10402 /* XXX void_type_node belies the abstraction. */
10408 {
10411 }
10413 /* Only convert parameters if arg_type is unsigned integer type with
10414 new format sync routines, i.e. don't attempt to convert pointer
10415 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10416 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10417 kinds). */
10419 {
10420 /* Ideally for the first conversion we'd use convert_for_assignment
10421 so that we get warnings for anything that doesn't match the pointer
10422 type. This isn't portable across the C and C++ front ends atm. */
10427 }
10430 }
10432 /* __atomic routines are not variadic. */
10434 {
10437 }
10439 /* The definition of these primitives is variadic, with the remaining
10440 being "an optional list of variables protected by the memory barrier".
10441 No clue what that's supposed to mean, precisely, but we consider all
10442 call-clobbered variables to be protected so we're safe. */
10446 }
10448 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10449 RESULT to make it match the type of the first pointer argument in
10450 PARAMS. */
10452 static tree
10454 {
10459 /* New format doesn't require casting unless the types are the same size. */
10462 else
10464 }
10466 /* This function verifies the PARAMS to generic atomic FUNCTION.
10467 It returns the size if all the parameters are the same size, otherwise
10468 0 is returned if the parameters are invalid. */
10470 static int
10473 {
10478 tree type_0;
10480 /* Determine the parameter makeup. */
10482 {
10498 }
10501 {
10504 }
10506 /* Get type of first parameter, and determine its size. */
10509 {
10510 /* Force array-to-pointer decay for C++. */
10514 }
10516 {
10518 function);
10520 }
10522 /* Types must be compile time constant sizes. */
10524 {
10527 function);
10529 }
10533 /* Zero size objects are not allowed. */
10535 {
10538 function);
10540 }
10542 /* Check each other parameter is a pointer and the same size. */
10544 {
10547 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10551 {
10553 function);
10555 }
10559 {
10561 function);
10563 }
10564 }
10566 /* Check memory model parameters for validity. */
10568 {
10571 {
10574 {
10577 function);
10578 }
10579 }
10580 else
10582 {
10584 function);
10586 }
10587 }
10590 }
10593 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10594 at the beginning of the parameter list PARAMS representing the size of the
10595 objects. This is to match the library ABI requirement. LOC is the location
10596 of the function call.
10597 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10598 returned to allow the external call to be constructed. */
10600 static tree
10603 {
10604 tree size_node;
10606 /* Insert a SIZE_T parameter as the first param. If there isn't
10607 enough space, allocate a new vector and recursively re-build with that. */
10609 {
10612 tree f;
10622 }
10624 /* Add the size parameter and leave as a function call for processing. */
10628 }
10631 /* Return whether atomic operations for naturally aligned N-byte
10632 arguments are supported, whether inline or through libatomic. */
10633 static bool
10635 {
10637 {
10649 }
10650 }
10652 /* This will process an __atomic_exchange function call, determine whether it
10653 needs to be mapped to the _N variation, or turned into a library call.
10654 LOC is the location of the builtin call.
10655 FUNCTION is the DECL that has been invoked;
10656 PARAMS is the argument list for the call. The return value is non-null
10657 TRUE is returned if it is translated into the proper format for a call to the
10658 external library, and NEW_RETURN is set the tree for that function.
10659 FALSE is returned if processing for the _N variation is required, and
10660 NEW_RETURN is set to the the return value the result is copied into. */
10661 static bool
10664 {
10669 /* Size of 0 is an error condition. */
10671 {
10674 }
10676 /* If not a lock-free size, change to the library generic format. */
10678 {
10681 }
10683 /* Otherwise there is a lockfree match, transform the call from:
10684 void fn(T* mem, T* desired, T* return, model)
10685 into
10686 *return = (T) (fn (In* mem, (In) *desired, model)) */
10693 /* Create pointer to appropriate size. */
10697 /* Convert object pointer to required type. */
10700 /* Convert new value to required type, and dereference it. */
10705 /* Move memory model to the 3rd position, and end param list. */
10709 /* Convert return pointer and dereference it for later assignment. */
10713 }
10716 /* This will process an __atomic_compare_exchange function call, determine
10717 whether it needs to be mapped to the _N variation, or turned into a lib call.
10718 LOC is the location of the builtin call.
10719 FUNCTION is the DECL that has been invoked;
10720 PARAMS is the argument list for the call. The return value is non-null
10721 TRUE is returned if it is translated into the proper format for a call to the
10722 external library, and NEW_RETURN is set the tree for that function.
10723 FALSE is returned if processing for the _N variation is required. */
10725 static bool
10729 {
10734 /* Size of 0 is an error condition. */
10736 {
10739 }
10741 /* If not a lock-free size, change to the library generic format. */
10743 {
10744 /* The library generic format does not have the weak parameter, so
10745 remove it from the param list. Since a parameter has been removed,
10746 we can be sure that there is room for the SIZE_T parameter, meaning
10747 there will not be a recursive rebuilding of the parameter list, so
10748 there is no danger this will be done twice. */
10750 {
10754 }
10757 }
10759 /* Otherwise, there is a match, so the call needs to be transformed from:
10760 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10761 into
10762 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10768 /* Create pointer to appropriate size. */
10772 /* Convert object pointer to required type. */
10776 /* Convert expected pointer to required type. */
10780 /* Convert desired value to required type, and dereference it. */
10785 /* The rest of the parameters are fine. NULL means no special return value
10786 processing.*/
10789 }
10792 /* This will process an __atomic_load function call, determine whether it
10793 needs to be mapped to the _N variation, or turned into a library call.
10794 LOC is the location of the builtin call.
10795 FUNCTION is the DECL that has been invoked;
10796 PARAMS is the argument list for the call. The return value is non-null
10797 TRUE is returned if it is translated into the proper format for a call to the
10798 external library, and NEW_RETURN is set the tree for that function.
10799 FALSE is returned if processing for the _N variation is required, and
10800 NEW_RETURN is set to the the return value the result is copied into. */
10802 static bool
10805 {
10810 /* Size of 0 is an error condition. */
10812 {
10815 }
10817 /* If not a lock-free size, change to the library generic format. */
10819 {
10822 }
10824 /* Otherwise, there is a match, so the call needs to be transformed from:
10825 void fn(T* mem, T* return, model)
10826 into
10827 *return = (T) (fn ((In *) mem, model)) */
10833 /* Create pointer to appropriate size. */
10837 /* Convert object pointer to required type. */
10841 /* Move memory model to the 2nd position, and end param list. */
10845 /* Convert return pointer and dereference it for later assignment. */
10849 }
10852 /* This will process an __atomic_store function call, determine whether it
10853 needs to be mapped to the _N variation, or turned into a library call.
10854 LOC is the location of the builtin call.
10855 FUNCTION is the DECL that has been invoked;
10856 PARAMS is the argument list for the call. The return value is non-null
10857 TRUE is returned if it is translated into the proper format for a call to the
10858 external library, and NEW_RETURN is set the tree for that function.
10859 FALSE is returned if processing for the _N variation is required, and
10860 NEW_RETURN is set to the the return value the result is copied into. */
10862 static bool
10865 {
10870 /* Size of 0 is an error condition. */
10872 {
10875 }
10877 /* If not a lock-free size, change to the library generic format. */
10879 {
10882 }
10884 /* Otherwise, there is a match, so the call needs to be transformed from:
10885 void fn(T* mem, T* value, model)
10886 into
10887 fn ((In *) mem, (In) *value, model) */
10892 /* Create pointer to appropriate size. */
10896 /* Convert object pointer to required type. */
10900 /* Convert new value to required type, and dereference it. */
10905 /* The memory model is in the right spot already. Return is void. */
10909 }
10912 /* Some builtin functions are placeholders for other expressions. This
10913 function should be called immediately after parsing the call expression
10914 before surrounding code has committed to the type of the expression.
10916 LOC is the location of the builtin call.
10918 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10919 PARAMS is the argument list for the call. The return value is non-null
10920 when expansion is complete, and null if normal processing should
10921 continue. */
10923 tree
10926 {
10932 {
10938 else
10942 }
10944 /* Handle BUILT_IN_NORMAL here. */
10946 {
10951 {
10952 /* Handle these 4 together so that they can fall through to the next
10953 case if the call is transformed to an _N variant. */
10955 {
10957 {
10961 /* Change to the _N variant. */
10964 }
10967 {
10969 params,
10972 /* Change to the _N variant. */
10975 }
10977 {
10981 /* Change to the _N variant. */
10984 }
10986 {
10990 /* Change to the _N variant. */
10993 }
10996 }
10997 /* Fallthrough to the normal processing. */
10998 }
11015 {
11017 /* Fallthru for parameter processing. */
11018 }
11035 {
11046 orig_format))
11051 NULL);
11059 /* If new_return is set, assign function to that expr and cast the
11060 result to void since the generic interface returned void. */
11062 {
11063 /* Cast function result from I{1,2,4,8,16} to the required type. */
11066 result);
11070 }
11072 }
11076 }
11077 }
11079 /* vector_types_compatible_elements_p is used in type checks of vectors
11080 values used as operands of binary operators. Where it returns true, and
11081 the other checks of the caller succeed (being vector types in he first
11082 place, and matching number of elements), we can just treat the types
11083 as essentially the same.
11084 Contrast with vector_targets_convertible_p, which is used for vector
11085 pointer types, and vector_types_convertible_p, which will allow
11086 language-specific matches under the control of flag_lax_vector_conversions,
11087 and might still require a conversion. */
11088 /* True if vector types T1 and T2 can be inputs to the same binary
11089 operator without conversion.
11090 We don't check the overall vector size here because some of our callers
11091 want to give different error messages when the vectors are compatible
11092 except for the element count. */
11094 bool
11096 {
11109 /* Equality works here because c_common_signed_type uses
11110 TYPE_MAIN_VARIANT. */
11118 }
11120 /* Check for missing format attributes on function pointers. LTYPE is
11121 the new type or left-hand side type. RTYPE is the old type or
11122 right-hand side type. Returns TRUE if LTYPE is missing the desired
11123 attribute. */
11125 bool
11127 {
11129 tree ra;
11135 {
11136 tree la;
11141 }
11142 else
11144 }
11146 /* Subscripting with type char is likely to lose on a machine where
11147 chars are signed. So warn on any machine, but optionally. Don't
11148 warn for unsigned char since that type is safe. Don't warn for
11149 signed char because anyone who uses that must have done so
11150 deliberately. Furthermore, we reduce the false positive load by
11151 warning only for non-constant value of type char. */
11153 void
11155 {
11159 }
11161 /* Implement -Wparentheses for the unexpected C precedence rules, to
11162 cover cases like x + y << z which readers are likely to
11163 misinterpret. We have seen an expression in which CODE is a binary
11164 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11165 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11166 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11167 expression was not formed using a binary or unary operator, or it
11168 was enclosed in parentheses. */
11170 void
11174 {
11178 /* This macro tests that the expression ARG with original tree code
11179 CODE appears to be a boolean expression. or the result of folding a
11180 boolean expression. */
11181 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11182 (truth_value_p (TREE_CODE (ARG)) \
11183 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11185 || ((CODE) != INTEGER_CST \
11186 && (integer_onep (ARG) || integer_zerop (ARG))))
11189 {
11238 /* Check cases like x|y==z */
11245 /* Check cases like !x | y */
11249 "suggest parentheses around operand of "
11262 /* Check cases like x^y==z */
11284 /* Check cases like x&y==z */
11291 /* Check cases like !x & y */
11295 "suggest parentheses around operand of "
11318 {
11323 "comparisons like %<X<=Y<=Z%> do not "
11329 "comparisons like %<X<=Y<=Z%> do not "
11331 }
11333 }
11334 #undef NOT_A_BOOLEAN_EXPR_P
11335 }
11337 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11339 void
11341 {
11343 {
11346 else
11348 }
11349 }
11351 /* Warn for division by zero according to the value of DIVISOR. LOC
11352 is the location of the division operator. */
11354 void
11356 {
11357 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11358 about division by zero. Do not issue a warning if DIVISOR has a
11359 floating-point type, since we consider 0.0/0.0 a valid way of
11360 generating a NaN. */
11364 }
11366 /* Subroutine of build_binary_op. Give warnings for comparisons
11367 between signed and unsigned quantities that may fail. Do the
11368 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11369 so that casts will be considered, but default promotions won't
11370 be.
11372 LOCATION is the location of the comparison operator.
11374 The arguments of this function map directly to local variables
11375 of build_binary_op. */
11377 void
11382 {
11387 /* In C++, check for comparison of different enum types. */
11393 {
11397 }
11399 /* Do not warn if the comparison is being done in a signed type,
11400 since the signed type will only be chosen if it can represent
11401 all the values of the unsigned type. */
11404 /* Do not warn if both operands are unsigned. */
11407 else
11408 {
11414 else
11422 /* Do not warn if the signed quantity is an unsuffixed integer
11423 literal (or some static constant expression involving such
11424 literals or a conditional expression involving such literals)
11425 and it is non-negative. */
11428 /* Do not warn if the comparison is an equality operation, the
11429 unsigned quantity is an integral constant, and it would fit
11430 in the result if the result were signed. */
11435 /* In C, do not warn if the unsigned quantity is an enumeration
11436 constant and its maximum value would fit in the result if the
11437 result were signed. */
11443 else
11445 OPT_Wsign_compare,
11447 }
11449 /* Warn if two unsigned values are being compared in a size larger
11450 than their original size, and one (and only one) is the result of
11451 a `~' operator. This comparison will always fail.
11453 Also warn if one operand is a constant, and the constant does not
11454 have all bits set that are set in the ~ operand when it is
11455 extended. */
11462 {
11469 {
11470 tree primop;
11476 {
11480 }
11481 else
11482 {
11486 }
11491 {
11494 {
11498 else
11501 }
11502 }
11503 }
11511 }
11512 }
11514 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11515 type via c_common_type. If -Wdouble-promotion is in use, and the
11516 conditions for warning have been met, issue a warning. GMSGID is
11517 the warning message. It must have two %T specifiers for the type
11518 that was converted (generally "float") and the type to which it was
11519 converted (generally "double), respectively. LOC is the location
11520 to which the awrning should refer. */
11522 void
11525 {
11526 tree source_type;
11530 /* If the conversion will not occur at run-time, there is no need to
11531 warn about it. */
11543 else
11546 }
11548 /* Setup a TYPE_DECL node as a typedef representation.
11550 X is a TYPE_DECL for a typedef statement. Create a brand new
11551 ..._TYPE node (which will be just a variant of the existing
11552 ..._TYPE node with identical properties) and then install X
11553 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11555 The whole point here is to end up with a situation where each
11556 and every ..._TYPE node the compiler creates will be uniquely
11557 associated with AT MOST one node representing a typedef name.
11558 This way, even though the compiler substitutes corresponding
11559 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11560 early on, later parts of the compiler can always do the reverse
11561 translation and get back the corresponding typedef name. For
11562 example, given:
11564 typedef struct S MY_TYPE;
11565 MY_TYPE object;
11567 Later parts of the compiler might only know that `object' was of
11568 type `struct S' if it were not for code just below. With this
11569 code however, later parts of the compiler see something like:
11571 struct S' == struct S
11572 typedef struct S' MY_TYPE;
11573 struct S' object;
11575 And they can then deduce (from the node for type struct S') that
11576 the original object declaration was:
11578 MY_TYPE object;
11580 Being able to do this is important for proper support of protoize,
11581 and also for generating precise symbolic debugging information
11582 which takes full account of the programmer's (typedef) vocabulary.
11584 Obviously, we don't want to generate a duplicate ..._TYPE node if
11585 the TYPE_DECL node that we are now processing really represents a
11586 standard built-in type. */
11588 void
11590 {
11594 {
11597 }
11600 {
11608 }
11609 }
11611 /* Record the types used by the current global variable declaration
11612 being parsed, so that we can decide later to emit their debug info.
11613 Those types are in types_used_by_cur_var_decl, and we are going to
11614 store them in the types_used_by_vars_hash hash table.
11615 DECL is the declaration of the global variable that has been parsed. */
11617 void
11619 {
11623 {
11626 }
11627 }
11629 /* If DECL is a typedef that is declared in the current function,
11630 record it for the purpose of -Wunused-local-typedefs. */
11632 void
11634 {
11639 /* if this is not a locally defined typedef then we are not
11640 interested. */
11647 }
11649 /* If T is a TYPE_DECL declared locally, mark it as used. */
11651 void
11653 {
11658 }
11660 /* Warn if there are some unused locally defined typedefs in the
11661 current function. */
11663 void
11665 {
11667 tree decl;
11668 /* The number of times we have emitted -Wunused-local-typedefs
11669 warnings. If this is different from errorcount, that means some
11670 unrelated errors have been issued. In which case, we'll avoid
11671 emitting "unused-local-typedefs" warnings. */
11683 {
11687 OPT_Wunused_local_typedefs,
11690 }
11693 }
11695 /* Warn about boolean expression compared with an integer value different
11696 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11697 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11698 are the operands of the comparison. The caller must ensure that
11699 either operand is a boolean expression. */
11701 void
11703 tree op1)
11704 {
11714 {
11722 else
11725 }
11726 }
11728 /* The C and C++ parsers both use vectors to hold function arguments.
11729 For efficiency, we keep a cache of unused vectors. This is the
11730 cache. */
11735 /* Return a new vector from the cache. If the cache is empty,
11736 allocate a new vector. These vectors are GC'ed, so it is OK if the
11737 pointer is not released.. */
11741 {
11744 else
11745 {
11746 /* Passing 0 to vec::alloc returns NULL, and our callers require
11747 that we always return a non-NULL value. The vector code uses
11748 4 when growing a NULL vector, so we do too. */
11752 }
11753 }
11755 /* Release a vector of trees back to the cache. */
11757 void
11759 {
11761 {
11764 }
11765 }
11767 /* Get a new tree vector holding a single tree. */
11771 {
11775 }
11777 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11781 {
11786 }
11788 /* Get a new tree vector which is a copy of an existing one. */
11792 {
11795 tree t;
11802 }
11804 /* Return true if KEYWORD starts a type specifier. */
11806 bool
11808 {
11810 {
11844 }
11845 }
11847 /* Return true if KEYWORD names a type qualifier. */
11849 bool
11851 {
11853 {
11861 }
11862 }
11864 /* Return true if KEYWORD names a storage class specifier.
11866 RID_TYPEDEF is not included in this list despite `typedef' being
11867 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11868 such for syntactic convenience only. */
11870 bool
11872 {
11874 {
11884 }
11885 }
11887 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11889 static bool
11891 {
11893 {
11901 }
11902 }
11904 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11905 declaration-specifier (C99 6.7). */
11907 bool
11909 {
11916 {
11923 }
11924 }
11926 /* Initialize language-specific-bits of tree_contains_struct. */
11928 void
11930 {
11934 }
11936 /* Build a user-defined numeric literal out of an integer constant type VALUE
11937 with identifier SUFFIX. */
11939 tree
11942 {
11949 }
11951 /* For vector[index], convert the vector to a
11952 pointer of the underlying type. */
11953 void
11956 {
11958 {
11960 tree type1;
11973 {
11974 /* If the original vector isn't declared may_alias and it
11975 isn't a bare vector look if the subscripting would
11976 alias the vector we subscript, and if not, force ref-all. */
11982 }
11986 }
11987 }
11989 /* Determine which of the operands, if any, is a scalar that needs to be
11990 converted to a vector, for the range of operations. */
11991 enum stv_conv
11994 {
12003 {
12004 /* Most GENERIC binary expressions require homogeneous arguments.
12005 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12006 argument that is a vector and a second one that is a scalar, so
12007 we never return stv_secondarg for them. */
12012 {
12014 {
12019 }
12020 else
12022 }
12029 /* ... fall through ... */
12050 /* What about UNLT_EXPR? */
12052 {
12053 tree tmp;
12055 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12058 }
12062 {
12064 {
12069 }
12071 }
12073 /* Allow integer --> real conversion if safe. */
12077 {
12079 {
12084 }
12086 }
12089 }
12092 }
12094 /* Return true iff ALIGN is an integral constant that is a fundamental
12095 alignment, as defined by [basic.align] in the c++-11
12096 specifications.
12098 That is:
12100 [A fundamental alignment is represented by an alignment less than or
12101 equal to the greatest alignment supported by the implementation
12102 in all contexts, which is equal to
12103 alignof(max_align_t)]. */
12105 bool
12107 {
12110 }
12112 /* Return true if T is a pointer to a zero-sized aggregate. */
12114 bool
12116 {
12121 }