| blob | 4f6f6bc1d8aa07d697d4de22bf4f69929550fabe |
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++11 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. */
390 /* Reserved words. The third field is a mask: keywords are disabled
391 if they match the mask.
393 Masks for languages:
394 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
395 C --std=c99: D_CXXONLY | D_OBJC
396 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
397 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
398 C++ --std=c0x: D_CONLY | D_OBJC
399 ObjC++ is like C++ except that D_OBJC is not set
401 If -fno-asm is used, D_ASM is added to the mask. If
402 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
403 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
404 In C with -Wc++-compat, we warn if D_CXXWARN is set.
406 Note the complication of the D_CXX_OBJC keywords. These are
407 reserved words such as 'class'. In C++, 'class' is a reserved
408 word. In Objective-C++ it is too. In Objective-C, it is a
409 reserved word too, but only if it follows an '@' sign.
410 */
412 {
575 /* Concepts-related keywords */
579 /* These Objective-C keywords are recognized only immediately after
580 an '@'. */
597 /* These are recognized only in protocol-qualifier context
598 (see above) */
605 /* These are recognized inside a property attribute list */
614 };
619 /* Table of machine-independent attributes common to all C-like languages. */
621 {
622 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
623 affects_type_identity } */
630 /* FIXME: logically, noreturn attributes should be listed as
631 "false, true, true" and apply to function types. But implementing this
632 would require all the places in the compiler that use TREE_THIS_VOLATILE
633 on a decl to identify non-returning functions to be located and fixed
634 to check the function type instead. */
659 /* The same comments as for noreturn attributes apply to const ones. */
683 handle_no_instrument_function_attribute,
701 /* ??? These two attributes didn't make the transition from the
702 Intel language document to the multi-vendor language document. */
707 /* For internal use (marking of builtins) only. The name contains space
708 to prevent its usage in source code. */
730 /* For internal use (marking of builtins) only. The name contains space
731 to prevent its usage in source code. */
742 handle_no_address_safety_analysis_attribute,
745 handle_no_sanitize_address_attribute,
748 handle_no_sanitize_undefined_attribute,
758 /* For internal use only. The leading '*' both prevents its usage in
759 source code and signals that it may be overridden by machine tables. */
764 /* For internal use (marking of builtins and runtime functions) only.
765 The name contains space to prevent its usage in source code. */
783 };
785 /* Give the specifications for the format attributes, used by C and all
786 descendants. */
789 {
790 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
791 affects_type_identity } */
797 };
799 /* Return identifier for address space AS. */
803 {
807 }
809 /* Push current bindings for the function name VAR_DECLS. */
811 void
813 {
818 {
822 {
824 saved);
826 }
827 }
829 /* Normally they'll have been NULL, so only push if we've got a
830 stack, or they are non-NULL. */
832 saved_function_name_decls);
833 }
835 /* Finish up the current bindings, adding them into the current function's
836 statement tree. This must be done _before_ finish_stmt_tree is called.
837 If there is no current function, we must be at file scope and no statements
838 are involved. Pop the previous bindings. */
840 void
842 {
851 {
859 }
865 {
866 /* We had saved values, restore them. */
867 tree saved;
870 {
875 }
877 }
879 }
881 /* Return the text name of the current function, suitably prettified
882 by PRETTY_P. Return string must be freed by caller. */
886 {
893 {
896 }
909 {
912 }
915 }
917 /* Return the VAR_DECL for a const char array naming the current
918 function. If the VAR_DECL has not yet been created, create it
919 now. RID indicates how it should be formatted and IDENTIFIER_NODE
920 ID is its name (unfortunately C and C++ hold the RID values of
921 keywords in different places, so we can't derive RID from ID in
922 this language independent code. LOC is the location of the
923 function. */
925 tree
927 {
937 {
938 /* If a tree is built here, it would normally have the lineno of
939 the current statement. Later this tree will be moved to the
940 beginning of the function and this line number will be wrong.
941 To avoid this problem set the lineno to 0 here; that prevents
942 it from appearing in the RTL. */
943 tree stmts;
951 saved_function_name_decls
955 }
960 }
962 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
964 tree
966 {
971 /* Compute the number of elements, for the array type. */
973 {
976 }
978 {
981 }
983 {
986 }
987 else
988 {
991 }
993 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
994 limit in C++98 Annex B is very large (65536) and is not normative,
995 so we do not diagnose it (warn_overlength_strings is forced off
996 in c_common_post_options). */
998 {
1002 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1003 separate the %d from the 'C'. 'ISO' should not be
1004 translated, but it may be moved after 'C%d' in languages
1005 where modifiers follow nouns. */
1007 "string length %qd is greater than the length %qd "
1010 }
1012 /* Create the array type for the string constant. The ISO C++
1013 standard says that a string literal has type `const char[N]' or
1014 `const wchar_t[N]'. We use the same logic when invoked as a C
1015 front-end with -Wwrite-strings.
1016 ??? We should change the type of an expression depending on the
1017 state of a warning flag. We should just be warning -- see how
1018 this is handled in the C++ front-end for the deprecated implicit
1019 conversion from string literals to `char*' or `wchar_t*'.
1021 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1022 array type being the unqualified version of that type.
1023 Therefore, if we are constructing an array of const char, we must
1024 construct the matching unqualified array type first. The C front
1025 end does not require this, but it does no harm, so we do it
1026 unconditionally. */
1037 }
1038 \f
1039 /* If DISABLE is true, stop issuing warnings. This is used when
1040 parsing code that we know will not be executed. This function may
1041 be called multiple times, and works as a stack. */
1043 static void
1045 {
1047 {
1050 }
1051 }
1053 /* If ENABLE is true, reenable issuing warnings. */
1055 static void
1057 {
1059 {
1062 }
1063 }
1065 /* Fully fold EXPR, an expression that was not folded (beyond integer
1066 constant expressions and null pointer constants) when being built
1067 up. If IN_INIT, this is in a static initializer and certain
1068 changes are made to the folding done. Clear *MAYBE_CONST if
1069 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1070 expression because it contains an evaluated operator (in C99) or an
1071 operator outside of sizeof returning an integer constant (in C90)
1072 not permitted in constant expressions, or because it contains an
1073 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1074 set to true by callers before calling this function.) Return the
1075 folded expression. Function arguments have already been folded
1076 before calling this function, as have the contents of SAVE_EXPR,
1077 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1078 C_MAYBE_CONST_EXPR. */
1080 tree
1082 {
1083 tree ret;
1089 /* This function is not relevant to C++ because C++ folds while
1090 parsing, and may need changes to be correct for C++ when C++
1091 stops folding while parsing. */
1098 {
1101 }
1108 }
1110 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1111 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1112 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1113 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1114 both evaluated and unevaluated subexpressions while
1115 *MAYBE_CONST_ITSELF is carried from only evaluated
1116 subexpressions). */
1118 static tree
1121 {
1133 /* This function is not relevant to C++ because C++ folds while
1134 parsing, and may need changes to be correct for C++ when C++
1135 stops folding while parsing. */
1139 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1140 anything else not counted as an expression cannot usefully be
1141 folded further at this point. */
1147 /* Operands of variable-length expressions (function calls) have
1148 already been folded, as have __builtin_* function calls, and such
1149 expressions cannot occur in constant expressions. */
1151 {
1155 }
1158 {
1167 else
1170 }
1172 /* Assignment, increment, decrement, function call and comma
1173 operators, and statement expressions, cannot occur in constant
1174 expressions if evaluated / outside of sizeof. (Function calls
1175 were handled above, though VA_ARG_EXPR is treated like a function
1176 call here, and statement expressions are handled through
1177 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1179 {
1199 }
1201 /* Fold individual tree codes as appropriate. */
1203 {
1205 /* Any non-constancy will have been marked in a containing
1206 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1214 maybe_const_itself);
1219 {
1222 }
1231 maybe_const_itself);
1234 maybe_const_itself);
1240 {
1244 }
1286 /* Binary operations evaluating both arguments (increment and
1287 decrement are binary internally in GCC). */
1291 maybe_const_itself);
1299 /* The RHS of a MODIFY_EXPR was fully folded when building that
1300 expression for the sake of conversion warnings. */
1303 maybe_const_itself);
1307 ret = in_init
1310 else
1323 {
1334 }
1340 CASE_CONVERT:
1351 /* Unary operations. */
1354 maybe_const_itself);
1358 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1359 not prepared to deal with them if they occur in initializers. */
1367 ret = in_init
1370 else
1375 {
1379 }
1381 {
1384 CASE_CONVERT:
1385 /* Don't warn about explicit conversions. We will already
1386 have warned about suspect implicit conversions. */
1393 }
1398 /* Binary operations not necessarily evaluating both
1399 arguments. */
1406 ? truthvalue_false_node
1414 ret = in_init
1417 else
1422 && op0_const
1423 && op0_const_self
1429 && op0_const_self
1455 else
1460 && op0_const
1461 && op0_const_self
1465 && op0_const_self
1469 && op0_const
1470 && op0_const_self
1474 && op0_const_self
1480 /* Each case where an operand with excess precision may be
1481 encountered must remove the EXCESS_PRECISION_EXPR around
1482 inner operands and possibly put one around the whole
1483 expression or possibly convert to the semantic type (which
1484 c_fully_fold does); we cannot tell at this stage which is
1485 appropriate in any particular case. */
1489 /* Various codes may appear through folding built-in functions
1490 and their arguments. */
1492 }
1494 out:
1495 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1496 have been done by this point, so remove them again. */
1500 {
1504 }
1508 }
1510 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1511 return EXP. Otherwise, return either EXP or its known constant
1512 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1513 Is the BLKmode test appropriate? */
1515 tree
1517 {
1518 tree ret;
1520 /* This function is only used by C, for c_fully_fold and other
1521 optimization, and may not be correct for C++. */
1532 /* Avoid unwanted tree sharing between the initializer and current
1533 function's body where the tree can be modified e.g. by the
1534 gimplifier. */
1538 }
1540 /* Print a warning if a constant expression had overflow in folding.
1541 Invoke this function on every expression that the language
1542 requires to be a constant expression.
1543 Note the ANSI C standard says it is erroneous for a
1544 constant expression to overflow. */
1546 void
1548 {
1556 }
1558 /* The same as above but print an unconditional error. */
1559 void
1561 {
1568 }
1570 /* Print a warning if an expression had overflow in folding and its
1571 operands hadn't.
1573 Invoke this function on every expression that
1574 (1) appears in the source code, and
1575 (2) is a constant expression that overflowed, and
1576 (3) is not already checked by convert_and_check;
1577 however, do not invoke this function on operands of explicit casts
1578 or when the expression is the result of an operator and any operand
1579 already overflowed. */
1581 void
1583 {
1588 {
1617 }
1618 }
1620 /* Warn about uses of logical || / && operator in a context where it
1621 is likely that the bitwise equivalent was intended by the
1622 programmer. We have seen an expression in which CODE is a binary
1623 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1624 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1625 void
1629 {
1641 /* Warn if &&/|| are being used in a context where it is
1642 likely that the bitwise equivalent was intended by the
1643 programmer. That is, an expression such as op && MASK
1644 where op should not be any boolean expression, nor a
1645 constant, and mask seems to be a non-boolean integer constant. */
1653 {
1657 else
1662 }
1664 /* We do not warn for constants because they are typical of macro
1665 expansions that test for features. */
1669 /* This warning only makes sense with logical operands. */
1677 /* We first test whether either side separately is trivially true
1678 (with OR) or trivially false (with AND). If so, do not warn.
1679 This is a common idiom for testing ranges of data types in
1680 portable code. */
1687 /* If this is an OR operation, invert both sides; now, the result
1688 should be always false to get a warning. */
1702 /* If this is an OR operation, invert both sides; now, the result
1703 should be always false to get a warning. */
1711 /* If both expressions have the same operand, if we can merge the
1712 ranges, and if the range test is always false, then warn. */
1719 {
1722 "logical %<or%> "
1724 else
1726 "logical %<and%> "
1728 }
1729 }
1731 /* Warn about logical not used on the left hand side operand of a comparison.
1732 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1733 Do not warn if the LHS or RHS is of a boolean or a vector type. */
1735 void
1738 {
1743 ;
1751 "logical not is only applied to the left hand side of "
1753 }
1755 /* Warn if EXP contains any computations whose results are not used.
1756 Return true if a warning is printed; false otherwise. LOCUS is the
1757 (potential) location of the expression. */
1759 bool
1761 {
1762 restart:
1766 /* Don't warn about void constructs. This includes casting to void,
1767 void function calls, and statement expressions with a final cast
1768 to void. */
1776 {
1792 /* For a binding, warn if no side effect within it. */
1804 /* In && or ||, warn if 2nd operand has no side effect. */
1811 /* Let people do `(foo (), 0)' without a warning. */
1818 /* If this is an expression with side effects, don't warn; this
1819 case commonly appears in macro expansions. */
1825 /* Don't warn about automatic dereferencing of references, since
1826 the user cannot control it. */
1828 {
1831 }
1832 /* Fall through. */
1835 /* Referencing a volatile value is a side effect, so don't warn. */
1840 /* If this is an expression which has no operands, there is no value
1841 to be unused. There are no such language-independent codes,
1842 but front ends may define such. */
1846 warn:
1848 }
1849 }
1852 /* Print a warning about casts that might indicate violation
1853 of strict aliasing rules if -Wstrict-aliasing is used and
1854 strict aliasing mode is in effect. OTYPE is the original
1855 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1857 bool
1859 {
1860 /* Strip pointer conversion chains and get to the correct original type. */
1868 /* If the type we are casting to is a ref-all pointer
1869 dereferencing it is always valid. */
1876 {
1877 /* Casting the address of an object to non void pointer. Warn
1878 if the cast breaks type based aliasing. */
1880 {
1884 }
1885 else
1886 {
1887 /* warn_strict_aliasing >= 3. This includes the default (3).
1888 Only warn if the cast is dereferenced immediately. */
1889 alias_set_type set1 =
1895 {
1899 }
1902 {
1906 }
1907 }
1908 }
1909 else
1911 {
1912 /* At this level, warn for any conversions, even if an address is
1913 not taken in the same statement. This will likely produce many
1914 false positives, but could be useful to pinpoint problems that
1915 are not revealed at higher levels. */
1920 {
1924 }
1925 }
1928 }
1930 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1931 sizeof as last operand of certain builtins. */
1933 void
1937 {
1941 location_t loc;
1949 {
1953 /* FALLTHRU */
1961 /* FALLTHRU */
2020 }
2048 {
2052 {
2055 "argument to %<sizeof%> in %qD call is the same "
2056 "expression as the destination; did you mean to "
2062 "argument to %<sizeof%> in %qD call is the same "
2063 "expression as the destination; did you mean to "
2065 else
2067 "argument to %<sizeof%> in %qD call is the same "
2068 "expression as the destination; did you mean to "
2071 }
2074 && !strop
2077 {
2079 "argument to %<sizeof%> in %qD call is the same "
2080 "pointer type %qT as the destination; expected %qT "
2084 }
2085 }
2088 {
2092 {
2095 "argument to %<sizeof%> in %qD call is the same "
2096 "expression as the source; did you mean to "
2102 "argument to %<sizeof%> in %qD call is the same "
2103 "expression as the source; did you mean to "
2105 else
2107 "argument to %<sizeof%> in %qD call is the same "
2108 "expression as the source; did you mean to "
2111 }
2114 && !strop
2117 {
2119 "argument to %<sizeof%> in %qD call is the same "
2120 "pointer type %qT as the source; expected %qT "
2124 }
2125 }
2128 {
2132 {
2135 "argument to %<sizeof%> in %qD call is the same "
2136 "expression as the first source; did you mean to "
2142 "argument to %<sizeof%> in %qD call is the same "
2143 "expression as the first source; did you mean to "
2145 else
2147 "argument to %<sizeof%> in %qD call is the same "
2148 "expression as the first source; did you mean to "
2151 }
2154 && !strop
2157 {
2159 "argument to %<sizeof%> in %qD call is the same "
2160 "pointer type %qT as the first source; expected %qT "
2164 }
2165 }
2168 {
2172 {
2175 "argument to %<sizeof%> in %qD call is the same "
2176 "expression as the second source; did you mean to "
2182 "argument to %<sizeof%> in %qD call is the same "
2183 "expression as the second source; did you mean to "
2185 else
2187 "argument to %<sizeof%> in %qD call is the same "
2188 "expression as the second source; did you mean to "
2191 }
2194 && !strop
2197 {
2199 "argument to %<sizeof%> in %qD call is the same "
2200 "pointer type %qT as the second source; expected %qT "
2204 }
2205 }
2207 }
2209 /* Warn for unlikely, improbable, or stupid DECL declarations
2210 of `main'. */
2212 void
2214 {
2215 function_args_iterator iter;
2216 tree type;
2220 {
2221 /* XXX void_type_node belies the abstraction. */
2231 {
2237 }
2241 {
2263 "third argument of %q+D should probably be "
2266 }
2267 }
2269 /* It is intentional that this message does not mention the third
2270 argument because it's only mentioned in an appendix of the
2271 standard. */
2279 }
2281 /* vector_targets_convertible_p is used for vector pointer types. The
2282 callers perform various checks that the qualifiers are satisfactory,
2283 while OTOH vector_targets_convertible_p ignores the number of elements
2284 in the vectors. That's fine with vector pointers as we can consider,
2285 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2286 and that does not require and conversion of the pointer values.
2287 In contrast, vector_types_convertible_p and
2288 vector_types_compatible_elements_p are used for vector value types. */
2289 /* True if pointers to distinct types T1 and T2 can be converted to
2290 each other without an explicit cast. Only returns true for opaque
2291 vector types. */
2292 bool
2294 {
2301 }
2303 /* vector_types_convertible_p is used for vector value types.
2304 It could in principle call vector_targets_convertible_p as a subroutine,
2305 but then the check for vector type would be duplicated with its callers,
2306 and also the purpose of vector_targets_convertible_p would become
2307 muddled.
2308 Where vector_types_convertible_p returns true, a conversion might still be
2309 needed to make the types match.
2310 In contrast, vector_targets_convertible_p is used for vector pointer
2311 values, and vector_types_compatible_elements_p is used specifically
2312 in the context for binary operators, as a check if use is possible without
2313 conversion. */
2314 /* True if vector types T1 and T2 can be converted to each other
2315 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2316 can only be converted with -flax-vector-conversions yet that is not
2317 in effect, emit a note telling the user about that option if such
2318 a note has not previously been emitted. */
2319 bool
2321 {
2329 convertible_lax =
2344 {
2347 "conversions between vectors with differing "
2349 }
2352 }
2354 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2355 and have vector types, V0 has the same type as V1, and the number of
2356 elements of V0, V1, MASK is the same.
2358 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2359 called with two arguments. In this case implementation passes the
2360 first argument twice in order to share the same tree code. This fact
2361 could enable the mask-values being twice the vector length. This is
2362 an implementation accident and this semantics is not guaranteed to
2363 the user. */
2364 tree
2367 {
2368 tree ret;
2374 {
2377 }
2385 {
2390 }
2394 {
2398 }
2401 {
2406 }
2412 {
2415 "argument vector(s) and the mask vector should "
2418 }
2422 {
2427 }
2430 {
2431 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2437 else
2438 {
2441 }
2445 }
2455 }
2457 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2458 to integral type. */
2460 static tree
2462 {
2467 {
2468 /* C++0x scoped enumerations don't implicitly convert to integral
2469 type; if we stripped an explicit conversion to a larger type we
2470 need to replace it so common_type will still work. */
2474 }
2476 }
2478 /* This is a helper function of build_binary_op.
2480 For certain operations if both args were extended from the same
2481 smaller type, do the arithmetic in that type and then extend.
2483 BITWISE indicates a bitwise operation.
2484 For them, this optimization is safe only if
2485 both args are zero-extended or both are sign-extended.
2486 Otherwise, we might change the result.
2487 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2488 but calculated in (unsigned short) it would be (unsigned short)-1.
2489 */
2490 tree
2492 {
2496 tree type;
2498 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2499 excessive narrowing when we call get_narrower below. For
2500 example, suppose that OP0 is of unsigned int extended
2501 from signed char and that RESULT_TYPE is long long int.
2502 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2503 like
2505 (long long int) (unsigned int) signed_char
2507 which get_narrower would narrow down to
2509 (unsigned int) signed char
2511 If we do not cast OP0 first, get_narrower would return
2512 signed_char, which is inconsistent with the case of the
2513 explicit cast. */
2520 /* UNS is 1 if the operation to be done is an unsigned one. */
2523 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2524 but it *requires* conversion to FINAL_TYPE. */
2535 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2537 /* For bitwise operations, signedness of nominal type
2538 does not matter. Consider only how operands were extended. */
2542 /* Note that in all three cases below we refrain from optimizing
2543 an unsigned operation on sign-extended args.
2544 That would not be valid. */
2546 /* Both args variable: if both extended in same way
2547 from same width, do it in that width.
2548 Do it unsigned if args were zero-extended. */
2555 return c_common_signed_or_unsigned_type
2562 && (type
2573 && (type
2581 }
2583 /* Checks if expression EXPR of real/integer type cannot be converted
2584 to the real/integer type TYPE. Function returns non-zero when:
2585 * EXPR is a constant which cannot be exactly converted to TYPE.
2586 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2587 for EXPR type and TYPE being both integers or both real.
2588 * EXPR is not a constant of real type and TYPE is an integer.
2589 * EXPR is not a constant of integer type which cannot be
2590 exactly converted to real type.
2591 Function allows conversions between types of different signedness and
2592 can return SAFE_CONVERSION (zero) in that case. Function can produce
2593 signedness warnings if PRODUCE_WARNS is true. */
2595 enum conversion_safety
2597 {
2603 {
2604 /* Warn for real constant that is not an exact integer converted
2605 to integer type. */
2608 {
2611 }
2612 /* Warn for an integer constant that does not fit into integer type. */
2616 {
2619 {
2623 }
2625 {
2629 }
2630 else
2632 }
2634 {
2635 /* Warn for an integer constant that does not fit into real type. */
2637 {
2641 }
2642 /* Warn for a real constant that does not fit into a smaller
2643 real type. */
2646 {
2650 }
2651 }
2652 }
2653 else
2654 {
2655 /* Warn for real types converted to integer types. */
2662 {
2663 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2667 /* Don't warn for short y; short x = ((int)y & 0xff); */
2671 {
2672 /* If both args were extended from a shortest type,
2673 use that type if that is safe. */
2680 {
2686 /* If one of the operands is a non-negative constant
2687 that fits in the target type, then the type of the
2688 other operand does not matter. */
2697 /* If constant is unsigned and fits in the target
2698 type, then the result will also fit. */
2700 && unsigned0
2703 && unsigned1
2706 }
2707 }
2708 /* Warn for integer types converted to smaller integer types. */
2712 /* When they are the same width but different signedness,
2713 then the value may change. */
2716 /* Even when converted to a bigger type, if the type is
2717 unsigned but expr is signed, then negative values
2718 will be changed. */
2724 }
2726 /* Warn for integer types converted to real types if and only if
2727 all the range of values of the integer type cannot be
2728 represented by the real type. */
2731 {
2735 /* Don't warn about char y = 0xff; float x = (int) y; */
2747 }
2749 /* Warn for real types converted to smaller real types. */
2754 }
2757 }
2759 /* Warns if the conversion of EXPR to TYPE may alter a value.
2760 This is a helper function for warnings_for_convert_and_check. */
2762 static void
2764 {
2771 /* This may happen, because for LHS op= RHS we preevaluate
2772 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2773 means we could no longer see the code of the EXPR. */
2780 {
2793 /* Conversion from boolean to a signed:1 bit-field (which only
2794 can hold the values 0 and -1) doesn't lose information - but
2795 it does change the value. */
2815 {
2816 /* In case of COND_EXPR, we do not care about the type of
2817 COND_EXPR, only about the conversion of each operand. */
2824 }
2836 }
2837 }
2839 /* Produce warnings after a conversion. RESULT is the result of
2840 converting EXPR to TYPE. This is a helper function for
2841 convert_and_check and cp_convert_and_check. */
2843 void
2845 tree result)
2846 {
2853 {
2854 /* Do not diagnose overflow in a constant expression merely
2855 because a conversion overflowed. */
2860 {
2861 /* This detects cases like converting -129 or 256 to
2862 unsigned char. */
2866 else
2868 }
2872 /* No warning for converting 0x80000000 to int. */
2880 else
2882 }
2887 else
2889 }
2892 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2893 Invoke this function on every expression that is converted implicitly,
2894 i.e. because of language rules and not because of an explicit cast. */
2896 tree
2898 {
2899 tree result;
2900 tree expr_for_warning;
2902 /* Convert from a value with possible excess precision rather than
2903 via the semantic type, but do not warn about values not fitting
2904 exactly in the semantic type. */
2906 {
2912 }
2913 else
2927 }
2928 \f
2929 /* A node in a list that describes references to variables (EXPR), which are
2930 either read accesses if WRITER is zero, or write accesses, in which case
2931 WRITER is the parent of EXPR. */
2932 struct tlist
2933 {
2936 };
2938 /* Used to implement a cache the results of a call to verify_tree. We only
2939 use this for SAVE_EXPRs. */
2940 struct tlist_cache
2941 {
2945 tree expr;
2946 };
2948 /* Obstack to use when allocating tlist structures, and corresponding
2949 firstobj. */
2953 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2954 warnings. */
2956 /* SAVE_EXPRs need special treatment. We process them only once and then
2957 cache the results. */
2969 /* Create a new struct tlist and fill in its fields. */
2972 {
2979 }
2981 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2982 is nonnull, we ignore any node we find which has a writer equal to it. */
2984 static void
2986 {
2988 {
2995 }
2996 }
2998 /* Merge the nodes of ADD into TO. This merging process is done so that for
2999 each variable that already exists in TO, no new node is added; however if
3000 there is a write access recorded in ADD, and an occurrence on TO is only
3001 a read access, then the occurrence in TO will be modified to record the
3002 write. */
3004 static void
3006 {
3013 {
3020 {
3024 }
3026 {
3030 }
3032 }
3033 }
3035 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3036 references in list LIST conflict with it, excluding reads if ONLY writers
3037 is nonzero. */
3039 static void
3042 {
3045 /* Avoid duplicate warnings. */
3051 {
3055 {
3060 }
3062 }
3063 }
3065 /* Given a list LIST of references to variables, find whether any of these
3066 can cause conflicts due to missing sequence points. */
3068 static void
3070 {
3074 {
3077 }
3078 }
3080 /* Return nonzero if X is a tree that can be verified by the sequence point
3081 warnings. */
3082 static int
3084 {
3091 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3092 (lvalue_p) crash on TRY/CATCH. */
3099 /* No point to track non-const calls, they will never satisfy
3100 operand_equal_p. */
3108 }
3110 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3111 static bool
3113 {
3115 }
3117 /* Walk the tree X, and record accesses to variables. If X is written by the
3118 parent tree, WRITER is the parent.
3119 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3120 expression or its only operand forces a sequence point, then everything up
3121 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3122 in PNO_SP.
3123 Once we return, we will have emitted warnings if any subexpression before
3124 such a sequence point could be undefined. On a higher level, however, the
3125 sequence point may not be relevant, and we'll merge the two lists.
3127 Example: (b++, a) + b;
3128 The call that processes the COMPOUND_EXPR will store the increment of B
3129 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3130 processes the PLUS_EXPR will need to merge the two lists so that
3131 eventually, all accesses end up on the same list (and we'll warn about the
3132 unordered subexpressions b++ and b.
3134 A note on merging. If we modify the former example so that our expression
3135 becomes
3136 (b++, b) + a
3137 care must be taken not simply to add all three expressions into the final
3138 PNO_SP list. The function merge_tlist takes care of that by merging the
3139 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3140 way, so that no more than one access to B is recorded. */
3142 static void
3144 tree writer)
3145 {
3150 /* X may be NULL if it is the operand of an empty statement expression
3151 ({ }). */
3155 restart:
3163 {
3196 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3197 two first, to avoid warning for (a ? b++ : b++). */
3213 /* Expressions inside the LHS are not ordered wrt. the sequence points
3214 in the RHS. Example:
3215 *a = (a++, 2)
3216 Despite the fact that the modification of "a" is in the before_sp
3217 list (tmp_before), it conflicts with the use of "a" in the LHS.
3218 We can handle this by adding the contents of tmp_list3
3219 to those of tmp_before, and redoing the collision warnings for that
3220 list. */
3223 /* Exclude the LHS itself here; we first have to merge it into the
3224 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3225 didn't exclude the LHS, we'd get it twice, once as a read and once
3226 as a write. */
3237 /* We need to warn about conflicts among arguments and conflicts between
3238 args and the function address. Side effects of the function address,
3239 however, are not ordered by the sequence point of the call. */
3240 {
3241 call_expr_arg_iterator iter;
3242 tree arg;
3246 {
3251 }
3256 }
3259 /* Scan all the list, e.g. indices of multi dimensional array. */
3261 {
3267 }
3271 {
3278 {
3292 }
3296 }
3306 /* For other expressions, simply recurse on their operands.
3307 Manual tail recursion for unary expressions.
3308 Other non-expressions need not be processed. */
3310 {
3314 }
3316 {
3320 {
3325 }
3326 }
3328 }
3329 }
3331 /* Try to warn for undefined behavior in EXPR due to missing sequence
3332 points. */
3334 DEBUG_FUNCTION void
3336 {
3342 {
3345 }
3350 }
3351 \f
3352 /* Validate the expression after `case' and apply default promotions. */
3354 static tree
3356 {
3361 /* Promote char or short to int. */
3364 {
3367 }
3372 }
3373 \f
3374 /* See if the case values LOW and HIGH are in the range of the original
3375 type (i.e. before the default conversion to int) of the switch testing
3376 expression.
3377 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3378 the type before promoting it. CASE_LOW_P is a pointer to the lower
3379 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3380 if the case is not a case range.
3381 The caller has to make sure that we are not called with NULL for
3382 CASE_LOW_P (i.e. the default case).
3383 Returns true if the case label is in range of ORIG_TYPE (saturated or
3384 untouched) or false if the label is out of range. */
3386 static bool
3389 {
3394 /* If there was a problem with the original type, do nothing. */
3401 /* Case label is less than minimum for type. */
3404 {
3408 }
3410 /* Case value is greater than maximum for type. */
3413 {
3416 }
3418 /* Saturate lower case label value to minimum. */
3421 {
3425 }
3427 /* Saturate upper case label value to maximum. */
3430 {
3434 }
3442 }
3443 \f
3444 /* Return an integer type with BITS bits of precision,
3445 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3447 tree
3449 {
3488 }
3490 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3491 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3492 and saturating if SATP is nonzero, otherwise not saturating. */
3494 tree
3497 {
3501 else
3509 {
3511 "fixed-point types that have too many integral and "
3514 }
3517 }
3519 /* Used for communication between c_common_type_for_mode and
3520 c_register_builtin_type. */
3521 tree registered_builtin_types;
3523 /* Return a data type that has machine mode MODE.
3524 If the mode is an integer,
3525 then UNSIGNEDP selects between signed and unsigned types.
3526 If the mode is a fixed-point mode,
3527 then UNSIGNEDP selects between saturating and nonsaturating types. */
3529 tree
3531 {
3532 tree t;
3569 #if HOST_BITS_PER_WIDE_INT >= 64
3572 #endif
3597 {
3599 tree inner_type;
3615 }
3617 {
3622 }
3632 {
3718 }
3726 }
3728 tree
3730 {
3732 }
3734 /* Return a signed type the same as TYPE in other respects. */
3736 tree
3738 {
3740 }
3742 /* Return a type the same as TYPE except unsigned or
3743 signed according to UNSIGNEDP. */
3745 tree
3747 {
3748 tree type1;
3750 /* This block of code emulates the behavior of the old
3751 c_common_unsigned_type. In particular, it returns
3752 long_unsigned_type_node if passed a long, even when a int would
3753 have the same size. This is necessary for warnings to work
3754 correctly in archs where sizeof(int) == sizeof(long) */
3757 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3773 #if HOST_BITS_PER_WIDE_INT >= 64
3776 #endif
3786 #define C_COMMON_FIXED_TYPES(NAME) \
3787 if (type1 == short_ ## NAME ## _type_node \
3788 || type1 == unsigned_short_ ## NAME ## _type_node) \
3789 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3790 : short_ ## NAME ## _type_node; \
3791 if (type1 == NAME ## _type_node \
3792 || type1 == unsigned_ ## NAME ## _type_node) \
3793 return unsignedp ? unsigned_ ## NAME ## _type_node \
3794 : NAME ## _type_node; \
3795 if (type1 == long_ ## NAME ## _type_node \
3796 || type1 == unsigned_long_ ## NAME ## _type_node) \
3797 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3798 : long_ ## NAME ## _type_node; \
3799 if (type1 == long_long_ ## NAME ## _type_node \
3800 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3801 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3802 : long_long_ ## NAME ## _type_node;
3804 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3805 if (type1 == NAME ## _type_node \
3806 || type1 == u ## NAME ## _type_node) \
3807 return unsignedp ? u ## NAME ## _type_node \
3808 : NAME ## _type_node;
3810 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3811 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3812 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3813 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3814 : sat_ ## short_ ## NAME ## _type_node; \
3815 if (type1 == sat_ ## NAME ## _type_node \
3816 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3817 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3818 : sat_ ## NAME ## _type_node; \
3819 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3820 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3821 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3822 : sat_ ## long_ ## NAME ## _type_node; \
3823 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3824 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3825 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3826 : sat_ ## long_long_ ## NAME ## _type_node;
3828 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3829 if (type1 == sat_ ## NAME ## _type_node \
3830 || type1 == sat_ ## u ## NAME ## _type_node) \
3831 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3832 : sat_ ## NAME ## _type_node;
3858 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3859 the precision; they have precision set to match their range, but
3860 may use a wider mode to match an ABI. If we change modes, we may
3861 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3862 the precision as well, so as to yield correct results for
3863 bit-field types. C++ does not have these separate bit-field
3864 types, and producing a signed or unsigned variant of an
3865 ENUMERAL_TYPE may cause other problems as well. */
3871 #define TYPE_OK(node) \
3872 (TYPE_MODE (type) == TYPE_MODE (node) \
3873 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3892 #if HOST_BITS_PER_WIDE_INT >= 64
3895 #endif
3904 #undef TYPE_OK
3907 }
3909 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3911 tree
3913 {
3914 /* Extended integer types of the same width as a standard type have
3915 lesser rank, so those of the same width as int promote to int or
3916 unsigned int and are valid for printf formats expecting int or
3917 unsigned int. To avoid such special cases, avoid creating
3918 extended integer types for bit-fields if a standard integer type
3919 is available. */
3936 }
3938 /* The C version of the register_builtin_type langhook. */
3940 void
3942 {
3943 tree decl;
3953 }
3954 \f
3955 /* Print an error message for invalid operands to arith operation
3956 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3957 LOCATION is the location of the message. */
3959 void
3962 {
3966 {
4011 }
4015 }
4016 \f
4017 /* Given an expression as a tree, return its original type. Do this
4018 by stripping any conversion that preserves the sign and precision. */
4019 static tree
4021 {
4024 }
4026 /* Subroutine of build_binary_op, used for comparison operations.
4027 See if the operands have both been converted from subword integer types
4028 and, if so, perhaps change them both back to their original type.
4029 This function is also responsible for converting the two operands
4030 to the proper common type for comparison.
4032 The arguments of this function are all pointers to local variables
4033 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4034 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4036 LOC is the location of the comparison.
4038 If this function returns nonzero, it means that the comparison has
4039 a constant value. What this function returns is an expression for
4040 that value. */
4042 tree
4045 {
4046 tree type;
4054 /* Throw away any conversions to wider types
4055 already present in the operands. */
4060 /* If primopN is first sign-extended from primopN's precision to opN's
4061 precision, then zero-extended from opN's precision to
4062 *restype_ptr precision, shortenings might be invalid. */
4065 && !unsignedp0
4070 && !unsignedp1
4074 /* Handle the case that OP0 does not *contain* a conversion
4075 but it *requires* conversion to FINAL_TYPE. */
4082 /* If one of the operands must be floated, we cannot optimize. */
4086 /* If first arg is constant, swap the args (changing operation
4087 so value is preserved), for canonicalization. Don't do this if
4088 the second arg is 0. */
4093 {
4110 {
4125 }
4127 }
4129 /* If comparing an integer against a constant more bits wide,
4130 maybe we can deduce a value of 1 or 0 independent of the data.
4131 Or else truncate the constant now
4132 rather than extend the variable at run time.
4134 This is only interesting if the constant is the wider arg.
4135 Also, it is not safe if the constant is unsigned and the
4136 variable arg is signed, since in this case the variable
4137 would be sign-extended and then regarded as unsigned.
4138 Our technique fails in this case because the lowest/highest
4139 possible unsigned results don't follow naturally from the
4140 lowest/highest possible values of the variable operand.
4141 For just EQ_EXPR and NE_EXPR there is another technique that
4142 could be used: see if the constant can be faithfully represented
4143 in the other operand's type, by truncating it and reextending it
4144 and see if that preserves the constant's value. */
4150 {
4153 /* 1 if comparison is nominally unsigned. */
4155 tree val;
4167 {
4168 /* Convert primop1 to target type, but do not introduce
4169 additional overflow. We know primop1 is an int_cst. */
4176 }
4178 {
4181 }
4189 /* This used to be a switch, but Genix compiler can't handle that. */
4191 {
4194 }
4196 {
4199 }
4201 {
4206 }
4208 {
4213 }
4215 {
4220 }
4222 {
4227 }
4229 /* If primop0 was sign-extended and unsigned comparison specd,
4230 we did a signed comparison above using the signed type bounds.
4231 But the comparison we output must be unsigned.
4233 Also, for inequalities, VAL is no good; but if the signed
4234 comparison had *any* fixed result, it follows that the
4235 unsigned comparison just tests the sign in reverse
4236 (positive values are LE, negative ones GE).
4237 So we can generate an unsigned comparison
4238 against an extreme value of the signed type. */
4241 {
4244 {
4259 }
4261 }
4264 {
4271 }
4274 {
4275 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4279 }
4281 /* Value is not predetermined, but do the comparison
4282 in the type of the operand that is not constant.
4283 TYPE is already properly set. */
4284 }
4286 /* If either arg is decimal float and the other is float, find the
4287 proper common type to use for comparison. */
4298 /* If args' natural types are both narrower than nominal type
4299 and both extend in the same manner, compare them
4300 in the type of the wider arg.
4301 Otherwise must actually extend both to the nominal
4302 common type lest different ways of extending
4303 alter the result.
4304 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4309 {
4313 type);
4314 /* Make sure shorter operand is extended the right way
4315 to match the longer operand. */
4316 primop0
4319 primop0);
4320 primop1
4323 primop1);
4324 }
4325 else
4326 {
4327 /* Here we must do the comparison on the nominal type
4328 using the args exactly as we received them. */
4335 {
4337 /* All unsigned values are >= 0, so we warn. However,
4338 if OP0 is a constant that is >= 0, the signedness of
4339 the comparison isn't an issue, so suppress the
4340 warning. */
4345 primop0)))
4346 /* Do not warn for enumeration types. */
4350 {
4367 }
4370 {
4371 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4376 }
4377 }
4378 }
4386 }
4387 \f
4388 /* Return a tree for the sum or difference (RESULTCODE says which)
4389 of pointer PTROP and integer INTOP. */
4391 tree
4394 {
4397 /* The result is a pointer of the same type that is being added. */
4401 {
4408 }
4410 {
4417 }
4418 else
4421 /* We are manipulating pointer values, so we don't need to warn
4422 about relying on undefined signed overflow. We disable the
4423 warning here because we use integer types so fold won't know that
4424 they are really pointers. */
4427 /* If what we are about to multiply by the size of the elements
4428 contains a constant term, apply distributive law
4429 and multiply that constant term separately.
4430 This helps produce common subexpressions. */
4435 /* If the constant comes from pointer subtraction,
4436 skip this optimization--it would cause an error. */
4438 /* If the constant is unsigned, and smaller than the pointer size,
4439 then we must skip this optimization. This is because it could cause
4440 an overflow error if the constant is negative but INTOP is not. */
4444 {
4449 /* Convert both subexpression types to the type of intop,
4450 because weird cases involving pointer arithmetic
4451 can result in a sum or difference with different type args. */
4456 }
4458 /* Convert the integer argument to a type the same size as sizetype
4459 so the multiply won't overflow spuriously. */
4465 /* Replace the integer argument with a suitable product by the object size.
4466 Do this multiplication as signed, then convert to the appropriate type
4467 for the pointer operation and disregard an overflow that occurred only
4468 because of the sign-extension change in the latter conversion. */
4469 {
4476 }
4478 /* Create the sum or difference. */
4487 }
4488 \f
4489 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4490 and if NON_CONST is known not to be permitted in an evaluated part
4491 of a constant expression. */
4493 tree
4495 {
4499 /* This should never be called for C++. */
4503 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4512 }
4514 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4515 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4516 around the SAVE_EXPR if needed so that c_fully_fold does not need
4517 to look inside SAVE_EXPRs. */
4519 tree
4521 {
4530 }
4532 /* Return whether EXPR is a declaration whose address can never be
4533 NULL. */
4535 bool
4537 {
4542 }
4544 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4545 or for an `if' or `while' statement or ?..: exp. It should already
4546 have been validated to be of suitable type; otherwise, a bad
4547 diagnostic may result.
4549 The EXPR is located at LOCATION.
4551 This preparation consists of taking the ordinary
4552 representation of an expression expr and producing a valid tree
4553 boolean expression describing whether expr is nonzero. We could
4554 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4555 but we optimize comparisons, &&, ||, and !.
4557 The resulting type should always be `truthvalue_type_node'. */
4559 tree
4561 {
4563 {
4605 ? truthvalue_true_node
4611 ? truthvalue_true_node
4616 /* Fall through. */
4619 {
4622 {
4623 /* Common Ada/Pascal programmer's mistake. */
4625 OPT_Waddress,
4627 inner);
4629 }
4631 }
4648 /* These don't change whether an object is nonzero or zero. */
4653 /* These don't change whether an object is zero or nonzero, but
4654 we can't ignore them if their second arg has side-effects. */
4656 {
4659 c_common_truthvalue_conversion
4662 }
4663 else
4668 /* Distribute the conversion into the arms of a COND_EXPR. */
4670 {
4673 /* In C++ one of the arms might have void type if it is throw. */
4681 }
4682 else
4683 {
4684 /* Folding will happen later for C. */
4692 }
4694 CASE_CONVERT:
4695 {
4699 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4700 since that affects how `default_conversion' will behave. */
4704 /* Don't strip a conversion from C++0x scoped enum, since they
4705 don't implicitly convert to other types. */
4709 /* If this isn't narrowing the argument, we can ignore it. */
4713 }
4719 {
4723 }
4728 }
4731 {
4733 expr = (build_binary_op
4737 c_common_truthvalue_conversion
4740 c_common_truthvalue_conversion
4745 }
4748 {
4753 }
4754 else
4757 ret:
4760 }
4761 \f
4770 /* Apply the TYPE_QUALS to the new DECL. */
4772 void
4774 {
4782 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4783 constructor can produce constant init, so rely on cp_finish_decl to
4784 clear TREE_READONLY if the variable has non-constant init. */
4787 {
4790 }
4792 {
4794 /* Allow 'restrict' on arrays of pointers.
4795 FIXME currently we just ignore it. */
4801 }
4802 }
4804 /* Hash function for the problem of multiple type definitions in
4805 different files. This must hash all types that will compare
4806 equal via comptypes to the same value. In practice it hashes
4807 on some of the simple stuff and leaves the details to comptypes. */
4809 static hashval_t
4811 {
4815 tree t2;
4817 {
4818 /* For pointers, hash on pointee type plus some swizzling. */
4821 /* Hash on number of elements and total size. */
4840 }
4841 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4842 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4844 /* We might have a VLA here. */
4847 else
4850 }
4854 /* Return the typed-based alias set for T, which may be an expression
4855 or a type. Return -1 if we don't do anything special. */
4857 alias_set_type
4859 {
4860 tree u;
4863 /* For VLAs, use the alias set of the element type rather than the
4864 default of alias set 0 for types compared structurally. */
4866 {
4870 }
4872 /* Permit type-punning when accessing a union, provided the access
4873 is directly through the union. For example, this code does not
4874 permit taking the address of a union member and then storing
4875 through it. Even the type-punning allowed here is a GCC
4876 extension, albeit a common and useful one; the C standard says
4877 that such accesses have implementation-defined behavior. */
4885 /* That's all the expressions we handle specially. */
4889 /* The C standard guarantees that any object may be accessed via an
4890 lvalue that has character type. */
4896 /* The C standard specifically allows aliasing between signed and
4897 unsigned variants of the same type. We treat the signed
4898 variant as canonical. */
4900 {
4903 /* t1 == t can happen for boolean nodes which are always unsigned. */
4906 }
4908 /* Handle the case of multiple type nodes referring to "the same" type,
4909 which occurs with IMA. These share an alias set. FIXME: Currently only
4910 C90 is handled. (In C99 type compatibility is not transitive, which
4911 complicates things mightily. The alias set splay trees can theoretically
4912 represent this, but insertion is tricky when you consider all the
4913 different orders things might arrive in.) */
4918 /* Save time if there's only one input file. */
4922 /* Pointers need special handling if they point to any type that
4923 needs special handling (below). */
4925 {
4926 tree t2;
4927 /* Find bottom type under any nested POINTERs. */
4931 ;
4939 }
4940 /* These are the only cases that need special handling. */
4947 /* Undefined? */
4951 /* Look up t in hash table. Only one of the compatible types within each
4952 alias set is recorded in the table. */
4956 NULL);
4959 {
4962 }
4963 else
4964 /* Our caller will assign and record (in t) a new alias set; all we need
4965 to do is remember t in the hash table. */
4969 }
4970 \f
4971 /* Return the least alignment required for type TYPE. */
4973 unsigned int
4975 {
4978 #ifdef BIGGEST_FIELD_ALIGNMENT
4980 #endif
4982 #ifdef ADJUST_FIELD_ALIGN
4984 type);
4986 #endif
4989 }
4991 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4992 the IS_SIZEOF parameter indicates which operator is being applied.
4993 The COMPLAIN flag controls whether we should diagnose possibly
4994 ill-formed constructs or not. LOC is the location of the SIZEOF or
4995 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4996 a type in any context should be returned, rather than the normal
4997 alignment for that type. */
4999 tree
5003 {
5011 {
5013 {
5020 }
5021 else
5022 {
5024 {
5028 else
5031 }
5033 }
5034 }
5036 {
5044 }
5047 {
5052 }
5055 {
5060 }
5061 else
5062 {
5064 /* Convert in case a char is more than one unit. */
5070 else
5072 }
5074 /* VALUE will have the middle-end integer type sizetype.
5075 However, we should really return a value of type `size_t',
5076 which is just a typedef for an ordinary integer type. */
5080 }
5082 /* Implement the __alignof keyword: Return the minimum required
5083 alignment of EXPR, measured in bytes. For VAR_DECLs,
5084 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5085 from an "aligned" __attribute__ specification). LOC is the
5086 location of the ALIGNOF operator. */
5088 tree
5090 {
5091 tree t;
5098 {
5101 }
5107 {
5114 {
5121 }
5123 }
5124 else
5128 }
5129 \f
5130 /* Handle C and C++ default attributes. */
5132 enum built_in_attribute
5133 {
5134 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5135 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5136 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5137 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5138 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5140 #undef DEF_ATTR_NULL_TREE
5141 #undef DEF_ATTR_INT
5142 #undef DEF_ATTR_STRING
5143 #undef DEF_ATTR_IDENT
5144 #undef DEF_ATTR_TREE_LIST
5145 ATTR_LAST
5146 };
5152 enum c_builtin_type
5153 {
5154 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5155 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5156 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5157 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5158 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5159 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5160 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5161 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5162 ARG6) NAME,
5163 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5164 ARG6, ARG7) NAME,
5165 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5166 ARG6, ARG7, ARG8) NAME,
5167 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5168 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5169 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5170 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5171 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5172 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5173 NAME,
5174 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5176 #undef DEF_PRIMITIVE_TYPE
5177 #undef DEF_FUNCTION_TYPE_0
5178 #undef DEF_FUNCTION_TYPE_1
5179 #undef DEF_FUNCTION_TYPE_2
5180 #undef DEF_FUNCTION_TYPE_3
5181 #undef DEF_FUNCTION_TYPE_4
5182 #undef DEF_FUNCTION_TYPE_5
5183 #undef DEF_FUNCTION_TYPE_6
5184 #undef DEF_FUNCTION_TYPE_7
5185 #undef DEF_FUNCTION_TYPE_8
5186 #undef DEF_FUNCTION_TYPE_VAR_0
5187 #undef DEF_FUNCTION_TYPE_VAR_1
5188 #undef DEF_FUNCTION_TYPE_VAR_2
5189 #undef DEF_FUNCTION_TYPE_VAR_3
5190 #undef DEF_FUNCTION_TYPE_VAR_4
5191 #undef DEF_FUNCTION_TYPE_VAR_5
5192 #undef DEF_POINTER_TYPE
5193 BT_LAST
5194 };
5198 /* A temporary array for c_common_nodes_and_builtins. Used in
5199 communication with def_fn_type. */
5202 /* A helper function for c_common_nodes_and_builtins. Build function type
5203 for DEF with return type RET and N arguments. If VAR is true, then the
5204 function should be variadic after those N arguments.
5206 Takes special care not to ICE if any of the types involved are
5207 error_mark_node, which indicates that said type is not in fact available
5208 (see builtin_type_for_size). In which case the function type as a whole
5209 should be error_mark_node. */
5211 static void
5213 {
5214 tree t;
5221 {
5227 }
5234 else
5237 egress:
5240 }
5242 /* Build builtin functions common to both C and C++ language
5243 frontends. */
5245 static void
5247 {
5248 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5249 builtin_types[ENUM] = VALUE;
5250 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5251 def_fn_type (ENUM, RETURN, 0, 0);
5252 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5253 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5254 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5255 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5256 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5257 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5258 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5259 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5260 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5261 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5262 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5263 ARG6) \
5264 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5265 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5266 ARG6, ARG7) \
5267 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5268 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5269 ARG6, ARG7, ARG8) \
5270 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5271 ARG7, ARG8);
5272 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5273 def_fn_type (ENUM, RETURN, 1, 0);
5274 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5275 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5276 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5277 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5278 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5279 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5280 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5281 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5282 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5283 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5284 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5285 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5289 #undef DEF_PRIMITIVE_TYPE
5290 #undef DEF_FUNCTION_TYPE_0
5291 #undef DEF_FUNCTION_TYPE_1
5292 #undef DEF_FUNCTION_TYPE_2
5293 #undef DEF_FUNCTION_TYPE_3
5294 #undef DEF_FUNCTION_TYPE_4
5295 #undef DEF_FUNCTION_TYPE_5
5296 #undef DEF_FUNCTION_TYPE_6
5297 #undef DEF_FUNCTION_TYPE_7
5298 #undef DEF_FUNCTION_TYPE_8
5299 #undef DEF_FUNCTION_TYPE_VAR_0
5300 #undef DEF_FUNCTION_TYPE_VAR_1
5301 #undef DEF_FUNCTION_TYPE_VAR_2
5302 #undef DEF_FUNCTION_TYPE_VAR_3
5303 #undef DEF_FUNCTION_TYPE_VAR_4
5304 #undef DEF_FUNCTION_TYPE_VAR_5
5305 #undef DEF_POINTER_TYPE
5310 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5311 NONANSI_P, ATTRS, IMPLICIT, COND) \
5312 if (NAME && COND) \
5313 def_builtin_1 (ENUM, NAME, CLASS, \
5314 builtin_types[(int) TYPE], \
5315 builtin_types[(int) LIBTYPE], \
5316 BOTH_P, FALLBACK_P, NONANSI_P, \
5317 built_in_attributes[(int) ATTRS], IMPLICIT);
5319 #undef DEF_BUILTIN
5327 }
5329 /* Like get_identifier, but avoid warnings about null arguments when
5330 the argument may be NULL for targets where GCC lacks stdint.h type
5331 information. */
5335 {
5337 }
5339 /* Build tree nodes and builtin functions common to both C and C++ language
5340 frontends. */
5342 void
5344 {
5348 tree array_domain_type;
5349 tree va_list_ref_type_node;
5350 tree va_list_arg_type_node;
5354 /* Define `int' and `char' first so that dbx will output them first. */
5358 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5359 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5360 but not C. Are the conditionals here needed? */
5366 long_unsigned_type_node);
5368 {
5370 int128_integer_type_node);
5372 int128_unsigned_type_node);
5373 }
5377 long_long_integer_type_node);
5379 long_long_unsigned_type_node);
5382 long_long_unsigned_type_node);
5385 short_unsigned_type_node);
5388 short_unsigned_type_node);
5390 /* Define both `signed char' and `unsigned char'. */
5394 /* These are types that c_common_type_for_size and
5395 c_common_type_for_mode use. */
5398 intQI_type_node));
5401 intHI_type_node));
5404 intSI_type_node));
5407 intDI_type_node));
5408 #if HOST_BITS_PER_WIDE_INT >= 64
5411 TYPE_DECL,
5413 intTI_type_node));
5414 #endif
5417 unsigned_intQI_type_node));
5420 unsigned_intHI_type_node));
5423 unsigned_intSI_type_node));
5426 unsigned_intDI_type_node));
5427 #if HOST_BITS_PER_WIDE_INT >= 64
5430 TYPE_DECL,
5432 unsigned_intTI_type_node));
5433 #endif
5435 /* Create the widest literal types. */
5436 widest_integer_literal_type_node
5440 widest_integer_literal_type_node));
5442 widest_unsigned_literal_type_node
5446 widest_unsigned_literal_type_node));
5450 pid_type_node =
5457 /* Only supported decimal floating point extension if the target
5458 actually supports underlying modes. */
5462 {
5466 }
5469 {
5474 long_long_fract_type_node);
5476 unsigned_short_fract_type_node);
5478 unsigned_fract_type_node);
5480 unsigned_long_fract_type_node);
5482 unsigned_long_long_fract_type_node);
5484 sat_short_fract_type_node);
5487 sat_long_fract_type_node);
5489 sat_long_long_fract_type_node);
5491 sat_unsigned_short_fract_type_node);
5493 sat_unsigned_fract_type_node);
5495 sat_unsigned_long_fract_type_node);
5497 sat_unsigned_long_long_fract_type_node);
5502 long_long_accum_type_node);
5504 unsigned_short_accum_type_node);
5506 unsigned_accum_type_node);
5508 unsigned_long_accum_type_node);
5510 unsigned_long_long_accum_type_node);
5512 sat_short_accum_type_node);
5515 sat_long_accum_type_node);
5517 sat_long_long_accum_type_node);
5519 sat_unsigned_short_accum_type_node);
5521 sat_unsigned_accum_type_node);
5523 sat_unsigned_long_accum_type_node);
5525 sat_unsigned_long_long_accum_type_node);
5527 }
5530 TYPE_DECL,
5532 complex_integer_type_node));
5534 TYPE_DECL,
5536 complex_float_type_node));
5538 TYPE_DECL,
5540 complex_double_type_node));
5544 complex_long_double_type_node));
5547 /* For C++, make fileptr_type_node a distinct void * type until
5548 FILE type is defined. */
5553 /* Set the TYPE_NAME for any variants that were built before
5554 record_builtin_type gave names to the built-in types. */
5555 {
5561 }
5565 /* Make a type to be the domain of a few array types
5566 whose domains don't really matter.
5567 200 is small enough that it always fits in size_t
5568 and large enough that it can hold most function names for the
5569 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5572 /* Make a type for arrays of characters.
5573 With luck nothing will ever really depend on the length of this
5574 array type. */
5575 char_array_type_node
5579 const_string_type_node
5583 /* This is special for C++ so functions can be overloaded. */
5589 {
5592 else
5595 }
5597 /* This is for wide string constants. */
5598 wchar_array_type_node
5601 /* Define 'char16_t'. */
5606 {
5611 }
5613 /* This is for UTF-16 string constants. */
5614 char16_array_type_node
5617 /* Define 'char32_t'. */
5622 {
5627 }
5629 /* This is for UTF-32 string constants. */
5630 char32_array_type_node
5633 wint_type_node =
5636 intmax_type_node =
5638 uintmax_type_node =
5642 sig_atomic_type_node =
5645 int8_type_node =
5648 int16_type_node =
5651 int32_type_node =
5654 int64_type_node =
5657 uint8_type_node =
5669 int_least8_type_node =
5672 int_least16_type_node =
5675 int_least32_type_node =
5678 int_least64_type_node =
5681 uint_least8_type_node =
5684 uint_least16_type_node =
5687 uint_least32_type_node =
5690 uint_least64_type_node =
5693 int_fast8_type_node =
5696 int_fast16_type_node =
5699 int_fast32_type_node =
5702 int_fast64_type_node =
5705 uint_fast8_type_node =
5708 uint_fast16_type_node =
5711 uint_fast32_type_node =
5714 uint_fast64_type_node =
5717 intptr_type_node =
5720 uintptr_type_node =
5723 default_function_type
5725 ptrdiff_type_node
5732 va_list_type_node));
5734 {
5737 tree ptype;
5740 {
5744 ptype));
5746 }
5747 }
5750 {
5753 }
5754 else
5755 {
5758 }
5765 /* Create the built-in __null node. It is important that this is
5766 not shared. */
5770 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5772 }
5774 /* The number of named compound-literals generated thus far. */
5777 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5779 void
5781 {
5784 compound_literal_number);
5785 compound_literal_number++;
5787 }
5789 tree
5791 {
5795 }
5798 /* Linked list of disabled built-in functions. */
5801 {
5809 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5810 begins with "__builtin_", give an error. */
5812 void
5814 {
5817 else
5818 {
5823 }
5824 }
5827 /* Return true if the built-in function NAME has been disabled, false
5828 otherwise. */
5830 static bool
5832 {
5835 {
5838 }
5840 }
5843 /* Worker for DEF_BUILTIN.
5844 Possibly define a builtin function with one or two names.
5845 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5846 nonansi_p and flag_no_nonansi_builtin. */
5848 static void
5855 {
5856 tree decl;
5869 fnattrs);
5878 }
5879 \f
5880 /* Nonzero if the type T promotes to int. This is (nearly) the
5881 integral promotions defined in ISO C99 6.3.1.1/2. */
5883 bool
5885 {
5887 {
5897 /* ??? Technically all enumerations not larger than an int
5898 promote to an int. But this is used along code paths
5899 that only want to notice a size change. */
5907 }
5908 }
5910 /* Return 1 if PARMS specifies a fixed number of parameters
5911 and none of their types is affected by default promotions. */
5913 int
5915 {
5916 const_tree t;
5918 {
5935 }
5937 }
5939 /* Recursively remove any '*' or '&' operator from TYPE. */
5940 tree
5942 {
5946 }
5948 /* Recursively remove pointer or array type from TYPE. */
5949 tree
5951 {
5955 }
5957 /* Used to compare case labels. K1 and K2 are actually tree nodes
5958 representing case labels, or NULL_TREE for a `default' label.
5959 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5960 K2, and 0 if K1 and K2 are equal. */
5962 int
5964 {
5965 /* Consider a NULL key (such as arises with a `default' label) to be
5966 smaller than anything else. */
5973 }
5975 /* Process a case label, located at LOC, for the range LOW_VALUE
5976 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5977 then this case label is actually a `default' label. If only
5978 HIGH_VALUE is NULL_TREE, then case label was declared using the
5979 usual C/C++ syntax, rather than the GNU case range extension.
5980 CASES is a tree containing all the case ranges processed so far;
5981 COND is the condition for the switch-statement itself. Returns the
5982 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5983 is created. */
5985 tree
5988 {
5989 tree type;
5990 tree label;
5991 tree case_label;
5992 splay_tree_node node;
5994 /* Create the LABEL_DECL itself. */
5997 /* If there was an error processing the switch condition, bail now
5998 before we get more confused. */
6006 {
6009 }
6011 /* Case ranges are a GNU extension. */
6018 {
6023 }
6025 {
6030 }
6033 {
6034 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6035 really a case range, even though it was written that way.
6036 Remove the HIGH_VALUE to simplify later processing. */
6041 }
6043 /* See if the case is in range of the type of the original testing
6044 expression. If both low_value and high_value are out of range,
6045 don't insert the case label and return NULL_TREE. */
6051 /* Look up the LOW_VALUE in the table of case labels we already
6052 have. */
6054 /* If there was not an exact match, check for overlapping ranges.
6055 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6056 that's a `default' label and the only overlap is an exact match. */
6058 {
6059 splay_tree_node low_bound;
6060 splay_tree_node high_bound;
6062 /* Even though there wasn't an exact match, there might be an
6063 overlap between this case range and another case range.
6064 Since we've (inductively) not allowed any overlapping case
6065 ranges, we simply need to find the greatest low case label
6066 that is smaller that LOW_VALUE, and the smallest low case
6067 label that is greater than LOW_VALUE. If there is an overlap
6068 it will occur in one of these two ranges. */
6074 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6075 the LOW_VALUE, so there is no need to check unless the
6076 LOW_BOUND is in fact itself a case range. */
6082 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6083 range is bigger than the low end of the current range, so we
6084 are only interested if the current range is a real range, and
6085 not an ordinary case label. */
6087 && high_value
6089 high_value)
6092 }
6093 /* If there was an overlap, issue an error. */
6095 {
6099 {
6103 }
6105 {
6108 }
6109 else
6110 {
6114 }
6116 }
6118 /* Add a CASE_LABEL to the statement-tree. */
6120 /* Register this case label in the splay tree. */
6127 error_out:
6128 /* Add a label so that the back-end doesn't think that the beginning of
6129 the switch is unreachable. Note that we do not add a case label, as
6130 that just leads to duplicates and thence to failure later on. */
6132 {
6135 }
6137 }
6139 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6140 Used to verify that case values match up with enumerator values. */
6142 static void
6144 {
6151 else
6158 buf);
6159 else
6164 }
6166 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6167 Used to verify that case values match up with enumerator values. */
6169 static int
6171 {
6175 /* Skip default case. */
6179 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6180 when we did our enum->case scan. Reset our scratch bit after. */
6183 else
6186 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6187 not set, that means that CASE_HIGH did not appear when we did our
6188 enum->case scan. Reset our scratch bit after. */
6190 {
6193 else
6195 }
6198 }
6200 /* Handle -Wswitch*. Called from the front end after parsing the
6201 switch construct. */
6202 /* ??? Should probably be somewhere generic, since other languages
6203 besides C and C++ would want this. At the moment, however, C/C++
6204 are the only tree-ssa languages that support enumerations at all,
6205 so the point is moot. */
6207 void
6210 {
6211 splay_tree_node default_node;
6212 splay_tree_node node;
6213 tree chain;
6223 /* From here on, we only care about about enumerated types. */
6227 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6231 /* Check the cases. Warn about case values which are not members of
6232 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6233 there is no default case, check that exactly all enumeration
6234 literals are covered by the cases. */
6236 /* Clearing COND if it is not an integer constant simplifies
6237 the tests inside the loop below. */
6241 /* The time complexity here is O(N*lg(N)) worst case, but for the
6242 common case of monotonically increasing enumerators, it is
6243 O(N), since the nature of the splay tree will keep the next
6244 element adjacent to the root at all times. */
6247 {
6253 {
6254 /* Mark the CASE_LOW part of the case entry as seen. */
6258 }
6260 /* Even though there wasn't an exact match, there might be a
6261 case range which includes the enumerator's value. */
6264 {
6268 {
6269 /* If we match the upper bound exactly, mark the CASE_HIGH
6270 part of the case entry as seen. */
6274 }
6275 }
6277 /* We've now determined that this enumerated literal isn't
6278 handled by the case labels of the switch statement. */
6280 /* If the switch expression is a constant, we only really care
6281 about whether that constant is handled by the switch. */
6285 /* If there is a default_node, the only relevant option is
6286 Wswitch-enum. Otherwise, if both are enabled then we prefer
6287 to warn using -Wswitch because -Wswitch is enabled by -Wall
6288 while -Wswitch-enum is explicit. */
6291 ? OPT_Wswitch_enum
6295 }
6297 /* Warn if there are case expressions that don't correspond to
6298 enumerators. This can occur since C and C++ don't enforce
6299 type-checking of assignments to enumeration variables.
6301 The time complexity here is now always O(N) worst case, since
6302 we should have marked both the lower bound and upper bound of
6303 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6304 above. This scan also resets those fields. */
6307 }
6309 /* Finish an expression taking the address of LABEL (an
6310 IDENTIFIER_NODE). Returns an expression for the address.
6312 LOC is the location for the expression returned. */
6314 tree
6316 {
6317 tree result;
6327 else
6328 {
6331 /* The current function is not necessarily uninlinable.
6332 Computed gotos are incompatible with inlining, but the value
6333 here could be used only in a diagnostic, for example. */
6335 }
6338 }
6339 \f
6341 /* Given a boolean expression ARG, return a tree representing an increment
6342 or decrement (as indicated by CODE) of ARG. The front end must check for
6343 invalid cases (e.g., decrement in C++). */
6344 tree
6346 {
6347 tree val;
6352 {
6375 }
6378 }
6379 \f
6380 /* Built-in macros for stddef.h and stdint.h, that require macros
6381 defined in this file. */
6382 void
6384 {
6447 }
6449 static void
6451 {
6452 /* Fill in the built_in_attributes array. */
6453 #define DEF_ATTR_NULL_TREE(ENUM) \
6454 built_in_attributes[(int) ENUM] = NULL_TREE;
6455 #define DEF_ATTR_INT(ENUM, VALUE) \
6456 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6457 #define DEF_ATTR_STRING(ENUM, VALUE) \
6458 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6459 #define DEF_ATTR_IDENT(ENUM, STRING) \
6460 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6461 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6462 built_in_attributes[(int) ENUM] \
6463 = tree_cons (built_in_attributes[(int) PURPOSE], \
6464 built_in_attributes[(int) VALUE], \
6465 built_in_attributes[(int) CHAIN]);
6467 #undef DEF_ATTR_NULL_TREE
6468 #undef DEF_ATTR_INT
6469 #undef DEF_ATTR_IDENT
6470 #undef DEF_ATTR_TREE_LIST
6471 }
6473 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6474 identifier as an argument, so the front end shouldn't look it up. */
6476 bool
6478 {
6481 /* Unknown attribute that we'll end up ignoring, return true so we
6482 don't complain about an identifier argument. */
6488 else
6490 }
6492 /* Attribute handlers common to C front ends. */
6494 /* Handle a "packed" attribute; arguments as in
6495 struct attribute_spec.handler. */
6497 static tree
6500 {
6502 {
6506 }
6508 {
6510 /* Still pack bitfields. */
6515 else
6517 }
6518 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6519 used for DECL_REGISTER. It wouldn't mean anything anyway.
6520 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6521 that changes what the typedef is typing. */
6522 else
6523 {
6526 }
6529 }
6531 /* Handle a "nocommon" attribute; arguments as in
6532 struct attribute_spec.handler. */
6534 static tree
6538 {
6541 else
6542 {
6545 }
6548 }
6550 /* Handle a "common" attribute; arguments as in
6551 struct attribute_spec.handler. */
6553 static tree
6556 {
6559 else
6560 {
6563 }
6566 }
6568 /* Handle a "noreturn" attribute; arguments as in
6569 struct attribute_spec.handler. */
6571 static tree
6574 {
6577 /* See FIXME comment in c_common_attribute_table. */
6584 = build_pointer_type
6587 else
6588 {
6591 }
6594 }
6596 /* Handle a "hot" and attribute; arguments as in
6597 struct attribute_spec.handler. */
6599 static tree
6602 {
6605 {
6607 {
6611 }
6612 /* Most of the rest of the hot processing is done later with
6613 lookup_attribute. */
6614 }
6615 else
6616 {
6619 }
6622 }
6624 /* Handle a "cold" and attribute; arguments as in
6625 struct attribute_spec.handler. */
6627 static tree
6630 {
6633 {
6635 {
6639 }
6640 /* Most of the rest of the cold processing is done later with
6641 lookup_attribute. */
6642 }
6643 else
6644 {
6647 }
6650 }
6652 /* Handle a "no_sanitize_address" attribute; arguments as in
6653 struct attribute_spec.handler. */
6655 static tree
6658 {
6660 {
6663 }
6666 }
6668 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6669 struct attribute_spec.handler. */
6671 static tree
6674 {
6683 }
6685 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6686 struct attribute_spec.handler. */
6688 static tree
6691 {
6693 {
6696 }
6699 }
6701 /* Handle a "noinline" attribute; arguments as in
6702 struct attribute_spec.handler. */
6704 static tree
6708 {
6710 {
6712 {
6716 }
6717 else
6719 }
6720 else
6721 {
6724 }
6727 }
6729 /* Handle a "noclone" attribute; arguments as in
6730 struct attribute_spec.handler. */
6732 static tree
6736 {
6738 {
6741 }
6744 }
6746 /* Handle a "always_inline" attribute; arguments as in
6747 struct attribute_spec.handler. */
6749 static tree
6754 {
6756 {
6758 {
6762 }
6763 else
6764 /* Set the attribute and mark it for disregarding inline
6765 limits. */
6767 }
6768 else
6769 {
6772 }
6775 }
6777 /* Handle a "gnu_inline" attribute; arguments as in
6778 struct attribute_spec.handler. */
6780 static tree
6785 {
6787 {
6788 /* Do nothing else, just set the attribute. We'll get at
6789 it later with lookup_attribute. */
6790 }
6791 else
6792 {
6795 }
6798 }
6800 /* Handle a "leaf" attribute; arguments as in
6801 struct attribute_spec.handler. */
6803 static tree
6807 {
6809 {
6812 }
6814 {
6817 }
6820 }
6822 /* Handle an "artificial" attribute; arguments as in
6823 struct attribute_spec.handler. */
6825 static tree
6830 {
6832 {
6833 /* Do nothing else, just set the attribute. We'll get at
6834 it later with lookup_attribute. */
6835 }
6836 else
6837 {
6840 }
6843 }
6845 /* Handle a "flatten" attribute; arguments as in
6846 struct attribute_spec.handler. */
6848 static tree
6850 tree args ATTRIBUTE_UNUSED,
6852 {
6854 /* Do nothing else, just set the attribute. We'll get at
6855 it later with lookup_attribute. */
6856 ;
6857 else
6858 {
6861 }
6864 }
6866 /* Handle a "warning" or "error" attribute; arguments as in
6867 struct attribute_spec.handler. */
6869 static tree
6872 {
6875 /* Do nothing else, just set the attribute. We'll get at
6876 it later with lookup_attribute. */
6877 ;
6878 else
6879 {
6882 }
6885 }
6887 /* Handle a "used" attribute; arguments as in
6888 struct attribute_spec.handler. */
6890 static tree
6893 {
6899 {
6904 }
6905 else
6906 {
6909 }
6912 }
6914 /* Handle a "unused" attribute; arguments as in
6915 struct attribute_spec.handler. */
6917 static tree
6920 {
6922 {
6930 {
6935 }
6936 else
6937 {
6940 }
6941 }
6942 else
6943 {
6947 }
6950 }
6952 /* Handle a "externally_visible" attribute; arguments as in
6953 struct attribute_spec.handler. */
6955 static tree
6960 {
6964 {
6967 {
6971 }
6972 }
6973 else
6974 {
6977 }
6980 }
6982 /* Handle a "const" attribute; arguments as in
6983 struct attribute_spec.handler. */
6985 static tree
6988 {
6991 /* See FIXME comment on noreturn in c_common_attribute_table. */
6997 = build_pointer_type
7000 else
7001 {
7004 }
7007 }
7009 /* Handle a "transparent_union" attribute; arguments as in
7010 struct attribute_spec.handler. */
7012 static tree
7016 {
7017 tree type;
7028 {
7029 /* Make sure that the first field will work for a transparent union.
7030 If the type isn't complete yet, leave the check to the code in
7031 finish_struct. */
7033 {
7039 }
7042 {
7043 /* If the type isn't complete yet, setting the flag
7044 on a variant wouldn't ever be checked. */
7048 /* build_duplicate_type doesn't work for C++. */
7052 /* A type variant isn't good enough, since we don't a cast
7053 to such a type removed as a no-op. */
7055 }
7059 }
7061 ignored:
7064 }
7066 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7067 get the requested priority for a constructor or destructor,
7068 possibly issuing diagnostics for invalid or reserved
7069 priorities. */
7071 static priority_type
7073 {
7074 HOST_WIDE_INT pri;
7075 tree arg;
7081 {
7084 else
7087 }
7104 {
7107 "destructor priorities from 0 to %d are reserved "
7109 MAX_RESERVED_INIT_PRIORITY);
7110 else
7112 "constructor priorities from 0 to %d are reserved "
7114 MAX_RESERVED_INIT_PRIORITY);
7115 }
7118 invalid:
7121 MAX_INIT_PRIORITY);
7122 else
7124 MAX_INIT_PRIORITY);
7126 }
7128 /* Handle a "constructor" attribute; arguments as in
7129 struct attribute_spec.handler. */
7131 static tree
7135 {
7142 {
7143 priority_type priority;
7148 }
7149 else
7150 {
7153 }
7156 }
7158 /* Handle a "destructor" attribute; arguments as in
7159 struct attribute_spec.handler. */
7161 static tree
7165 {
7172 {
7173 priority_type priority;
7178 }
7179 else
7180 {
7183 }
7186 }
7188 /* Nonzero if the mode is a valid vector mode for this architecture.
7189 This returns nonzero even if there is no hardware support for the
7190 vector mode, but we can emulate with narrower modes. */
7192 static int
7194 {
7198 /* Doh! What's going on? */
7207 /* Hardware support. Woo hoo! */
7213 /* We should probably return 1 if requesting V4DI and we have no DI,
7214 but we have V2DI, but this is probably very unlikely. */
7216 /* If we have support for the inner mode, we can safely emulate it.
7217 We may not have V2DI, but me can emulate with a pair of DIs. */
7219 }
7222 /* Handle a "mode" attribute; arguments as in
7223 struct attribute_spec.handler. */
7225 static tree
7228 {
7236 else
7237 {
7242 tree typefm;
7247 {
7253 }
7255 /* Change this type to have a type with the specified mode.
7256 First check for the special modes. */
7269 else
7272 {
7275 }
7278 {
7281 }
7285 {
7317 }
7319 {
7322 }
7325 {
7330 {
7333 }
7337 else
7340 }
7341 else
7342 {
7343 /* For fixed-point modes, we need to test if the signness of type
7344 and the machine mode are consistent. */
7347 {
7350 }
7351 /* For fixed-point modes, we need to pass saturating info. */
7355 }
7358 {
7361 }
7363 {
7364 /* For enumeral types, copy the precision from the integer
7365 type returned above. If not an INTEGER_TYPE, we can't use
7366 this mode for this type. */
7368 {
7371 }
7374 {
7377 }
7378 else
7379 {
7380 /* We cannot build a type variant, as there's code that assumes
7381 that TYPE_MAIN_VARIANT has the same mode. This includes the
7382 debug generators. Instead, create a subrange type. This
7383 results in all of the enumeral values being emitted only once
7384 in the original, and the subtype gets them by reference. */
7387 else
7390 }
7391 }
7395 {
7398 }
7401 }
7404 }
7406 /* Handle a "section" attribute; arguments as in
7407 struct attribute_spec.handler. */
7409 static tree
7412 {
7416 {
7422 {
7426 {
7428 "section attribute cannot be specified for "
7431 }
7433 /* The decl may have already been given a section attribute
7434 from a previous declaration. Ensure they match. */
7438 {
7442 }
7446 {
7449 }
7450 else
7453 }
7454 else
7455 {
7458 }
7459 }
7460 else
7461 {
7465 }
7468 }
7470 /* Check whether ALIGN is a valid user-specified alignment. If so,
7471 return its base-2 log; if not, output an error and return -1. If
7472 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7473 no error. */
7474 int
7476 {
7483 {
7486 }
7491 {
7494 }
7496 {
7499 }
7501 }
7503 /*
7504 If in c++-11, check if the c++-11 alignment constraint with respect
7505 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7506 c++-11 mode, does nothing.
7508 [dcl.align]2/ says:
7510 [* if the constant expression evaluates to a fundamental alignment,
7511 the alignment requirement of the declared entity shall be the
7512 specified fundamental alignment.
7514 * if the constant expression evaluates to an extended alignment
7515 and the implementation supports that alignment in the context
7516 of the declaration, the alignment of the declared entity shall
7517 be that alignment
7519 * if the constant expression evaluates to an extended alignment
7520 and the implementation does not support that alignment in the
7521 context of the declaration, the program is ill-formed]. */
7523 static bool
7527 {
7540 {
7542 {
7543 /* For file scope variables and static members, the target
7544 supports alignments that are at most
7545 MAX_OFILE_ALIGNMENT. */
7548 }
7549 else
7550 {
7551 #ifdef BIGGEST_FIELD_ALIGNMENT
7552 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7553 #else
7554 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7555 #endif
7556 /* For non-static members, the target supports either
7557 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7558 if it is defined or BIGGEST_ALIGNMENT. */
7563 #undef MAX_TARGET_FIELD_ALIGNMENT
7564 /* For stack variables, the target supports at most
7565 MAX_STACK_ALIGNMENT. */
7569 }
7570 }
7572 {
7573 /* Let's be liberal for types. */
7576 }
7584 }
7586 /* Handle a "aligned" attribute; arguments as in
7587 struct attribute_spec.handler. */
7589 static tree
7592 {
7596 tree align_expr;
7600 {
7605 }
7606 else
7610 {
7614 }
7622 {
7625 /* If we have a TYPE_DECL, then copy the type, so that we
7626 don't accidentally modify a builtin type. See pushdecl. */
7629 {
7636 }
7637 else
7642 }
7645 {
7648 }
7651 /* C++-11 [dcl.align/4]:
7653 When multiple alignment-specifiers are specified for an
7654 entity, the alignment requirement shall be set to the
7655 strictest specified alignment.
7657 This formally comes from the c++11 specification but we are
7658 doing it for the GNU attribute syntax as well. */
7662 {
7667 else
7671 }
7672 else
7673 {
7676 }
7679 }
7681 /* Handle a "weak" attribute; arguments as in
7682 struct attribute_spec.handler. */
7684 static tree
7689 {
7692 {
7695 }
7697 {
7701 }
7705 else
7709 }
7711 /* Handle an "alias" or "ifunc" attribute; arguments as in
7712 struct attribute_spec.handler, except that IS_ALIAS tells us
7713 whether this is an alias as opposed to ifunc attribute. */
7715 static tree
7718 {
7723 {
7726 }
7730 /* A static variable declaration is always a tentative definition,
7731 but the alias is a non-tentative definition which overrides. */
7734 {
7738 }
7742 {
7746 }
7748 /* Note that the very first time we process a nested declaration,
7749 decl_function_context will not be set. Indeed, *would* never
7750 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7751 we do below. After such frobbery, pushdecl would set the context.
7752 In any case, this is never what we want. */
7754 {
7755 tree id;
7759 {
7763 }
7765 /* This counts as a use of the object pointed to. */
7770 else
7774 /* ifuncs are also aliases, so set that attribute too. */
7777 }
7778 else
7779 {
7782 }
7785 }
7787 /* Handle an "alias" or "ifunc" attribute; arguments as in
7788 struct attribute_spec.handler. */
7790 static tree
7793 {
7795 }
7797 /* Handle an "alias" or "ifunc" attribute; arguments as in
7798 struct attribute_spec.handler. */
7800 static tree
7803 {
7805 }
7807 /* Handle a "weakref" attribute; arguments as in struct
7808 attribute_spec.handler. */
7810 static tree
7813 {
7816 /* We must ignore the attribute when it is associated with
7817 local-scoped decls, since attribute alias is ignored and many
7818 such symbols do not even have a DECL_WEAK field. */
7820 || current_function_decl
7822 {
7826 }
7829 {
7833 }
7835 /* The idea here is that `weakref("name")' mutates into `weakref,
7836 alias("name")', and weakref without arguments, in turn,
7837 implicitly adds weak. */
7840 {
7847 }
7848 else
7849 {
7854 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7855 and that isn't supported; and because it wants to add it to
7856 the list of weak decls, which isn't helpful. */
7858 }
7861 }
7863 /* Handle an "visibility" attribute; arguments as in
7864 struct attribute_spec.handler. */
7866 static tree
7870 {
7876 {
7880 {
7882 name);
7884 }
7886 {
7890 }
7891 }
7893 {
7896 }
7899 {
7902 }
7904 /* If this is a type, set the visibility on the type decl. */
7906 {
7911 {
7913 name);
7915 }
7916 }
7926 else
7927 {
7928 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7930 }
7934 {
7948 }
7953 /* Go ahead and attach the attribute to the node as well. This is needed
7954 so we can determine whether we have VISIBILITY_DEFAULT because the
7955 visibility was not specified, or because it was explicitly overridden
7956 from the containing scope. */
7959 }
7961 /* Determine the ELF symbol visibility for DECL, which is either a
7962 variable or a function. It is an error to use this function if a
7963 definition of DECL is not available in this translation unit.
7964 Returns true if the final visibility has been determined by this
7965 function; false if the caller is free to make additional
7966 modifications. */
7968 bool
7970 {
7974 /* If the user explicitly specified the visibility with an
7975 attribute, honor that. DECL_VISIBILITY will have been set during
7976 the processing of the attribute. We check for an explicit
7977 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7978 to distinguish the use of an attribute from the use of a "#pragma
7979 GCC visibility push(...)"; in the latter case we still want other
7980 considerations to be able to overrule the #pragma. */
7982 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7987 /* Set default visibility to whatever the user supplied with
7988 visibility_specified depending on #pragma GCC visibility. */
7990 {
7993 {
7996 /* If visibility changed and DECL already has DECL_RTL, ensure
7997 symbol flags are updated. */
8002 }
8003 }
8005 }
8007 /* Handle an "tls_model" attribute; arguments as in
8008 struct attribute_spec.handler. */
8010 static tree
8013 {
8014 tree id;
8021 {
8024 }
8029 {
8032 }
8042 else
8043 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8047 }
8049 /* Handle a "no_instrument_function" attribute; arguments as in
8050 struct attribute_spec.handler. */
8052 static tree
8057 {
8061 {
8065 }
8066 else
8070 }
8072 /* Handle a "malloc" attribute; arguments as in
8073 struct attribute_spec.handler. */
8075 static tree
8078 {
8082 else
8083 {
8086 }
8089 }
8091 /* Handle a "alloc_size" attribute; arguments as in
8092 struct attribute_spec.handler. */
8094 static tree
8097 {
8100 {
8107 || !arg_count
8109 {
8114 }
8115 }
8117 }
8119 /* Handle a "alloc_align" attribute; arguments as in
8120 struct attribute_spec.handler. */
8122 static tree
8125 {
8132 || !arg_count
8134 {
8139 }
8141 }
8143 /* Handle a "assume_aligned" attribute; arguments as in
8144 struct attribute_spec.handler. */
8146 static tree
8149 {
8151 {
8158 {
8163 }
8164 }
8166 }
8168 /* Handle a "fn spec" attribute; arguments as in
8169 struct attribute_spec.handler. */
8171 static tree
8175 {
8180 }
8182 /* Handle a "warn_unused" attribute; arguments as in
8183 struct attribute_spec.handler. */
8185 static tree
8187 tree args ATTRIBUTE_UNUSED,
8189 {
8191 /* Do nothing else, just set the attribute. We'll get at
8192 it later with lookup_attribute. */
8193 ;
8194 else
8195 {
8198 }
8201 }
8203 /* Handle an "omp declare simd" attribute; arguments as in
8204 struct attribute_spec.handler. */
8206 static tree
8208 {
8210 }
8212 /* Handle an "omp declare target" attribute; arguments as in
8213 struct attribute_spec.handler. */
8215 static tree
8217 {
8219 }
8221 /* Handle a "returns_twice" attribute; arguments as in
8222 struct attribute_spec.handler. */
8224 static tree
8227 {
8230 else
8231 {
8234 }
8237 }
8239 /* Handle a "no_limit_stack" attribute; arguments as in
8240 struct attribute_spec.handler. */
8242 static tree
8247 {
8251 {
8255 }
8257 {
8261 }
8262 else
8266 }
8268 /* Handle a "pure" attribute; arguments as in
8269 struct attribute_spec.handler. */
8271 static tree
8274 {
8277 /* ??? TODO: Support types. */
8278 else
8279 {
8282 }
8285 }
8287 /* Digest an attribute list destined for a transactional memory statement.
8288 ALLOWED is the set of attributes that are allowed for this statement;
8289 return the attribute we parsed. Multiple attributes are never allowed. */
8291 int
8293 {
8298 {
8306 {
8309 }
8312 {
8315 }
8318 else
8320 }
8323 }
8325 /* Transform a TM attribute name into a maskable integer and back.
8326 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8327 to how the lack of an attribute is treated. */
8329 int
8331 {
8345 }
8347 tree
8349 {
8352 {
8370 }
8372 }
8374 /* Return the first TM attribute seen in LIST. */
8376 tree
8378 {
8380 {
8384 }
8386 }
8388 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8389 Here we accept only function types, and verify that none of the other
8390 function TM attributes are also applied. */
8391 /* ??? We need to accept class types for C++, but not C. This greatly
8392 complicates this function, since we can no longer rely on the extra
8393 processing given by function_type_required. */
8395 static tree
8398 {
8399 /* Only one path adds the attribute; others don't. */
8403 {
8406 /* Only tm_callable and tm_safe apply to classes. */
8409 /* FALLTHRU */
8413 {
8416 ;
8419 else
8421 }
8425 {
8428 {
8433 }
8434 }
8435 /* FALLTHRU */
8438 /* If a function is next, pass it on to be tried next. */
8442 ignored:
8445 }
8448 }
8450 /* Handle the TM_WRAP attribute; arguments as in
8451 struct attribute_spec.handler. */
8453 static tree
8456 {
8459 /* We don't need the attribute even on success, since we
8460 record the entry in an external table. */
8465 else
8466 {
8469 ;
8474 else
8475 {
8479 {
8483 else
8485 }
8486 else
8488 }
8489 }
8492 }
8494 /* Ignore the given attribute. Used when this attribute may be usefully
8495 overridden by the target, but is not used generically. */
8497 static tree
8501 {
8504 }
8506 /* Handle a "no vops" attribute; arguments as in
8507 struct attribute_spec.handler. */
8509 static tree
8513 {
8517 }
8519 /* Handle a "deprecated" attribute; arguments as in
8520 struct attribute_spec.handler. */
8522 static tree
8526 {
8534 {
8537 }
8540 {
8551 else
8553 }
8555 {
8560 }
8561 else
8565 {
8568 {
8574 }
8577 else
8579 }
8582 }
8584 /* Handle a "vector_size" attribute; arguments as in
8585 struct attribute_spec.handler. */
8587 static tree
8591 {
8604 {
8607 }
8609 /* Get the vector size (in bytes). */
8612 /* We need to provide for vector pointers, vector arrays, and
8613 functions returning vectors. For example:
8615 __attribute__((vector_size(16))) short *foo;
8617 In this case, the mode is SI, but the type being modified is
8618 HI, so we need to look further. */
8627 /* Get the mode of the type being modified. */
8638 {
8641 }
8644 {
8647 }
8650 {
8653 }
8655 /* Calculate how many units fit in the vector. */
8658 {
8661 }
8665 /* Build back pointers if needed. */
8669 }
8671 /* Handle the "nonnull" attribute. */
8672 static tree
8676 {
8680 /* If no arguments are specified, all pointer arguments should be
8681 non-null. Verify a full prototype is given so that the arguments
8682 will have the correct types when we actually check them later. */
8684 {
8686 {
8689 }
8691 }
8693 /* Argument list specified. Verify that each argument number references
8694 a pointer argument. */
8696 {
8705 {
8710 }
8713 {
8714 function_args_iterator iter;
8715 tree argument;
8719 {
8723 }
8727 {
8732 }
8735 {
8740 }
8741 }
8742 }
8745 }
8747 /* Check the argument list of a function call for null in argument slots
8748 that are marked as requiring a non-null pointer argument. The NARGS
8749 arguments are passed in the array ARGARRAY.
8750 */
8752 static void
8754 {
8755 tree a;
8763 /* See if any of the nonnull attributes has no arguments. If so,
8764 then every pointer argument is checked (in which case the check
8765 for pointer type is done in check_nonnull_arg). */
8767 do
8775 else
8776 {
8777 /* Walk the argument list. If we encounter an argument number we
8778 should check for non-null, do it. */
8780 {
8782 {
8786 }
8791 }
8792 }
8793 }
8795 /* Check that the Nth argument of a function call (counting backwards
8796 from the end) is a (pointer)0. The NARGS arguments are passed in the
8797 array ARGARRAY. */
8799 static void
8801 {
8805 {
8808 tree sentinel;
8809 function_args_iterator iter;
8810 tree t;
8812 /* Skip over the named arguments. */
8814 {
8817 len++;
8818 }
8821 {
8824 }
8826 /* The sentinel must be one of the varargs, i.e.
8827 in position >= the number of fixed arguments. */
8829 {
8833 }
8835 /* Validate the sentinel. */
8839 /* Although __null (in C++) is only an integer we allow it
8840 nevertheless, as we are guaranteed that it's exactly
8841 as wide as a pointer, and we don't want to force
8842 users to cast the NULL they have written there.
8843 We warn with -Wstrict-null-sentinel, though. */
8846 }
8847 }
8849 /* Helper for check_function_nonnull; given a list of operands which
8850 must be non-null in ARGS, determine if operand PARAM_NUM should be
8851 checked. */
8853 static bool
8855 {
8859 {
8866 }
8868 }
8870 /* Check that the function argument PARAM (which is operand number
8871 PARAM_NUM) is non-null. This is called by check_function_nonnull
8872 via check_function_arguments_recurse. */
8874 static void
8877 {
8878 /* Just skip checking the argument if it's not a pointer. This can
8879 happen if the "nonnull" attribute was given without an operand
8880 list (which means to check every pointer argument). */
8888 }
8890 /* Helper for nonnull attribute handling; fetch the operand number
8891 from the attribute argument list. */
8893 static bool
8895 {
8896 /* Verify the arg number is a small constant. */
8898 {
8901 }
8902 else
8904 }
8906 /* Handle a "nothrow" attribute; arguments as in
8907 struct attribute_spec.handler. */
8909 static tree
8912 {
8915 /* ??? TODO: Support types. */
8916 else
8917 {
8920 }
8923 }
8925 /* Handle a "cleanup" attribute; arguments as in
8926 struct attribute_spec.handler. */
8928 static tree
8931 {
8935 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8936 for global destructors in C++. This requires infrastructure that
8937 we don't have generically at the moment. It's also not a feature
8938 we'd be missing too much, since we do have attribute constructor. */
8940 {
8944 }
8946 /* Verify that the argument is a function in scope. */
8947 /* ??? We could support pointers to functions here as well, if
8948 that was considered desirable. */
8951 {
8955 }
8958 {
8962 }
8964 /* That the function has proper type is checked with the
8965 eventual call to build_function_call. */
8968 }
8970 /* Handle a "warn_unused_result" attribute. No special handling. */
8972 static tree
8976 {
8977 /* Ignore the attribute for functions not returning any value. */
8979 {
8982 }
8985 }
8987 /* Handle a "sentinel" attribute. */
8989 static tree
8992 {
8994 {
8998 }
8999 else
9000 {
9002 {
9006 }
9007 }
9010 {
9018 {
9022 }
9023 else
9024 {
9026 {
9030 }
9031 }
9032 }
9035 }
9037 /* Handle a "type_generic" attribute. */
9039 static tree
9043 {
9044 /* Ensure we have a function type. */
9047 /* Ensure we have a variadic function. */
9051 }
9053 /* Handle a "target" attribute. */
9055 static tree
9058 {
9059 /* Ensure we have a function type. */
9061 {
9064 }
9066 flags))
9070 }
9072 /* Arguments being collected for optimization. */
9077 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9078 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9079 false for #pragma GCC optimize. */
9081 bool
9083 {
9091 tree ap;
9093 /* Build up argv vector. Just in case the string is stored away, use garbage
9094 collected strings. */
9099 {
9103 {
9107 }
9110 {
9111 /* Split string into multiple substrings. */
9119 {
9126 {
9130 }
9131 else
9132 {
9135 }
9139 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9140 options. */
9142 {
9147 else
9151 }
9154 {
9157 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9158 itself is -Os, and any other switch begins with a -f. */
9164 }
9169 }
9171 }
9172 }
9182 /* Now parse the options. */
9192 /* Don't allow changing -fstrict-aliasing. */
9197 }
9199 /* For handling "optimize" attribute. arguments as in
9200 struct attribute_spec.handler. */
9202 static tree
9205 {
9206 /* Ensure we have a function type. */
9208 {
9211 }
9212 else
9213 {
9217 /* Save current options. */
9220 /* If we previously had some optimization options, use them as the
9221 default. */
9226 /* Parse options, and update the vector. */
9231 /* Restore current options. */
9233 }
9236 }
9238 /* Handle a "no_split_stack" attribute. */
9240 static tree
9245 {
9249 {
9253 }
9255 {
9259 }
9262 }
9264 /* Handle a "returns_nonnull" attribute; arguments as in
9265 struct attribute_spec.handler. */
9267 static tree
9270 {
9271 // Even without a prototype we still have a return type we can check.
9273 {
9276 }
9278 }
9280 \f
9281 /* Check for valid arguments being passed to a function with FNTYPE.
9282 There are NARGS arguments in the array ARGARRAY. */
9283 void
9285 {
9286 /* Check for null being passed in a pointer argument that must be
9287 non-null. We also need to do this if format checking is enabled. */
9292 /* Check for errors in format strings. */
9299 }
9301 /* Generic argument checking recursion routine. PARAM is the argument to
9302 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9303 once the argument is resolved. CTX is context for the callback. */
9304 void
9309 {
9313 {
9314 /* Strip coercion. */
9318 }
9321 {
9323 tree attrs;
9326 /* See if this is a call to a known internationalization function
9327 that modifies a format arg. Such a function may have multiple
9328 format_arg attributes (for example, ngettext). */
9331 attrs;
9334 {
9335 tree inner_arg;
9336 tree format_num_expr;
9339 call_expr_arg_iterator iter;
9341 /* Extract the argument number, which was previously checked
9342 to be valid. */
9351 {
9356 }
9357 }
9359 /* If we found a format_arg attribute and did a recursive check,
9360 we are done with checking this argument. Otherwise, we continue
9361 and this will be considered a non-literal. */
9364 }
9367 {
9368 /* Check both halves of the conditional expression. */
9374 }
9377 }
9379 /* Checks for a builtin function FNDECL that the number of arguments
9380 NARGS against the required number REQUIRED and issues an error if
9381 there is a mismatch. Returns true if the number of arguments is
9382 correct, otherwise false. */
9384 static bool
9386 {
9388 {
9392 }
9394 {
9398 }
9400 }
9402 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9403 Returns false if there was an error, otherwise true. */
9405 bool
9407 {
9413 {
9423 {
9425 {
9429 }
9431 }
9441 {
9448 {
9452 }
9454 }
9459 {
9464 {
9468 }
9471 {
9473 fndecl);
9475 }
9477 }
9482 {
9484 {
9487 }
9489 }
9494 }
9495 }
9497 /* Function to help qsort sort FIELD_DECLs by name order. */
9499 int
9501 {
9506 /* A nontype is "greater" than a type. */
9515 }
9518 gt_pointer_operator new_value;
9522 /* This routine compares two fields like field_decl_cmp but using the
9523 pointer operator in resort_data. */
9525 static int
9527 {
9532 /* A nontype is "greater" than a type. */
9538 {
9545 }
9547 }
9549 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9551 void
9554 gt_pointer_operator new_value,
9556 {
9561 resort_field_decl_cmp);
9562 }
9564 /* Subroutine of c_parse_error.
9565 Return the result of concatenating LHS and RHS. RHS is really
9566 a string literal, its first character is indicated by RHS_START and
9567 RHS_SIZE is its length (including the terminating NUL character).
9569 The caller is responsible for deleting the returned pointer. */
9573 {
9579 }
9581 /* Issue the error given by GMSGID, indicating that it occurred before
9582 TOKEN, which had the associated VALUE. */
9584 void
9587 {
9588 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9598 {
9603 {
9616 }
9620 else
9626 }
9648 {
9653 }
9661 {
9666 }
9667 else
9671 {
9674 }
9675 #undef catenate_messages
9676 }
9678 /* Mapping for cpp message reasons to the options that enable them. */
9680 struct reason_option_codes_t
9681 {
9684 };
9705 };
9707 /* Return the gcc option code associated with the reason for a cpp
9708 message, or 0 if none. */
9710 static int
9712 {
9716 {
9719 }
9721 }
9723 /* Callback from cpp_error for PFILE to print diagnostics from the
9724 preprocessor. The diagnostic is of type LEVEL, with REASON set
9725 to the reason code if LEVEL is represents a warning, at location
9726 LOCATION unless this is after lexing and the compiler's location
9727 should be used instead, with column number possibly overridden by
9728 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9729 the arguments. Returns true if a diagnostic was emitted, false
9730 otherwise. */
9732 bool
9736 {
9737 diagnostic_info diagnostic;
9738 diagnostic_t dlevel;
9743 {
9748 /* Fall through. */
9773 }
9786 }
9788 /* Convert a character from the host to the target execution character
9789 set. cpplib handles this, mostly. */
9791 HOST_WIDE_INT
9793 {
9794 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9795 zero-extended under -fno-signed-char. cpplib insists that characters
9796 and character constants are always unsigned. Hence we must convert
9797 back and forth. */
9805 else
9807 }
9809 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9810 references with an INDIRECT_REF of a constant at the bottom; much like the
9811 traditional rendering of offsetof as a macro. Return the folded result. */
9813 tree
9815 {
9819 {
9835 {
9838 }
9848 {
9852 }
9865 /* Check if the offset goes beyond the upper bound of the array. */
9867 {
9873 {
9877 {
9878 tree v;
9885 {
9893 }
9894 /* Don't warn if the array might be considered a poor
9895 man's flexible array member with a very permissive
9896 definition thereof. */
9900 "index %E denotes an offset "
9903 }
9904 }
9905 }
9912 /* Handle static members of volatile structs. */
9919 }
9922 }
9924 /* Likewise, but convert it to the return type of offsetof. */
9926 tree
9928 {
9930 }
9932 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9933 expression, because B will always be true. */
9935 void
9937 {
9940 "the omitted middle operand in ?: will always be %<true%>, "
9942 }
9944 /* Give an error for storing into ARG, which is 'const'. USE indicates
9945 how ARG was being used. */
9947 void
9949 {
9952 /* Using this macro rather than (for example) arrays of messages
9953 ensures that all the format strings are checked at compile
9954 time. */
9955 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9956 : (use == lv_increment ? (I) \
9957 : (use == lv_decrement ? (D) : (AS))))
9959 {
9970 else
9976 }
9982 arg);
9988 arg);
9990 {
10000 arg);
10001 }
10007 arg);
10008 else
10013 arg);
10014 }
10016 /* Print an error message for an invalid lvalue. USE says
10017 how the lvalue is being used and so selects the error message. LOC
10018 is the location for the error. */
10020 void
10022 {
10024 {
10042 }
10043 }
10045 /* Print an error message for an invalid indirection of type TYPE.
10046 ERRSTRING is the name of the operator for the indirection. */
10048 void
10050 {
10052 {
10060 type);
10065 type);
10070 type);
10075 type);
10080 type);
10084 }
10085 }
10086 \f
10087 /* *PTYPE is an incomplete array. Complete it with a domain based on
10088 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10089 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10090 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10092 int
10094 {
10102 {
10104 {
10105 int eltsize
10108 }
10110 {
10114 {
10118 }
10119 else
10120 {
10121 tree curindex;
10132 {
10136 else
10137 {
10139 {
10140 /* Since we treat size types now as ordinary
10141 unsigned types, we need an explicit overflow
10142 check. */
10146 }
10148 size_one_node);
10149 }
10152 }
10154 {
10158 }
10159 }
10160 }
10161 else
10162 {
10163 /* Make an error message unless that happened already. */
10166 }
10167 }
10168 else
10169 {
10173 }
10180 else
10183 /* Using build_distinct_type_copy and modifying things afterward instead
10184 of using build_array_type to create a new type preserves all of the
10185 TYPE_LANG_FLAG_? bits that the front end may have set. */
10193 /* Make sure we have the canonical MAIN_TYPE. */
10196 hashcode);
10199 /* Fix the canonical type. */
10209 else
10214 else
10220 {
10222 /* If we proceed with the array type as it is, we'll eventually
10223 crash in tree_to_[su]hwi(). */
10225 }
10229 }
10231 /* Like c_mark_addressable but don't check register qualifier. */
10232 void
10234 {
10240 }
10243 \f
10244 /* Used to help initialize the builtin-types.def table. When a type of
10245 the correct size doesn't exist, use error_mark_node instead of NULL.
10246 The later results in segfaults even when a decl using the type doesn't
10247 get invoked. */
10249 tree
10251 {
10254 }
10256 /* A helper function for resolve_overloaded_builtin in resolving the
10257 overloaded __sync_ builtins. Returns a positive power of 2 if the
10258 first operand of PARAMS is a pointer to a supported data type.
10259 Returns 0 if an error is encountered. */
10261 static int
10263 {
10264 tree type;
10268 {
10271 }
10275 {
10276 /* Force array-to-pointer decay for C++. */
10280 }
10292 incompatible:
10295 }
10297 /* A helper function for resolve_overloaded_builtin. Adds casts to
10298 PARAMS to make arguments match up with those of FUNCTION. Drops
10299 the variadic arguments at the end. Returns false if some error
10300 was encountered; true on success. */
10302 static bool
10305 {
10306 function_args_iterator iter;
10307 tree ptype;
10311 /* We've declared the implementation functions to use "volatile void *"
10312 as the pointer parameter, so we shouldn't get any complaints from the
10313 call to check_function_arguments what ever type the user used. */
10318 /* For the rest of the values, we need to cast these to FTYPE, so that we
10319 don't get warnings for passing pointer types, etc. */
10322 {
10326 /* XXX void_type_node belies the abstraction. */
10332 {
10335 }
10337 /* Only convert parameters if arg_type is unsigned integer type with
10338 new format sync routines, i.e. don't attempt to convert pointer
10339 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10340 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10341 kinds). */
10343 {
10344 /* Ideally for the first conversion we'd use convert_for_assignment
10345 so that we get warnings for anything that doesn't match the pointer
10346 type. This isn't portable across the C and C++ front ends atm. */
10351 }
10354 }
10356 /* __atomic routines are not variadic. */
10358 {
10361 }
10363 /* The definition of these primitives is variadic, with the remaining
10364 being "an optional list of variables protected by the memory barrier".
10365 No clue what that's supposed to mean, precisely, but we consider all
10366 call-clobbered variables to be protected so we're safe. */
10370 }
10372 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10373 RESULT to make it match the type of the first pointer argument in
10374 PARAMS. */
10376 static tree
10378 {
10383 /* New format doesn't require casting unless the types are the same size. */
10386 else
10388 }
10390 /* This function verifies the PARAMS to generic atomic FUNCTION.
10391 It returns the size if all the parameters are the same size, otherwise
10392 0 is returned if the parameters are invalid. */
10394 static int
10397 {
10402 tree type_0;
10404 /* Determine the parameter makeup. */
10406 {
10422 }
10425 {
10428 }
10430 /* Get type of first parameter, and determine its size. */
10433 {
10434 /* Force array-to-pointer decay for C++. */
10438 }
10440 {
10442 function);
10444 }
10446 /* Types must be compile time constant sizes. */
10448 {
10451 function);
10453 }
10457 /* Zero size objects are not allowed. */
10459 {
10462 function);
10464 }
10466 /* Check each other parameter is a pointer and the same size. */
10468 {
10471 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10475 {
10477 function);
10479 }
10483 {
10485 function);
10487 }
10488 }
10490 /* Check memory model parameters for validity. */
10492 {
10495 {
10498 {
10501 function);
10502 }
10503 }
10504 else
10506 {
10508 function);
10510 }
10511 }
10514 }
10517 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10518 at the beginning of the parameter list PARAMS representing the size of the
10519 objects. This is to match the library ABI requirement. LOC is the location
10520 of the function call.
10521 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10522 returned to allow the external call to be constructed. */
10524 static tree
10527 {
10528 tree size_node;
10530 /* Insert a SIZE_T parameter as the first param. If there isn't
10531 enough space, allocate a new vector and recursively re-build with that. */
10533 {
10536 tree f;
10546 }
10548 /* Add the size parameter and leave as a function call for processing. */
10552 }
10555 /* Return whether atomic operations for naturally aligned N-byte
10556 arguments are supported, whether inline or through libatomic. */
10557 static bool
10559 {
10561 {
10573 }
10574 }
10576 /* This will process an __atomic_exchange function call, determine whether it
10577 needs to be mapped to the _N variation, or turned into a library call.
10578 LOC is the location of the builtin call.
10579 FUNCTION is the DECL that has been invoked;
10580 PARAMS is the argument list for the call. The return value is non-null
10581 TRUE is returned if it is translated into the proper format for a call to the
10582 external library, and NEW_RETURN is set the tree for that function.
10583 FALSE is returned if processing for the _N variation is required, and
10584 NEW_RETURN is set to the the return value the result is copied into. */
10585 static bool
10588 {
10593 /* Size of 0 is an error condition. */
10595 {
10598 }
10600 /* If not a lock-free size, change to the library generic format. */
10602 {
10605 }
10607 /* Otherwise there is a lockfree match, transform the call from:
10608 void fn(T* mem, T* desired, T* return, model)
10609 into
10610 *return = (T) (fn (In* mem, (In) *desired, model)) */
10617 /* Create pointer to appropriate size. */
10621 /* Convert object pointer to required type. */
10624 /* Convert new value to required type, and dereference it. */
10629 /* Move memory model to the 3rd position, and end param list. */
10633 /* Convert return pointer and dereference it for later assignment. */
10637 }
10640 /* This will process an __atomic_compare_exchange function call, determine
10641 whether it needs to be mapped to the _N variation, or turned into a lib call.
10642 LOC is the location of the builtin call.
10643 FUNCTION is the DECL that has been invoked;
10644 PARAMS is the argument list for the call. The return value is non-null
10645 TRUE is returned if it is translated into the proper format for a call to the
10646 external library, and NEW_RETURN is set the tree for that function.
10647 FALSE is returned if processing for the _N variation is required. */
10649 static bool
10653 {
10658 /* Size of 0 is an error condition. */
10660 {
10663 }
10665 /* If not a lock-free size, change to the library generic format. */
10667 {
10668 /* The library generic format does not have the weak parameter, so
10669 remove it from the param list. Since a parameter has been removed,
10670 we can be sure that there is room for the SIZE_T parameter, meaning
10671 there will not be a recursive rebuilding of the parameter list, so
10672 there is no danger this will be done twice. */
10674 {
10678 }
10681 }
10683 /* Otherwise, there is a match, so the call needs to be transformed from:
10684 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10685 into
10686 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10692 /* Create pointer to appropriate size. */
10696 /* Convert object pointer to required type. */
10700 /* Convert expected pointer to required type. */
10704 /* Convert desired value to required type, and dereference it. */
10709 /* The rest of the parameters are fine. NULL means no special return value
10710 processing.*/
10713 }
10716 /* This will process an __atomic_load function call, determine whether it
10717 needs to be mapped to the _N variation, or turned into a library call.
10718 LOC is the location of the builtin call.
10719 FUNCTION is the DECL that has been invoked;
10720 PARAMS is the argument list for the call. The return value is non-null
10721 TRUE is returned if it is translated into the proper format for a call to the
10722 external library, and NEW_RETURN is set the tree for that function.
10723 FALSE is returned if processing for the _N variation is required, and
10724 NEW_RETURN is set to the the return value the result is copied into. */
10726 static bool
10729 {
10734 /* Size of 0 is an error condition. */
10736 {
10739 }
10741 /* If not a lock-free size, change to the library generic format. */
10743 {
10746 }
10748 /* Otherwise, there is a match, so the call needs to be transformed from:
10749 void fn(T* mem, T* return, model)
10750 into
10751 *return = (T) (fn ((In *) mem, model)) */
10757 /* Create pointer to appropriate size. */
10761 /* Convert object pointer to required type. */
10765 /* Move memory model to the 2nd position, and end param list. */
10769 /* Convert return pointer and dereference it for later assignment. */
10773 }
10776 /* This will process an __atomic_store function call, determine whether it
10777 needs to be mapped to the _N variation, or turned into a library call.
10778 LOC is the location of the builtin call.
10779 FUNCTION is the DECL that has been invoked;
10780 PARAMS is the argument list for the call. The return value is non-null
10781 TRUE is returned if it is translated into the proper format for a call to the
10782 external library, and NEW_RETURN is set the tree for that function.
10783 FALSE is returned if processing for the _N variation is required, and
10784 NEW_RETURN is set to the the return value the result is copied into. */
10786 static bool
10789 {
10794 /* Size of 0 is an error condition. */
10796 {
10799 }
10801 /* If not a lock-free size, change to the library generic format. */
10803 {
10806 }
10808 /* Otherwise, there is a match, so the call needs to be transformed from:
10809 void fn(T* mem, T* value, model)
10810 into
10811 fn ((In *) mem, (In) *value, model) */
10816 /* Create pointer to appropriate size. */
10820 /* Convert object pointer to required type. */
10824 /* Convert new value to required type, and dereference it. */
10829 /* The memory model is in the right spot already. Return is void. */
10833 }
10836 /* Some builtin functions are placeholders for other expressions. This
10837 function should be called immediately after parsing the call expression
10838 before surrounding code has committed to the type of the expression.
10840 LOC is the location of the builtin call.
10842 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10843 PARAMS is the argument list for the call. The return value is non-null
10844 when expansion is complete, and null if normal processing should
10845 continue. */
10847 tree
10850 {
10856 {
10862 else
10866 }
10868 /* Handle BUILT_IN_NORMAL here. */
10870 {
10875 {
10876 /* Handle these 4 together so that they can fall through to the next
10877 case if the call is transformed to an _N variant. */
10879 {
10881 {
10885 /* Change to the _N variant. */
10888 }
10891 {
10893 params,
10896 /* Change to the _N variant. */
10899 }
10901 {
10905 /* Change to the _N variant. */
10908 }
10910 {
10914 /* Change to the _N variant. */
10917 }
10920 }
10921 /* Fallthrough to the normal processing. */
10922 }
10939 {
10941 /* Fallthru for parameter processing. */
10942 }
10959 {
10970 orig_format))
10975 NULL);
10983 /* If new_return is set, assign function to that expr and cast the
10984 result to void since the generic interface returned void. */
10986 {
10987 /* Cast function result from I{1,2,4,8,16} to the required type. */
10990 result);
10994 }
10996 }
11000 }
11001 }
11003 /* vector_types_compatible_elements_p is used in type checks of vectors
11004 values used as operands of binary operators. Where it returns true, and
11005 the other checks of the caller succeed (being vector types in he first
11006 place, and matching number of elements), we can just treat the types
11007 as essentially the same.
11008 Contrast with vector_targets_convertible_p, which is used for vector
11009 pointer types, and vector_types_convertible_p, which will allow
11010 language-specific matches under the control of flag_lax_vector_conversions,
11011 and might still require a conversion. */
11012 /* True if vector types T1 and T2 can be inputs to the same binary
11013 operator without conversion.
11014 We don't check the overall vector size here because some of our callers
11015 want to give different error messages when the vectors are compatible
11016 except for the element count. */
11018 bool
11020 {
11033 /* Equality works here because c_common_signed_type uses
11034 TYPE_MAIN_VARIANT. */
11042 }
11044 /* Check for missing format attributes on function pointers. LTYPE is
11045 the new type or left-hand side type. RTYPE is the old type or
11046 right-hand side type. Returns TRUE if LTYPE is missing the desired
11047 attribute. */
11049 bool
11051 {
11053 tree ra;
11059 {
11060 tree la;
11065 }
11066 else
11068 }
11070 /* Subscripting with type char is likely to lose on a machine where
11071 chars are signed. So warn on any machine, but optionally. Don't
11072 warn for unsigned char since that type is safe. Don't warn for
11073 signed char because anyone who uses that must have done so
11074 deliberately. Furthermore, we reduce the false positive load by
11075 warning only for non-constant value of type char. */
11077 void
11079 {
11083 }
11085 /* Implement -Wparentheses for the unexpected C precedence rules, to
11086 cover cases like x + y << z which readers are likely to
11087 misinterpret. We have seen an expression in which CODE is a binary
11088 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11089 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11090 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11091 expression was not formed using a binary or unary operator, or it
11092 was enclosed in parentheses. */
11094 void
11098 {
11102 /* This macro tests that the expression ARG with original tree code
11103 CODE appears to be a boolean expression. or the result of folding a
11104 boolean expression. */
11105 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11106 (truth_value_p (TREE_CODE (ARG)) \
11107 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11109 || ((CODE) != INTEGER_CST \
11110 && (integer_onep (ARG) || integer_zerop (ARG))))
11113 {
11162 /* Check cases like x|y==z */
11169 /* Check cases like !x | y */
11173 "suggest parentheses around operand of "
11186 /* Check cases like x^y==z */
11208 /* Check cases like x&y==z */
11215 /* Check cases like !x & y */
11219 "suggest parentheses around operand of "
11242 {
11247 "comparisons like %<X<=Y<=Z%> do not "
11253 "comparisons like %<X<=Y<=Z%> do not "
11255 }
11257 }
11258 #undef NOT_A_BOOLEAN_EXPR_P
11259 }
11261 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11263 void
11265 {
11267 {
11270 else
11272 }
11273 }
11275 /* Warn for division by zero according to the value of DIVISOR. LOC
11276 is the location of the division operator. */
11278 void
11280 {
11281 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11282 about division by zero. Do not issue a warning if DIVISOR has a
11283 floating-point type, since we consider 0.0/0.0 a valid way of
11284 generating a NaN. */
11288 }
11290 /* Subroutine of build_binary_op. Give warnings for comparisons
11291 between signed and unsigned quantities that may fail. Do the
11292 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11293 so that casts will be considered, but default promotions won't
11294 be.
11296 LOCATION is the location of the comparison operator.
11298 The arguments of this function map directly to local variables
11299 of build_binary_op. */
11301 void
11306 {
11311 /* In C++, check for comparison of different enum types. */
11317 {
11321 }
11323 /* Do not warn if the comparison is being done in a signed type,
11324 since the signed type will only be chosen if it can represent
11325 all the values of the unsigned type. */
11328 /* Do not warn if both operands are unsigned. */
11331 else
11332 {
11338 else
11346 /* Do not warn if the signed quantity is an unsuffixed integer
11347 literal (or some static constant expression involving such
11348 literals or a conditional expression involving such literals)
11349 and it is non-negative. */
11352 /* Do not warn if the comparison is an equality operation, the
11353 unsigned quantity is an integral constant, and it would fit
11354 in the result if the result were signed. */
11359 /* In C, do not warn if the unsigned quantity is an enumeration
11360 constant and its maximum value would fit in the result if the
11361 result were signed. */
11367 else
11369 OPT_Wsign_compare,
11371 }
11373 /* Warn if two unsigned values are being compared in a size larger
11374 than their original size, and one (and only one) is the result of
11375 a `~' operator. This comparison will always fail.
11377 Also warn if one operand is a constant, and the constant does not
11378 have all bits set that are set in the ~ operand when it is
11379 extended. */
11386 {
11393 {
11394 tree primop;
11400 {
11404 }
11405 else
11406 {
11410 }
11415 {
11418 {
11422 else
11425 }
11426 }
11427 }
11435 }
11436 }
11438 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11439 type via c_common_type. If -Wdouble-promotion is in use, and the
11440 conditions for warning have been met, issue a warning. GMSGID is
11441 the warning message. It must have two %T specifiers for the type
11442 that was converted (generally "float") and the type to which it was
11443 converted (generally "double), respectively. LOC is the location
11444 to which the awrning should refer. */
11446 void
11449 {
11450 tree source_type;
11454 /* If the conversion will not occur at run-time, there is no need to
11455 warn about it. */
11467 else
11470 }
11472 /* Setup a TYPE_DECL node as a typedef representation.
11474 X is a TYPE_DECL for a typedef statement. Create a brand new
11475 ..._TYPE node (which will be just a variant of the existing
11476 ..._TYPE node with identical properties) and then install X
11477 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11479 The whole point here is to end up with a situation where each
11480 and every ..._TYPE node the compiler creates will be uniquely
11481 associated with AT MOST one node representing a typedef name.
11482 This way, even though the compiler substitutes corresponding
11483 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11484 early on, later parts of the compiler can always do the reverse
11485 translation and get back the corresponding typedef name. For
11486 example, given:
11488 typedef struct S MY_TYPE;
11489 MY_TYPE object;
11491 Later parts of the compiler might only know that `object' was of
11492 type `struct S' if it were not for code just below. With this
11493 code however, later parts of the compiler see something like:
11495 struct S' == struct S
11496 typedef struct S' MY_TYPE;
11497 struct S' object;
11499 And they can then deduce (from the node for type struct S') that
11500 the original object declaration was:
11502 MY_TYPE object;
11504 Being able to do this is important for proper support of protoize,
11505 and also for generating precise symbolic debugging information
11506 which takes full account of the programmer's (typedef) vocabulary.
11508 Obviously, we don't want to generate a duplicate ..._TYPE node if
11509 the TYPE_DECL node that we are now processing really represents a
11510 standard built-in type. */
11512 void
11514 {
11518 {
11521 }
11524 {
11532 }
11533 }
11535 /* Record the types used by the current global variable declaration
11536 being parsed, so that we can decide later to emit their debug info.
11537 Those types are in types_used_by_cur_var_decl, and we are going to
11538 store them in the types_used_by_vars_hash hash table.
11539 DECL is the declaration of the global variable that has been parsed. */
11541 void
11543 {
11547 {
11550 }
11551 }
11553 /* If DECL is a typedef that is declared in the current function,
11554 record it for the purpose of -Wunused-local-typedefs. */
11556 void
11558 {
11563 /* if this is not a locally defined typedef then we are not
11564 interested. */
11571 }
11573 /* If T is a TYPE_DECL declared locally, mark it as used. */
11575 void
11577 {
11582 }
11584 /* Warn if there are some unused locally defined typedefs in the
11585 current function. */
11587 void
11589 {
11591 tree decl;
11592 /* The number of times we have emitted -Wunused-local-typedefs
11593 warnings. If this is different from errorcount, that means some
11594 unrelated errors have been issued. In which case, we'll avoid
11595 emitting "unused-local-typedefs" warnings. */
11607 {
11611 OPT_Wunused_local_typedefs,
11614 }
11617 }
11619 /* The C and C++ parsers both use vectors to hold function arguments.
11620 For efficiency, we keep a cache of unused vectors. This is the
11621 cache. */
11626 /* Return a new vector from the cache. If the cache is empty,
11627 allocate a new vector. These vectors are GC'ed, so it is OK if the
11628 pointer is not released.. */
11632 {
11635 else
11636 {
11637 /* Passing 0 to vec::alloc returns NULL, and our callers require
11638 that we always return a non-NULL value. The vector code uses
11639 4 when growing a NULL vector, so we do too. */
11643 }
11644 }
11646 /* Release a vector of trees back to the cache. */
11648 void
11650 {
11652 {
11655 }
11656 }
11658 /* Get a new tree vector holding a single tree. */
11662 {
11666 }
11668 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11672 {
11677 }
11679 /* Get a new tree vector which is a copy of an existing one. */
11683 {
11686 tree t;
11693 }
11695 /* Return true if KEYWORD starts a type specifier. */
11697 bool
11699 {
11701 {
11732 }
11733 }
11735 /* Return true if KEYWORD names a type qualifier. */
11737 bool
11739 {
11741 {
11749 }
11750 }
11752 /* Return true if KEYWORD names a storage class specifier.
11754 RID_TYPEDEF is not included in this list despite `typedef' being
11755 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11756 such for syntactic convenience only. */
11758 bool
11760 {
11762 {
11772 }
11773 }
11775 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11777 static bool
11779 {
11781 {
11789 }
11790 }
11792 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11793 declaration-specifier (C99 6.7). */
11795 bool
11797 {
11804 {
11811 }
11812 }
11814 /* Initialize language-specific-bits of tree_contains_struct. */
11816 void
11818 {
11822 }
11824 /* Build a user-defined numeric literal out of an integer constant type VALUE
11825 with identifier SUFFIX. */
11827 tree
11830 {
11837 }
11839 /* For vector[index], convert the vector to a
11840 pointer of the underlying type. */
11841 void
11844 {
11846 {
11848 tree type1;
11861 {
11862 /* If the original vector isn't declared may_alias and it
11863 isn't a bare vector look if the subscripting would
11864 alias the vector we subscript, and if not, force ref-all. */
11870 }
11874 }
11875 }
11877 /* Determine which of the operands, if any, is a scalar that needs to be
11878 converted to a vector, for the range of operations. */
11879 enum stv_conv
11882 {
11891 {
11892 /* Most GENERIC binary expressions require homogeneous arguments.
11893 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11894 argument that is a vector and a second one that is a scalar, so
11895 we never return stv_secondarg for them. */
11900 {
11902 {
11907 }
11908 else
11910 }
11917 /* ... fall through ... */
11938 /* What about UNLT_EXPR? */
11940 {
11941 tree tmp;
11943 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11946 }
11950 {
11952 {
11957 }
11959 }
11961 /* Allow integer --> real conversion if safe. */
11965 {
11967 {
11972 }
11974 }
11977 }
11980 }
11982 /* Return true iff ALIGN is an integral constant that is a fundamental
11983 alignment, as defined by [basic.align] in the c++-11
11984 specifications.
11986 That is:
11988 [A fundamental alignment is represented by an alignment less than or
11989 equal to the greatest alignment supported by the implementation
11990 in all contexts, which is equal to
11991 alignof(max_align_t)]. */
11993 bool
11995 {
11998 }
12000 /* Return true if T is a pointer to a zero-sized aggregate. */
12002 bool
12004 {
12009 }