| blob | b652cc2489e5c8f918ce3f44040cb7ee6b952118 |
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/>. */
55 /* The following symbols are subsumed in the c_global_trees array, and
56 listed here individually for documentation purposes.
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
63 tree int128_integer_type_node;
65 tree short_unsigned_type_node;
66 tree long_unsigned_type_node;
67 tree long_long_unsigned_type_node;
68 tree int128_unsigned_type_node;
70 tree truthvalue_type_node;
71 tree truthvalue_false_node;
72 tree truthvalue_true_node;
74 tree ptrdiff_type_node;
76 tree unsigned_char_type_node;
77 tree signed_char_type_node;
78 tree wchar_type_node;
80 tree char16_type_node;
81 tree char32_type_node;
83 tree float_type_node;
84 tree double_type_node;
85 tree long_double_type_node;
87 tree complex_integer_type_node;
88 tree complex_float_type_node;
89 tree complex_double_type_node;
90 tree complex_long_double_type_node;
92 tree dfloat32_type_node;
93 tree dfloat64_type_node;
94 tree_dfloat128_type_node;
96 tree intQI_type_node;
97 tree intHI_type_node;
98 tree intSI_type_node;
99 tree intDI_type_node;
100 tree intTI_type_node;
102 tree unsigned_intQI_type_node;
103 tree unsigned_intHI_type_node;
104 tree unsigned_intSI_type_node;
105 tree unsigned_intDI_type_node;
106 tree unsigned_intTI_type_node;
108 tree widest_integer_literal_type_node;
109 tree widest_unsigned_literal_type_node;
111 Nodes for types `void *' and `const void *'.
113 tree ptr_type_node, const_ptr_type_node;
115 Nodes for types `char *' and `const char *'.
117 tree string_type_node, const_string_type_node;
119 Type `char[SOMENUMBER]'.
120 Used when an array of char is needed and the size is irrelevant.
122 tree char_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
195 /* C/ObjC language option variables. */
198 /* Nonzero means allow type mismatches in conditional expressions;
199 just make their values `void'. */
203 /* Nonzero means enable C89 Amendment 1 features. */
207 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
211 /* Nonzero means use the ISO C11 dialect of C. */
215 /* Nonzero means that we have builtin functions, and main is an int. */
220 /* ObjC language option variables. */
223 /* Tells the compiler that this is a special run. Do not perform any
224 compiling, instead we are to test some platform dependent features
225 and output a C header file with appropriate definitions. */
229 /* Tells the compiler what is the constant string class for ObjC. */
234 /* C++ language option variables. */
237 /* Nonzero means generate separate instantiation control files and
238 juggle them at link time. */
242 /* The C++ dialect being used. C++98 is the default. */
246 /* Maximum template instantiation depth. This limit exists to limit the
247 time it takes to notice excessively recursive template instantiations.
249 The default is lower than the 1024 recommended by the C++0x standard
250 because G++ runs out of stack before 1024 with highly recursive template
251 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
255 /* The elements of `ridpointers' are identifier nodes for the reserved
256 type names and storage classes. It is indexed by a RID_... value. */
261 /* Nonzero means don't warn about problems that occur when the code is
262 executed. */
265 /* Whether we are building a boolean conversion inside
266 convert_for_assignment, or some other late binary operation. If
267 build_binary_op is called for C (from code shared by C and C++) in
268 this case, then the operands have already been folded and the
269 result will not be folded again, so C_MAYBE_CONST_EXPR should not
270 be generated. */
273 /* Whether lexing has been completed, so subsequent preprocessor
274 errors should use the compiler's input_location. */
277 /* Information about how a function name is generated. */
278 struct fname_var_t
279 {
283 };
285 /* The three ways of getting then name of the current function. */
288 {
289 /* C99 compliant __func__, must be first. */
291 /* GCC __FUNCTION__ compliant. */
293 /* GCC __PRETTY_FUNCTION__ compliant. */
296 };
298 /* Global visibility options. */
396 /* Reserved words. The third field is a mask: keywords are disabled
397 if they match the mask.
399 Masks for languages:
400 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
401 C --std=c99: D_CXXONLY | D_OBJC
402 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
403 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
404 C++ --std=c0x: D_CONLY | D_OBJC
405 ObjC++ is like C++ except that D_OBJC is not set
407 If -fno-asm is used, D_ASM is added to the mask. If
408 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
409 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
410 In C with -Wc++-compat, we warn if D_CXXWARN is set.
412 Note the complication of the D_CXX_OBJC keywords. These are
413 reserved words such as 'class'. In C++, 'class' is a reserved
414 word. In Objective-C++ it is too. In Objective-C, it is a
415 reserved word too, but only if it follows an '@' sign.
416 */
418 {
579 /* These Objective-C keywords are recognized only immediately after
580 an '@'. */
597 /* These are recognized only in protocol-qualifier context
598 (see above) */
605 /* These are recognized inside a property attribute list */
614 };
619 /* Table of machine-independent attributes common to all C-like languages. */
621 {
622 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
623 affects_type_identity } */
630 /* FIXME: logically, noreturn attributes should be listed as
631 "false, true, true" and apply to function types. But implementing this
632 would require all the places in the compiler that use TREE_THIS_VOLATILE
633 on a decl to identify non-returning functions to be located and fixed
634 to check the function type instead. */
659 /* The same comments as for noreturn attributes apply to const ones. */
683 handle_no_instrument_function_attribute,
701 /* ??? These two attributes didn't make the transition from the
702 Intel language document to the multi-vendor language document. */
707 /* For internal use (marking of builtins) only. The name contains space
708 to prevent its usage in source code. */
730 /* For internal use (marking of builtins) only. The name contains space
731 to prevent its usage in source code. */
742 handle_no_address_safety_analysis_attribute,
745 handle_no_sanitize_address_attribute,
748 handle_no_sanitize_undefined_attribute,
758 /* For internal use only. The leading '*' both prevents its usage in
759 source code and signals that it may be overridden by machine tables. */
764 /* For internal use (marking of builtins and runtime functions) only.
765 The name contains space to prevent its usage in source code. */
769 handle_always_patch_for_instrumentation_attribute,
772 handle_never_patch_for_instrumentation_attribute,
790 };
792 /* Give the specifications for the format attributes, used by C and all
793 descendants. */
796 {
797 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
798 affects_type_identity } */
804 };
806 /* Return identifier for address space AS. */
810 {
814 }
816 /* Push current bindings for the function name VAR_DECLS. */
818 void
820 {
825 {
829 {
831 saved);
833 }
834 }
836 /* Normally they'll have been NULL, so only push if we've got a
837 stack, or they are non-NULL. */
839 saved_function_name_decls);
840 }
842 /* Finish up the current bindings, adding them into the current function's
843 statement tree. This must be done _before_ finish_stmt_tree is called.
844 If there is no current function, we must be at file scope and no statements
845 are involved. Pop the previous bindings. */
847 void
849 {
858 {
866 }
872 {
873 /* We had saved values, restore them. */
874 tree saved;
877 {
882 }
884 }
886 }
888 /* Return the text name of the current function, suitably prettified
889 by PRETTY_P. Return string must be freed by caller. */
893 {
900 {
903 }
916 {
919 }
922 }
924 /* Return the VAR_DECL for a const char array naming the current
925 function. If the VAR_DECL has not yet been created, create it
926 now. RID indicates how it should be formatted and IDENTIFIER_NODE
927 ID is its name (unfortunately C and C++ hold the RID values of
928 keywords in different places, so we can't derive RID from ID in
929 this language independent code. LOC is the location of the
930 function. */
932 tree
934 {
944 {
945 /* If a tree is built here, it would normally have the lineno of
946 the current statement. Later this tree will be moved to the
947 beginning of the function and this line number will be wrong.
948 To avoid this problem set the lineno to 0 here; that prevents
949 it from appearing in the RTL. */
950 tree stmts;
958 saved_function_name_decls
962 }
967 }
969 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
971 tree
973 {
978 /* Compute the number of elements, for the array type. */
980 {
983 }
985 {
988 }
990 {
993 }
994 else
995 {
998 }
1000 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1001 limit in C++98 Annex B is very large (65536) and is not normative,
1002 so we do not diagnose it (warn_overlength_strings is forced off
1003 in c_common_post_options). */
1005 {
1009 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1010 separate the %d from the 'C'. 'ISO' should not be
1011 translated, but it may be moved after 'C%d' in languages
1012 where modifiers follow nouns. */
1014 "string length %qd is greater than the length %qd "
1017 }
1019 /* Create the array type for the string constant. The ISO C++
1020 standard says that a string literal has type `const char[N]' or
1021 `const wchar_t[N]'. We use the same logic when invoked as a C
1022 front-end with -Wwrite-strings.
1023 ??? We should change the type of an expression depending on the
1024 state of a warning flag. We should just be warning -- see how
1025 this is handled in the C++ front-end for the deprecated implicit
1026 conversion from string literals to `char*' or `wchar_t*'.
1028 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1029 array type being the unqualified version of that type.
1030 Therefore, if we are constructing an array of const char, we must
1031 construct the matching unqualified array type first. The C front
1032 end does not require this, but it does no harm, so we do it
1033 unconditionally. */
1044 }
1045 \f
1046 /* If DISABLE is true, stop issuing warnings. This is used when
1047 parsing code that we know will not be executed. This function may
1048 be called multiple times, and works as a stack. */
1050 static void
1052 {
1054 {
1057 }
1058 }
1060 /* If ENABLE is true, reenable issuing warnings. */
1062 static void
1064 {
1066 {
1069 }
1070 }
1072 /* Fully fold EXPR, an expression that was not folded (beyond integer
1073 constant expressions and null pointer constants) when being built
1074 up. If IN_INIT, this is in a static initializer and certain
1075 changes are made to the folding done. Clear *MAYBE_CONST if
1076 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1077 expression because it contains an evaluated operator (in C99) or an
1078 operator outside of sizeof returning an integer constant (in C90)
1079 not permitted in constant expressions, or because it contains an
1080 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1081 set to true by callers before calling this function.) Return the
1082 folded expression. Function arguments have already been folded
1083 before calling this function, as have the contents of SAVE_EXPR,
1084 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1085 C_MAYBE_CONST_EXPR. */
1087 tree
1089 {
1090 tree ret;
1096 /* This function is not relevant to C++ because C++ folds while
1097 parsing, and may need changes to be correct for C++ when C++
1098 stops folding while parsing. */
1105 {
1108 }
1115 }
1117 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1118 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1119 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1120 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1121 both evaluated and unevaluated subexpressions while
1122 *MAYBE_CONST_ITSELF is carried from only evaluated
1123 subexpressions). */
1125 static tree
1128 {
1140 /* This function is not relevant to C++ because C++ folds while
1141 parsing, and may need changes to be correct for C++ when C++
1142 stops folding while parsing. */
1146 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1147 anything else not counted as an expression cannot usefully be
1148 folded further at this point. */
1154 /* Operands of variable-length expressions (function calls) have
1155 already been folded, as have __builtin_* function calls, and such
1156 expressions cannot occur in constant expressions. */
1158 {
1162 }
1165 {
1174 else
1177 }
1179 /* Assignment, increment, decrement, function call and comma
1180 operators, and statement expressions, cannot occur in constant
1181 expressions if evaluated / outside of sizeof. (Function calls
1182 were handled above, though VA_ARG_EXPR is treated like a function
1183 call here, and statement expressions are handled through
1184 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1186 {
1206 }
1208 /* Fold individual tree codes as appropriate. */
1210 {
1212 /* Any non-constancy will have been marked in a containing
1213 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1221 maybe_const_itself);
1226 {
1229 }
1238 maybe_const_itself);
1241 maybe_const_itself);
1247 {
1251 }
1293 /* Binary operations evaluating both arguments (increment and
1294 decrement are binary internally in GCC). */
1298 maybe_const_itself);
1306 /* The RHS of a MODIFY_EXPR was fully folded when building that
1307 expression for the sake of conversion warnings. */
1310 maybe_const_itself);
1314 ret = in_init
1317 else
1330 {
1341 }
1347 CASE_CONVERT:
1358 /* Unary operations. */
1361 maybe_const_itself);
1365 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1366 not prepared to deal with them if they occur in initializers. */
1374 ret = in_init
1377 else
1382 {
1386 }
1388 {
1391 CASE_CONVERT:
1392 /* Don't warn about explicit conversions. We will already
1393 have warned about suspect implicit conversions. */
1400 }
1405 /* Binary operations not necessarily evaluating both
1406 arguments. */
1413 ? truthvalue_false_node
1421 ret = in_init
1424 else
1429 && op0_const
1430 && op0_const_self
1436 && op0_const_self
1462 else
1467 && op0_const
1468 && op0_const_self
1472 && op0_const_self
1476 && op0_const
1477 && op0_const_self
1481 && op0_const_self
1487 /* Each case where an operand with excess precision may be
1488 encountered must remove the EXCESS_PRECISION_EXPR around
1489 inner operands and possibly put one around the whole
1490 expression or possibly convert to the semantic type (which
1491 c_fully_fold does); we cannot tell at this stage which is
1492 appropriate in any particular case. */
1496 /* Various codes may appear through folding built-in functions
1497 and their arguments. */
1499 }
1501 out:
1502 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1503 have been done by this point, so remove them again. */
1507 {
1511 }
1515 }
1517 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1518 return EXP. Otherwise, return either EXP or its known constant
1519 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1520 Is the BLKmode test appropriate? */
1522 tree
1524 {
1525 tree ret;
1527 /* This function is only used by C, for c_fully_fold and other
1528 optimization, and may not be correct for C++. */
1539 /* Avoid unwanted tree sharing between the initializer and current
1540 function's body where the tree can be modified e.g. by the
1541 gimplifier. */
1545 }
1547 /* Print a warning if a constant expression had overflow in folding.
1548 Invoke this function on every expression that the language
1549 requires to be a constant expression.
1550 Note the ANSI C standard says it is erroneous for a
1551 constant expression to overflow. */
1553 void
1555 {
1563 }
1565 /* The same as above but print an unconditional error. */
1566 void
1568 {
1575 }
1577 /* Print a warning if an expression had overflow in folding and its
1578 operands hadn't.
1580 Invoke this function on every expression that
1581 (1) appears in the source code, and
1582 (2) is a constant expression that overflowed, and
1583 (3) is not already checked by convert_and_check;
1584 however, do not invoke this function on operands of explicit casts
1585 or when the expression is the result of an operator and any operand
1586 already overflowed. */
1588 void
1590 {
1595 {
1624 }
1625 }
1627 /* Warn about uses of logical || / && operator in a context where it
1628 is likely that the bitwise equivalent was intended by the
1629 programmer. We have seen an expression in which CODE is a binary
1630 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1631 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1632 void
1636 {
1648 /* Warn if &&/|| are being used in a context where it is
1649 likely that the bitwise equivalent was intended by the
1650 programmer. That is, an expression such as op && MASK
1651 where op should not be any boolean expression, nor a
1652 constant, and mask seems to be a non-boolean integer constant. */
1660 {
1664 else
1669 }
1671 /* We do not warn for constants because they are typical of macro
1672 expansions that test for features. */
1676 /* This warning only makes sense with logical operands. */
1684 /* We first test whether either side separately is trivially true
1685 (with OR) or trivially false (with AND). If so, do not warn.
1686 This is a common idiom for testing ranges of data types in
1687 portable code. */
1694 /* If this is an OR operation, invert both sides; now, the result
1695 should be always false to get a warning. */
1709 /* If this is an OR operation, invert both sides; now, the result
1710 should be always false to get a warning. */
1718 /* If both expressions have the same operand, if we can merge the
1719 ranges, and if the range test is always false, then warn. */
1726 {
1729 "logical %<or%> "
1731 else
1733 "logical %<and%> "
1735 }
1736 }
1739 /* Warn if EXP contains any computations whose results are not used.
1740 Return true if a warning is printed; false otherwise. LOCUS is the
1741 (potential) location of the expression. */
1743 bool
1745 {
1746 restart:
1750 /* Don't warn about void constructs. This includes casting to void,
1751 void function calls, and statement expressions with a final cast
1752 to void. */
1760 {
1776 /* For a binding, warn if no side effect within it. */
1788 /* In && or ||, warn if 2nd operand has no side effect. */
1795 /* Let people do `(foo (), 0)' without a warning. */
1802 /* If this is an expression with side effects, don't warn; this
1803 case commonly appears in macro expansions. */
1809 /* Don't warn about automatic dereferencing of references, since
1810 the user cannot control it. */
1812 {
1815 }
1816 /* Fall through. */
1819 /* Referencing a volatile value is a side effect, so don't warn. */
1824 /* If this is an expression which has no operands, there is no value
1825 to be unused. There are no such language-independent codes,
1826 but front ends may define such. */
1830 warn:
1832 }
1833 }
1836 /* Print a warning about casts that might indicate violation
1837 of strict aliasing rules if -Wstrict-aliasing is used and
1838 strict aliasing mode is in effect. OTYPE is the original
1839 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1841 bool
1843 {
1844 /* Strip pointer conversion chains and get to the correct original type. */
1852 /* If the type we are casting to is a ref-all pointer
1853 dereferencing it is always valid. */
1860 {
1861 /* Casting the address of an object to non void pointer. Warn
1862 if the cast breaks type based aliasing. */
1864 {
1868 }
1869 else
1870 {
1871 /* warn_strict_aliasing >= 3. This includes the default (3).
1872 Only warn if the cast is dereferenced immediately. */
1873 alias_set_type set1 =
1879 {
1883 }
1886 {
1890 }
1891 }
1892 }
1893 else
1895 {
1896 /* At this level, warn for any conversions, even if an address is
1897 not taken in the same statement. This will likely produce many
1898 false positives, but could be useful to pinpoint problems that
1899 are not revealed at higher levels. */
1904 {
1908 }
1909 }
1912 }
1914 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1915 sizeof as last operand of certain builtins. */
1917 void
1921 {
1925 location_t loc;
1933 {
1937 /* FALLTHRU */
1945 /* FALLTHRU */
2004 }
2032 {
2036 {
2039 "argument to %<sizeof%> in %qD call is the same "
2040 "expression as the destination; did you mean to "
2046 "argument to %<sizeof%> in %qD call is the same "
2047 "expression as the destination; did you mean to "
2049 else
2051 "argument to %<sizeof%> in %qD call is the same "
2052 "expression as the destination; did you mean to "
2055 }
2058 && !strop
2061 {
2063 "argument to %<sizeof%> in %qD call is the same "
2064 "pointer type %qT as the destination; expected %qT "
2068 }
2069 }
2072 {
2076 {
2079 "argument to %<sizeof%> in %qD call is the same "
2080 "expression as the source; did you mean to "
2086 "argument to %<sizeof%> in %qD call is the same "
2087 "expression as the source; did you mean to "
2089 else
2091 "argument to %<sizeof%> in %qD call is the same "
2092 "expression as the source; did you mean to "
2095 }
2098 && !strop
2101 {
2103 "argument to %<sizeof%> in %qD call is the same "
2104 "pointer type %qT as the source; expected %qT "
2108 }
2109 }
2112 {
2116 {
2119 "argument to %<sizeof%> in %qD call is the same "
2120 "expression as the first source; did you mean to "
2126 "argument to %<sizeof%> in %qD call is the same "
2127 "expression as the first source; did you mean to "
2129 else
2131 "argument to %<sizeof%> in %qD call is the same "
2132 "expression as the first source; did you mean to "
2135 }
2138 && !strop
2141 {
2143 "argument to %<sizeof%> in %qD call is the same "
2144 "pointer type %qT as the first source; expected %qT "
2148 }
2149 }
2152 {
2156 {
2159 "argument to %<sizeof%> in %qD call is the same "
2160 "expression as the second source; did you mean to "
2166 "argument to %<sizeof%> in %qD call is the same "
2167 "expression as the second source; did you mean to "
2169 else
2171 "argument to %<sizeof%> in %qD call is the same "
2172 "expression as the second source; did you mean to "
2175 }
2178 && !strop
2181 {
2183 "argument to %<sizeof%> in %qD call is the same "
2184 "pointer type %qT as the second source; expected %qT "
2188 }
2189 }
2191 }
2193 /* Warn for unlikely, improbable, or stupid DECL declarations
2194 of `main'. */
2196 void
2198 {
2199 function_args_iterator iter;
2200 tree type;
2204 {
2205 /* XXX void_type_node belies the abstraction. */
2211 {
2233 "third argument of %q+D should probably be "
2236 }
2237 }
2239 /* It is intentional that this message does not mention the third
2240 argument because it's only mentioned in an appendix of the
2241 standard. */
2245 }
2247 /* vector_targets_convertible_p is used for vector pointer types. The
2248 callers perform various checks that the qualifiers are satisfactory,
2249 while OTOH vector_targets_convertible_p ignores the number of elements
2250 in the vectors. That's fine with vector pointers as we can consider,
2251 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2252 and that does not require and conversion of the pointer values.
2253 In contrast, vector_types_convertible_p and
2254 vector_types_compatible_elements_p are used for vector value types. */
2255 /* True if pointers to distinct types T1 and T2 can be converted to
2256 each other without an explicit cast. Only returns true for opaque
2257 vector types. */
2258 bool
2260 {
2267 }
2269 /* vector_types_convertible_p is used for vector value types.
2270 It could in principle call vector_targets_convertible_p as a subroutine,
2271 but then the check for vector type would be duplicated with its callers,
2272 and also the purpose of vector_targets_convertible_p would become
2273 muddled.
2274 Where vector_types_convertible_p returns true, a conversion might still be
2275 needed to make the types match.
2276 In contrast, vector_targets_convertible_p is used for vector pointer
2277 values, and vector_types_compatible_elements_p is used specifically
2278 in the context for binary operators, as a check if use is possible without
2279 conversion. */
2280 /* True if vector types T1 and T2 can be converted to each other
2281 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2282 can only be converted with -flax-vector-conversions yet that is not
2283 in effect, emit a note telling the user about that option if such
2284 a note has not previously been emitted. */
2285 bool
2287 {
2295 convertible_lax =
2310 {
2313 "conversions between vectors with differing "
2315 }
2318 }
2320 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2321 and have vector types, V0 has the same type as V1, and the number of
2322 elements of V0, V1, MASK is the same.
2324 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2325 called with two arguments. In this case implementation passes the
2326 first argument twice in order to share the same tree code. This fact
2327 could enable the mask-values being twice the vector length. This is
2328 an implementation accident and this semantics is not guaranteed to
2329 the user. */
2330 tree
2333 {
2334 tree ret;
2340 {
2343 }
2351 {
2356 }
2360 {
2364 }
2367 {
2372 }
2378 {
2381 "argument vector(s) and the mask vector should "
2384 }
2388 {
2393 }
2396 {
2397 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2403 else
2404 {
2407 }
2411 }
2421 }
2423 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2424 to integral type. */
2426 static tree
2428 {
2433 {
2434 /* C++0x scoped enumerations don't implicitly convert to integral
2435 type; if we stripped an explicit conversion to a larger type we
2436 need to replace it so common_type will still work. */
2440 }
2442 }
2444 /* This is a helper function of build_binary_op.
2446 For certain operations if both args were extended from the same
2447 smaller type, do the arithmetic in that type and then extend.
2449 BITWISE indicates a bitwise operation.
2450 For them, this optimization is safe only if
2451 both args are zero-extended or both are sign-extended.
2452 Otherwise, we might change the result.
2453 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2454 but calculated in (unsigned short) it would be (unsigned short)-1.
2455 */
2456 tree
2458 {
2462 tree type;
2464 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2465 excessive narrowing when we call get_narrower below. For
2466 example, suppose that OP0 is of unsigned int extended
2467 from signed char and that RESULT_TYPE is long long int.
2468 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2469 like
2471 (long long int) (unsigned int) signed_char
2473 which get_narrower would narrow down to
2475 (unsigned int) signed char
2477 If we do not cast OP0 first, get_narrower would return
2478 signed_char, which is inconsistent with the case of the
2479 explicit cast. */
2486 /* UNS is 1 if the operation to be done is an unsigned one. */
2489 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2490 but it *requires* conversion to FINAL_TYPE. */
2501 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2503 /* For bitwise operations, signedness of nominal type
2504 does not matter. Consider only how operands were extended. */
2508 /* Note that in all three cases below we refrain from optimizing
2509 an unsigned operation on sign-extended args.
2510 That would not be valid. */
2512 /* Both args variable: if both extended in same way
2513 from same width, do it in that width.
2514 Do it unsigned if args were zero-extended. */
2521 return c_common_signed_or_unsigned_type
2528 && (type
2539 && (type
2547 }
2549 /* Checks if expression EXPR of real/integer type cannot be converted
2550 to the real/integer type TYPE. Function returns non-zero when:
2551 * EXPR is a constant which cannot be exactly converted to TYPE.
2552 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2553 for EXPR type and TYPE being both integers or both real.
2554 * EXPR is not a constant of real type and TYPE is an integer.
2555 * EXPR is not a constant of integer type which cannot be
2556 exactly converted to real type.
2557 Function allows conversions between types of different signedness and
2558 can return SAFE_CONVERSION (zero) in that case. Function can produce
2559 signedness warnings if PRODUCE_WARNS is true. */
2561 enum conversion_safety
2563 {
2569 {
2570 /* Warn for real constant that is not an exact integer converted
2571 to integer type. */
2574 {
2577 }
2578 /* Warn for an integer constant that does not fit into integer type. */
2582 {
2585 {
2589 }
2591 {
2595 }
2596 else
2598 }
2600 {
2601 /* Warn for an integer constant that does not fit into real type. */
2603 {
2607 }
2608 /* Warn for a real constant that does not fit into a smaller
2609 real type. */
2612 {
2616 }
2617 }
2618 }
2619 else
2620 {
2621 /* Warn for real types converted to integer types. */
2628 {
2629 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2633 /* Don't warn for short y; short x = ((int)y & 0xff); */
2637 {
2638 /* If both args were extended from a shortest type,
2639 use that type if that is safe. */
2646 {
2652 /* If one of the operands is a non-negative constant
2653 that fits in the target type, then the type of the
2654 other operand does not matter. */
2663 /* If constant is unsigned and fits in the target
2664 type, then the result will also fit. */
2666 && unsigned0
2669 && unsigned1
2672 }
2673 }
2674 /* Warn for integer types converted to smaller integer types. */
2678 /* When they are the same width but different signedness,
2679 then the value may change. */
2682 /* Even when converted to a bigger type, if the type is
2683 unsigned but expr is signed, then negative values
2684 will be changed. */
2690 }
2692 /* Warn for integer types converted to real types if and only if
2693 all the range of values of the integer type cannot be
2694 represented by the real type. */
2697 {
2701 /* Don't warn about char y = 0xff; float x = (int) y; */
2713 }
2715 /* Warn for real types converted to smaller real types. */
2720 }
2723 }
2725 /* Warns if the conversion of EXPR to TYPE may alter a value.
2726 This is a helper function for warnings_for_convert_and_check. */
2728 static void
2730 {
2737 /* This may happen, because for LHS op= RHS we preevaluate
2738 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2739 means we could no longer see the code of the EXPR. */
2746 {
2759 /* Conversion from boolean to a signed:1 bit-field (which only
2760 can hold the values 0 and -1) doesn't lose information - but
2761 it does change the value. */
2781 {
2782 /* In case of COND_EXPR, we do not care about the type of
2783 COND_EXPR, only about the conversion of each operand. */
2790 }
2802 }
2803 }
2805 /* Produce warnings after a conversion. RESULT is the result of
2806 converting EXPR to TYPE. This is a helper function for
2807 convert_and_check and cp_convert_and_check. */
2809 void
2811 tree result)
2812 {
2819 {
2820 /* Do not diagnose overflow in a constant expression merely
2821 because a conversion overflowed. */
2826 {
2827 /* This detects cases like converting -129 or 256 to
2828 unsigned char. */
2832 else
2834 }
2838 /* No warning for converting 0x80000000 to int. */
2846 else
2848 }
2853 else
2855 }
2858 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2859 Invoke this function on every expression that is converted implicitly,
2860 i.e. because of language rules and not because of an explicit cast. */
2862 tree
2864 {
2865 tree result;
2866 tree expr_for_warning;
2868 /* Convert from a value with possible excess precision rather than
2869 via the semantic type, but do not warn about values not fitting
2870 exactly in the semantic type. */
2872 {
2878 }
2879 else
2893 }
2894 \f
2895 /* A node in a list that describes references to variables (EXPR), which are
2896 either read accesses if WRITER is zero, or write accesses, in which case
2897 WRITER is the parent of EXPR. */
2898 struct tlist
2899 {
2902 };
2904 /* Used to implement a cache the results of a call to verify_tree. We only
2905 use this for SAVE_EXPRs. */
2906 struct tlist_cache
2907 {
2911 tree expr;
2912 };
2914 /* Obstack to use when allocating tlist structures, and corresponding
2915 firstobj. */
2919 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2920 warnings. */
2922 /* SAVE_EXPRs need special treatment. We process them only once and then
2923 cache the results. */
2935 /* Create a new struct tlist and fill in its fields. */
2938 {
2945 }
2947 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2948 is nonnull, we ignore any node we find which has a writer equal to it. */
2950 static void
2952 {
2954 {
2961 }
2962 }
2964 /* Merge the nodes of ADD into TO. This merging process is done so that for
2965 each variable that already exists in TO, no new node is added; however if
2966 there is a write access recorded in ADD, and an occurrence on TO is only
2967 a read access, then the occurrence in TO will be modified to record the
2968 write. */
2970 static void
2972 {
2979 {
2986 {
2990 }
2992 {
2996 }
2998 }
2999 }
3001 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3002 references in list LIST conflict with it, excluding reads if ONLY writers
3003 is nonzero. */
3005 static void
3008 {
3011 /* Avoid duplicate warnings. */
3017 {
3021 {
3026 }
3028 }
3029 }
3031 /* Given a list LIST of references to variables, find whether any of these
3032 can cause conflicts due to missing sequence points. */
3034 static void
3036 {
3040 {
3043 }
3044 }
3046 /* Return nonzero if X is a tree that can be verified by the sequence point
3047 warnings. */
3048 static int
3050 {
3057 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3058 (lvalue_p) crash on TRY/CATCH. */
3065 /* No point to track non-const calls, they will never satisfy
3066 operand_equal_p. */
3074 }
3076 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3077 static bool
3079 {
3081 }
3083 /* Walk the tree X, and record accesses to variables. If X is written by the
3084 parent tree, WRITER is the parent.
3085 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3086 expression or its only operand forces a sequence point, then everything up
3087 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3088 in PNO_SP.
3089 Once we return, we will have emitted warnings if any subexpression before
3090 such a sequence point could be undefined. On a higher level, however, the
3091 sequence point may not be relevant, and we'll merge the two lists.
3093 Example: (b++, a) + b;
3094 The call that processes the COMPOUND_EXPR will store the increment of B
3095 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3096 processes the PLUS_EXPR will need to merge the two lists so that
3097 eventually, all accesses end up on the same list (and we'll warn about the
3098 unordered subexpressions b++ and b.
3100 A note on merging. If we modify the former example so that our expression
3101 becomes
3102 (b++, b) + a
3103 care must be taken not simply to add all three expressions into the final
3104 PNO_SP list. The function merge_tlist takes care of that by merging the
3105 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3106 way, so that no more than one access to B is recorded. */
3108 static void
3110 tree writer)
3111 {
3116 /* X may be NULL if it is the operand of an empty statement expression
3117 ({ }). */
3121 restart:
3129 {
3162 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3163 two first, to avoid warning for (a ? b++ : b++). */
3179 /* Expressions inside the LHS are not ordered wrt. the sequence points
3180 in the RHS. Example:
3181 *a = (a++, 2)
3182 Despite the fact that the modification of "a" is in the before_sp
3183 list (tmp_before), it conflicts with the use of "a" in the LHS.
3184 We can handle this by adding the contents of tmp_list3
3185 to those of tmp_before, and redoing the collision warnings for that
3186 list. */
3189 /* Exclude the LHS itself here; we first have to merge it into the
3190 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3191 didn't exclude the LHS, we'd get it twice, once as a read and once
3192 as a write. */
3203 /* We need to warn about conflicts among arguments and conflicts between
3204 args and the function address. Side effects of the function address,
3205 however, are not ordered by the sequence point of the call. */
3206 {
3207 call_expr_arg_iterator iter;
3208 tree arg;
3212 {
3217 }
3222 }
3225 /* Scan all the list, e.g. indices of multi dimensional array. */
3227 {
3233 }
3237 {
3244 {
3258 }
3262 }
3272 /* For other expressions, simply recurse on their operands.
3273 Manual tail recursion for unary expressions.
3274 Other non-expressions need not be processed. */
3276 {
3280 }
3282 {
3286 {
3291 }
3292 }
3294 }
3295 }
3297 /* Try to warn for undefined behavior in EXPR due to missing sequence
3298 points. */
3300 DEBUG_FUNCTION void
3302 {
3308 {
3311 }
3316 }
3317 \f
3318 /* Validate the expression after `case' and apply default promotions. */
3320 static tree
3322 {
3327 /* Promote char or short to int. */
3330 {
3333 }
3338 }
3339 \f
3340 /* See if the case values LOW and HIGH are in the range of the original
3341 type (i.e. before the default conversion to int) of the switch testing
3342 expression.
3343 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3344 the type before promoting it. CASE_LOW_P is a pointer to the lower
3345 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3346 if the case is not a case range.
3347 The caller has to make sure that we are not called with NULL for
3348 CASE_LOW_P (i.e. the default case).
3349 Returns true if the case label is in range of ORIG_TYPE (saturated or
3350 untouched) or false if the label is out of range. */
3352 static bool
3355 {
3360 /* If there was a problem with the original type, do nothing. */
3367 /* Case label is less than minimum for type. */
3370 {
3373 }
3375 /* Case value is greater than maximum for type. */
3378 {
3381 }
3383 /* Saturate lower case label value to minimum. */
3386 {
3390 }
3392 /* Saturate upper case label value to maximum. */
3395 {
3399 }
3407 }
3408 \f
3409 /* Return an integer type with BITS bits of precision,
3410 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3412 tree
3414 {
3453 }
3455 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3456 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3457 and saturating if SATP is nonzero, otherwise not saturating. */
3459 tree
3462 {
3466 else
3474 {
3476 "fixed-point types that have too many integral and "
3479 }
3482 }
3484 /* Used for communication between c_common_type_for_mode and
3485 c_register_builtin_type. */
3488 /* Return a data type that has machine mode MODE.
3489 If the mode is an integer,
3490 then UNSIGNEDP selects between signed and unsigned types.
3491 If the mode is a fixed-point mode,
3492 then UNSIGNEDP selects between saturating and nonsaturating types. */
3494 tree
3496 {
3497 tree t;
3534 #if HOST_BITS_PER_WIDE_INT >= 64
3537 #endif
3562 {
3564 tree inner_type;
3580 }
3582 {
3587 }
3597 {
3683 }
3691 }
3693 tree
3695 {
3697 }
3699 /* Return a signed type the same as TYPE in other respects. */
3701 tree
3703 {
3705 }
3707 /* Return a type the same as TYPE except unsigned or
3708 signed according to UNSIGNEDP. */
3710 tree
3712 {
3713 tree type1;
3715 /* This block of code emulates the behavior of the old
3716 c_common_unsigned_type. In particular, it returns
3717 long_unsigned_type_node if passed a long, even when a int would
3718 have the same size. This is necessary for warnings to work
3719 correctly in archs where sizeof(int) == sizeof(long) */
3722 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3738 #if HOST_BITS_PER_WIDE_INT >= 64
3741 #endif
3751 #define C_COMMON_FIXED_TYPES(NAME) \
3752 if (type1 == short_ ## NAME ## _type_node \
3753 || type1 == unsigned_short_ ## NAME ## _type_node) \
3754 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3755 : short_ ## NAME ## _type_node; \
3756 if (type1 == NAME ## _type_node \
3757 || type1 == unsigned_ ## NAME ## _type_node) \
3758 return unsignedp ? unsigned_ ## NAME ## _type_node \
3759 : NAME ## _type_node; \
3760 if (type1 == long_ ## NAME ## _type_node \
3761 || type1 == unsigned_long_ ## NAME ## _type_node) \
3762 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3763 : long_ ## NAME ## _type_node; \
3764 if (type1 == long_long_ ## NAME ## _type_node \
3765 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3766 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3767 : long_long_ ## NAME ## _type_node;
3769 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3770 if (type1 == NAME ## _type_node \
3771 || type1 == u ## NAME ## _type_node) \
3772 return unsignedp ? u ## NAME ## _type_node \
3773 : NAME ## _type_node;
3775 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3776 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3777 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3778 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3779 : sat_ ## short_ ## NAME ## _type_node; \
3780 if (type1 == sat_ ## NAME ## _type_node \
3781 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3782 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3783 : sat_ ## NAME ## _type_node; \
3784 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3785 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3786 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3787 : sat_ ## long_ ## NAME ## _type_node; \
3788 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3789 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3790 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3791 : sat_ ## long_long_ ## NAME ## _type_node;
3793 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3794 if (type1 == sat_ ## NAME ## _type_node \
3795 || type1 == sat_ ## u ## NAME ## _type_node) \
3796 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3797 : sat_ ## NAME ## _type_node;
3823 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3824 the precision; they have precision set to match their range, but
3825 may use a wider mode to match an ABI. If we change modes, we may
3826 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3827 the precision as well, so as to yield correct results for
3828 bit-field types. C++ does not have these separate bit-field
3829 types, and producing a signed or unsigned variant of an
3830 ENUMERAL_TYPE may cause other problems as well. */
3836 #define TYPE_OK(node) \
3837 (TYPE_MODE (type) == TYPE_MODE (node) \
3838 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3857 #if HOST_BITS_PER_WIDE_INT >= 64
3860 #endif
3869 #undef TYPE_OK
3872 }
3874 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3876 tree
3878 {
3879 /* Extended integer types of the same width as a standard type have
3880 lesser rank, so those of the same width as int promote to int or
3881 unsigned int and are valid for printf formats expecting int or
3882 unsigned int. To avoid such special cases, avoid creating
3883 extended integer types for bit-fields if a standard integer type
3884 is available. */
3901 }
3903 /* The C version of the register_builtin_type langhook. */
3905 void
3907 {
3908 tree decl;
3918 }
3919 \f
3920 /* Print an error message for invalid operands to arith operation
3921 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3922 LOCATION is the location of the message. */
3924 void
3927 {
3931 {
3976 }
3980 }
3981 \f
3982 /* Given an expression as a tree, return its original type. Do this
3983 by stripping any conversion that preserves the sign and precision. */
3984 static tree
3986 {
3989 }
3991 /* Subroutine of build_binary_op, used for comparison operations.
3992 See if the operands have both been converted from subword integer types
3993 and, if so, perhaps change them both back to their original type.
3994 This function is also responsible for converting the two operands
3995 to the proper common type for comparison.
3997 The arguments of this function are all pointers to local variables
3998 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3999 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4001 LOC is the location of the comparison.
4003 If this function returns nonzero, it means that the comparison has
4004 a constant value. What this function returns is an expression for
4005 that value. */
4007 tree
4010 {
4011 tree type;
4019 /* Throw away any conversions to wider types
4020 already present in the operands. */
4025 /* If primopN is first sign-extended from primopN's precision to opN's
4026 precision, then zero-extended from opN's precision to
4027 *restype_ptr precision, shortenings might be invalid. */
4030 && !unsignedp0
4035 && !unsignedp1
4039 /* Handle the case that OP0 does not *contain* a conversion
4040 but it *requires* conversion to FINAL_TYPE. */
4047 /* If one of the operands must be floated, we cannot optimize. */
4051 /* If first arg is constant, swap the args (changing operation
4052 so value is preserved), for canonicalization. Don't do this if
4053 the second arg is 0. */
4058 {
4075 {
4090 }
4092 }
4094 /* If comparing an integer against a constant more bits wide,
4095 maybe we can deduce a value of 1 or 0 independent of the data.
4096 Or else truncate the constant now
4097 rather than extend the variable at run time.
4099 This is only interesting if the constant is the wider arg.
4100 Also, it is not safe if the constant is unsigned and the
4101 variable arg is signed, since in this case the variable
4102 would be sign-extended and then regarded as unsigned.
4103 Our technique fails in this case because the lowest/highest
4104 possible unsigned results don't follow naturally from the
4105 lowest/highest possible values of the variable operand.
4106 For just EQ_EXPR and NE_EXPR there is another technique that
4107 could be used: see if the constant can be faithfully represented
4108 in the other operand's type, by truncating it and reextending it
4109 and see if that preserves the constant's value. */
4115 {
4118 /* 1 if comparison is nominally unsigned. */
4120 tree val;
4132 {
4133 /* Convert primop1 to target type, but do not introduce
4134 additional overflow. We know primop1 is an int_cst. */
4138 }
4140 {
4143 }
4146 {
4151 }
4152 else
4153 {
4158 }
4161 /* This used to be a switch, but Genix compiler can't handle that. */
4163 {
4166 }
4168 {
4171 }
4173 {
4178 }
4180 {
4185 }
4187 {
4192 }
4194 {
4199 }
4201 /* If primop0 was sign-extended and unsigned comparison specd,
4202 we did a signed comparison above using the signed type bounds.
4203 But the comparison we output must be unsigned.
4205 Also, for inequalities, VAL is no good; but if the signed
4206 comparison had *any* fixed result, it follows that the
4207 unsigned comparison just tests the sign in reverse
4208 (positive values are LE, negative ones GE).
4209 So we can generate an unsigned comparison
4210 against an extreme value of the signed type. */
4213 {
4216 {
4231 }
4233 }
4236 {
4243 }
4246 {
4247 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4251 }
4253 /* Value is not predetermined, but do the comparison
4254 in the type of the operand that is not constant.
4255 TYPE is already properly set. */
4256 }
4258 /* If either arg is decimal float and the other is float, find the
4259 proper common type to use for comparison. */
4270 /* If args' natural types are both narrower than nominal type
4271 and both extend in the same manner, compare them
4272 in the type of the wider arg.
4273 Otherwise must actually extend both to the nominal
4274 common type lest different ways of extending
4275 alter the result.
4276 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4281 {
4285 type);
4286 /* Make sure shorter operand is extended the right way
4287 to match the longer operand. */
4288 primop0
4291 primop0);
4292 primop1
4295 primop1);
4296 }
4297 else
4298 {
4299 /* Here we must do the comparison on the nominal type
4300 using the args exactly as we received them. */
4307 {
4309 /* All unsigned values are >= 0, so we warn. However,
4310 if OP0 is a constant that is >= 0, the signedness of
4311 the comparison isn't an issue, so suppress the
4312 warning. */
4317 primop0)))
4318 /* Do not warn for enumeration types. */
4322 {
4339 }
4342 {
4343 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4348 }
4349 }
4350 }
4358 }
4359 \f
4360 /* Return a tree for the sum or difference (RESULTCODE says which)
4361 of pointer PTROP and integer INTOP. */
4363 tree
4366 {
4369 /* The result is a pointer of the same type that is being added. */
4373 {
4380 }
4382 {
4389 }
4390 else
4393 /* We are manipulating pointer values, so we don't need to warn
4394 about relying on undefined signed overflow. We disable the
4395 warning here because we use integer types so fold won't know that
4396 they are really pointers. */
4399 /* If what we are about to multiply by the size of the elements
4400 contains a constant term, apply distributive law
4401 and multiply that constant term separately.
4402 This helps produce common subexpressions. */
4407 /* If the constant comes from pointer subtraction,
4408 skip this optimization--it would cause an error. */
4410 /* If the constant is unsigned, and smaller than the pointer size,
4411 then we must skip this optimization. This is because it could cause
4412 an overflow error if the constant is negative but INTOP is not. */
4416 {
4421 /* Convert both subexpression types to the type of intop,
4422 because weird cases involving pointer arithmetic
4423 can result in a sum or difference with different type args. */
4428 }
4430 /* Convert the integer argument to a type the same size as sizetype
4431 so the multiply won't overflow spuriously. */
4437 /* Replace the integer argument with a suitable product by the object size.
4438 Do this multiplication as signed, then convert to the appropriate type
4439 for the pointer operation and disregard an overflow that occurred only
4440 because of the sign-extension change in the latter conversion. */
4441 {
4449 }
4451 /* Create the sum or difference. */
4460 }
4461 \f
4462 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4463 and if NON_CONST is known not to be permitted in an evaluated part
4464 of a constant expression. */
4466 tree
4468 {
4472 /* This should never be called for C++. */
4476 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4485 }
4487 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4488 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4489 around the SAVE_EXPR if needed so that c_fully_fold does not need
4490 to look inside SAVE_EXPRs. */
4492 tree
4494 {
4503 }
4505 /* Return whether EXPR is a declaration whose address can never be
4506 NULL. */
4508 bool
4510 {
4515 }
4517 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4518 or for an `if' or `while' statement or ?..: exp. It should already
4519 have been validated to be of suitable type; otherwise, a bad
4520 diagnostic may result.
4522 The EXPR is located at LOCATION.
4524 This preparation consists of taking the ordinary
4525 representation of an expression expr and producing a valid tree
4526 boolean expression describing whether expr is nonzero. We could
4527 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4528 but we optimize comparisons, &&, ||, and !.
4530 The resulting type should always be `truthvalue_type_node'. */
4532 tree
4534 {
4536 {
4578 ? truthvalue_true_node
4584 ? truthvalue_true_node
4589 /* Fall through. */
4592 {
4595 {
4596 /* Common Ada/Pascal programmer's mistake. */
4598 OPT_Waddress,
4600 inner);
4602 }
4604 }
4621 /* These don't change whether an object is nonzero or zero. */
4626 /* These don't change whether an object is zero or nonzero, but
4627 we can't ignore them if their second arg has side-effects. */
4629 {
4632 c_common_truthvalue_conversion
4635 }
4636 else
4641 /* Distribute the conversion into the arms of a COND_EXPR. */
4643 {
4646 /* In C++ one of the arms might have void type if it is throw. */
4654 }
4655 else
4656 {
4657 /* Folding will happen later for C. */
4665 }
4667 CASE_CONVERT:
4668 {
4672 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4673 since that affects how `default_conversion' will behave. */
4677 /* Don't strip a conversion from C++0x scoped enum, since they
4678 don't implicitly convert to other types. */
4682 /* If this isn't narrowing the argument, we can ignore it. */
4686 }
4692 {
4696 }
4701 }
4704 {
4706 expr = (build_binary_op
4710 c_common_truthvalue_conversion
4713 c_common_truthvalue_conversion
4718 }
4721 {
4726 }
4727 else
4730 ret:
4733 }
4734 \f
4743 /* Apply the TYPE_QUALS to the new DECL. */
4745 void
4747 {
4755 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4756 constructor can produce constant init, so rely on cp_finish_decl to
4757 clear TREE_READONLY if the variable has non-constant init. */
4760 {
4763 }
4765 {
4767 /* Allow 'restrict' on arrays of pointers.
4768 FIXME currently we just ignore it. */
4774 }
4775 }
4777 /* Hash function for the problem of multiple type definitions in
4778 different files. This must hash all types that will compare
4779 equal via comptypes to the same value. In practice it hashes
4780 on some of the simple stuff and leaves the details to comptypes. */
4782 static hashval_t
4784 {
4788 tree t2;
4790 {
4791 /* For pointers, hash on pointee type plus some swizzling. */
4794 /* Hash on number of elements and total size. */
4813 }
4814 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4815 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4817 /* We might have a VLA here. */
4820 else
4823 }
4827 /* Return the typed-based alias set for T, which may be an expression
4828 or a type. Return -1 if we don't do anything special. */
4830 alias_set_type
4832 {
4833 tree u;
4836 /* For VLAs, use the alias set of the element type rather than the
4837 default of alias set 0 for types compared structurally. */
4839 {
4843 }
4845 /* Permit type-punning when accessing a union, provided the access
4846 is directly through the union. For example, this code does not
4847 permit taking the address of a union member and then storing
4848 through it. Even the type-punning allowed here is a GCC
4849 extension, albeit a common and useful one; the C standard says
4850 that such accesses have implementation-defined behavior. */
4858 /* That's all the expressions we handle specially. */
4862 /* The C standard guarantees that any object may be accessed via an
4863 lvalue that has character type. */
4869 /* The C standard specifically allows aliasing between signed and
4870 unsigned variants of the same type. We treat the signed
4871 variant as canonical. */
4873 {
4876 /* t1 == t can happen for boolean nodes which are always unsigned. */
4879 }
4881 /* Handle the case of multiple type nodes referring to "the same" type,
4882 which occurs with IMA. These share an alias set. FIXME: Currently only
4883 C90 is handled. (In C99 type compatibility is not transitive, which
4884 complicates things mightily. The alias set splay trees can theoretically
4885 represent this, but insertion is tricky when you consider all the
4886 different orders things might arrive in.) */
4891 /* Save time if there's only one input file. */
4895 /* Pointers need special handling if they point to any type that
4896 needs special handling (below). */
4898 {
4899 tree t2;
4900 /* Find bottom type under any nested POINTERs. */
4904 ;
4912 }
4913 /* These are the only cases that need special handling. */
4920 /* Undefined? */
4924 /* Look up t in hash table. Only one of the compatible types within each
4925 alias set is recorded in the table. */
4929 NULL);
4932 {
4935 }
4936 else
4937 /* Our caller will assign and record (in t) a new alias set; all we need
4938 to do is remember t in the hash table. */
4942 }
4943 \f
4944 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4945 the IS_SIZEOF parameter indicates which operator is being applied.
4946 The COMPLAIN flag controls whether we should diagnose possibly
4947 ill-formed constructs or not. LOC is the location of the SIZEOF or
4948 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4949 a type in any context should be returned, rather than the normal
4950 alignment for that type. */
4952 tree
4956 {
4964 {
4966 {
4973 }
4974 else
4975 {
4977 {
4981 else
4984 }
4986 }
4987 }
4989 {
4997 }
5000 {
5005 }
5008 {
5013 }
5014 else
5015 {
5017 /* Convert in case a char is more than one unit. */
5022 {
5025 #ifdef BIGGEST_FIELD_ALIGNMENT
5027 #endif
5029 #ifdef ADJUST_FIELD_ALIGN
5031 type);
5033 #endif
5036 }
5037 else
5039 }
5041 /* VALUE will have the middle-end integer type sizetype.
5042 However, we should really return a value of type `size_t',
5043 which is just a typedef for an ordinary integer type. */
5047 }
5049 /* Implement the __alignof keyword: Return the minimum required
5050 alignment of EXPR, measured in bytes. For VAR_DECLs,
5051 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5052 from an "aligned" __attribute__ specification). LOC is the
5053 location of the ALIGNOF operator. */
5055 tree
5057 {
5058 tree t;
5065 {
5068 }
5074 {
5081 {
5088 }
5090 }
5091 else
5095 }
5096 \f
5097 /* Handle C and C++ default attributes. */
5099 enum built_in_attribute
5100 {
5101 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5102 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5103 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5104 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5105 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5107 #undef DEF_ATTR_NULL_TREE
5108 #undef DEF_ATTR_INT
5109 #undef DEF_ATTR_STRING
5110 #undef DEF_ATTR_IDENT
5111 #undef DEF_ATTR_TREE_LIST
5112 ATTR_LAST
5113 };
5119 enum c_builtin_type
5120 {
5121 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5122 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5123 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5124 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5125 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5126 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5127 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5128 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5129 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5130 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5131 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5132 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5133 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5134 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5135 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5136 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5137 NAME,
5138 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5140 #undef DEF_PRIMITIVE_TYPE
5141 #undef DEF_FUNCTION_TYPE_0
5142 #undef DEF_FUNCTION_TYPE_1
5143 #undef DEF_FUNCTION_TYPE_2
5144 #undef DEF_FUNCTION_TYPE_3
5145 #undef DEF_FUNCTION_TYPE_4
5146 #undef DEF_FUNCTION_TYPE_5
5147 #undef DEF_FUNCTION_TYPE_6
5148 #undef DEF_FUNCTION_TYPE_7
5149 #undef DEF_FUNCTION_TYPE_8
5150 #undef DEF_FUNCTION_TYPE_VAR_0
5151 #undef DEF_FUNCTION_TYPE_VAR_1
5152 #undef DEF_FUNCTION_TYPE_VAR_2
5153 #undef DEF_FUNCTION_TYPE_VAR_3
5154 #undef DEF_FUNCTION_TYPE_VAR_4
5155 #undef DEF_FUNCTION_TYPE_VAR_5
5156 #undef DEF_POINTER_TYPE
5157 BT_LAST
5158 };
5162 /* A temporary array for c_common_nodes_and_builtins. Used in
5163 communication with def_fn_type. */
5166 /* A helper function for c_common_nodes_and_builtins. Build function type
5167 for DEF with return type RET and N arguments. If VAR is true, then the
5168 function should be variadic after those N arguments.
5170 Takes special care not to ICE if any of the types involved are
5171 error_mark_node, which indicates that said type is not in fact available
5172 (see builtin_type_for_size). In which case the function type as a whole
5173 should be error_mark_node. */
5175 static void
5177 {
5178 tree t;
5185 {
5191 }
5198 else
5201 egress:
5204 }
5206 /* Build builtin functions common to both C and C++ language
5207 frontends. */
5209 static void
5211 {
5212 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5213 builtin_types[ENUM] = VALUE;
5214 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5215 def_fn_type (ENUM, RETURN, 0, 0);
5216 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5217 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5218 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5219 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5220 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5221 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5222 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5223 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5224 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5225 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5226 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5227 ARG6) \
5228 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5229 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5230 ARG6, ARG7) \
5231 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5232 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5233 ARG6, ARG7, ARG8) \
5234 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5235 ARG7, ARG8);
5236 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5237 def_fn_type (ENUM, RETURN, 1, 0);
5238 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5239 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5240 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5241 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5242 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5243 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5244 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5245 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5246 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5247 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5248 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5249 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5253 #undef DEF_PRIMITIVE_TYPE
5254 #undef DEF_FUNCTION_TYPE_1
5255 #undef DEF_FUNCTION_TYPE_2
5256 #undef DEF_FUNCTION_TYPE_3
5257 #undef DEF_FUNCTION_TYPE_4
5258 #undef DEF_FUNCTION_TYPE_5
5259 #undef DEF_FUNCTION_TYPE_6
5260 #undef DEF_FUNCTION_TYPE_VAR_0
5261 #undef DEF_FUNCTION_TYPE_VAR_1
5262 #undef DEF_FUNCTION_TYPE_VAR_2
5263 #undef DEF_FUNCTION_TYPE_VAR_3
5264 #undef DEF_FUNCTION_TYPE_VAR_4
5265 #undef DEF_FUNCTION_TYPE_VAR_5
5266 #undef DEF_POINTER_TYPE
5271 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5272 NONANSI_P, ATTRS, IMPLICIT, COND) \
5273 if (NAME && COND) \
5274 def_builtin_1 (ENUM, NAME, CLASS, \
5275 builtin_types[(int) TYPE], \
5276 builtin_types[(int) LIBTYPE], \
5277 BOTH_P, FALLBACK_P, NONANSI_P, \
5278 built_in_attributes[(int) ATTRS], IMPLICIT);
5280 #undef DEF_BUILTIN
5288 }
5290 /* Like get_identifier, but avoid warnings about null arguments when
5291 the argument may be NULL for targets where GCC lacks stdint.h type
5292 information. */
5296 {
5298 }
5300 /* Build tree nodes and builtin functions common to both C and C++ language
5301 frontends. */
5303 void
5305 {
5309 tree array_domain_type;
5310 tree va_list_ref_type_node;
5311 tree va_list_arg_type_node;
5315 /* Define `int' and `char' first so that dbx will output them first. */
5319 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5320 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5321 but not C. Are the conditionals here needed? */
5327 long_unsigned_type_node);
5329 {
5331 int128_integer_type_node);
5333 int128_unsigned_type_node);
5334 }
5338 long_long_integer_type_node);
5340 long_long_unsigned_type_node);
5343 long_long_unsigned_type_node);
5346 short_unsigned_type_node);
5349 short_unsigned_type_node);
5351 /* Define both `signed char' and `unsigned char'. */
5355 /* These are types that c_common_type_for_size and
5356 c_common_type_for_mode use. */
5359 intQI_type_node));
5362 intHI_type_node));
5365 intSI_type_node));
5368 intDI_type_node));
5369 #if HOST_BITS_PER_WIDE_INT >= 64
5372 TYPE_DECL,
5374 intTI_type_node));
5375 #endif
5378 unsigned_intQI_type_node));
5381 unsigned_intHI_type_node));
5384 unsigned_intSI_type_node));
5387 unsigned_intDI_type_node));
5388 #if HOST_BITS_PER_WIDE_INT >= 64
5391 TYPE_DECL,
5393 unsigned_intTI_type_node));
5394 #endif
5396 /* Create the widest literal types. */
5397 widest_integer_literal_type_node
5401 widest_integer_literal_type_node));
5403 widest_unsigned_literal_type_node
5407 widest_unsigned_literal_type_node));
5411 pid_type_node =
5418 /* Only supported decimal floating point extension if the target
5419 actually supports underlying modes. */
5423 {
5427 }
5430 {
5435 long_long_fract_type_node);
5437 unsigned_short_fract_type_node);
5439 unsigned_fract_type_node);
5441 unsigned_long_fract_type_node);
5443 unsigned_long_long_fract_type_node);
5445 sat_short_fract_type_node);
5448 sat_long_fract_type_node);
5450 sat_long_long_fract_type_node);
5452 sat_unsigned_short_fract_type_node);
5454 sat_unsigned_fract_type_node);
5456 sat_unsigned_long_fract_type_node);
5458 sat_unsigned_long_long_fract_type_node);
5463 long_long_accum_type_node);
5465 unsigned_short_accum_type_node);
5467 unsigned_accum_type_node);
5469 unsigned_long_accum_type_node);
5471 unsigned_long_long_accum_type_node);
5473 sat_short_accum_type_node);
5476 sat_long_accum_type_node);
5478 sat_long_long_accum_type_node);
5480 sat_unsigned_short_accum_type_node);
5482 sat_unsigned_accum_type_node);
5484 sat_unsigned_long_accum_type_node);
5486 sat_unsigned_long_long_accum_type_node);
5488 }
5491 TYPE_DECL,
5493 complex_integer_type_node));
5495 TYPE_DECL,
5497 complex_float_type_node));
5499 TYPE_DECL,
5501 complex_double_type_node));
5505 complex_long_double_type_node));
5508 /* For C++, make fileptr_type_node a distinct void * type until
5509 FILE type is defined. */
5514 /* Set the TYPE_NAME for any variants that were built before
5515 record_builtin_type gave names to the built-in types. */
5516 {
5522 }
5524 /* This node must not be shared. */
5530 /* Make a type to be the domain of a few array types
5531 whose domains don't really matter.
5532 200 is small enough that it always fits in size_t
5533 and large enough that it can hold most function names for the
5534 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5537 /* Make a type for arrays of characters.
5538 With luck nothing will ever really depend on the length of this
5539 array type. */
5540 char_array_type_node
5544 const_string_type_node
5548 /* This is special for C++ so functions can be overloaded. */
5554 {
5557 else
5560 }
5562 /* This is for wide string constants. */
5563 wchar_array_type_node
5566 /* Define 'char16_t'. */
5571 {
5576 }
5578 /* This is for UTF-16 string constants. */
5579 char16_array_type_node
5582 /* Define 'char32_t'. */
5587 {
5592 }
5594 /* This is for UTF-32 string constants. */
5595 char32_array_type_node
5598 wint_type_node =
5601 intmax_type_node =
5603 uintmax_type_node =
5607 sig_atomic_type_node =
5610 int8_type_node =
5613 int16_type_node =
5616 int32_type_node =
5619 int64_type_node =
5622 uint8_type_node =
5634 int_least8_type_node =
5637 int_least16_type_node =
5640 int_least32_type_node =
5643 int_least64_type_node =
5646 uint_least8_type_node =
5649 uint_least16_type_node =
5652 uint_least32_type_node =
5655 uint_least64_type_node =
5658 int_fast8_type_node =
5661 int_fast16_type_node =
5664 int_fast32_type_node =
5667 int_fast64_type_node =
5670 uint_fast8_type_node =
5673 uint_fast16_type_node =
5676 uint_fast32_type_node =
5679 uint_fast64_type_node =
5682 intptr_type_node =
5685 uintptr_type_node =
5688 default_function_type
5690 ptrdiff_type_node
5697 va_list_type_node));
5699 {
5702 tree ptype;
5705 {
5709 ptype));
5711 }
5712 }
5715 {
5718 }
5719 else
5720 {
5723 }
5730 /* Create the built-in __null node. It is important that this is
5731 not shared. */
5735 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5737 }
5739 /* The number of named compound-literals generated thus far. */
5742 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5744 void
5746 {
5749 compound_literal_number);
5750 compound_literal_number++;
5752 }
5754 tree
5756 {
5760 }
5763 /* Linked list of disabled built-in functions. */
5766 {
5774 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5775 begins with "__builtin_", give an error. */
5777 void
5779 {
5782 else
5783 {
5788 }
5789 }
5792 /* Return true if the built-in function NAME has been disabled, false
5793 otherwise. */
5795 static bool
5797 {
5800 {
5803 }
5805 }
5808 /* Worker for DEF_BUILTIN.
5809 Possibly define a builtin function with one or two names.
5810 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5811 nonansi_p and flag_no_nonansi_builtin. */
5813 static void
5820 {
5821 tree decl;
5834 fnattrs);
5843 }
5844 \f
5845 /* Nonzero if the type T promotes to int. This is (nearly) the
5846 integral promotions defined in ISO C99 6.3.1.1/2. */
5848 bool
5850 {
5852 {
5862 /* ??? Technically all enumerations not larger than an int
5863 promote to an int. But this is used along code paths
5864 that only want to notice a size change. */
5872 }
5873 }
5875 /* Return 1 if PARMS specifies a fixed number of parameters
5876 and none of their types is affected by default promotions. */
5878 int
5880 {
5881 const_tree t;
5883 {
5900 }
5902 }
5904 /* Recursively remove any '*' or '&' operator from TYPE. */
5905 tree
5907 {
5911 }
5913 /* Recursively remove pointer or array type from TYPE. */
5914 tree
5916 {
5920 }
5922 /* Used to compare case labels. K1 and K2 are actually tree nodes
5923 representing case labels, or NULL_TREE for a `default' label.
5924 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5925 K2, and 0 if K1 and K2 are equal. */
5927 int
5929 {
5930 /* Consider a NULL key (such as arises with a `default' label) to be
5931 smaller than anything else. */
5938 }
5940 /* Process a case label, located at LOC, for the range LOW_VALUE
5941 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5942 then this case label is actually a `default' label. If only
5943 HIGH_VALUE is NULL_TREE, then case label was declared using the
5944 usual C/C++ syntax, rather than the GNU case range extension.
5945 CASES is a tree containing all the case ranges processed so far;
5946 COND is the condition for the switch-statement itself. Returns the
5947 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5948 is created. */
5950 tree
5953 {
5954 tree type;
5955 tree label;
5956 tree case_label;
5957 splay_tree_node node;
5959 /* Create the LABEL_DECL itself. */
5962 /* If there was an error processing the switch condition, bail now
5963 before we get more confused. */
5971 {
5974 }
5976 /* Case ranges are a GNU extension. */
5983 {
5988 }
5990 {
5995 }
5998 {
5999 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6000 really a case range, even though it was written that way.
6001 Remove the HIGH_VALUE to simplify later processing. */
6006 }
6008 /* See if the case is in range of the type of the original testing
6009 expression. If both low_value and high_value are out of range,
6010 don't insert the case label and return NULL_TREE. */
6016 /* Look up the LOW_VALUE in the table of case labels we already
6017 have. */
6019 /* If there was not an exact match, check for overlapping ranges.
6020 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6021 that's a `default' label and the only overlap is an exact match. */
6023 {
6024 splay_tree_node low_bound;
6025 splay_tree_node high_bound;
6027 /* Even though there wasn't an exact match, there might be an
6028 overlap between this case range and another case range.
6029 Since we've (inductively) not allowed any overlapping case
6030 ranges, we simply need to find the greatest low case label
6031 that is smaller that LOW_VALUE, and the smallest low case
6032 label that is greater than LOW_VALUE. If there is an overlap
6033 it will occur in one of these two ranges. */
6039 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6040 the LOW_VALUE, so there is no need to check unless the
6041 LOW_BOUND is in fact itself a case range. */
6047 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6048 range is bigger than the low end of the current range, so we
6049 are only interested if the current range is a real range, and
6050 not an ordinary case label. */
6052 && high_value
6054 high_value)
6057 }
6058 /* If there was an overlap, issue an error. */
6060 {
6064 {
6068 }
6070 {
6073 }
6074 else
6075 {
6079 }
6081 }
6083 /* Add a CASE_LABEL to the statement-tree. */
6085 /* Register this case label in the splay tree. */
6092 error_out:
6093 /* Add a label so that the back-end doesn't think that the beginning of
6094 the switch is unreachable. Note that we do not add a case label, as
6095 that just leads to duplicates and thence to failure later on. */
6097 {
6100 }
6102 }
6104 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6105 Used to verify that case values match up with enumerator values. */
6107 static void
6109 {
6112 /* ??? Not working too hard to print the double-word value.
6113 Should perhaps be done with %lwd in the diagnostic routines? */
6122 else
6131 buf);
6132 else
6137 }
6139 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6140 Used to verify that case values match up with enumerator values. */
6142 static int
6144 {
6148 /* Skip default case. */
6152 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6153 when we did our enum->case scan. Reset our scratch bit after. */
6156 else
6159 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6160 not set, that means that CASE_HIGH did not appear when we did our
6161 enum->case scan. Reset our scratch bit after. */
6163 {
6166 else
6168 }
6171 }
6173 /* Handle -Wswitch*. Called from the front end after parsing the
6174 switch construct. */
6175 /* ??? Should probably be somewhere generic, since other languages
6176 besides C and C++ would want this. At the moment, however, C/C++
6177 are the only tree-ssa languages that support enumerations at all,
6178 so the point is moot. */
6180 void
6183 {
6184 splay_tree_node default_node;
6185 splay_tree_node node;
6186 tree chain;
6196 /* From here on, we only care about about enumerated types. */
6200 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6204 /* Check the cases. Warn about case values which are not members of
6205 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6206 there is no default case, check that exactly all enumeration
6207 literals are covered by the cases. */
6209 /* Clearing COND if it is not an integer constant simplifies
6210 the tests inside the loop below. */
6214 /* The time complexity here is O(N*lg(N)) worst case, but for the
6215 common case of monotonically increasing enumerators, it is
6216 O(N), since the nature of the splay tree will keep the next
6217 element adjacent to the root at all times. */
6220 {
6226 {
6227 /* Mark the CASE_LOW part of the case entry as seen. */
6231 }
6233 /* Even though there wasn't an exact match, there might be a
6234 case range which includes the enumerator's value. */
6237 {
6241 {
6242 /* If we match the upper bound exactly, mark the CASE_HIGH
6243 part of the case entry as seen. */
6247 }
6248 }
6250 /* We've now determined that this enumerated literal isn't
6251 handled by the case labels of the switch statement. */
6253 /* If the switch expression is a constant, we only really care
6254 about whether that constant is handled by the switch. */
6258 /* If there is a default_node, the only relevant option is
6259 Wswitch-enum. Otherwise, if both are enabled then we prefer
6260 to warn using -Wswitch because -Wswitch is enabled by -Wall
6261 while -Wswitch-enum is explicit. */
6264 ? OPT_Wswitch_enum
6268 }
6270 /* Warn if there are case expressions that don't correspond to
6271 enumerators. This can occur since C and C++ don't enforce
6272 type-checking of assignments to enumeration variables.
6274 The time complexity here is now always O(N) worst case, since
6275 we should have marked both the lower bound and upper bound of
6276 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6277 above. This scan also resets those fields. */
6280 }
6282 /* Finish an expression taking the address of LABEL (an
6283 IDENTIFIER_NODE). Returns an expression for the address.
6285 LOC is the location for the expression returned. */
6287 tree
6289 {
6290 tree result;
6300 else
6301 {
6304 /* The current function is not necessarily uninlinable.
6305 Computed gotos are incompatible with inlining, but the value
6306 here could be used only in a diagnostic, for example. */
6308 }
6311 }
6312 \f
6314 /* Given a boolean expression ARG, return a tree representing an increment
6315 or decrement (as indicated by CODE) of ARG. The front end must check for
6316 invalid cases (e.g., decrement in C++). */
6317 tree
6319 {
6320 tree val;
6325 {
6348 }
6351 }
6352 \f
6353 /* Built-in macros for stddef.h and stdint.h, that require macros
6354 defined in this file. */
6355 void
6357 {
6420 }
6422 static void
6424 {
6425 /* Fill in the built_in_attributes array. */
6426 #define DEF_ATTR_NULL_TREE(ENUM) \
6427 built_in_attributes[(int) ENUM] = NULL_TREE;
6428 #define DEF_ATTR_INT(ENUM, VALUE) \
6429 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6430 #define DEF_ATTR_STRING(ENUM, VALUE) \
6431 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6432 #define DEF_ATTR_IDENT(ENUM, STRING) \
6433 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6434 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6435 built_in_attributes[(int) ENUM] \
6436 = tree_cons (built_in_attributes[(int) PURPOSE], \
6437 built_in_attributes[(int) VALUE], \
6438 built_in_attributes[(int) CHAIN]);
6440 #undef DEF_ATTR_NULL_TREE
6441 #undef DEF_ATTR_INT
6442 #undef DEF_ATTR_IDENT
6443 #undef DEF_ATTR_TREE_LIST
6444 }
6446 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6447 identifier as an argument, so the front end shouldn't look it up. */
6449 bool
6451 {
6454 /* Unknown attribute that we'll end up ignoring, return true so we
6455 don't complain about an identifier argument. */
6461 else
6463 }
6465 /* Attribute handlers common to C front ends. */
6467 /* Handle a "packed" attribute; arguments as in
6468 struct attribute_spec.handler. */
6470 static tree
6473 {
6475 {
6479 }
6481 {
6483 /* Still pack bitfields. */
6488 else
6490 }
6491 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6492 used for DECL_REGISTER. It wouldn't mean anything anyway.
6493 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6494 that changes what the typedef is typing. */
6495 else
6496 {
6499 }
6502 }
6504 /* Handle a "nocommon" attribute; arguments as in
6505 struct attribute_spec.handler. */
6507 static tree
6511 {
6514 else
6515 {
6518 }
6521 }
6523 /* Handle a "common" attribute; arguments as in
6524 struct attribute_spec.handler. */
6526 static tree
6529 {
6532 else
6533 {
6536 }
6539 }
6541 /* Handle a "noreturn" attribute; arguments as in
6542 struct attribute_spec.handler. */
6544 static tree
6547 {
6550 /* See FIXME comment in c_common_attribute_table. */
6557 = build_pointer_type
6560 else
6561 {
6564 }
6567 }
6569 /* Handle a "hot" and attribute; arguments as in
6570 struct attribute_spec.handler. */
6572 static tree
6575 {
6578 {
6580 {
6584 }
6585 /* Most of the rest of the hot processing is done later with
6586 lookup_attribute. */
6587 }
6588 else
6589 {
6592 }
6595 }
6597 /* Handle a "cold" and attribute; arguments as in
6598 struct attribute_spec.handler. */
6600 static tree
6603 {
6606 {
6608 {
6612 }
6613 /* Most of the rest of the cold processing is done later with
6614 lookup_attribute. */
6615 }
6616 else
6617 {
6620 }
6623 }
6625 /* Handle a "no_sanitize_address" attribute; arguments as in
6626 struct attribute_spec.handler. */
6628 static tree
6631 {
6633 {
6636 }
6639 }
6641 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6642 struct attribute_spec.handler. */
6644 static tree
6647 {
6656 }
6658 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6659 struct attribute_spec.handler. */
6661 static tree
6664 {
6666 {
6669 }
6672 }
6674 /* Handle a "noinline" attribute; arguments as in
6675 struct attribute_spec.handler. */
6677 static tree
6681 {
6684 else
6685 {
6688 }
6691 }
6693 /* Handle a "noclone" attribute; arguments as in
6694 struct attribute_spec.handler. */
6696 static tree
6700 {
6702 {
6705 }
6708 }
6710 /* Handle a "always_inline" attribute; arguments as in
6711 struct attribute_spec.handler. */
6713 static tree
6718 {
6720 {
6721 /* Set the attribute and mark it for disregarding inline
6722 limits. */
6724 }
6725 else
6726 {
6729 }
6732 }
6734 /* Handle a "gnu_inline" attribute; arguments as in
6735 struct attribute_spec.handler. */
6737 static tree
6742 {
6744 {
6745 /* Do nothing else, just set the attribute. We'll get at
6746 it later with lookup_attribute. */
6747 }
6748 else
6749 {
6752 }
6755 }
6757 /* Handle a "leaf" attribute; arguments as in
6758 struct attribute_spec.handler. */
6760 static tree
6764 {
6766 {
6769 }
6771 {
6774 }
6777 }
6779 /* Handle an "artificial" attribute; arguments as in
6780 struct attribute_spec.handler. */
6782 static tree
6787 {
6789 {
6790 /* Do nothing else, just set the attribute. We'll get at
6791 it later with lookup_attribute. */
6792 }
6793 else
6794 {
6797 }
6800 }
6802 /* Handle a "flatten" attribute; arguments as in
6803 struct attribute_spec.handler. */
6805 static tree
6807 tree args ATTRIBUTE_UNUSED,
6809 {
6811 /* Do nothing else, just set the attribute. We'll get at
6812 it later with lookup_attribute. */
6813 ;
6814 else
6815 {
6818 }
6821 }
6823 /* Handle a "warning" or "error" attribute; arguments as in
6824 struct attribute_spec.handler. */
6826 static tree
6829 {
6832 /* Do nothing else, just set the attribute. We'll get at
6833 it later with lookup_attribute. */
6834 ;
6835 else
6836 {
6839 }
6842 }
6844 /* Handle a "used" attribute; arguments as in
6845 struct attribute_spec.handler. */
6847 static tree
6850 {
6856 {
6861 }
6862 else
6863 {
6866 }
6869 }
6871 /* Handle a "unused" attribute; arguments as in
6872 struct attribute_spec.handler. */
6874 static tree
6877 {
6879 {
6888 {
6893 }
6894 else
6895 {
6898 }
6899 }
6900 else
6901 {
6905 }
6908 }
6910 /* Handle a "externally_visible" attribute; arguments as in
6911 struct attribute_spec.handler. */
6913 static tree
6918 {
6922 {
6925 {
6929 }
6930 }
6931 else
6932 {
6935 }
6938 }
6940 /* Handle a "const" attribute; arguments as in
6941 struct attribute_spec.handler. */
6943 static tree
6946 {
6949 /* See FIXME comment on noreturn in c_common_attribute_table. */
6955 = build_pointer_type
6958 else
6959 {
6962 }
6965 }
6967 /* Handle a "transparent_union" attribute; arguments as in
6968 struct attribute_spec.handler. */
6970 static tree
6974 {
6975 tree type;
6986 {
6987 /* Make sure that the first field will work for a transparent union.
6988 If the type isn't complete yet, leave the check to the code in
6989 finish_struct. */
6991 {
6997 }
7000 {
7001 /* If the type isn't complete yet, setting the flag
7002 on a variant wouldn't ever be checked. */
7006 /* build_duplicate_type doesn't work for C++. */
7010 /* A type variant isn't good enough, since we don't a cast
7011 to such a type removed as a no-op. */
7013 }
7017 }
7019 ignored:
7022 }
7024 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7025 get the requested priority for a constructor or destructor,
7026 possibly issuing diagnostics for invalid or reserved
7027 priorities. */
7029 static priority_type
7031 {
7032 HOST_WIDE_INT pri;
7033 tree arg;
7039 {
7042 else
7045 }
7062 {
7065 "destructor priorities from 0 to %d are reserved "
7067 MAX_RESERVED_INIT_PRIORITY);
7068 else
7070 "constructor priorities from 0 to %d are reserved "
7072 MAX_RESERVED_INIT_PRIORITY);
7073 }
7076 invalid:
7079 MAX_INIT_PRIORITY);
7080 else
7082 MAX_INIT_PRIORITY);
7084 }
7086 /* Handle a "constructor" attribute; arguments as in
7087 struct attribute_spec.handler. */
7089 static tree
7093 {
7100 {
7101 priority_type priority;
7106 }
7107 else
7108 {
7111 }
7114 }
7116 /* Handle a "destructor" attribute; arguments as in
7117 struct attribute_spec.handler. */
7119 static tree
7123 {
7130 {
7131 priority_type priority;
7136 }
7137 else
7138 {
7141 }
7144 }
7146 /* Nonzero if the mode is a valid vector mode for this architecture.
7147 This returns nonzero even if there is no hardware support for the
7148 vector mode, but we can emulate with narrower modes. */
7150 static int
7152 {
7156 /* Doh! What's going on? */
7165 /* Hardware support. Woo hoo! */
7171 /* We should probably return 1 if requesting V4DI and we have no DI,
7172 but we have V2DI, but this is probably very unlikely. */
7174 /* If we have support for the inner mode, we can safely emulate it.
7175 We may not have V2DI, but me can emulate with a pair of DIs. */
7177 }
7180 /* Handle a "mode" attribute; arguments as in
7181 struct attribute_spec.handler. */
7183 static tree
7186 {
7194 else
7195 {
7200 tree typefm;
7205 {
7211 }
7213 /* Change this type to have a type with the specified mode.
7214 First check for the special modes. */
7227 else
7230 {
7233 }
7236 {
7239 }
7243 {
7275 }
7277 {
7280 }
7283 {
7288 {
7291 }
7295 else
7298 }
7299 else
7300 {
7301 /* For fixed-point modes, we need to test if the signness of type
7302 and the machine mode are consistent. */
7305 {
7308 }
7309 /* For fixed-point modes, we need to pass saturating info. */
7313 }
7316 {
7319 }
7321 {
7322 /* For enumeral types, copy the precision from the integer
7323 type returned above. If not an INTEGER_TYPE, we can't use
7324 this mode for this type. */
7326 {
7329 }
7332 {
7335 }
7336 else
7337 {
7338 /* We cannot build a type variant, as there's code that assumes
7339 that TYPE_MAIN_VARIANT has the same mode. This includes the
7340 debug generators. Instead, create a subrange type. This
7341 results in all of the enumeral values being emitted only once
7342 in the original, and the subtype gets them by reference. */
7345 else
7348 }
7349 }
7353 {
7356 }
7359 }
7362 }
7364 /* Handle a "section" attribute; arguments as in
7365 struct attribute_spec.handler. */
7367 static tree
7370 {
7374 {
7380 {
7384 {
7386 "section attribute cannot be specified for "
7389 }
7391 /* The decl may have already been given a section attribute
7392 from a previous declaration. Ensure they match. */
7396 {
7400 }
7404 {
7407 }
7408 else
7410 }
7411 else
7412 {
7415 }
7416 }
7417 else
7418 {
7422 }
7425 }
7427 /* Check whether ALIGN is a valid user-specified alignment. If so,
7428 return its base-2 log; if not, output an error and return -1. If
7429 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7430 no error. */
7431 int
7433 {
7438 {
7441 }
7446 {
7449 }
7451 {
7454 }
7456 }
7458 /*
7459 If in c++-11, check if the c++-11 alignment constraint with respect
7460 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7461 c++-11 mode, does nothing.
7463 [dcl.align]2/ says:
7465 [* if the constant expression evaluates to a fundamental alignment,
7466 the alignment requirement of the declared entity shall be the
7467 specified fundamental alignment.
7469 * if the constant expression evaluates to an extended alignment
7470 and the implementation supports that alignment in the context
7471 of the declaration, the alignment of the declared entity shall
7472 be that alignment
7474 * if the constant expression evaluates to an extended alignment
7475 and the implementation does not support that alignment in the
7476 context of the declaration, the program is ill-formed]. */
7478 static bool
7482 {
7495 {
7497 {
7498 /* For file scope variables and static members, the target
7499 supports alignments that are at most
7500 MAX_OFILE_ALIGNMENT. */
7503 }
7504 else
7505 {
7506 #ifdef BIGGEST_FIELD_ALIGNMENT
7507 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7508 #else
7509 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7510 #endif
7511 /* For non-static members, the target supports either
7512 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7513 if it is defined or BIGGEST_ALIGNMENT. */
7518 #undef MAX_TARGET_FIELD_ALIGNMENT
7519 /* For stack variables, the target supports at most
7520 MAX_STACK_ALIGNMENT. */
7524 }
7525 }
7527 {
7528 /* Let's be liberal for types. */
7531 }
7539 }
7541 /* Handle a "aligned" attribute; arguments as in
7542 struct attribute_spec.handler. */
7544 static tree
7547 {
7551 tree align_expr;
7555 {
7559 }
7560 else
7564 {
7568 }
7576 {
7579 /* If we have a TYPE_DECL, then copy the type, so that we
7580 don't accidentally modify a builtin type. See pushdecl. */
7583 {
7590 }
7591 else
7596 }
7599 {
7602 }
7605 /* C++-11 [dcl.align/4]:
7607 When multiple alignment-specifiers are specified for an
7608 entity, the alignment requirement shall be set to the
7609 strictest specified alignment.
7611 This formally comes from the c++11 specification but we are
7612 doing it for the GNU attribute syntax as well. */
7616 {
7621 else
7625 }
7626 else
7627 {
7630 }
7633 }
7635 /* Handle a "weak" attribute; arguments as in
7636 struct attribute_spec.handler. */
7638 static tree
7643 {
7646 {
7649 }
7651 {
7655 }
7659 else
7663 }
7665 /* Handle an "alias" or "ifunc" attribute; arguments as in
7666 struct attribute_spec.handler, except that IS_ALIAS tells us
7667 whether this is an alias as opposed to ifunc attribute. */
7669 static tree
7672 {
7677 {
7680 }
7684 /* A static variable declaration is always a tentative definition,
7685 but the alias is a non-tentative definition which overrides. */
7688 {
7692 }
7696 {
7700 }
7702 /* Note that the very first time we process a nested declaration,
7703 decl_function_context will not be set. Indeed, *would* never
7704 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7705 we do below. After such frobbery, pushdecl would set the context.
7706 In any case, this is never what we want. */
7708 {
7709 tree id;
7713 {
7717 }
7719 /* This counts as a use of the object pointed to. */
7724 else
7728 /* ifuncs are also aliases, so set that attribute too. */
7731 }
7732 else
7733 {
7736 }
7739 }
7741 /* Handle an "alias" or "ifunc" attribute; arguments as in
7742 struct attribute_spec.handler. */
7744 static tree
7747 {
7749 }
7751 /* Handle an "alias" or "ifunc" attribute; arguments as in
7752 struct attribute_spec.handler. */
7754 static tree
7757 {
7759 }
7761 /* Handle a "weakref" attribute; arguments as in struct
7762 attribute_spec.handler. */
7764 static tree
7767 {
7770 /* We must ignore the attribute when it is associated with
7771 local-scoped decls, since attribute alias is ignored and many
7772 such symbols do not even have a DECL_WEAK field. */
7774 || current_function_decl
7776 {
7780 }
7783 {
7787 }
7789 /* The idea here is that `weakref("name")' mutates into `weakref,
7790 alias("name")', and weakref without arguments, in turn,
7791 implicitly adds weak. */
7794 {
7801 }
7802 else
7803 {
7808 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7809 and that isn't supported; and because it wants to add it to
7810 the list of weak decls, which isn't helpful. */
7812 }
7815 }
7817 /* Handle an "visibility" attribute; arguments as in
7818 struct attribute_spec.handler. */
7820 static tree
7824 {
7830 {
7834 {
7836 name);
7838 }
7840 {
7844 }
7845 }
7847 {
7850 }
7853 {
7856 }
7858 /* If this is a type, set the visibility on the type decl. */
7860 {
7865 {
7867 name);
7869 }
7870 }
7880 else
7881 {
7882 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7884 }
7888 {
7902 }
7907 /* Go ahead and attach the attribute to the node as well. This is needed
7908 so we can determine whether we have VISIBILITY_DEFAULT because the
7909 visibility was not specified, or because it was explicitly overridden
7910 from the containing scope. */
7913 }
7915 /* Determine the ELF symbol visibility for DECL, which is either a
7916 variable or a function. It is an error to use this function if a
7917 definition of DECL is not available in this translation unit.
7918 Returns true if the final visibility has been determined by this
7919 function; false if the caller is free to make additional
7920 modifications. */
7922 bool
7924 {
7928 /* If the user explicitly specified the visibility with an
7929 attribute, honor that. DECL_VISIBILITY will have been set during
7930 the processing of the attribute. We check for an explicit
7931 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7932 to distinguish the use of an attribute from the use of a "#pragma
7933 GCC visibility push(...)"; in the latter case we still want other
7934 considerations to be able to overrule the #pragma. */
7936 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7941 /* Set default visibility to whatever the user supplied with
7942 visibility_specified depending on #pragma GCC visibility. */
7944 {
7947 {
7950 /* If visibility changed and DECL already has DECL_RTL, ensure
7951 symbol flags are updated. */
7956 }
7957 }
7959 }
7961 /* Handle an "tls_model" attribute; arguments as in
7962 struct attribute_spec.handler. */
7964 static tree
7967 {
7968 tree id;
7975 {
7978 }
7983 {
7986 }
7996 else
7997 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8001 }
8003 /* Handle a "no_instrument_function" attribute; arguments as in
8004 struct attribute_spec.handler. */
8006 static tree
8011 {
8015 {
8019 }
8020 else
8024 }
8026 /* Handle a "malloc" attribute; arguments as in
8027 struct attribute_spec.handler. */
8029 static tree
8032 {
8036 else
8037 {
8040 }
8043 }
8045 /* Handle a "alloc_size" attribute; arguments as in
8046 struct attribute_spec.handler. */
8048 static tree
8051 {
8054 {
8061 || !arg_count
8063 {
8068 }
8069 }
8071 }
8073 /* Handle a "alloc_align" attribute; arguments as in
8074 struct attribute_spec.handler. */
8076 static tree
8079 {
8086 || !arg_count
8088 {
8093 }
8095 }
8097 /* Handle a "assume_aligned" attribute; arguments as in
8098 struct attribute_spec.handler. */
8100 static tree
8103 {
8105 {
8112 {
8117 }
8118 }
8120 }
8122 /* Handle a "fn spec" attribute; arguments as in
8123 struct attribute_spec.handler. */
8125 static tree
8129 {
8134 }
8136 /* Handle a "warn_unused" attribute; arguments as in
8137 struct attribute_spec.handler. */
8139 static tree
8141 tree args ATTRIBUTE_UNUSED,
8143 {
8145 /* Do nothing else, just set the attribute. We'll get at
8146 it later with lookup_attribute. */
8147 ;
8148 else
8149 {
8152 }
8155 }
8157 /* Handle an "omp declare simd" attribute; arguments as in
8158 struct attribute_spec.handler. */
8160 static tree
8162 {
8164 }
8166 /* Handle an "omp declare target" attribute; arguments as in
8167 struct attribute_spec.handler. */
8169 static tree
8171 {
8173 }
8175 /* Handle a "returns_twice" attribute; arguments as in
8176 struct attribute_spec.handler. */
8178 static tree
8181 {
8184 else
8185 {
8188 }
8191 }
8193 /* Handle a "no_limit_stack" attribute; arguments as in
8194 struct attribute_spec.handler. */
8196 static tree
8201 {
8205 {
8209 }
8211 {
8215 }
8216 else
8220 }
8222 /* Handle a "pure" attribute; arguments as in
8223 struct attribute_spec.handler. */
8225 static tree
8228 {
8231 /* ??? TODO: Support types. */
8232 else
8233 {
8236 }
8239 }
8241 /* Digest an attribute list destined for a transactional memory statement.
8242 ALLOWED is the set of attributes that are allowed for this statement;
8243 return the attribute we parsed. Multiple attributes are never allowed. */
8245 int
8247 {
8252 {
8260 {
8263 }
8266 {
8269 }
8272 else
8274 }
8277 }
8279 /* Transform a TM attribute name into a maskable integer and back.
8280 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8281 to how the lack of an attribute is treated. */
8283 int
8285 {
8299 }
8301 tree
8303 {
8306 {
8324 }
8326 }
8328 /* Return the first TM attribute seen in LIST. */
8330 tree
8332 {
8334 {
8338 }
8340 }
8342 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8343 Here we accept only function types, and verify that none of the other
8344 function TM attributes are also applied. */
8345 /* ??? We need to accept class types for C++, but not C. This greatly
8346 complicates this function, since we can no longer rely on the extra
8347 processing given by function_type_required. */
8349 static tree
8352 {
8353 /* Only one path adds the attribute; others don't. */
8357 {
8360 /* Only tm_callable and tm_safe apply to classes. */
8363 /* FALLTHRU */
8367 {
8370 ;
8373 else
8375 }
8379 {
8382 {
8387 }
8388 }
8389 /* FALLTHRU */
8392 /* If a function is next, pass it on to be tried next. */
8396 ignored:
8399 }
8402 }
8404 /* Handle the TM_WRAP attribute; arguments as in
8405 struct attribute_spec.handler. */
8407 static tree
8410 {
8413 /* We don't need the attribute even on success, since we
8414 record the entry in an external table. */
8419 else
8420 {
8426 else
8427 {
8431 {
8435 else
8437 }
8438 else
8440 }
8441 }
8444 }
8446 /* Ignore the given attribute. Used when this attribute may be usefully
8447 overridden by the target, but is not used generically. */
8449 static tree
8453 {
8456 }
8458 /* Handle a "no vops" attribute; arguments as in
8459 struct attribute_spec.handler. */
8461 static tree
8465 {
8469 }
8471 /* Handle a "deprecated" attribute; arguments as in
8472 struct attribute_spec.handler. */
8474 static tree
8478 {
8486 {
8489 }
8492 {
8503 else
8505 }
8507 {
8512 }
8513 else
8517 {
8520 {
8526 }
8529 else
8531 }
8534 }
8536 /* Handle a "vector_size" attribute; arguments as in
8537 struct attribute_spec.handler. */
8539 static tree
8543 {
8555 {
8558 }
8560 /* Get the vector size (in bytes). */
8563 /* We need to provide for vector pointers, vector arrays, and
8564 functions returning vectors. For example:
8566 __attribute__((vector_size(16))) short *foo;
8568 In this case, the mode is SI, but the type being modified is
8569 HI, so we need to look further. */
8578 /* Get the mode of the type being modified. */
8589 {
8592 }
8595 {
8598 }
8601 {
8604 }
8606 /* Calculate how many units fit in the vector. */
8609 {
8612 }
8616 /* Build back pointers if needed. */
8620 }
8622 /* Handle the "nonnull" attribute. */
8623 static tree
8627 {
8631 /* If no arguments are specified, all pointer arguments should be
8632 non-null. Verify a full prototype is given so that the arguments
8633 will have the correct types when we actually check them later. */
8635 {
8637 {
8640 }
8642 }
8644 /* Argument list specified. Verify that each argument number references
8645 a pointer argument. */
8647 {
8656 {
8661 }
8664 {
8665 function_args_iterator iter;
8666 tree argument;
8670 {
8674 }
8678 {
8683 }
8686 {
8691 }
8692 }
8693 }
8696 }
8698 /* Handle a "always_patch_for_instrumentation" attribute; arguments as in
8699 struct attribute_spec.handler. */
8701 static tree
8706 {
8708 {
8709 /* Disable inlining if forced instrumentation. */
8711 }
8712 else
8713 {
8716 }
8718 }
8721 /* Handle a "never_patch_for_instrumentation" attribute; arguments as in
8722 struct attribute_spec.handler. */
8724 static tree
8729 {
8731 {
8734 }
8736 }
8739 /* Check the argument list of a function call for null in argument slots
8740 that are marked as requiring a non-null pointer argument. The NARGS
8741 arguments are passed in the array ARGARRAY.
8742 */
8744 static void
8746 {
8747 tree a;
8755 /* See if any of the nonnull attributes has no arguments. If so,
8756 then every pointer argument is checked (in which case the check
8757 for pointer type is done in check_nonnull_arg). */
8759 do
8767 else
8768 {
8769 /* Walk the argument list. If we encounter an argument number we
8770 should check for non-null, do it. */
8772 {
8774 {
8778 }
8783 }
8784 }
8785 }
8787 /* Check that the Nth argument of a function call (counting backwards
8788 from the end) is a (pointer)0. The NARGS arguments are passed in the
8789 array ARGARRAY. */
8791 static void
8793 {
8797 {
8800 tree sentinel;
8801 function_args_iterator iter;
8802 tree t;
8804 /* Skip over the named arguments. */
8806 {
8809 len++;
8810 }
8813 {
8816 }
8818 /* The sentinel must be one of the varargs, i.e.
8819 in position >= the number of fixed arguments. */
8821 {
8825 }
8827 /* Validate the sentinel. */
8831 /* Although __null (in C++) is only an integer we allow it
8832 nevertheless, as we are guaranteed that it's exactly
8833 as wide as a pointer, and we don't want to force
8834 users to cast the NULL they have written there.
8835 We warn with -Wstrict-null-sentinel, though. */
8838 }
8839 }
8841 /* Helper for check_function_nonnull; given a list of operands which
8842 must be non-null in ARGS, determine if operand PARAM_NUM should be
8843 checked. */
8845 static bool
8847 {
8851 {
8858 }
8860 }
8862 /* Check that the function argument PARAM (which is operand number
8863 PARAM_NUM) is non-null. This is called by check_function_nonnull
8864 via check_function_arguments_recurse. */
8866 static void
8869 {
8870 /* Just skip checking the argument if it's not a pointer. This can
8871 happen if the "nonnull" attribute was given without an operand
8872 list (which means to check every pointer argument). */
8880 }
8882 /* Helper for nonnull attribute handling; fetch the operand number
8883 from the attribute argument list. */
8885 static bool
8887 {
8888 /* Verify the arg number is a constant. */
8895 }
8897 /* Handle a "nothrow" attribute; arguments as in
8898 struct attribute_spec.handler. */
8900 static tree
8903 {
8906 /* ??? TODO: Support types. */
8907 else
8908 {
8911 }
8914 }
8916 /* Handle a "cleanup" attribute; arguments as in
8917 struct attribute_spec.handler. */
8919 static tree
8922 {
8926 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8927 for global destructors in C++. This requires infrastructure that
8928 we don't have generically at the moment. It's also not a feature
8929 we'd be missing too much, since we do have attribute constructor. */
8931 {
8935 }
8937 /* Verify that the argument is a function in scope. */
8938 /* ??? We could support pointers to functions here as well, if
8939 that was considered desirable. */
8942 {
8946 }
8949 {
8953 }
8955 /* That the function has proper type is checked with the
8956 eventual call to build_function_call. */
8959 }
8961 /* Handle a "warn_unused_result" attribute. No special handling. */
8963 static tree
8967 {
8968 /* Ignore the attribute for functions not returning any value. */
8970 {
8973 }
8976 }
8978 /* Handle a "sentinel" attribute. */
8980 static tree
8983 {
8985 {
8989 }
8990 else
8991 {
8993 {
8997 }
8998 }
9001 {
9005 {
9009 }
9010 else
9011 {
9013 {
9017 }
9018 }
9019 }
9022 }
9024 /* Handle a "type_generic" attribute. */
9026 static tree
9030 {
9031 /* Ensure we have a function type. */
9034 /* Ensure we have a variadic function. */
9038 }
9040 /* Handle a "target" attribute. */
9042 static tree
9045 {
9046 /* Ensure we have a function type. */
9048 {
9051 }
9053 flags))
9057 }
9059 /* Arguments being collected for optimization. */
9064 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9065 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9066 false for #pragma GCC optimize. */
9068 bool
9070 {
9078 tree ap;
9080 /* Build up argv vector. Just in case the string is stored away, use garbage
9081 collected strings. */
9086 {
9090 {
9094 }
9097 {
9098 /* Split string into multiple substrings. */
9106 {
9113 {
9117 }
9118 else
9119 {
9122 }
9126 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9127 options. */
9129 {
9134 else
9138 }
9141 {
9144 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9145 itself is -Os, and any other switch begins with a -f. */
9151 }
9156 }
9158 }
9159 }
9169 /* Now parse the options. */
9179 /* Don't allow changing -fstrict-aliasing. */
9184 }
9186 /* For handling "optimize" attribute. arguments as in
9187 struct attribute_spec.handler. */
9189 static tree
9192 {
9193 /* Ensure we have a function type. */
9195 {
9198 }
9199 else
9200 {
9204 /* Save current options. */
9207 /* If we previously had some optimization options, use them as the
9208 default. */
9213 /* Parse options, and update the vector. */
9218 /* Restore current options. */
9220 }
9223 }
9225 /* Handle a "no_split_stack" attribute. */
9227 static tree
9232 {
9236 {
9240 }
9242 {
9246 }
9249 }
9251 /* Handle a "returns_nonnull" attribute; arguments as in
9252 struct attribute_spec.handler. */
9254 static tree
9257 {
9258 // Even without a prototype we still have a return type we can check.
9260 {
9263 }
9265 }
9267 \f
9268 /* Check for valid arguments being passed to a function with FNTYPE.
9269 There are NARGS arguments in the array ARGARRAY. */
9270 void
9272 {
9273 /* Check for null being passed in a pointer argument that must be
9274 non-null. We also need to do this if format checking is enabled. */
9279 /* Check for errors in format strings. */
9286 }
9288 /* Generic argument checking recursion routine. PARAM is the argument to
9289 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9290 once the argument is resolved. CTX is context for the callback. */
9291 void
9296 {
9300 {
9301 /* Strip coercion. */
9305 }
9308 {
9310 tree attrs;
9313 /* See if this is a call to a known internationalization function
9314 that modifies a format arg. Such a function may have multiple
9315 format_arg attributes (for example, ngettext). */
9318 attrs;
9321 {
9322 tree inner_arg;
9323 tree format_num_expr;
9326 call_expr_arg_iterator iter;
9328 /* Extract the argument number, which was previously checked
9329 to be valid. */
9338 {
9343 }
9344 }
9346 /* If we found a format_arg attribute and did a recursive check,
9347 we are done with checking this argument. Otherwise, we continue
9348 and this will be considered a non-literal. */
9351 }
9354 {
9355 /* Check both halves of the conditional expression. */
9361 }
9364 }
9366 /* Checks for a builtin function FNDECL that the number of arguments
9367 NARGS against the required number REQUIRED and issues an error if
9368 there is a mismatch. Returns true if the number of arguments is
9369 correct, otherwise false. */
9371 static bool
9373 {
9375 {
9379 }
9381 {
9385 }
9387 }
9389 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9390 Returns false if there was an error, otherwise true. */
9392 bool
9394 {
9400 {
9410 {
9412 {
9416 }
9418 }
9428 {
9435 {
9439 }
9441 }
9446 {
9451 {
9455 }
9458 {
9460 fndecl);
9462 }
9464 }
9469 {
9471 {
9474 }
9476 }
9481 }
9482 }
9484 /* Function to help qsort sort FIELD_DECLs by name order. */
9486 int
9488 {
9493 /* A nontype is "greater" than a type. */
9502 }
9505 gt_pointer_operator new_value;
9509 /* This routine compares two fields like field_decl_cmp but using the
9510 pointer operator in resort_data. */
9512 static int
9514 {
9519 /* A nontype is "greater" than a type. */
9525 {
9532 }
9534 }
9536 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9538 void
9541 gt_pointer_operator new_value,
9543 {
9548 resort_field_decl_cmp);
9549 }
9551 /* Subroutine of c_parse_error.
9552 Return the result of concatenating LHS and RHS. RHS is really
9553 a string literal, its first character is indicated by RHS_START and
9554 RHS_SIZE is its length (including the terminating NUL character).
9556 The caller is responsible for deleting the returned pointer. */
9560 {
9566 }
9568 /* Issue the error given by GMSGID, indicating that it occurred before
9569 TOKEN, which had the associated VALUE. */
9571 void
9574 {
9575 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9585 {
9590 {
9603 }
9607 else
9613 }
9635 {
9640 }
9648 {
9653 }
9654 else
9658 {
9661 }
9662 #undef catenate_messages
9663 }
9665 /* Mapping for cpp message reasons to the options that enable them. */
9667 struct reason_option_codes_t
9668 {
9671 };
9692 };
9694 /* Return the gcc option code associated with the reason for a cpp
9695 message, or 0 if none. */
9697 static int
9699 {
9703 {
9706 }
9708 }
9710 /* Callback from cpp_error for PFILE to print diagnostics from the
9711 preprocessor. The diagnostic is of type LEVEL, with REASON set
9712 to the reason code if LEVEL is represents a warning, at location
9713 LOCATION unless this is after lexing and the compiler's location
9714 should be used instead, with column number possibly overridden by
9715 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9716 the arguments. Returns true if a diagnostic was emitted, false
9717 otherwise. */
9719 bool
9723 {
9724 diagnostic_info diagnostic;
9725 diagnostic_t dlevel;
9730 {
9735 /* Fall through. */
9760 }
9773 }
9775 /* Convert a character from the host to the target execution character
9776 set. cpplib handles this, mostly. */
9778 HOST_WIDE_INT
9780 {
9781 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9782 zero-extended under -fno-signed-char. cpplib insists that characters
9783 and character constants are always unsigned. Hence we must convert
9784 back and forth. */
9792 else
9794 }
9796 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9797 references with an INDIRECT_REF of a constant at the bottom; much like the
9798 traditional rendering of offsetof as a macro. Return the folded result. */
9800 tree
9802 {
9806 {
9822 {
9825 }
9835 {
9839 }
9852 /* Check if the offset goes beyond the upper bound of the array. */
9854 {
9860 {
9864 {
9865 tree v;
9872 {
9880 }
9881 /* Don't warn if the array might be considered a poor
9882 man's flexible array member with a very permissive
9883 definition thereof. */
9887 "index %E denotes an offset "
9890 }
9891 }
9892 }
9899 /* Handle static members of volatile structs. */
9906 }
9909 }
9911 /* Likewise, but convert it to the return type of offsetof. */
9913 tree
9915 {
9917 }
9919 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9920 expression, because B will always be true. */
9922 void
9924 {
9927 "the omitted middle operand in ?: will always be %<true%>, "
9929 }
9931 /* Give an error for storing into ARG, which is 'const'. USE indicates
9932 how ARG was being used. */
9934 void
9936 {
9939 /* Using this macro rather than (for example) arrays of messages
9940 ensures that all the format strings are checked at compile
9941 time. */
9942 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9943 : (use == lv_increment ? (I) \
9944 : (use == lv_decrement ? (D) : (AS))))
9946 {
9957 else
9963 }
9969 arg);
9975 arg);
9977 {
9987 arg);
9988 }
9994 arg);
9995 else
10000 arg);
10001 }
10003 /* Print an error message for an invalid lvalue. USE says
10004 how the lvalue is being used and so selects the error message. LOC
10005 is the location for the error. */
10007 void
10009 {
10011 {
10029 }
10030 }
10032 /* Print an error message for an invalid indirection of type TYPE.
10033 ERRSTRING is the name of the operator for the indirection. */
10035 void
10037 {
10039 {
10047 type);
10052 type);
10057 type);
10062 type);
10067 type);
10071 }
10072 }
10073 \f
10074 /* *PTYPE is an incomplete array. Complete it with a domain based on
10075 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10076 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10077 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10079 int
10081 {
10089 {
10091 {
10092 int eltsize
10095 }
10097 {
10101 {
10105 }
10106 else
10107 {
10108 tree curindex;
10119 {
10123 else
10124 {
10126 {
10127 /* Since we treat size types now as ordinary
10128 unsigned types, we need an explicit overflow
10129 check. */
10133 }
10135 size_one_node);
10136 }
10139 }
10141 {
10145 }
10146 }
10147 }
10148 else
10149 {
10150 /* Make an error message unless that happened already. */
10153 }
10154 }
10155 else
10156 {
10160 }
10167 else
10170 /* Using build_distinct_type_copy and modifying things afterward instead
10171 of using build_array_type to create a new type preserves all of the
10172 TYPE_LANG_FLAG_? bits that the front end may have set. */
10180 /* Make sure we have the canonical MAIN_TYPE. */
10183 hashcode);
10186 /* Fix the canonical type. */
10196 else
10201 else
10207 {
10209 /* If we proceed with the array type as it is, we'll eventually
10210 crash in tree_to_[su]hwi(). */
10212 }
10216 }
10218 /* Like c_mark_addressable but don't check register qualifier. */
10219 void
10221 {
10227 }
10230 \f
10231 /* Used to help initialize the builtin-types.def table. When a type of
10232 the correct size doesn't exist, use error_mark_node instead of NULL.
10233 The later results in segfaults even when a decl using the type doesn't
10234 get invoked. */
10236 tree
10238 {
10241 }
10243 /* A helper function for resolve_overloaded_builtin in resolving the
10244 overloaded __sync_ builtins. Returns a positive power of 2 if the
10245 first operand of PARAMS is a pointer to a supported data type.
10246 Returns 0 if an error is encountered. */
10248 static int
10250 {
10251 tree type;
10255 {
10258 }
10272 incompatible:
10275 }
10277 /* A helper function for resolve_overloaded_builtin. Adds casts to
10278 PARAMS to make arguments match up with those of FUNCTION. Drops
10279 the variadic arguments at the end. Returns false if some error
10280 was encountered; true on success. */
10282 static bool
10285 {
10286 function_args_iterator iter;
10287 tree ptype;
10291 /* We've declared the implementation functions to use "volatile void *"
10292 as the pointer parameter, so we shouldn't get any complaints from the
10293 call to check_function_arguments what ever type the user used. */
10298 /* For the rest of the values, we need to cast these to FTYPE, so that we
10299 don't get warnings for passing pointer types, etc. */
10302 {
10306 /* XXX void_type_node belies the abstraction. */
10312 {
10315 }
10317 /* Only convert parameters if arg_type is unsigned integer type with
10318 new format sync routines, i.e. don't attempt to convert pointer
10319 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10320 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10321 kinds). */
10323 {
10324 /* Ideally for the first conversion we'd use convert_for_assignment
10325 so that we get warnings for anything that doesn't match the pointer
10326 type. This isn't portable across the C and C++ front ends atm. */
10331 }
10334 }
10336 /* __atomic routines are not variadic. */
10338 {
10341 }
10343 /* The definition of these primitives is variadic, with the remaining
10344 being "an optional list of variables protected by the memory barrier".
10345 No clue what that's supposed to mean, precisely, but we consider all
10346 call-clobbered variables to be protected so we're safe. */
10350 }
10352 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10353 RESULT to make it match the type of the first pointer argument in
10354 PARAMS. */
10356 static tree
10358 {
10363 /* New format doesn't require casting unless the types are the same size. */
10366 else
10368 }
10370 /* This function verifies the PARAMS to generic atomic FUNCTION.
10371 It returns the size if all the parameters are the same size, otherwise
10372 0 is returned if the parameters are invalid. */
10374 static int
10377 {
10382 tree type_0;
10384 /* Determine the parameter makeup. */
10386 {
10402 }
10405 {
10408 }
10410 /* Get type of first parameter, and determine its size. */
10413 {
10415 function);
10417 }
10419 /* Types must be compile time constant sizes. */
10421 {
10424 function);
10426 }
10430 /* Zero size objects are not allowed. */
10432 {
10435 function);
10437 }
10439 /* Check each other parameter is a pointer and the same size. */
10441 {
10444 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10448 {
10450 function);
10452 }
10455 {
10457 function);
10459 }
10460 }
10462 /* Check memory model parameters for validity. */
10464 {
10467 {
10470 {
10473 function);
10474 }
10475 }
10476 else
10478 {
10480 function);
10482 }
10483 }
10486 }
10489 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10490 at the beginning of the parameter list PARAMS representing the size of the
10491 objects. This is to match the library ABI requirement. LOC is the location
10492 of the function call.
10493 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10494 returned to allow the external call to be constructed. */
10496 static tree
10499 {
10500 tree size_node;
10502 /* Insert a SIZE_T parameter as the first param. If there isn't
10503 enough space, allocate a new vector and recursively re-build with that. */
10505 {
10508 tree f;
10518 }
10520 /* Add the size parameter and leave as a function call for processing. */
10524 }
10527 /* Return whether atomic operations for naturally aligned N-byte
10528 arguments are supported, whether inline or through libatomic. */
10529 static bool
10531 {
10533 {
10545 }
10546 }
10548 /* This will process an __atomic_exchange function call, determine whether it
10549 needs to be mapped to the _N variation, or turned into a library call.
10550 LOC is the location of the builtin call.
10551 FUNCTION is the DECL that has been invoked;
10552 PARAMS is the argument list for the call. The return value is non-null
10553 TRUE is returned if it is translated into the proper format for a call to the
10554 external library, and NEW_RETURN is set the tree for that function.
10555 FALSE is returned if processing for the _N variation is required, and
10556 NEW_RETURN is set to the the return value the result is copied into. */
10557 static bool
10560 {
10565 /* Size of 0 is an error condition. */
10567 {
10570 }
10572 /* If not a lock-free size, change to the library generic format. */
10574 {
10577 }
10579 /* Otherwise there is a lockfree match, transform the call from:
10580 void fn(T* mem, T* desired, T* return, model)
10581 into
10582 *return = (T) (fn (In* mem, (In) *desired, model)) */
10589 /* Create pointer to appropriate size. */
10593 /* Convert object pointer to required type. */
10596 /* Convert new value to required type, and dereference it. */
10601 /* Move memory model to the 3rd position, and end param list. */
10605 /* Convert return pointer and dereference it for later assignment. */
10609 }
10612 /* This will process an __atomic_compare_exchange function call, determine
10613 whether it needs to be mapped to the _N variation, or turned into a lib call.
10614 LOC is the location of the builtin call.
10615 FUNCTION is the DECL that has been invoked;
10616 PARAMS is the argument list for the call. The return value is non-null
10617 TRUE is returned if it is translated into the proper format for a call to the
10618 external library, and NEW_RETURN is set the tree for that function.
10619 FALSE is returned if processing for the _N variation is required. */
10621 static bool
10625 {
10630 /* Size of 0 is an error condition. */
10632 {
10635 }
10637 /* If not a lock-free size, change to the library generic format. */
10639 {
10640 /* The library generic format does not have the weak parameter, so
10641 remove it from the param list. Since a parameter has been removed,
10642 we can be sure that there is room for the SIZE_T parameter, meaning
10643 there will not be a recursive rebuilding of the parameter list, so
10644 there is no danger this will be done twice. */
10646 {
10650 }
10653 }
10655 /* Otherwise, there is a match, so the call needs to be transformed from:
10656 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10657 into
10658 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10664 /* Create pointer to appropriate size. */
10668 /* Convert object pointer to required type. */
10672 /* Convert expected pointer to required type. */
10676 /* Convert desired value to required type, and dereference it. */
10681 /* The rest of the parameters are fine. NULL means no special return value
10682 processing.*/
10685 }
10688 /* This will process an __atomic_load function call, determine whether it
10689 needs to be mapped to the _N variation, or turned into a library call.
10690 LOC is the location of the builtin call.
10691 FUNCTION is the DECL that has been invoked;
10692 PARAMS is the argument list for the call. The return value is non-null
10693 TRUE is returned if it is translated into the proper format for a call to the
10694 external library, and NEW_RETURN is set the tree for that function.
10695 FALSE is returned if processing for the _N variation is required, and
10696 NEW_RETURN is set to the the return value the result is copied into. */
10698 static bool
10701 {
10706 /* Size of 0 is an error condition. */
10708 {
10711 }
10713 /* If not a lock-free size, change to the library generic format. */
10715 {
10718 }
10720 /* Otherwise, there is a match, so the call needs to be transformed from:
10721 void fn(T* mem, T* return, model)
10722 into
10723 *return = (T) (fn ((In *) mem, model)) */
10729 /* Create pointer to appropriate size. */
10733 /* Convert object pointer to required type. */
10737 /* Move memory model to the 2nd position, and end param list. */
10741 /* Convert return pointer and dereference it for later assignment. */
10745 }
10748 /* This will process an __atomic_store function call, determine whether it
10749 needs to be mapped to the _N variation, or turned into a library call.
10750 LOC is the location of the builtin call.
10751 FUNCTION is the DECL that has been invoked;
10752 PARAMS is the argument list for the call. The return value is non-null
10753 TRUE is returned if it is translated into the proper format for a call to the
10754 external library, and NEW_RETURN is set the tree for that function.
10755 FALSE is returned if processing for the _N variation is required, and
10756 NEW_RETURN is set to the the return value the result is copied into. */
10758 static bool
10761 {
10766 /* Size of 0 is an error condition. */
10768 {
10771 }
10773 /* If not a lock-free size, change to the library generic format. */
10775 {
10778 }
10780 /* Otherwise, there is a match, so the call needs to be transformed from:
10781 void fn(T* mem, T* value, model)
10782 into
10783 fn ((In *) mem, (In) *value, model) */
10788 /* Create pointer to appropriate size. */
10792 /* Convert object pointer to required type. */
10796 /* Convert new value to required type, and dereference it. */
10801 /* The memory model is in the right spot already. Return is void. */
10805 }
10808 /* Some builtin functions are placeholders for other expressions. This
10809 function should be called immediately after parsing the call expression
10810 before surrounding code has committed to the type of the expression.
10812 LOC is the location of the builtin call.
10814 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10815 PARAMS is the argument list for the call. The return value is non-null
10816 when expansion is complete, and null if normal processing should
10817 continue. */
10819 tree
10822 {
10828 {
10834 else
10838 }
10840 /* Handle BUILT_IN_NORMAL here. */
10842 {
10847 {
10848 /* Handle these 4 together so that they can fall through to the next
10849 case if the call is transformed to an _N variant. */
10851 {
10853 {
10857 /* Change to the _N variant. */
10860 }
10863 {
10865 params,
10868 /* Change to the _N variant. */
10871 }
10873 {
10877 /* Change to the _N variant. */
10880 }
10882 {
10886 /* Change to the _N variant. */
10889 }
10892 }
10893 /* Fallthrough to the normal processing. */
10894 }
10911 {
10913 /* Fallthru for parameter processing. */
10914 }
10931 {
10942 orig_format))
10947 NULL);
10955 /* If new_return is set, assign function to that expr and cast the
10956 result to void since the generic interface returned void. */
10958 {
10959 /* Cast function result from I{1,2,4,8,16} to the required type. */
10962 result);
10966 }
10968 }
10972 }
10973 }
10975 /* vector_types_compatible_elements_p is used in type checks of vectors
10976 values used as operands of binary operators. Where it returns true, and
10977 the other checks of the caller succeed (being vector types in he first
10978 place, and matching number of elements), we can just treat the types
10979 as essentially the same.
10980 Contrast with vector_targets_convertible_p, which is used for vector
10981 pointer types, and vector_types_convertible_p, which will allow
10982 language-specific matches under the control of flag_lax_vector_conversions,
10983 and might still require a conversion. */
10984 /* True if vector types T1 and T2 can be inputs to the same binary
10985 operator without conversion.
10986 We don't check the overall vector size here because some of our callers
10987 want to give different error messages when the vectors are compatible
10988 except for the element count. */
10990 bool
10992 {
11005 /* Equality works here because c_common_signed_type uses
11006 TYPE_MAIN_VARIANT. */
11014 }
11016 /* Check for missing format attributes on function pointers. LTYPE is
11017 the new type or left-hand side type. RTYPE is the old type or
11018 right-hand side type. Returns TRUE if LTYPE is missing the desired
11019 attribute. */
11021 bool
11023 {
11025 tree ra;
11031 {
11032 tree la;
11037 }
11038 else
11040 }
11042 /* Subscripting with type char is likely to lose on a machine where
11043 chars are signed. So warn on any machine, but optionally. Don't
11044 warn for unsigned char since that type is safe. Don't warn for
11045 signed char because anyone who uses that must have done so
11046 deliberately. Furthermore, we reduce the false positive load by
11047 warning only for non-constant value of type char. */
11049 void
11051 {
11055 }
11057 /* Implement -Wparentheses for the unexpected C precedence rules, to
11058 cover cases like x + y << z which readers are likely to
11059 misinterpret. We have seen an expression in which CODE is a binary
11060 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11061 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11062 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11063 expression was not formed using a binary or unary operator, or it
11064 was enclosed in parentheses. */
11066 void
11070 {
11074 /* This macro tests that the expression ARG with original tree code
11075 CODE appears to be a boolean expression. or the result of folding a
11076 boolean expression. */
11077 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11078 (truth_value_p (TREE_CODE (ARG)) \
11079 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11081 || ((CODE) != INTEGER_CST \
11082 && (integer_onep (ARG) || integer_zerop (ARG))))
11085 {
11134 /* Check cases like x|y==z */
11141 /* Check cases like !x | y */
11145 "suggest parentheses around operand of "
11158 /* Check cases like x^y==z */
11180 /* Check cases like x&y==z */
11187 /* Check cases like !x & y */
11191 "suggest parentheses around operand of "
11214 {
11219 "comparisons like %<X<=Y<=Z%> do not "
11225 "comparisons like %<X<=Y<=Z%> do not "
11227 }
11229 }
11230 #undef NOT_A_BOOLEAN_EXPR_P
11231 }
11233 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11235 void
11237 {
11239 {
11242 else
11244 }
11245 }
11247 /* Warn for division by zero according to the value of DIVISOR. LOC
11248 is the location of the division operator. */
11250 void
11252 {
11253 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11254 about division by zero. Do not issue a warning if DIVISOR has a
11255 floating-point type, since we consider 0.0/0.0 a valid way of
11256 generating a NaN. */
11260 }
11262 /* Subroutine of build_binary_op. Give warnings for comparisons
11263 between signed and unsigned quantities that may fail. Do the
11264 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11265 so that casts will be considered, but default promotions won't
11266 be.
11268 LOCATION is the location of the comparison operator.
11270 The arguments of this function map directly to local variables
11271 of build_binary_op. */
11273 void
11278 {
11283 /* In C++, check for comparison of different enum types. */
11289 {
11293 }
11295 /* Do not warn if the comparison is being done in a signed type,
11296 since the signed type will only be chosen if it can represent
11297 all the values of the unsigned type. */
11300 /* Do not warn if both operands are unsigned. */
11303 else
11304 {
11310 else
11318 /* Do not warn if the signed quantity is an unsuffixed integer
11319 literal (or some static constant expression involving such
11320 literals or a conditional expression involving such literals)
11321 and it is non-negative. */
11324 /* Do not warn if the comparison is an equality operation, the
11325 unsigned quantity is an integral constant, and it would fit
11326 in the result if the result were signed. */
11331 /* In C, do not warn if the unsigned quantity is an enumeration
11332 constant and its maximum value would fit in the result if the
11333 result were signed. */
11339 else
11341 OPT_Wsign_compare,
11343 }
11345 /* Warn if two unsigned values are being compared in a size larger
11346 than their original size, and one (and only one) is the result of
11347 a `~' operator. This comparison will always fail.
11349 Also warn if one operand is a constant, and the constant does not
11350 have all bits set that are set in the ~ operand when it is
11351 extended. */
11358 {
11365 {
11366 tree primop;
11372 {
11376 }
11377 else
11378 {
11382 }
11387 {
11390 {
11394 else
11397 }
11398 }
11399 }
11407 }
11408 }
11410 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11411 type via c_common_type. If -Wdouble-promotion is in use, and the
11412 conditions for warning have been met, issue a warning. GMSGID is
11413 the warning message. It must have two %T specifiers for the type
11414 that was converted (generally "float") and the type to which it was
11415 converted (generally "double), respectively. LOC is the location
11416 to which the awrning should refer. */
11418 void
11421 {
11422 tree source_type;
11426 /* If the conversion will not occur at run-time, there is no need to
11427 warn about it. */
11439 else
11442 }
11444 /* Setup a TYPE_DECL node as a typedef representation.
11446 X is a TYPE_DECL for a typedef statement. Create a brand new
11447 ..._TYPE node (which will be just a variant of the existing
11448 ..._TYPE node with identical properties) and then install X
11449 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11451 The whole point here is to end up with a situation where each
11452 and every ..._TYPE node the compiler creates will be uniquely
11453 associated with AT MOST one node representing a typedef name.
11454 This way, even though the compiler substitutes corresponding
11455 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11456 early on, later parts of the compiler can always do the reverse
11457 translation and get back the corresponding typedef name. For
11458 example, given:
11460 typedef struct S MY_TYPE;
11461 MY_TYPE object;
11463 Later parts of the compiler might only know that `object' was of
11464 type `struct S' if it were not for code just below. With this
11465 code however, later parts of the compiler see something like:
11467 struct S' == struct S
11468 typedef struct S' MY_TYPE;
11469 struct S' object;
11471 And they can then deduce (from the node for type struct S') that
11472 the original object declaration was:
11474 MY_TYPE object;
11476 Being able to do this is important for proper support of protoize,
11477 and also for generating precise symbolic debugging information
11478 which takes full account of the programmer's (typedef) vocabulary.
11480 Obviously, we don't want to generate a duplicate ..._TYPE node if
11481 the TYPE_DECL node that we are now processing really represents a
11482 standard built-in type. */
11484 void
11486 {
11490 {
11493 }
11496 {
11504 }
11505 }
11507 /* Record the types used by the current global variable declaration
11508 being parsed, so that we can decide later to emit their debug info.
11509 Those types are in types_used_by_cur_var_decl, and we are going to
11510 store them in the types_used_by_vars_hash hash table.
11511 DECL is the declaration of the global variable that has been parsed. */
11513 void
11515 {
11519 {
11522 }
11523 }
11525 /* If DECL is a typedef that is declared in the current function,
11526 record it for the purpose of -Wunused-local-typedefs. */
11528 void
11530 {
11535 /* if this is not a locally defined typedef then we are not
11536 interested. */
11543 }
11545 /* If T is a TYPE_DECL declared locally, mark it as used. */
11547 void
11549 {
11554 }
11556 /* Warn if there are some unused locally defined typedefs in the
11557 current function. */
11559 void
11561 {
11563 tree decl;
11564 /* The number of times we have emitted -Wunused-local-typedefs
11565 warnings. If this is different from errorcount, that means some
11566 unrelated errors have been issued. In which case, we'll avoid
11567 emitting "unused-local-typedefs" warnings. */
11579 {
11583 OPT_Wunused_local_typedefs,
11586 }
11589 }
11591 /* The C and C++ parsers both use vectors to hold function arguments.
11592 For efficiency, we keep a cache of unused vectors. This is the
11593 cache. */
11598 /* Return a new vector from the cache. If the cache is empty,
11599 allocate a new vector. These vectors are GC'ed, so it is OK if the
11600 pointer is not released.. */
11604 {
11607 else
11608 {
11609 /* Passing 0 to vec::alloc returns NULL, and our callers require
11610 that we always return a non-NULL value. The vector code uses
11611 4 when growing a NULL vector, so we do too. */
11615 }
11616 }
11618 /* Release a vector of trees back to the cache. */
11620 void
11622 {
11624 {
11627 }
11628 }
11630 /* Get a new tree vector holding a single tree. */
11634 {
11638 }
11640 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11644 {
11649 }
11651 /* Get a new tree vector which is a copy of an existing one. */
11655 {
11658 tree t;
11665 }
11667 /* Return true if KEYWORD starts a type specifier. */
11669 bool
11671 {
11673 {
11704 }
11705 }
11707 /* Return true if KEYWORD names a type qualifier. */
11709 bool
11711 {
11713 {
11721 }
11722 }
11724 /* Return true if KEYWORD names a storage class specifier.
11726 RID_TYPEDEF is not included in this list despite `typedef' being
11727 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11728 such for syntactic convenience only. */
11730 bool
11732 {
11734 {
11744 }
11745 }
11747 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11749 static bool
11751 {
11753 {
11761 }
11762 }
11764 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11765 declaration-specifier (C99 6.7). */
11767 bool
11769 {
11776 {
11783 }
11784 }
11786 /* Check for and warn about self-assignment or self-initialization.
11787 LHS and RHS are the tree nodes for the left-hand side and right-hand side
11788 of the assignment or initialization we are checking.
11789 LOCATION is the source location for RHS. */
11791 void
11793 {
11797 /* Deal with TREE_LIST initializers (may be generated by class
11798 member initialization in C++). */
11802 /* Only emit a warning if RHS is not a folded expression so that we don't
11803 warn on something like x = x / 1. */
11808 lhs);
11809 }
11811 /* Initialize language-specific-bits of tree_contains_struct. */
11813 void
11815 {
11819 }
11821 /* Build a user-defined numeric literal out of an integer constant type VALUE
11822 with identifier SUFFIX. */
11824 tree
11827 {
11834 }
11836 /* For vector[index], convert the vector to a
11837 pointer of the underlying type. */
11838 void
11841 {
11843 {
11845 tree type1;
11858 {
11859 /* If the original vector isn't declared may_alias and it
11860 isn't a bare vector look if the subscripting would
11861 alias the vector we subscript, and if not, force ref-all. */
11867 }
11871 }
11872 }
11874 /* Determine which of the operands, if any, is a scalar that needs to be
11875 converted to a vector, for the range of operations. */
11876 enum stv_conv
11879 {
11888 {
11889 /* Most GENERIC binary expressions require homogeneous arguments.
11890 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11891 argument that is a vector and a second one that is a scalar, so
11892 we never return stv_secondarg for them. */
11897 {
11899 {
11904 }
11905 else
11907 }
11914 /* ... fall through ... */
11935 /* What about UNLT_EXPR? */
11937 {
11938 tree tmp;
11940 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11943 }
11947 {
11949 {
11954 }
11956 }
11958 /* Allow integer --> real conversion if safe. */
11962 {
11964 {
11969 }
11971 }
11974 }
11977 }
11979 /* Return true iff ALIGN is an integral constant that is a fundamental
11980 alignment, as defined by [basic.align] in the c++-11
11981 specifications.
11983 That is:
11985 [A fundamental alignment is represented by an alignment less than or
11986 equal to the greatest alignment supported by the implementation
11987 in all contexts, which is equal to
11988 alignof(max_align_t)]. */
11990 bool
11992 {
11995 }
11997 /* Return true if T is a pointer to a zero-sized aggregate. */
11999 bool
12001 {
12006 }