| blob | 23163f51d6767a3431bb856d915bec6e0fcbd078 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
56 /* The following symbols are subsumed in the c_global_trees array, and
57 listed here individually for documentation purposes.
59 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
61 tree short_integer_type_node;
62 tree long_integer_type_node;
63 tree long_long_integer_type_node;
64 tree int128_integer_type_node;
66 tree short_unsigned_type_node;
67 tree long_unsigned_type_node;
68 tree long_long_unsigned_type_node;
69 tree int128_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
79 tree wchar_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
84 tree float_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
97 tree intQI_type_node;
98 tree intHI_type_node;
99 tree intSI_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
146 tree void_list_node;
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
160 */
163 \f
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
179 /* Nonzero means pass #include lines through to the output. */
183 /* Nonzero means process PCH files while preprocessing. */
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 user's namespace. */
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
230 /* Tells the compiler what is the constant string class for ObjC. */
235 /* C++ language option variables. */
238 /* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
243 /* The C++ dialect being used. C++98 is the default. */
247 /* Maximum template instantiation depth. This limit exists to limit the
248 time it takes to notice excessively recursive template instantiations.
250 The default is lower than the 1024 recommended by the C++0x standard
251 because G++ runs out of stack before 1024 with highly recursive template
252 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
256 /* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
262 /* Nonzero means don't warn about problems that occur when the code is
263 executed. */
266 /* Whether we are building a boolean conversion inside
267 convert_for_assignment, or some other late binary operation. If
268 build_binary_op is called for C (from code shared by C and C++) in
269 this case, then the operands have already been folded and the
270 result will not be folded again, so C_MAYBE_CONST_EXPR should not
271 be generated. */
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
278 /* Information about how a function name is generated. */
279 struct fname_var_t
280 {
284 };
286 /* The three ways of getting then name of the current function. */
289 {
290 /* C99 compliant __func__, must be first. */
292 /* GCC __FUNCTION__ compliant. */
294 /* GCC __PRETTY_FUNCTION__ compliant. */
297 };
299 /* Global visibility options. */
393 /* Reserved words. The third field is a mask: keywords are disabled
394 if they match the mask.
396 Masks for languages:
397 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
398 C --std=c99: D_CXXONLY | D_OBJC
399 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
400 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
401 C++ --std=c0x: D_CONLY | D_OBJC
402 ObjC++ is like C++ except that D_OBJC is not set
404 If -fno-asm is used, D_ASM is added to the mask. If
405 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
406 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
407 In C with -Wc++-compat, we warn if D_CXXWARN is set.
409 Note the complication of the D_CXX_OBJC keywords. These are
410 reserved words such as 'class'. In C++, 'class' is a reserved
411 word. In Objective-C++ it is too. In Objective-C, it is a
412 reserved word too, but only if it follows an '@' sign.
413 */
415 {
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. */
661 /* The same comments as for noreturn attributes apply to const ones. */
685 handle_no_instrument_function_attribute,
703 /* ??? These two attributes didn't make the transition from the
704 Intel language document to the multi-vendor language document. */
709 /* For internal use (marking of builtins) only. The name contains space
710 to prevent its usage in source code. */
732 /* For internal use (marking of builtins) only. The name contains space
733 to prevent its usage in source code. */
744 handle_no_address_safety_analysis_attribute,
747 handle_no_sanitize_address_attribute,
750 handle_no_sanitize_undefined_attribute,
760 /* For internal use only. The leading '*' both prevents its usage in
761 source code and signals that it may be overridden by machine tables. */
766 /* For internal use (marking of builtins and runtime functions) only.
767 The name contains space to prevent its usage in source code. */
787 };
789 /* Give the specifications for the format attributes, used by C and all
790 descendants. */
793 {
794 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
795 affects_type_identity } */
801 };
803 /* Return identifier for address space AS. */
807 {
811 }
813 /* Push current bindings for the function name VAR_DECLS. */
815 void
817 {
822 {
826 {
828 saved);
830 }
831 }
833 /* Normally they'll have been NULL, so only push if we've got a
834 stack, or they are non-NULL. */
836 saved_function_name_decls);
837 }
839 /* Finish up the current bindings, adding them into the current function's
840 statement tree. This must be done _before_ finish_stmt_tree is called.
841 If there is no current function, we must be at file scope and no statements
842 are involved. Pop the previous bindings. */
844 void
846 {
855 {
863 }
869 {
870 /* We had saved values, restore them. */
871 tree saved;
874 {
879 }
881 }
883 }
885 /* Return the text name of the current function, suitably prettified
886 by PRETTY_P. Return string must be freed by caller. */
890 {
897 {
900 }
913 {
916 }
919 }
921 /* Return the VAR_DECL for a const char array naming the current
922 function. If the VAR_DECL has not yet been created, create it
923 now. RID indicates how it should be formatted and IDENTIFIER_NODE
924 ID is its name (unfortunately C and C++ hold the RID values of
925 keywords in different places, so we can't derive RID from ID in
926 this language independent code. LOC is the location of the
927 function. */
929 tree
931 {
941 {
942 /* If a tree is built here, it would normally have the lineno of
943 the current statement. Later this tree will be moved to the
944 beginning of the function and this line number will be wrong.
945 To avoid this problem set the lineno to 0 here; that prevents
946 it from appearing in the RTL. */
947 tree stmts;
955 saved_function_name_decls
959 }
964 }
966 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
968 tree
970 {
975 /* Compute the number of elements, for the array type. */
977 {
980 }
982 {
985 }
987 {
990 }
991 else
992 {
995 }
997 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
998 limit in C++98 Annex B is very large (65536) and is not normative,
999 so we do not diagnose it (warn_overlength_strings is forced off
1000 in c_common_post_options). */
1002 {
1006 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1007 separate the %d from the 'C'. 'ISO' should not be
1008 translated, but it may be moved after 'C%d' in languages
1009 where modifiers follow nouns. */
1011 "string length %qd is greater than the length %qd "
1014 }
1016 /* Create the array type for the string constant. The ISO C++
1017 standard says that a string literal has type `const char[N]' or
1018 `const wchar_t[N]'. We use the same logic when invoked as a C
1019 front-end with -Wwrite-strings.
1020 ??? We should change the type of an expression depending on the
1021 state of a warning flag. We should just be warning -- see how
1022 this is handled in the C++ front-end for the deprecated implicit
1023 conversion from string literals to `char*' or `wchar_t*'.
1025 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1026 array type being the unqualified version of that type.
1027 Therefore, if we are constructing an array of const char, we must
1028 construct the matching unqualified array type first. The C front
1029 end does not require this, but it does no harm, so we do it
1030 unconditionally. */
1041 }
1042 \f
1043 /* If DISABLE is true, stop issuing warnings. This is used when
1044 parsing code that we know will not be executed. This function may
1045 be called multiple times, and works as a stack. */
1047 static void
1049 {
1051 {
1054 }
1055 }
1057 /* If ENABLE is true, reenable issuing warnings. */
1059 static void
1061 {
1063 {
1066 }
1067 }
1069 /* Fully fold EXPR, an expression that was not folded (beyond integer
1070 constant expressions and null pointer constants) when being built
1071 up. If IN_INIT, this is in a static initializer and certain
1072 changes are made to the folding done. Clear *MAYBE_CONST if
1073 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1074 expression because it contains an evaluated operator (in C99) or an
1075 operator outside of sizeof returning an integer constant (in C90)
1076 not permitted in constant expressions, or because it contains an
1077 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1078 set to true by callers before calling this function.) Return the
1079 folded expression. Function arguments have already been folded
1080 before calling this function, as have the contents of SAVE_EXPR,
1081 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1082 C_MAYBE_CONST_EXPR. */
1084 tree
1086 {
1087 tree ret;
1093 /* This function is not relevant to C++ because C++ folds while
1094 parsing, and may need changes to be correct for C++ when C++
1095 stops folding while parsing. */
1102 {
1105 }
1112 }
1114 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1115 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1116 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1117 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1118 both evaluated and unevaluated subexpressions while
1119 *MAYBE_CONST_ITSELF is carried from only evaluated
1120 subexpressions). */
1122 static tree
1125 {
1137 /* This function is not relevant to C++ because C++ folds while
1138 parsing, and may need changes to be correct for C++ when C++
1139 stops folding while parsing. */
1143 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1144 anything else not counted as an expression cannot usefully be
1145 folded further at this point. */
1151 /* Operands of variable-length expressions (function calls) have
1152 already been folded, as have __builtin_* function calls, and such
1153 expressions cannot occur in constant expressions. */
1155 {
1159 }
1162 {
1171 else
1174 }
1176 /* Assignment, increment, decrement, function call and comma
1177 operators, and statement expressions, cannot occur in constant
1178 expressions if evaluated / outside of sizeof. (Function calls
1179 were handled above, though VA_ARG_EXPR is treated like a function
1180 call here, and statement expressions are handled through
1181 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1183 {
1203 }
1205 /* Fold individual tree codes as appropriate. */
1207 {
1209 /* Any non-constancy will have been marked in a containing
1210 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1218 maybe_const_itself);
1223 {
1226 }
1235 maybe_const_itself);
1238 maybe_const_itself);
1244 {
1248 }
1290 /* Binary operations evaluating both arguments (increment and
1291 decrement are binary internally in GCC). */
1295 maybe_const_itself);
1303 /* The RHS of a MODIFY_EXPR was fully folded when building that
1304 expression for the sake of conversion warnings. */
1307 maybe_const_itself);
1311 ret = in_init
1314 else
1327 {
1338 }
1344 CASE_CONVERT:
1355 /* Unary operations. */
1358 maybe_const_itself);
1362 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1363 not prepared to deal with them if they occur in initializers. */
1371 ret = in_init
1374 else
1379 {
1383 }
1385 {
1388 CASE_CONVERT:
1389 /* Don't warn about explicit conversions. We will already
1390 have warned about suspect implicit conversions. */
1397 }
1402 /* Binary operations not necessarily evaluating both
1403 arguments. */
1410 ? truthvalue_false_node
1418 ret = in_init
1421 else
1426 && op0_const
1427 && op0_const_self
1433 && op0_const_self
1459 else
1464 && op0_const
1465 && op0_const_self
1469 && op0_const_self
1473 && op0_const
1474 && op0_const_self
1478 && op0_const_self
1484 /* Each case where an operand with excess precision may be
1485 encountered must remove the EXCESS_PRECISION_EXPR around
1486 inner operands and possibly put one around the whole
1487 expression or possibly convert to the semantic type (which
1488 c_fully_fold does); we cannot tell at this stage which is
1489 appropriate in any particular case. */
1493 /* Various codes may appear through folding built-in functions
1494 and their arguments. */
1496 }
1498 out:
1499 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1500 have been done by this point, so remove them again. */
1504 {
1508 }
1512 }
1514 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1515 return EXP. Otherwise, return either EXP or its known constant
1516 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1517 Is the BLKmode test appropriate? */
1519 tree
1521 {
1522 tree ret;
1524 /* This function is only used by C, for c_fully_fold and other
1525 optimization, and may not be correct for C++. */
1536 /* Avoid unwanted tree sharing between the initializer and current
1537 function's body where the tree can be modified e.g. by the
1538 gimplifier. */
1542 }
1544 /* Print a warning if a constant expression had overflow in folding.
1545 Invoke this function on every expression that the language
1546 requires to be a constant expression.
1547 Note the ANSI C standard says it is erroneous for a
1548 constant expression to overflow. */
1550 void
1552 {
1560 }
1562 /* The same as above but print an unconditional error. */
1563 void
1565 {
1572 }
1574 /* Print a warning if an expression had overflow in folding and its
1575 operands hadn't.
1577 Invoke this function on every expression that
1578 (1) appears in the source code, and
1579 (2) is a constant expression that overflowed, and
1580 (3) is not already checked by convert_and_check;
1581 however, do not invoke this function on operands of explicit casts
1582 or when the expression is the result of an operator and any operand
1583 already overflowed. */
1585 void
1587 {
1592 {
1621 }
1622 }
1624 /* Warn about uses of logical || / && operator in a context where it
1625 is likely that the bitwise equivalent was intended by the
1626 programmer. We have seen an expression in which CODE is a binary
1627 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1628 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1629 void
1633 {
1645 /* Warn if &&/|| are being used in a context where it is
1646 likely that the bitwise equivalent was intended by the
1647 programmer. That is, an expression such as op && MASK
1648 where op should not be any boolean expression, nor a
1649 constant, and mask seems to be a non-boolean integer constant. */
1657 {
1661 else
1666 }
1668 /* We do not warn for constants because they are typical of macro
1669 expansions that test for features. */
1673 /* This warning only makes sense with logical operands. */
1680 /* The range computations only work with scalars. */
1685 /* We first test whether either side separately is trivially true
1686 (with OR) or trivially false (with AND). If so, do not warn.
1687 This is a common idiom for testing ranges of data types in
1688 portable code. */
1695 /* If this is an OR operation, invert both sides; now, the result
1696 should be always false to get a warning. */
1710 /* If this is an OR operation, invert both sides; now, the result
1711 should be always false to get a warning. */
1719 /* If both expressions have the same operand, if we can merge the
1720 ranges, and if the range test is always false, then warn. */
1727 {
1730 "logical %<or%> "
1732 else
1734 "logical %<and%> "
1736 }
1737 }
1739 /* Warn about logical not used on the left hand side operand of a comparison.
1740 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1741 Do not warn if RHS is of a boolean type. */
1743 void
1745 tree rhs)
1746 {
1753 "logical not is only applied to the left hand side of "
1755 }
1757 /* Warn if EXP contains any computations whose results are not used.
1758 Return true if a warning is printed; false otherwise. LOCUS is the
1759 (potential) location of the expression. */
1761 bool
1763 {
1764 restart:
1768 /* Don't warn about void constructs. This includes casting to void,
1769 void function calls, and statement expressions with a final cast
1770 to void. */
1778 {
1794 /* For a binding, warn if no side effect within it. */
1806 /* In && or ||, warn if 2nd operand has no side effect. */
1813 /* Let people do `(foo (), 0)' without a warning. */
1820 /* If this is an expression with side effects, don't warn; this
1821 case commonly appears in macro expansions. */
1827 /* Don't warn about automatic dereferencing of references, since
1828 the user cannot control it. */
1830 {
1833 }
1834 /* Fall through. */
1837 /* Referencing a volatile value is a side effect, so don't warn. */
1842 /* If this is an expression which has no operands, there is no value
1843 to be unused. There are no such language-independent codes,
1844 but front ends may define such. */
1848 warn:
1850 }
1851 }
1854 /* Print a warning about casts that might indicate violation
1855 of strict aliasing rules if -Wstrict-aliasing is used and
1856 strict aliasing mode is in effect. OTYPE is the original
1857 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1859 bool
1861 {
1862 /* Strip pointer conversion chains and get to the correct original type. */
1870 /* If the type we are casting to is a ref-all pointer
1871 dereferencing it is always valid. */
1878 {
1879 /* Casting the address of an object to non void pointer. Warn
1880 if the cast breaks type based aliasing. */
1882 {
1886 }
1887 else
1888 {
1889 /* warn_strict_aliasing >= 3. This includes the default (3).
1890 Only warn if the cast is dereferenced immediately. */
1891 alias_set_type set1 =
1897 {
1901 }
1904 {
1908 }
1909 }
1910 }
1911 else
1913 {
1914 /* At this level, warn for any conversions, even if an address is
1915 not taken in the same statement. This will likely produce many
1916 false positives, but could be useful to pinpoint problems that
1917 are not revealed at higher levels. */
1922 {
1926 }
1927 }
1930 }
1932 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1933 sizeof as last operand of certain builtins. */
1935 void
1939 {
1943 location_t loc;
1951 {
1955 /* FALLTHRU */
1963 /* FALLTHRU */
2022 }
2050 {
2054 {
2057 "argument to %<sizeof%> in %qD call is the same "
2058 "expression as the destination; did you mean to "
2064 "argument to %<sizeof%> in %qD call is the same "
2065 "expression as the destination; did you mean to "
2067 else
2069 "argument to %<sizeof%> in %qD call is the same "
2070 "expression as the destination; did you mean to "
2073 }
2076 && !strop
2079 {
2081 "argument to %<sizeof%> in %qD call is the same "
2082 "pointer type %qT as the destination; expected %qT "
2086 }
2087 }
2090 {
2094 {
2097 "argument to %<sizeof%> in %qD call is the same "
2098 "expression as the source; did you mean to "
2104 "argument to %<sizeof%> in %qD call is the same "
2105 "expression as the source; did you mean to "
2107 else
2109 "argument to %<sizeof%> in %qD call is the same "
2110 "expression as the source; did you mean to "
2113 }
2116 && !strop
2119 {
2121 "argument to %<sizeof%> in %qD call is the same "
2122 "pointer type %qT as the source; expected %qT "
2126 }
2127 }
2130 {
2134 {
2137 "argument to %<sizeof%> in %qD call is the same "
2138 "expression as the first source; did you mean to "
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "expression as the first source; did you mean to "
2147 else
2149 "argument to %<sizeof%> in %qD call is the same "
2150 "expression as the first source; did you mean to "
2153 }
2156 && !strop
2159 {
2161 "argument to %<sizeof%> in %qD call is the same "
2162 "pointer type %qT as the first source; expected %qT "
2166 }
2167 }
2170 {
2174 {
2177 "argument to %<sizeof%> in %qD call is the same "
2178 "expression as the second source; did you mean to "
2184 "argument to %<sizeof%> in %qD call is the same "
2185 "expression as the second source; did you mean to "
2187 else
2189 "argument to %<sizeof%> in %qD call is the same "
2190 "expression as the second source; did you mean to "
2193 }
2196 && !strop
2199 {
2201 "argument to %<sizeof%> in %qD call is the same "
2202 "pointer type %qT as the second source; expected %qT "
2206 }
2207 }
2209 }
2211 /* Warn for unlikely, improbable, or stupid DECL declarations
2212 of `main'. */
2214 void
2216 {
2217 function_args_iterator iter;
2218 tree type;
2222 {
2223 /* XXX void_type_node belies the abstraction. */
2233 {
2239 }
2243 {
2265 "third argument of %q+D should probably be "
2268 }
2269 }
2271 /* It is intentional that this message does not mention the third
2272 argument because it's only mentioned in an appendix of the
2273 standard. */
2281 }
2283 /* vector_targets_convertible_p is used for vector pointer types. The
2284 callers perform various checks that the qualifiers are satisfactory,
2285 while OTOH vector_targets_convertible_p ignores the number of elements
2286 in the vectors. That's fine with vector pointers as we can consider,
2287 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2288 and that does not require and conversion of the pointer values.
2289 In contrast, vector_types_convertible_p and
2290 vector_types_compatible_elements_p are used for vector value types. */
2291 /* True if pointers to distinct types T1 and T2 can be converted to
2292 each other without an explicit cast. Only returns true for opaque
2293 vector types. */
2294 bool
2296 {
2303 }
2305 /* vector_types_convertible_p is used for vector value types.
2306 It could in principle call vector_targets_convertible_p as a subroutine,
2307 but then the check for vector type would be duplicated with its callers,
2308 and also the purpose of vector_targets_convertible_p would become
2309 muddled.
2310 Where vector_types_convertible_p returns true, a conversion might still be
2311 needed to make the types match.
2312 In contrast, vector_targets_convertible_p is used for vector pointer
2313 values, and vector_types_compatible_elements_p is used specifically
2314 in the context for binary operators, as a check if use is possible without
2315 conversion. */
2316 /* True if vector types T1 and T2 can be converted to each other
2317 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2318 can only be converted with -flax-vector-conversions yet that is not
2319 in effect, emit a note telling the user about that option if such
2320 a note has not previously been emitted. */
2321 bool
2323 {
2331 convertible_lax =
2346 {
2349 "conversions between vectors with differing "
2351 }
2354 }
2356 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2357 and have vector types, V0 has the same type as V1, and the number of
2358 elements of V0, V1, MASK is the same.
2360 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2361 called with two arguments. In this case implementation passes the
2362 first argument twice in order to share the same tree code. This fact
2363 could enable the mask-values being twice the vector length. This is
2364 an implementation accident and this semantics is not guaranteed to
2365 the user. */
2366 tree
2369 {
2370 tree ret;
2376 {
2379 }
2387 {
2392 }
2396 {
2400 }
2403 {
2408 }
2414 {
2417 "argument vector(s) and the mask vector should "
2420 }
2424 {
2429 }
2432 {
2433 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2439 else
2440 {
2443 }
2447 }
2457 }
2459 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2460 to integral type. */
2462 static tree
2464 {
2469 {
2470 /* C++0x scoped enumerations don't implicitly convert to integral
2471 type; if we stripped an explicit conversion to a larger type we
2472 need to replace it so common_type will still work. */
2476 }
2478 }
2480 /* This is a helper function of build_binary_op.
2482 For certain operations if both args were extended from the same
2483 smaller type, do the arithmetic in that type and then extend.
2485 BITWISE indicates a bitwise operation.
2486 For them, this optimization is safe only if
2487 both args are zero-extended or both are sign-extended.
2488 Otherwise, we might change the result.
2489 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2490 but calculated in (unsigned short) it would be (unsigned short)-1.
2491 */
2492 tree
2494 {
2498 tree type;
2500 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2501 excessive narrowing when we call get_narrower below. For
2502 example, suppose that OP0 is of unsigned int extended
2503 from signed char and that RESULT_TYPE is long long int.
2504 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2505 like
2507 (long long int) (unsigned int) signed_char
2509 which get_narrower would narrow down to
2511 (unsigned int) signed char
2513 If we do not cast OP0 first, get_narrower would return
2514 signed_char, which is inconsistent with the case of the
2515 explicit cast. */
2522 /* UNS is 1 if the operation to be done is an unsigned one. */
2525 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2526 but it *requires* conversion to FINAL_TYPE. */
2537 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2539 /* For bitwise operations, signedness of nominal type
2540 does not matter. Consider only how operands were extended. */
2544 /* Note that in all three cases below we refrain from optimizing
2545 an unsigned operation on sign-extended args.
2546 That would not be valid. */
2548 /* Both args variable: if both extended in same way
2549 from same width, do it in that width.
2550 Do it unsigned if args were zero-extended. */
2557 return c_common_signed_or_unsigned_type
2564 && (type
2575 && (type
2583 }
2585 /* Checks if expression EXPR of real/integer type cannot be converted
2586 to the real/integer type TYPE. Function returns non-zero when:
2587 * EXPR is a constant which cannot be exactly converted to TYPE.
2588 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2589 for EXPR type and TYPE being both integers or both real.
2590 * EXPR is not a constant of real type and TYPE is an integer.
2591 * EXPR is not a constant of integer type which cannot be
2592 exactly converted to real type.
2593 Function allows conversions between types of different signedness and
2594 can return SAFE_CONVERSION (zero) in that case. Function can produce
2595 signedness warnings if PRODUCE_WARNS is true. */
2597 enum conversion_safety
2599 {
2605 {
2606 /* Warn for real constant that is not an exact integer converted
2607 to integer type. */
2610 {
2613 }
2614 /* Warn for an integer constant that does not fit into integer type. */
2618 {
2621 {
2625 }
2627 {
2631 }
2632 else
2634 }
2636 {
2637 /* Warn for an integer constant that does not fit into real type. */
2639 {
2643 }
2644 /* Warn for a real constant that does not fit into a smaller
2645 real type. */
2648 {
2652 }
2653 }
2654 }
2655 else
2656 {
2657 /* Warn for real types converted to integer types. */
2664 {
2665 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2669 /* Don't warn for short y; short x = ((int)y & 0xff); */
2673 {
2674 /* If both args were extended from a shortest type,
2675 use that type if that is safe. */
2682 {
2688 /* If one of the operands is a non-negative constant
2689 that fits in the target type, then the type of the
2690 other operand does not matter. */
2699 /* If constant is unsigned and fits in the target
2700 type, then the result will also fit. */
2702 && unsigned0
2705 && unsigned1
2708 }
2709 }
2710 /* Warn for integer types converted to smaller integer types. */
2714 /* When they are the same width but different signedness,
2715 then the value may change. */
2718 /* Even when converted to a bigger type, if the type is
2719 unsigned but expr is signed, then negative values
2720 will be changed. */
2726 }
2728 /* Warn for integer types converted to real types if and only if
2729 all the range of values of the integer type cannot be
2730 represented by the real type. */
2733 {
2737 /* Don't warn about char y = 0xff; float x = (int) y; */
2749 }
2751 /* Warn for real types converted to smaller real types. */
2756 }
2759 }
2761 /* Warns if the conversion of EXPR to TYPE may alter a value.
2762 This is a helper function for warnings_for_convert_and_check. */
2764 static void
2766 {
2773 /* This may happen, because for LHS op= RHS we preevaluate
2774 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2775 means we could no longer see the code of the EXPR. */
2782 {
2795 /* Conversion from boolean to a signed:1 bit-field (which only
2796 can hold the values 0 and -1) doesn't lose information - but
2797 it does change the value. */
2817 {
2818 /* In case of COND_EXPR, we do not care about the type of
2819 COND_EXPR, only about the conversion of each operand. */
2826 }
2838 }
2839 }
2841 /* Produce warnings after a conversion. RESULT is the result of
2842 converting EXPR to TYPE. This is a helper function for
2843 convert_and_check and cp_convert_and_check. */
2845 void
2847 tree result)
2848 {
2855 {
2856 /* Do not diagnose overflow in a constant expression merely
2857 because a conversion overflowed. */
2862 {
2863 /* This detects cases like converting -129 or 256 to
2864 unsigned char. */
2868 else
2870 }
2874 /* No warning for converting 0x80000000 to int. */
2882 else
2884 }
2889 else
2891 }
2894 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2895 Invoke this function on every expression that is converted implicitly,
2896 i.e. because of language rules and not because of an explicit cast. */
2898 tree
2900 {
2901 tree result;
2902 tree expr_for_warning;
2904 /* Convert from a value with possible excess precision rather than
2905 via the semantic type, but do not warn about values not fitting
2906 exactly in the semantic type. */
2908 {
2914 }
2915 else
2929 }
2930 \f
2931 /* A node in a list that describes references to variables (EXPR), which are
2932 either read accesses if WRITER is zero, or write accesses, in which case
2933 WRITER is the parent of EXPR. */
2934 struct tlist
2935 {
2938 };
2940 /* Used to implement a cache the results of a call to verify_tree. We only
2941 use this for SAVE_EXPRs. */
2942 struct tlist_cache
2943 {
2947 tree expr;
2948 };
2950 /* Obstack to use when allocating tlist structures, and corresponding
2951 firstobj. */
2955 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2956 warnings. */
2958 /* SAVE_EXPRs need special treatment. We process them only once and then
2959 cache the results. */
2971 /* Create a new struct tlist and fill in its fields. */
2974 {
2981 }
2983 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2984 is nonnull, we ignore any node we find which has a writer equal to it. */
2986 static void
2988 {
2990 {
2997 }
2998 }
3000 /* Merge the nodes of ADD into TO. This merging process is done so that for
3001 each variable that already exists in TO, no new node is added; however if
3002 there is a write access recorded in ADD, and an occurrence on TO is only
3003 a read access, then the occurrence in TO will be modified to record the
3004 write. */
3006 static void
3008 {
3015 {
3022 {
3026 }
3028 {
3032 }
3034 }
3035 }
3037 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3038 references in list LIST conflict with it, excluding reads if ONLY writers
3039 is nonzero. */
3041 static void
3044 {
3047 /* Avoid duplicate warnings. */
3053 {
3057 {
3062 }
3064 }
3065 }
3067 /* Given a list LIST of references to variables, find whether any of these
3068 can cause conflicts due to missing sequence points. */
3070 static void
3072 {
3076 {
3079 }
3080 }
3082 /* Return nonzero if X is a tree that can be verified by the sequence point
3083 warnings. */
3084 static int
3086 {
3093 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3094 (lvalue_p) crash on TRY/CATCH. */
3101 /* No point to track non-const calls, they will never satisfy
3102 operand_equal_p. */
3110 }
3112 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3113 static bool
3115 {
3117 }
3119 /* Walk the tree X, and record accesses to variables. If X is written by the
3120 parent tree, WRITER is the parent.
3121 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3122 expression or its only operand forces a sequence point, then everything up
3123 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3124 in PNO_SP.
3125 Once we return, we will have emitted warnings if any subexpression before
3126 such a sequence point could be undefined. On a higher level, however, the
3127 sequence point may not be relevant, and we'll merge the two lists.
3129 Example: (b++, a) + b;
3130 The call that processes the COMPOUND_EXPR will store the increment of B
3131 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3132 processes the PLUS_EXPR will need to merge the two lists so that
3133 eventually, all accesses end up on the same list (and we'll warn about the
3134 unordered subexpressions b++ and b.
3136 A note on merging. If we modify the former example so that our expression
3137 becomes
3138 (b++, b) + a
3139 care must be taken not simply to add all three expressions into the final
3140 PNO_SP list. The function merge_tlist takes care of that by merging the
3141 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3142 way, so that no more than one access to B is recorded. */
3144 static void
3146 tree writer)
3147 {
3152 /* X may be NULL if it is the operand of an empty statement expression
3153 ({ }). */
3157 restart:
3165 {
3198 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3199 two first, to avoid warning for (a ? b++ : b++). */
3215 /* Expressions inside the LHS are not ordered wrt. the sequence points
3216 in the RHS. Example:
3217 *a = (a++, 2)
3218 Despite the fact that the modification of "a" is in the before_sp
3219 list (tmp_before), it conflicts with the use of "a" in the LHS.
3220 We can handle this by adding the contents of tmp_list3
3221 to those of tmp_before, and redoing the collision warnings for that
3222 list. */
3225 /* Exclude the LHS itself here; we first have to merge it into the
3226 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3227 didn't exclude the LHS, we'd get it twice, once as a read and once
3228 as a write. */
3239 /* We need to warn about conflicts among arguments and conflicts between
3240 args and the function address. Side effects of the function address,
3241 however, are not ordered by the sequence point of the call. */
3242 {
3243 call_expr_arg_iterator iter;
3244 tree arg;
3248 {
3253 }
3258 }
3261 /* Scan all the list, e.g. indices of multi dimensional array. */
3263 {
3269 }
3273 {
3280 {
3294 }
3298 }
3308 /* For other expressions, simply recurse on their operands.
3309 Manual tail recursion for unary expressions.
3310 Other non-expressions need not be processed. */
3312 {
3316 }
3318 {
3322 {
3327 }
3328 }
3330 }
3331 }
3333 /* Try to warn for undefined behavior in EXPR due to missing sequence
3334 points. */
3336 DEBUG_FUNCTION void
3338 {
3344 {
3347 }
3352 }
3353 \f
3354 /* Validate the expression after `case' and apply default promotions. */
3356 static tree
3358 {
3363 /* Promote char or short to int. */
3366 {
3369 }
3374 }
3375 \f
3376 /* See if the case values LOW and HIGH are in the range of the original
3377 type (i.e. before the default conversion to int) of the switch testing
3378 expression.
3379 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3380 the type before promoting it. CASE_LOW_P is a pointer to the lower
3381 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3382 if the case is not a case range.
3383 The caller has to make sure that we are not called with NULL for
3384 CASE_LOW_P (i.e. the default case).
3385 Returns true if the case label is in range of ORIG_TYPE (saturated or
3386 untouched) or false if the label is out of range. */
3388 static bool
3391 {
3396 /* If there was a problem with the original type, do nothing. */
3403 /* Case label is less than minimum for type. */
3406 {
3410 }
3412 /* Case value is greater than maximum for type. */
3415 {
3418 }
3420 /* Saturate lower case label value to minimum. */
3423 {
3427 }
3429 /* Saturate upper case label value to maximum. */
3432 {
3436 }
3444 }
3445 \f
3446 /* Return an integer type with BITS bits of precision,
3447 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3449 tree
3451 {
3490 }
3492 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3493 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3494 and saturating if SATP is nonzero, otherwise not saturating. */
3496 tree
3499 {
3503 else
3511 {
3513 "fixed-point types that have too many integral and "
3516 }
3519 }
3521 /* Used for communication between c_common_type_for_mode and
3522 c_register_builtin_type. */
3523 tree registered_builtin_types;
3525 /* Return a data type that has machine mode MODE.
3526 If the mode is an integer,
3527 then UNSIGNEDP selects between signed and unsigned types.
3528 If the mode is a fixed-point mode,
3529 then UNSIGNEDP selects between saturating and nonsaturating types. */
3531 tree
3533 {
3534 tree t;
3571 #if HOST_BITS_PER_WIDE_INT >= 64
3574 #endif
3599 {
3601 tree inner_type;
3617 }
3619 {
3624 }
3634 {
3720 }
3728 }
3730 tree
3732 {
3734 }
3736 /* Return a signed type the same as TYPE in other respects. */
3738 tree
3740 {
3742 }
3744 /* Return a type the same as TYPE except unsigned or
3745 signed according to UNSIGNEDP. */
3747 tree
3749 {
3750 tree type1;
3752 /* This block of code emulates the behavior of the old
3753 c_common_unsigned_type. In particular, it returns
3754 long_unsigned_type_node if passed a long, even when a int would
3755 have the same size. This is necessary for warnings to work
3756 correctly in archs where sizeof(int) == sizeof(long) */
3759 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3775 #if HOST_BITS_PER_WIDE_INT >= 64
3778 #endif
3788 #define C_COMMON_FIXED_TYPES(NAME) \
3789 if (type1 == short_ ## NAME ## _type_node \
3790 || type1 == unsigned_short_ ## NAME ## _type_node) \
3791 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3792 : short_ ## NAME ## _type_node; \
3793 if (type1 == NAME ## _type_node \
3794 || type1 == unsigned_ ## NAME ## _type_node) \
3795 return unsignedp ? unsigned_ ## NAME ## _type_node \
3796 : NAME ## _type_node; \
3797 if (type1 == long_ ## NAME ## _type_node \
3798 || type1 == unsigned_long_ ## NAME ## _type_node) \
3799 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3800 : long_ ## NAME ## _type_node; \
3801 if (type1 == long_long_ ## NAME ## _type_node \
3802 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3803 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3804 : long_long_ ## NAME ## _type_node;
3806 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3807 if (type1 == NAME ## _type_node \
3808 || type1 == u ## NAME ## _type_node) \
3809 return unsignedp ? u ## NAME ## _type_node \
3810 : NAME ## _type_node;
3812 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3813 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3814 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3815 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3816 : sat_ ## short_ ## NAME ## _type_node; \
3817 if (type1 == sat_ ## NAME ## _type_node \
3818 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3819 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3820 : sat_ ## NAME ## _type_node; \
3821 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3822 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3823 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3824 : sat_ ## long_ ## NAME ## _type_node; \
3825 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3826 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3827 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3828 : sat_ ## long_long_ ## NAME ## _type_node;
3830 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3831 if (type1 == sat_ ## NAME ## _type_node \
3832 || type1 == sat_ ## u ## NAME ## _type_node) \
3833 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3834 : sat_ ## NAME ## _type_node;
3860 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3861 the precision; they have precision set to match their range, but
3862 may use a wider mode to match an ABI. If we change modes, we may
3863 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3864 the precision as well, so as to yield correct results for
3865 bit-field types. C++ does not have these separate bit-field
3866 types, and producing a signed or unsigned variant of an
3867 ENUMERAL_TYPE may cause other problems as well. */
3873 #define TYPE_OK(node) \
3874 (TYPE_MODE (type) == TYPE_MODE (node) \
3875 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3894 #if HOST_BITS_PER_WIDE_INT >= 64
3897 #endif
3906 #undef TYPE_OK
3909 }
3911 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3913 tree
3915 {
3916 /* Extended integer types of the same width as a standard type have
3917 lesser rank, so those of the same width as int promote to int or
3918 unsigned int and are valid for printf formats expecting int or
3919 unsigned int. To avoid such special cases, avoid creating
3920 extended integer types for bit-fields if a standard integer type
3921 is available. */
3938 }
3940 /* The C version of the register_builtin_type langhook. */
3942 void
3944 {
3945 tree decl;
3955 }
3956 \f
3957 /* Print an error message for invalid operands to arith operation
3958 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3959 LOCATION is the location of the message. */
3961 void
3964 {
3968 {
4013 }
4017 }
4018 \f
4019 /* Given an expression as a tree, return its original type. Do this
4020 by stripping any conversion that preserves the sign and precision. */
4021 static tree
4023 {
4026 }
4028 /* Subroutine of build_binary_op, used for comparison operations.
4029 See if the operands have both been converted from subword integer types
4030 and, if so, perhaps change them both back to their original type.
4031 This function is also responsible for converting the two operands
4032 to the proper common type for comparison.
4034 The arguments of this function are all pointers to local variables
4035 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4036 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4038 LOC is the location of the comparison.
4040 If this function returns nonzero, it means that the comparison has
4041 a constant value. What this function returns is an expression for
4042 that value. */
4044 tree
4047 {
4048 tree type;
4056 /* Throw away any conversions to wider types
4057 already present in the operands. */
4062 /* If primopN is first sign-extended from primopN's precision to opN's
4063 precision, then zero-extended from opN's precision to
4064 *restype_ptr precision, shortenings might be invalid. */
4067 && !unsignedp0
4072 && !unsignedp1
4076 /* Handle the case that OP0 does not *contain* a conversion
4077 but it *requires* conversion to FINAL_TYPE. */
4084 /* If one of the operands must be floated, we cannot optimize. */
4088 /* If first arg is constant, swap the args (changing operation
4089 so value is preserved), for canonicalization. Don't do this if
4090 the second arg is 0. */
4095 {
4112 {
4127 }
4129 }
4131 /* If comparing an integer against a constant more bits wide,
4132 maybe we can deduce a value of 1 or 0 independent of the data.
4133 Or else truncate the constant now
4134 rather than extend the variable at run time.
4136 This is only interesting if the constant is the wider arg.
4137 Also, it is not safe if the constant is unsigned and the
4138 variable arg is signed, since in this case the variable
4139 would be sign-extended and then regarded as unsigned.
4140 Our technique fails in this case because the lowest/highest
4141 possible unsigned results don't follow naturally from the
4142 lowest/highest possible values of the variable operand.
4143 For just EQ_EXPR and NE_EXPR there is another technique that
4144 could be used: see if the constant can be faithfully represented
4145 in the other operand's type, by truncating it and reextending it
4146 and see if that preserves the constant's value. */
4152 {
4155 /* 1 if comparison is nominally unsigned. */
4157 tree val;
4169 {
4170 /* Convert primop1 to target type, but do not introduce
4171 additional overflow. We know primop1 is an int_cst. */
4178 }
4180 {
4183 }
4191 /* This used to be a switch, but Genix compiler can't handle that. */
4193 {
4196 }
4198 {
4201 }
4203 {
4208 }
4210 {
4215 }
4217 {
4222 }
4224 {
4229 }
4231 /* If primop0 was sign-extended and unsigned comparison specd,
4232 we did a signed comparison above using the signed type bounds.
4233 But the comparison we output must be unsigned.
4235 Also, for inequalities, VAL is no good; but if the signed
4236 comparison had *any* fixed result, it follows that the
4237 unsigned comparison just tests the sign in reverse
4238 (positive values are LE, negative ones GE).
4239 So we can generate an unsigned comparison
4240 against an extreme value of the signed type. */
4243 {
4246 {
4261 }
4263 }
4266 {
4273 }
4276 {
4277 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4281 }
4283 /* Value is not predetermined, but do the comparison
4284 in the type of the operand that is not constant.
4285 TYPE is already properly set. */
4286 }
4288 /* If either arg is decimal float and the other is float, find the
4289 proper common type to use for comparison. */
4300 /* If args' natural types are both narrower than nominal type
4301 and both extend in the same manner, compare them
4302 in the type of the wider arg.
4303 Otherwise must actually extend both to the nominal
4304 common type lest different ways of extending
4305 alter the result.
4306 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4311 {
4315 type);
4316 /* Make sure shorter operand is extended the right way
4317 to match the longer operand. */
4318 primop0
4321 primop0);
4322 primop1
4325 primop1);
4326 }
4327 else
4328 {
4329 /* Here we must do the comparison on the nominal type
4330 using the args exactly as we received them. */
4337 {
4339 /* All unsigned values are >= 0, so we warn. However,
4340 if OP0 is a constant that is >= 0, the signedness of
4341 the comparison isn't an issue, so suppress the
4342 warning. */
4347 primop0)))
4348 /* Do not warn for enumeration types. */
4352 {
4369 }
4372 {
4373 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4378 }
4379 }
4380 }
4388 }
4389 \f
4390 /* Return a tree for the sum or difference (RESULTCODE says which)
4391 of pointer PTROP and integer INTOP. */
4393 tree
4396 {
4399 /* The result is a pointer of the same type that is being added. */
4403 {
4410 }
4412 {
4419 }
4420 else
4423 /* We are manipulating pointer values, so we don't need to warn
4424 about relying on undefined signed overflow. We disable the
4425 warning here because we use integer types so fold won't know that
4426 they are really pointers. */
4429 /* If what we are about to multiply by the size of the elements
4430 contains a constant term, apply distributive law
4431 and multiply that constant term separately.
4432 This helps produce common subexpressions. */
4437 /* If the constant comes from pointer subtraction,
4438 skip this optimization--it would cause an error. */
4440 /* If the constant is unsigned, and smaller than the pointer size,
4441 then we must skip this optimization. This is because it could cause
4442 an overflow error if the constant is negative but INTOP is not. */
4446 {
4451 /* Convert both subexpression types to the type of intop,
4452 because weird cases involving pointer arithmetic
4453 can result in a sum or difference with different type args. */
4458 }
4460 /* Convert the integer argument to a type the same size as sizetype
4461 so the multiply won't overflow spuriously. */
4467 /* Replace the integer argument with a suitable product by the object size.
4468 Do this multiplication as signed, then convert to the appropriate type
4469 for the pointer operation and disregard an overflow that occurred only
4470 because of the sign-extension change in the latter conversion. */
4471 {
4478 }
4480 /* Create the sum or difference. */
4489 }
4490 \f
4491 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4492 and if NON_CONST is known not to be permitted in an evaluated part
4493 of a constant expression. */
4495 tree
4497 {
4501 /* This should never be called for C++. */
4505 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4514 }
4516 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4517 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4518 around the SAVE_EXPR if needed so that c_fully_fold does not need
4519 to look inside SAVE_EXPRs. */
4521 tree
4523 {
4532 }
4534 /* Return whether EXPR is a declaration whose address can never be
4535 NULL. */
4537 bool
4539 {
4544 }
4546 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4547 or for an `if' or `while' statement or ?..: exp. It should already
4548 have been validated to be of suitable type; otherwise, a bad
4549 diagnostic may result.
4551 The EXPR is located at LOCATION.
4553 This preparation consists of taking the ordinary
4554 representation of an expression expr and producing a valid tree
4555 boolean expression describing whether expr is nonzero. We could
4556 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4557 but we optimize comparisons, &&, ||, and !.
4559 The resulting type should always be `truthvalue_type_node'. */
4561 tree
4563 {
4565 {
4607 ? truthvalue_true_node
4613 ? truthvalue_true_node
4618 /* Fall through. */
4621 {
4624 {
4625 /* Common Ada/Pascal programmer's mistake. */
4627 OPT_Waddress,
4629 inner);
4631 }
4633 }
4650 /* These don't change whether an object is nonzero or zero. */
4655 /* These don't change whether an object is zero or nonzero, but
4656 we can't ignore them if their second arg has side-effects. */
4658 {
4661 c_common_truthvalue_conversion
4664 }
4665 else
4670 /* Distribute the conversion into the arms of a COND_EXPR. */
4672 {
4675 /* In C++ one of the arms might have void type if it is throw. */
4683 }
4684 else
4685 {
4686 /* Folding will happen later for C. */
4694 }
4696 CASE_CONVERT:
4697 {
4701 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4702 since that affects how `default_conversion' will behave. */
4706 /* Don't strip a conversion from C++0x scoped enum, since they
4707 don't implicitly convert to other types. */
4711 /* If this isn't narrowing the argument, we can ignore it. */
4715 }
4721 {
4725 }
4730 }
4733 {
4735 expr = (build_binary_op
4739 c_common_truthvalue_conversion
4742 c_common_truthvalue_conversion
4747 }
4750 {
4755 }
4756 else
4759 ret:
4762 }
4763 \f
4772 /* Apply the TYPE_QUALS to the new DECL. */
4774 void
4776 {
4784 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4785 constructor can produce constant init, so rely on cp_finish_decl to
4786 clear TREE_READONLY if the variable has non-constant init. */
4789 {
4792 }
4794 {
4796 /* Allow 'restrict' on arrays of pointers.
4797 FIXME currently we just ignore it. */
4803 }
4804 }
4807 {
4810 };
4812 /* Hash function for the problem of multiple type definitions in
4813 different files. This must hash all types that will compare
4814 equal via comptypes to the same value. In practice it hashes
4815 on some of the simple stuff and leaves the details to comptypes. */
4817 hashval_t
4819 {
4822 tree t2;
4824 {
4825 /* For pointers, hash on pointee type plus some swizzling. */
4828 /* Hash on number of elements and total size. */
4847 }
4848 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4849 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4851 /* We might have a VLA here. */
4854 else
4857 }
4859 bool
4861 {
4863 }
4867 /* Return the typed-based alias set for T, which may be an expression
4868 or a type. Return -1 if we don't do anything special. */
4870 alias_set_type
4872 {
4873 tree u;
4875 /* For VLAs, use the alias set of the element type rather than the
4876 default of alias set 0 for types compared structurally. */
4878 {
4882 }
4884 /* Permit type-punning when accessing a union, provided the access
4885 is directly through the union. For example, this code does not
4886 permit taking the address of a union member and then storing
4887 through it. Even the type-punning allowed here is a GCC
4888 extension, albeit a common and useful one; the C standard says
4889 that such accesses have implementation-defined behavior. */
4897 /* That's all the expressions we handle specially. */
4901 /* The C standard guarantees that any object may be accessed via an
4902 lvalue that has character type. */
4908 /* The C standard specifically allows aliasing between signed and
4909 unsigned variants of the same type. We treat the signed
4910 variant as canonical. */
4912 {
4915 /* t1 == t can happen for boolean nodes which are always unsigned. */
4918 }
4920 /* Handle the case of multiple type nodes referring to "the same" type,
4921 which occurs with IMA. These share an alias set. FIXME: Currently only
4922 C90 is handled. (In C99 type compatibility is not transitive, which
4923 complicates things mightily. The alias set splay trees can theoretically
4924 represent this, but insertion is tricky when you consider all the
4925 different orders things might arrive in.) */
4930 /* Save time if there's only one input file. */
4934 /* Pointers need special handling if they point to any type that
4935 needs special handling (below). */
4937 {
4938 tree t2;
4939 /* Find bottom type under any nested POINTERs. */
4943 ;
4951 }
4952 /* These are the only cases that need special handling. */
4959 /* Undefined? */
4963 /* Look up t in hash table. Only one of the compatible types within each
4964 alias set is recorded in the table. */
4969 {
4972 }
4973 else
4974 /* Our caller will assign and record (in t) a new alias set; all we need
4975 to do is remember t in the hash table. */
4979 }
4980 \f
4981 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4982 the IS_SIZEOF parameter indicates which operator is being applied.
4983 The COMPLAIN flag controls whether we should diagnose possibly
4984 ill-formed constructs or not. LOC is the location of the SIZEOF or
4985 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4986 a type in any context should be returned, rather than the normal
4987 alignment for that type. */
4989 tree
4993 {
5001 {
5003 {
5010 }
5011 else
5012 {
5014 {
5018 else
5021 }
5023 }
5024 }
5026 {
5034 }
5037 {
5042 }
5045 {
5050 }
5051 else
5052 {
5054 /* Convert in case a char is more than one unit. */
5060 else
5062 }
5064 /* VALUE will have the middle-end integer type sizetype.
5065 However, we should really return a value of type `size_t',
5066 which is just a typedef for an ordinary integer type. */
5070 }
5072 /* Implement the __alignof keyword: Return the minimum required
5073 alignment of EXPR, measured in bytes. For VAR_DECLs,
5074 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5075 from an "aligned" __attribute__ specification). LOC is the
5076 location of the ALIGNOF operator. */
5078 tree
5080 {
5081 tree t;
5088 {
5091 }
5097 {
5104 {
5111 }
5113 }
5114 else
5118 }
5119 \f
5120 /* Handle C and C++ default attributes. */
5122 enum built_in_attribute
5123 {
5124 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5125 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5126 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5127 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5128 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5130 #undef DEF_ATTR_NULL_TREE
5131 #undef DEF_ATTR_INT
5132 #undef DEF_ATTR_STRING
5133 #undef DEF_ATTR_IDENT
5134 #undef DEF_ATTR_TREE_LIST
5135 ATTR_LAST
5136 };
5142 enum c_builtin_type
5143 {
5144 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5145 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5146 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5147 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5148 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5149 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5150 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5151 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5152 ARG6) NAME,
5153 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5154 ARG6, ARG7) NAME,
5155 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5156 ARG6, ARG7, ARG8) NAME,
5157 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5158 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5159 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5160 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5161 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5162 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5163 NAME,
5164 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5166 #undef DEF_PRIMITIVE_TYPE
5167 #undef DEF_FUNCTION_TYPE_0
5168 #undef DEF_FUNCTION_TYPE_1
5169 #undef DEF_FUNCTION_TYPE_2
5170 #undef DEF_FUNCTION_TYPE_3
5171 #undef DEF_FUNCTION_TYPE_4
5172 #undef DEF_FUNCTION_TYPE_5
5173 #undef DEF_FUNCTION_TYPE_6
5174 #undef DEF_FUNCTION_TYPE_7
5175 #undef DEF_FUNCTION_TYPE_8
5176 #undef DEF_FUNCTION_TYPE_VAR_0
5177 #undef DEF_FUNCTION_TYPE_VAR_1
5178 #undef DEF_FUNCTION_TYPE_VAR_2
5179 #undef DEF_FUNCTION_TYPE_VAR_3
5180 #undef DEF_FUNCTION_TYPE_VAR_4
5181 #undef DEF_FUNCTION_TYPE_VAR_5
5182 #undef DEF_POINTER_TYPE
5183 BT_LAST
5184 };
5188 /* A temporary array for c_common_nodes_and_builtins. Used in
5189 communication with def_fn_type. */
5192 /* A helper function for c_common_nodes_and_builtins. Build function type
5193 for DEF with return type RET and N arguments. If VAR is true, then the
5194 function should be variadic after those N arguments.
5196 Takes special care not to ICE if any of the types involved are
5197 error_mark_node, which indicates that said type is not in fact available
5198 (see builtin_type_for_size). In which case the function type as a whole
5199 should be error_mark_node. */
5201 static void
5203 {
5204 tree t;
5211 {
5217 }
5224 else
5227 egress:
5230 }
5232 /* Build builtin functions common to both C and C++ language
5233 frontends. */
5235 static void
5237 {
5238 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5239 builtin_types[ENUM] = VALUE;
5240 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5241 def_fn_type (ENUM, RETURN, 0, 0);
5242 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5243 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5244 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5245 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5246 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5247 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5248 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5249 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5250 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5251 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5252 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5253 ARG6) \
5254 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5255 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5256 ARG6, ARG7) \
5257 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5258 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5259 ARG6, ARG7, ARG8) \
5260 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5261 ARG7, ARG8);
5262 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5263 def_fn_type (ENUM, RETURN, 1, 0);
5264 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5265 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5266 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5267 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5268 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5269 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5270 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5271 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5272 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5273 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5274 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5275 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5279 #undef DEF_PRIMITIVE_TYPE
5280 #undef DEF_FUNCTION_TYPE_0
5281 #undef DEF_FUNCTION_TYPE_1
5282 #undef DEF_FUNCTION_TYPE_2
5283 #undef DEF_FUNCTION_TYPE_3
5284 #undef DEF_FUNCTION_TYPE_4
5285 #undef DEF_FUNCTION_TYPE_5
5286 #undef DEF_FUNCTION_TYPE_6
5287 #undef DEF_FUNCTION_TYPE_7
5288 #undef DEF_FUNCTION_TYPE_8
5289 #undef DEF_FUNCTION_TYPE_VAR_0
5290 #undef DEF_FUNCTION_TYPE_VAR_1
5291 #undef DEF_FUNCTION_TYPE_VAR_2
5292 #undef DEF_FUNCTION_TYPE_VAR_3
5293 #undef DEF_FUNCTION_TYPE_VAR_4
5294 #undef DEF_FUNCTION_TYPE_VAR_5
5295 #undef DEF_POINTER_TYPE
5300 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5301 NONANSI_P, ATTRS, IMPLICIT, COND) \
5302 if (NAME && COND) \
5303 def_builtin_1 (ENUM, NAME, CLASS, \
5304 builtin_types[(int) TYPE], \
5305 builtin_types[(int) LIBTYPE], \
5306 BOTH_P, FALLBACK_P, NONANSI_P, \
5307 built_in_attributes[(int) ATTRS], IMPLICIT);
5309 #undef DEF_BUILTIN
5317 }
5319 /* Like get_identifier, but avoid warnings about null arguments when
5320 the argument may be NULL for targets where GCC lacks stdint.h type
5321 information. */
5325 {
5327 }
5329 /* Build tree nodes and builtin functions common to both C and C++ language
5330 frontends. */
5332 void
5334 {
5338 tree array_domain_type;
5339 tree va_list_ref_type_node;
5340 tree va_list_arg_type_node;
5344 /* Define `int' and `char' first so that dbx will output them first. */
5348 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5349 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5350 but not C. Are the conditionals here needed? */
5356 long_unsigned_type_node);
5358 {
5360 int128_integer_type_node);
5362 int128_unsigned_type_node);
5363 }
5367 long_long_integer_type_node);
5369 long_long_unsigned_type_node);
5372 long_long_unsigned_type_node);
5375 short_unsigned_type_node);
5378 short_unsigned_type_node);
5380 /* Define both `signed char' and `unsigned char'. */
5384 /* These are types that c_common_type_for_size and
5385 c_common_type_for_mode use. */
5388 intQI_type_node));
5391 intHI_type_node));
5394 intSI_type_node));
5397 intDI_type_node));
5398 #if HOST_BITS_PER_WIDE_INT >= 64
5401 TYPE_DECL,
5403 intTI_type_node));
5404 #endif
5407 unsigned_intQI_type_node));
5410 unsigned_intHI_type_node));
5413 unsigned_intSI_type_node));
5416 unsigned_intDI_type_node));
5417 #if HOST_BITS_PER_WIDE_INT >= 64
5420 TYPE_DECL,
5422 unsigned_intTI_type_node));
5423 #endif
5425 /* Create the widest literal types. */
5426 widest_integer_literal_type_node
5430 widest_integer_literal_type_node));
5432 widest_unsigned_literal_type_node
5436 widest_unsigned_literal_type_node));
5440 pid_type_node =
5447 /* Only supported decimal floating point extension if the target
5448 actually supports underlying modes. */
5452 {
5456 }
5459 {
5464 long_long_fract_type_node);
5466 unsigned_short_fract_type_node);
5468 unsigned_fract_type_node);
5470 unsigned_long_fract_type_node);
5472 unsigned_long_long_fract_type_node);
5474 sat_short_fract_type_node);
5477 sat_long_fract_type_node);
5479 sat_long_long_fract_type_node);
5481 sat_unsigned_short_fract_type_node);
5483 sat_unsigned_fract_type_node);
5485 sat_unsigned_long_fract_type_node);
5487 sat_unsigned_long_long_fract_type_node);
5492 long_long_accum_type_node);
5494 unsigned_short_accum_type_node);
5496 unsigned_accum_type_node);
5498 unsigned_long_accum_type_node);
5500 unsigned_long_long_accum_type_node);
5502 sat_short_accum_type_node);
5505 sat_long_accum_type_node);
5507 sat_long_long_accum_type_node);
5509 sat_unsigned_short_accum_type_node);
5511 sat_unsigned_accum_type_node);
5513 sat_unsigned_long_accum_type_node);
5515 sat_unsigned_long_long_accum_type_node);
5517 }
5520 TYPE_DECL,
5522 complex_integer_type_node));
5524 TYPE_DECL,
5526 complex_float_type_node));
5528 TYPE_DECL,
5530 complex_double_type_node));
5534 complex_long_double_type_node));
5537 /* For C++, make fileptr_type_node a distinct void * type until
5538 FILE type is defined. */
5543 /* Set the TYPE_NAME for any variants that were built before
5544 record_builtin_type gave names to the built-in types. */
5545 {
5551 }
5555 /* Make a type to be the domain of a few array types
5556 whose domains don't really matter.
5557 200 is small enough that it always fits in size_t
5558 and large enough that it can hold most function names for the
5559 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5562 /* Make a type for arrays of characters.
5563 With luck nothing will ever really depend on the length of this
5564 array type. */
5565 char_array_type_node
5569 const_string_type_node
5573 /* This is special for C++ so functions can be overloaded. */
5579 {
5582 else
5585 }
5587 /* This is for wide string constants. */
5588 wchar_array_type_node
5591 /* Define 'char16_t'. */
5596 {
5601 }
5603 /* This is for UTF-16 string constants. */
5604 char16_array_type_node
5607 /* Define 'char32_t'. */
5612 {
5617 }
5619 /* This is for UTF-32 string constants. */
5620 char32_array_type_node
5623 wint_type_node =
5626 intmax_type_node =
5628 uintmax_type_node =
5632 sig_atomic_type_node =
5635 int8_type_node =
5638 int16_type_node =
5641 int32_type_node =
5644 int64_type_node =
5647 uint8_type_node =
5659 int_least8_type_node =
5662 int_least16_type_node =
5665 int_least32_type_node =
5668 int_least64_type_node =
5671 uint_least8_type_node =
5674 uint_least16_type_node =
5677 uint_least32_type_node =
5680 uint_least64_type_node =
5683 int_fast8_type_node =
5686 int_fast16_type_node =
5689 int_fast32_type_node =
5692 int_fast64_type_node =
5695 uint_fast8_type_node =
5698 uint_fast16_type_node =
5701 uint_fast32_type_node =
5704 uint_fast64_type_node =
5707 intptr_type_node =
5710 uintptr_type_node =
5713 default_function_type
5715 ptrdiff_type_node
5722 va_list_type_node));
5724 {
5727 tree ptype;
5730 {
5734 ptype));
5736 }
5737 }
5740 {
5743 }
5744 else
5745 {
5748 }
5755 /* Create the built-in __null node. It is important that this is
5756 not shared. */
5760 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5762 }
5764 /* The number of named compound-literals generated thus far. */
5767 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5769 void
5771 {
5774 compound_literal_number);
5775 compound_literal_number++;
5777 }
5779 tree
5781 {
5785 }
5788 /* Linked list of disabled built-in functions. */
5791 {
5799 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5800 begins with "__builtin_", give an error. */
5802 void
5804 {
5807 else
5808 {
5813 }
5814 }
5817 /* Return true if the built-in function NAME has been disabled, false
5818 otherwise. */
5820 static bool
5822 {
5825 {
5828 }
5830 }
5833 /* Worker for DEF_BUILTIN.
5834 Possibly define a builtin function with one or two names.
5835 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5836 nonansi_p and flag_no_nonansi_builtin. */
5838 static void
5845 {
5846 tree decl;
5859 fnattrs);
5868 }
5869 \f
5870 /* Nonzero if the type T promotes to int. This is (nearly) the
5871 integral promotions defined in ISO C99 6.3.1.1/2. */
5873 bool
5875 {
5877 {
5887 /* ??? Technically all enumerations not larger than an int
5888 promote to an int. But this is used along code paths
5889 that only want to notice a size change. */
5897 }
5898 }
5900 /* Return 1 if PARMS specifies a fixed number of parameters
5901 and none of their types is affected by default promotions. */
5903 int
5905 {
5906 const_tree t;
5908 {
5925 }
5927 }
5929 /* Recursively remove any '*' or '&' operator from TYPE. */
5930 tree
5932 {
5936 }
5938 /* Recursively remove pointer or array type from TYPE. */
5939 tree
5941 {
5945 }
5947 /* Used to compare case labels. K1 and K2 are actually tree nodes
5948 representing case labels, or NULL_TREE for a `default' label.
5949 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5950 K2, and 0 if K1 and K2 are equal. */
5952 int
5954 {
5955 /* Consider a NULL key (such as arises with a `default' label) to be
5956 smaller than anything else. */
5963 }
5965 /* Process a case label, located at LOC, for the range LOW_VALUE
5966 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5967 then this case label is actually a `default' label. If only
5968 HIGH_VALUE is NULL_TREE, then case label was declared using the
5969 usual C/C++ syntax, rather than the GNU case range extension.
5970 CASES is a tree containing all the case ranges processed so far;
5971 COND is the condition for the switch-statement itself. Returns the
5972 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5973 is created. */
5975 tree
5978 {
5979 tree type;
5980 tree label;
5981 tree case_label;
5982 splay_tree_node node;
5984 /* Create the LABEL_DECL itself. */
5987 /* If there was an error processing the switch condition, bail now
5988 before we get more confused. */
5996 {
5999 }
6001 /* Case ranges are a GNU extension. */
6008 {
6013 }
6015 {
6020 }
6023 {
6024 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6025 really a case range, even though it was written that way.
6026 Remove the HIGH_VALUE to simplify later processing. */
6031 }
6033 /* See if the case is in range of the type of the original testing
6034 expression. If both low_value and high_value are out of range,
6035 don't insert the case label and return NULL_TREE. */
6041 /* Look up the LOW_VALUE in the table of case labels we already
6042 have. */
6044 /* If there was not an exact match, check for overlapping ranges.
6045 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6046 that's a `default' label and the only overlap is an exact match. */
6048 {
6049 splay_tree_node low_bound;
6050 splay_tree_node high_bound;
6052 /* Even though there wasn't an exact match, there might be an
6053 overlap between this case range and another case range.
6054 Since we've (inductively) not allowed any overlapping case
6055 ranges, we simply need to find the greatest low case label
6056 that is smaller that LOW_VALUE, and the smallest low case
6057 label that is greater than LOW_VALUE. If there is an overlap
6058 it will occur in one of these two ranges. */
6064 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6065 the LOW_VALUE, so there is no need to check unless the
6066 LOW_BOUND is in fact itself a case range. */
6072 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6073 range is bigger than the low end of the current range, so we
6074 are only interested if the current range is a real range, and
6075 not an ordinary case label. */
6077 && high_value
6079 high_value)
6082 }
6083 /* If there was an overlap, issue an error. */
6085 {
6089 {
6093 }
6095 {
6098 }
6099 else
6100 {
6104 }
6106 }
6108 /* Add a CASE_LABEL to the statement-tree. */
6110 /* Register this case label in the splay tree. */
6117 error_out:
6118 /* Add a label so that the back-end doesn't think that the beginning of
6119 the switch is unreachable. Note that we do not add a case label, as
6120 that just leads to duplicates and thence to failure later on. */
6122 {
6125 }
6127 }
6129 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6130 Used to verify that case values match up with enumerator values. */
6132 static void
6134 {
6141 else
6148 buf);
6149 else
6154 }
6156 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6157 Used to verify that case values match up with enumerator values. */
6159 static int
6161 {
6165 /* Skip default case. */
6169 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6170 when we did our enum->case scan. Reset our scratch bit after. */
6173 else
6176 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6177 not set, that means that CASE_HIGH did not appear when we did our
6178 enum->case scan. Reset our scratch bit after. */
6180 {
6183 else
6185 }
6188 }
6190 /* Handle -Wswitch*. Called from the front end after parsing the
6191 switch construct. */
6192 /* ??? Should probably be somewhere generic, since other languages
6193 besides C and C++ would want this. At the moment, however, C/C++
6194 are the only tree-ssa languages that support enumerations at all,
6195 so the point is moot. */
6197 void
6200 {
6201 splay_tree_node default_node;
6202 splay_tree_node node;
6203 tree chain;
6213 /* From here on, we only care about about enumerated types. */
6217 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6221 /* Check the cases. Warn about case values which are not members of
6222 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6223 there is no default case, check that exactly all enumeration
6224 literals are covered by the cases. */
6226 /* Clearing COND if it is not an integer constant simplifies
6227 the tests inside the loop below. */
6231 /* The time complexity here is O(N*lg(N)) worst case, but for the
6232 common case of monotonically increasing enumerators, it is
6233 O(N), since the nature of the splay tree will keep the next
6234 element adjacent to the root at all times. */
6237 {
6243 {
6244 /* Mark the CASE_LOW part of the case entry as seen. */
6248 }
6250 /* Even though there wasn't an exact match, there might be a
6251 case range which includes the enumerator's value. */
6254 {
6258 {
6259 /* If we match the upper bound exactly, mark the CASE_HIGH
6260 part of the case entry as seen. */
6264 }
6265 }
6267 /* We've now determined that this enumerated literal isn't
6268 handled by the case labels of the switch statement. */
6270 /* If the switch expression is a constant, we only really care
6271 about whether that constant is handled by the switch. */
6275 /* If there is a default_node, the only relevant option is
6276 Wswitch-enum. Otherwise, if both are enabled then we prefer
6277 to warn using -Wswitch because -Wswitch is enabled by -Wall
6278 while -Wswitch-enum is explicit. */
6281 ? OPT_Wswitch_enum
6285 }
6287 /* Warn if there are case expressions that don't correspond to
6288 enumerators. This can occur since C and C++ don't enforce
6289 type-checking of assignments to enumeration variables.
6291 The time complexity here is now always O(N) worst case, since
6292 we should have marked both the lower bound and upper bound of
6293 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6294 above. This scan also resets those fields. */
6297 }
6299 /* Finish an expression taking the address of LABEL (an
6300 IDENTIFIER_NODE). Returns an expression for the address.
6302 LOC is the location for the expression returned. */
6304 tree
6306 {
6307 tree result;
6317 else
6318 {
6321 /* The current function is not necessarily uninlinable.
6322 Computed gotos are incompatible with inlining, but the value
6323 here could be used only in a diagnostic, for example. */
6325 }
6328 }
6329 \f
6331 /* Given a boolean expression ARG, return a tree representing an increment
6332 or decrement (as indicated by CODE) of ARG. The front end must check for
6333 invalid cases (e.g., decrement in C++). */
6334 tree
6336 {
6337 tree val;
6342 {
6365 }
6368 }
6369 \f
6370 /* Built-in macros for stddef.h and stdint.h, that require macros
6371 defined in this file. */
6372 void
6374 {
6437 }
6439 static void
6441 {
6442 /* Fill in the built_in_attributes array. */
6443 #define DEF_ATTR_NULL_TREE(ENUM) \
6444 built_in_attributes[(int) ENUM] = NULL_TREE;
6445 #define DEF_ATTR_INT(ENUM, VALUE) \
6446 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6447 #define DEF_ATTR_STRING(ENUM, VALUE) \
6448 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6449 #define DEF_ATTR_IDENT(ENUM, STRING) \
6450 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6451 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6452 built_in_attributes[(int) ENUM] \
6453 = tree_cons (built_in_attributes[(int) PURPOSE], \
6454 built_in_attributes[(int) VALUE], \
6455 built_in_attributes[(int) CHAIN]);
6457 #undef DEF_ATTR_NULL_TREE
6458 #undef DEF_ATTR_INT
6459 #undef DEF_ATTR_IDENT
6460 #undef DEF_ATTR_TREE_LIST
6461 }
6463 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6464 identifier as an argument, so the front end shouldn't look it up. */
6466 bool
6468 {
6471 /* Unknown attribute that we'll end up ignoring, return true so we
6472 don't complain about an identifier argument. */
6478 else
6480 }
6482 /* Attribute handlers common to C front ends. */
6484 /* Handle a "packed" attribute; arguments as in
6485 struct attribute_spec.handler. */
6487 static tree
6490 {
6492 {
6496 }
6498 {
6500 /* Still pack bitfields. */
6505 else
6507 }
6508 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6509 used for DECL_REGISTER. It wouldn't mean anything anyway.
6510 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6511 that changes what the typedef is typing. */
6512 else
6513 {
6516 }
6519 }
6521 /* Handle a "nocommon" attribute; arguments as in
6522 struct attribute_spec.handler. */
6524 static tree
6528 {
6531 else
6532 {
6535 }
6538 }
6540 /* Handle a "common" attribute; arguments as in
6541 struct attribute_spec.handler. */
6543 static tree
6546 {
6549 else
6550 {
6553 }
6556 }
6558 /* Handle a "noreturn" attribute; arguments as in
6559 struct attribute_spec.handler. */
6561 static tree
6564 {
6567 /* See FIXME comment in c_common_attribute_table. */
6574 = (build_qualified_type
6575 (build_pointer_type
6579 else
6580 {
6583 }
6586 }
6588 /* Handle a "hot" and attribute; arguments as in
6589 struct attribute_spec.handler. */
6591 static tree
6594 {
6597 {
6599 {
6603 }
6604 /* Most of the rest of the hot processing is done later with
6605 lookup_attribute. */
6606 }
6607 else
6608 {
6611 }
6614 }
6616 /* Handle a "cold" and attribute; arguments as in
6617 struct attribute_spec.handler. */
6619 static tree
6622 {
6625 {
6627 {
6631 }
6632 /* Most of the rest of the cold processing is done later with
6633 lookup_attribute. */
6634 }
6635 else
6636 {
6639 }
6642 }
6644 /* Handle a "no_sanitize_address" attribute; arguments as in
6645 struct attribute_spec.handler. */
6647 static tree
6650 {
6652 {
6655 }
6658 }
6660 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6661 struct attribute_spec.handler. */
6663 static tree
6666 {
6675 }
6677 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6678 struct attribute_spec.handler. */
6680 static tree
6683 {
6685 {
6688 }
6691 }
6693 /* Handle a "noinline" attribute; arguments as in
6694 struct attribute_spec.handler. */
6696 static tree
6700 {
6702 {
6704 {
6708 }
6709 else
6711 }
6712 else
6713 {
6716 }
6719 }
6721 /* Handle a "noclone" attribute; arguments as in
6722 struct attribute_spec.handler. */
6724 static tree
6728 {
6730 {
6733 }
6736 }
6738 /* Handle a "always_inline" attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6746 {
6748 {
6750 {
6754 }
6755 else
6756 /* Set the attribute and mark it for disregarding inline
6757 limits. */
6759 }
6760 else
6761 {
6764 }
6767 }
6769 /* Handle a "gnu_inline" attribute; arguments as in
6770 struct attribute_spec.handler. */
6772 static tree
6777 {
6779 {
6780 /* Do nothing else, just set the attribute. We'll get at
6781 it later with lookup_attribute. */
6782 }
6783 else
6784 {
6787 }
6790 }
6792 /* Handle a "leaf" attribute; arguments as in
6793 struct attribute_spec.handler. */
6795 static tree
6799 {
6801 {
6804 }
6806 {
6809 }
6812 }
6814 /* Handle an "artificial" attribute; arguments as in
6815 struct attribute_spec.handler. */
6817 static tree
6822 {
6824 {
6825 /* Do nothing else, just set the attribute. We'll get at
6826 it later with lookup_attribute. */
6827 }
6828 else
6829 {
6832 }
6835 }
6837 /* Handle a "flatten" attribute; arguments as in
6838 struct attribute_spec.handler. */
6840 static tree
6842 tree args ATTRIBUTE_UNUSED,
6844 {
6846 /* Do nothing else, just set the attribute. We'll get at
6847 it later with lookup_attribute. */
6848 ;
6849 else
6850 {
6853 }
6856 }
6858 /* Handle a "warning" or "error" attribute; arguments as in
6859 struct attribute_spec.handler. */
6861 static tree
6864 {
6867 /* Do nothing else, just set the attribute. We'll get at
6868 it later with lookup_attribute. */
6869 ;
6870 else
6871 {
6874 }
6877 }
6879 /* Handle a "used" attribute; arguments as in
6880 struct attribute_spec.handler. */
6882 static tree
6885 {
6891 {
6896 }
6897 else
6898 {
6901 }
6904 }
6906 /* Handle a "unused" attribute; arguments as in
6907 struct attribute_spec.handler. */
6909 static tree
6912 {
6914 {
6922 {
6927 }
6928 else
6929 {
6932 }
6933 }
6934 else
6935 {
6939 }
6942 }
6944 /* Handle a "externally_visible" attribute; arguments as in
6945 struct attribute_spec.handler. */
6947 static tree
6952 {
6956 {
6959 {
6963 }
6964 }
6965 else
6966 {
6969 }
6972 }
6974 /* Handle the "no_reorder" attribute. Arguments as in
6975 struct attribute_spec.handler. */
6977 static tree
6979 tree name,
6980 tree,
6983 {
6988 {
6991 name);
6993 }
6996 }
6998 /* Handle a "const" attribute; arguments as in
6999 struct attribute_spec.handler. */
7001 static tree
7004 {
7007 /* See FIXME comment on noreturn in c_common_attribute_table. */
7013 = (build_qualified_type
7014 (build_pointer_type
7018 else
7019 {
7022 }
7025 }
7027 /* Handle a "transparent_union" attribute; arguments as in
7028 struct attribute_spec.handler. */
7030 static tree
7034 {
7035 tree type;
7046 {
7047 /* Make sure that the first field will work for a transparent union.
7048 If the type isn't complete yet, leave the check to the code in
7049 finish_struct. */
7051 {
7057 }
7060 {
7061 /* If the type isn't complete yet, setting the flag
7062 on a variant wouldn't ever be checked. */
7066 /* build_duplicate_type doesn't work for C++. */
7070 /* A type variant isn't good enough, since we don't a cast
7071 to such a type removed as a no-op. */
7073 }
7077 }
7079 ignored:
7082 }
7084 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7085 get the requested priority for a constructor or destructor,
7086 possibly issuing diagnostics for invalid or reserved
7087 priorities. */
7089 static priority_type
7091 {
7092 HOST_WIDE_INT pri;
7093 tree arg;
7099 {
7102 else
7105 }
7122 {
7125 "destructor priorities from 0 to %d are reserved "
7127 MAX_RESERVED_INIT_PRIORITY);
7128 else
7130 "constructor priorities from 0 to %d are reserved "
7132 MAX_RESERVED_INIT_PRIORITY);
7133 }
7136 invalid:
7139 MAX_INIT_PRIORITY);
7140 else
7142 MAX_INIT_PRIORITY);
7144 }
7146 /* Handle a "constructor" attribute; arguments as in
7147 struct attribute_spec.handler. */
7149 static tree
7153 {
7160 {
7161 priority_type priority;
7166 }
7167 else
7168 {
7171 }
7174 }
7176 /* Handle a "destructor" attribute; arguments as in
7177 struct attribute_spec.handler. */
7179 static tree
7183 {
7190 {
7191 priority_type priority;
7196 }
7197 else
7198 {
7201 }
7204 }
7206 /* Nonzero if the mode is a valid vector mode for this architecture.
7207 This returns nonzero even if there is no hardware support for the
7208 vector mode, but we can emulate with narrower modes. */
7210 static int
7212 {
7216 /* Doh! What's going on? */
7225 /* Hardware support. Woo hoo! */
7231 /* We should probably return 1 if requesting V4DI and we have no DI,
7232 but we have V2DI, but this is probably very unlikely. */
7234 /* If we have support for the inner mode, we can safely emulate it.
7235 We may not have V2DI, but me can emulate with a pair of DIs. */
7237 }
7240 /* Handle a "mode" attribute; arguments as in
7241 struct attribute_spec.handler. */
7243 static tree
7246 {
7254 else
7255 {
7260 tree typefm;
7265 {
7271 }
7273 /* Change this type to have a type with the specified mode.
7274 First check for the special modes. */
7287 else
7290 {
7293 }
7296 {
7299 }
7303 {
7335 }
7337 {
7340 }
7343 {
7348 {
7351 }
7355 else
7358 }
7359 else
7360 {
7361 /* For fixed-point modes, we need to test if the signness of type
7362 and the machine mode are consistent. */
7365 {
7368 }
7369 /* For fixed-point modes, we need to pass saturating info. */
7373 }
7376 {
7379 }
7381 {
7382 /* For enumeral types, copy the precision from the integer
7383 type returned above. If not an INTEGER_TYPE, we can't use
7384 this mode for this type. */
7386 {
7389 }
7392 {
7395 }
7396 else
7397 {
7398 /* We cannot build a type variant, as there's code that assumes
7399 that TYPE_MAIN_VARIANT has the same mode. This includes the
7400 debug generators. Instead, create a subrange type. This
7401 results in all of the enumeral values being emitted only once
7402 in the original, and the subtype gets them by reference. */
7405 else
7408 }
7409 }
7413 {
7416 }
7419 }
7422 }
7424 /* Handle a "section" attribute; arguments as in
7425 struct attribute_spec.handler. */
7427 static tree
7430 {
7434 {
7440 {
7444 {
7446 "section attribute cannot be specified for "
7449 }
7451 /* The decl may have already been given a section attribute
7452 from a previous declaration. Ensure they match. */
7456 {
7460 }
7464 {
7467 }
7468 else
7471 }
7472 else
7473 {
7476 }
7477 }
7478 else
7479 {
7483 }
7486 }
7488 /* Check whether ALIGN is a valid user-specified alignment. If so,
7489 return its base-2 log; if not, output an error and return -1. If
7490 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7491 no error. */
7492 int
7494 {
7501 {
7504 }
7509 {
7512 }
7514 {
7517 }
7519 }
7521 /*
7522 If in c++-11, check if the c++-11 alignment constraint with respect
7523 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7524 c++-11 mode, does nothing.
7526 [dcl.align]2/ says:
7528 [* if the constant expression evaluates to a fundamental alignment,
7529 the alignment requirement of the declared entity shall be the
7530 specified fundamental alignment.
7532 * if the constant expression evaluates to an extended alignment
7533 and the implementation supports that alignment in the context
7534 of the declaration, the alignment of the declared entity shall
7535 be that alignment
7537 * if the constant expression evaluates to an extended alignment
7538 and the implementation does not support that alignment in the
7539 context of the declaration, the program is ill-formed]. */
7541 static bool
7545 {
7558 {
7560 {
7561 /* For file scope variables and static members, the target
7562 supports alignments that are at most
7563 MAX_OFILE_ALIGNMENT. */
7566 }
7567 else
7568 {
7569 #ifdef BIGGEST_FIELD_ALIGNMENT
7570 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7571 #else
7572 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7573 #endif
7574 /* For non-static members, the target supports either
7575 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7576 if it is defined or BIGGEST_ALIGNMENT. */
7581 #undef MAX_TARGET_FIELD_ALIGNMENT
7582 /* For stack variables, the target supports at most
7583 MAX_STACK_ALIGNMENT. */
7587 }
7588 }
7590 {
7591 /* Let's be liberal for types. */
7594 }
7602 }
7604 /* Handle a "aligned" attribute; arguments as in
7605 struct attribute_spec.handler. */
7607 static tree
7610 {
7614 tree align_expr;
7618 {
7623 }
7624 else
7628 {
7632 }
7640 {
7643 /* If we have a TYPE_DECL, then copy the type, so that we
7644 don't accidentally modify a builtin type. See pushdecl. */
7647 {
7654 }
7655 else
7660 }
7663 {
7666 }
7669 /* C++-11 [dcl.align/4]:
7671 When multiple alignment-specifiers are specified for an
7672 entity, the alignment requirement shall be set to the
7673 strictest specified alignment.
7675 This formally comes from the c++11 specification but we are
7676 doing it for the GNU attribute syntax as well. */
7680 {
7685 else
7689 }
7690 else
7691 {
7694 }
7697 }
7699 /* Handle a "weak" attribute; arguments as in
7700 struct attribute_spec.handler. */
7702 static tree
7707 {
7710 {
7713 }
7715 {
7719 }
7723 else
7727 }
7729 /* Handle an "alias" or "ifunc" attribute; arguments as in
7730 struct attribute_spec.handler, except that IS_ALIAS tells us
7731 whether this is an alias as opposed to ifunc attribute. */
7733 static tree
7736 {
7741 {
7744 }
7748 /* A static variable declaration is always a tentative definition,
7749 but the alias is a non-tentative definition which overrides. */
7752 {
7756 }
7760 {
7764 }
7766 /* Note that the very first time we process a nested declaration,
7767 decl_function_context will not be set. Indeed, *would* never
7768 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7769 we do below. After such frobbery, pushdecl would set the context.
7770 In any case, this is never what we want. */
7772 {
7773 tree id;
7777 {
7781 }
7783 /* This counts as a use of the object pointed to. */
7788 else
7792 /* ifuncs are also aliases, so set that attribute too. */
7795 }
7796 else
7797 {
7800 }
7803 {
7806 {
7809 else
7811 }
7812 }
7816 }
7818 /* Handle an "alias" or "ifunc" attribute; arguments as in
7819 struct attribute_spec.handler. */
7821 static tree
7824 {
7826 }
7828 /* Handle an "alias" or "ifunc" attribute; arguments as in
7829 struct attribute_spec.handler. */
7831 static tree
7834 {
7836 }
7838 /* Handle a "weakref" attribute; arguments as in struct
7839 attribute_spec.handler. */
7841 static tree
7844 {
7847 /* We must ignore the attribute when it is associated with
7848 local-scoped decls, since attribute alias is ignored and many
7849 such symbols do not even have a DECL_WEAK field. */
7851 || current_function_decl
7853 {
7857 }
7860 {
7864 }
7866 /* The idea here is that `weakref("name")' mutates into `weakref,
7867 alias("name")', and weakref without arguments, in turn,
7868 implicitly adds weak. */
7871 {
7878 }
7879 else
7880 {
7885 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7886 and that isn't supported; and because it wants to add it to
7887 the list of weak decls, which isn't helpful. */
7889 }
7892 {
7896 }
7899 }
7901 /* Handle an "visibility" attribute; arguments as in
7902 struct attribute_spec.handler. */
7904 static tree
7908 {
7914 {
7918 {
7920 name);
7922 }
7924 {
7928 }
7929 }
7931 {
7934 }
7937 {
7940 }
7942 /* If this is a type, set the visibility on the type decl. */
7944 {
7949 {
7951 name);
7953 }
7954 }
7964 else
7965 {
7966 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7968 }
7972 {
7986 }
7991 /* Go ahead and attach the attribute to the node as well. This is needed
7992 so we can determine whether we have VISIBILITY_DEFAULT because the
7993 visibility was not specified, or because it was explicitly overridden
7994 from the containing scope. */
7997 }
7999 /* Determine the ELF symbol visibility for DECL, which is either a
8000 variable or a function. It is an error to use this function if a
8001 definition of DECL is not available in this translation unit.
8002 Returns true if the final visibility has been determined by this
8003 function; false if the caller is free to make additional
8004 modifications. */
8006 bool
8008 {
8012 /* If the user explicitly specified the visibility with an
8013 attribute, honor that. DECL_VISIBILITY will have been set during
8014 the processing of the attribute. We check for an explicit
8015 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8016 to distinguish the use of an attribute from the use of a "#pragma
8017 GCC visibility push(...)"; in the latter case we still want other
8018 considerations to be able to overrule the #pragma. */
8020 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8025 /* Set default visibility to whatever the user supplied with
8026 visibility_specified depending on #pragma GCC visibility. */
8028 {
8031 {
8034 /* If visibility changed and DECL already has DECL_RTL, ensure
8035 symbol flags are updated. */
8040 }
8041 }
8043 }
8045 /* Handle an "tls_model" attribute; arguments as in
8046 struct attribute_spec.handler. */
8048 static tree
8051 {
8052 tree id;
8059 {
8062 }
8067 {
8070 }
8080 else
8081 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8085 }
8087 /* Handle a "no_instrument_function" attribute; arguments as in
8088 struct attribute_spec.handler. */
8090 static tree
8095 {
8099 {
8103 }
8104 else
8108 }
8110 /* Handle a "malloc" attribute; arguments as in
8111 struct attribute_spec.handler. */
8113 static tree
8116 {
8120 else
8121 {
8124 }
8127 }
8129 /* Handle a "alloc_size" attribute; arguments as in
8130 struct attribute_spec.handler. */
8132 static tree
8135 {
8138 {
8145 || !arg_count
8147 {
8152 }
8153 }
8155 }
8157 /* Handle a "alloc_align" attribute; arguments as in
8158 struct attribute_spec.handler. */
8160 static tree
8163 {
8170 || !arg_count
8172 {
8177 }
8179 }
8181 /* Handle a "assume_aligned" attribute; arguments as in
8182 struct attribute_spec.handler. */
8184 static tree
8187 {
8189 {
8196 {
8201 }
8202 }
8204 }
8206 /* Handle a "fn spec" attribute; arguments as in
8207 struct attribute_spec.handler. */
8209 static tree
8213 {
8218 }
8220 /* Handle a "warn_unused" attribute; arguments as in
8221 struct attribute_spec.handler. */
8223 static tree
8225 tree args ATTRIBUTE_UNUSED,
8227 {
8229 /* Do nothing else, just set the attribute. We'll get at
8230 it later with lookup_attribute. */
8231 ;
8232 else
8233 {
8236 }
8239 }
8241 /* Handle an "omp declare simd" attribute; arguments as in
8242 struct attribute_spec.handler. */
8244 static tree
8246 {
8248 }
8250 /* Handle an "omp declare target" attribute; arguments as in
8251 struct attribute_spec.handler. */
8253 static tree
8255 {
8257 }
8259 /* Handle a "returns_twice" attribute; arguments as in
8260 struct attribute_spec.handler. */
8262 static tree
8265 {
8268 else
8269 {
8272 }
8275 }
8277 /* Handle a "no_limit_stack" attribute; arguments as in
8278 struct attribute_spec.handler. */
8280 static tree
8285 {
8289 {
8293 }
8295 {
8299 }
8300 else
8304 }
8306 /* Handle a "pure" attribute; arguments as in
8307 struct attribute_spec.handler. */
8309 static tree
8312 {
8315 /* ??? TODO: Support types. */
8316 else
8317 {
8320 }
8323 }
8325 /* Digest an attribute list destined for a transactional memory statement.
8326 ALLOWED is the set of attributes that are allowed for this statement;
8327 return the attribute we parsed. Multiple attributes are never allowed. */
8329 int
8331 {
8336 {
8344 {
8347 }
8350 {
8353 }
8356 else
8358 }
8361 }
8363 /* Transform a TM attribute name into a maskable integer and back.
8364 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8365 to how the lack of an attribute is treated. */
8367 int
8369 {
8383 }
8385 tree
8387 {
8390 {
8408 }
8410 }
8412 /* Return the first TM attribute seen in LIST. */
8414 tree
8416 {
8418 {
8422 }
8424 }
8426 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8427 Here we accept only function types, and verify that none of the other
8428 function TM attributes are also applied. */
8429 /* ??? We need to accept class types for C++, but not C. This greatly
8430 complicates this function, since we can no longer rely on the extra
8431 processing given by function_type_required. */
8433 static tree
8436 {
8437 /* Only one path adds the attribute; others don't. */
8441 {
8444 /* Only tm_callable and tm_safe apply to classes. */
8447 /* FALLTHRU */
8451 {
8454 ;
8457 else
8459 }
8463 {
8466 {
8471 }
8472 }
8473 /* FALLTHRU */
8476 /* If a function is next, pass it on to be tried next. */
8480 ignored:
8483 }
8486 }
8488 /* Handle the TM_WRAP attribute; arguments as in
8489 struct attribute_spec.handler. */
8491 static tree
8494 {
8497 /* We don't need the attribute even on success, since we
8498 record the entry in an external table. */
8503 else
8504 {
8507 ;
8512 else
8513 {
8517 {
8521 else
8523 }
8524 else
8526 }
8527 }
8530 }
8532 /* Ignore the given attribute. Used when this attribute may be usefully
8533 overridden by the target, but is not used generically. */
8535 static tree
8539 {
8542 }
8544 /* Handle a "no vops" attribute; arguments as in
8545 struct attribute_spec.handler. */
8547 static tree
8551 {
8555 }
8557 /* Handle a "deprecated" attribute; arguments as in
8558 struct attribute_spec.handler. */
8560 static tree
8564 {
8572 {
8575 }
8578 {
8589 else
8591 }
8593 {
8598 }
8599 else
8603 {
8606 {
8612 }
8615 else
8617 }
8620 }
8622 /* Handle a "vector_size" attribute; arguments as in
8623 struct attribute_spec.handler. */
8625 static tree
8629 {
8642 {
8645 }
8647 /* Get the vector size (in bytes). */
8650 /* We need to provide for vector pointers, vector arrays, and
8651 functions returning vectors. For example:
8653 __attribute__((vector_size(16))) short *foo;
8655 In this case, the mode is SI, but the type being modified is
8656 HI, so we need to look further. */
8665 /* Get the mode of the type being modified. */
8676 {
8679 }
8682 {
8685 }
8688 {
8691 }
8693 /* Calculate how many units fit in the vector. */
8696 {
8699 }
8703 /* Build back pointers if needed. */
8707 }
8709 /* Handle the "nonnull" attribute. */
8710 static tree
8714 {
8718 /* If no arguments are specified, all pointer arguments should be
8719 non-null. Verify a full prototype is given so that the arguments
8720 will have the correct types when we actually check them later. */
8722 {
8724 {
8727 }
8729 }
8731 /* Argument list specified. Verify that each argument number references
8732 a pointer argument. */
8734 {
8743 {
8748 }
8751 {
8752 function_args_iterator iter;
8753 tree argument;
8757 {
8761 }
8765 {
8770 }
8773 {
8778 }
8779 }
8780 }
8783 }
8785 /* Check the argument list of a function call for null in argument slots
8786 that are marked as requiring a non-null pointer argument. The NARGS
8787 arguments are passed in the array ARGARRAY.
8788 */
8790 static void
8792 {
8793 tree a;
8801 /* See if any of the nonnull attributes has no arguments. If so,
8802 then every pointer argument is checked (in which case the check
8803 for pointer type is done in check_nonnull_arg). */
8805 do
8813 else
8814 {
8815 /* Walk the argument list. If we encounter an argument number we
8816 should check for non-null, do it. */
8818 {
8820 {
8824 }
8829 }
8830 }
8831 }
8833 /* Check that the Nth argument of a function call (counting backwards
8834 from the end) is a (pointer)0. The NARGS arguments are passed in the
8835 array ARGARRAY. */
8837 static void
8839 {
8843 {
8846 tree sentinel;
8847 function_args_iterator iter;
8848 tree t;
8850 /* Skip over the named arguments. */
8852 {
8855 len++;
8856 }
8859 {
8862 }
8864 /* The sentinel must be one of the varargs, i.e.
8865 in position >= the number of fixed arguments. */
8867 {
8871 }
8873 /* Validate the sentinel. */
8877 /* Although __null (in C++) is only an integer we allow it
8878 nevertheless, as we are guaranteed that it's exactly
8879 as wide as a pointer, and we don't want to force
8880 users to cast the NULL they have written there.
8881 We warn with -Wstrict-null-sentinel, though. */
8884 }
8885 }
8887 /* Helper for check_function_nonnull; given a list of operands which
8888 must be non-null in ARGS, determine if operand PARAM_NUM should be
8889 checked. */
8891 static bool
8893 {
8897 {
8904 }
8906 }
8908 /* Check that the function argument PARAM (which is operand number
8909 PARAM_NUM) is non-null. This is called by check_function_nonnull
8910 via check_function_arguments_recurse. */
8912 static void
8915 {
8916 /* Just skip checking the argument if it's not a pointer. This can
8917 happen if the "nonnull" attribute was given without an operand
8918 list (which means to check every pointer argument). */
8926 }
8928 /* Helper for nonnull attribute handling; fetch the operand number
8929 from the attribute argument list. */
8931 static bool
8933 {
8934 /* Verify the arg number is a small constant. */
8936 {
8939 }
8940 else
8942 }
8944 /* Handle a "nothrow" attribute; arguments as in
8945 struct attribute_spec.handler. */
8947 static tree
8950 {
8953 /* ??? TODO: Support types. */
8954 else
8955 {
8958 }
8961 }
8963 /* Handle a "cleanup" attribute; arguments as in
8964 struct attribute_spec.handler. */
8966 static tree
8969 {
8973 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8974 for global destructors in C++. This requires infrastructure that
8975 we don't have generically at the moment. It's also not a feature
8976 we'd be missing too much, since we do have attribute constructor. */
8978 {
8982 }
8984 /* Verify that the argument is a function in scope. */
8985 /* ??? We could support pointers to functions here as well, if
8986 that was considered desirable. */
8989 {
8993 }
8996 {
9000 }
9002 /* That the function has proper type is checked with the
9003 eventual call to build_function_call. */
9006 }
9008 /* Handle a "warn_unused_result" attribute. No special handling. */
9010 static tree
9014 {
9015 /* Ignore the attribute for functions not returning any value. */
9017 {
9020 }
9023 }
9025 /* Handle a "sentinel" attribute. */
9027 static tree
9030 {
9032 {
9036 }
9037 else
9038 {
9040 {
9044 }
9045 }
9048 {
9056 {
9060 }
9061 else
9062 {
9064 {
9068 }
9069 }
9070 }
9073 }
9075 /* Handle a "type_generic" attribute. */
9077 static tree
9081 {
9082 /* Ensure we have a function type. */
9085 /* Ensure we have a variadic function. */
9089 }
9091 /* Handle a "target" attribute. */
9093 static tree
9096 {
9097 /* Ensure we have a function type. */
9099 {
9102 }
9104 flags))
9108 }
9110 /* Arguments being collected for optimization. */
9115 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9116 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9117 false for #pragma GCC optimize. */
9119 bool
9121 {
9129 tree ap;
9131 /* Build up argv vector. Just in case the string is stored away, use garbage
9132 collected strings. */
9137 {
9141 {
9145 }
9148 {
9149 /* Split string into multiple substrings. */
9157 {
9164 {
9168 }
9169 else
9170 {
9173 }
9177 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9178 options. */
9180 {
9185 else
9189 }
9192 {
9195 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9196 itself is -Os, and any other switch begins with a -f. */
9202 }
9207 }
9209 }
9210 }
9220 /* Now parse the options. */
9230 /* Don't allow changing -fstrict-aliasing. */
9235 }
9237 /* For handling "optimize" attribute. arguments as in
9238 struct attribute_spec.handler. */
9240 static tree
9243 {
9244 /* Ensure we have a function type. */
9246 {
9249 }
9250 else
9251 {
9255 /* Save current options. */
9258 /* If we previously had some optimization options, use them as the
9259 default. */
9264 /* Parse options, and update the vector. */
9269 /* Restore current options. */
9271 }
9274 }
9276 /* Handle a "no_split_stack" attribute. */
9278 static tree
9283 {
9287 {
9291 }
9293 {
9297 }
9300 }
9302 /* Handle a "returns_nonnull" attribute; arguments as in
9303 struct attribute_spec.handler. */
9305 static tree
9308 {
9309 // Even without a prototype we still have a return type we can check.
9311 {
9314 }
9316 }
9318 /* Handle a "designated_init" attribute; arguments as in
9319 struct attribute_spec.handler. */
9321 static tree
9324 {
9326 {
9329 }
9331 }
9333 \f
9334 /* Check for valid arguments being passed to a function with FNTYPE.
9335 There are NARGS arguments in the array ARGARRAY. */
9336 void
9338 {
9339 /* Check for null being passed in a pointer argument that must be
9340 non-null. We also need to do this if format checking is enabled. */
9345 /* Check for errors in format strings. */
9352 }
9354 /* Generic argument checking recursion routine. PARAM is the argument to
9355 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9356 once the argument is resolved. CTX is context for the callback. */
9357 void
9362 {
9366 {
9367 /* Strip coercion. */
9371 }
9374 {
9376 tree attrs;
9379 /* See if this is a call to a known internationalization function
9380 that modifies a format arg. Such a function may have multiple
9381 format_arg attributes (for example, ngettext). */
9384 attrs;
9387 {
9388 tree inner_arg;
9389 tree format_num_expr;
9392 call_expr_arg_iterator iter;
9394 /* Extract the argument number, which was previously checked
9395 to be valid. */
9404 {
9409 }
9410 }
9412 /* If we found a format_arg attribute and did a recursive check,
9413 we are done with checking this argument. Otherwise, we continue
9414 and this will be considered a non-literal. */
9417 }
9420 {
9421 /* Check both halves of the conditional expression. */
9427 }
9430 }
9432 /* Checks for a builtin function FNDECL that the number of arguments
9433 NARGS against the required number REQUIRED and issues an error if
9434 there is a mismatch. Returns true if the number of arguments is
9435 correct, otherwise false. */
9437 static bool
9439 {
9441 {
9445 }
9447 {
9451 }
9453 }
9455 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9456 Returns false if there was an error, otherwise true. */
9458 bool
9460 {
9466 {
9476 {
9478 {
9482 }
9484 }
9494 {
9501 {
9505 }
9507 }
9512 {
9517 {
9521 }
9524 {
9526 fndecl);
9528 }
9530 }
9535 {
9537 {
9540 }
9542 }
9547 }
9548 }
9550 /* Function to help qsort sort FIELD_DECLs by name order. */
9552 int
9554 {
9559 /* A nontype is "greater" than a type. */
9568 }
9571 gt_pointer_operator new_value;
9575 /* This routine compares two fields like field_decl_cmp but using the
9576 pointer operator in resort_data. */
9578 static int
9580 {
9585 /* A nontype is "greater" than a type. */
9591 {
9598 }
9600 }
9602 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9604 void
9607 gt_pointer_operator new_value,
9609 {
9614 resort_field_decl_cmp);
9615 }
9617 /* Subroutine of c_parse_error.
9618 Return the result of concatenating LHS and RHS. RHS is really
9619 a string literal, its first character is indicated by RHS_START and
9620 RHS_SIZE is its length (including the terminating NUL character).
9622 The caller is responsible for deleting the returned pointer. */
9626 {
9632 }
9634 /* Issue the error given by GMSGID, indicating that it occurred before
9635 TOKEN, which had the associated VALUE. */
9637 void
9640 {
9641 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9651 {
9656 {
9669 }
9673 else
9679 }
9701 {
9706 }
9714 {
9719 }
9720 else
9724 {
9727 }
9728 #undef catenate_messages
9729 }
9731 /* Return the gcc option code associated with the reason for a cpp
9732 message, or 0 if none. */
9734 static int
9736 {
9740 {
9743 }
9745 }
9747 /* Callback from cpp_error for PFILE to print diagnostics from the
9748 preprocessor. The diagnostic is of type LEVEL, with REASON set
9749 to the reason code if LEVEL is represents a warning, at location
9750 LOCATION unless this is after lexing and the compiler's location
9751 should be used instead, with column number possibly overridden by
9752 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9753 the arguments. Returns true if a diagnostic was emitted, false
9754 otherwise. */
9756 bool
9760 {
9761 diagnostic_info diagnostic;
9762 diagnostic_t dlevel;
9767 {
9772 /* Fall through. */
9797 }
9810 }
9812 /* Convert a character from the host to the target execution character
9813 set. cpplib handles this, mostly. */
9815 HOST_WIDE_INT
9817 {
9818 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9819 zero-extended under -fno-signed-char. cpplib insists that characters
9820 and character constants are always unsigned. Hence we must convert
9821 back and forth. */
9829 else
9831 }
9833 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9834 references with an INDIRECT_REF of a constant at the bottom; much like the
9835 traditional rendering of offsetof as a macro. Return the folded result. */
9837 tree
9839 {
9843 {
9859 {
9862 }
9872 {
9876 }
9889 /* Check if the offset goes beyond the upper bound of the array. */
9891 {
9897 {
9901 {
9902 tree v;
9909 {
9917 }
9918 /* Don't warn if the array might be considered a poor
9919 man's flexible array member with a very permissive
9920 definition thereof. */
9924 "index %E denotes an offset "
9927 }
9928 }
9929 }
9936 /* Handle static members of volatile structs. */
9943 }
9946 }
9948 /* Likewise, but convert it to the return type of offsetof. */
9950 tree
9952 {
9954 }
9956 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9957 expression, because B will always be true. */
9959 void
9961 {
9964 "the omitted middle operand in ?: will always be %<true%>, "
9966 }
9968 /* Give an error for storing into ARG, which is 'const'. USE indicates
9969 how ARG was being used. */
9971 void
9973 {
9976 /* Using this macro rather than (for example) arrays of messages
9977 ensures that all the format strings are checked at compile
9978 time. */
9979 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9980 : (use == lv_increment ? (I) \
9981 : (use == lv_decrement ? (D) : (AS))))
9983 {
9994 else
10000 }
10006 arg);
10012 arg);
10014 {
10024 arg);
10025 }
10031 arg);
10032 else
10037 arg);
10038 }
10040 /* Print an error message for an invalid lvalue. USE says
10041 how the lvalue is being used and so selects the error message. LOC
10042 is the location for the error. */
10044 void
10046 {
10048 {
10066 }
10067 }
10069 /* Print an error message for an invalid indirection of type TYPE.
10070 ERRSTRING is the name of the operator for the indirection. */
10072 void
10074 {
10076 {
10084 type);
10089 type);
10094 type);
10099 type);
10104 type);
10108 }
10109 }
10110 \f
10111 /* *PTYPE is an incomplete array. Complete it with a domain based on
10112 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10113 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10114 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10116 int
10118 {
10126 {
10128 {
10129 int eltsize
10132 }
10134 {
10138 {
10142 }
10143 else
10144 {
10145 tree curindex;
10156 {
10160 else
10161 {
10163 {
10164 /* Since we treat size types now as ordinary
10165 unsigned types, we need an explicit overflow
10166 check. */
10170 }
10172 size_one_node);
10173 }
10176 }
10178 {
10182 }
10183 }
10184 }
10185 else
10186 {
10187 /* Make an error message unless that happened already. */
10190 }
10191 }
10192 else
10193 {
10197 }
10204 else
10207 /* Using build_distinct_type_copy and modifying things afterward instead
10208 of using build_array_type to create a new type preserves all of the
10209 TYPE_LANG_FLAG_? bits that the front end may have set. */
10217 /* Make sure we have the canonical MAIN_TYPE. */
10220 hashcode);
10223 /* Fix the canonical type. */
10233 else
10238 else
10244 {
10246 /* If we proceed with the array type as it is, we'll eventually
10247 crash in tree_to_[su]hwi(). */
10249 }
10253 }
10255 /* Like c_mark_addressable but don't check register qualifier. */
10256 void
10258 {
10264 }
10267 \f
10268 /* Used to help initialize the builtin-types.def table. When a type of
10269 the correct size doesn't exist, use error_mark_node instead of NULL.
10270 The later results in segfaults even when a decl using the type doesn't
10271 get invoked. */
10273 tree
10275 {
10278 }
10280 /* A helper function for resolve_overloaded_builtin in resolving the
10281 overloaded __sync_ builtins. Returns a positive power of 2 if the
10282 first operand of PARAMS is a pointer to a supported data type.
10283 Returns 0 if an error is encountered. */
10285 static int
10287 {
10288 tree type;
10292 {
10295 }
10299 {
10300 /* Force array-to-pointer decay for C++. */
10304 }
10316 incompatible:
10319 }
10321 /* A helper function for resolve_overloaded_builtin. Adds casts to
10322 PARAMS to make arguments match up with those of FUNCTION. Drops
10323 the variadic arguments at the end. Returns false if some error
10324 was encountered; true on success. */
10326 static bool
10329 {
10330 function_args_iterator iter;
10331 tree ptype;
10335 /* We've declared the implementation functions to use "volatile void *"
10336 as the pointer parameter, so we shouldn't get any complaints from the
10337 call to check_function_arguments what ever type the user used. */
10342 /* For the rest of the values, we need to cast these to FTYPE, so that we
10343 don't get warnings for passing pointer types, etc. */
10346 {
10350 /* XXX void_type_node belies the abstraction. */
10356 {
10359 }
10361 /* Only convert parameters if arg_type is unsigned integer type with
10362 new format sync routines, i.e. don't attempt to convert pointer
10363 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10364 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10365 kinds). */
10367 {
10368 /* Ideally for the first conversion we'd use convert_for_assignment
10369 so that we get warnings for anything that doesn't match the pointer
10370 type. This isn't portable across the C and C++ front ends atm. */
10375 }
10378 }
10380 /* __atomic routines are not variadic. */
10382 {
10385 }
10387 /* The definition of these primitives is variadic, with the remaining
10388 being "an optional list of variables protected by the memory barrier".
10389 No clue what that's supposed to mean, precisely, but we consider all
10390 call-clobbered variables to be protected so we're safe. */
10394 }
10396 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10397 RESULT to make it match the type of the first pointer argument in
10398 PARAMS. */
10400 static tree
10402 {
10407 /* New format doesn't require casting unless the types are the same size. */
10410 else
10412 }
10414 /* This function verifies the PARAMS to generic atomic FUNCTION.
10415 It returns the size if all the parameters are the same size, otherwise
10416 0 is returned if the parameters are invalid. */
10418 static int
10421 {
10426 tree type_0;
10428 /* Determine the parameter makeup. */
10430 {
10446 }
10449 {
10452 }
10454 /* Get type of first parameter, and determine its size. */
10457 {
10458 /* Force array-to-pointer decay for C++. */
10462 }
10464 {
10466 function);
10468 }
10470 /* Types must be compile time constant sizes. */
10472 {
10475 function);
10477 }
10481 /* Zero size objects are not allowed. */
10483 {
10486 function);
10488 }
10490 /* Check each other parameter is a pointer and the same size. */
10492 {
10495 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10499 {
10501 function);
10503 }
10507 {
10509 function);
10511 }
10512 }
10514 /* Check memory model parameters for validity. */
10516 {
10519 {
10522 {
10525 function);
10526 }
10527 }
10528 else
10530 {
10532 function);
10534 }
10535 }
10538 }
10541 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10542 at the beginning of the parameter list PARAMS representing the size of the
10543 objects. This is to match the library ABI requirement. LOC is the location
10544 of the function call.
10545 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10546 returned to allow the external call to be constructed. */
10548 static tree
10551 {
10552 tree size_node;
10554 /* Insert a SIZE_T parameter as the first param. If there isn't
10555 enough space, allocate a new vector and recursively re-build with that. */
10557 {
10560 tree f;
10570 }
10572 /* Add the size parameter and leave as a function call for processing. */
10576 }
10579 /* Return whether atomic operations for naturally aligned N-byte
10580 arguments are supported, whether inline or through libatomic. */
10581 static bool
10583 {
10585 {
10597 }
10598 }
10600 /* This will process an __atomic_exchange function call, determine whether it
10601 needs to be mapped to the _N variation, or turned into a library call.
10602 LOC is the location of the builtin call.
10603 FUNCTION is the DECL that has been invoked;
10604 PARAMS is the argument list for the call. The return value is non-null
10605 TRUE is returned if it is translated into the proper format for a call to the
10606 external library, and NEW_RETURN is set the tree for that function.
10607 FALSE is returned if processing for the _N variation is required, and
10608 NEW_RETURN is set to the the return value the result is copied into. */
10609 static bool
10612 {
10617 /* Size of 0 is an error condition. */
10619 {
10622 }
10624 /* If not a lock-free size, change to the library generic format. */
10626 {
10629 }
10631 /* Otherwise there is a lockfree match, transform the call from:
10632 void fn(T* mem, T* desired, T* return, model)
10633 into
10634 *return = (T) (fn (In* mem, (In) *desired, model)) */
10641 /* Create pointer to appropriate size. */
10645 /* Convert object pointer to required type. */
10648 /* Convert new value to required type, and dereference it. */
10653 /* Move memory model to the 3rd position, and end param list. */
10657 /* Convert return pointer and dereference it for later assignment. */
10661 }
10664 /* This will process an __atomic_compare_exchange function call, determine
10665 whether it needs to be mapped to the _N variation, or turned into a lib call.
10666 LOC is the location of the builtin call.
10667 FUNCTION is the DECL that has been invoked;
10668 PARAMS is the argument list for the call. The return value is non-null
10669 TRUE is returned if it is translated into the proper format for a call to the
10670 external library, and NEW_RETURN is set the tree for that function.
10671 FALSE is returned if processing for the _N variation is required. */
10673 static bool
10677 {
10682 /* Size of 0 is an error condition. */
10684 {
10687 }
10689 /* If not a lock-free size, change to the library generic format. */
10691 {
10692 /* The library generic format does not have the weak parameter, so
10693 remove it from the param list. Since a parameter has been removed,
10694 we can be sure that there is room for the SIZE_T parameter, meaning
10695 there will not be a recursive rebuilding of the parameter list, so
10696 there is no danger this will be done twice. */
10698 {
10702 }
10705 }
10707 /* Otherwise, there is a match, so the call needs to be transformed from:
10708 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10709 into
10710 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10716 /* Create pointer to appropriate size. */
10720 /* Convert object pointer to required type. */
10724 /* Convert expected pointer to required type. */
10728 /* Convert desired value to required type, and dereference it. */
10733 /* The rest of the parameters are fine. NULL means no special return value
10734 processing.*/
10737 }
10740 /* This will process an __atomic_load function call, determine whether it
10741 needs to be mapped to the _N variation, or turned into a library call.
10742 LOC is the location of the builtin call.
10743 FUNCTION is the DECL that has been invoked;
10744 PARAMS is the argument list for the call. The return value is non-null
10745 TRUE is returned if it is translated into the proper format for a call to the
10746 external library, and NEW_RETURN is set the tree for that function.
10747 FALSE is returned if processing for the _N variation is required, and
10748 NEW_RETURN is set to the the return value the result is copied into. */
10750 static bool
10753 {
10758 /* Size of 0 is an error condition. */
10760 {
10763 }
10765 /* If not a lock-free size, change to the library generic format. */
10767 {
10770 }
10772 /* Otherwise, there is a match, so the call needs to be transformed from:
10773 void fn(T* mem, T* return, model)
10774 into
10775 *return = (T) (fn ((In *) mem, model)) */
10781 /* Create pointer to appropriate size. */
10785 /* Convert object pointer to required type. */
10789 /* Move memory model to the 2nd position, and end param list. */
10793 /* Convert return pointer and dereference it for later assignment. */
10797 }
10800 /* This will process an __atomic_store function call, determine whether it
10801 needs to be mapped to the _N variation, or turned into a library call.
10802 LOC is the location of the builtin call.
10803 FUNCTION is the DECL that has been invoked;
10804 PARAMS is the argument list for the call. The return value is non-null
10805 TRUE is returned if it is translated into the proper format for a call to the
10806 external library, and NEW_RETURN is set the tree for that function.
10807 FALSE is returned if processing for the _N variation is required, and
10808 NEW_RETURN is set to the the return value the result is copied into. */
10810 static bool
10813 {
10818 /* Size of 0 is an error condition. */
10820 {
10823 }
10825 /* If not a lock-free size, change to the library generic format. */
10827 {
10830 }
10832 /* Otherwise, there is a match, so the call needs to be transformed from:
10833 void fn(T* mem, T* value, model)
10834 into
10835 fn ((In *) mem, (In) *value, model) */
10840 /* Create pointer to appropriate size. */
10844 /* Convert object pointer to required type. */
10848 /* Convert new value to required type, and dereference it. */
10853 /* The memory model is in the right spot already. Return is void. */
10857 }
10860 /* Some builtin functions are placeholders for other expressions. This
10861 function should be called immediately after parsing the call expression
10862 before surrounding code has committed to the type of the expression.
10864 LOC is the location of the builtin call.
10866 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10867 PARAMS is the argument list for the call. The return value is non-null
10868 when expansion is complete, and null if normal processing should
10869 continue. */
10871 tree
10874 {
10880 {
10886 else
10890 }
10892 /* Handle BUILT_IN_NORMAL here. */
10894 {
10899 {
10900 /* Handle these 4 together so that they can fall through to the next
10901 case if the call is transformed to an _N variant. */
10903 {
10905 {
10909 /* Change to the _N variant. */
10912 }
10915 {
10917 params,
10920 /* Change to the _N variant. */
10923 }
10925 {
10929 /* Change to the _N variant. */
10932 }
10934 {
10938 /* Change to the _N variant. */
10941 }
10944 }
10945 /* Fallthrough to the normal processing. */
10946 }
10963 {
10965 /* Fallthru for parameter processing. */
10966 }
10983 {
10994 orig_format))
10999 NULL);
11007 /* If new_return is set, assign function to that expr and cast the
11008 result to void since the generic interface returned void. */
11010 {
11011 /* Cast function result from I{1,2,4,8,16} to the required type. */
11014 result);
11018 }
11020 }
11024 }
11025 }
11027 /* vector_types_compatible_elements_p is used in type checks of vectors
11028 values used as operands of binary operators. Where it returns true, and
11029 the other checks of the caller succeed (being vector types in he first
11030 place, and matching number of elements), we can just treat the types
11031 as essentially the same.
11032 Contrast with vector_targets_convertible_p, which is used for vector
11033 pointer types, and vector_types_convertible_p, which will allow
11034 language-specific matches under the control of flag_lax_vector_conversions,
11035 and might still require a conversion. */
11036 /* True if vector types T1 and T2 can be inputs to the same binary
11037 operator without conversion.
11038 We don't check the overall vector size here because some of our callers
11039 want to give different error messages when the vectors are compatible
11040 except for the element count. */
11042 bool
11044 {
11057 /* Equality works here because c_common_signed_type uses
11058 TYPE_MAIN_VARIANT. */
11066 }
11068 /* Check for missing format attributes on function pointers. LTYPE is
11069 the new type or left-hand side type. RTYPE is the old type or
11070 right-hand side type. Returns TRUE if LTYPE is missing the desired
11071 attribute. */
11073 bool
11075 {
11077 tree ra;
11083 {
11084 tree la;
11089 }
11090 else
11092 }
11094 /* Subscripting with type char is likely to lose on a machine where
11095 chars are signed. So warn on any machine, but optionally. Don't
11096 warn for unsigned char since that type is safe. Don't warn for
11097 signed char because anyone who uses that must have done so
11098 deliberately. Furthermore, we reduce the false positive load by
11099 warning only for non-constant value of type char. */
11101 void
11103 {
11107 }
11109 /* Implement -Wparentheses for the unexpected C precedence rules, to
11110 cover cases like x + y << z which readers are likely to
11111 misinterpret. We have seen an expression in which CODE is a binary
11112 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11113 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11114 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11115 expression was not formed using a binary or unary operator, or it
11116 was enclosed in parentheses. */
11118 void
11122 {
11126 /* This macro tests that the expression ARG with original tree code
11127 CODE appears to be a boolean expression. or the result of folding a
11128 boolean expression. */
11129 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11130 (truth_value_p (TREE_CODE (ARG)) \
11131 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11133 || ((CODE) != INTEGER_CST \
11134 && (integer_onep (ARG) || integer_zerop (ARG))))
11137 {
11186 /* Check cases like x|y==z */
11193 /* Check cases like !x | y */
11197 "suggest parentheses around operand of "
11210 /* Check cases like x^y==z */
11232 /* Check cases like x&y==z */
11239 /* Check cases like !x & y */
11243 "suggest parentheses around operand of "
11266 {
11271 "comparisons like %<X<=Y<=Z%> do not "
11277 "comparisons like %<X<=Y<=Z%> do not "
11279 }
11281 }
11282 #undef NOT_A_BOOLEAN_EXPR_P
11283 }
11285 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11287 void
11289 {
11291 {
11294 else
11296 }
11297 }
11299 /* Warn for division by zero according to the value of DIVISOR. LOC
11300 is the location of the division operator. */
11302 void
11304 {
11305 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11306 about division by zero. Do not issue a warning if DIVISOR has a
11307 floating-point type, since we consider 0.0/0.0 a valid way of
11308 generating a NaN. */
11312 }
11314 /* Subroutine of build_binary_op. Give warnings for comparisons
11315 between signed and unsigned quantities that may fail. Do the
11316 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11317 so that casts will be considered, but default promotions won't
11318 be.
11320 LOCATION is the location of the comparison operator.
11322 The arguments of this function map directly to local variables
11323 of build_binary_op. */
11325 void
11330 {
11335 /* In C++, check for comparison of different enum types. */
11341 {
11345 }
11347 /* Do not warn if the comparison is being done in a signed type,
11348 since the signed type will only be chosen if it can represent
11349 all the values of the unsigned type. */
11352 /* Do not warn if both operands are unsigned. */
11355 else
11356 {
11362 else
11370 /* Do not warn if the signed quantity is an unsuffixed integer
11371 literal (or some static constant expression involving such
11372 literals or a conditional expression involving such literals)
11373 and it is non-negative. */
11376 /* Do not warn if the comparison is an equality operation, the
11377 unsigned quantity is an integral constant, and it would fit
11378 in the result if the result were signed. */
11383 /* In C, do not warn if the unsigned quantity is an enumeration
11384 constant and its maximum value would fit in the result if the
11385 result were signed. */
11391 else
11393 OPT_Wsign_compare,
11395 }
11397 /* Warn if two unsigned values are being compared in a size larger
11398 than their original size, and one (and only one) is the result of
11399 a `~' operator. This comparison will always fail.
11401 Also warn if one operand is a constant, and the constant does not
11402 have all bits set that are set in the ~ operand when it is
11403 extended. */
11410 {
11417 {
11418 tree primop;
11424 {
11428 }
11429 else
11430 {
11434 }
11439 {
11442 {
11446 else
11449 }
11450 }
11451 }
11459 }
11460 }
11462 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11463 type via c_common_type. If -Wdouble-promotion is in use, and the
11464 conditions for warning have been met, issue a warning. GMSGID is
11465 the warning message. It must have two %T specifiers for the type
11466 that was converted (generally "float") and the type to which it was
11467 converted (generally "double), respectively. LOC is the location
11468 to which the awrning should refer. */
11470 void
11473 {
11474 tree source_type;
11478 /* If the conversion will not occur at run-time, there is no need to
11479 warn about it. */
11491 else
11494 }
11496 /* Setup a TYPE_DECL node as a typedef representation.
11498 X is a TYPE_DECL for a typedef statement. Create a brand new
11499 ..._TYPE node (which will be just a variant of the existing
11500 ..._TYPE node with identical properties) and then install X
11501 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11503 The whole point here is to end up with a situation where each
11504 and every ..._TYPE node the compiler creates will be uniquely
11505 associated with AT MOST one node representing a typedef name.
11506 This way, even though the compiler substitutes corresponding
11507 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11508 early on, later parts of the compiler can always do the reverse
11509 translation and get back the corresponding typedef name. For
11510 example, given:
11512 typedef struct S MY_TYPE;
11513 MY_TYPE object;
11515 Later parts of the compiler might only know that `object' was of
11516 type `struct S' if it were not for code just below. With this
11517 code however, later parts of the compiler see something like:
11519 struct S' == struct S
11520 typedef struct S' MY_TYPE;
11521 struct S' object;
11523 And they can then deduce (from the node for type struct S') that
11524 the original object declaration was:
11526 MY_TYPE object;
11528 Being able to do this is important for proper support of protoize,
11529 and also for generating precise symbolic debugging information
11530 which takes full account of the programmer's (typedef) vocabulary.
11532 Obviously, we don't want to generate a duplicate ..._TYPE node if
11533 the TYPE_DECL node that we are now processing really represents a
11534 standard built-in type. */
11536 void
11538 {
11542 {
11545 }
11548 {
11556 }
11557 }
11559 /* Record the types used by the current global variable declaration
11560 being parsed, so that we can decide later to emit their debug info.
11561 Those types are in types_used_by_cur_var_decl, and we are going to
11562 store them in the types_used_by_vars_hash hash table.
11563 DECL is the declaration of the global variable that has been parsed. */
11565 void
11567 {
11571 {
11574 }
11575 }
11577 /* If DECL is a typedef that is declared in the current function,
11578 record it for the purpose of -Wunused-local-typedefs. */
11580 void
11582 {
11587 /* if this is not a locally defined typedef then we are not
11588 interested. */
11595 }
11597 /* If T is a TYPE_DECL declared locally, mark it as used. */
11599 void
11601 {
11606 }
11608 /* Warn if there are some unused locally defined typedefs in the
11609 current function. */
11611 void
11613 {
11615 tree decl;
11616 /* The number of times we have emitted -Wunused-local-typedefs
11617 warnings. If this is different from errorcount, that means some
11618 unrelated errors have been issued. In which case, we'll avoid
11619 emitting "unused-local-typedefs" warnings. */
11631 {
11635 OPT_Wunused_local_typedefs,
11638 }
11641 }
11643 /* Warn about boolean expression compared with an integer value different
11644 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11645 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11646 are the operands of the comparison. The caller must ensure that
11647 either operand is a boolean expression. */
11649 void
11651 tree op1)
11652 {
11662 {
11670 else
11673 }
11674 }
11676 /* The C and C++ parsers both use vectors to hold function arguments.
11677 For efficiency, we keep a cache of unused vectors. This is the
11678 cache. */
11683 /* Return a new vector from the cache. If the cache is empty,
11684 allocate a new vector. These vectors are GC'ed, so it is OK if the
11685 pointer is not released.. */
11689 {
11692 else
11693 {
11694 /* Passing 0 to vec::alloc returns NULL, and our callers require
11695 that we always return a non-NULL value. The vector code uses
11696 4 when growing a NULL vector, so we do too. */
11700 }
11701 }
11703 /* Release a vector of trees back to the cache. */
11705 void
11707 {
11709 {
11712 }
11713 }
11715 /* Get a new tree vector holding a single tree. */
11719 {
11723 }
11725 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11729 {
11734 }
11736 /* Get a new tree vector which is a copy of an existing one. */
11740 {
11743 tree t;
11750 }
11752 /* Return true if KEYWORD starts a type specifier. */
11754 bool
11756 {
11758 {
11789 }
11790 }
11792 /* Return true if KEYWORD names a type qualifier. */
11794 bool
11796 {
11798 {
11806 }
11807 }
11809 /* Return true if KEYWORD names a storage class specifier.
11811 RID_TYPEDEF is not included in this list despite `typedef' being
11812 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11813 such for syntactic convenience only. */
11815 bool
11817 {
11819 {
11829 }
11830 }
11832 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11834 static bool
11836 {
11838 {
11846 }
11847 }
11849 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11850 declaration-specifier (C99 6.7). */
11852 bool
11854 {
11861 {
11868 }
11869 }
11871 /* Initialize language-specific-bits of tree_contains_struct. */
11873 void
11875 {
11879 }
11881 /* Build a user-defined numeric literal out of an integer constant type VALUE
11882 with identifier SUFFIX. */
11884 tree
11887 {
11894 }
11896 /* For vector[index], convert the vector to a
11897 pointer of the underlying type. */
11898 void
11901 {
11903 {
11905 tree type1;
11918 {
11919 /* If the original vector isn't declared may_alias and it
11920 isn't a bare vector look if the subscripting would
11921 alias the vector we subscript, and if not, force ref-all. */
11927 }
11931 }
11932 }
11934 /* Determine which of the operands, if any, is a scalar that needs to be
11935 converted to a vector, for the range of operations. */
11936 enum stv_conv
11939 {
11948 {
11949 /* Most GENERIC binary expressions require homogeneous arguments.
11950 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11951 argument that is a vector and a second one that is a scalar, so
11952 we never return stv_secondarg for them. */
11957 {
11959 {
11964 }
11965 else
11967 }
11974 /* ... fall through ... */
11995 /* What about UNLT_EXPR? */
11997 {
11998 tree tmp;
12000 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12003 }
12007 {
12009 {
12014 }
12016 }
12018 /* Allow integer --> real conversion if safe. */
12022 {
12024 {
12029 }
12031 }
12034 }
12037 }
12039 /* Return true iff ALIGN is an integral constant that is a fundamental
12040 alignment, as defined by [basic.align] in the c++-11
12041 specifications.
12043 That is:
12045 [A fundamental alignment is represented by an alignment less than or
12046 equal to the greatest alignment supported by the implementation
12047 in all contexts, which is equal to
12048 alignof(max_align_t)]. */
12050 bool
12052 {
12055 }
12057 /* Return true if T is a pointer to a zero-sized aggregate. */
12059 bool
12061 {
12066 }