| blob | 077263e1de5881d82f9a0d25ff581954952fd62e |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
56 /* The following symbols are subsumed in the c_global_trees array, and
57 listed here individually for documentation purposes.
59 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
61 tree short_integer_type_node;
62 tree long_integer_type_node;
63 tree long_long_integer_type_node;
64 tree int128_integer_type_node;
66 tree short_unsigned_type_node;
67 tree long_unsigned_type_node;
68 tree long_long_unsigned_type_node;
69 tree int128_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
79 tree wchar_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
84 tree float_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
97 tree intQI_type_node;
98 tree intHI_type_node;
99 tree intSI_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
146 tree void_list_node;
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
160 */
163 \f
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
179 /* Nonzero means pass #include lines through to the output. */
183 /* Nonzero means process PCH files while preprocessing. */
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 user's namespace. */
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
230 /* Tells the compiler what is the constant string class for ObjC. */
235 /* C++ language option variables. */
238 /* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
243 /* The C++ dialect being used. C++98 is the default. */
247 /* Maximum template instantiation depth. This limit exists to limit the
248 time it takes to notice excessively recursive template instantiations.
250 The default is lower than the 1024 recommended by the C++0x standard
251 because G++ runs out of stack before 1024 with highly recursive template
252 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
256 /* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
262 /* Nonzero means don't warn about problems that occur when the code is
263 executed. */
266 /* Whether we are building a boolean conversion inside
267 convert_for_assignment, or some other late binary operation. If
268 build_binary_op is called for C (from code shared by C and C++) in
269 this case, then the operands have already been folded and the
270 result will not be folded again, so C_MAYBE_CONST_EXPR should not
271 be generated. */
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
278 /* Information about how a function name is generated. */
279 struct fname_var_t
280 {
284 };
286 /* The three ways of getting then name of the current function. */
289 {
290 /* C99 compliant __func__, must be first. */
292 /* GCC __FUNCTION__ compliant. */
294 /* GCC __PRETTY_FUNCTION__ compliant. */
297 };
299 /* Global visibility options. */
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 {
573 /* These Objective-C keywords are recognized only immediately after
574 an '@'. */
591 /* These are recognized only in protocol-qualifier context
592 (see above) */
599 /* These are recognized inside a property attribute list */
608 };
613 /* Table of machine-independent attributes common to all C-like languages. */
615 {
616 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
617 affects_type_identity } */
624 /* FIXME: logically, noreturn attributes should be listed as
625 "false, true, true" and apply to function types. But implementing this
626 would require all the places in the compiler that use TREE_THIS_VOLATILE
627 on a decl to identify non-returning functions to be located and fixed
628 to check the function type instead. */
653 /* The same comments as for noreturn attributes apply to const ones. */
677 handle_no_instrument_function_attribute,
695 /* ??? These two attributes didn't make the transition from the
696 Intel language document to the multi-vendor language document. */
701 /* For internal use (marking of builtins) only. The name contains space
702 to prevent its usage in source code. */
724 /* For internal use (marking of builtins) only. The name contains space
725 to prevent its usage in source code. */
736 handle_no_address_safety_analysis_attribute,
739 handle_no_sanitize_address_attribute,
742 handle_no_sanitize_undefined_attribute,
752 /* For internal use only. The leading '*' both prevents its usage in
753 source code and signals that it may be overridden by machine tables. */
758 /* For internal use (marking of builtins and runtime functions) only.
759 The name contains space to prevent its usage in source code. */
777 };
779 /* Give the specifications for the format attributes, used by C and all
780 descendants. */
783 {
784 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
785 affects_type_identity } */
791 };
793 /* Return identifier for address space AS. */
797 {
801 }
803 /* Push current bindings for the function name VAR_DECLS. */
805 void
807 {
812 {
816 {
818 saved);
820 }
821 }
823 /* Normally they'll have been NULL, so only push if we've got a
824 stack, or they are non-NULL. */
826 saved_function_name_decls);
827 }
829 /* Finish up the current bindings, adding them into the current function's
830 statement tree. This must be done _before_ finish_stmt_tree is called.
831 If there is no current function, we must be at file scope and no statements
832 are involved. Pop the previous bindings. */
834 void
836 {
845 {
853 }
859 {
860 /* We had saved values, restore them. */
861 tree saved;
864 {
869 }
871 }
873 }
875 /* Return the text name of the current function, suitably prettified
876 by PRETTY_P. Return string must be freed by caller. */
880 {
887 {
890 }
903 {
906 }
909 }
911 /* Return the VAR_DECL for a const char array naming the current
912 function. If the VAR_DECL has not yet been created, create it
913 now. RID indicates how it should be formatted and IDENTIFIER_NODE
914 ID is its name (unfortunately C and C++ hold the RID values of
915 keywords in different places, so we can't derive RID from ID in
916 this language independent code. LOC is the location of the
917 function. */
919 tree
921 {
931 {
932 /* If a tree is built here, it would normally have the lineno of
933 the current statement. Later this tree will be moved to the
934 beginning of the function and this line number will be wrong.
935 To avoid this problem set the lineno to 0 here; that prevents
936 it from appearing in the RTL. */
937 tree stmts;
945 saved_function_name_decls
949 }
954 }
956 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
958 tree
960 {
965 /* Compute the number of elements, for the array type. */
967 {
970 }
972 {
975 }
977 {
980 }
981 else
982 {
985 }
987 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
988 limit in C++98 Annex B is very large (65536) and is not normative,
989 so we do not diagnose it (warn_overlength_strings is forced off
990 in c_common_post_options). */
992 {
996 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
997 separate the %d from the 'C'. 'ISO' should not be
998 translated, but it may be moved after 'C%d' in languages
999 where modifiers follow nouns. */
1001 "string length %qd is greater than the length %qd "
1004 }
1006 /* Create the array type for the string constant. The ISO C++
1007 standard says that a string literal has type `const char[N]' or
1008 `const wchar_t[N]'. We use the same logic when invoked as a C
1009 front-end with -Wwrite-strings.
1010 ??? We should change the type of an expression depending on the
1011 state of a warning flag. We should just be warning -- see how
1012 this is handled in the C++ front-end for the deprecated implicit
1013 conversion from string literals to `char*' or `wchar_t*'.
1015 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1016 array type being the unqualified version of that type.
1017 Therefore, if we are constructing an array of const char, we must
1018 construct the matching unqualified array type first. The C front
1019 end does not require this, but it does no harm, so we do it
1020 unconditionally. */
1031 }
1032 \f
1033 /* If DISABLE is true, stop issuing warnings. This is used when
1034 parsing code that we know will not be executed. This function may
1035 be called multiple times, and works as a stack. */
1037 static void
1039 {
1041 {
1044 }
1045 }
1047 /* If ENABLE is true, reenable issuing warnings. */
1049 static void
1051 {
1053 {
1056 }
1057 }
1059 /* Fully fold EXPR, an expression that was not folded (beyond integer
1060 constant expressions and null pointer constants) when being built
1061 up. If IN_INIT, this is in a static initializer and certain
1062 changes are made to the folding done. Clear *MAYBE_CONST if
1063 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1064 expression because it contains an evaluated operator (in C99) or an
1065 operator outside of sizeof returning an integer constant (in C90)
1066 not permitted in constant expressions, or because it contains an
1067 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1068 set to true by callers before calling this function.) Return the
1069 folded expression. Function arguments have already been folded
1070 before calling this function, as have the contents of SAVE_EXPR,
1071 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1072 C_MAYBE_CONST_EXPR. */
1074 tree
1076 {
1077 tree ret;
1083 /* This function is not relevant to C++ because C++ folds while
1084 parsing, and may need changes to be correct for C++ when C++
1085 stops folding while parsing. */
1092 {
1095 }
1102 }
1104 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1105 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1106 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1107 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1108 both evaluated and unevaluated subexpressions while
1109 *MAYBE_CONST_ITSELF is carried from only evaluated
1110 subexpressions). */
1112 static tree
1115 {
1127 /* This function is not relevant to C++ because C++ folds while
1128 parsing, and may need changes to be correct for C++ when C++
1129 stops folding while parsing. */
1133 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1134 anything else not counted as an expression cannot usefully be
1135 folded further at this point. */
1141 /* Operands of variable-length expressions (function calls) have
1142 already been folded, as have __builtin_* function calls, and such
1143 expressions cannot occur in constant expressions. */
1145 {
1149 }
1152 {
1161 else
1164 }
1166 /* Assignment, increment, decrement, function call and comma
1167 operators, and statement expressions, cannot occur in constant
1168 expressions if evaluated / outside of sizeof. (Function calls
1169 were handled above, though VA_ARG_EXPR is treated like a function
1170 call here, and statement expressions are handled through
1171 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1173 {
1193 }
1195 /* Fold individual tree codes as appropriate. */
1197 {
1199 /* Any non-constancy will have been marked in a containing
1200 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1208 maybe_const_itself);
1213 {
1216 }
1225 maybe_const_itself);
1228 maybe_const_itself);
1234 {
1238 }
1280 /* Binary operations evaluating both arguments (increment and
1281 decrement are binary internally in GCC). */
1285 maybe_const_itself);
1293 /* The RHS of a MODIFY_EXPR was fully folded when building that
1294 expression for the sake of conversion warnings. */
1297 maybe_const_itself);
1301 ret = in_init
1304 else
1317 {
1328 }
1334 CASE_CONVERT:
1345 /* Unary operations. */
1348 maybe_const_itself);
1352 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1353 not prepared to deal with them if they occur in initializers. */
1361 ret = in_init
1364 else
1369 {
1373 }
1375 {
1378 CASE_CONVERT:
1379 /* Don't warn about explicit conversions. We will already
1380 have warned about suspect implicit conversions. */
1387 }
1392 /* Binary operations not necessarily evaluating both
1393 arguments. */
1400 ? truthvalue_false_node
1408 ret = in_init
1411 else
1416 && op0_const
1417 && op0_const_self
1423 && op0_const_self
1449 else
1454 && op0_const
1455 && op0_const_self
1459 && op0_const_self
1463 && op0_const
1464 && op0_const_self
1468 && op0_const_self
1474 /* Each case where an operand with excess precision may be
1475 encountered must remove the EXCESS_PRECISION_EXPR around
1476 inner operands and possibly put one around the whole
1477 expression or possibly convert to the semantic type (which
1478 c_fully_fold does); we cannot tell at this stage which is
1479 appropriate in any particular case. */
1483 /* Various codes may appear through folding built-in functions
1484 and their arguments. */
1486 }
1488 out:
1489 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1490 have been done by this point, so remove them again. */
1494 {
1498 }
1502 }
1504 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1505 return EXP. Otherwise, return either EXP or its known constant
1506 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1507 Is the BLKmode test appropriate? */
1509 tree
1511 {
1512 tree ret;
1514 /* This function is only used by C, for c_fully_fold and other
1515 optimization, and may not be correct for C++. */
1526 /* Avoid unwanted tree sharing between the initializer and current
1527 function's body where the tree can be modified e.g. by the
1528 gimplifier. */
1532 }
1534 /* Print a warning if a constant expression had overflow in folding.
1535 Invoke this function on every expression that the language
1536 requires to be a constant expression.
1537 Note the ANSI C standard says it is erroneous for a
1538 constant expression to overflow. */
1540 void
1542 {
1550 }
1552 /* The same as above but print an unconditional error. */
1553 void
1555 {
1562 }
1564 /* Print a warning if an expression had overflow in folding and its
1565 operands hadn't.
1567 Invoke this function on every expression that
1568 (1) appears in the source code, and
1569 (2) is a constant expression that overflowed, and
1570 (3) is not already checked by convert_and_check;
1571 however, do not invoke this function on operands of explicit casts
1572 or when the expression is the result of an operator and any operand
1573 already overflowed. */
1575 void
1577 {
1582 {
1611 }
1612 }
1614 /* Warn about uses of logical || / && operator in a context where it
1615 is likely that the bitwise equivalent was intended by the
1616 programmer. We have seen an expression in which CODE is a binary
1617 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1618 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1619 void
1623 {
1635 /* Warn if &&/|| are being used in a context where it is
1636 likely that the bitwise equivalent was intended by the
1637 programmer. That is, an expression such as op && MASK
1638 where op should not be any boolean expression, nor a
1639 constant, and mask seems to be a non-boolean integer constant. */
1647 {
1651 else
1656 }
1658 /* We do not warn for constants because they are typical of macro
1659 expansions that test for features. */
1663 /* This warning only makes sense with logical operands. */
1671 /* We first test whether either side separately is trivially true
1672 (with OR) or trivially false (with AND). If so, do not warn.
1673 This is a common idiom for testing ranges of data types in
1674 portable code. */
1681 /* If this is an OR operation, invert both sides; now, the result
1682 should be always false to get a warning. */
1696 /* If this is an OR operation, invert both sides; now, the result
1697 should be always false to get a warning. */
1705 /* If both expressions have the same operand, if we can merge the
1706 ranges, and if the range test is always false, then warn. */
1713 {
1716 "logical %<or%> "
1718 else
1720 "logical %<and%> "
1722 }
1723 }
1725 /* Warn about logical not used on the left hand side operand of a comparison.
1726 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1727 Do not warn if the LHS or RHS is of a boolean or a vector type. */
1729 void
1732 {
1737 ;
1745 "logical not is only applied to the left hand side of "
1747 }
1749 /* Warn if EXP contains any computations whose results are not used.
1750 Return true if a warning is printed; false otherwise. LOCUS is the
1751 (potential) location of the expression. */
1753 bool
1755 {
1756 restart:
1760 /* Don't warn about void constructs. This includes casting to void,
1761 void function calls, and statement expressions with a final cast
1762 to void. */
1770 {
1786 /* For a binding, warn if no side effect within it. */
1798 /* In && or ||, warn if 2nd operand has no side effect. */
1805 /* Let people do `(foo (), 0)' without a warning. */
1812 /* If this is an expression with side effects, don't warn; this
1813 case commonly appears in macro expansions. */
1819 /* Don't warn about automatic dereferencing of references, since
1820 the user cannot control it. */
1822 {
1825 }
1826 /* Fall through. */
1829 /* Referencing a volatile value is a side effect, so don't warn. */
1834 /* If this is an expression which has no operands, there is no value
1835 to be unused. There are no such language-independent codes,
1836 but front ends may define such. */
1840 warn:
1842 }
1843 }
1846 /* Print a warning about casts that might indicate violation
1847 of strict aliasing rules if -Wstrict-aliasing is used and
1848 strict aliasing mode is in effect. OTYPE is the original
1849 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1851 bool
1853 {
1854 /* Strip pointer conversion chains and get to the correct original type. */
1862 /* If the type we are casting to is a ref-all pointer
1863 dereferencing it is always valid. */
1870 {
1871 /* Casting the address of an object to non void pointer. Warn
1872 if the cast breaks type based aliasing. */
1874 {
1878 }
1879 else
1880 {
1881 /* warn_strict_aliasing >= 3. This includes the default (3).
1882 Only warn if the cast is dereferenced immediately. */
1883 alias_set_type set1 =
1889 {
1893 }
1896 {
1900 }
1901 }
1902 }
1903 else
1905 {
1906 /* At this level, warn for any conversions, even if an address is
1907 not taken in the same statement. This will likely produce many
1908 false positives, but could be useful to pinpoint problems that
1909 are not revealed at higher levels. */
1914 {
1918 }
1919 }
1922 }
1924 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1925 sizeof as last operand of certain builtins. */
1927 void
1931 {
1935 location_t loc;
1943 {
1947 /* FALLTHRU */
1955 /* FALLTHRU */
2014 }
2042 {
2046 {
2049 "argument to %<sizeof%> in %qD call is the same "
2050 "expression as the destination; did you mean to "
2056 "argument to %<sizeof%> in %qD call is the same "
2057 "expression as the destination; did you mean to "
2059 else
2061 "argument to %<sizeof%> in %qD call is the same "
2062 "expression as the destination; did you mean to "
2065 }
2068 && !strop
2071 {
2073 "argument to %<sizeof%> in %qD call is the same "
2074 "pointer type %qT as the destination; expected %qT "
2078 }
2079 }
2082 {
2086 {
2089 "argument to %<sizeof%> in %qD call is the same "
2090 "expression as the source; did you mean to "
2096 "argument to %<sizeof%> in %qD call is the same "
2097 "expression as the source; did you mean to "
2099 else
2101 "argument to %<sizeof%> in %qD call is the same "
2102 "expression as the source; did you mean to "
2105 }
2108 && !strop
2111 {
2113 "argument to %<sizeof%> in %qD call is the same "
2114 "pointer type %qT as the source; expected %qT "
2118 }
2119 }
2122 {
2126 {
2129 "argument to %<sizeof%> in %qD call is the same "
2130 "expression as the first source; did you mean to "
2136 "argument to %<sizeof%> in %qD call is the same "
2137 "expression as the first source; did you mean to "
2139 else
2141 "argument to %<sizeof%> in %qD call is the same "
2142 "expression as the first source; did you mean to "
2145 }
2148 && !strop
2151 {
2153 "argument to %<sizeof%> in %qD call is the same "
2154 "pointer type %qT as the first source; expected %qT "
2158 }
2159 }
2162 {
2166 {
2169 "argument to %<sizeof%> in %qD call is the same "
2170 "expression as the second source; did you mean to "
2176 "argument to %<sizeof%> in %qD call is the same "
2177 "expression as the second source; did you mean to "
2179 else
2181 "argument to %<sizeof%> in %qD call is the same "
2182 "expression as the second source; did you mean to "
2185 }
2188 && !strop
2191 {
2193 "argument to %<sizeof%> in %qD call is the same "
2194 "pointer type %qT as the second source; expected %qT "
2198 }
2199 }
2201 }
2203 /* Warn for unlikely, improbable, or stupid DECL declarations
2204 of `main'. */
2206 void
2208 {
2209 function_args_iterator iter;
2210 tree type;
2214 {
2215 /* XXX void_type_node belies the abstraction. */
2225 {
2231 }
2235 {
2257 "third argument of %q+D should probably be "
2260 }
2261 }
2263 /* It is intentional that this message does not mention the third
2264 argument because it's only mentioned in an appendix of the
2265 standard. */
2273 }
2275 /* vector_targets_convertible_p is used for vector pointer types. The
2276 callers perform various checks that the qualifiers are satisfactory,
2277 while OTOH vector_targets_convertible_p ignores the number of elements
2278 in the vectors. That's fine with vector pointers as we can consider,
2279 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2280 and that does not require and conversion of the pointer values.
2281 In contrast, vector_types_convertible_p and
2282 vector_types_compatible_elements_p are used for vector value types. */
2283 /* True if pointers to distinct types T1 and T2 can be converted to
2284 each other without an explicit cast. Only returns true for opaque
2285 vector types. */
2286 bool
2288 {
2295 }
2297 /* vector_types_convertible_p is used for vector value types.
2298 It could in principle call vector_targets_convertible_p as a subroutine,
2299 but then the check for vector type would be duplicated with its callers,
2300 and also the purpose of vector_targets_convertible_p would become
2301 muddled.
2302 Where vector_types_convertible_p returns true, a conversion might still be
2303 needed to make the types match.
2304 In contrast, vector_targets_convertible_p is used for vector pointer
2305 values, and vector_types_compatible_elements_p is used specifically
2306 in the context for binary operators, as a check if use is possible without
2307 conversion. */
2308 /* True if vector types T1 and T2 can be converted to each other
2309 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2310 can only be converted with -flax-vector-conversions yet that is not
2311 in effect, emit a note telling the user about that option if such
2312 a note has not previously been emitted. */
2313 bool
2315 {
2323 convertible_lax =
2338 {
2341 "conversions between vectors with differing "
2343 }
2346 }
2348 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2349 and have vector types, V0 has the same type as V1, and the number of
2350 elements of V0, V1, MASK is the same.
2352 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2353 called with two arguments. In this case implementation passes the
2354 first argument twice in order to share the same tree code. This fact
2355 could enable the mask-values being twice the vector length. This is
2356 an implementation accident and this semantics is not guaranteed to
2357 the user. */
2358 tree
2361 {
2362 tree ret;
2368 {
2371 }
2379 {
2384 }
2388 {
2392 }
2395 {
2400 }
2406 {
2409 "argument vector(s) and the mask vector should "
2412 }
2416 {
2421 }
2424 {
2425 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2431 else
2432 {
2435 }
2439 }
2449 }
2451 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2452 to integral type. */
2454 static tree
2456 {
2461 {
2462 /* C++0x scoped enumerations don't implicitly convert to integral
2463 type; if we stripped an explicit conversion to a larger type we
2464 need to replace it so common_type will still work. */
2468 }
2470 }
2472 /* This is a helper function of build_binary_op.
2474 For certain operations if both args were extended from the same
2475 smaller type, do the arithmetic in that type and then extend.
2477 BITWISE indicates a bitwise operation.
2478 For them, this optimization is safe only if
2479 both args are zero-extended or both are sign-extended.
2480 Otherwise, we might change the result.
2481 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2482 but calculated in (unsigned short) it would be (unsigned short)-1.
2483 */
2484 tree
2486 {
2490 tree type;
2492 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2493 excessive narrowing when we call get_narrower below. For
2494 example, suppose that OP0 is of unsigned int extended
2495 from signed char and that RESULT_TYPE is long long int.
2496 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2497 like
2499 (long long int) (unsigned int) signed_char
2501 which get_narrower would narrow down to
2503 (unsigned int) signed char
2505 If we do not cast OP0 first, get_narrower would return
2506 signed_char, which is inconsistent with the case of the
2507 explicit cast. */
2514 /* UNS is 1 if the operation to be done is an unsigned one. */
2517 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2518 but it *requires* conversion to FINAL_TYPE. */
2529 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2531 /* For bitwise operations, signedness of nominal type
2532 does not matter. Consider only how operands were extended. */
2536 /* Note that in all three cases below we refrain from optimizing
2537 an unsigned operation on sign-extended args.
2538 That would not be valid. */
2540 /* Both args variable: if both extended in same way
2541 from same width, do it in that width.
2542 Do it unsigned if args were zero-extended. */
2549 return c_common_signed_or_unsigned_type
2556 && (type
2567 && (type
2575 }
2577 /* Checks if expression EXPR of real/integer type cannot be converted
2578 to the real/integer type TYPE. Function returns non-zero when:
2579 * EXPR is a constant which cannot be exactly converted to TYPE.
2580 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2581 for EXPR type and TYPE being both integers or both real.
2582 * EXPR is not a constant of real type and TYPE is an integer.
2583 * EXPR is not a constant of integer type which cannot be
2584 exactly converted to real type.
2585 Function allows conversions between types of different signedness and
2586 can return SAFE_CONVERSION (zero) in that case. Function can produce
2587 signedness warnings if PRODUCE_WARNS is true. */
2589 enum conversion_safety
2591 {
2597 {
2598 /* Warn for real constant that is not an exact integer converted
2599 to integer type. */
2602 {
2605 }
2606 /* Warn for an integer constant that does not fit into integer type. */
2610 {
2613 {
2617 }
2619 {
2623 }
2624 else
2626 }
2628 {
2629 /* Warn for an integer constant that does not fit into real type. */
2631 {
2635 }
2636 /* Warn for a real constant that does not fit into a smaller
2637 real type. */
2640 {
2644 }
2645 }
2646 }
2647 else
2648 {
2649 /* Warn for real types converted to integer types. */
2656 {
2657 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2661 /* Don't warn for short y; short x = ((int)y & 0xff); */
2665 {
2666 /* If both args were extended from a shortest type,
2667 use that type if that is safe. */
2674 {
2680 /* If one of the operands is a non-negative constant
2681 that fits in the target type, then the type of the
2682 other operand does not matter. */
2691 /* If constant is unsigned and fits in the target
2692 type, then the result will also fit. */
2694 && unsigned0
2697 && unsigned1
2700 }
2701 }
2702 /* Warn for integer types converted to smaller integer types. */
2706 /* When they are the same width but different signedness,
2707 then the value may change. */
2710 /* Even when converted to a bigger type, if the type is
2711 unsigned but expr is signed, then negative values
2712 will be changed. */
2718 }
2720 /* Warn for integer types converted to real types if and only if
2721 all the range of values of the integer type cannot be
2722 represented by the real type. */
2725 {
2729 /* Don't warn about char y = 0xff; float x = (int) y; */
2741 }
2743 /* Warn for real types converted to smaller real types. */
2748 }
2751 }
2753 /* Warns if the conversion of EXPR to TYPE may alter a value.
2754 This is a helper function for warnings_for_convert_and_check. */
2756 static void
2758 {
2765 /* This may happen, because for LHS op= RHS we preevaluate
2766 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2767 means we could no longer see the code of the EXPR. */
2774 {
2787 /* Conversion from boolean to a signed:1 bit-field (which only
2788 can hold the values 0 and -1) doesn't lose information - but
2789 it does change the value. */
2809 {
2810 /* In case of COND_EXPR, we do not care about the type of
2811 COND_EXPR, only about the conversion of each operand. */
2818 }
2830 }
2831 }
2833 /* Produce warnings after a conversion. RESULT is the result of
2834 converting EXPR to TYPE. This is a helper function for
2835 convert_and_check and cp_convert_and_check. */
2837 void
2839 tree result)
2840 {
2847 {
2848 /* Do not diagnose overflow in a constant expression merely
2849 because a conversion overflowed. */
2854 {
2855 /* This detects cases like converting -129 or 256 to
2856 unsigned char. */
2860 else
2862 }
2866 /* No warning for converting 0x80000000 to int. */
2874 else
2876 }
2881 else
2883 }
2886 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2887 Invoke this function on every expression that is converted implicitly,
2888 i.e. because of language rules and not because of an explicit cast. */
2890 tree
2892 {
2893 tree result;
2894 tree expr_for_warning;
2896 /* Convert from a value with possible excess precision rather than
2897 via the semantic type, but do not warn about values not fitting
2898 exactly in the semantic type. */
2900 {
2906 }
2907 else
2921 }
2922 \f
2923 /* A node in a list that describes references to variables (EXPR), which are
2924 either read accesses if WRITER is zero, or write accesses, in which case
2925 WRITER is the parent of EXPR. */
2926 struct tlist
2927 {
2930 };
2932 /* Used to implement a cache the results of a call to verify_tree. We only
2933 use this for SAVE_EXPRs. */
2934 struct tlist_cache
2935 {
2939 tree expr;
2940 };
2942 /* Obstack to use when allocating tlist structures, and corresponding
2943 firstobj. */
2947 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2948 warnings. */
2950 /* SAVE_EXPRs need special treatment. We process them only once and then
2951 cache the results. */
2963 /* Create a new struct tlist and fill in its fields. */
2966 {
2973 }
2975 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2976 is nonnull, we ignore any node we find which has a writer equal to it. */
2978 static void
2980 {
2982 {
2989 }
2990 }
2992 /* Merge the nodes of ADD into TO. This merging process is done so that for
2993 each variable that already exists in TO, no new node is added; however if
2994 there is a write access recorded in ADD, and an occurrence on TO is only
2995 a read access, then the occurrence in TO will be modified to record the
2996 write. */
2998 static void
3000 {
3007 {
3014 {
3018 }
3020 {
3024 }
3026 }
3027 }
3029 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3030 references in list LIST conflict with it, excluding reads if ONLY writers
3031 is nonzero. */
3033 static void
3036 {
3039 /* Avoid duplicate warnings. */
3045 {
3049 {
3054 }
3056 }
3057 }
3059 /* Given a list LIST of references to variables, find whether any of these
3060 can cause conflicts due to missing sequence points. */
3062 static void
3064 {
3068 {
3071 }
3072 }
3074 /* Return nonzero if X is a tree that can be verified by the sequence point
3075 warnings. */
3076 static int
3078 {
3085 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3086 (lvalue_p) crash on TRY/CATCH. */
3093 /* No point to track non-const calls, they will never satisfy
3094 operand_equal_p. */
3102 }
3104 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3105 static bool
3107 {
3109 }
3111 /* Walk the tree X, and record accesses to variables. If X is written by the
3112 parent tree, WRITER is the parent.
3113 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3114 expression or its only operand forces a sequence point, then everything up
3115 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3116 in PNO_SP.
3117 Once we return, we will have emitted warnings if any subexpression before
3118 such a sequence point could be undefined. On a higher level, however, the
3119 sequence point may not be relevant, and we'll merge the two lists.
3121 Example: (b++, a) + b;
3122 The call that processes the COMPOUND_EXPR will store the increment of B
3123 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3124 processes the PLUS_EXPR will need to merge the two lists so that
3125 eventually, all accesses end up on the same list (and we'll warn about the
3126 unordered subexpressions b++ and b.
3128 A note on merging. If we modify the former example so that our expression
3129 becomes
3130 (b++, b) + a
3131 care must be taken not simply to add all three expressions into the final
3132 PNO_SP list. The function merge_tlist takes care of that by merging the
3133 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3134 way, so that no more than one access to B is recorded. */
3136 static void
3138 tree writer)
3139 {
3144 /* X may be NULL if it is the operand of an empty statement expression
3145 ({ }). */
3149 restart:
3157 {
3190 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3191 two first, to avoid warning for (a ? b++ : b++). */
3207 /* Expressions inside the LHS are not ordered wrt. the sequence points
3208 in the RHS. Example:
3209 *a = (a++, 2)
3210 Despite the fact that the modification of "a" is in the before_sp
3211 list (tmp_before), it conflicts with the use of "a" in the LHS.
3212 We can handle this by adding the contents of tmp_list3
3213 to those of tmp_before, and redoing the collision warnings for that
3214 list. */
3217 /* Exclude the LHS itself here; we first have to merge it into the
3218 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3219 didn't exclude the LHS, we'd get it twice, once as a read and once
3220 as a write. */
3231 /* We need to warn about conflicts among arguments and conflicts between
3232 args and the function address. Side effects of the function address,
3233 however, are not ordered by the sequence point of the call. */
3234 {
3235 call_expr_arg_iterator iter;
3236 tree arg;
3240 {
3245 }
3250 }
3253 /* Scan all the list, e.g. indices of multi dimensional array. */
3255 {
3261 }
3265 {
3272 {
3286 }
3290 }
3300 /* For other expressions, simply recurse on their operands.
3301 Manual tail recursion for unary expressions.
3302 Other non-expressions need not be processed. */
3304 {
3308 }
3310 {
3314 {
3319 }
3320 }
3322 }
3323 }
3325 /* Try to warn for undefined behavior in EXPR due to missing sequence
3326 points. */
3328 DEBUG_FUNCTION void
3330 {
3336 {
3339 }
3344 }
3345 \f
3346 /* Validate the expression after `case' and apply default promotions. */
3348 static tree
3350 {
3355 /* Promote char or short to int. */
3358 {
3361 }
3366 }
3367 \f
3368 /* See if the case values LOW and HIGH are in the range of the original
3369 type (i.e. before the default conversion to int) of the switch testing
3370 expression.
3371 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3372 the type before promoting it. CASE_LOW_P is a pointer to the lower
3373 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3374 if the case is not a case range.
3375 The caller has to make sure that we are not called with NULL for
3376 CASE_LOW_P (i.e. the default case).
3377 Returns true if the case label is in range of ORIG_TYPE (saturated or
3378 untouched) or false if the label is out of range. */
3380 static bool
3383 {
3388 /* If there was a problem with the original type, do nothing. */
3395 /* Case label is less than minimum for type. */
3398 {
3402 }
3404 /* Case value is greater than maximum for type. */
3407 {
3410 }
3412 /* Saturate lower case label value to minimum. */
3415 {
3419 }
3421 /* Saturate upper case label value to maximum. */
3424 {
3428 }
3436 }
3437 \f
3438 /* Return an integer type with BITS bits of precision,
3439 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3441 tree
3443 {
3482 }
3484 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3485 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3486 and saturating if SATP is nonzero, otherwise not saturating. */
3488 tree
3491 {
3495 else
3503 {
3505 "fixed-point types that have too many integral and "
3508 }
3511 }
3513 /* Used for communication between c_common_type_for_mode and
3514 c_register_builtin_type. */
3515 tree registered_builtin_types;
3517 /* Return a data type that has machine mode MODE.
3518 If the mode is an integer,
3519 then UNSIGNEDP selects between signed and unsigned types.
3520 If the mode is a fixed-point mode,
3521 then UNSIGNEDP selects between saturating and nonsaturating types. */
3523 tree
3525 {
3526 tree t;
3563 #if HOST_BITS_PER_WIDE_INT >= 64
3566 #endif
3591 {
3593 tree inner_type;
3609 }
3611 {
3616 }
3626 {
3712 }
3720 }
3722 tree
3724 {
3726 }
3728 /* Return a signed type the same as TYPE in other respects. */
3730 tree
3732 {
3734 }
3736 /* Return a type the same as TYPE except unsigned or
3737 signed according to UNSIGNEDP. */
3739 tree
3741 {
3742 tree type1;
3744 /* This block of code emulates the behavior of the old
3745 c_common_unsigned_type. In particular, it returns
3746 long_unsigned_type_node if passed a long, even when a int would
3747 have the same size. This is necessary for warnings to work
3748 correctly in archs where sizeof(int) == sizeof(long) */
3751 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3767 #if HOST_BITS_PER_WIDE_INT >= 64
3770 #endif
3780 #define C_COMMON_FIXED_TYPES(NAME) \
3781 if (type1 == short_ ## NAME ## _type_node \
3782 || type1 == unsigned_short_ ## NAME ## _type_node) \
3783 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3784 : short_ ## NAME ## _type_node; \
3785 if (type1 == NAME ## _type_node \
3786 || type1 == unsigned_ ## NAME ## _type_node) \
3787 return unsignedp ? unsigned_ ## NAME ## _type_node \
3788 : NAME ## _type_node; \
3789 if (type1 == long_ ## NAME ## _type_node \
3790 || type1 == unsigned_long_ ## NAME ## _type_node) \
3791 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3792 : long_ ## NAME ## _type_node; \
3793 if (type1 == long_long_ ## NAME ## _type_node \
3794 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3795 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3796 : long_long_ ## NAME ## _type_node;
3798 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3799 if (type1 == NAME ## _type_node \
3800 || type1 == u ## NAME ## _type_node) \
3801 return unsignedp ? u ## NAME ## _type_node \
3802 : NAME ## _type_node;
3804 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3805 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3806 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3807 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3808 : sat_ ## short_ ## NAME ## _type_node; \
3809 if (type1 == sat_ ## NAME ## _type_node \
3810 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3811 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3812 : sat_ ## NAME ## _type_node; \
3813 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3814 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3815 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3816 : sat_ ## long_ ## NAME ## _type_node; \
3817 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3818 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3819 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3820 : sat_ ## long_long_ ## NAME ## _type_node;
3822 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3823 if (type1 == sat_ ## NAME ## _type_node \
3824 || type1 == sat_ ## u ## NAME ## _type_node) \
3825 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3826 : sat_ ## NAME ## _type_node;
3852 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3853 the precision; they have precision set to match their range, but
3854 may use a wider mode to match an ABI. If we change modes, we may
3855 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3856 the precision as well, so as to yield correct results for
3857 bit-field types. C++ does not have these separate bit-field
3858 types, and producing a signed or unsigned variant of an
3859 ENUMERAL_TYPE may cause other problems as well. */
3865 #define TYPE_OK(node) \
3866 (TYPE_MODE (type) == TYPE_MODE (node) \
3867 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3886 #if HOST_BITS_PER_WIDE_INT >= 64
3889 #endif
3898 #undef TYPE_OK
3901 }
3903 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3905 tree
3907 {
3908 /* Extended integer types of the same width as a standard type have
3909 lesser rank, so those of the same width as int promote to int or
3910 unsigned int and are valid for printf formats expecting int or
3911 unsigned int. To avoid such special cases, avoid creating
3912 extended integer types for bit-fields if a standard integer type
3913 is available. */
3930 }
3932 /* The C version of the register_builtin_type langhook. */
3934 void
3936 {
3937 tree decl;
3947 }
3948 \f
3949 /* Print an error message for invalid operands to arith operation
3950 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3951 LOCATION is the location of the message. */
3953 void
3956 {
3960 {
4005 }
4009 }
4010 \f
4011 /* Given an expression as a tree, return its original type. Do this
4012 by stripping any conversion that preserves the sign and precision. */
4013 static tree
4015 {
4018 }
4020 /* Subroutine of build_binary_op, used for comparison operations.
4021 See if the operands have both been converted from subword integer types
4022 and, if so, perhaps change them both back to their original type.
4023 This function is also responsible for converting the two operands
4024 to the proper common type for comparison.
4026 The arguments of this function are all pointers to local variables
4027 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4028 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4030 LOC is the location of the comparison.
4032 If this function returns nonzero, it means that the comparison has
4033 a constant value. What this function returns is an expression for
4034 that value. */
4036 tree
4039 {
4040 tree type;
4048 /* Throw away any conversions to wider types
4049 already present in the operands. */
4054 /* If primopN is first sign-extended from primopN's precision to opN's
4055 precision, then zero-extended from opN's precision to
4056 *restype_ptr precision, shortenings might be invalid. */
4059 && !unsignedp0
4064 && !unsignedp1
4068 /* Handle the case that OP0 does not *contain* a conversion
4069 but it *requires* conversion to FINAL_TYPE. */
4076 /* If one of the operands must be floated, we cannot optimize. */
4080 /* If first arg is constant, swap the args (changing operation
4081 so value is preserved), for canonicalization. Don't do this if
4082 the second arg is 0. */
4087 {
4104 {
4119 }
4121 }
4123 /* If comparing an integer against a constant more bits wide,
4124 maybe we can deduce a value of 1 or 0 independent of the data.
4125 Or else truncate the constant now
4126 rather than extend the variable at run time.
4128 This is only interesting if the constant is the wider arg.
4129 Also, it is not safe if the constant is unsigned and the
4130 variable arg is signed, since in this case the variable
4131 would be sign-extended and then regarded as unsigned.
4132 Our technique fails in this case because the lowest/highest
4133 possible unsigned results don't follow naturally from the
4134 lowest/highest possible values of the variable operand.
4135 For just EQ_EXPR and NE_EXPR there is another technique that
4136 could be used: see if the constant can be faithfully represented
4137 in the other operand's type, by truncating it and reextending it
4138 and see if that preserves the constant's value. */
4144 {
4147 /* 1 if comparison is nominally unsigned. */
4149 tree val;
4161 {
4162 /* Convert primop1 to target type, but do not introduce
4163 additional overflow. We know primop1 is an int_cst. */
4170 }
4172 {
4175 }
4183 /* This used to be a switch, but Genix compiler can't handle that. */
4185 {
4188 }
4190 {
4193 }
4195 {
4200 }
4202 {
4207 }
4209 {
4214 }
4216 {
4221 }
4223 /* If primop0 was sign-extended and unsigned comparison specd,
4224 we did a signed comparison above using the signed type bounds.
4225 But the comparison we output must be unsigned.
4227 Also, for inequalities, VAL is no good; but if the signed
4228 comparison had *any* fixed result, it follows that the
4229 unsigned comparison just tests the sign in reverse
4230 (positive values are LE, negative ones GE).
4231 So we can generate an unsigned comparison
4232 against an extreme value of the signed type. */
4235 {
4238 {
4253 }
4255 }
4258 {
4265 }
4268 {
4269 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4273 }
4275 /* Value is not predetermined, but do the comparison
4276 in the type of the operand that is not constant.
4277 TYPE is already properly set. */
4278 }
4280 /* If either arg is decimal float and the other is float, find the
4281 proper common type to use for comparison. */
4292 /* If args' natural types are both narrower than nominal type
4293 and both extend in the same manner, compare them
4294 in the type of the wider arg.
4295 Otherwise must actually extend both to the nominal
4296 common type lest different ways of extending
4297 alter the result.
4298 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4303 {
4307 type);
4308 /* Make sure shorter operand is extended the right way
4309 to match the longer operand. */
4310 primop0
4313 primop0);
4314 primop1
4317 primop1);
4318 }
4319 else
4320 {
4321 /* Here we must do the comparison on the nominal type
4322 using the args exactly as we received them. */
4329 {
4331 /* All unsigned values are >= 0, so we warn. However,
4332 if OP0 is a constant that is >= 0, the signedness of
4333 the comparison isn't an issue, so suppress the
4334 warning. */
4339 primop0)))
4340 /* Do not warn for enumeration types. */
4344 {
4361 }
4364 {
4365 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4370 }
4371 }
4372 }
4380 }
4381 \f
4382 /* Return a tree for the sum or difference (RESULTCODE says which)
4383 of pointer PTROP and integer INTOP. */
4385 tree
4388 {
4391 /* The result is a pointer of the same type that is being added. */
4395 {
4402 }
4404 {
4411 }
4412 else
4415 /* We are manipulating pointer values, so we don't need to warn
4416 about relying on undefined signed overflow. We disable the
4417 warning here because we use integer types so fold won't know that
4418 they are really pointers. */
4421 /* If what we are about to multiply by the size of the elements
4422 contains a constant term, apply distributive law
4423 and multiply that constant term separately.
4424 This helps produce common subexpressions. */
4429 /* If the constant comes from pointer subtraction,
4430 skip this optimization--it would cause an error. */
4432 /* If the constant is unsigned, and smaller than the pointer size,
4433 then we must skip this optimization. This is because it could cause
4434 an overflow error if the constant is negative but INTOP is not. */
4438 {
4443 /* Convert both subexpression types to the type of intop,
4444 because weird cases involving pointer arithmetic
4445 can result in a sum or difference with different type args. */
4450 }
4452 /* Convert the integer argument to a type the same size as sizetype
4453 so the multiply won't overflow spuriously. */
4459 /* Replace the integer argument with a suitable product by the object size.
4460 Do this multiplication as signed, then convert to the appropriate type
4461 for the pointer operation and disregard an overflow that occurred only
4462 because of the sign-extension change in the latter conversion. */
4463 {
4470 }
4472 /* Create the sum or difference. */
4481 }
4482 \f
4483 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4484 and if NON_CONST is known not to be permitted in an evaluated part
4485 of a constant expression. */
4487 tree
4489 {
4493 /* This should never be called for C++. */
4497 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4506 }
4508 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4509 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4510 around the SAVE_EXPR if needed so that c_fully_fold does not need
4511 to look inside SAVE_EXPRs. */
4513 tree
4515 {
4524 }
4526 /* Return whether EXPR is a declaration whose address can never be
4527 NULL. */
4529 bool
4531 {
4536 }
4538 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4539 or for an `if' or `while' statement or ?..: exp. It should already
4540 have been validated to be of suitable type; otherwise, a bad
4541 diagnostic may result.
4543 The EXPR is located at LOCATION.
4545 This preparation consists of taking the ordinary
4546 representation of an expression expr and producing a valid tree
4547 boolean expression describing whether expr is nonzero. We could
4548 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4549 but we optimize comparisons, &&, ||, and !.
4551 The resulting type should always be `truthvalue_type_node'. */
4553 tree
4555 {
4557 {
4599 ? truthvalue_true_node
4605 ? truthvalue_true_node
4610 /* Fall through. */
4613 {
4616 {
4617 /* Common Ada/Pascal programmer's mistake. */
4619 OPT_Waddress,
4621 inner);
4623 }
4625 }
4642 /* These don't change whether an object is nonzero or zero. */
4647 /* These don't change whether an object is zero or nonzero, but
4648 we can't ignore them if their second arg has side-effects. */
4650 {
4653 c_common_truthvalue_conversion
4656 }
4657 else
4662 /* Distribute the conversion into the arms of a COND_EXPR. */
4664 {
4667 /* In C++ one of the arms might have void type if it is throw. */
4675 }
4676 else
4677 {
4678 /* Folding will happen later for C. */
4686 }
4688 CASE_CONVERT:
4689 {
4693 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4694 since that affects how `default_conversion' will behave. */
4698 /* Don't strip a conversion from C++0x scoped enum, since they
4699 don't implicitly convert to other types. */
4703 /* If this isn't narrowing the argument, we can ignore it. */
4707 }
4713 {
4717 }
4722 }
4725 {
4727 expr = (build_binary_op
4731 c_common_truthvalue_conversion
4734 c_common_truthvalue_conversion
4739 }
4742 {
4747 }
4748 else
4751 ret:
4754 }
4755 \f
4764 /* Apply the TYPE_QUALS to the new DECL. */
4766 void
4768 {
4776 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4777 constructor can produce constant init, so rely on cp_finish_decl to
4778 clear TREE_READONLY if the variable has non-constant init. */
4781 {
4784 }
4786 {
4788 /* Allow 'restrict' on arrays of pointers.
4789 FIXME currently we just ignore it. */
4795 }
4796 }
4798 /* Hash function for the problem of multiple type definitions in
4799 different files. This must hash all types that will compare
4800 equal via comptypes to the same value. In practice it hashes
4801 on some of the simple stuff and leaves the details to comptypes. */
4803 static hashval_t
4805 {
4809 tree t2;
4811 {
4812 /* For pointers, hash on pointee type plus some swizzling. */
4815 /* Hash on number of elements and total size. */
4834 }
4835 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4836 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4838 /* We might have a VLA here. */
4841 else
4844 }
4848 /* Return the typed-based alias set for T, which may be an expression
4849 or a type. Return -1 if we don't do anything special. */
4851 alias_set_type
4853 {
4854 tree u;
4857 /* For VLAs, use the alias set of the element type rather than the
4858 default of alias set 0 for types compared structurally. */
4860 {
4864 }
4866 /* Permit type-punning when accessing a union, provided the access
4867 is directly through the union. For example, this code does not
4868 permit taking the address of a union member and then storing
4869 through it. Even the type-punning allowed here is a GCC
4870 extension, albeit a common and useful one; the C standard says
4871 that such accesses have implementation-defined behavior. */
4879 /* That's all the expressions we handle specially. */
4883 /* The C standard guarantees that any object may be accessed via an
4884 lvalue that has character type. */
4890 /* The C standard specifically allows aliasing between signed and
4891 unsigned variants of the same type. We treat the signed
4892 variant as canonical. */
4894 {
4897 /* t1 == t can happen for boolean nodes which are always unsigned. */
4900 }
4902 /* Handle the case of multiple type nodes referring to "the same" type,
4903 which occurs with IMA. These share an alias set. FIXME: Currently only
4904 C90 is handled. (In C99 type compatibility is not transitive, which
4905 complicates things mightily. The alias set splay trees can theoretically
4906 represent this, but insertion is tricky when you consider all the
4907 different orders things might arrive in.) */
4912 /* Save time if there's only one input file. */
4916 /* Pointers need special handling if they point to any type that
4917 needs special handling (below). */
4919 {
4920 tree t2;
4921 /* Find bottom type under any nested POINTERs. */
4925 ;
4933 }
4934 /* These are the only cases that need special handling. */
4941 /* Undefined? */
4945 /* Look up t in hash table. Only one of the compatible types within each
4946 alias set is recorded in the table. */
4950 NULL);
4953 {
4956 }
4957 else
4958 /* Our caller will assign and record (in t) a new alias set; all we need
4959 to do is remember t in the hash table. */
4963 }
4964 \f
4965 /* Return the least alignment required for type TYPE. */
4967 unsigned int
4969 {
4972 #ifdef BIGGEST_FIELD_ALIGNMENT
4974 #endif
4976 #ifdef ADJUST_FIELD_ALIGN
4978 type);
4980 #endif
4983 }
4985 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4986 the IS_SIZEOF parameter indicates which operator is being applied.
4987 The COMPLAIN flag controls whether we should diagnose possibly
4988 ill-formed constructs or not. LOC is the location of the SIZEOF or
4989 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4990 a type in any context should be returned, rather than the normal
4991 alignment for that type. */
4993 tree
4997 {
5005 {
5007 {
5014 }
5015 else
5016 {
5018 {
5022 else
5025 }
5027 }
5028 }
5030 {
5038 }
5041 {
5046 }
5049 {
5054 }
5055 else
5056 {
5058 /* Convert in case a char is more than one unit. */
5064 else
5066 }
5068 /* VALUE will have the middle-end integer type sizetype.
5069 However, we should really return a value of type `size_t',
5070 which is just a typedef for an ordinary integer type. */
5074 }
5076 /* Implement the __alignof keyword: Return the minimum required
5077 alignment of EXPR, measured in bytes. For VAR_DECLs,
5078 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5079 from an "aligned" __attribute__ specification). LOC is the
5080 location of the ALIGNOF operator. */
5082 tree
5084 {
5085 tree t;
5092 {
5095 }
5101 {
5108 {
5115 }
5117 }
5118 else
5122 }
5123 \f
5124 /* Handle C and C++ default attributes. */
5126 enum built_in_attribute
5127 {
5128 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5129 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5130 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5131 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5132 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5134 #undef DEF_ATTR_NULL_TREE
5135 #undef DEF_ATTR_INT
5136 #undef DEF_ATTR_STRING
5137 #undef DEF_ATTR_IDENT
5138 #undef DEF_ATTR_TREE_LIST
5139 ATTR_LAST
5140 };
5146 enum c_builtin_type
5147 {
5148 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5149 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5150 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5151 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5152 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5153 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5154 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5155 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5156 ARG6) NAME,
5157 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5158 ARG6, ARG7) NAME,
5159 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5160 ARG6, ARG7, ARG8) NAME,
5161 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5162 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5163 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5164 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5165 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5166 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5167 NAME,
5168 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5170 #undef DEF_PRIMITIVE_TYPE
5171 #undef DEF_FUNCTION_TYPE_0
5172 #undef DEF_FUNCTION_TYPE_1
5173 #undef DEF_FUNCTION_TYPE_2
5174 #undef DEF_FUNCTION_TYPE_3
5175 #undef DEF_FUNCTION_TYPE_4
5176 #undef DEF_FUNCTION_TYPE_5
5177 #undef DEF_FUNCTION_TYPE_6
5178 #undef DEF_FUNCTION_TYPE_7
5179 #undef DEF_FUNCTION_TYPE_8
5180 #undef DEF_FUNCTION_TYPE_VAR_0
5181 #undef DEF_FUNCTION_TYPE_VAR_1
5182 #undef DEF_FUNCTION_TYPE_VAR_2
5183 #undef DEF_FUNCTION_TYPE_VAR_3
5184 #undef DEF_FUNCTION_TYPE_VAR_4
5185 #undef DEF_FUNCTION_TYPE_VAR_5
5186 #undef DEF_POINTER_TYPE
5187 BT_LAST
5188 };
5192 /* A temporary array for c_common_nodes_and_builtins. Used in
5193 communication with def_fn_type. */
5196 /* A helper function for c_common_nodes_and_builtins. Build function type
5197 for DEF with return type RET and N arguments. If VAR is true, then the
5198 function should be variadic after those N arguments.
5200 Takes special care not to ICE if any of the types involved are
5201 error_mark_node, which indicates that said type is not in fact available
5202 (see builtin_type_for_size). In which case the function type as a whole
5203 should be error_mark_node. */
5205 static void
5207 {
5208 tree t;
5215 {
5221 }
5228 else
5231 egress:
5234 }
5236 /* Build builtin functions common to both C and C++ language
5237 frontends. */
5239 static void
5241 {
5242 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5243 builtin_types[ENUM] = VALUE;
5244 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5245 def_fn_type (ENUM, RETURN, 0, 0);
5246 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5247 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5248 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5249 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5250 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5251 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5252 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5253 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5254 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5255 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5256 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5257 ARG6) \
5258 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5259 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5260 ARG6, ARG7) \
5261 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5262 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5263 ARG6, ARG7, ARG8) \
5264 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5265 ARG7, ARG8);
5266 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5267 def_fn_type (ENUM, RETURN, 1, 0);
5268 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5269 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5270 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5271 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5272 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5273 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5274 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5275 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5276 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5277 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5278 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5279 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5283 #undef DEF_PRIMITIVE_TYPE
5284 #undef DEF_FUNCTION_TYPE_0
5285 #undef DEF_FUNCTION_TYPE_1
5286 #undef DEF_FUNCTION_TYPE_2
5287 #undef DEF_FUNCTION_TYPE_3
5288 #undef DEF_FUNCTION_TYPE_4
5289 #undef DEF_FUNCTION_TYPE_5
5290 #undef DEF_FUNCTION_TYPE_6
5291 #undef DEF_FUNCTION_TYPE_7
5292 #undef DEF_FUNCTION_TYPE_8
5293 #undef DEF_FUNCTION_TYPE_VAR_0
5294 #undef DEF_FUNCTION_TYPE_VAR_1
5295 #undef DEF_FUNCTION_TYPE_VAR_2
5296 #undef DEF_FUNCTION_TYPE_VAR_3
5297 #undef DEF_FUNCTION_TYPE_VAR_4
5298 #undef DEF_FUNCTION_TYPE_VAR_5
5299 #undef DEF_POINTER_TYPE
5304 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5305 NONANSI_P, ATTRS, IMPLICIT, COND) \
5306 if (NAME && COND) \
5307 def_builtin_1 (ENUM, NAME, CLASS, \
5308 builtin_types[(int) TYPE], \
5309 builtin_types[(int) LIBTYPE], \
5310 BOTH_P, FALLBACK_P, NONANSI_P, \
5311 built_in_attributes[(int) ATTRS], IMPLICIT);
5313 #undef DEF_BUILTIN
5321 }
5323 /* Like get_identifier, but avoid warnings about null arguments when
5324 the argument may be NULL for targets where GCC lacks stdint.h type
5325 information. */
5329 {
5331 }
5333 /* Build tree nodes and builtin functions common to both C and C++ language
5334 frontends. */
5336 void
5338 {
5342 tree array_domain_type;
5343 tree va_list_ref_type_node;
5344 tree va_list_arg_type_node;
5348 /* Define `int' and `char' first so that dbx will output them first. */
5352 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5353 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5354 but not C. Are the conditionals here needed? */
5360 long_unsigned_type_node);
5362 {
5364 int128_integer_type_node);
5366 int128_unsigned_type_node);
5367 }
5371 long_long_integer_type_node);
5373 long_long_unsigned_type_node);
5376 long_long_unsigned_type_node);
5379 short_unsigned_type_node);
5382 short_unsigned_type_node);
5384 /* Define both `signed char' and `unsigned char'. */
5388 /* These are types that c_common_type_for_size and
5389 c_common_type_for_mode use. */
5392 intQI_type_node));
5395 intHI_type_node));
5398 intSI_type_node));
5401 intDI_type_node));
5402 #if HOST_BITS_PER_WIDE_INT >= 64
5405 TYPE_DECL,
5407 intTI_type_node));
5408 #endif
5411 unsigned_intQI_type_node));
5414 unsigned_intHI_type_node));
5417 unsigned_intSI_type_node));
5420 unsigned_intDI_type_node));
5421 #if HOST_BITS_PER_WIDE_INT >= 64
5424 TYPE_DECL,
5426 unsigned_intTI_type_node));
5427 #endif
5429 /* Create the widest literal types. */
5430 widest_integer_literal_type_node
5434 widest_integer_literal_type_node));
5436 widest_unsigned_literal_type_node
5440 widest_unsigned_literal_type_node));
5444 pid_type_node =
5451 /* Only supported decimal floating point extension if the target
5452 actually supports underlying modes. */
5456 {
5460 }
5463 {
5468 long_long_fract_type_node);
5470 unsigned_short_fract_type_node);
5472 unsigned_fract_type_node);
5474 unsigned_long_fract_type_node);
5476 unsigned_long_long_fract_type_node);
5478 sat_short_fract_type_node);
5481 sat_long_fract_type_node);
5483 sat_long_long_fract_type_node);
5485 sat_unsigned_short_fract_type_node);
5487 sat_unsigned_fract_type_node);
5489 sat_unsigned_long_fract_type_node);
5491 sat_unsigned_long_long_fract_type_node);
5496 long_long_accum_type_node);
5498 unsigned_short_accum_type_node);
5500 unsigned_accum_type_node);
5502 unsigned_long_accum_type_node);
5504 unsigned_long_long_accum_type_node);
5506 sat_short_accum_type_node);
5509 sat_long_accum_type_node);
5511 sat_long_long_accum_type_node);
5513 sat_unsigned_short_accum_type_node);
5515 sat_unsigned_accum_type_node);
5517 sat_unsigned_long_accum_type_node);
5519 sat_unsigned_long_long_accum_type_node);
5521 }
5524 TYPE_DECL,
5526 complex_integer_type_node));
5528 TYPE_DECL,
5530 complex_float_type_node));
5532 TYPE_DECL,
5534 complex_double_type_node));
5538 complex_long_double_type_node));
5541 /* For C++, make fileptr_type_node a distinct void * type until
5542 FILE type is defined. */
5547 /* Set the TYPE_NAME for any variants that were built before
5548 record_builtin_type gave names to the built-in types. */
5549 {
5555 }
5559 /* Make a type to be the domain of a few array types
5560 whose domains don't really matter.
5561 200 is small enough that it always fits in size_t
5562 and large enough that it can hold most function names for the
5563 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5566 /* Make a type for arrays of characters.
5567 With luck nothing will ever really depend on the length of this
5568 array type. */
5569 char_array_type_node
5573 const_string_type_node
5577 /* This is special for C++ so functions can be overloaded. */
5583 {
5586 else
5589 }
5591 /* This is for wide string constants. */
5592 wchar_array_type_node
5595 /* Define 'char16_t'. */
5600 {
5605 }
5607 /* This is for UTF-16 string constants. */
5608 char16_array_type_node
5611 /* Define 'char32_t'. */
5616 {
5621 }
5623 /* This is for UTF-32 string constants. */
5624 char32_array_type_node
5627 wint_type_node =
5630 intmax_type_node =
5632 uintmax_type_node =
5636 sig_atomic_type_node =
5639 int8_type_node =
5642 int16_type_node =
5645 int32_type_node =
5648 int64_type_node =
5651 uint8_type_node =
5663 int_least8_type_node =
5666 int_least16_type_node =
5669 int_least32_type_node =
5672 int_least64_type_node =
5675 uint_least8_type_node =
5678 uint_least16_type_node =
5681 uint_least32_type_node =
5684 uint_least64_type_node =
5687 int_fast8_type_node =
5690 int_fast16_type_node =
5693 int_fast32_type_node =
5696 int_fast64_type_node =
5699 uint_fast8_type_node =
5702 uint_fast16_type_node =
5705 uint_fast32_type_node =
5708 uint_fast64_type_node =
5711 intptr_type_node =
5714 uintptr_type_node =
5717 default_function_type
5719 ptrdiff_type_node
5726 va_list_type_node));
5728 {
5731 tree ptype;
5734 {
5738 ptype));
5740 }
5741 }
5744 {
5747 }
5748 else
5749 {
5752 }
5759 /* Create the built-in __null node. It is important that this is
5760 not shared. */
5764 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5766 }
5768 /* The number of named compound-literals generated thus far. */
5771 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5773 void
5775 {
5778 compound_literal_number);
5779 compound_literal_number++;
5781 }
5783 tree
5785 {
5789 }
5792 /* Linked list of disabled built-in functions. */
5795 {
5803 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5804 begins with "__builtin_", give an error. */
5806 void
5808 {
5811 else
5812 {
5817 }
5818 }
5821 /* Return true if the built-in function NAME has been disabled, false
5822 otherwise. */
5824 static bool
5826 {
5829 {
5832 }
5834 }
5837 /* Worker for DEF_BUILTIN.
5838 Possibly define a builtin function with one or two names.
5839 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5840 nonansi_p and flag_no_nonansi_builtin. */
5842 static void
5849 {
5850 tree decl;
5863 fnattrs);
5872 }
5873 \f
5874 /* Nonzero if the type T promotes to int. This is (nearly) the
5875 integral promotions defined in ISO C99 6.3.1.1/2. */
5877 bool
5879 {
5881 {
5891 /* ??? Technically all enumerations not larger than an int
5892 promote to an int. But this is used along code paths
5893 that only want to notice a size change. */
5901 }
5902 }
5904 /* Return 1 if PARMS specifies a fixed number of parameters
5905 and none of their types is affected by default promotions. */
5907 int
5909 {
5910 const_tree t;
5912 {
5929 }
5931 }
5933 /* Recursively remove any '*' or '&' operator from TYPE. */
5934 tree
5936 {
5940 }
5942 /* Recursively remove pointer or array type from TYPE. */
5943 tree
5945 {
5949 }
5951 /* Used to compare case labels. K1 and K2 are actually tree nodes
5952 representing case labels, or NULL_TREE for a `default' label.
5953 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5954 K2, and 0 if K1 and K2 are equal. */
5956 int
5958 {
5959 /* Consider a NULL key (such as arises with a `default' label) to be
5960 smaller than anything else. */
5967 }
5969 /* Process a case label, located at LOC, for the range LOW_VALUE
5970 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5971 then this case label is actually a `default' label. If only
5972 HIGH_VALUE is NULL_TREE, then case label was declared using the
5973 usual C/C++ syntax, rather than the GNU case range extension.
5974 CASES is a tree containing all the case ranges processed so far;
5975 COND is the condition for the switch-statement itself. Returns the
5976 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5977 is created. */
5979 tree
5982 {
5983 tree type;
5984 tree label;
5985 tree case_label;
5986 splay_tree_node node;
5988 /* Create the LABEL_DECL itself. */
5991 /* If there was an error processing the switch condition, bail now
5992 before we get more confused. */
6000 {
6003 }
6005 /* Case ranges are a GNU extension. */
6012 {
6017 }
6019 {
6024 }
6027 {
6028 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6029 really a case range, even though it was written that way.
6030 Remove the HIGH_VALUE to simplify later processing. */
6035 }
6037 /* See if the case is in range of the type of the original testing
6038 expression. If both low_value and high_value are out of range,
6039 don't insert the case label and return NULL_TREE. */
6045 /* Look up the LOW_VALUE in the table of case labels we already
6046 have. */
6048 /* If there was not an exact match, check for overlapping ranges.
6049 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6050 that's a `default' label and the only overlap is an exact match. */
6052 {
6053 splay_tree_node low_bound;
6054 splay_tree_node high_bound;
6056 /* Even though there wasn't an exact match, there might be an
6057 overlap between this case range and another case range.
6058 Since we've (inductively) not allowed any overlapping case
6059 ranges, we simply need to find the greatest low case label
6060 that is smaller that LOW_VALUE, and the smallest low case
6061 label that is greater than LOW_VALUE. If there is an overlap
6062 it will occur in one of these two ranges. */
6068 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6069 the LOW_VALUE, so there is no need to check unless the
6070 LOW_BOUND is in fact itself a case range. */
6076 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6077 range is bigger than the low end of the current range, so we
6078 are only interested if the current range is a real range, and
6079 not an ordinary case label. */
6081 && high_value
6083 high_value)
6086 }
6087 /* If there was an overlap, issue an error. */
6089 {
6093 {
6097 }
6099 {
6102 }
6103 else
6104 {
6108 }
6110 }
6112 /* Add a CASE_LABEL to the statement-tree. */
6114 /* Register this case label in the splay tree. */
6121 error_out:
6122 /* Add a label so that the back-end doesn't think that the beginning of
6123 the switch is unreachable. Note that we do not add a case label, as
6124 that just leads to duplicates and thence to failure later on. */
6126 {
6129 }
6131 }
6133 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6134 Used to verify that case values match up with enumerator values. */
6136 static void
6138 {
6145 else
6152 buf);
6153 else
6158 }
6160 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6161 Used to verify that case values match up with enumerator values. */
6163 static int
6165 {
6169 /* Skip default case. */
6173 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6174 when we did our enum->case scan. Reset our scratch bit after. */
6177 else
6180 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6181 not set, that means that CASE_HIGH did not appear when we did our
6182 enum->case scan. Reset our scratch bit after. */
6184 {
6187 else
6189 }
6192 }
6194 /* Handle -Wswitch*. Called from the front end after parsing the
6195 switch construct. */
6196 /* ??? Should probably be somewhere generic, since other languages
6197 besides C and C++ would want this. At the moment, however, C/C++
6198 are the only tree-ssa languages that support enumerations at all,
6199 so the point is moot. */
6201 void
6204 {
6205 splay_tree_node default_node;
6206 splay_tree_node node;
6207 tree chain;
6217 /* From here on, we only care about about enumerated types. */
6221 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6225 /* Check the cases. Warn about case values which are not members of
6226 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6227 there is no default case, check that exactly all enumeration
6228 literals are covered by the cases. */
6230 /* Clearing COND if it is not an integer constant simplifies
6231 the tests inside the loop below. */
6235 /* The time complexity here is O(N*lg(N)) worst case, but for the
6236 common case of monotonically increasing enumerators, it is
6237 O(N), since the nature of the splay tree will keep the next
6238 element adjacent to the root at all times. */
6241 {
6247 {
6248 /* Mark the CASE_LOW part of the case entry as seen. */
6252 }
6254 /* Even though there wasn't an exact match, there might be a
6255 case range which includes the enumerator's value. */
6258 {
6262 {
6263 /* If we match the upper bound exactly, mark the CASE_HIGH
6264 part of the case entry as seen. */
6268 }
6269 }
6271 /* We've now determined that this enumerated literal isn't
6272 handled by the case labels of the switch statement. */
6274 /* If the switch expression is a constant, we only really care
6275 about whether that constant is handled by the switch. */
6279 /* If there is a default_node, the only relevant option is
6280 Wswitch-enum. Otherwise, if both are enabled then we prefer
6281 to warn using -Wswitch because -Wswitch is enabled by -Wall
6282 while -Wswitch-enum is explicit. */
6285 ? OPT_Wswitch_enum
6289 }
6291 /* Warn if there are case expressions that don't correspond to
6292 enumerators. This can occur since C and C++ don't enforce
6293 type-checking of assignments to enumeration variables.
6295 The time complexity here is now always O(N) worst case, since
6296 we should have marked both the lower bound and upper bound of
6297 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6298 above. This scan also resets those fields. */
6301 }
6303 /* Finish an expression taking the address of LABEL (an
6304 IDENTIFIER_NODE). Returns an expression for the address.
6306 LOC is the location for the expression returned. */
6308 tree
6310 {
6311 tree result;
6321 else
6322 {
6325 /* The current function is not necessarily uninlinable.
6326 Computed gotos are incompatible with inlining, but the value
6327 here could be used only in a diagnostic, for example. */
6329 }
6332 }
6333 \f
6335 /* Given a boolean expression ARG, return a tree representing an increment
6336 or decrement (as indicated by CODE) of ARG. The front end must check for
6337 invalid cases (e.g., decrement in C++). */
6338 tree
6340 {
6341 tree val;
6346 {
6369 }
6372 }
6373 \f
6374 /* Built-in macros for stddef.h and stdint.h, that require macros
6375 defined in this file. */
6376 void
6378 {
6441 }
6443 static void
6445 {
6446 /* Fill in the built_in_attributes array. */
6447 #define DEF_ATTR_NULL_TREE(ENUM) \
6448 built_in_attributes[(int) ENUM] = NULL_TREE;
6449 #define DEF_ATTR_INT(ENUM, VALUE) \
6450 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6451 #define DEF_ATTR_STRING(ENUM, VALUE) \
6452 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6453 #define DEF_ATTR_IDENT(ENUM, STRING) \
6454 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6455 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6456 built_in_attributes[(int) ENUM] \
6457 = tree_cons (built_in_attributes[(int) PURPOSE], \
6458 built_in_attributes[(int) VALUE], \
6459 built_in_attributes[(int) CHAIN]);
6461 #undef DEF_ATTR_NULL_TREE
6462 #undef DEF_ATTR_INT
6463 #undef DEF_ATTR_IDENT
6464 #undef DEF_ATTR_TREE_LIST
6465 }
6467 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6468 identifier as an argument, so the front end shouldn't look it up. */
6470 bool
6472 {
6475 /* Unknown attribute that we'll end up ignoring, return true so we
6476 don't complain about an identifier argument. */
6482 else
6484 }
6486 /* Attribute handlers common to C front ends. */
6488 /* Handle a "packed" attribute; arguments as in
6489 struct attribute_spec.handler. */
6491 static tree
6494 {
6496 {
6500 }
6502 {
6504 /* Still pack bitfields. */
6509 else
6511 }
6512 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6513 used for DECL_REGISTER. It wouldn't mean anything anyway.
6514 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6515 that changes what the typedef is typing. */
6516 else
6517 {
6520 }
6523 }
6525 /* Handle a "nocommon" attribute; arguments as in
6526 struct attribute_spec.handler. */
6528 static tree
6532 {
6535 else
6536 {
6539 }
6542 }
6544 /* Handle a "common" attribute; arguments as in
6545 struct attribute_spec.handler. */
6547 static tree
6550 {
6553 else
6554 {
6557 }
6560 }
6562 /* Handle a "noreturn" attribute; arguments as in
6563 struct attribute_spec.handler. */
6565 static tree
6568 {
6571 /* See FIXME comment in c_common_attribute_table. */
6578 = build_pointer_type
6581 else
6582 {
6585 }
6588 }
6590 /* Handle a "hot" and attribute; arguments as in
6591 struct attribute_spec.handler. */
6593 static tree
6596 {
6599 {
6601 {
6605 }
6606 /* Most of the rest of the hot processing is done later with
6607 lookup_attribute. */
6608 }
6609 else
6610 {
6613 }
6616 }
6618 /* Handle a "cold" and attribute; arguments as in
6619 struct attribute_spec.handler. */
6621 static tree
6624 {
6627 {
6629 {
6633 }
6634 /* Most of the rest of the cold processing is done later with
6635 lookup_attribute. */
6636 }
6637 else
6638 {
6641 }
6644 }
6646 /* Handle a "no_sanitize_address" attribute; arguments as in
6647 struct attribute_spec.handler. */
6649 static tree
6652 {
6654 {
6657 }
6660 }
6662 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6663 struct attribute_spec.handler. */
6665 static tree
6668 {
6677 }
6679 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6680 struct attribute_spec.handler. */
6682 static tree
6685 {
6687 {
6690 }
6693 }
6695 /* Handle a "noinline" attribute; arguments as in
6696 struct attribute_spec.handler. */
6698 static tree
6702 {
6704 {
6706 {
6710 }
6711 else
6713 }
6714 else
6715 {
6718 }
6721 }
6723 /* Handle a "noclone" attribute; arguments as in
6724 struct attribute_spec.handler. */
6726 static tree
6730 {
6732 {
6735 }
6738 }
6740 /* Handle a "always_inline" attribute; arguments as in
6741 struct attribute_spec.handler. */
6743 static tree
6748 {
6750 {
6752 {
6756 }
6757 else
6758 /* Set the attribute and mark it for disregarding inline
6759 limits. */
6761 }
6762 else
6763 {
6766 }
6769 }
6771 /* Handle a "gnu_inline" attribute; arguments as in
6772 struct attribute_spec.handler. */
6774 static tree
6779 {
6781 {
6782 /* Do nothing else, just set the attribute. We'll get at
6783 it later with lookup_attribute. */
6784 }
6785 else
6786 {
6789 }
6792 }
6794 /* Handle a "leaf" attribute; arguments as in
6795 struct attribute_spec.handler. */
6797 static tree
6801 {
6803 {
6806 }
6808 {
6811 }
6814 }
6816 /* Handle an "artificial" attribute; arguments as in
6817 struct attribute_spec.handler. */
6819 static tree
6824 {
6826 {
6827 /* Do nothing else, just set the attribute. We'll get at
6828 it later with lookup_attribute. */
6829 }
6830 else
6831 {
6834 }
6837 }
6839 /* Handle a "flatten" attribute; arguments as in
6840 struct attribute_spec.handler. */
6842 static tree
6844 tree args ATTRIBUTE_UNUSED,
6846 {
6848 /* Do nothing else, just set the attribute. We'll get at
6849 it later with lookup_attribute. */
6850 ;
6851 else
6852 {
6855 }
6858 }
6860 /* Handle a "warning" or "error" attribute; arguments as in
6861 struct attribute_spec.handler. */
6863 static tree
6866 {
6869 /* Do nothing else, just set the attribute. We'll get at
6870 it later with lookup_attribute. */
6871 ;
6872 else
6873 {
6876 }
6879 }
6881 /* Handle a "used" attribute; arguments as in
6882 struct attribute_spec.handler. */
6884 static tree
6887 {
6893 {
6898 }
6899 else
6900 {
6903 }
6906 }
6908 /* Handle a "unused" attribute; arguments as in
6909 struct attribute_spec.handler. */
6911 static tree
6914 {
6916 {
6924 {
6929 }
6930 else
6931 {
6934 }
6935 }
6936 else
6937 {
6941 }
6944 }
6946 /* Handle a "externally_visible" attribute; arguments as in
6947 struct attribute_spec.handler. */
6949 static tree
6954 {
6958 {
6961 {
6965 }
6966 }
6967 else
6968 {
6971 }
6974 }
6976 /* Handle a "const" attribute; arguments as in
6977 struct attribute_spec.handler. */
6979 static tree
6982 {
6985 /* See FIXME comment on noreturn in c_common_attribute_table. */
6991 = build_pointer_type
6994 else
6995 {
6998 }
7001 }
7003 /* Handle a "transparent_union" attribute; arguments as in
7004 struct attribute_spec.handler. */
7006 static tree
7010 {
7011 tree type;
7022 {
7023 /* Make sure that the first field will work for a transparent union.
7024 If the type isn't complete yet, leave the check to the code in
7025 finish_struct. */
7027 {
7033 }
7036 {
7037 /* If the type isn't complete yet, setting the flag
7038 on a variant wouldn't ever be checked. */
7042 /* build_duplicate_type doesn't work for C++. */
7046 /* A type variant isn't good enough, since we don't a cast
7047 to such a type removed as a no-op. */
7049 }
7053 }
7055 ignored:
7058 }
7060 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7061 get the requested priority for a constructor or destructor,
7062 possibly issuing diagnostics for invalid or reserved
7063 priorities. */
7065 static priority_type
7067 {
7068 HOST_WIDE_INT pri;
7069 tree arg;
7075 {
7078 else
7081 }
7098 {
7101 "destructor priorities from 0 to %d are reserved "
7103 MAX_RESERVED_INIT_PRIORITY);
7104 else
7106 "constructor priorities from 0 to %d are reserved "
7108 MAX_RESERVED_INIT_PRIORITY);
7109 }
7112 invalid:
7115 MAX_INIT_PRIORITY);
7116 else
7118 MAX_INIT_PRIORITY);
7120 }
7122 /* Handle a "constructor" attribute; arguments as in
7123 struct attribute_spec.handler. */
7125 static tree
7129 {
7136 {
7137 priority_type priority;
7142 }
7143 else
7144 {
7147 }
7150 }
7152 /* Handle a "destructor" attribute; arguments as in
7153 struct attribute_spec.handler. */
7155 static tree
7159 {
7166 {
7167 priority_type priority;
7172 }
7173 else
7174 {
7177 }
7180 }
7182 /* Nonzero if the mode is a valid vector mode for this architecture.
7183 This returns nonzero even if there is no hardware support for the
7184 vector mode, but we can emulate with narrower modes. */
7186 static int
7188 {
7192 /* Doh! What's going on? */
7201 /* Hardware support. Woo hoo! */
7207 /* We should probably return 1 if requesting V4DI and we have no DI,
7208 but we have V2DI, but this is probably very unlikely. */
7210 /* If we have support for the inner mode, we can safely emulate it.
7211 We may not have V2DI, but me can emulate with a pair of DIs. */
7213 }
7216 /* Handle a "mode" attribute; arguments as in
7217 struct attribute_spec.handler. */
7219 static tree
7222 {
7230 else
7231 {
7236 tree typefm;
7241 {
7247 }
7249 /* Change this type to have a type with the specified mode.
7250 First check for the special modes. */
7263 else
7266 {
7269 }
7272 {
7275 }
7279 {
7311 }
7313 {
7316 }
7319 {
7324 {
7327 }
7331 else
7334 }
7335 else
7336 {
7337 /* For fixed-point modes, we need to test if the signness of type
7338 and the machine mode are consistent. */
7341 {
7344 }
7345 /* For fixed-point modes, we need to pass saturating info. */
7349 }
7352 {
7355 }
7357 {
7358 /* For enumeral types, copy the precision from the integer
7359 type returned above. If not an INTEGER_TYPE, we can't use
7360 this mode for this type. */
7362 {
7365 }
7368 {
7371 }
7372 else
7373 {
7374 /* We cannot build a type variant, as there's code that assumes
7375 that TYPE_MAIN_VARIANT has the same mode. This includes the
7376 debug generators. Instead, create a subrange type. This
7377 results in all of the enumeral values being emitted only once
7378 in the original, and the subtype gets them by reference. */
7381 else
7384 }
7385 }
7389 {
7392 }
7395 }
7398 }
7400 /* Handle a "section" attribute; arguments as in
7401 struct attribute_spec.handler. */
7403 static tree
7406 {
7410 {
7416 {
7420 {
7422 "section attribute cannot be specified for "
7425 }
7427 /* The decl may have already been given a section attribute
7428 from a previous declaration. Ensure they match. */
7432 {
7436 }
7440 {
7443 }
7444 else
7447 }
7448 else
7449 {
7452 }
7453 }
7454 else
7455 {
7459 }
7462 }
7464 /* Check whether ALIGN is a valid user-specified alignment. If so,
7465 return its base-2 log; if not, output an error and return -1. If
7466 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7467 no error. */
7468 int
7470 {
7477 {
7480 }
7485 {
7488 }
7490 {
7493 }
7495 }
7497 /*
7498 If in c++-11, check if the c++-11 alignment constraint with respect
7499 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7500 c++-11 mode, does nothing.
7502 [dcl.align]2/ says:
7504 [* if the constant expression evaluates to a fundamental alignment,
7505 the alignment requirement of the declared entity shall be the
7506 specified fundamental alignment.
7508 * if the constant expression evaluates to an extended alignment
7509 and the implementation supports that alignment in the context
7510 of the declaration, the alignment of the declared entity shall
7511 be that alignment
7513 * if the constant expression evaluates to an extended alignment
7514 and the implementation does not support that alignment in the
7515 context of the declaration, the program is ill-formed]. */
7517 static bool
7521 {
7534 {
7536 {
7537 /* For file scope variables and static members, the target
7538 supports alignments that are at most
7539 MAX_OFILE_ALIGNMENT. */
7542 }
7543 else
7544 {
7545 #ifdef BIGGEST_FIELD_ALIGNMENT
7546 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7547 #else
7548 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7549 #endif
7550 /* For non-static members, the target supports either
7551 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7552 if it is defined or BIGGEST_ALIGNMENT. */
7557 #undef MAX_TARGET_FIELD_ALIGNMENT
7558 /* For stack variables, the target supports at most
7559 MAX_STACK_ALIGNMENT. */
7563 }
7564 }
7566 {
7567 /* Let's be liberal for types. */
7570 }
7578 }
7580 /* Handle a "aligned" attribute; arguments as in
7581 struct attribute_spec.handler. */
7583 static tree
7586 {
7590 tree align_expr;
7594 {
7599 }
7600 else
7604 {
7608 }
7616 {
7619 /* If we have a TYPE_DECL, then copy the type, so that we
7620 don't accidentally modify a builtin type. See pushdecl. */
7623 {
7630 }
7631 else
7636 }
7639 {
7642 }
7645 /* C++-11 [dcl.align/4]:
7647 When multiple alignment-specifiers are specified for an
7648 entity, the alignment requirement shall be set to the
7649 strictest specified alignment.
7651 This formally comes from the c++11 specification but we are
7652 doing it for the GNU attribute syntax as well. */
7656 {
7661 else
7665 }
7666 else
7667 {
7670 }
7673 }
7675 /* Handle a "weak" attribute; arguments as in
7676 struct attribute_spec.handler. */
7678 static tree
7683 {
7686 {
7689 }
7691 {
7695 }
7699 else
7703 }
7705 /* Handle an "alias" or "ifunc" attribute; arguments as in
7706 struct attribute_spec.handler, except that IS_ALIAS tells us
7707 whether this is an alias as opposed to ifunc attribute. */
7709 static tree
7712 {
7717 {
7720 }
7724 /* A static variable declaration is always a tentative definition,
7725 but the alias is a non-tentative definition which overrides. */
7728 {
7732 }
7736 {
7740 }
7742 /* Note that the very first time we process a nested declaration,
7743 decl_function_context will not be set. Indeed, *would* never
7744 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7745 we do below. After such frobbery, pushdecl would set the context.
7746 In any case, this is never what we want. */
7748 {
7749 tree id;
7753 {
7757 }
7759 /* This counts as a use of the object pointed to. */
7764 else
7768 /* ifuncs are also aliases, so set that attribute too. */
7771 }
7772 else
7773 {
7776 }
7779 }
7781 /* Handle an "alias" or "ifunc" attribute; arguments as in
7782 struct attribute_spec.handler. */
7784 static tree
7787 {
7789 }
7791 /* Handle an "alias" or "ifunc" attribute; arguments as in
7792 struct attribute_spec.handler. */
7794 static tree
7797 {
7799 }
7801 /* Handle a "weakref" attribute; arguments as in struct
7802 attribute_spec.handler. */
7804 static tree
7807 {
7810 /* We must ignore the attribute when it is associated with
7811 local-scoped decls, since attribute alias is ignored and many
7812 such symbols do not even have a DECL_WEAK field. */
7814 || current_function_decl
7816 {
7820 }
7823 {
7827 }
7829 /* The idea here is that `weakref("name")' mutates into `weakref,
7830 alias("name")', and weakref without arguments, in turn,
7831 implicitly adds weak. */
7834 {
7841 }
7842 else
7843 {
7848 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7849 and that isn't supported; and because it wants to add it to
7850 the list of weak decls, which isn't helpful. */
7852 }
7855 }
7857 /* Handle an "visibility" attribute; arguments as in
7858 struct attribute_spec.handler. */
7860 static tree
7864 {
7870 {
7874 {
7876 name);
7878 }
7880 {
7884 }
7885 }
7887 {
7890 }
7893 {
7896 }
7898 /* If this is a type, set the visibility on the type decl. */
7900 {
7905 {
7907 name);
7909 }
7910 }
7920 else
7921 {
7922 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7924 }
7928 {
7942 }
7947 /* Go ahead and attach the attribute to the node as well. This is needed
7948 so we can determine whether we have VISIBILITY_DEFAULT because the
7949 visibility was not specified, or because it was explicitly overridden
7950 from the containing scope. */
7953 }
7955 /* Determine the ELF symbol visibility for DECL, which is either a
7956 variable or a function. It is an error to use this function if a
7957 definition of DECL is not available in this translation unit.
7958 Returns true if the final visibility has been determined by this
7959 function; false if the caller is free to make additional
7960 modifications. */
7962 bool
7964 {
7968 /* If the user explicitly specified the visibility with an
7969 attribute, honor that. DECL_VISIBILITY will have been set during
7970 the processing of the attribute. We check for an explicit
7971 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7972 to distinguish the use of an attribute from the use of a "#pragma
7973 GCC visibility push(...)"; in the latter case we still want other
7974 considerations to be able to overrule the #pragma. */
7976 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7981 /* Set default visibility to whatever the user supplied with
7982 visibility_specified depending on #pragma GCC visibility. */
7984 {
7987 {
7990 /* If visibility changed and DECL already has DECL_RTL, ensure
7991 symbol flags are updated. */
7996 }
7997 }
7999 }
8001 /* Handle an "tls_model" attribute; arguments as in
8002 struct attribute_spec.handler. */
8004 static tree
8007 {
8008 tree id;
8015 {
8018 }
8023 {
8026 }
8036 else
8037 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8041 }
8043 /* Handle a "no_instrument_function" attribute; arguments as in
8044 struct attribute_spec.handler. */
8046 static tree
8051 {
8055 {
8059 }
8060 else
8064 }
8066 /* Handle a "malloc" attribute; arguments as in
8067 struct attribute_spec.handler. */
8069 static tree
8072 {
8076 else
8077 {
8080 }
8083 }
8085 /* Handle a "alloc_size" attribute; arguments as in
8086 struct attribute_spec.handler. */
8088 static tree
8091 {
8094 {
8101 || !arg_count
8103 {
8108 }
8109 }
8111 }
8113 /* Handle a "alloc_align" attribute; arguments as in
8114 struct attribute_spec.handler. */
8116 static tree
8119 {
8126 || !arg_count
8128 {
8133 }
8135 }
8137 /* Handle a "assume_aligned" attribute; arguments as in
8138 struct attribute_spec.handler. */
8140 static tree
8143 {
8145 {
8152 {
8157 }
8158 }
8160 }
8162 /* Handle a "fn spec" attribute; arguments as in
8163 struct attribute_spec.handler. */
8165 static tree
8169 {
8174 }
8176 /* Handle a "warn_unused" attribute; arguments as in
8177 struct attribute_spec.handler. */
8179 static tree
8181 tree args ATTRIBUTE_UNUSED,
8183 {
8185 /* Do nothing else, just set the attribute. We'll get at
8186 it later with lookup_attribute. */
8187 ;
8188 else
8189 {
8192 }
8195 }
8197 /* Handle an "omp declare simd" attribute; arguments as in
8198 struct attribute_spec.handler. */
8200 static tree
8202 {
8204 }
8206 /* Handle an "omp declare target" attribute; arguments as in
8207 struct attribute_spec.handler. */
8209 static tree
8211 {
8213 }
8215 /* Handle a "returns_twice" attribute; arguments as in
8216 struct attribute_spec.handler. */
8218 static tree
8221 {
8224 else
8225 {
8228 }
8231 }
8233 /* Handle a "no_limit_stack" attribute; arguments as in
8234 struct attribute_spec.handler. */
8236 static tree
8241 {
8245 {
8249 }
8251 {
8255 }
8256 else
8260 }
8262 /* Handle a "pure" attribute; arguments as in
8263 struct attribute_spec.handler. */
8265 static tree
8268 {
8271 /* ??? TODO: Support types. */
8272 else
8273 {
8276 }
8279 }
8281 /* Digest an attribute list destined for a transactional memory statement.
8282 ALLOWED is the set of attributes that are allowed for this statement;
8283 return the attribute we parsed. Multiple attributes are never allowed. */
8285 int
8287 {
8292 {
8300 {
8303 }
8306 {
8309 }
8312 else
8314 }
8317 }
8319 /* Transform a TM attribute name into a maskable integer and back.
8320 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8321 to how the lack of an attribute is treated. */
8323 int
8325 {
8339 }
8341 tree
8343 {
8346 {
8364 }
8366 }
8368 /* Return the first TM attribute seen in LIST. */
8370 tree
8372 {
8374 {
8378 }
8380 }
8382 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8383 Here we accept only function types, and verify that none of the other
8384 function TM attributes are also applied. */
8385 /* ??? We need to accept class types for C++, but not C. This greatly
8386 complicates this function, since we can no longer rely on the extra
8387 processing given by function_type_required. */
8389 static tree
8392 {
8393 /* Only one path adds the attribute; others don't. */
8397 {
8400 /* Only tm_callable and tm_safe apply to classes. */
8403 /* FALLTHRU */
8407 {
8410 ;
8413 else
8415 }
8419 {
8422 {
8427 }
8428 }
8429 /* FALLTHRU */
8432 /* If a function is next, pass it on to be tried next. */
8436 ignored:
8439 }
8442 }
8444 /* Handle the TM_WRAP attribute; arguments as in
8445 struct attribute_spec.handler. */
8447 static tree
8450 {
8453 /* We don't need the attribute even on success, since we
8454 record the entry in an external table. */
8459 else
8460 {
8463 ;
8468 else
8469 {
8473 {
8477 else
8479 }
8480 else
8482 }
8483 }
8486 }
8488 /* Ignore the given attribute. Used when this attribute may be usefully
8489 overridden by the target, but is not used generically. */
8491 static tree
8495 {
8498 }
8500 /* Handle a "no vops" attribute; arguments as in
8501 struct attribute_spec.handler. */
8503 static tree
8507 {
8511 }
8513 /* Handle a "deprecated" attribute; arguments as in
8514 struct attribute_spec.handler. */
8516 static tree
8520 {
8528 {
8531 }
8534 {
8545 else
8547 }
8549 {
8554 }
8555 else
8559 {
8562 {
8568 }
8571 else
8573 }
8576 }
8578 /* Handle a "vector_size" attribute; arguments as in
8579 struct attribute_spec.handler. */
8581 static tree
8585 {
8598 {
8601 }
8603 /* Get the vector size (in bytes). */
8606 /* We need to provide for vector pointers, vector arrays, and
8607 functions returning vectors. For example:
8609 __attribute__((vector_size(16))) short *foo;
8611 In this case, the mode is SI, but the type being modified is
8612 HI, so we need to look further. */
8621 /* Get the mode of the type being modified. */
8632 {
8635 }
8638 {
8641 }
8644 {
8647 }
8649 /* Calculate how many units fit in the vector. */
8652 {
8655 }
8659 /* Build back pointers if needed. */
8663 }
8665 /* Handle the "nonnull" attribute. */
8666 static tree
8670 {
8674 /* If no arguments are specified, all pointer arguments should be
8675 non-null. Verify a full prototype is given so that the arguments
8676 will have the correct types when we actually check them later. */
8678 {
8680 {
8683 }
8685 }
8687 /* Argument list specified. Verify that each argument number references
8688 a pointer argument. */
8690 {
8699 {
8704 }
8707 {
8708 function_args_iterator iter;
8709 tree argument;
8713 {
8717 }
8721 {
8726 }
8729 {
8734 }
8735 }
8736 }
8739 }
8741 /* Check the argument list of a function call for null in argument slots
8742 that are marked as requiring a non-null pointer argument. The NARGS
8743 arguments are passed in the array ARGARRAY.
8744 */
8746 static void
8748 {
8749 tree a;
8757 /* See if any of the nonnull attributes has no arguments. If so,
8758 then every pointer argument is checked (in which case the check
8759 for pointer type is done in check_nonnull_arg). */
8761 do
8769 else
8770 {
8771 /* Walk the argument list. If we encounter an argument number we
8772 should check for non-null, do it. */
8774 {
8776 {
8780 }
8785 }
8786 }
8787 }
8789 /* Check that the Nth argument of a function call (counting backwards
8790 from the end) is a (pointer)0. The NARGS arguments are passed in the
8791 array ARGARRAY. */
8793 static void
8795 {
8799 {
8802 tree sentinel;
8803 function_args_iterator iter;
8804 tree t;
8806 /* Skip over the named arguments. */
8808 {
8811 len++;
8812 }
8815 {
8818 }
8820 /* The sentinel must be one of the varargs, i.e.
8821 in position >= the number of fixed arguments. */
8823 {
8827 }
8829 /* Validate the sentinel. */
8833 /* Although __null (in C++) is only an integer we allow it
8834 nevertheless, as we are guaranteed that it's exactly
8835 as wide as a pointer, and we don't want to force
8836 users to cast the NULL they have written there.
8837 We warn with -Wstrict-null-sentinel, though. */
8840 }
8841 }
8843 /* Helper for check_function_nonnull; given a list of operands which
8844 must be non-null in ARGS, determine if operand PARAM_NUM should be
8845 checked. */
8847 static bool
8849 {
8853 {
8860 }
8862 }
8864 /* Check that the function argument PARAM (which is operand number
8865 PARAM_NUM) is non-null. This is called by check_function_nonnull
8866 via check_function_arguments_recurse. */
8868 static void
8871 {
8872 /* Just skip checking the argument if it's not a pointer. This can
8873 happen if the "nonnull" attribute was given without an operand
8874 list (which means to check every pointer argument). */
8882 }
8884 /* Helper for nonnull attribute handling; fetch the operand number
8885 from the attribute argument list. */
8887 static bool
8889 {
8890 /* Verify the arg number is a small constant. */
8892 {
8895 }
8896 else
8898 }
8900 /* Handle a "nothrow" attribute; arguments as in
8901 struct attribute_spec.handler. */
8903 static tree
8906 {
8909 /* ??? TODO: Support types. */
8910 else
8911 {
8914 }
8917 }
8919 /* Handle a "cleanup" attribute; arguments as in
8920 struct attribute_spec.handler. */
8922 static tree
8925 {
8929 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8930 for global destructors in C++. This requires infrastructure that
8931 we don't have generically at the moment. It's also not a feature
8932 we'd be missing too much, since we do have attribute constructor. */
8934 {
8938 }
8940 /* Verify that the argument is a function in scope. */
8941 /* ??? We could support pointers to functions here as well, if
8942 that was considered desirable. */
8945 {
8949 }
8952 {
8956 }
8958 /* That the function has proper type is checked with the
8959 eventual call to build_function_call. */
8962 }
8964 /* Handle a "warn_unused_result" attribute. No special handling. */
8966 static tree
8970 {
8971 /* Ignore the attribute for functions not returning any value. */
8973 {
8976 }
8979 }
8981 /* Handle a "sentinel" attribute. */
8983 static tree
8986 {
8988 {
8992 }
8993 else
8994 {
8996 {
9000 }
9001 }
9004 {
9012 {
9016 }
9017 else
9018 {
9020 {
9024 }
9025 }
9026 }
9029 }
9031 /* Handle a "type_generic" attribute. */
9033 static tree
9037 {
9038 /* Ensure we have a function type. */
9041 /* Ensure we have a variadic function. */
9045 }
9047 /* Handle a "target" attribute. */
9049 static tree
9052 {
9053 /* Ensure we have a function type. */
9055 {
9058 }
9060 flags))
9064 }
9066 /* Arguments being collected for optimization. */
9071 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9072 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9073 false for #pragma GCC optimize. */
9075 bool
9077 {
9085 tree ap;
9087 /* Build up argv vector. Just in case the string is stored away, use garbage
9088 collected strings. */
9093 {
9097 {
9101 }
9104 {
9105 /* Split string into multiple substrings. */
9113 {
9120 {
9124 }
9125 else
9126 {
9129 }
9133 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9134 options. */
9136 {
9141 else
9145 }
9148 {
9151 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9152 itself is -Os, and any other switch begins with a -f. */
9158 }
9163 }
9165 }
9166 }
9176 /* Now parse the options. */
9186 /* Don't allow changing -fstrict-aliasing. */
9191 }
9193 /* For handling "optimize" attribute. arguments as in
9194 struct attribute_spec.handler. */
9196 static tree
9199 {
9200 /* Ensure we have a function type. */
9202 {
9205 }
9206 else
9207 {
9211 /* Save current options. */
9214 /* If we previously had some optimization options, use them as the
9215 default. */
9220 /* Parse options, and update the vector. */
9225 /* Restore current options. */
9227 }
9230 }
9232 /* Handle a "no_split_stack" attribute. */
9234 static tree
9239 {
9243 {
9247 }
9249 {
9253 }
9256 }
9258 /* Handle a "returns_nonnull" attribute; arguments as in
9259 struct attribute_spec.handler. */
9261 static tree
9264 {
9265 // Even without a prototype we still have a return type we can check.
9267 {
9270 }
9272 }
9274 \f
9275 /* Check for valid arguments being passed to a function with FNTYPE.
9276 There are NARGS arguments in the array ARGARRAY. */
9277 void
9279 {
9280 /* Check for null being passed in a pointer argument that must be
9281 non-null. We also need to do this if format checking is enabled. */
9286 /* Check for errors in format strings. */
9293 }
9295 /* Generic argument checking recursion routine. PARAM is the argument to
9296 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9297 once the argument is resolved. CTX is context for the callback. */
9298 void
9303 {
9307 {
9308 /* Strip coercion. */
9312 }
9315 {
9317 tree attrs;
9320 /* See if this is a call to a known internationalization function
9321 that modifies a format arg. Such a function may have multiple
9322 format_arg attributes (for example, ngettext). */
9325 attrs;
9328 {
9329 tree inner_arg;
9330 tree format_num_expr;
9333 call_expr_arg_iterator iter;
9335 /* Extract the argument number, which was previously checked
9336 to be valid. */
9345 {
9350 }
9351 }
9353 /* If we found a format_arg attribute and did a recursive check,
9354 we are done with checking this argument. Otherwise, we continue
9355 and this will be considered a non-literal. */
9358 }
9361 {
9362 /* Check both halves of the conditional expression. */
9368 }
9371 }
9373 /* Checks for a builtin function FNDECL that the number of arguments
9374 NARGS against the required number REQUIRED and issues an error if
9375 there is a mismatch. Returns true if the number of arguments is
9376 correct, otherwise false. */
9378 static bool
9380 {
9382 {
9386 }
9388 {
9392 }
9394 }
9396 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9397 Returns false if there was an error, otherwise true. */
9399 bool
9401 {
9407 {
9417 {
9419 {
9423 }
9425 }
9435 {
9442 {
9446 }
9448 }
9453 {
9458 {
9462 }
9465 {
9467 fndecl);
9469 }
9471 }
9476 {
9478 {
9481 }
9483 }
9488 }
9489 }
9491 /* Function to help qsort sort FIELD_DECLs by name order. */
9493 int
9495 {
9500 /* A nontype is "greater" than a type. */
9509 }
9512 gt_pointer_operator new_value;
9516 /* This routine compares two fields like field_decl_cmp but using the
9517 pointer operator in resort_data. */
9519 static int
9521 {
9526 /* A nontype is "greater" than a type. */
9532 {
9539 }
9541 }
9543 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9545 void
9548 gt_pointer_operator new_value,
9550 {
9555 resort_field_decl_cmp);
9556 }
9558 /* Subroutine of c_parse_error.
9559 Return the result of concatenating LHS and RHS. RHS is really
9560 a string literal, its first character is indicated by RHS_START and
9561 RHS_SIZE is its length (including the terminating NUL character).
9563 The caller is responsible for deleting the returned pointer. */
9567 {
9573 }
9575 /* Issue the error given by GMSGID, indicating that it occurred before
9576 TOKEN, which had the associated VALUE. */
9578 void
9581 {
9582 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9592 {
9597 {
9610 }
9614 else
9620 }
9642 {
9647 }
9655 {
9660 }
9661 else
9665 {
9668 }
9669 #undef catenate_messages
9670 }
9672 /* Mapping for cpp message reasons to the options that enable them. */
9674 struct reason_option_codes_t
9675 {
9678 };
9699 };
9701 /* Return the gcc option code associated with the reason for a cpp
9702 message, or 0 if none. */
9704 static int
9706 {
9710 {
9713 }
9715 }
9717 /* Callback from cpp_error for PFILE to print diagnostics from the
9718 preprocessor. The diagnostic is of type LEVEL, with REASON set
9719 to the reason code if LEVEL is represents a warning, at location
9720 LOCATION unless this is after lexing and the compiler's location
9721 should be used instead, with column number possibly overridden by
9722 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9723 the arguments. Returns true if a diagnostic was emitted, false
9724 otherwise. */
9726 bool
9730 {
9731 diagnostic_info diagnostic;
9732 diagnostic_t dlevel;
9737 {
9742 /* Fall through. */
9767 }
9780 }
9782 /* Convert a character from the host to the target execution character
9783 set. cpplib handles this, mostly. */
9785 HOST_WIDE_INT
9787 {
9788 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9789 zero-extended under -fno-signed-char. cpplib insists that characters
9790 and character constants are always unsigned. Hence we must convert
9791 back and forth. */
9799 else
9801 }
9803 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9804 references with an INDIRECT_REF of a constant at the bottom; much like the
9805 traditional rendering of offsetof as a macro. Return the folded result. */
9807 tree
9809 {
9813 {
9829 {
9832 }
9842 {
9846 }
9859 /* Check if the offset goes beyond the upper bound of the array. */
9861 {
9867 {
9871 {
9872 tree v;
9879 {
9887 }
9888 /* Don't warn if the array might be considered a poor
9889 man's flexible array member with a very permissive
9890 definition thereof. */
9894 "index %E denotes an offset "
9897 }
9898 }
9899 }
9906 /* Handle static members of volatile structs. */
9913 }
9916 }
9918 /* Likewise, but convert it to the return type of offsetof. */
9920 tree
9922 {
9924 }
9926 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9927 expression, because B will always be true. */
9929 void
9931 {
9934 "the omitted middle operand in ?: will always be %<true%>, "
9936 }
9938 /* Give an error for storing into ARG, which is 'const'. USE indicates
9939 how ARG was being used. */
9941 void
9943 {
9946 /* Using this macro rather than (for example) arrays of messages
9947 ensures that all the format strings are checked at compile
9948 time. */
9949 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9950 : (use == lv_increment ? (I) \
9951 : (use == lv_decrement ? (D) : (AS))))
9953 {
9964 else
9970 }
9976 arg);
9982 arg);
9984 {
9994 arg);
9995 }
10001 arg);
10002 else
10007 arg);
10008 }
10010 /* Print an error message for an invalid lvalue. USE says
10011 how the lvalue is being used and so selects the error message. LOC
10012 is the location for the error. */
10014 void
10016 {
10018 {
10036 }
10037 }
10039 /* Print an error message for an invalid indirection of type TYPE.
10040 ERRSTRING is the name of the operator for the indirection. */
10042 void
10044 {
10046 {
10054 type);
10059 type);
10064 type);
10069 type);
10074 type);
10078 }
10079 }
10080 \f
10081 /* *PTYPE is an incomplete array. Complete it with a domain based on
10082 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10083 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10084 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10086 int
10088 {
10096 {
10098 {
10099 int eltsize
10102 }
10104 {
10108 {
10112 }
10113 else
10114 {
10115 tree curindex;
10126 {
10130 else
10131 {
10133 {
10134 /* Since we treat size types now as ordinary
10135 unsigned types, we need an explicit overflow
10136 check. */
10140 }
10142 size_one_node);
10143 }
10146 }
10148 {
10152 }
10153 }
10154 }
10155 else
10156 {
10157 /* Make an error message unless that happened already. */
10160 }
10161 }
10162 else
10163 {
10167 }
10174 else
10177 /* Using build_distinct_type_copy and modifying things afterward instead
10178 of using build_array_type to create a new type preserves all of the
10179 TYPE_LANG_FLAG_? bits that the front end may have set. */
10187 /* Make sure we have the canonical MAIN_TYPE. */
10190 hashcode);
10193 /* Fix the canonical type. */
10203 else
10208 else
10214 {
10216 /* If we proceed with the array type as it is, we'll eventually
10217 crash in tree_to_[su]hwi(). */
10219 }
10223 }
10225 /* Like c_mark_addressable but don't check register qualifier. */
10226 void
10228 {
10234 }
10237 \f
10238 /* Used to help initialize the builtin-types.def table. When a type of
10239 the correct size doesn't exist, use error_mark_node instead of NULL.
10240 The later results in segfaults even when a decl using the type doesn't
10241 get invoked. */
10243 tree
10245 {
10248 }
10250 /* A helper function for resolve_overloaded_builtin in resolving the
10251 overloaded __sync_ builtins. Returns a positive power of 2 if the
10252 first operand of PARAMS is a pointer to a supported data type.
10253 Returns 0 if an error is encountered. */
10255 static int
10257 {
10258 tree type;
10262 {
10265 }
10269 {
10270 /* Force array-to-pointer decay for C++. */
10274 }
10286 incompatible:
10289 }
10291 /* A helper function for resolve_overloaded_builtin. Adds casts to
10292 PARAMS to make arguments match up with those of FUNCTION. Drops
10293 the variadic arguments at the end. Returns false if some error
10294 was encountered; true on success. */
10296 static bool
10299 {
10300 function_args_iterator iter;
10301 tree ptype;
10305 /* We've declared the implementation functions to use "volatile void *"
10306 as the pointer parameter, so we shouldn't get any complaints from the
10307 call to check_function_arguments what ever type the user used. */
10312 /* For the rest of the values, we need to cast these to FTYPE, so that we
10313 don't get warnings for passing pointer types, etc. */
10316 {
10320 /* XXX void_type_node belies the abstraction. */
10326 {
10329 }
10331 /* Only convert parameters if arg_type is unsigned integer type with
10332 new format sync routines, i.e. don't attempt to convert pointer
10333 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10334 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10335 kinds). */
10337 {
10338 /* Ideally for the first conversion we'd use convert_for_assignment
10339 so that we get warnings for anything that doesn't match the pointer
10340 type. This isn't portable across the C and C++ front ends atm. */
10345 }
10348 }
10350 /* __atomic routines are not variadic. */
10352 {
10355 }
10357 /* The definition of these primitives is variadic, with the remaining
10358 being "an optional list of variables protected by the memory barrier".
10359 No clue what that's supposed to mean, precisely, but we consider all
10360 call-clobbered variables to be protected so we're safe. */
10364 }
10366 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10367 RESULT to make it match the type of the first pointer argument in
10368 PARAMS. */
10370 static tree
10372 {
10377 /* New format doesn't require casting unless the types are the same size. */
10380 else
10382 }
10384 /* This function verifies the PARAMS to generic atomic FUNCTION.
10385 It returns the size if all the parameters are the same size, otherwise
10386 0 is returned if the parameters are invalid. */
10388 static int
10391 {
10396 tree type_0;
10398 /* Determine the parameter makeup. */
10400 {
10416 }
10419 {
10422 }
10424 /* Get type of first parameter, and determine its size. */
10427 {
10428 /* Force array-to-pointer decay for C++. */
10432 }
10434 {
10436 function);
10438 }
10440 /* Types must be compile time constant sizes. */
10442 {
10445 function);
10447 }
10451 /* Zero size objects are not allowed. */
10453 {
10456 function);
10458 }
10460 /* Check each other parameter is a pointer and the same size. */
10462 {
10465 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10469 {
10471 function);
10473 }
10476 {
10478 function);
10480 }
10481 }
10483 /* Check memory model parameters for validity. */
10485 {
10488 {
10491 {
10494 function);
10495 }
10496 }
10497 else
10499 {
10501 function);
10503 }
10504 }
10507 }
10510 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10511 at the beginning of the parameter list PARAMS representing the size of the
10512 objects. This is to match the library ABI requirement. LOC is the location
10513 of the function call.
10514 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10515 returned to allow the external call to be constructed. */
10517 static tree
10520 {
10521 tree size_node;
10523 /* Insert a SIZE_T parameter as the first param. If there isn't
10524 enough space, allocate a new vector and recursively re-build with that. */
10526 {
10529 tree f;
10539 }
10541 /* Add the size parameter and leave as a function call for processing. */
10545 }
10548 /* Return whether atomic operations for naturally aligned N-byte
10549 arguments are supported, whether inline or through libatomic. */
10550 static bool
10552 {
10554 {
10566 }
10567 }
10569 /* This will process an __atomic_exchange function call, determine whether it
10570 needs to be mapped to the _N variation, or turned into a library call.
10571 LOC is the location of the builtin call.
10572 FUNCTION is the DECL that has been invoked;
10573 PARAMS is the argument list for the call. The return value is non-null
10574 TRUE is returned if it is translated into the proper format for a call to the
10575 external library, and NEW_RETURN is set the tree for that function.
10576 FALSE is returned if processing for the _N variation is required, and
10577 NEW_RETURN is set to the the return value the result is copied into. */
10578 static bool
10581 {
10586 /* Size of 0 is an error condition. */
10588 {
10591 }
10593 /* If not a lock-free size, change to the library generic format. */
10595 {
10598 }
10600 /* Otherwise there is a lockfree match, transform the call from:
10601 void fn(T* mem, T* desired, T* return, model)
10602 into
10603 *return = (T) (fn (In* mem, (In) *desired, model)) */
10610 /* Create pointer to appropriate size. */
10614 /* Convert object pointer to required type. */
10617 /* Convert new value to required type, and dereference it. */
10622 /* Move memory model to the 3rd position, and end param list. */
10626 /* Convert return pointer and dereference it for later assignment. */
10630 }
10633 /* This will process an __atomic_compare_exchange function call, determine
10634 whether it needs to be mapped to the _N variation, or turned into a lib call.
10635 LOC is the location of the builtin call.
10636 FUNCTION is the DECL that has been invoked;
10637 PARAMS is the argument list for the call. The return value is non-null
10638 TRUE is returned if it is translated into the proper format for a call to the
10639 external library, and NEW_RETURN is set the tree for that function.
10640 FALSE is returned if processing for the _N variation is required. */
10642 static bool
10646 {
10651 /* Size of 0 is an error condition. */
10653 {
10656 }
10658 /* If not a lock-free size, change to the library generic format. */
10660 {
10661 /* The library generic format does not have the weak parameter, so
10662 remove it from the param list. Since a parameter has been removed,
10663 we can be sure that there is room for the SIZE_T parameter, meaning
10664 there will not be a recursive rebuilding of the parameter list, so
10665 there is no danger this will be done twice. */
10667 {
10671 }
10674 }
10676 /* Otherwise, there is a match, so the call needs to be transformed from:
10677 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10678 into
10679 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10685 /* Create pointer to appropriate size. */
10689 /* Convert object pointer to required type. */
10693 /* Convert expected pointer to required type. */
10697 /* Convert desired value to required type, and dereference it. */
10702 /* The rest of the parameters are fine. NULL means no special return value
10703 processing.*/
10706 }
10709 /* This will process an __atomic_load function call, determine whether it
10710 needs to be mapped to the _N variation, or turned into a library call.
10711 LOC is the location of the builtin call.
10712 FUNCTION is the DECL that has been invoked;
10713 PARAMS is the argument list for the call. The return value is non-null
10714 TRUE is returned if it is translated into the proper format for a call to the
10715 external library, and NEW_RETURN is set the tree for that function.
10716 FALSE is returned if processing for the _N variation is required, and
10717 NEW_RETURN is set to the the return value the result is copied into. */
10719 static bool
10722 {
10727 /* Size of 0 is an error condition. */
10729 {
10732 }
10734 /* If not a lock-free size, change to the library generic format. */
10736 {
10739 }
10741 /* Otherwise, there is a match, so the call needs to be transformed from:
10742 void fn(T* mem, T* return, model)
10743 into
10744 *return = (T) (fn ((In *) mem, model)) */
10750 /* Create pointer to appropriate size. */
10754 /* Convert object pointer to required type. */
10758 /* Move memory model to the 2nd position, and end param list. */
10762 /* Convert return pointer and dereference it for later assignment. */
10766 }
10769 /* This will process an __atomic_store function call, determine whether it
10770 needs to be mapped to the _N variation, or turned into a library call.
10771 LOC is the location of the builtin call.
10772 FUNCTION is the DECL that has been invoked;
10773 PARAMS is the argument list for the call. The return value is non-null
10774 TRUE is returned if it is translated into the proper format for a call to the
10775 external library, and NEW_RETURN is set the tree for that function.
10776 FALSE is returned if processing for the _N variation is required, and
10777 NEW_RETURN is set to the the return value the result is copied into. */
10779 static bool
10782 {
10787 /* Size of 0 is an error condition. */
10789 {
10792 }
10794 /* If not a lock-free size, change to the library generic format. */
10796 {
10799 }
10801 /* Otherwise, there is a match, so the call needs to be transformed from:
10802 void fn(T* mem, T* value, model)
10803 into
10804 fn ((In *) mem, (In) *value, model) */
10809 /* Create pointer to appropriate size. */
10813 /* Convert object pointer to required type. */
10817 /* Convert new value to required type, and dereference it. */
10822 /* The memory model is in the right spot already. Return is void. */
10826 }
10829 /* Some builtin functions are placeholders for other expressions. This
10830 function should be called immediately after parsing the call expression
10831 before surrounding code has committed to the type of the expression.
10833 LOC is the location of the builtin call.
10835 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10836 PARAMS is the argument list for the call. The return value is non-null
10837 when expansion is complete, and null if normal processing should
10838 continue. */
10840 tree
10843 {
10849 {
10855 else
10859 }
10861 /* Handle BUILT_IN_NORMAL here. */
10863 {
10868 {
10869 /* Handle these 4 together so that they can fall through to the next
10870 case if the call is transformed to an _N variant. */
10872 {
10874 {
10878 /* Change to the _N variant. */
10881 }
10884 {
10886 params,
10889 /* Change to the _N variant. */
10892 }
10894 {
10898 /* Change to the _N variant. */
10901 }
10903 {
10907 /* Change to the _N variant. */
10910 }
10913 }
10914 /* Fallthrough to the normal processing. */
10915 }
10932 {
10934 /* Fallthru for parameter processing. */
10935 }
10952 {
10963 orig_format))
10968 NULL);
10976 /* If new_return is set, assign function to that expr and cast the
10977 result to void since the generic interface returned void. */
10979 {
10980 /* Cast function result from I{1,2,4,8,16} to the required type. */
10983 result);
10987 }
10989 }
10993 }
10994 }
10996 /* vector_types_compatible_elements_p is used in type checks of vectors
10997 values used as operands of binary operators. Where it returns true, and
10998 the other checks of the caller succeed (being vector types in he first
10999 place, and matching number of elements), we can just treat the types
11000 as essentially the same.
11001 Contrast with vector_targets_convertible_p, which is used for vector
11002 pointer types, and vector_types_convertible_p, which will allow
11003 language-specific matches under the control of flag_lax_vector_conversions,
11004 and might still require a conversion. */
11005 /* True if vector types T1 and T2 can be inputs to the same binary
11006 operator without conversion.
11007 We don't check the overall vector size here because some of our callers
11008 want to give different error messages when the vectors are compatible
11009 except for the element count. */
11011 bool
11013 {
11026 /* Equality works here because c_common_signed_type uses
11027 TYPE_MAIN_VARIANT. */
11035 }
11037 /* Check for missing format attributes on function pointers. LTYPE is
11038 the new type or left-hand side type. RTYPE is the old type or
11039 right-hand side type. Returns TRUE if LTYPE is missing the desired
11040 attribute. */
11042 bool
11044 {
11046 tree ra;
11052 {
11053 tree la;
11058 }
11059 else
11061 }
11063 /* Subscripting with type char is likely to lose on a machine where
11064 chars are signed. So warn on any machine, but optionally. Don't
11065 warn for unsigned char since that type is safe. Don't warn for
11066 signed char because anyone who uses that must have done so
11067 deliberately. Furthermore, we reduce the false positive load by
11068 warning only for non-constant value of type char. */
11070 void
11072 {
11076 }
11078 /* Implement -Wparentheses for the unexpected C precedence rules, to
11079 cover cases like x + y << z which readers are likely to
11080 misinterpret. We have seen an expression in which CODE is a binary
11081 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11082 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11083 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11084 expression was not formed using a binary or unary operator, or it
11085 was enclosed in parentheses. */
11087 void
11091 {
11095 /* This macro tests that the expression ARG with original tree code
11096 CODE appears to be a boolean expression. or the result of folding a
11097 boolean expression. */
11098 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11099 (truth_value_p (TREE_CODE (ARG)) \
11100 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11102 || ((CODE) != INTEGER_CST \
11103 && (integer_onep (ARG) || integer_zerop (ARG))))
11106 {
11155 /* Check cases like x|y==z */
11162 /* Check cases like !x | y */
11166 "suggest parentheses around operand of "
11179 /* Check cases like x^y==z */
11201 /* Check cases like x&y==z */
11208 /* Check cases like !x & y */
11212 "suggest parentheses around operand of "
11235 {
11240 "comparisons like %<X<=Y<=Z%> do not "
11246 "comparisons like %<X<=Y<=Z%> do not "
11248 }
11250 }
11251 #undef NOT_A_BOOLEAN_EXPR_P
11252 }
11254 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11256 void
11258 {
11260 {
11263 else
11265 }
11266 }
11268 /* Warn for division by zero according to the value of DIVISOR. LOC
11269 is the location of the division operator. */
11271 void
11273 {
11274 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11275 about division by zero. Do not issue a warning if DIVISOR has a
11276 floating-point type, since we consider 0.0/0.0 a valid way of
11277 generating a NaN. */
11281 }
11283 /* Subroutine of build_binary_op. Give warnings for comparisons
11284 between signed and unsigned quantities that may fail. Do the
11285 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11286 so that casts will be considered, but default promotions won't
11287 be.
11289 LOCATION is the location of the comparison operator.
11291 The arguments of this function map directly to local variables
11292 of build_binary_op. */
11294 void
11299 {
11304 /* In C++, check for comparison of different enum types. */
11310 {
11314 }
11316 /* Do not warn if the comparison is being done in a signed type,
11317 since the signed type will only be chosen if it can represent
11318 all the values of the unsigned type. */
11321 /* Do not warn if both operands are unsigned. */
11324 else
11325 {
11331 else
11339 /* Do not warn if the signed quantity is an unsuffixed integer
11340 literal (or some static constant expression involving such
11341 literals or a conditional expression involving such literals)
11342 and it is non-negative. */
11345 /* Do not warn if the comparison is an equality operation, the
11346 unsigned quantity is an integral constant, and it would fit
11347 in the result if the result were signed. */
11352 /* In C, do not warn if the unsigned quantity is an enumeration
11353 constant and its maximum value would fit in the result if the
11354 result were signed. */
11360 else
11362 OPT_Wsign_compare,
11364 }
11366 /* Warn if two unsigned values are being compared in a size larger
11367 than their original size, and one (and only one) is the result of
11368 a `~' operator. This comparison will always fail.
11370 Also warn if one operand is a constant, and the constant does not
11371 have all bits set that are set in the ~ operand when it is
11372 extended. */
11379 {
11386 {
11387 tree primop;
11393 {
11397 }
11398 else
11399 {
11403 }
11408 {
11411 {
11415 else
11418 }
11419 }
11420 }
11428 }
11429 }
11431 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11432 type via c_common_type. If -Wdouble-promotion is in use, and the
11433 conditions for warning have been met, issue a warning. GMSGID is
11434 the warning message. It must have two %T specifiers for the type
11435 that was converted (generally "float") and the type to which it was
11436 converted (generally "double), respectively. LOC is the location
11437 to which the awrning should refer. */
11439 void
11442 {
11443 tree source_type;
11447 /* If the conversion will not occur at run-time, there is no need to
11448 warn about it. */
11460 else
11463 }
11465 /* Setup a TYPE_DECL node as a typedef representation.
11467 X is a TYPE_DECL for a typedef statement. Create a brand new
11468 ..._TYPE node (which will be just a variant of the existing
11469 ..._TYPE node with identical properties) and then install X
11470 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11472 The whole point here is to end up with a situation where each
11473 and every ..._TYPE node the compiler creates will be uniquely
11474 associated with AT MOST one node representing a typedef name.
11475 This way, even though the compiler substitutes corresponding
11476 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11477 early on, later parts of the compiler can always do the reverse
11478 translation and get back the corresponding typedef name. For
11479 example, given:
11481 typedef struct S MY_TYPE;
11482 MY_TYPE object;
11484 Later parts of the compiler might only know that `object' was of
11485 type `struct S' if it were not for code just below. With this
11486 code however, later parts of the compiler see something like:
11488 struct S' == struct S
11489 typedef struct S' MY_TYPE;
11490 struct S' object;
11492 And they can then deduce (from the node for type struct S') that
11493 the original object declaration was:
11495 MY_TYPE object;
11497 Being able to do this is important for proper support of protoize,
11498 and also for generating precise symbolic debugging information
11499 which takes full account of the programmer's (typedef) vocabulary.
11501 Obviously, we don't want to generate a duplicate ..._TYPE node if
11502 the TYPE_DECL node that we are now processing really represents a
11503 standard built-in type. */
11505 void
11507 {
11511 {
11514 }
11517 {
11525 }
11526 }
11528 /* Record the types used by the current global variable declaration
11529 being parsed, so that we can decide later to emit their debug info.
11530 Those types are in types_used_by_cur_var_decl, and we are going to
11531 store them in the types_used_by_vars_hash hash table.
11532 DECL is the declaration of the global variable that has been parsed. */
11534 void
11536 {
11540 {
11543 }
11544 }
11546 /* If DECL is a typedef that is declared in the current function,
11547 record it for the purpose of -Wunused-local-typedefs. */
11549 void
11551 {
11556 /* if this is not a locally defined typedef then we are not
11557 interested. */
11564 }
11566 /* If T is a TYPE_DECL declared locally, mark it as used. */
11568 void
11570 {
11575 }
11577 /* Warn if there are some unused locally defined typedefs in the
11578 current function. */
11580 void
11582 {
11584 tree decl;
11585 /* The number of times we have emitted -Wunused-local-typedefs
11586 warnings. If this is different from errorcount, that means some
11587 unrelated errors have been issued. In which case, we'll avoid
11588 emitting "unused-local-typedefs" warnings. */
11600 {
11604 OPT_Wunused_local_typedefs,
11607 }
11610 }
11612 /* The C and C++ parsers both use vectors to hold function arguments.
11613 For efficiency, we keep a cache of unused vectors. This is the
11614 cache. */
11619 /* Return a new vector from the cache. If the cache is empty,
11620 allocate a new vector. These vectors are GC'ed, so it is OK if the
11621 pointer is not released.. */
11625 {
11628 else
11629 {
11630 /* Passing 0 to vec::alloc returns NULL, and our callers require
11631 that we always return a non-NULL value. The vector code uses
11632 4 when growing a NULL vector, so we do too. */
11636 }
11637 }
11639 /* Release a vector of trees back to the cache. */
11641 void
11643 {
11645 {
11648 }
11649 }
11651 /* Get a new tree vector holding a single tree. */
11655 {
11659 }
11661 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11665 {
11670 }
11672 /* Get a new tree vector which is a copy of an existing one. */
11676 {
11679 tree t;
11686 }
11688 /* Return true if KEYWORD starts a type specifier. */
11690 bool
11692 {
11694 {
11725 }
11726 }
11728 /* Return true if KEYWORD names a type qualifier. */
11730 bool
11732 {
11734 {
11742 }
11743 }
11745 /* Return true if KEYWORD names a storage class specifier.
11747 RID_TYPEDEF is not included in this list despite `typedef' being
11748 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11749 such for syntactic convenience only. */
11751 bool
11753 {
11755 {
11765 }
11766 }
11768 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11770 static bool
11772 {
11774 {
11782 }
11783 }
11785 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11786 declaration-specifier (C99 6.7). */
11788 bool
11790 {
11797 {
11804 }
11805 }
11807 /* Initialize language-specific-bits of tree_contains_struct. */
11809 void
11811 {
11815 }
11817 /* Build a user-defined numeric literal out of an integer constant type VALUE
11818 with identifier SUFFIX. */
11820 tree
11823 {
11830 }
11832 /* For vector[index], convert the vector to a
11833 pointer of the underlying type. */
11834 void
11837 {
11839 {
11841 tree type1;
11854 {
11855 /* If the original vector isn't declared may_alias and it
11856 isn't a bare vector look if the subscripting would
11857 alias the vector we subscript, and if not, force ref-all. */
11863 }
11867 }
11868 }
11870 /* Determine which of the operands, if any, is a scalar that needs to be
11871 converted to a vector, for the range of operations. */
11872 enum stv_conv
11875 {
11884 {
11885 /* Most GENERIC binary expressions require homogeneous arguments.
11886 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11887 argument that is a vector and a second one that is a scalar, so
11888 we never return stv_secondarg for them. */
11893 {
11895 {
11900 }
11901 else
11903 }
11910 /* ... fall through ... */
11931 /* What about UNLT_EXPR? */
11933 {
11934 tree tmp;
11936 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11939 }
11943 {
11945 {
11950 }
11952 }
11954 /* Allow integer --> real conversion if safe. */
11958 {
11960 {
11965 }
11967 }
11970 }
11973 }
11975 /* Return true iff ALIGN is an integral constant that is a fundamental
11976 alignment, as defined by [basic.align] in the c++-11
11977 specifications.
11979 That is:
11981 [A fundamental alignment is represented by an alignment less than or
11982 equal to the greatest alignment supported by the implementation
11983 in all contexts, which is equal to
11984 alignof(max_align_t)]. */
11986 bool
11988 {
11991 }
11993 /* Return true if T is a pointer to a zero-sized aggregate. */
11995 bool
11997 {
12002 }