| blob | 39be9569395588996a147ccfc088a807726cb85e |
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/>. */
56 /* The following symbols are subsumed in the c_global_trees array, and
57 listed here individually for documentation purposes.
59 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
61 tree short_integer_type_node;
62 tree long_integer_type_node;
63 tree long_long_integer_type_node;
64 tree int128_integer_type_node;
66 tree short_unsigned_type_node;
67 tree long_unsigned_type_node;
68 tree long_long_unsigned_type_node;
69 tree int128_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
79 tree wchar_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
84 tree float_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
97 tree intQI_type_node;
98 tree intHI_type_node;
99 tree intSI_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
146 tree void_list_node;
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
160 */
163 \f
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
179 /* Nonzero means pass #include lines through to the output. */
183 /* Nonzero means process PCH files while preprocessing. */
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 user's namespace. */
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
230 /* Tells the compiler what is the constant string class for ObjC. */
235 /* C++ language option variables. */
238 /* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
243 /* The C++ dialect being used. C++98 is the default. */
247 /* Maximum template instantiation depth. This limit exists to limit the
248 time it takes to notice excessively recursive template instantiations.
250 The default is lower than the 1024 recommended by the C++0x standard
251 because G++ runs out of stack before 1024 with highly recursive template
252 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
256 /* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
262 /* Nonzero means don't warn about problems that occur when the code is
263 executed. */
266 /* Whether we are building a boolean conversion inside
267 convert_for_assignment, or some other late binary operation. If
268 build_binary_op is called for C (from code shared by C and C++) in
269 this case, then the operands have already been folded and the
270 result will not be folded again, so C_MAYBE_CONST_EXPR should not
271 be generated. */
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
278 /* Information about how a function name is generated. */
279 struct fname_var_t
280 {
284 };
286 /* The three ways of getting then name of the current function. */
289 {
290 /* C99 compliant __func__, must be first. */
292 /* GCC __FUNCTION__ compliant. */
294 /* GCC __PRETTY_FUNCTION__ compliant. */
297 };
299 /* Global visibility options. */
391 /* Reserved words. The third field is a mask: keywords are disabled
392 if they match the mask.
394 Masks for languages:
395 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
396 C --std=c99: D_CXXONLY | D_OBJC
397 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
398 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
399 C++ --std=c0x: D_CONLY | D_OBJC
400 ObjC++ is like C++ except that D_OBJC is not set
402 If -fno-asm is used, D_ASM is added to the mask. If
403 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
404 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
405 In C with -Wc++-compat, we warn if D_CXXWARN is set.
407 Note the complication of the D_CXX_OBJC keywords. These are
408 reserved words such as 'class'. In C++, 'class' is a reserved
409 word. In Objective-C++ it is too. In Objective-C, it is a
410 reserved word too, but only if it follows an '@' sign.
411 */
413 {
575 /* These Objective-C keywords are recognized only immediately after
576 an '@'. */
593 /* These are recognized only in protocol-qualifier context
594 (see above) */
601 /* These are recognized inside a property attribute list */
610 };
615 /* Table of machine-independent attributes common to all C-like languages. */
617 {
618 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
619 affects_type_identity } */
626 /* FIXME: logically, noreturn attributes should be listed as
627 "false, true, true" and apply to function types. But implementing this
628 would require all the places in the compiler that use TREE_THIS_VOLATILE
629 on a decl to identify non-returning functions to be located and fixed
630 to check the function type instead. */
655 /* The same comments as for noreturn attributes apply to const ones. */
679 handle_no_instrument_function_attribute,
697 /* ??? These two attributes didn't make the transition from the
698 Intel language document to the multi-vendor language document. */
703 /* For internal use (marking of builtins) only. The name contains space
704 to prevent its usage in source code. */
726 /* For internal use (marking of builtins) only. The name contains space
727 to prevent its usage in source code. */
738 handle_no_address_safety_analysis_attribute,
741 handle_no_sanitize_address_attribute,
744 handle_no_sanitize_undefined_attribute,
754 /* For internal use only. The leading '*' both prevents its usage in
755 source code and signals that it may be overridden by machine tables. */
760 /* For internal use (marking of builtins and runtime functions) only.
761 The name contains space to prevent its usage in source code. */
781 };
783 /* Give the specifications for the format attributes, used by C and all
784 descendants. */
787 {
788 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
789 affects_type_identity } */
795 };
797 /* Return identifier for address space AS. */
801 {
805 }
807 /* Push current bindings for the function name VAR_DECLS. */
809 void
811 {
816 {
820 {
822 saved);
824 }
825 }
827 /* Normally they'll have been NULL, so only push if we've got a
828 stack, or they are non-NULL. */
830 saved_function_name_decls);
831 }
833 /* Finish up the current bindings, adding them into the current function's
834 statement tree. This must be done _before_ finish_stmt_tree is called.
835 If there is no current function, we must be at file scope and no statements
836 are involved. Pop the previous bindings. */
838 void
840 {
849 {
857 }
863 {
864 /* We had saved values, restore them. */
865 tree saved;
868 {
873 }
875 }
877 }
879 /* Return the text name of the current function, suitably prettified
880 by PRETTY_P. Return string must be freed by caller. */
884 {
891 {
894 }
907 {
910 }
913 }
915 /* Return the VAR_DECL for a const char array naming the current
916 function. If the VAR_DECL has not yet been created, create it
917 now. RID indicates how it should be formatted and IDENTIFIER_NODE
918 ID is its name (unfortunately C and C++ hold the RID values of
919 keywords in different places, so we can't derive RID from ID in
920 this language independent code. LOC is the location of the
921 function. */
923 tree
925 {
935 {
936 /* If a tree is built here, it would normally have the lineno of
937 the current statement. Later this tree will be moved to the
938 beginning of the function and this line number will be wrong.
939 To avoid this problem set the lineno to 0 here; that prevents
940 it from appearing in the RTL. */
941 tree stmts;
949 saved_function_name_decls
953 }
958 }
960 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
962 tree
964 {
969 /* Compute the number of elements, for the array type. */
971 {
974 }
976 {
979 }
981 {
984 }
985 else
986 {
989 }
991 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
992 limit in C++98 Annex B is very large (65536) and is not normative,
993 so we do not diagnose it (warn_overlength_strings is forced off
994 in c_common_post_options). */
996 {
1000 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1001 separate the %d from the 'C'. 'ISO' should not be
1002 translated, but it may be moved after 'C%d' in languages
1003 where modifiers follow nouns. */
1005 "string length %qd is greater than the length %qd "
1008 }
1010 /* Create the array type for the string constant. The ISO C++
1011 standard says that a string literal has type `const char[N]' or
1012 `const wchar_t[N]'. We use the same logic when invoked as a C
1013 front-end with -Wwrite-strings.
1014 ??? We should change the type of an expression depending on the
1015 state of a warning flag. We should just be warning -- see how
1016 this is handled in the C++ front-end for the deprecated implicit
1017 conversion from string literals to `char*' or `wchar_t*'.
1019 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1020 array type being the unqualified version of that type.
1021 Therefore, if we are constructing an array of const char, we must
1022 construct the matching unqualified array type first. The C front
1023 end does not require this, but it does no harm, so we do it
1024 unconditionally. */
1035 }
1036 \f
1037 /* If DISABLE is true, stop issuing warnings. This is used when
1038 parsing code that we know will not be executed. This function may
1039 be called multiple times, and works as a stack. */
1041 static void
1043 {
1045 {
1048 }
1049 }
1051 /* If ENABLE is true, reenable issuing warnings. */
1053 static void
1055 {
1057 {
1060 }
1061 }
1063 /* Fully fold EXPR, an expression that was not folded (beyond integer
1064 constant expressions and null pointer constants) when being built
1065 up. If IN_INIT, this is in a static initializer and certain
1066 changes are made to the folding done. Clear *MAYBE_CONST if
1067 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1068 expression because it contains an evaluated operator (in C99) or an
1069 operator outside of sizeof returning an integer constant (in C90)
1070 not permitted in constant expressions, or because it contains an
1071 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1072 set to true by callers before calling this function.) Return the
1073 folded expression. Function arguments have already been folded
1074 before calling this function, as have the contents of SAVE_EXPR,
1075 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1076 C_MAYBE_CONST_EXPR. */
1078 tree
1080 {
1081 tree ret;
1087 /* This function is not relevant to C++ because C++ folds while
1088 parsing, and may need changes to be correct for C++ when C++
1089 stops folding while parsing. */
1096 {
1099 }
1106 }
1108 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1109 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1110 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1111 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1112 both evaluated and unevaluated subexpressions while
1113 *MAYBE_CONST_ITSELF is carried from only evaluated
1114 subexpressions). */
1116 static tree
1119 {
1131 /* This function is not relevant to C++ because C++ folds while
1132 parsing, and may need changes to be correct for C++ when C++
1133 stops folding while parsing. */
1137 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1138 anything else not counted as an expression cannot usefully be
1139 folded further at this point. */
1145 /* Operands of variable-length expressions (function calls) have
1146 already been folded, as have __builtin_* function calls, and such
1147 expressions cannot occur in constant expressions. */
1149 {
1153 }
1156 {
1165 else
1168 }
1170 /* Assignment, increment, decrement, function call and comma
1171 operators, and statement expressions, cannot occur in constant
1172 expressions if evaluated / outside of sizeof. (Function calls
1173 were handled above, though VA_ARG_EXPR is treated like a function
1174 call here, and statement expressions are handled through
1175 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1177 {
1197 }
1199 /* Fold individual tree codes as appropriate. */
1201 {
1203 /* Any non-constancy will have been marked in a containing
1204 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1212 maybe_const_itself);
1217 {
1220 }
1229 maybe_const_itself);
1232 maybe_const_itself);
1238 {
1242 }
1284 /* Binary operations evaluating both arguments (increment and
1285 decrement are binary internally in GCC). */
1289 maybe_const_itself);
1297 /* The RHS of a MODIFY_EXPR was fully folded when building that
1298 expression for the sake of conversion warnings. */
1301 maybe_const_itself);
1305 ret = in_init
1308 else
1321 {
1332 }
1338 CASE_CONVERT:
1349 /* Unary operations. */
1352 maybe_const_itself);
1356 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1357 not prepared to deal with them if they occur in initializers. */
1365 ret = in_init
1368 else
1373 {
1377 }
1379 {
1382 CASE_CONVERT:
1383 /* Don't warn about explicit conversions. We will already
1384 have warned about suspect implicit conversions. */
1391 }
1396 /* Binary operations not necessarily evaluating both
1397 arguments. */
1404 ? truthvalue_false_node
1412 ret = in_init
1415 else
1420 && op0_const
1421 && op0_const_self
1427 && op0_const_self
1453 else
1458 && op0_const
1459 && op0_const_self
1463 && op0_const_self
1467 && op0_const
1468 && op0_const_self
1472 && op0_const_self
1478 /* Each case where an operand with excess precision may be
1479 encountered must remove the EXCESS_PRECISION_EXPR around
1480 inner operands and possibly put one around the whole
1481 expression or possibly convert to the semantic type (which
1482 c_fully_fold does); we cannot tell at this stage which is
1483 appropriate in any particular case. */
1487 /* Various codes may appear through folding built-in functions
1488 and their arguments. */
1490 }
1492 out:
1493 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1494 have been done by this point, so remove them again. */
1498 {
1502 }
1506 }
1508 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1509 return EXP. Otherwise, return either EXP or its known constant
1510 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1511 Is the BLKmode test appropriate? */
1513 tree
1515 {
1516 tree ret;
1518 /* This function is only used by C, for c_fully_fold and other
1519 optimization, and may not be correct for C++. */
1530 /* Avoid unwanted tree sharing between the initializer and current
1531 function's body where the tree can be modified e.g. by the
1532 gimplifier. */
1536 }
1538 /* Print a warning if a constant expression had overflow in folding.
1539 Invoke this function on every expression that the language
1540 requires to be a constant expression.
1541 Note the ANSI C standard says it is erroneous for a
1542 constant expression to overflow. */
1544 void
1546 {
1554 }
1556 /* The same as above but print an unconditional error. */
1557 void
1559 {
1566 }
1568 /* Print a warning if an expression had overflow in folding and its
1569 operands hadn't.
1571 Invoke this function on every expression that
1572 (1) appears in the source code, and
1573 (2) is a constant expression that overflowed, and
1574 (3) is not already checked by convert_and_check;
1575 however, do not invoke this function on operands of explicit casts
1576 or when the expression is the result of an operator and any operand
1577 already overflowed. */
1579 void
1581 {
1586 {
1615 }
1616 }
1618 /* Warn about uses of logical || / && operator in a context where it
1619 is likely that the bitwise equivalent was intended by the
1620 programmer. We have seen an expression in which CODE is a binary
1621 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1622 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1623 void
1627 {
1639 /* Warn if &&/|| are being used in a context where it is
1640 likely that the bitwise equivalent was intended by the
1641 programmer. That is, an expression such as op && MASK
1642 where op should not be any boolean expression, nor a
1643 constant, and mask seems to be a non-boolean integer constant. */
1651 {
1655 else
1660 }
1662 /* We do not warn for constants because they are typical of macro
1663 expansions that test for features. */
1667 /* This warning only makes sense with logical operands. */
1675 /* We first test whether either side separately is trivially true
1676 (with OR) or trivially false (with AND). If so, do not warn.
1677 This is a common idiom for testing ranges of data types in
1678 portable code. */
1685 /* If this is an OR operation, invert both sides; now, the result
1686 should be always false to get a warning. */
1700 /* If this is an OR operation, invert both sides; now, the result
1701 should be always false to get a warning. */
1709 /* If both expressions have the same operand, if we can merge the
1710 ranges, and if the range test is always false, then warn. */
1717 {
1720 "logical %<or%> "
1722 else
1724 "logical %<and%> "
1726 }
1727 }
1729 /* Warn about logical not used on the left hand side operand of a comparison.
1730 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1731 Do not warn if RHS is of a boolean type. */
1733 void
1735 tree rhs)
1736 {
1743 "logical not is only applied to the left hand side of "
1745 }
1747 /* Warn if EXP contains any computations whose results are not used.
1748 Return true if a warning is printed; false otherwise. LOCUS is the
1749 (potential) location of the expression. */
1751 bool
1753 {
1754 restart:
1758 /* Don't warn about void constructs. This includes casting to void,
1759 void function calls, and statement expressions with a final cast
1760 to void. */
1768 {
1784 /* For a binding, warn if no side effect within it. */
1796 /* In && or ||, warn if 2nd operand has no side effect. */
1803 /* Let people do `(foo (), 0)' without a warning. */
1810 /* If this is an expression with side effects, don't warn; this
1811 case commonly appears in macro expansions. */
1817 /* Don't warn about automatic dereferencing of references, since
1818 the user cannot control it. */
1820 {
1823 }
1824 /* Fall through. */
1827 /* Referencing a volatile value is a side effect, so don't warn. */
1832 /* If this is an expression which has no operands, there is no value
1833 to be unused. There are no such language-independent codes,
1834 but front ends may define such. */
1838 warn:
1840 }
1841 }
1844 /* Print a warning about casts that might indicate violation
1845 of strict aliasing rules if -Wstrict-aliasing is used and
1846 strict aliasing mode is in effect. OTYPE is the original
1847 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1849 bool
1851 {
1852 /* Strip pointer conversion chains and get to the correct original type. */
1860 /* If the type we are casting to is a ref-all pointer
1861 dereferencing it is always valid. */
1868 {
1869 /* Casting the address of an object to non void pointer. Warn
1870 if the cast breaks type based aliasing. */
1872 {
1876 }
1877 else
1878 {
1879 /* warn_strict_aliasing >= 3. This includes the default (3).
1880 Only warn if the cast is dereferenced immediately. */
1881 alias_set_type set1 =
1887 {
1891 }
1894 {
1898 }
1899 }
1900 }
1901 else
1903 {
1904 /* At this level, warn for any conversions, even if an address is
1905 not taken in the same statement. This will likely produce many
1906 false positives, but could be useful to pinpoint problems that
1907 are not revealed at higher levels. */
1912 {
1916 }
1917 }
1920 }
1922 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1923 sizeof as last operand of certain builtins. */
1925 void
1929 {
1933 location_t loc;
1941 {
1945 /* FALLTHRU */
1953 /* FALLTHRU */
2012 }
2040 {
2044 {
2047 "argument to %<sizeof%> in %qD call is the same "
2048 "expression as the destination; did you mean to "
2054 "argument to %<sizeof%> in %qD call is the same "
2055 "expression as the destination; did you mean to "
2057 else
2059 "argument to %<sizeof%> in %qD call is the same "
2060 "expression as the destination; did you mean to "
2063 }
2066 && !strop
2069 {
2071 "argument to %<sizeof%> in %qD call is the same "
2072 "pointer type %qT as the destination; expected %qT "
2076 }
2077 }
2080 {
2084 {
2087 "argument to %<sizeof%> in %qD call is the same "
2088 "expression as the source; did you mean to "
2094 "argument to %<sizeof%> in %qD call is the same "
2095 "expression as the source; did you mean to "
2097 else
2099 "argument to %<sizeof%> in %qD call is the same "
2100 "expression as the source; did you mean to "
2103 }
2106 && !strop
2109 {
2111 "argument to %<sizeof%> in %qD call is the same "
2112 "pointer type %qT as the source; expected %qT "
2116 }
2117 }
2120 {
2124 {
2127 "argument to %<sizeof%> in %qD call is the same "
2128 "expression as the first source; did you mean to "
2134 "argument to %<sizeof%> in %qD call is the same "
2135 "expression as the first source; did you mean to "
2137 else
2139 "argument to %<sizeof%> in %qD call is the same "
2140 "expression as the first source; did you mean to "
2143 }
2146 && !strop
2149 {
2151 "argument to %<sizeof%> in %qD call is the same "
2152 "pointer type %qT as the first source; expected %qT "
2156 }
2157 }
2160 {
2164 {
2167 "argument to %<sizeof%> in %qD call is the same "
2168 "expression as the second source; did you mean to "
2174 "argument to %<sizeof%> in %qD call is the same "
2175 "expression as the second source; did you mean to "
2177 else
2179 "argument to %<sizeof%> in %qD call is the same "
2180 "expression as the second source; did you mean to "
2183 }
2186 && !strop
2189 {
2191 "argument to %<sizeof%> in %qD call is the same "
2192 "pointer type %qT as the second source; expected %qT "
2196 }
2197 }
2199 }
2201 /* Warn for unlikely, improbable, or stupid DECL declarations
2202 of `main'. */
2204 void
2206 {
2207 function_args_iterator iter;
2208 tree type;
2212 {
2213 /* XXX void_type_node belies the abstraction. */
2223 {
2229 }
2233 {
2255 "third argument of %q+D should probably be "
2258 }
2259 }
2261 /* It is intentional that this message does not mention the third
2262 argument because it's only mentioned in an appendix of the
2263 standard. */
2271 }
2273 /* vector_targets_convertible_p is used for vector pointer types. The
2274 callers perform various checks that the qualifiers are satisfactory,
2275 while OTOH vector_targets_convertible_p ignores the number of elements
2276 in the vectors. That's fine with vector pointers as we can consider,
2277 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2278 and that does not require and conversion of the pointer values.
2279 In contrast, vector_types_convertible_p and
2280 vector_types_compatible_elements_p are used for vector value types. */
2281 /* True if pointers to distinct types T1 and T2 can be converted to
2282 each other without an explicit cast. Only returns true for opaque
2283 vector types. */
2284 bool
2286 {
2293 }
2295 /* vector_types_convertible_p is used for vector value types.
2296 It could in principle call vector_targets_convertible_p as a subroutine,
2297 but then the check for vector type would be duplicated with its callers,
2298 and also the purpose of vector_targets_convertible_p would become
2299 muddled.
2300 Where vector_types_convertible_p returns true, a conversion might still be
2301 needed to make the types match.
2302 In contrast, vector_targets_convertible_p is used for vector pointer
2303 values, and vector_types_compatible_elements_p is used specifically
2304 in the context for binary operators, as a check if use is possible without
2305 conversion. */
2306 /* True if vector types T1 and T2 can be converted to each other
2307 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2308 can only be converted with -flax-vector-conversions yet that is not
2309 in effect, emit a note telling the user about that option if such
2310 a note has not previously been emitted. */
2311 bool
2313 {
2321 convertible_lax =
2336 {
2339 "conversions between vectors with differing "
2341 }
2344 }
2346 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2347 and have vector types, V0 has the same type as V1, and the number of
2348 elements of V0, V1, MASK is the same.
2350 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2351 called with two arguments. In this case implementation passes the
2352 first argument twice in order to share the same tree code. This fact
2353 could enable the mask-values being twice the vector length. This is
2354 an implementation accident and this semantics is not guaranteed to
2355 the user. */
2356 tree
2359 {
2360 tree ret;
2366 {
2369 }
2377 {
2382 }
2386 {
2390 }
2393 {
2398 }
2404 {
2407 "argument vector(s) and the mask vector should "
2410 }
2414 {
2419 }
2422 {
2423 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2429 else
2430 {
2433 }
2437 }
2447 }
2449 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2450 to integral type. */
2452 static tree
2454 {
2459 {
2460 /* C++0x scoped enumerations don't implicitly convert to integral
2461 type; if we stripped an explicit conversion to a larger type we
2462 need to replace it so common_type will still work. */
2466 }
2468 }
2470 /* This is a helper function of build_binary_op.
2472 For certain operations if both args were extended from the same
2473 smaller type, do the arithmetic in that type and then extend.
2475 BITWISE indicates a bitwise operation.
2476 For them, this optimization is safe only if
2477 both args are zero-extended or both are sign-extended.
2478 Otherwise, we might change the result.
2479 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2480 but calculated in (unsigned short) it would be (unsigned short)-1.
2481 */
2482 tree
2484 {
2488 tree type;
2490 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2491 excessive narrowing when we call get_narrower below. For
2492 example, suppose that OP0 is of unsigned int extended
2493 from signed char and that RESULT_TYPE is long long int.
2494 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2495 like
2497 (long long int) (unsigned int) signed_char
2499 which get_narrower would narrow down to
2501 (unsigned int) signed char
2503 If we do not cast OP0 first, get_narrower would return
2504 signed_char, which is inconsistent with the case of the
2505 explicit cast. */
2512 /* UNS is 1 if the operation to be done is an unsigned one. */
2515 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2516 but it *requires* conversion to FINAL_TYPE. */
2527 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2529 /* For bitwise operations, signedness of nominal type
2530 does not matter. Consider only how operands were extended. */
2534 /* Note that in all three cases below we refrain from optimizing
2535 an unsigned operation on sign-extended args.
2536 That would not be valid. */
2538 /* Both args variable: if both extended in same way
2539 from same width, do it in that width.
2540 Do it unsigned if args were zero-extended. */
2547 return c_common_signed_or_unsigned_type
2554 && (type
2565 && (type
2573 }
2575 /* Checks if expression EXPR of real/integer type cannot be converted
2576 to the real/integer type TYPE. Function returns non-zero when:
2577 * EXPR is a constant which cannot be exactly converted to TYPE.
2578 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2579 for EXPR type and TYPE being both integers or both real.
2580 * EXPR is not a constant of real type and TYPE is an integer.
2581 * EXPR is not a constant of integer type which cannot be
2582 exactly converted to real type.
2583 Function allows conversions between types of different signedness and
2584 can return SAFE_CONVERSION (zero) in that case. Function can produce
2585 signedness warnings if PRODUCE_WARNS is true. */
2587 enum conversion_safety
2589 {
2595 {
2596 /* Warn for real constant that is not an exact integer converted
2597 to integer type. */
2600 {
2603 }
2604 /* Warn for an integer constant that does not fit into integer type. */
2608 {
2611 {
2615 }
2617 {
2621 }
2622 else
2624 }
2626 {
2627 /* Warn for an integer constant that does not fit into real type. */
2629 {
2633 }
2634 /* Warn for a real constant that does not fit into a smaller
2635 real type. */
2638 {
2642 }
2643 }
2644 }
2645 else
2646 {
2647 /* Warn for real types converted to integer types. */
2654 {
2655 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2659 /* Don't warn for short y; short x = ((int)y & 0xff); */
2663 {
2664 /* If both args were extended from a shortest type,
2665 use that type if that is safe. */
2672 {
2678 /* If one of the operands is a non-negative constant
2679 that fits in the target type, then the type of the
2680 other operand does not matter. */
2689 /* If constant is unsigned and fits in the target
2690 type, then the result will also fit. */
2692 && unsigned0
2695 && unsigned1
2698 }
2699 }
2700 /* Warn for integer types converted to smaller integer types. */
2704 /* When they are the same width but different signedness,
2705 then the value may change. */
2708 /* Even when converted to a bigger type, if the type is
2709 unsigned but expr is signed, then negative values
2710 will be changed. */
2716 }
2718 /* Warn for integer types converted to real types if and only if
2719 all the range of values of the integer type cannot be
2720 represented by the real type. */
2723 {
2727 /* Don't warn about char y = 0xff; float x = (int) y; */
2739 }
2741 /* Warn for real types converted to smaller real types. */
2746 }
2749 }
2751 /* Warns if the conversion of EXPR to TYPE may alter a value.
2752 This is a helper function for warnings_for_convert_and_check. */
2754 static void
2756 {
2763 /* This may happen, because for LHS op= RHS we preevaluate
2764 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2765 means we could no longer see the code of the EXPR. */
2772 {
2785 /* Conversion from boolean to a signed:1 bit-field (which only
2786 can hold the values 0 and -1) doesn't lose information - but
2787 it does change the value. */
2807 {
2808 /* In case of COND_EXPR, we do not care about the type of
2809 COND_EXPR, only about the conversion of each operand. */
2816 }
2828 }
2829 }
2831 /* Produce warnings after a conversion. RESULT is the result of
2832 converting EXPR to TYPE. This is a helper function for
2833 convert_and_check and cp_convert_and_check. */
2835 void
2837 tree result)
2838 {
2845 {
2846 /* Do not diagnose overflow in a constant expression merely
2847 because a conversion overflowed. */
2852 {
2853 /* This detects cases like converting -129 or 256 to
2854 unsigned char. */
2858 else
2860 }
2864 /* No warning for converting 0x80000000 to int. */
2872 else
2874 }
2879 else
2881 }
2884 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2885 Invoke this function on every expression that is converted implicitly,
2886 i.e. because of language rules and not because of an explicit cast. */
2888 tree
2890 {
2891 tree result;
2892 tree expr_for_warning;
2894 /* Convert from a value with possible excess precision rather than
2895 via the semantic type, but do not warn about values not fitting
2896 exactly in the semantic type. */
2898 {
2904 }
2905 else
2919 }
2920 \f
2921 /* A node in a list that describes references to variables (EXPR), which are
2922 either read accesses if WRITER is zero, or write accesses, in which case
2923 WRITER is the parent of EXPR. */
2924 struct tlist
2925 {
2928 };
2930 /* Used to implement a cache the results of a call to verify_tree. We only
2931 use this for SAVE_EXPRs. */
2932 struct tlist_cache
2933 {
2937 tree expr;
2938 };
2940 /* Obstack to use when allocating tlist structures, and corresponding
2941 firstobj. */
2945 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2946 warnings. */
2948 /* SAVE_EXPRs need special treatment. We process them only once and then
2949 cache the results. */
2961 /* Create a new struct tlist and fill in its fields. */
2964 {
2971 }
2973 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2974 is nonnull, we ignore any node we find which has a writer equal to it. */
2976 static void
2978 {
2980 {
2987 }
2988 }
2990 /* Merge the nodes of ADD into TO. This merging process is done so that for
2991 each variable that already exists in TO, no new node is added; however if
2992 there is a write access recorded in ADD, and an occurrence on TO is only
2993 a read access, then the occurrence in TO will be modified to record the
2994 write. */
2996 static void
2998 {
3005 {
3012 {
3016 }
3018 {
3022 }
3024 }
3025 }
3027 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3028 references in list LIST conflict with it, excluding reads if ONLY writers
3029 is nonzero. */
3031 static void
3034 {
3037 /* Avoid duplicate warnings. */
3043 {
3047 {
3052 }
3054 }
3055 }
3057 /* Given a list LIST of references to variables, find whether any of these
3058 can cause conflicts due to missing sequence points. */
3060 static void
3062 {
3066 {
3069 }
3070 }
3072 /* Return nonzero if X is a tree that can be verified by the sequence point
3073 warnings. */
3074 static int
3076 {
3083 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3084 (lvalue_p) crash on TRY/CATCH. */
3091 /* No point to track non-const calls, they will never satisfy
3092 operand_equal_p. */
3100 }
3102 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3103 static bool
3105 {
3107 }
3109 /* Walk the tree X, and record accesses to variables. If X is written by the
3110 parent tree, WRITER is the parent.
3111 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3112 expression or its only operand forces a sequence point, then everything up
3113 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3114 in PNO_SP.
3115 Once we return, we will have emitted warnings if any subexpression before
3116 such a sequence point could be undefined. On a higher level, however, the
3117 sequence point may not be relevant, and we'll merge the two lists.
3119 Example: (b++, a) + b;
3120 The call that processes the COMPOUND_EXPR will store the increment of B
3121 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3122 processes the PLUS_EXPR will need to merge the two lists so that
3123 eventually, all accesses end up on the same list (and we'll warn about the
3124 unordered subexpressions b++ and b.
3126 A note on merging. If we modify the former example so that our expression
3127 becomes
3128 (b++, b) + a
3129 care must be taken not simply to add all three expressions into the final
3130 PNO_SP list. The function merge_tlist takes care of that by merging the
3131 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3132 way, so that no more than one access to B is recorded. */
3134 static void
3136 tree writer)
3137 {
3142 /* X may be NULL if it is the operand of an empty statement expression
3143 ({ }). */
3147 restart:
3155 {
3188 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3189 two first, to avoid warning for (a ? b++ : b++). */
3205 /* Expressions inside the LHS are not ordered wrt. the sequence points
3206 in the RHS. Example:
3207 *a = (a++, 2)
3208 Despite the fact that the modification of "a" is in the before_sp
3209 list (tmp_before), it conflicts with the use of "a" in the LHS.
3210 We can handle this by adding the contents of tmp_list3
3211 to those of tmp_before, and redoing the collision warnings for that
3212 list. */
3215 /* Exclude the LHS itself here; we first have to merge it into the
3216 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3217 didn't exclude the LHS, we'd get it twice, once as a read and once
3218 as a write. */
3229 /* We need to warn about conflicts among arguments and conflicts between
3230 args and the function address. Side effects of the function address,
3231 however, are not ordered by the sequence point of the call. */
3232 {
3233 call_expr_arg_iterator iter;
3234 tree arg;
3238 {
3243 }
3248 }
3251 /* Scan all the list, e.g. indices of multi dimensional array. */
3253 {
3259 }
3263 {
3270 {
3284 }
3288 }
3298 /* For other expressions, simply recurse on their operands.
3299 Manual tail recursion for unary expressions.
3300 Other non-expressions need not be processed. */
3302 {
3306 }
3308 {
3312 {
3317 }
3318 }
3320 }
3321 }
3323 /* Try to warn for undefined behavior in EXPR due to missing sequence
3324 points. */
3326 DEBUG_FUNCTION void
3328 {
3334 {
3337 }
3342 }
3343 \f
3344 /* Validate the expression after `case' and apply default promotions. */
3346 static tree
3348 {
3353 /* Promote char or short to int. */
3356 {
3359 }
3364 }
3365 \f
3366 /* See if the case values LOW and HIGH are in the range of the original
3367 type (i.e. before the default conversion to int) of the switch testing
3368 expression.
3369 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3370 the type before promoting it. CASE_LOW_P is a pointer to the lower
3371 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3372 if the case is not a case range.
3373 The caller has to make sure that we are not called with NULL for
3374 CASE_LOW_P (i.e. the default case).
3375 Returns true if the case label is in range of ORIG_TYPE (saturated or
3376 untouched) or false if the label is out of range. */
3378 static bool
3381 {
3386 /* If there was a problem with the original type, do nothing. */
3393 /* Case label is less than minimum for type. */
3396 {
3400 }
3402 /* Case value is greater than maximum for type. */
3405 {
3408 }
3410 /* Saturate lower case label value to minimum. */
3413 {
3417 }
3419 /* Saturate upper case label value to maximum. */
3422 {
3426 }
3434 }
3435 \f
3436 /* Return an integer type with BITS bits of precision,
3437 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3439 tree
3441 {
3480 }
3482 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3483 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3484 and saturating if SATP is nonzero, otherwise not saturating. */
3486 tree
3489 {
3493 else
3501 {
3503 "fixed-point types that have too many integral and "
3506 }
3509 }
3511 /* Used for communication between c_common_type_for_mode and
3512 c_register_builtin_type. */
3513 tree registered_builtin_types;
3515 /* Return a data type that has machine mode MODE.
3516 If the mode is an integer,
3517 then UNSIGNEDP selects between signed and unsigned types.
3518 If the mode is a fixed-point mode,
3519 then UNSIGNEDP selects between saturating and nonsaturating types. */
3521 tree
3523 {
3524 tree t;
3561 #if HOST_BITS_PER_WIDE_INT >= 64
3564 #endif
3589 {
3591 tree inner_type;
3607 }
3609 {
3614 }
3624 {
3710 }
3718 }
3720 tree
3722 {
3724 }
3726 /* Return a signed type the same as TYPE in other respects. */
3728 tree
3730 {
3732 }
3734 /* Return a type the same as TYPE except unsigned or
3735 signed according to UNSIGNEDP. */
3737 tree
3739 {
3740 tree type1;
3742 /* This block of code emulates the behavior of the old
3743 c_common_unsigned_type. In particular, it returns
3744 long_unsigned_type_node if passed a long, even when a int would
3745 have the same size. This is necessary for warnings to work
3746 correctly in archs where sizeof(int) == sizeof(long) */
3749 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3765 #if HOST_BITS_PER_WIDE_INT >= 64
3768 #endif
3778 #define C_COMMON_FIXED_TYPES(NAME) \
3779 if (type1 == short_ ## NAME ## _type_node \
3780 || type1 == unsigned_short_ ## NAME ## _type_node) \
3781 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3782 : short_ ## NAME ## _type_node; \
3783 if (type1 == NAME ## _type_node \
3784 || type1 == unsigned_ ## NAME ## _type_node) \
3785 return unsignedp ? unsigned_ ## NAME ## _type_node \
3786 : NAME ## _type_node; \
3787 if (type1 == long_ ## NAME ## _type_node \
3788 || type1 == unsigned_long_ ## NAME ## _type_node) \
3789 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3790 : long_ ## NAME ## _type_node; \
3791 if (type1 == long_long_ ## NAME ## _type_node \
3792 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3793 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3794 : long_long_ ## NAME ## _type_node;
3796 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3797 if (type1 == NAME ## _type_node \
3798 || type1 == u ## NAME ## _type_node) \
3799 return unsignedp ? u ## NAME ## _type_node \
3800 : NAME ## _type_node;
3802 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3803 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3804 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3805 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3806 : sat_ ## short_ ## NAME ## _type_node; \
3807 if (type1 == sat_ ## NAME ## _type_node \
3808 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3809 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3810 : sat_ ## NAME ## _type_node; \
3811 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3812 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3813 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3814 : sat_ ## long_ ## NAME ## _type_node; \
3815 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3816 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3817 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3818 : sat_ ## long_long_ ## NAME ## _type_node;
3820 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3821 if (type1 == sat_ ## NAME ## _type_node \
3822 || type1 == sat_ ## u ## NAME ## _type_node) \
3823 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3824 : sat_ ## NAME ## _type_node;
3850 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3851 the precision; they have precision set to match their range, but
3852 may use a wider mode to match an ABI. If we change modes, we may
3853 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3854 the precision as well, so as to yield correct results for
3855 bit-field types. C++ does not have these separate bit-field
3856 types, and producing a signed or unsigned variant of an
3857 ENUMERAL_TYPE may cause other problems as well. */
3863 #define TYPE_OK(node) \
3864 (TYPE_MODE (type) == TYPE_MODE (node) \
3865 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3884 #if HOST_BITS_PER_WIDE_INT >= 64
3887 #endif
3896 #undef TYPE_OK
3899 }
3901 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3903 tree
3905 {
3906 /* Extended integer types of the same width as a standard type have
3907 lesser rank, so those of the same width as int promote to int or
3908 unsigned int and are valid for printf formats expecting int or
3909 unsigned int. To avoid such special cases, avoid creating
3910 extended integer types for bit-fields if a standard integer type
3911 is available. */
3928 }
3930 /* The C version of the register_builtin_type langhook. */
3932 void
3934 {
3935 tree decl;
3945 }
3946 \f
3947 /* Print an error message for invalid operands to arith operation
3948 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3949 LOCATION is the location of the message. */
3951 void
3954 {
3958 {
4003 }
4007 }
4008 \f
4009 /* Given an expression as a tree, return its original type. Do this
4010 by stripping any conversion that preserves the sign and precision. */
4011 static tree
4013 {
4016 }
4018 /* Subroutine of build_binary_op, used for comparison operations.
4019 See if the operands have both been converted from subword integer types
4020 and, if so, perhaps change them both back to their original type.
4021 This function is also responsible for converting the two operands
4022 to the proper common type for comparison.
4024 The arguments of this function are all pointers to local variables
4025 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4026 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4028 LOC is the location of the comparison.
4030 If this function returns nonzero, it means that the comparison has
4031 a constant value. What this function returns is an expression for
4032 that value. */
4034 tree
4037 {
4038 tree type;
4046 /* Throw away any conversions to wider types
4047 already present in the operands. */
4052 /* If primopN is first sign-extended from primopN's precision to opN's
4053 precision, then zero-extended from opN's precision to
4054 *restype_ptr precision, shortenings might be invalid. */
4057 && !unsignedp0
4062 && !unsignedp1
4066 /* Handle the case that OP0 does not *contain* a conversion
4067 but it *requires* conversion to FINAL_TYPE. */
4074 /* If one of the operands must be floated, we cannot optimize. */
4078 /* If first arg is constant, swap the args (changing operation
4079 so value is preserved), for canonicalization. Don't do this if
4080 the second arg is 0. */
4085 {
4102 {
4117 }
4119 }
4121 /* If comparing an integer against a constant more bits wide,
4122 maybe we can deduce a value of 1 or 0 independent of the data.
4123 Or else truncate the constant now
4124 rather than extend the variable at run time.
4126 This is only interesting if the constant is the wider arg.
4127 Also, it is not safe if the constant is unsigned and the
4128 variable arg is signed, since in this case the variable
4129 would be sign-extended and then regarded as unsigned.
4130 Our technique fails in this case because the lowest/highest
4131 possible unsigned results don't follow naturally from the
4132 lowest/highest possible values of the variable operand.
4133 For just EQ_EXPR and NE_EXPR there is another technique that
4134 could be used: see if the constant can be faithfully represented
4135 in the other operand's type, by truncating it and reextending it
4136 and see if that preserves the constant's value. */
4142 {
4145 /* 1 if comparison is nominally unsigned. */
4147 tree val;
4159 {
4160 /* Convert primop1 to target type, but do not introduce
4161 additional overflow. We know primop1 is an int_cst. */
4168 }
4170 {
4173 }
4181 /* This used to be a switch, but Genix compiler can't handle that. */
4183 {
4186 }
4188 {
4191 }
4193 {
4198 }
4200 {
4205 }
4207 {
4212 }
4214 {
4219 }
4221 /* If primop0 was sign-extended and unsigned comparison specd,
4222 we did a signed comparison above using the signed type bounds.
4223 But the comparison we output must be unsigned.
4225 Also, for inequalities, VAL is no good; but if the signed
4226 comparison had *any* fixed result, it follows that the
4227 unsigned comparison just tests the sign in reverse
4228 (positive values are LE, negative ones GE).
4229 So we can generate an unsigned comparison
4230 against an extreme value of the signed type. */
4233 {
4236 {
4251 }
4253 }
4256 {
4263 }
4266 {
4267 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4271 }
4273 /* Value is not predetermined, but do the comparison
4274 in the type of the operand that is not constant.
4275 TYPE is already properly set. */
4276 }
4278 /* If either arg is decimal float and the other is float, find the
4279 proper common type to use for comparison. */
4290 /* If args' natural types are both narrower than nominal type
4291 and both extend in the same manner, compare them
4292 in the type of the wider arg.
4293 Otherwise must actually extend both to the nominal
4294 common type lest different ways of extending
4295 alter the result.
4296 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4301 {
4305 type);
4306 /* Make sure shorter operand is extended the right way
4307 to match the longer operand. */
4308 primop0
4311 primop0);
4312 primop1
4315 primop1);
4316 }
4317 else
4318 {
4319 /* Here we must do the comparison on the nominal type
4320 using the args exactly as we received them. */
4327 {
4329 /* All unsigned values are >= 0, so we warn. However,
4330 if OP0 is a constant that is >= 0, the signedness of
4331 the comparison isn't an issue, so suppress the
4332 warning. */
4337 primop0)))
4338 /* Do not warn for enumeration types. */
4342 {
4359 }
4362 {
4363 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4368 }
4369 }
4370 }
4378 }
4379 \f
4380 /* Return a tree for the sum or difference (RESULTCODE says which)
4381 of pointer PTROP and integer INTOP. */
4383 tree
4386 {
4389 /* The result is a pointer of the same type that is being added. */
4393 {
4400 }
4402 {
4409 }
4410 else
4413 /* We are manipulating pointer values, so we don't need to warn
4414 about relying on undefined signed overflow. We disable the
4415 warning here because we use integer types so fold won't know that
4416 they are really pointers. */
4419 /* If what we are about to multiply by the size of the elements
4420 contains a constant term, apply distributive law
4421 and multiply that constant term separately.
4422 This helps produce common subexpressions. */
4427 /* If the constant comes from pointer subtraction,
4428 skip this optimization--it would cause an error. */
4430 /* If the constant is unsigned, and smaller than the pointer size,
4431 then we must skip this optimization. This is because it could cause
4432 an overflow error if the constant is negative but INTOP is not. */
4436 {
4441 /* Convert both subexpression types to the type of intop,
4442 because weird cases involving pointer arithmetic
4443 can result in a sum or difference with different type args. */
4448 }
4450 /* Convert the integer argument to a type the same size as sizetype
4451 so the multiply won't overflow spuriously. */
4457 /* Replace the integer argument with a suitable product by the object size.
4458 Do this multiplication as signed, then convert to the appropriate type
4459 for the pointer operation and disregard an overflow that occurred only
4460 because of the sign-extension change in the latter conversion. */
4461 {
4468 }
4470 /* Create the sum or difference. */
4479 }
4480 \f
4481 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4482 and if NON_CONST is known not to be permitted in an evaluated part
4483 of a constant expression. */
4485 tree
4487 {
4491 /* This should never be called for C++. */
4495 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4504 }
4506 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4507 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4508 around the SAVE_EXPR if needed so that c_fully_fold does not need
4509 to look inside SAVE_EXPRs. */
4511 tree
4513 {
4522 }
4524 /* Return whether EXPR is a declaration whose address can never be
4525 NULL. */
4527 bool
4529 {
4534 }
4536 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4537 or for an `if' or `while' statement or ?..: exp. It should already
4538 have been validated to be of suitable type; otherwise, a bad
4539 diagnostic may result.
4541 The EXPR is located at LOCATION.
4543 This preparation consists of taking the ordinary
4544 representation of an expression expr and producing a valid tree
4545 boolean expression describing whether expr is nonzero. We could
4546 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4547 but we optimize comparisons, &&, ||, and !.
4549 The resulting type should always be `truthvalue_type_node'. */
4551 tree
4553 {
4555 {
4597 ? truthvalue_true_node
4603 ? truthvalue_true_node
4608 /* Fall through. */
4611 {
4614 {
4615 /* Common Ada/Pascal programmer's mistake. */
4617 OPT_Waddress,
4619 inner);
4621 }
4623 }
4640 /* These don't change whether an object is nonzero or zero. */
4645 /* These don't change whether an object is zero or nonzero, but
4646 we can't ignore them if their second arg has side-effects. */
4648 {
4651 c_common_truthvalue_conversion
4654 }
4655 else
4660 /* Distribute the conversion into the arms of a COND_EXPR. */
4662 {
4665 /* In C++ one of the arms might have void type if it is throw. */
4673 }
4674 else
4675 {
4676 /* Folding will happen later for C. */
4684 }
4686 CASE_CONVERT:
4687 {
4691 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4692 since that affects how `default_conversion' will behave. */
4696 /* Don't strip a conversion from C++0x scoped enum, since they
4697 don't implicitly convert to other types. */
4701 /* If this isn't narrowing the argument, we can ignore it. */
4705 }
4711 {
4715 }
4720 }
4723 {
4725 expr = (build_binary_op
4729 c_common_truthvalue_conversion
4732 c_common_truthvalue_conversion
4737 }
4740 {
4745 }
4746 else
4749 ret:
4752 }
4753 \f
4762 /* Apply the TYPE_QUALS to the new DECL. */
4764 void
4766 {
4774 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4775 constructor can produce constant init, so rely on cp_finish_decl to
4776 clear TREE_READONLY if the variable has non-constant init. */
4779 {
4782 }
4784 {
4786 /* Allow 'restrict' on arrays of pointers.
4787 FIXME currently we just ignore it. */
4793 }
4794 }
4796 /* Hash function for the problem of multiple type definitions in
4797 different files. This must hash all types that will compare
4798 equal via comptypes to the same value. In practice it hashes
4799 on some of the simple stuff and leaves the details to comptypes. */
4801 static hashval_t
4803 {
4807 tree t2;
4809 {
4810 /* For pointers, hash on pointee type plus some swizzling. */
4813 /* Hash on number of elements and total size. */
4832 }
4833 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4834 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4836 /* We might have a VLA here. */
4839 else
4842 }
4846 /* Return the typed-based alias set for T, which may be an expression
4847 or a type. Return -1 if we don't do anything special. */
4849 alias_set_type
4851 {
4852 tree u;
4855 /* For VLAs, use the alias set of the element type rather than the
4856 default of alias set 0 for types compared structurally. */
4858 {
4862 }
4864 /* Permit type-punning when accessing a union, provided the access
4865 is directly through the union. For example, this code does not
4866 permit taking the address of a union member and then storing
4867 through it. Even the type-punning allowed here is a GCC
4868 extension, albeit a common and useful one; the C standard says
4869 that such accesses have implementation-defined behavior. */
4877 /* That's all the expressions we handle specially. */
4881 /* The C standard guarantees that any object may be accessed via an
4882 lvalue that has character type. */
4888 /* The C standard specifically allows aliasing between signed and
4889 unsigned variants of the same type. We treat the signed
4890 variant as canonical. */
4892 {
4895 /* t1 == t can happen for boolean nodes which are always unsigned. */
4898 }
4900 /* Handle the case of multiple type nodes referring to "the same" type,
4901 which occurs with IMA. These share an alias set. FIXME: Currently only
4902 C90 is handled. (In C99 type compatibility is not transitive, which
4903 complicates things mightily. The alias set splay trees can theoretically
4904 represent this, but insertion is tricky when you consider all the
4905 different orders things might arrive in.) */
4910 /* Save time if there's only one input file. */
4914 /* Pointers need special handling if they point to any type that
4915 needs special handling (below). */
4917 {
4918 tree t2;
4919 /* Find bottom type under any nested POINTERs. */
4923 ;
4931 }
4932 /* These are the only cases that need special handling. */
4939 /* Undefined? */
4943 /* Look up t in hash table. Only one of the compatible types within each
4944 alias set is recorded in the table. */
4948 NULL);
4951 {
4954 }
4955 else
4956 /* Our caller will assign and record (in t) a new alias set; all we need
4957 to do is remember t in the hash table. */
4961 }
4962 \f
4963 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4964 the IS_SIZEOF parameter indicates which operator is being applied.
4965 The COMPLAIN flag controls whether we should diagnose possibly
4966 ill-formed constructs or not. LOC is the location of the SIZEOF or
4967 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4968 a type in any context should be returned, rather than the normal
4969 alignment for that type. */
4971 tree
4975 {
4983 {
4985 {
4992 }
4993 else
4994 {
4996 {
5000 else
5003 }
5005 }
5006 }
5008 {
5016 }
5019 {
5024 }
5027 {
5032 }
5033 else
5034 {
5036 /* Convert in case a char is more than one unit. */
5042 else
5044 }
5046 /* VALUE will have the middle-end integer type sizetype.
5047 However, we should really return a value of type `size_t',
5048 which is just a typedef for an ordinary integer type. */
5052 }
5054 /* Implement the __alignof keyword: Return the minimum required
5055 alignment of EXPR, measured in bytes. For VAR_DECLs,
5056 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5057 from an "aligned" __attribute__ specification). LOC is the
5058 location of the ALIGNOF operator. */
5060 tree
5062 {
5063 tree t;
5070 {
5073 }
5079 {
5086 {
5093 }
5095 }
5096 else
5100 }
5101 \f
5102 /* Handle C and C++ default attributes. */
5104 enum built_in_attribute
5105 {
5106 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5107 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5108 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5109 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5110 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5112 #undef DEF_ATTR_NULL_TREE
5113 #undef DEF_ATTR_INT
5114 #undef DEF_ATTR_STRING
5115 #undef DEF_ATTR_IDENT
5116 #undef DEF_ATTR_TREE_LIST
5117 ATTR_LAST
5118 };
5124 enum c_builtin_type
5125 {
5126 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5127 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5128 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5129 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5130 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5131 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5132 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5133 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5134 ARG6) NAME,
5135 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5136 ARG6, ARG7) NAME,
5137 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5138 ARG6, ARG7, ARG8) NAME,
5139 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5140 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5141 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5142 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5143 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5144 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5145 NAME,
5146 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5148 #undef DEF_PRIMITIVE_TYPE
5149 #undef DEF_FUNCTION_TYPE_0
5150 #undef DEF_FUNCTION_TYPE_1
5151 #undef DEF_FUNCTION_TYPE_2
5152 #undef DEF_FUNCTION_TYPE_3
5153 #undef DEF_FUNCTION_TYPE_4
5154 #undef DEF_FUNCTION_TYPE_5
5155 #undef DEF_FUNCTION_TYPE_6
5156 #undef DEF_FUNCTION_TYPE_7
5157 #undef DEF_FUNCTION_TYPE_8
5158 #undef DEF_FUNCTION_TYPE_VAR_0
5159 #undef DEF_FUNCTION_TYPE_VAR_1
5160 #undef DEF_FUNCTION_TYPE_VAR_2
5161 #undef DEF_FUNCTION_TYPE_VAR_3
5162 #undef DEF_FUNCTION_TYPE_VAR_4
5163 #undef DEF_FUNCTION_TYPE_VAR_5
5164 #undef DEF_POINTER_TYPE
5165 BT_LAST
5166 };
5170 /* A temporary array for c_common_nodes_and_builtins. Used in
5171 communication with def_fn_type. */
5174 /* A helper function for c_common_nodes_and_builtins. Build function type
5175 for DEF with return type RET and N arguments. If VAR is true, then the
5176 function should be variadic after those N arguments.
5178 Takes special care not to ICE if any of the types involved are
5179 error_mark_node, which indicates that said type is not in fact available
5180 (see builtin_type_for_size). In which case the function type as a whole
5181 should be error_mark_node. */
5183 static void
5185 {
5186 tree t;
5193 {
5199 }
5206 else
5209 egress:
5212 }
5214 /* Build builtin functions common to both C and C++ language
5215 frontends. */
5217 static void
5219 {
5220 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5221 builtin_types[ENUM] = VALUE;
5222 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5223 def_fn_type (ENUM, RETURN, 0, 0);
5224 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5225 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5226 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5227 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5228 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5229 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5230 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5231 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5232 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5233 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5234 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5235 ARG6) \
5236 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5237 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5238 ARG6, ARG7) \
5239 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5240 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5241 ARG6, ARG7, ARG8) \
5242 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5243 ARG7, ARG8);
5244 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5245 def_fn_type (ENUM, RETURN, 1, 0);
5246 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5247 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5248 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5249 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5250 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5251 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5252 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5253 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5254 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5255 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5256 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5257 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5261 #undef DEF_PRIMITIVE_TYPE
5262 #undef DEF_FUNCTION_TYPE_0
5263 #undef DEF_FUNCTION_TYPE_1
5264 #undef DEF_FUNCTION_TYPE_2
5265 #undef DEF_FUNCTION_TYPE_3
5266 #undef DEF_FUNCTION_TYPE_4
5267 #undef DEF_FUNCTION_TYPE_5
5268 #undef DEF_FUNCTION_TYPE_6
5269 #undef DEF_FUNCTION_TYPE_7
5270 #undef DEF_FUNCTION_TYPE_8
5271 #undef DEF_FUNCTION_TYPE_VAR_0
5272 #undef DEF_FUNCTION_TYPE_VAR_1
5273 #undef DEF_FUNCTION_TYPE_VAR_2
5274 #undef DEF_FUNCTION_TYPE_VAR_3
5275 #undef DEF_FUNCTION_TYPE_VAR_4
5276 #undef DEF_FUNCTION_TYPE_VAR_5
5277 #undef DEF_POINTER_TYPE
5282 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5283 NONANSI_P, ATTRS, IMPLICIT, COND) \
5284 if (NAME && COND) \
5285 def_builtin_1 (ENUM, NAME, CLASS, \
5286 builtin_types[(int) TYPE], \
5287 builtin_types[(int) LIBTYPE], \
5288 BOTH_P, FALLBACK_P, NONANSI_P, \
5289 built_in_attributes[(int) ATTRS], IMPLICIT);
5291 #undef DEF_BUILTIN
5299 }
5301 /* Like get_identifier, but avoid warnings about null arguments when
5302 the argument may be NULL for targets where GCC lacks stdint.h type
5303 information. */
5307 {
5309 }
5311 /* Build tree nodes and builtin functions common to both C and C++ language
5312 frontends. */
5314 void
5316 {
5320 tree array_domain_type;
5321 tree va_list_ref_type_node;
5322 tree va_list_arg_type_node;
5326 /* Define `int' and `char' first so that dbx will output them first. */
5330 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5331 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5332 but not C. Are the conditionals here needed? */
5338 long_unsigned_type_node);
5340 {
5342 int128_integer_type_node);
5344 int128_unsigned_type_node);
5345 }
5349 long_long_integer_type_node);
5351 long_long_unsigned_type_node);
5354 long_long_unsigned_type_node);
5357 short_unsigned_type_node);
5360 short_unsigned_type_node);
5362 /* Define both `signed char' and `unsigned char'. */
5366 /* These are types that c_common_type_for_size and
5367 c_common_type_for_mode use. */
5370 intQI_type_node));
5373 intHI_type_node));
5376 intSI_type_node));
5379 intDI_type_node));
5380 #if HOST_BITS_PER_WIDE_INT >= 64
5383 TYPE_DECL,
5385 intTI_type_node));
5386 #endif
5389 unsigned_intQI_type_node));
5392 unsigned_intHI_type_node));
5395 unsigned_intSI_type_node));
5398 unsigned_intDI_type_node));
5399 #if HOST_BITS_PER_WIDE_INT >= 64
5402 TYPE_DECL,
5404 unsigned_intTI_type_node));
5405 #endif
5407 /* Create the widest literal types. */
5408 widest_integer_literal_type_node
5412 widest_integer_literal_type_node));
5414 widest_unsigned_literal_type_node
5418 widest_unsigned_literal_type_node));
5422 pid_type_node =
5429 /* Only supported decimal floating point extension if the target
5430 actually supports underlying modes. */
5434 {
5438 }
5441 {
5446 long_long_fract_type_node);
5448 unsigned_short_fract_type_node);
5450 unsigned_fract_type_node);
5452 unsigned_long_fract_type_node);
5454 unsigned_long_long_fract_type_node);
5456 sat_short_fract_type_node);
5459 sat_long_fract_type_node);
5461 sat_long_long_fract_type_node);
5463 sat_unsigned_short_fract_type_node);
5465 sat_unsigned_fract_type_node);
5467 sat_unsigned_long_fract_type_node);
5469 sat_unsigned_long_long_fract_type_node);
5474 long_long_accum_type_node);
5476 unsigned_short_accum_type_node);
5478 unsigned_accum_type_node);
5480 unsigned_long_accum_type_node);
5482 unsigned_long_long_accum_type_node);
5484 sat_short_accum_type_node);
5487 sat_long_accum_type_node);
5489 sat_long_long_accum_type_node);
5491 sat_unsigned_short_accum_type_node);
5493 sat_unsigned_accum_type_node);
5495 sat_unsigned_long_accum_type_node);
5497 sat_unsigned_long_long_accum_type_node);
5499 }
5502 TYPE_DECL,
5504 complex_integer_type_node));
5506 TYPE_DECL,
5508 complex_float_type_node));
5510 TYPE_DECL,
5512 complex_double_type_node));
5516 complex_long_double_type_node));
5519 /* For C++, make fileptr_type_node a distinct void * type until
5520 FILE type is defined. */
5525 /* Set the TYPE_NAME for any variants that were built before
5526 record_builtin_type gave names to the built-in types. */
5527 {
5533 }
5537 /* Make a type to be the domain of a few array types
5538 whose domains don't really matter.
5539 200 is small enough that it always fits in size_t
5540 and large enough that it can hold most function names for the
5541 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5544 /* Make a type for arrays of characters.
5545 With luck nothing will ever really depend on the length of this
5546 array type. */
5547 char_array_type_node
5551 const_string_type_node
5555 /* This is special for C++ so functions can be overloaded. */
5561 {
5564 else
5567 }
5569 /* This is for wide string constants. */
5570 wchar_array_type_node
5573 /* Define 'char16_t'. */
5578 {
5583 }
5585 /* This is for UTF-16 string constants. */
5586 char16_array_type_node
5589 /* Define 'char32_t'. */
5594 {
5599 }
5601 /* This is for UTF-32 string constants. */
5602 char32_array_type_node
5605 wint_type_node =
5608 intmax_type_node =
5610 uintmax_type_node =
5614 sig_atomic_type_node =
5617 int8_type_node =
5620 int16_type_node =
5623 int32_type_node =
5626 int64_type_node =
5629 uint8_type_node =
5641 int_least8_type_node =
5644 int_least16_type_node =
5647 int_least32_type_node =
5650 int_least64_type_node =
5653 uint_least8_type_node =
5656 uint_least16_type_node =
5659 uint_least32_type_node =
5662 uint_least64_type_node =
5665 int_fast8_type_node =
5668 int_fast16_type_node =
5671 int_fast32_type_node =
5674 int_fast64_type_node =
5677 uint_fast8_type_node =
5680 uint_fast16_type_node =
5683 uint_fast32_type_node =
5686 uint_fast64_type_node =
5689 intptr_type_node =
5692 uintptr_type_node =
5695 default_function_type
5697 ptrdiff_type_node
5704 va_list_type_node));
5706 {
5709 tree ptype;
5712 {
5716 ptype));
5718 }
5719 }
5722 {
5725 }
5726 else
5727 {
5730 }
5737 /* Create the built-in __null node. It is important that this is
5738 not shared. */
5742 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5744 }
5746 /* The number of named compound-literals generated thus far. */
5749 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5751 void
5753 {
5756 compound_literal_number);
5757 compound_literal_number++;
5759 }
5761 tree
5763 {
5767 }
5770 /* Linked list of disabled built-in functions. */
5773 {
5781 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5782 begins with "__builtin_", give an error. */
5784 void
5786 {
5789 else
5790 {
5795 }
5796 }
5799 /* Return true if the built-in function NAME has been disabled, false
5800 otherwise. */
5802 static bool
5804 {
5807 {
5810 }
5812 }
5815 /* Worker for DEF_BUILTIN.
5816 Possibly define a builtin function with one or two names.
5817 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5818 nonansi_p and flag_no_nonansi_builtin. */
5820 static void
5827 {
5828 tree decl;
5841 fnattrs);
5850 }
5851 \f
5852 /* Nonzero if the type T promotes to int. This is (nearly) the
5853 integral promotions defined in ISO C99 6.3.1.1/2. */
5855 bool
5857 {
5859 {
5869 /* ??? Technically all enumerations not larger than an int
5870 promote to an int. But this is used along code paths
5871 that only want to notice a size change. */
5879 }
5880 }
5882 /* Return 1 if PARMS specifies a fixed number of parameters
5883 and none of their types is affected by default promotions. */
5885 int
5887 {
5888 const_tree t;
5890 {
5907 }
5909 }
5911 /* Recursively remove any '*' or '&' operator from TYPE. */
5912 tree
5914 {
5918 }
5920 /* Recursively remove pointer or array type from TYPE. */
5921 tree
5923 {
5927 }
5929 /* Used to compare case labels. K1 and K2 are actually tree nodes
5930 representing case labels, or NULL_TREE for a `default' label.
5931 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5932 K2, and 0 if K1 and K2 are equal. */
5934 int
5936 {
5937 /* Consider a NULL key (such as arises with a `default' label) to be
5938 smaller than anything else. */
5945 }
5947 /* Process a case label, located at LOC, for the range LOW_VALUE
5948 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5949 then this case label is actually a `default' label. If only
5950 HIGH_VALUE is NULL_TREE, then case label was declared using the
5951 usual C/C++ syntax, rather than the GNU case range extension.
5952 CASES is a tree containing all the case ranges processed so far;
5953 COND is the condition for the switch-statement itself. Returns the
5954 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5955 is created. */
5957 tree
5960 {
5961 tree type;
5962 tree label;
5963 tree case_label;
5964 splay_tree_node node;
5966 /* Create the LABEL_DECL itself. */
5969 /* If there was an error processing the switch condition, bail now
5970 before we get more confused. */
5978 {
5981 }
5983 /* Case ranges are a GNU extension. */
5990 {
5995 }
5997 {
6002 }
6005 {
6006 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6007 really a case range, even though it was written that way.
6008 Remove the HIGH_VALUE to simplify later processing. */
6013 }
6015 /* See if the case is in range of the type of the original testing
6016 expression. If both low_value and high_value are out of range,
6017 don't insert the case label and return NULL_TREE. */
6023 /* Look up the LOW_VALUE in the table of case labels we already
6024 have. */
6026 /* If there was not an exact match, check for overlapping ranges.
6027 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6028 that's a `default' label and the only overlap is an exact match. */
6030 {
6031 splay_tree_node low_bound;
6032 splay_tree_node high_bound;
6034 /* Even though there wasn't an exact match, there might be an
6035 overlap between this case range and another case range.
6036 Since we've (inductively) not allowed any overlapping case
6037 ranges, we simply need to find the greatest low case label
6038 that is smaller that LOW_VALUE, and the smallest low case
6039 label that is greater than LOW_VALUE. If there is an overlap
6040 it will occur in one of these two ranges. */
6046 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6047 the LOW_VALUE, so there is no need to check unless the
6048 LOW_BOUND is in fact itself a case range. */
6054 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6055 range is bigger than the low end of the current range, so we
6056 are only interested if the current range is a real range, and
6057 not an ordinary case label. */
6059 && high_value
6061 high_value)
6064 }
6065 /* If there was an overlap, issue an error. */
6067 {
6071 {
6075 }
6077 {
6080 }
6081 else
6082 {
6086 }
6088 }
6090 /* Add a CASE_LABEL to the statement-tree. */
6092 /* Register this case label in the splay tree. */
6099 error_out:
6100 /* Add a label so that the back-end doesn't think that the beginning of
6101 the switch is unreachable. Note that we do not add a case label, as
6102 that just leads to duplicates and thence to failure later on. */
6104 {
6107 }
6109 }
6111 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6112 Used to verify that case values match up with enumerator values. */
6114 static void
6116 {
6123 else
6130 buf);
6131 else
6136 }
6138 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6139 Used to verify that case values match up with enumerator values. */
6141 static int
6143 {
6147 /* Skip default case. */
6151 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6152 when we did our enum->case scan. Reset our scratch bit after. */
6155 else
6158 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6159 not set, that means that CASE_HIGH did not appear when we did our
6160 enum->case scan. Reset our scratch bit after. */
6162 {
6165 else
6167 }
6170 }
6172 /* Handle -Wswitch*. Called from the front end after parsing the
6173 switch construct. */
6174 /* ??? Should probably be somewhere generic, since other languages
6175 besides C and C++ would want this. At the moment, however, C/C++
6176 are the only tree-ssa languages that support enumerations at all,
6177 so the point is moot. */
6179 void
6182 {
6183 splay_tree_node default_node;
6184 splay_tree_node node;
6185 tree chain;
6195 /* From here on, we only care about about enumerated types. */
6199 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6203 /* Check the cases. Warn about case values which are not members of
6204 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6205 there is no default case, check that exactly all enumeration
6206 literals are covered by the cases. */
6208 /* Clearing COND if it is not an integer constant simplifies
6209 the tests inside the loop below. */
6213 /* The time complexity here is O(N*lg(N)) worst case, but for the
6214 common case of monotonically increasing enumerators, it is
6215 O(N), since the nature of the splay tree will keep the next
6216 element adjacent to the root at all times. */
6219 {
6225 {
6226 /* Mark the CASE_LOW part of the case entry as seen. */
6230 }
6232 /* Even though there wasn't an exact match, there might be a
6233 case range which includes the enumerator's value. */
6236 {
6240 {
6241 /* If we match the upper bound exactly, mark the CASE_HIGH
6242 part of the case entry as seen. */
6246 }
6247 }
6249 /* We've now determined that this enumerated literal isn't
6250 handled by the case labels of the switch statement. */
6252 /* If the switch expression is a constant, we only really care
6253 about whether that constant is handled by the switch. */
6257 /* If there is a default_node, the only relevant option is
6258 Wswitch-enum. Otherwise, if both are enabled then we prefer
6259 to warn using -Wswitch because -Wswitch is enabled by -Wall
6260 while -Wswitch-enum is explicit. */
6263 ? OPT_Wswitch_enum
6267 }
6269 /* Warn if there are case expressions that don't correspond to
6270 enumerators. This can occur since C and C++ don't enforce
6271 type-checking of assignments to enumeration variables.
6273 The time complexity here is now always O(N) worst case, since
6274 we should have marked both the lower bound and upper bound of
6275 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6276 above. This scan also resets those fields. */
6279 }
6281 /* Finish an expression taking the address of LABEL (an
6282 IDENTIFIER_NODE). Returns an expression for the address.
6284 LOC is the location for the expression returned. */
6286 tree
6288 {
6289 tree result;
6299 else
6300 {
6303 /* The current function is not necessarily uninlinable.
6304 Computed gotos are incompatible with inlining, but the value
6305 here could be used only in a diagnostic, for example. */
6307 }
6310 }
6311 \f
6313 /* Given a boolean expression ARG, return a tree representing an increment
6314 or decrement (as indicated by CODE) of ARG. The front end must check for
6315 invalid cases (e.g., decrement in C++). */
6316 tree
6318 {
6319 tree val;
6324 {
6347 }
6350 }
6351 \f
6352 /* Built-in macros for stddef.h and stdint.h, that require macros
6353 defined in this file. */
6354 void
6356 {
6419 }
6421 static void
6423 {
6424 /* Fill in the built_in_attributes array. */
6425 #define DEF_ATTR_NULL_TREE(ENUM) \
6426 built_in_attributes[(int) ENUM] = NULL_TREE;
6427 #define DEF_ATTR_INT(ENUM, VALUE) \
6428 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6429 #define DEF_ATTR_STRING(ENUM, VALUE) \
6430 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6431 #define DEF_ATTR_IDENT(ENUM, STRING) \
6432 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6433 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6434 built_in_attributes[(int) ENUM] \
6435 = tree_cons (built_in_attributes[(int) PURPOSE], \
6436 built_in_attributes[(int) VALUE], \
6437 built_in_attributes[(int) CHAIN]);
6439 #undef DEF_ATTR_NULL_TREE
6440 #undef DEF_ATTR_INT
6441 #undef DEF_ATTR_IDENT
6442 #undef DEF_ATTR_TREE_LIST
6443 }
6445 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6446 identifier as an argument, so the front end shouldn't look it up. */
6448 bool
6450 {
6453 /* Unknown attribute that we'll end up ignoring, return true so we
6454 don't complain about an identifier argument. */
6460 else
6462 }
6464 /* Attribute handlers common to C front ends. */
6466 /* Handle a "packed" attribute; arguments as in
6467 struct attribute_spec.handler. */
6469 static tree
6472 {
6474 {
6478 }
6480 {
6482 /* Still pack bitfields. */
6487 else
6489 }
6490 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6491 used for DECL_REGISTER. It wouldn't mean anything anyway.
6492 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6493 that changes what the typedef is typing. */
6494 else
6495 {
6498 }
6501 }
6503 /* Handle a "nocommon" attribute; arguments as in
6504 struct attribute_spec.handler. */
6506 static tree
6510 {
6513 else
6514 {
6517 }
6520 }
6522 /* Handle a "common" attribute; arguments as in
6523 struct attribute_spec.handler. */
6525 static tree
6528 {
6531 else
6532 {
6535 }
6538 }
6540 /* Handle a "noreturn" attribute; arguments as in
6541 struct attribute_spec.handler. */
6543 static tree
6546 {
6549 /* See FIXME comment in c_common_attribute_table. */
6556 = (build_qualified_type
6557 (build_pointer_type
6561 else
6562 {
6565 }
6568 }
6570 /* Handle a "hot" and attribute; arguments as in
6571 struct attribute_spec.handler. */
6573 static tree
6576 {
6579 {
6581 {
6585 }
6586 /* Most of the rest of the hot processing is done later with
6587 lookup_attribute. */
6588 }
6589 else
6590 {
6593 }
6596 }
6598 /* Handle a "cold" and attribute; arguments as in
6599 struct attribute_spec.handler. */
6601 static tree
6604 {
6607 {
6609 {
6613 }
6614 /* Most of the rest of the cold processing is done later with
6615 lookup_attribute. */
6616 }
6617 else
6618 {
6621 }
6624 }
6626 /* Handle a "no_sanitize_address" attribute; arguments as in
6627 struct attribute_spec.handler. */
6629 static tree
6632 {
6634 {
6637 }
6640 }
6642 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6643 struct attribute_spec.handler. */
6645 static tree
6648 {
6657 }
6659 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6660 struct attribute_spec.handler. */
6662 static tree
6665 {
6667 {
6670 }
6673 }
6675 /* Handle a "noinline" attribute; arguments as in
6676 struct attribute_spec.handler. */
6678 static tree
6682 {
6684 {
6686 {
6690 }
6691 else
6693 }
6694 else
6695 {
6698 }
6701 }
6703 /* Handle a "noclone" attribute; arguments as in
6704 struct attribute_spec.handler. */
6706 static tree
6710 {
6712 {
6715 }
6718 }
6720 /* Handle a "always_inline" attribute; arguments as in
6721 struct attribute_spec.handler. */
6723 static tree
6728 {
6730 {
6732 {
6736 }
6737 else
6738 /* Set the attribute and mark it for disregarding inline
6739 limits. */
6741 }
6742 else
6743 {
6746 }
6749 }
6751 /* Handle a "gnu_inline" attribute; arguments as in
6752 struct attribute_spec.handler. */
6754 static tree
6759 {
6761 {
6762 /* Do nothing else, just set the attribute. We'll get at
6763 it later with lookup_attribute. */
6764 }
6765 else
6766 {
6769 }
6772 }
6774 /* Handle a "leaf" attribute; arguments as in
6775 struct attribute_spec.handler. */
6777 static tree
6781 {
6783 {
6786 }
6788 {
6791 }
6794 }
6796 /* Handle an "artificial" attribute; arguments as in
6797 struct attribute_spec.handler. */
6799 static tree
6804 {
6806 {
6807 /* Do nothing else, just set the attribute. We'll get at
6808 it later with lookup_attribute. */
6809 }
6810 else
6811 {
6814 }
6817 }
6819 /* Handle a "flatten" attribute; arguments as in
6820 struct attribute_spec.handler. */
6822 static tree
6824 tree args ATTRIBUTE_UNUSED,
6826 {
6828 /* Do nothing else, just set the attribute. We'll get at
6829 it later with lookup_attribute. */
6830 ;
6831 else
6832 {
6835 }
6838 }
6840 /* Handle a "warning" or "error" attribute; arguments as in
6841 struct attribute_spec.handler. */
6843 static tree
6846 {
6849 /* Do nothing else, just set the attribute. We'll get at
6850 it later with lookup_attribute. */
6851 ;
6852 else
6853 {
6856 }
6859 }
6861 /* Handle a "used" attribute; arguments as in
6862 struct attribute_spec.handler. */
6864 static tree
6867 {
6873 {
6878 }
6879 else
6880 {
6883 }
6886 }
6888 /* Handle a "unused" attribute; arguments as in
6889 struct attribute_spec.handler. */
6891 static tree
6894 {
6896 {
6904 {
6909 }
6910 else
6911 {
6914 }
6915 }
6916 else
6917 {
6921 }
6924 }
6926 /* Handle a "externally_visible" attribute; arguments as in
6927 struct attribute_spec.handler. */
6929 static tree
6934 {
6938 {
6941 {
6945 }
6946 }
6947 else
6948 {
6951 }
6954 }
6956 /* Handle a "const" attribute; arguments as in
6957 struct attribute_spec.handler. */
6959 static tree
6962 {
6965 /* See FIXME comment on noreturn in c_common_attribute_table. */
6971 = (build_qualified_type
6972 (build_pointer_type
6976 else
6977 {
6980 }
6983 }
6985 /* Handle a "transparent_union" attribute; arguments as in
6986 struct attribute_spec.handler. */
6988 static tree
6992 {
6993 tree type;
7004 {
7005 /* Make sure that the first field will work for a transparent union.
7006 If the type isn't complete yet, leave the check to the code in
7007 finish_struct. */
7009 {
7015 }
7018 {
7019 /* If the type isn't complete yet, setting the flag
7020 on a variant wouldn't ever be checked. */
7024 /* build_duplicate_type doesn't work for C++. */
7028 /* A type variant isn't good enough, since we don't a cast
7029 to such a type removed as a no-op. */
7031 }
7035 }
7037 ignored:
7040 }
7042 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7043 get the requested priority for a constructor or destructor,
7044 possibly issuing diagnostics for invalid or reserved
7045 priorities. */
7047 static priority_type
7049 {
7050 HOST_WIDE_INT pri;
7051 tree arg;
7057 {
7060 else
7063 }
7080 {
7083 "destructor priorities from 0 to %d are reserved "
7085 MAX_RESERVED_INIT_PRIORITY);
7086 else
7088 "constructor priorities from 0 to %d are reserved "
7090 MAX_RESERVED_INIT_PRIORITY);
7091 }
7094 invalid:
7097 MAX_INIT_PRIORITY);
7098 else
7100 MAX_INIT_PRIORITY);
7102 }
7104 /* Handle a "constructor" attribute; arguments as in
7105 struct attribute_spec.handler. */
7107 static tree
7111 {
7118 {
7119 priority_type priority;
7124 }
7125 else
7126 {
7129 }
7132 }
7134 /* Handle a "destructor" attribute; arguments as in
7135 struct attribute_spec.handler. */
7137 static tree
7141 {
7148 {
7149 priority_type priority;
7154 }
7155 else
7156 {
7159 }
7162 }
7164 /* Nonzero if the mode is a valid vector mode for this architecture.
7165 This returns nonzero even if there is no hardware support for the
7166 vector mode, but we can emulate with narrower modes. */
7168 static int
7170 {
7174 /* Doh! What's going on? */
7183 /* Hardware support. Woo hoo! */
7189 /* We should probably return 1 if requesting V4DI and we have no DI,
7190 but we have V2DI, but this is probably very unlikely. */
7192 /* If we have support for the inner mode, we can safely emulate it.
7193 We may not have V2DI, but me can emulate with a pair of DIs. */
7195 }
7198 /* Handle a "mode" attribute; arguments as in
7199 struct attribute_spec.handler. */
7201 static tree
7204 {
7212 else
7213 {
7218 tree typefm;
7223 {
7229 }
7231 /* Change this type to have a type with the specified mode.
7232 First check for the special modes. */
7245 else
7248 {
7251 }
7254 {
7257 }
7261 {
7293 }
7295 {
7298 }
7301 {
7306 {
7309 }
7313 else
7316 }
7317 else
7318 {
7319 /* For fixed-point modes, we need to test if the signness of type
7320 and the machine mode are consistent. */
7323 {
7326 }
7327 /* For fixed-point modes, we need to pass saturating info. */
7331 }
7334 {
7337 }
7339 {
7340 /* For enumeral types, copy the precision from the integer
7341 type returned above. If not an INTEGER_TYPE, we can't use
7342 this mode for this type. */
7344 {
7347 }
7350 {
7353 }
7354 else
7355 {
7356 /* We cannot build a type variant, as there's code that assumes
7357 that TYPE_MAIN_VARIANT has the same mode. This includes the
7358 debug generators. Instead, create a subrange type. This
7359 results in all of the enumeral values being emitted only once
7360 in the original, and the subtype gets them by reference. */
7363 else
7366 }
7367 }
7371 {
7374 }
7377 }
7380 }
7382 /* Handle a "section" attribute; arguments as in
7383 struct attribute_spec.handler. */
7385 static tree
7388 {
7392 {
7398 {
7402 {
7404 "section attribute cannot be specified for "
7407 }
7409 /* The decl may have already been given a section attribute
7410 from a previous declaration. Ensure they match. */
7414 {
7418 }
7422 {
7425 }
7426 else
7429 }
7430 else
7431 {
7434 }
7435 }
7436 else
7437 {
7441 }
7444 }
7446 /* Check whether ALIGN is a valid user-specified alignment. If so,
7447 return its base-2 log; if not, output an error and return -1. If
7448 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7449 no error. */
7450 int
7452 {
7459 {
7462 }
7467 {
7470 }
7472 {
7475 }
7477 }
7479 /*
7480 If in c++-11, check if the c++-11 alignment constraint with respect
7481 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7482 c++-11 mode, does nothing.
7484 [dcl.align]2/ says:
7486 [* if the constant expression evaluates to a fundamental alignment,
7487 the alignment requirement of the declared entity shall be the
7488 specified fundamental alignment.
7490 * if the constant expression evaluates to an extended alignment
7491 and the implementation supports that alignment in the context
7492 of the declaration, the alignment of the declared entity shall
7493 be that alignment
7495 * if the constant expression evaluates to an extended alignment
7496 and the implementation does not support that alignment in the
7497 context of the declaration, the program is ill-formed]. */
7499 static bool
7503 {
7516 {
7518 {
7519 /* For file scope variables and static members, the target
7520 supports alignments that are at most
7521 MAX_OFILE_ALIGNMENT. */
7524 }
7525 else
7526 {
7527 #ifdef BIGGEST_FIELD_ALIGNMENT
7528 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7529 #else
7530 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7531 #endif
7532 /* For non-static members, the target supports either
7533 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7534 if it is defined or BIGGEST_ALIGNMENT. */
7539 #undef MAX_TARGET_FIELD_ALIGNMENT
7540 /* For stack variables, the target supports at most
7541 MAX_STACK_ALIGNMENT. */
7545 }
7546 }
7548 {
7549 /* Let's be liberal for types. */
7552 }
7560 }
7562 /* Handle a "aligned" attribute; arguments as in
7563 struct attribute_spec.handler. */
7565 static tree
7568 {
7572 tree align_expr;
7576 {
7581 }
7582 else
7586 {
7590 }
7598 {
7601 /* If we have a TYPE_DECL, then copy the type, so that we
7602 don't accidentally modify a builtin type. See pushdecl. */
7605 {
7612 }
7613 else
7618 }
7621 {
7624 }
7627 /* C++-11 [dcl.align/4]:
7629 When multiple alignment-specifiers are specified for an
7630 entity, the alignment requirement shall be set to the
7631 strictest specified alignment.
7633 This formally comes from the c++11 specification but we are
7634 doing it for the GNU attribute syntax as well. */
7638 {
7643 else
7647 }
7648 else
7649 {
7652 }
7655 }
7657 /* Handle a "weak" attribute; arguments as in
7658 struct attribute_spec.handler. */
7660 static tree
7665 {
7668 {
7671 }
7673 {
7677 }
7681 else
7685 }
7687 /* Handle an "alias" or "ifunc" attribute; arguments as in
7688 struct attribute_spec.handler, except that IS_ALIAS tells us
7689 whether this is an alias as opposed to ifunc attribute. */
7691 static tree
7694 {
7699 {
7702 }
7706 /* A static variable declaration is always a tentative definition,
7707 but the alias is a non-tentative definition which overrides. */
7710 {
7714 }
7718 {
7722 }
7724 /* Note that the very first time we process a nested declaration,
7725 decl_function_context will not be set. Indeed, *would* never
7726 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7727 we do below. After such frobbery, pushdecl would set the context.
7728 In any case, this is never what we want. */
7730 {
7731 tree id;
7735 {
7739 }
7741 /* This counts as a use of the object pointed to. */
7746 else
7750 /* ifuncs are also aliases, so set that attribute too. */
7753 }
7754 else
7755 {
7758 }
7761 }
7763 /* Handle an "alias" or "ifunc" attribute; arguments as in
7764 struct attribute_spec.handler. */
7766 static tree
7769 {
7771 }
7773 /* Handle an "alias" or "ifunc" attribute; arguments as in
7774 struct attribute_spec.handler. */
7776 static tree
7779 {
7781 }
7783 /* Handle a "weakref" attribute; arguments as in struct
7784 attribute_spec.handler. */
7786 static tree
7789 {
7792 /* We must ignore the attribute when it is associated with
7793 local-scoped decls, since attribute alias is ignored and many
7794 such symbols do not even have a DECL_WEAK field. */
7796 || current_function_decl
7798 {
7802 }
7805 {
7809 }
7811 /* The idea here is that `weakref("name")' mutates into `weakref,
7812 alias("name")', and weakref without arguments, in turn,
7813 implicitly adds weak. */
7816 {
7823 }
7824 else
7825 {
7830 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7831 and that isn't supported; and because it wants to add it to
7832 the list of weak decls, which isn't helpful. */
7834 }
7837 }
7839 /* Handle an "visibility" attribute; arguments as in
7840 struct attribute_spec.handler. */
7842 static tree
7846 {
7852 {
7856 {
7858 name);
7860 }
7862 {
7866 }
7867 }
7869 {
7872 }
7875 {
7878 }
7880 /* If this is a type, set the visibility on the type decl. */
7882 {
7887 {
7889 name);
7891 }
7892 }
7902 else
7903 {
7904 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7906 }
7910 {
7924 }
7929 /* Go ahead and attach the attribute to the node as well. This is needed
7930 so we can determine whether we have VISIBILITY_DEFAULT because the
7931 visibility was not specified, or because it was explicitly overridden
7932 from the containing scope. */
7935 }
7937 /* Determine the ELF symbol visibility for DECL, which is either a
7938 variable or a function. It is an error to use this function if a
7939 definition of DECL is not available in this translation unit.
7940 Returns true if the final visibility has been determined by this
7941 function; false if the caller is free to make additional
7942 modifications. */
7944 bool
7946 {
7950 /* If the user explicitly specified the visibility with an
7951 attribute, honor that. DECL_VISIBILITY will have been set during
7952 the processing of the attribute. We check for an explicit
7953 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7954 to distinguish the use of an attribute from the use of a "#pragma
7955 GCC visibility push(...)"; in the latter case we still want other
7956 considerations to be able to overrule the #pragma. */
7958 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7963 /* Set default visibility to whatever the user supplied with
7964 visibility_specified depending on #pragma GCC visibility. */
7966 {
7969 {
7972 /* If visibility changed and DECL already has DECL_RTL, ensure
7973 symbol flags are updated. */
7978 }
7979 }
7981 }
7983 /* Handle an "tls_model" attribute; arguments as in
7984 struct attribute_spec.handler. */
7986 static tree
7989 {
7990 tree id;
7997 {
8000 }
8005 {
8008 }
8018 else
8019 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8023 }
8025 /* Handle a "no_instrument_function" attribute; arguments as in
8026 struct attribute_spec.handler. */
8028 static tree
8033 {
8037 {
8041 }
8042 else
8046 }
8048 /* Handle a "malloc" attribute; arguments as in
8049 struct attribute_spec.handler. */
8051 static tree
8054 {
8058 else
8059 {
8062 }
8065 }
8067 /* Handle a "alloc_size" attribute; arguments as in
8068 struct attribute_spec.handler. */
8070 static tree
8073 {
8076 {
8083 || !arg_count
8085 {
8090 }
8091 }
8093 }
8095 /* Handle a "alloc_align" attribute; arguments as in
8096 struct attribute_spec.handler. */
8098 static tree
8101 {
8108 || !arg_count
8110 {
8115 }
8117 }
8119 /* Handle a "assume_aligned" attribute; arguments as in
8120 struct attribute_spec.handler. */
8122 static tree
8125 {
8127 {
8134 {
8139 }
8140 }
8142 }
8144 /* Handle a "fn spec" attribute; arguments as in
8145 struct attribute_spec.handler. */
8147 static tree
8151 {
8156 }
8158 /* Handle a "warn_unused" attribute; arguments as in
8159 struct attribute_spec.handler. */
8161 static tree
8163 tree args ATTRIBUTE_UNUSED,
8165 {
8167 /* Do nothing else, just set the attribute. We'll get at
8168 it later with lookup_attribute. */
8169 ;
8170 else
8171 {
8174 }
8177 }
8179 /* Handle an "omp declare simd" attribute; arguments as in
8180 struct attribute_spec.handler. */
8182 static tree
8184 {
8186 }
8188 /* Handle an "omp declare target" attribute; arguments as in
8189 struct attribute_spec.handler. */
8191 static tree
8193 {
8195 }
8197 /* Handle a "returns_twice" attribute; arguments as in
8198 struct attribute_spec.handler. */
8200 static tree
8203 {
8206 else
8207 {
8210 }
8213 }
8215 /* Handle a "no_limit_stack" attribute; arguments as in
8216 struct attribute_spec.handler. */
8218 static tree
8223 {
8227 {
8231 }
8233 {
8237 }
8238 else
8242 }
8244 /* Handle a "pure" attribute; arguments as in
8245 struct attribute_spec.handler. */
8247 static tree
8250 {
8253 /* ??? TODO: Support types. */
8254 else
8255 {
8258 }
8261 }
8263 /* Digest an attribute list destined for a transactional memory statement.
8264 ALLOWED is the set of attributes that are allowed for this statement;
8265 return the attribute we parsed. Multiple attributes are never allowed. */
8267 int
8269 {
8274 {
8282 {
8285 }
8288 {
8291 }
8294 else
8296 }
8299 }
8301 /* Transform a TM attribute name into a maskable integer and back.
8302 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8303 to how the lack of an attribute is treated. */
8305 int
8307 {
8321 }
8323 tree
8325 {
8328 {
8346 }
8348 }
8350 /* Return the first TM attribute seen in LIST. */
8352 tree
8354 {
8356 {
8360 }
8362 }
8364 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8365 Here we accept only function types, and verify that none of the other
8366 function TM attributes are also applied. */
8367 /* ??? We need to accept class types for C++, but not C. This greatly
8368 complicates this function, since we can no longer rely on the extra
8369 processing given by function_type_required. */
8371 static tree
8374 {
8375 /* Only one path adds the attribute; others don't. */
8379 {
8382 /* Only tm_callable and tm_safe apply to classes. */
8385 /* FALLTHRU */
8389 {
8392 ;
8395 else
8397 }
8401 {
8404 {
8409 }
8410 }
8411 /* FALLTHRU */
8414 /* If a function is next, pass it on to be tried next. */
8418 ignored:
8421 }
8424 }
8426 /* Handle the TM_WRAP attribute; arguments as in
8427 struct attribute_spec.handler. */
8429 static tree
8432 {
8435 /* We don't need the attribute even on success, since we
8436 record the entry in an external table. */
8441 else
8442 {
8445 ;
8450 else
8451 {
8455 {
8459 else
8461 }
8462 else
8464 }
8465 }
8468 }
8470 /* Ignore the given attribute. Used when this attribute may be usefully
8471 overridden by the target, but is not used generically. */
8473 static tree
8477 {
8480 }
8482 /* Handle a "no vops" attribute; arguments as in
8483 struct attribute_spec.handler. */
8485 static tree
8489 {
8493 }
8495 /* Handle a "deprecated" attribute; arguments as in
8496 struct attribute_spec.handler. */
8498 static tree
8502 {
8510 {
8513 }
8516 {
8527 else
8529 }
8531 {
8536 }
8537 else
8541 {
8544 {
8550 }
8553 else
8555 }
8558 }
8560 /* Handle a "vector_size" attribute; arguments as in
8561 struct attribute_spec.handler. */
8563 static tree
8567 {
8580 {
8583 }
8585 /* Get the vector size (in bytes). */
8588 /* We need to provide for vector pointers, vector arrays, and
8589 functions returning vectors. For example:
8591 __attribute__((vector_size(16))) short *foo;
8593 In this case, the mode is SI, but the type being modified is
8594 HI, so we need to look further. */
8603 /* Get the mode of the type being modified. */
8614 {
8617 }
8620 {
8623 }
8626 {
8629 }
8631 /* Calculate how many units fit in the vector. */
8634 {
8637 }
8641 /* Build back pointers if needed. */
8645 }
8647 /* Handle the "nonnull" attribute. */
8648 static tree
8652 {
8656 /* If no arguments are specified, all pointer arguments should be
8657 non-null. Verify a full prototype is given so that the arguments
8658 will have the correct types when we actually check them later. */
8660 {
8662 {
8665 }
8667 }
8669 /* Argument list specified. Verify that each argument number references
8670 a pointer argument. */
8672 {
8681 {
8686 }
8689 {
8690 function_args_iterator iter;
8691 tree argument;
8695 {
8699 }
8703 {
8708 }
8711 {
8716 }
8717 }
8718 }
8721 }
8723 /* Check the argument list of a function call for null in argument slots
8724 that are marked as requiring a non-null pointer argument. The NARGS
8725 arguments are passed in the array ARGARRAY.
8726 */
8728 static void
8730 {
8731 tree a;
8739 /* See if any of the nonnull attributes has no arguments. If so,
8740 then every pointer argument is checked (in which case the check
8741 for pointer type is done in check_nonnull_arg). */
8743 do
8751 else
8752 {
8753 /* Walk the argument list. If we encounter an argument number we
8754 should check for non-null, do it. */
8756 {
8758 {
8762 }
8767 }
8768 }
8769 }
8771 /* Check that the Nth argument of a function call (counting backwards
8772 from the end) is a (pointer)0. The NARGS arguments are passed in the
8773 array ARGARRAY. */
8775 static void
8777 {
8781 {
8784 tree sentinel;
8785 function_args_iterator iter;
8786 tree t;
8788 /* Skip over the named arguments. */
8790 {
8793 len++;
8794 }
8797 {
8800 }
8802 /* The sentinel must be one of the varargs, i.e.
8803 in position >= the number of fixed arguments. */
8805 {
8809 }
8811 /* Validate the sentinel. */
8815 /* Although __null (in C++) is only an integer we allow it
8816 nevertheless, as we are guaranteed that it's exactly
8817 as wide as a pointer, and we don't want to force
8818 users to cast the NULL they have written there.
8819 We warn with -Wstrict-null-sentinel, though. */
8822 }
8823 }
8825 /* Helper for check_function_nonnull; given a list of operands which
8826 must be non-null in ARGS, determine if operand PARAM_NUM should be
8827 checked. */
8829 static bool
8831 {
8835 {
8842 }
8844 }
8846 /* Check that the function argument PARAM (which is operand number
8847 PARAM_NUM) is non-null. This is called by check_function_nonnull
8848 via check_function_arguments_recurse. */
8850 static void
8853 {
8854 /* Just skip checking the argument if it's not a pointer. This can
8855 happen if the "nonnull" attribute was given without an operand
8856 list (which means to check every pointer argument). */
8864 }
8866 /* Helper for nonnull attribute handling; fetch the operand number
8867 from the attribute argument list. */
8869 static bool
8871 {
8872 /* Verify the arg number is a small constant. */
8874 {
8877 }
8878 else
8880 }
8882 /* Handle a "nothrow" attribute; arguments as in
8883 struct attribute_spec.handler. */
8885 static tree
8888 {
8891 /* ??? TODO: Support types. */
8892 else
8893 {
8896 }
8899 }
8901 /* Handle a "cleanup" attribute; arguments as in
8902 struct attribute_spec.handler. */
8904 static tree
8907 {
8911 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8912 for global destructors in C++. This requires infrastructure that
8913 we don't have generically at the moment. It's also not a feature
8914 we'd be missing too much, since we do have attribute constructor. */
8916 {
8920 }
8922 /* Verify that the argument is a function in scope. */
8923 /* ??? We could support pointers to functions here as well, if
8924 that was considered desirable. */
8927 {
8931 }
8934 {
8938 }
8940 /* That the function has proper type is checked with the
8941 eventual call to build_function_call. */
8944 }
8946 /* Handle a "warn_unused_result" attribute. No special handling. */
8948 static tree
8952 {
8953 /* Ignore the attribute for functions not returning any value. */
8955 {
8958 }
8961 }
8963 /* Handle a "sentinel" attribute. */
8965 static tree
8968 {
8970 {
8974 }
8975 else
8976 {
8978 {
8982 }
8983 }
8986 {
8994 {
8998 }
8999 else
9000 {
9002 {
9006 }
9007 }
9008 }
9011 }
9013 /* Handle a "type_generic" attribute. */
9015 static tree
9019 {
9020 /* Ensure we have a function type. */
9023 /* Ensure we have a variadic function. */
9027 }
9029 /* Handle a "target" attribute. */
9031 static tree
9034 {
9035 /* Ensure we have a function type. */
9037 {
9040 }
9042 flags))
9046 }
9048 /* Arguments being collected for optimization. */
9053 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9054 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9055 false for #pragma GCC optimize. */
9057 bool
9059 {
9067 tree ap;
9069 /* Build up argv vector. Just in case the string is stored away, use garbage
9070 collected strings. */
9075 {
9079 {
9083 }
9086 {
9087 /* Split string into multiple substrings. */
9095 {
9102 {
9106 }
9107 else
9108 {
9111 }
9115 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9116 options. */
9118 {
9123 else
9127 }
9130 {
9133 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9134 itself is -Os, and any other switch begins with a -f. */
9140 }
9145 }
9147 }
9148 }
9158 /* Now parse the options. */
9168 /* Don't allow changing -fstrict-aliasing. */
9173 }
9175 /* For handling "optimize" attribute. arguments as in
9176 struct attribute_spec.handler. */
9178 static tree
9181 {
9182 /* Ensure we have a function type. */
9184 {
9187 }
9188 else
9189 {
9193 /* Save current options. */
9196 /* If we previously had some optimization options, use them as the
9197 default. */
9202 /* Parse options, and update the vector. */
9207 /* Restore current options. */
9209 }
9212 }
9214 /* Handle a "no_split_stack" attribute. */
9216 static tree
9221 {
9225 {
9229 }
9231 {
9235 }
9238 }
9240 /* Handle a "returns_nonnull" attribute; arguments as in
9241 struct attribute_spec.handler. */
9243 static tree
9246 {
9247 // Even without a prototype we still have a return type we can check.
9249 {
9252 }
9254 }
9256 /* Handle a "designated_init" attribute; arguments as in
9257 struct attribute_spec.handler. */
9259 static tree
9262 {
9264 {
9267 }
9269 }
9271 \f
9272 /* Check for valid arguments being passed to a function with FNTYPE.
9273 There are NARGS arguments in the array ARGARRAY. */
9274 void
9276 {
9277 /* Check for null being passed in a pointer argument that must be
9278 non-null. We also need to do this if format checking is enabled. */
9283 /* Check for errors in format strings. */
9290 }
9292 /* Generic argument checking recursion routine. PARAM is the argument to
9293 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9294 once the argument is resolved. CTX is context for the callback. */
9295 void
9300 {
9304 {
9305 /* Strip coercion. */
9309 }
9312 {
9314 tree attrs;
9317 /* See if this is a call to a known internationalization function
9318 that modifies a format arg. Such a function may have multiple
9319 format_arg attributes (for example, ngettext). */
9322 attrs;
9325 {
9326 tree inner_arg;
9327 tree format_num_expr;
9330 call_expr_arg_iterator iter;
9332 /* Extract the argument number, which was previously checked
9333 to be valid. */
9342 {
9347 }
9348 }
9350 /* If we found a format_arg attribute and did a recursive check,
9351 we are done with checking this argument. Otherwise, we continue
9352 and this will be considered a non-literal. */
9355 }
9358 {
9359 /* Check both halves of the conditional expression. */
9365 }
9368 }
9370 /* Checks for a builtin function FNDECL that the number of arguments
9371 NARGS against the required number REQUIRED and issues an error if
9372 there is a mismatch. Returns true if the number of arguments is
9373 correct, otherwise false. */
9375 static bool
9377 {
9379 {
9383 }
9385 {
9389 }
9391 }
9393 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9394 Returns false if there was an error, otherwise true. */
9396 bool
9398 {
9404 {
9414 {
9416 {
9420 }
9422 }
9432 {
9439 {
9443 }
9445 }
9450 {
9455 {
9459 }
9462 {
9464 fndecl);
9466 }
9468 }
9473 {
9475 {
9478 }
9480 }
9485 }
9486 }
9488 /* Function to help qsort sort FIELD_DECLs by name order. */
9490 int
9492 {
9497 /* A nontype is "greater" than a type. */
9506 }
9509 gt_pointer_operator new_value;
9513 /* This routine compares two fields like field_decl_cmp but using the
9514 pointer operator in resort_data. */
9516 static int
9518 {
9523 /* A nontype is "greater" than a type. */
9529 {
9536 }
9538 }
9540 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9542 void
9545 gt_pointer_operator new_value,
9547 {
9552 resort_field_decl_cmp);
9553 }
9555 /* Subroutine of c_parse_error.
9556 Return the result of concatenating LHS and RHS. RHS is really
9557 a string literal, its first character is indicated by RHS_START and
9558 RHS_SIZE is its length (including the terminating NUL character).
9560 The caller is responsible for deleting the returned pointer. */
9564 {
9570 }
9572 /* Issue the error given by GMSGID, indicating that it occurred before
9573 TOKEN, which had the associated VALUE. */
9575 void
9578 {
9579 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9589 {
9594 {
9607 }
9611 else
9617 }
9639 {
9644 }
9652 {
9657 }
9658 else
9662 {
9665 }
9666 #undef catenate_messages
9667 }
9669 /* Return the gcc option code associated with the reason for a cpp
9670 message, or 0 if none. */
9672 static int
9674 {
9678 {
9681 }
9683 }
9685 /* Callback from cpp_error for PFILE to print diagnostics from the
9686 preprocessor. The diagnostic is of type LEVEL, with REASON set
9687 to the reason code if LEVEL is represents a warning, at location
9688 LOCATION unless this is after lexing and the compiler's location
9689 should be used instead, with column number possibly overridden by
9690 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9691 the arguments. Returns true if a diagnostic was emitted, false
9692 otherwise. */
9694 bool
9698 {
9699 diagnostic_info diagnostic;
9700 diagnostic_t dlevel;
9705 {
9710 /* Fall through. */
9735 }
9748 }
9750 /* Convert a character from the host to the target execution character
9751 set. cpplib handles this, mostly. */
9753 HOST_WIDE_INT
9755 {
9756 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9757 zero-extended under -fno-signed-char. cpplib insists that characters
9758 and character constants are always unsigned. Hence we must convert
9759 back and forth. */
9767 else
9769 }
9771 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9772 references with an INDIRECT_REF of a constant at the bottom; much like the
9773 traditional rendering of offsetof as a macro. Return the folded result. */
9775 tree
9777 {
9781 {
9797 {
9800 }
9810 {
9814 }
9827 /* Check if the offset goes beyond the upper bound of the array. */
9829 {
9835 {
9839 {
9840 tree v;
9847 {
9855 }
9856 /* Don't warn if the array might be considered a poor
9857 man's flexible array member with a very permissive
9858 definition thereof. */
9862 "index %E denotes an offset "
9865 }
9866 }
9867 }
9874 /* Handle static members of volatile structs. */
9881 }
9884 }
9886 /* Likewise, but convert it to the return type of offsetof. */
9888 tree
9890 {
9892 }
9894 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9895 expression, because B will always be true. */
9897 void
9899 {
9902 "the omitted middle operand in ?: will always be %<true%>, "
9904 }
9906 /* Give an error for storing into ARG, which is 'const'. USE indicates
9907 how ARG was being used. */
9909 void
9911 {
9914 /* Using this macro rather than (for example) arrays of messages
9915 ensures that all the format strings are checked at compile
9916 time. */
9917 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9918 : (use == lv_increment ? (I) \
9919 : (use == lv_decrement ? (D) : (AS))))
9921 {
9932 else
9938 }
9944 arg);
9950 arg);
9952 {
9962 arg);
9963 }
9969 arg);
9970 else
9975 arg);
9976 }
9978 /* Print an error message for an invalid lvalue. USE says
9979 how the lvalue is being used and so selects the error message. LOC
9980 is the location for the error. */
9982 void
9984 {
9986 {
10004 }
10005 }
10007 /* Print an error message for an invalid indirection of type TYPE.
10008 ERRSTRING is the name of the operator for the indirection. */
10010 void
10012 {
10014 {
10022 type);
10027 type);
10032 type);
10037 type);
10042 type);
10046 }
10047 }
10048 \f
10049 /* *PTYPE is an incomplete array. Complete it with a domain based on
10050 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10051 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10052 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10054 int
10056 {
10064 {
10066 {
10067 int eltsize
10070 }
10072 {
10076 {
10080 }
10081 else
10082 {
10083 tree curindex;
10094 {
10098 else
10099 {
10101 {
10102 /* Since we treat size types now as ordinary
10103 unsigned types, we need an explicit overflow
10104 check. */
10108 }
10110 size_one_node);
10111 }
10114 }
10116 {
10120 }
10121 }
10122 }
10123 else
10124 {
10125 /* Make an error message unless that happened already. */
10128 }
10129 }
10130 else
10131 {
10135 }
10142 else
10145 /* Using build_distinct_type_copy and modifying things afterward instead
10146 of using build_array_type to create a new type preserves all of the
10147 TYPE_LANG_FLAG_? bits that the front end may have set. */
10155 /* Make sure we have the canonical MAIN_TYPE. */
10158 hashcode);
10161 /* Fix the canonical type. */
10171 else
10176 else
10182 {
10184 /* If we proceed with the array type as it is, we'll eventually
10185 crash in tree_to_[su]hwi(). */
10187 }
10191 }
10193 /* Like c_mark_addressable but don't check register qualifier. */
10194 void
10196 {
10202 }
10205 \f
10206 /* Used to help initialize the builtin-types.def table. When a type of
10207 the correct size doesn't exist, use error_mark_node instead of NULL.
10208 The later results in segfaults even when a decl using the type doesn't
10209 get invoked. */
10211 tree
10213 {
10216 }
10218 /* A helper function for resolve_overloaded_builtin in resolving the
10219 overloaded __sync_ builtins. Returns a positive power of 2 if the
10220 first operand of PARAMS is a pointer to a supported data type.
10221 Returns 0 if an error is encountered. */
10223 static int
10225 {
10226 tree type;
10230 {
10233 }
10237 {
10238 /* Force array-to-pointer decay for C++. */
10242 }
10254 incompatible:
10257 }
10259 /* A helper function for resolve_overloaded_builtin. Adds casts to
10260 PARAMS to make arguments match up with those of FUNCTION. Drops
10261 the variadic arguments at the end. Returns false if some error
10262 was encountered; true on success. */
10264 static bool
10267 {
10268 function_args_iterator iter;
10269 tree ptype;
10273 /* We've declared the implementation functions to use "volatile void *"
10274 as the pointer parameter, so we shouldn't get any complaints from the
10275 call to check_function_arguments what ever type the user used. */
10280 /* For the rest of the values, we need to cast these to FTYPE, so that we
10281 don't get warnings for passing pointer types, etc. */
10284 {
10288 /* XXX void_type_node belies the abstraction. */
10294 {
10297 }
10299 /* Only convert parameters if arg_type is unsigned integer type with
10300 new format sync routines, i.e. don't attempt to convert pointer
10301 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10302 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10303 kinds). */
10305 {
10306 /* Ideally for the first conversion we'd use convert_for_assignment
10307 so that we get warnings for anything that doesn't match the pointer
10308 type. This isn't portable across the C and C++ front ends atm. */
10313 }
10316 }
10318 /* __atomic routines are not variadic. */
10320 {
10323 }
10325 /* The definition of these primitives is variadic, with the remaining
10326 being "an optional list of variables protected by the memory barrier".
10327 No clue what that's supposed to mean, precisely, but we consider all
10328 call-clobbered variables to be protected so we're safe. */
10332 }
10334 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10335 RESULT to make it match the type of the first pointer argument in
10336 PARAMS. */
10338 static tree
10340 {
10345 /* New format doesn't require casting unless the types are the same size. */
10348 else
10350 }
10352 /* This function verifies the PARAMS to generic atomic FUNCTION.
10353 It returns the size if all the parameters are the same size, otherwise
10354 0 is returned if the parameters are invalid. */
10356 static int
10359 {
10364 tree type_0;
10366 /* Determine the parameter makeup. */
10368 {
10384 }
10387 {
10390 }
10392 /* Get type of first parameter, and determine its size. */
10395 {
10396 /* Force array-to-pointer decay for C++. */
10400 }
10402 {
10404 function);
10406 }
10408 /* Types must be compile time constant sizes. */
10410 {
10413 function);
10415 }
10419 /* Zero size objects are not allowed. */
10421 {
10424 function);
10426 }
10428 /* Check each other parameter is a pointer and the same size. */
10430 {
10433 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10437 {
10439 function);
10441 }
10445 {
10447 function);
10449 }
10450 }
10452 /* Check memory model parameters for validity. */
10454 {
10457 {
10460 {
10463 function);
10464 }
10465 }
10466 else
10468 {
10470 function);
10472 }
10473 }
10476 }
10479 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10480 at the beginning of the parameter list PARAMS representing the size of the
10481 objects. This is to match the library ABI requirement. LOC is the location
10482 of the function call.
10483 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10484 returned to allow the external call to be constructed. */
10486 static tree
10489 {
10490 tree size_node;
10492 /* Insert a SIZE_T parameter as the first param. If there isn't
10493 enough space, allocate a new vector and recursively re-build with that. */
10495 {
10498 tree f;
10508 }
10510 /* Add the size parameter and leave as a function call for processing. */
10514 }
10517 /* Return whether atomic operations for naturally aligned N-byte
10518 arguments are supported, whether inline or through libatomic. */
10519 static bool
10521 {
10523 {
10535 }
10536 }
10538 /* This will process an __atomic_exchange function call, determine whether it
10539 needs to be mapped to the _N variation, or turned into a library call.
10540 LOC is the location of the builtin call.
10541 FUNCTION is the DECL that has been invoked;
10542 PARAMS is the argument list for the call. The return value is non-null
10543 TRUE is returned if it is translated into the proper format for a call to the
10544 external library, and NEW_RETURN is set the tree for that function.
10545 FALSE is returned if processing for the _N variation is required, and
10546 NEW_RETURN is set to the the return value the result is copied into. */
10547 static bool
10550 {
10555 /* Size of 0 is an error condition. */
10557 {
10560 }
10562 /* If not a lock-free size, change to the library generic format. */
10564 {
10567 }
10569 /* Otherwise there is a lockfree match, transform the call from:
10570 void fn(T* mem, T* desired, T* return, model)
10571 into
10572 *return = (T) (fn (In* mem, (In) *desired, model)) */
10579 /* Create pointer to appropriate size. */
10583 /* Convert object pointer to required type. */
10586 /* Convert new value to required type, and dereference it. */
10591 /* Move memory model to the 3rd position, and end param list. */
10595 /* Convert return pointer and dereference it for later assignment. */
10599 }
10602 /* This will process an __atomic_compare_exchange function call, determine
10603 whether it needs to be mapped to the _N variation, or turned into a lib call.
10604 LOC is the location of the builtin call.
10605 FUNCTION is the DECL that has been invoked;
10606 PARAMS is the argument list for the call. The return value is non-null
10607 TRUE is returned if it is translated into the proper format for a call to the
10608 external library, and NEW_RETURN is set the tree for that function.
10609 FALSE is returned if processing for the _N variation is required. */
10611 static bool
10615 {
10620 /* Size of 0 is an error condition. */
10622 {
10625 }
10627 /* If not a lock-free size, change to the library generic format. */
10629 {
10630 /* The library generic format does not have the weak parameter, so
10631 remove it from the param list. Since a parameter has been removed,
10632 we can be sure that there is room for the SIZE_T parameter, meaning
10633 there will not be a recursive rebuilding of the parameter list, so
10634 there is no danger this will be done twice. */
10636 {
10640 }
10643 }
10645 /* Otherwise, there is a match, so the call needs to be transformed from:
10646 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10647 into
10648 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10654 /* Create pointer to appropriate size. */
10658 /* Convert object pointer to required type. */
10662 /* Convert expected pointer to required type. */
10666 /* Convert desired value to required type, and dereference it. */
10671 /* The rest of the parameters are fine. NULL means no special return value
10672 processing.*/
10675 }
10678 /* This will process an __atomic_load function call, determine whether it
10679 needs to be mapped to the _N variation, or turned into a library call.
10680 LOC is the location of the builtin call.
10681 FUNCTION is the DECL that has been invoked;
10682 PARAMS is the argument list for the call. The return value is non-null
10683 TRUE is returned if it is translated into the proper format for a call to the
10684 external library, and NEW_RETURN is set the tree for that function.
10685 FALSE is returned if processing for the _N variation is required, and
10686 NEW_RETURN is set to the the return value the result is copied into. */
10688 static bool
10691 {
10696 /* Size of 0 is an error condition. */
10698 {
10701 }
10703 /* If not a lock-free size, change to the library generic format. */
10705 {
10708 }
10710 /* Otherwise, there is a match, so the call needs to be transformed from:
10711 void fn(T* mem, T* return, model)
10712 into
10713 *return = (T) (fn ((In *) mem, model)) */
10719 /* Create pointer to appropriate size. */
10723 /* Convert object pointer to required type. */
10727 /* Move memory model to the 2nd position, and end param list. */
10731 /* Convert return pointer and dereference it for later assignment. */
10735 }
10738 /* This will process an __atomic_store function call, determine whether it
10739 needs to be mapped to the _N variation, or turned into a library call.
10740 LOC is the location of the builtin call.
10741 FUNCTION is the DECL that has been invoked;
10742 PARAMS is the argument list for the call. The return value is non-null
10743 TRUE is returned if it is translated into the proper format for a call to the
10744 external library, and NEW_RETURN is set the tree for that function.
10745 FALSE is returned if processing for the _N variation is required, and
10746 NEW_RETURN is set to the the return value the result is copied into. */
10748 static bool
10751 {
10756 /* Size of 0 is an error condition. */
10758 {
10761 }
10763 /* If not a lock-free size, change to the library generic format. */
10765 {
10768 }
10770 /* Otherwise, there is a match, so the call needs to be transformed from:
10771 void fn(T* mem, T* value, model)
10772 into
10773 fn ((In *) mem, (In) *value, model) */
10778 /* Create pointer to appropriate size. */
10782 /* Convert object pointer to required type. */
10786 /* Convert new value to required type, and dereference it. */
10791 /* The memory model is in the right spot already. Return is void. */
10795 }
10798 /* Some builtin functions are placeholders for other expressions. This
10799 function should be called immediately after parsing the call expression
10800 before surrounding code has committed to the type of the expression.
10802 LOC is the location of the builtin call.
10804 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10805 PARAMS is the argument list for the call. The return value is non-null
10806 when expansion is complete, and null if normal processing should
10807 continue. */
10809 tree
10812 {
10818 {
10824 else
10828 }
10830 /* Handle BUILT_IN_NORMAL here. */
10832 {
10837 {
10838 /* Handle these 4 together so that they can fall through to the next
10839 case if the call is transformed to an _N variant. */
10841 {
10843 {
10847 /* Change to the _N variant. */
10850 }
10853 {
10855 params,
10858 /* Change to the _N variant. */
10861 }
10863 {
10867 /* Change to the _N variant. */
10870 }
10872 {
10876 /* Change to the _N variant. */
10879 }
10882 }
10883 /* Fallthrough to the normal processing. */
10884 }
10901 {
10903 /* Fallthru for parameter processing. */
10904 }
10921 {
10932 orig_format))
10937 NULL);
10945 /* If new_return is set, assign function to that expr and cast the
10946 result to void since the generic interface returned void. */
10948 {
10949 /* Cast function result from I{1,2,4,8,16} to the required type. */
10952 result);
10956 }
10958 }
10962 }
10963 }
10965 /* vector_types_compatible_elements_p is used in type checks of vectors
10966 values used as operands of binary operators. Where it returns true, and
10967 the other checks of the caller succeed (being vector types in he first
10968 place, and matching number of elements), we can just treat the types
10969 as essentially the same.
10970 Contrast with vector_targets_convertible_p, which is used for vector
10971 pointer types, and vector_types_convertible_p, which will allow
10972 language-specific matches under the control of flag_lax_vector_conversions,
10973 and might still require a conversion. */
10974 /* True if vector types T1 and T2 can be inputs to the same binary
10975 operator without conversion.
10976 We don't check the overall vector size here because some of our callers
10977 want to give different error messages when the vectors are compatible
10978 except for the element count. */
10980 bool
10982 {
10995 /* Equality works here because c_common_signed_type uses
10996 TYPE_MAIN_VARIANT. */
11004 }
11006 /* Check for missing format attributes on function pointers. LTYPE is
11007 the new type or left-hand side type. RTYPE is the old type or
11008 right-hand side type. Returns TRUE if LTYPE is missing the desired
11009 attribute. */
11011 bool
11013 {
11015 tree ra;
11021 {
11022 tree la;
11027 }
11028 else
11030 }
11032 /* Subscripting with type char is likely to lose on a machine where
11033 chars are signed. So warn on any machine, but optionally. Don't
11034 warn for unsigned char since that type is safe. Don't warn for
11035 signed char because anyone who uses that must have done so
11036 deliberately. Furthermore, we reduce the false positive load by
11037 warning only for non-constant value of type char. */
11039 void
11041 {
11045 }
11047 /* Implement -Wparentheses for the unexpected C precedence rules, to
11048 cover cases like x + y << z which readers are likely to
11049 misinterpret. We have seen an expression in which CODE is a binary
11050 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11051 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11052 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11053 expression was not formed using a binary or unary operator, or it
11054 was enclosed in parentheses. */
11056 void
11060 {
11064 /* This macro tests that the expression ARG with original tree code
11065 CODE appears to be a boolean expression. or the result of folding a
11066 boolean expression. */
11067 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11068 (truth_value_p (TREE_CODE (ARG)) \
11069 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11071 || ((CODE) != INTEGER_CST \
11072 && (integer_onep (ARG) || integer_zerop (ARG))))
11075 {
11124 /* Check cases like x|y==z */
11131 /* Check cases like !x | y */
11135 "suggest parentheses around operand of "
11148 /* Check cases like x^y==z */
11170 /* Check cases like x&y==z */
11177 /* Check cases like !x & y */
11181 "suggest parentheses around operand of "
11204 {
11209 "comparisons like %<X<=Y<=Z%> do not "
11215 "comparisons like %<X<=Y<=Z%> do not "
11217 }
11219 }
11220 #undef NOT_A_BOOLEAN_EXPR_P
11221 }
11223 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11225 void
11227 {
11229 {
11232 else
11234 }
11235 }
11237 /* Warn for division by zero according to the value of DIVISOR. LOC
11238 is the location of the division operator. */
11240 void
11242 {
11243 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11244 about division by zero. Do not issue a warning if DIVISOR has a
11245 floating-point type, since we consider 0.0/0.0 a valid way of
11246 generating a NaN. */
11250 }
11252 /* Subroutine of build_binary_op. Give warnings for comparisons
11253 between signed and unsigned quantities that may fail. Do the
11254 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11255 so that casts will be considered, but default promotions won't
11256 be.
11258 LOCATION is the location of the comparison operator.
11260 The arguments of this function map directly to local variables
11261 of build_binary_op. */
11263 void
11268 {
11273 /* In C++, check for comparison of different enum types. */
11279 {
11283 }
11285 /* Do not warn if the comparison is being done in a signed type,
11286 since the signed type will only be chosen if it can represent
11287 all the values of the unsigned type. */
11290 /* Do not warn if both operands are unsigned. */
11293 else
11294 {
11300 else
11308 /* Do not warn if the signed quantity is an unsuffixed integer
11309 literal (or some static constant expression involving such
11310 literals or a conditional expression involving such literals)
11311 and it is non-negative. */
11314 /* Do not warn if the comparison is an equality operation, the
11315 unsigned quantity is an integral constant, and it would fit
11316 in the result if the result were signed. */
11321 /* In C, do not warn if the unsigned quantity is an enumeration
11322 constant and its maximum value would fit in the result if the
11323 result were signed. */
11329 else
11331 OPT_Wsign_compare,
11333 }
11335 /* Warn if two unsigned values are being compared in a size larger
11336 than their original size, and one (and only one) is the result of
11337 a `~' operator. This comparison will always fail.
11339 Also warn if one operand is a constant, and the constant does not
11340 have all bits set that are set in the ~ operand when it is
11341 extended. */
11348 {
11355 {
11356 tree primop;
11362 {
11366 }
11367 else
11368 {
11372 }
11377 {
11380 {
11384 else
11387 }
11388 }
11389 }
11397 }
11398 }
11400 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11401 type via c_common_type. If -Wdouble-promotion is in use, and the
11402 conditions for warning have been met, issue a warning. GMSGID is
11403 the warning message. It must have two %T specifiers for the type
11404 that was converted (generally "float") and the type to which it was
11405 converted (generally "double), respectively. LOC is the location
11406 to which the awrning should refer. */
11408 void
11411 {
11412 tree source_type;
11416 /* If the conversion will not occur at run-time, there is no need to
11417 warn about it. */
11429 else
11432 }
11434 /* Setup a TYPE_DECL node as a typedef representation.
11436 X is a TYPE_DECL for a typedef statement. Create a brand new
11437 ..._TYPE node (which will be just a variant of the existing
11438 ..._TYPE node with identical properties) and then install X
11439 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11441 The whole point here is to end up with a situation where each
11442 and every ..._TYPE node the compiler creates will be uniquely
11443 associated with AT MOST one node representing a typedef name.
11444 This way, even though the compiler substitutes corresponding
11445 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11446 early on, later parts of the compiler can always do the reverse
11447 translation and get back the corresponding typedef name. For
11448 example, given:
11450 typedef struct S MY_TYPE;
11451 MY_TYPE object;
11453 Later parts of the compiler might only know that `object' was of
11454 type `struct S' if it were not for code just below. With this
11455 code however, later parts of the compiler see something like:
11457 struct S' == struct S
11458 typedef struct S' MY_TYPE;
11459 struct S' object;
11461 And they can then deduce (from the node for type struct S') that
11462 the original object declaration was:
11464 MY_TYPE object;
11466 Being able to do this is important for proper support of protoize,
11467 and also for generating precise symbolic debugging information
11468 which takes full account of the programmer's (typedef) vocabulary.
11470 Obviously, we don't want to generate a duplicate ..._TYPE node if
11471 the TYPE_DECL node that we are now processing really represents a
11472 standard built-in type. */
11474 void
11476 {
11480 {
11483 }
11486 {
11494 }
11495 }
11497 /* Record the types used by the current global variable declaration
11498 being parsed, so that we can decide later to emit their debug info.
11499 Those types are in types_used_by_cur_var_decl, and we are going to
11500 store them in the types_used_by_vars_hash hash table.
11501 DECL is the declaration of the global variable that has been parsed. */
11503 void
11505 {
11509 {
11512 }
11513 }
11515 /* If DECL is a typedef that is declared in the current function,
11516 record it for the purpose of -Wunused-local-typedefs. */
11518 void
11520 {
11525 /* if this is not a locally defined typedef then we are not
11526 interested. */
11533 }
11535 /* If T is a TYPE_DECL declared locally, mark it as used. */
11537 void
11539 {
11544 }
11546 /* Warn if there are some unused locally defined typedefs in the
11547 current function. */
11549 void
11551 {
11553 tree decl;
11554 /* The number of times we have emitted -Wunused-local-typedefs
11555 warnings. If this is different from errorcount, that means some
11556 unrelated errors have been issued. In which case, we'll avoid
11557 emitting "unused-local-typedefs" warnings. */
11569 {
11573 OPT_Wunused_local_typedefs,
11576 }
11579 }
11581 /* Warn about boolean expression compared with an integer value different
11582 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11583 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11584 are the operands of the comparison. The caller must ensure that
11585 either operand is a boolean expression. */
11587 void
11589 tree op1)
11590 {
11600 {
11608 else
11611 }
11612 }
11614 /* The C and C++ parsers both use vectors to hold function arguments.
11615 For efficiency, we keep a cache of unused vectors. This is the
11616 cache. */
11621 /* Return a new vector from the cache. If the cache is empty,
11622 allocate a new vector. These vectors are GC'ed, so it is OK if the
11623 pointer is not released.. */
11627 {
11630 else
11631 {
11632 /* Passing 0 to vec::alloc returns NULL, and our callers require
11633 that we always return a non-NULL value. The vector code uses
11634 4 when growing a NULL vector, so we do too. */
11638 }
11639 }
11641 /* Release a vector of trees back to the cache. */
11643 void
11645 {
11647 {
11650 }
11651 }
11653 /* Get a new tree vector holding a single tree. */
11657 {
11661 }
11663 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11667 {
11672 }
11674 /* Get a new tree vector which is a copy of an existing one. */
11678 {
11681 tree t;
11688 }
11690 /* Return true if KEYWORD starts a type specifier. */
11692 bool
11694 {
11696 {
11727 }
11728 }
11730 /* Return true if KEYWORD names a type qualifier. */
11732 bool
11734 {
11736 {
11744 }
11745 }
11747 /* Return true if KEYWORD names a storage class specifier.
11749 RID_TYPEDEF is not included in this list despite `typedef' being
11750 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11751 such for syntactic convenience only. */
11753 bool
11755 {
11757 {
11767 }
11768 }
11770 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11772 static bool
11774 {
11776 {
11784 }
11785 }
11787 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11788 declaration-specifier (C99 6.7). */
11790 bool
11792 {
11799 {
11806 }
11807 }
11809 /* Initialize language-specific-bits of tree_contains_struct. */
11811 void
11813 {
11817 }
11819 /* Build a user-defined numeric literal out of an integer constant type VALUE
11820 with identifier SUFFIX. */
11822 tree
11825 {
11832 }
11834 /* For vector[index], convert the vector to a
11835 pointer of the underlying type. */
11836 void
11839 {
11841 {
11843 tree type1;
11856 {
11857 /* If the original vector isn't declared may_alias and it
11858 isn't a bare vector look if the subscripting would
11859 alias the vector we subscript, and if not, force ref-all. */
11865 }
11869 }
11870 }
11872 /* Determine which of the operands, if any, is a scalar that needs to be
11873 converted to a vector, for the range of operations. */
11874 enum stv_conv
11877 {
11886 {
11887 /* Most GENERIC binary expressions require homogeneous arguments.
11888 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11889 argument that is a vector and a second one that is a scalar, so
11890 we never return stv_secondarg for them. */
11895 {
11897 {
11902 }
11903 else
11905 }
11912 /* ... fall through ... */
11933 /* What about UNLT_EXPR? */
11935 {
11936 tree tmp;
11938 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11941 }
11945 {
11947 {
11952 }
11954 }
11956 /* Allow integer --> real conversion if safe. */
11960 {
11962 {
11967 }
11969 }
11972 }
11975 }
11977 /* Return true iff ALIGN is an integral constant that is a fundamental
11978 alignment, as defined by [basic.align] in the c++-11
11979 specifications.
11981 That is:
11983 [A fundamental alignment is represented by an alignment less than or
11984 equal to the greatest alignment supported by the implementation
11985 in all contexts, which is equal to
11986 alignof(max_align_t)]. */
11988 bool
11990 {
11993 }
11995 /* Return true if T is a pointer to a zero-sized aggregate. */
11997 bool
11999 {
12004 }