| blob | c6f3464eec2d4e1f54936366241a7b9f4eb08a10 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
55 /* The following symbols are subsumed in the c_global_trees array, and
56 listed here individually for documentation purposes.
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
63 tree int128_integer_type_node;
65 tree short_unsigned_type_node;
66 tree long_unsigned_type_node;
67 tree long_long_unsigned_type_node;
68 tree int128_unsigned_type_node;
70 tree truthvalue_type_node;
71 tree truthvalue_false_node;
72 tree truthvalue_true_node;
74 tree ptrdiff_type_node;
76 tree unsigned_char_type_node;
77 tree signed_char_type_node;
78 tree wchar_type_node;
80 tree char16_type_node;
81 tree char32_type_node;
83 tree float_type_node;
84 tree double_type_node;
85 tree long_double_type_node;
87 tree complex_integer_type_node;
88 tree complex_float_type_node;
89 tree complex_double_type_node;
90 tree complex_long_double_type_node;
92 tree dfloat32_type_node;
93 tree dfloat64_type_node;
94 tree_dfloat128_type_node;
96 tree intQI_type_node;
97 tree intHI_type_node;
98 tree intSI_type_node;
99 tree intDI_type_node;
100 tree intTI_type_node;
102 tree unsigned_intQI_type_node;
103 tree unsigned_intHI_type_node;
104 tree unsigned_intSI_type_node;
105 tree unsigned_intDI_type_node;
106 tree unsigned_intTI_type_node;
108 tree widest_integer_literal_type_node;
109 tree widest_unsigned_literal_type_node;
111 Nodes for types `void *' and `const void *'.
113 tree ptr_type_node, const_ptr_type_node;
115 Nodes for types `char *' and `const char *'.
117 tree string_type_node, const_string_type_node;
119 Type `char[SOMENUMBER]'.
120 Used when an array of char is needed and the size is irrelevant.
122 tree char_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
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. */
234 /* UPC language option variables. */
236 /* Nonzero whenever UPC -fupc-threads-N is asserted.
237 The value N gives the number of UPC threads to be
238 defined at compile-time. */
241 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
244 /* The implementation model for UPC threads that
245 are mapped to POSIX threads, specified at compilation
246 time by the -fupc-pthreads-model-* switch. */
247 upc_pthreads_model_kind upc_pthreads_model;
249 /* C++ language option variables. */
252 /* Nonzero means generate separate instantiation control files and
253 juggle them at link time. */
257 /* The C++ dialect being used. C++98 is the default. */
261 /* Maximum template instantiation depth. This limit exists to limit the
262 time it takes to notice excessively recursive template instantiations.
264 The default is lower than the 1024 recommended by the C++0x standard
265 because G++ runs out of stack before 1024 with highly recursive template
266 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
270 /* The elements of `ridpointers' are identifier nodes for the reserved
271 type names and storage classes. It is indexed by a RID_... value. */
276 /* Nonzero means don't warn about problems that occur when the code is
277 executed. */
280 /* Whether we are building a boolean conversion inside
281 convert_for_assignment, or some other late binary operation. If
282 build_binary_op is called for C (from code shared by C and C++) in
283 this case, then the operands have already been folded and the
284 result will not be folded again, so C_MAYBE_CONST_EXPR should not
285 be generated. */
288 /* Whether lexing has been completed, so subsequent preprocessor
289 errors should use the compiler's input_location. */
292 /* Information about how a function name is generated. */
293 struct fname_var_t
294 {
298 };
300 /* The three ways of getting then name of the current function. */
303 {
304 /* C99 compliant __func__, must be first. */
306 /* GCC __FUNCTION__ compliant. */
308 /* GCC __PRETTY_FUNCTION__ compliant. */
311 };
313 /* Global visibility options. */
402 /* Reserved words. The third field is a mask: keywords are disabled
403 if they match the mask.
405 Masks for languages:
406 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
407 C --std=c99: D_CXXONLY | D_OBJC
408 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
409 UPC is like C except that D_UPC is not set
410 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
411 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
412 ObjC++ is like C++ except that D_OBJC is not set
414 If -fno-asm is used, D_ASM is added to the mask. If
415 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
416 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
417 In C with -Wc++-compat, we warn if D_CXXWARN is set.
419 Note the complication of the D_CXX_OBJC keywords. These are
420 reserved words such as 'class'. In C++, 'class' is a reserved
421 word. In Objective-C++ it is too. In Objective-C, it is a
422 reserved word too, but only if it follows an '@' sign.
423 */
425 {
586 /* These Objective-C keywords are recognized only immediately after
587 an '@'. */
604 /* These are recognized only in protocol-qualifier context
605 (see above) */
613 /* UPC keywords */
625 /* These are recognized inside a property attribute list */
634 };
639 /* Table of machine-independent attributes common to all C-like languages. */
641 {
642 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
643 affects_type_identity } */
650 /* FIXME: logically, noreturn attributes should be listed as
651 "false, true, true" and apply to function types. But implementing this
652 would require all the places in the compiler that use TREE_THIS_VOLATILE
653 on a decl to identify non-returning functions to be located and fixed
654 to check the function type instead. */
679 /* The same comments as for noreturn attributes apply to const ones. */
703 handle_no_instrument_function_attribute,
721 /* ??? These two attributes didn't make the transition from the
722 Intel language document to the multi-vendor language document. */
727 /* For internal use (marking of builtins) only. The name contains space
728 to prevent its usage in source code. */
750 /* For internal use (marking of builtins) only. The name contains space
751 to prevent its usage in source code. */
762 handle_no_address_safety_analysis_attribute,
765 handle_no_sanitize_address_attribute,
768 handle_no_sanitize_undefined_attribute,
778 /* For internal use only. The leading '*' both prevents its usage in
779 source code and signals that it may be overridden by machine tables. */
784 /* For internal use (marking of builtins and runtime functions) only.
785 The name contains space to prevent its usage in source code. */
799 };
801 /* Give the specifications for the format attributes, used by C and all
802 descendants. */
805 {
806 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
807 affects_type_identity } */
813 };
815 /* Return identifier for address space AS. */
819 {
823 }
825 /* Push current bindings for the function name VAR_DECLS. */
827 void
829 {
834 {
838 {
840 saved);
842 }
843 }
845 /* Normally they'll have been NULL, so only push if we've got a
846 stack, or they are non-NULL. */
848 saved_function_name_decls);
849 }
851 /* Finish up the current bindings, adding them into the current function's
852 statement tree. This must be done _before_ finish_stmt_tree is called.
853 If there is no current function, we must be at file scope and no statements
854 are involved. Pop the previous bindings. */
856 void
858 {
867 {
875 }
881 {
882 /* We had saved values, restore them. */
883 tree saved;
886 {
891 }
893 }
895 }
897 /* Return the text name of the current function, suitably prettified
898 by PRETTY_P. Return string must be freed by caller. */
902 {
909 {
912 }
925 {
928 }
931 }
933 /* Return the VAR_DECL for a const char array naming the current
934 function. If the VAR_DECL has not yet been created, create it
935 now. RID indicates how it should be formatted and IDENTIFIER_NODE
936 ID is its name (unfortunately C and C++ hold the RID values of
937 keywords in different places, so we can't derive RID from ID in
938 this language independent code. LOC is the location of the
939 function. */
941 tree
943 {
953 {
954 /* If a tree is built here, it would normally have the lineno of
955 the current statement. Later this tree will be moved to the
956 beginning of the function and this line number will be wrong.
957 To avoid this problem set the lineno to 0 here; that prevents
958 it from appearing in the RTL. */
959 tree stmts;
967 saved_function_name_decls
971 }
976 }
978 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
980 tree
982 {
987 /* Compute the number of elements, for the array type. */
989 {
992 }
994 {
997 }
999 {
1002 }
1003 else
1004 {
1007 }
1009 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1010 limit in C++98 Annex B is very large (65536) and is not normative,
1011 so we do not diagnose it (warn_overlength_strings is forced off
1012 in c_common_post_options). */
1014 {
1018 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1019 separate the %d from the 'C'. 'ISO' should not be
1020 translated, but it may be moved after 'C%d' in languages
1021 where modifiers follow nouns. */
1023 "string length %qd is greater than the length %qd "
1026 }
1028 /* Create the array type for the string constant. The ISO C++
1029 standard says that a string literal has type `const char[N]' or
1030 `const wchar_t[N]'. We use the same logic when invoked as a C
1031 front-end with -Wwrite-strings.
1032 ??? We should change the type of an expression depending on the
1033 state of a warning flag. We should just be warning -- see how
1034 this is handled in the C++ front-end for the deprecated implicit
1035 conversion from string literals to `char*' or `wchar_t*'.
1037 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1038 array type being the unqualified version of that type.
1039 Therefore, if we are constructing an array of const char, we must
1040 construct the matching unqualified array type first. The C front
1041 end does not require this, but it does no harm, so we do it
1042 unconditionally. */
1053 }
1054 \f
1055 /* If DISABLE is true, stop issuing warnings. This is used when
1056 parsing code that we know will not be executed. This function may
1057 be called multiple times, and works as a stack. */
1059 static void
1061 {
1063 {
1066 }
1067 }
1069 /* If ENABLE is true, reenable issuing warnings. */
1071 static void
1073 {
1075 {
1078 }
1079 }
1081 /* Fully fold EXPR, an expression that was not folded (beyond integer
1082 constant expressions and null pointer constants) when being built
1083 up. If IN_INIT, this is in a static initializer and certain
1084 changes are made to the folding done. Clear *MAYBE_CONST if
1085 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1086 expression because it contains an evaluated operator (in C99) or an
1087 operator outside of sizeof returning an integer constant (in C90)
1088 not permitted in constant expressions, or because it contains an
1089 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1090 set to true by callers before calling this function.) Return the
1091 folded expression. Function arguments have already been folded
1092 before calling this function, as have the contents of SAVE_EXPR,
1093 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1094 C_MAYBE_CONST_EXPR. */
1096 tree
1098 {
1099 tree ret;
1105 /* This function is not relevant to C++ because C++ folds while
1106 parsing, and may need changes to be correct for C++ when C++
1107 stops folding while parsing. */
1114 {
1117 }
1124 }
1126 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1127 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1128 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1129 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1130 both evaluated and unevaluated subexpressions while
1131 *MAYBE_CONST_ITSELF is carried from only evaluated
1132 subexpressions). */
1134 static tree
1137 {
1149 /* This function is not relevant to C++ because C++ folds while
1150 parsing, and may need changes to be correct for C++ when C++
1151 stops folding while parsing. */
1155 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1156 anything else not counted as an expression cannot usefully be
1157 folded further at this point. */
1163 /* Operands of variable-length expressions (function calls) have
1164 already been folded, as have __builtin_* function calls, and such
1165 expressions cannot occur in constant expressions. */
1167 {
1171 }
1174 {
1183 else
1186 }
1188 /* Assignment, increment, decrement, function call and comma
1189 operators, and statement expressions, cannot occur in constant
1190 expressions if evaluated / outside of sizeof. (Function calls
1191 were handled above, though VA_ARG_EXPR is treated like a function
1192 call here, and statement expressions are handled through
1193 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1195 {
1215 }
1217 /* Fold individual tree codes as appropriate. */
1219 {
1221 /* Any non-constancy will have been marked in a containing
1222 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1230 maybe_const_itself);
1235 {
1238 }
1247 maybe_const_itself);
1250 maybe_const_itself);
1256 {
1260 }
1302 /* Binary operations evaluating both arguments (increment and
1303 decrement are binary internally in GCC). */
1307 maybe_const_itself);
1315 /* The RHS of a MODIFY_EXPR was fully folded when building that
1316 expression for the sake of conversion warnings. */
1319 maybe_const_itself);
1323 ret = in_init
1326 else
1339 {
1350 }
1356 CASE_CONVERT:
1367 /* Unary operations. */
1370 maybe_const_itself);
1374 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1375 not prepared to deal with them if they occur in initializers.
1376 Avoid attempts to fold references to UPC shared components
1377 due to the complexities of UPC pointer-to-shared arithmetic. */
1386 ret = in_init
1389 else
1394 {
1398 }
1400 {
1403 CASE_CONVERT:
1404 /* Don't warn about explicit conversions. We will already
1405 have warned about suspect implicit conversions. */
1412 }
1417 /* Binary operations not necessarily evaluating both
1418 arguments. */
1425 ? truthvalue_false_node
1433 ret = in_init
1436 else
1441 && op0_const
1442 && op0_const_self
1448 && op0_const_self
1474 else
1479 && op0_const
1480 && op0_const_self
1484 && op0_const_self
1488 && op0_const
1489 && op0_const_self
1493 && op0_const_self
1499 /* Each case where an operand with excess precision may be
1500 encountered must remove the EXCESS_PRECISION_EXPR around
1501 inner operands and possibly put one around the whole
1502 expression or possibly convert to the semantic type (which
1503 c_fully_fold does); we cannot tell at this stage which is
1504 appropriate in any particular case. */
1508 /* Various codes may appear through folding built-in functions
1509 and their arguments. */
1511 }
1513 out:
1514 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1515 have been done by this point, so remove them again. */
1519 {
1523 }
1527 }
1529 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1530 return EXP. Otherwise, return either EXP or its known constant
1531 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1532 Is the BLKmode test appropriate? */
1534 tree
1536 {
1537 tree ret;
1539 /* This function is only used by C, for c_fully_fold and other
1540 optimization, and may not be correct for C++. */
1551 /* Avoid unwanted tree sharing between the initializer and current
1552 function's body where the tree can be modified e.g. by the
1553 gimplifier. */
1557 }
1559 /* Print a warning if a constant expression had overflow in folding.
1560 Invoke this function on every expression that the language
1561 requires to be a constant expression.
1562 Note the ANSI C standard says it is erroneous for a
1563 constant expression to overflow. */
1565 void
1567 {
1575 }
1577 /* The same as above but print an unconditional error. */
1578 void
1580 {
1587 }
1589 /* Print a warning if an expression had overflow in folding and its
1590 operands hadn't.
1592 Invoke this function on every expression that
1593 (1) appears in the source code, and
1594 (2) is a constant expression that overflowed, and
1595 (3) is not already checked by convert_and_check;
1596 however, do not invoke this function on operands of explicit casts
1597 or when the expression is the result of an operator and any operand
1598 already overflowed. */
1600 void
1602 {
1607 {
1636 }
1637 }
1639 /* Warn about uses of logical || / && operator in a context where it
1640 is likely that the bitwise equivalent was intended by the
1641 programmer. We have seen an expression in which CODE is a binary
1642 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1643 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1644 void
1648 {
1660 /* Warn if &&/|| are being used in a context where it is
1661 likely that the bitwise equivalent was intended by the
1662 programmer. That is, an expression such as op && MASK
1663 where op should not be any boolean expression, nor a
1664 constant, and mask seems to be a non-boolean integer constant. */
1672 {
1676 else
1681 }
1683 /* We do not warn for constants because they are typical of macro
1684 expansions that test for features. */
1688 /* This warning only makes sense with logical operands. */
1696 /* We first test whether either side separately is trivially true
1697 (with OR) or trivially false (with AND). If so, do not warn.
1698 This is a common idiom for testing ranges of data types in
1699 portable code. */
1706 /* If this is an OR operation, invert both sides; now, the result
1707 should be always false to get a warning. */
1721 /* If this is an OR operation, invert both sides; now, the result
1722 should be always false to get a warning. */
1730 /* If both expressions have the same operand, if we can merge the
1731 ranges, and if the range test is always false, then warn. */
1738 {
1741 "logical %<or%> "
1743 else
1745 "logical %<and%> "
1747 }
1748 }
1751 /* Warn if EXP contains any computations whose results are not used.
1752 Return true if a warning is printed; false otherwise. LOCUS is the
1753 (potential) location of the expression. */
1755 bool
1757 {
1758 restart:
1762 /* Don't warn about void constructs. This includes casting to void,
1763 void function calls, and statement expressions with a final cast
1764 to void. */
1772 {
1788 /* For a binding, warn if no side effect within it. */
1800 /* In && or ||, warn if 2nd operand has no side effect. */
1807 /* Let people do `(foo (), 0)' without a warning. */
1814 /* If this is an expression with side effects, don't warn; this
1815 case commonly appears in macro expansions. */
1821 /* Don't warn about automatic dereferencing of references, since
1822 the user cannot control it. */
1824 {
1827 }
1828 /* Fall through. */
1831 /* Referencing a volatile value is a side effect, so don't warn. */
1836 /* If this is an expression which has no operands, there is no value
1837 to be unused. There are no such language-independent codes,
1838 but front ends may define such. */
1842 warn:
1844 }
1845 }
1848 /* Print a warning about casts that might indicate violation
1849 of strict aliasing rules if -Wstrict-aliasing is used and
1850 strict aliasing mode is in effect. OTYPE is the original
1851 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1853 bool
1855 {
1856 /* Strip pointer conversion chains and get to the correct original type. */
1864 /* If the type we are casting to is a ref-all pointer
1865 dereferencing it is always valid. */
1872 {
1873 /* Casting the address of an object to non void pointer. Warn
1874 if the cast breaks type based aliasing. */
1876 {
1880 }
1881 else
1882 {
1883 /* warn_strict_aliasing >= 3. This includes the default (3).
1884 Only warn if the cast is dereferenced immediately. */
1885 alias_set_type set1 =
1891 {
1895 }
1898 {
1902 }
1903 }
1904 }
1905 else
1907 {
1908 /* At this level, warn for any conversions, even if an address is
1909 not taken in the same statement. This will likely produce many
1910 false positives, but could be useful to pinpoint problems that
1911 are not revealed at higher levels. */
1916 {
1920 }
1921 }
1924 }
1926 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1927 sizeof as last operand of certain builtins. */
1929 void
1933 {
1937 location_t loc;
1945 {
1949 /* FALLTHRU */
1957 /* FALLTHRU */
2016 }
2044 {
2048 {
2051 "argument to %<sizeof%> in %qD call is the same "
2052 "expression as the destination; did you mean to "
2058 "argument to %<sizeof%> in %qD call is the same "
2059 "expression as the destination; did you mean to "
2061 else
2063 "argument to %<sizeof%> in %qD call is the same "
2064 "expression as the destination; did you mean to "
2067 }
2070 && !strop
2073 {
2075 "argument to %<sizeof%> in %qD call is the same "
2076 "pointer type %qT as the destination; expected %qT "
2080 }
2081 }
2084 {
2088 {
2091 "argument to %<sizeof%> in %qD call is the same "
2092 "expression as the source; did you mean to "
2098 "argument to %<sizeof%> in %qD call is the same "
2099 "expression as the source; did you mean to "
2101 else
2103 "argument to %<sizeof%> in %qD call is the same "
2104 "expression as the source; did you mean to "
2107 }
2110 && !strop
2113 {
2115 "argument to %<sizeof%> in %qD call is the same "
2116 "pointer type %qT as the source; expected %qT "
2120 }
2121 }
2124 {
2128 {
2131 "argument to %<sizeof%> in %qD call is the same "
2132 "expression as the first source; did you mean to "
2138 "argument to %<sizeof%> in %qD call is the same "
2139 "expression as the first source; did you mean to "
2141 else
2143 "argument to %<sizeof%> in %qD call is the same "
2144 "expression as the first source; did you mean to "
2147 }
2150 && !strop
2153 {
2155 "argument to %<sizeof%> in %qD call is the same "
2156 "pointer type %qT as the first source; expected %qT "
2160 }
2161 }
2164 {
2168 {
2171 "argument to %<sizeof%> in %qD call is the same "
2172 "expression as the second source; did you mean to "
2178 "argument to %<sizeof%> in %qD call is the same "
2179 "expression as the second source; did you mean to "
2181 else
2183 "argument to %<sizeof%> in %qD call is the same "
2184 "expression as the second source; did you mean to "
2187 }
2190 && !strop
2193 {
2195 "argument to %<sizeof%> in %qD call is the same "
2196 "pointer type %qT as the second source; expected %qT "
2200 }
2201 }
2203 }
2205 /* Warn for unlikely, improbable, or stupid DECL declarations
2206 of `main'. */
2208 void
2210 {
2211 function_args_iterator iter;
2212 tree type;
2216 {
2217 /* XXX void_type_node belies the abstraction. */
2223 {
2245 "third argument of %q+D should probably be "
2248 }
2249 }
2251 /* It is intentional that this message does not mention the third
2252 argument because it's only mentioned in an appendix of the
2253 standard. */
2257 }
2259 /* vector_targets_convertible_p is used for vector pointer types. The
2260 callers perform various checks that the qualifiers are satisfactory,
2261 while OTOH vector_targets_convertible_p ignores the number of elements
2262 in the vectors. That's fine with vector pointers as we can consider,
2263 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2264 and that does not require and conversion of the pointer values.
2265 In contrast, vector_types_convertible_p and
2266 vector_types_compatible_elements_p are used for vector value types. */
2267 /* True if pointers to distinct types T1 and T2 can be converted to
2268 each other without an explicit cast. Only returns true for opaque
2269 vector types. */
2270 bool
2272 {
2279 }
2281 /* vector_types_convertible_p is used for vector value types.
2282 It could in principle call vector_targets_convertible_p as a subroutine,
2283 but then the check for vector type would be duplicated with its callers,
2284 and also the purpose of vector_targets_convertible_p would become
2285 muddled.
2286 Where vector_types_convertible_p returns true, a conversion might still be
2287 needed to make the types match.
2288 In contrast, vector_targets_convertible_p is used for vector pointer
2289 values, and vector_types_compatible_elements_p is used specifically
2290 in the context for binary operators, as a check if use is possible without
2291 conversion. */
2292 /* True if vector types T1 and T2 can be converted to each other
2293 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2294 can only be converted with -flax-vector-conversions yet that is not
2295 in effect, emit a note telling the user about that option if such
2296 a note has not previously been emitted. */
2297 bool
2299 {
2307 convertible_lax =
2322 {
2325 "conversions between vectors with differing "
2327 }
2330 }
2332 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2333 and have vector types, V0 has the same type as V1, and the number of
2334 elements of V0, V1, MASK is the same.
2336 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2337 called with two arguments. In this case implementation passes the
2338 first argument twice in order to share the same tree code. This fact
2339 could enable the mask-values being twice the vector length. This is
2340 an implementation accident and this semantics is not guaranteed to
2341 the user. */
2342 tree
2345 {
2346 tree ret;
2352 {
2355 }
2363 {
2368 }
2372 {
2376 }
2379 {
2384 }
2390 {
2393 "argument vector(s) and the mask vector should "
2396 }
2400 {
2405 }
2408 {
2409 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2415 else
2416 {
2419 }
2423 }
2433 }
2435 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2436 to integral type. */
2438 static tree
2440 {
2445 {
2446 /* C++0x scoped enumerations don't implicitly convert to integral
2447 type; if we stripped an explicit conversion to a larger type we
2448 need to replace it so common_type will still work. */
2452 }
2454 }
2456 /* This is a helper function of build_binary_op.
2458 For certain operations if both args were extended from the same
2459 smaller type, do the arithmetic in that type and then extend.
2461 BITWISE indicates a bitwise operation.
2462 For them, this optimization is safe only if
2463 both args are zero-extended or both are sign-extended.
2464 Otherwise, we might change the result.
2465 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2466 but calculated in (unsigned short) it would be (unsigned short)-1.
2467 */
2468 tree
2470 {
2474 tree type;
2476 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2477 excessive narrowing when we call get_narrower below. For
2478 example, suppose that OP0 is of unsigned int extended
2479 from signed char and that RESULT_TYPE is long long int.
2480 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2481 like
2483 (long long int) (unsigned int) signed_char
2485 which get_narrower would narrow down to
2487 (unsigned int) signed char
2489 If we do not cast OP0 first, get_narrower would return
2490 signed_char, which is inconsistent with the case of the
2491 explicit cast. */
2498 /* UNS is 1 if the operation to be done is an unsigned one. */
2501 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2502 but it *requires* conversion to FINAL_TYPE. */
2513 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2515 /* For bitwise operations, signedness of nominal type
2516 does not matter. Consider only how operands were extended. */
2520 /* Note that in all three cases below we refrain from optimizing
2521 an unsigned operation on sign-extended args.
2522 That would not be valid. */
2524 /* Both args variable: if both extended in same way
2525 from same width, do it in that width.
2526 Do it unsigned if args were zero-extended. */
2533 return c_common_signed_or_unsigned_type
2540 && (type
2551 && (type
2559 }
2561 /* Checks if expression EXPR of real/integer type cannot be converted
2562 to the real/integer type TYPE. Function returns non-zero when:
2563 * EXPR is a constant which cannot be exactly converted to TYPE
2564 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2565 for EXPR type and TYPE being both integers or both real.
2566 * EXPR is not a constant of real type and TYPE is an integer.
2567 * EXPR is not a constant of integer type which cannot be
2568 exactly converted to real type.
2569 Function allows conversions between types of different signedness and
2570 can return SAFE_CONVERSION (zero) in that case. Function can produce
2571 signedness warnings if PRODUCE_WARNS is true. */
2572 enum conversion_safety
2574 {
2580 {
2581 /* Warn for real constant that is not an exact integer converted
2582 to integer type. */
2585 {
2588 }
2589 /* Warn for an integer constant that does not fit into integer type. */
2593 {
2596 {
2600 }
2602 {
2606 }
2607 else
2609 }
2611 {
2612 /* Warn for an integer constant that does not fit into real type. */
2614 {
2618 }
2619 /* Warn for a real constant that does not fit into a smaller
2620 real type. */
2623 {
2627 }
2628 }
2629 }
2630 else
2631 {
2632 /* Warn for real types converted to integer types. */
2639 {
2640 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2644 /* Don't warn for short y; short x = ((int)y & 0xff); */
2648 {
2649 /* If both args were extended from a shortest type,
2650 use that type if that is safe. */
2657 {
2663 /* If one of the operands is a non-negative constant
2664 that fits in the target type, then the type of the
2665 other operand does not matter. */
2674 /* If constant is unsigned and fits in the target
2675 type, then the result will also fit. */
2677 && unsigned0
2680 && unsigned1
2683 }
2684 }
2685 /* Warn for integer types converted to smaller integer types. */
2689 /* When they are the same width but different signedness,
2690 then the value may change. */
2693 /* Even when converted to a bigger type, if the type is
2694 unsigned but expr is signed, then negative values
2695 will be changed. */
2701 }
2703 /* Warn for integer types converted to real types if and only if
2704 all the range of values of the integer type cannot be
2705 represented by the real type. */
2708 {
2712 /* Don't warn about char y = 0xff; float x = (int) y; */
2724 }
2726 /* Warn for real types converted to smaller real types. */
2731 }
2734 }
2736 /* Warns if the conversion of EXPR to TYPE may alter a value.
2737 This is a helper function for warnings_for_convert_and_check. */
2739 static void
2741 {
2750 {
2763 /* Conversion from boolean to a signed:1 bit-field (which only
2764 can hold the values 0 and -1) doesn't lose information - but
2765 it does change the value. */
2785 {
2786 /* In case of COND_EXPR, we do not care about the type of
2787 COND_EXPR, only about the conversion of each operand. */
2794 }
2806 }
2807 }
2809 /* Produce warnings after a conversion. RESULT is the result of
2810 converting EXPR to TYPE. This is a helper function for
2811 convert_and_check and cp_convert_and_check. */
2813 void
2815 {
2822 {
2823 /* Do not diagnose overflow in a constant expression merely
2824 because a conversion overflowed. */
2829 {
2830 /* This detects cases like converting -129 or 256 to
2831 unsigned char. */
2835 else
2837 }
2841 /* No warning for converting 0x80000000 to int. */
2849 else
2851 }
2856 else
2858 }
2861 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2862 Invoke this function on every expression that is converted implicitly,
2863 i.e. because of language rules and not because of an explicit cast. */
2865 tree
2867 {
2868 tree result;
2869 tree expr_for_warning;
2871 /* Convert from a value with possible excess precision rather than
2872 via the semantic type, but do not warn about values not fitting
2873 exactly in the semantic type. */
2875 {
2881 }
2882 else
2896 }
2897 \f
2898 /* A node in a list that describes references to variables (EXPR), which are
2899 either read accesses if WRITER is zero, or write accesses, in which case
2900 WRITER is the parent of EXPR. */
2901 struct tlist
2902 {
2905 };
2907 /* Used to implement a cache the results of a call to verify_tree. We only
2908 use this for SAVE_EXPRs. */
2909 struct tlist_cache
2910 {
2914 tree expr;
2915 };
2917 /* Obstack to use when allocating tlist structures, and corresponding
2918 firstobj. */
2922 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2923 warnings. */
2925 /* SAVE_EXPRs need special treatment. We process them only once and then
2926 cache the results. */
2938 /* Create a new struct tlist and fill in its fields. */
2941 {
2948 }
2950 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2951 is nonnull, we ignore any node we find which has a writer equal to it. */
2953 static void
2955 {
2957 {
2964 }
2965 }
2967 /* Merge the nodes of ADD into TO. This merging process is done so that for
2968 each variable that already exists in TO, no new node is added; however if
2969 there is a write access recorded in ADD, and an occurrence on TO is only
2970 a read access, then the occurrence in TO will be modified to record the
2971 write. */
2973 static void
2975 {
2982 {
2989 {
2993 }
2995 {
2999 }
3001 }
3002 }
3004 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3005 references in list LIST conflict with it, excluding reads if ONLY writers
3006 is nonzero. */
3008 static void
3011 {
3014 /* Avoid duplicate warnings. */
3020 {
3024 {
3029 }
3031 }
3032 }
3034 /* Given a list LIST of references to variables, find whether any of these
3035 can cause conflicts due to missing sequence points. */
3037 static void
3039 {
3043 {
3046 }
3047 }
3049 /* Return nonzero if X is a tree that can be verified by the sequence point
3050 warnings. */
3051 static int
3053 {
3060 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3061 (lvalue_p) crash on TRY/CATCH. */
3068 /* No point to track non-const calls, they will never satisfy
3069 operand_equal_p. */
3077 }
3079 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3080 static bool
3082 {
3084 }
3086 /* Walk the tree X, and record accesses to variables. If X is written by the
3087 parent tree, WRITER is the parent.
3088 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3089 expression or its only operand forces a sequence point, then everything up
3090 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3091 in PNO_SP.
3092 Once we return, we will have emitted warnings if any subexpression before
3093 such a sequence point could be undefined. On a higher level, however, the
3094 sequence point may not be relevant, and we'll merge the two lists.
3096 Example: (b++, a) + b;
3097 The call that processes the COMPOUND_EXPR will store the increment of B
3098 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3099 processes the PLUS_EXPR will need to merge the two lists so that
3100 eventually, all accesses end up on the same list (and we'll warn about the
3101 unordered subexpressions b++ and b.
3103 A note on merging. If we modify the former example so that our expression
3104 becomes
3105 (b++, b) + a
3106 care must be taken not simply to add all three expressions into the final
3107 PNO_SP list. The function merge_tlist takes care of that by merging the
3108 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3109 way, so that no more than one access to B is recorded. */
3111 static void
3113 tree writer)
3114 {
3119 /* X may be NULL if it is the operand of an empty statement expression
3120 ({ }). */
3124 restart:
3132 {
3165 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3166 two first, to avoid warning for (a ? b++ : b++). */
3182 /* Expressions inside the LHS are not ordered wrt. the sequence points
3183 in the RHS. Example:
3184 *a = (a++, 2)
3185 Despite the fact that the modification of "a" is in the before_sp
3186 list (tmp_before), it conflicts with the use of "a" in the LHS.
3187 We can handle this by adding the contents of tmp_list3
3188 to those of tmp_before, and redoing the collision warnings for that
3189 list. */
3192 /* Exclude the LHS itself here; we first have to merge it into the
3193 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3194 didn't exclude the LHS, we'd get it twice, once as a read and once
3195 as a write. */
3206 /* We need to warn about conflicts among arguments and conflicts between
3207 args and the function address. Side effects of the function address,
3208 however, are not ordered by the sequence point of the call. */
3209 {
3210 call_expr_arg_iterator iter;
3211 tree arg;
3215 {
3220 }
3225 }
3228 /* Scan all the list, e.g. indices of multi dimensional array. */
3230 {
3236 }
3240 {
3247 {
3259 {
3263 }
3266 }
3270 }
3280 /* For other expressions, simply recurse on their operands.
3281 Manual tail recursion for unary expressions.
3282 Other non-expressions need not be processed. */
3284 {
3288 }
3290 {
3294 {
3299 }
3300 }
3302 }
3303 }
3305 /* Try to warn for undefined behavior in EXPR due to missing sequence
3306 points. */
3308 DEBUG_FUNCTION void
3310 {
3316 {
3319 }
3324 }
3325 \f
3326 /* Validate the expression after `case' and apply default promotions. */
3328 static tree
3330 {
3335 /* Promote char or short to int. */
3338 {
3341 }
3346 }
3347 \f
3348 /* See if the case values LOW and HIGH are in the range of the original
3349 type (i.e. before the default conversion to int) of the switch testing
3350 expression.
3351 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3352 the type before promoting it. CASE_LOW_P is a pointer to the lower
3353 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3354 if the case is not a case range.
3355 The caller has to make sure that we are not called with NULL for
3356 CASE_LOW_P (i.e. the default case).
3357 Returns true if the case label is in range of ORIG_TYPE (saturated or
3358 untouched) or false if the label is out of range. */
3360 static bool
3363 {
3368 /* If there was a problem with the original type, do nothing. */
3375 /* Case label is less than minimum for type. */
3378 {
3381 }
3383 /* Case value is greater than maximum for type. */
3386 {
3389 }
3391 /* Saturate lower case label value to minimum. */
3394 {
3398 }
3400 /* Saturate upper case label value to maximum. */
3403 {
3407 }
3415 }
3416 \f
3417 /* Return an integer type with BITS bits of precision,
3418 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3420 tree
3422 {
3461 }
3463 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3464 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3465 and saturating if SATP is nonzero, otherwise not saturating. */
3467 tree
3470 {
3474 else
3482 {
3484 "fixed-point types that have too many integral and "
3487 }
3490 }
3492 /* Used for communication between c_common_type_for_mode and
3493 c_register_builtin_type. */
3496 /* Return a data type that has machine mode MODE.
3497 If the mode is an integer,
3498 then UNSIGNEDP selects between signed and unsigned types.
3499 If the mode is a fixed-point mode,
3500 then UNSIGNEDP selects between saturating and nonsaturating types. */
3502 tree
3504 {
3505 tree t;
3542 #if HOST_BITS_PER_WIDE_INT >= 64
3545 #endif
3570 {
3572 tree inner_type;
3588 }
3590 {
3595 }
3605 {
3691 }
3699 }
3701 tree
3703 {
3705 }
3707 /* Return a signed type the same as TYPE in other respects. */
3709 tree
3711 {
3713 }
3715 /* Return a type the same as TYPE except unsigned or
3716 signed according to UNSIGNEDP. */
3718 tree
3720 {
3721 tree type1;
3723 /* This block of code emulates the behavior of the old
3724 c_common_unsigned_type. In particular, it returns
3725 long_unsigned_type_node if passed a long, even when a int would
3726 have the same size. This is necessary for warnings to work
3727 correctly in archs where sizeof(int) == sizeof(long) */
3730 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3746 #if HOST_BITS_PER_WIDE_INT >= 64
3749 #endif
3759 #define C_COMMON_FIXED_TYPES(NAME) \
3760 if (type1 == short_ ## NAME ## _type_node \
3761 || type1 == unsigned_short_ ## NAME ## _type_node) \
3762 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3763 : short_ ## NAME ## _type_node; \
3764 if (type1 == NAME ## _type_node \
3765 || type1 == unsigned_ ## NAME ## _type_node) \
3766 return unsignedp ? unsigned_ ## NAME ## _type_node \
3767 : NAME ## _type_node; \
3768 if (type1 == long_ ## NAME ## _type_node \
3769 || type1 == unsigned_long_ ## NAME ## _type_node) \
3770 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3771 : long_ ## NAME ## _type_node; \
3772 if (type1 == long_long_ ## NAME ## _type_node \
3773 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3774 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3775 : long_long_ ## NAME ## _type_node;
3777 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3778 if (type1 == NAME ## _type_node \
3779 || type1 == u ## NAME ## _type_node) \
3780 return unsignedp ? u ## NAME ## _type_node \
3781 : NAME ## _type_node;
3783 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3784 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3785 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3786 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3787 : sat_ ## short_ ## NAME ## _type_node; \
3788 if (type1 == sat_ ## NAME ## _type_node \
3789 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3790 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3791 : sat_ ## NAME ## _type_node; \
3792 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3793 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3794 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3795 : sat_ ## long_ ## NAME ## _type_node; \
3796 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3797 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3798 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3799 : sat_ ## long_long_ ## NAME ## _type_node;
3801 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3802 if (type1 == sat_ ## NAME ## _type_node \
3803 || type1 == sat_ ## u ## NAME ## _type_node) \
3804 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3805 : sat_ ## NAME ## _type_node;
3831 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3832 the precision; they have precision set to match their range, but
3833 may use a wider mode to match an ABI. If we change modes, we may
3834 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3835 the precision as well, so as to yield correct results for
3836 bit-field types. C++ does not have these separate bit-field
3837 types, and producing a signed or unsigned variant of an
3838 ENUMERAL_TYPE may cause other problems as well. */
3844 #define TYPE_OK(node) \
3845 (TYPE_MODE (type) == TYPE_MODE (node) \
3846 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3865 #if HOST_BITS_PER_WIDE_INT >= 64
3868 #endif
3877 #undef TYPE_OK
3880 }
3882 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3884 tree
3886 {
3887 /* Extended integer types of the same width as a standard type have
3888 lesser rank, so those of the same width as int promote to int or
3889 unsigned int and are valid for printf formats expecting int or
3890 unsigned int. To avoid such special cases, avoid creating
3891 extended integer types for bit-fields if a standard integer type
3892 is available. */
3909 }
3911 /* The C version of the register_builtin_type langhook. */
3913 void
3915 {
3916 tree decl;
3926 }
3927 \f
3928 /* Print an error message for invalid operands to arith operation
3929 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3930 LOCATION is the location of the message. */
3932 void
3935 {
3939 {
3984 }
3988 }
3989 \f
3990 /* Given an expression as a tree, return its original type. Do this
3991 by stripping any conversion that preserves the sign and precision. */
3992 static tree
3994 {
3997 }
3999 /* Subroutine of build_binary_op, used for comparison operations.
4000 See if the operands have both been converted from subword integer types
4001 and, if so, perhaps change them both back to their original type.
4002 This function is also responsible for converting the two operands
4003 to the proper common type for comparison.
4005 The arguments of this function are all pointers to local variables
4006 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4007 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4009 If this function returns nonzero, it means that the comparison has
4010 a constant value. What this function returns is an expression for
4011 that value. */
4013 tree
4016 {
4017 tree type;
4026 /* Throw away any conversions to wider types
4027 already present in the operands. */
4032 /* If primopN is first sign-extended from primopN's precision to opN's
4033 precision, then zero-extended from opN's precision to
4034 *restype_ptr precision, shortenings might be invalid. */
4037 && !unsignedp0
4042 && !unsignedp1
4046 /* Handle the case that OP0 does not *contain* a conversion
4047 but it *requires* conversion to FINAL_TYPE. */
4054 /* If one of the operands must be floated, we cannot optimize. */
4058 /* If first arg is constant, swap the args (changing operation
4059 so value is preserved), for canonicalization. Don't do this if
4060 the second arg is 0. */
4065 {
4082 {
4097 }
4099 }
4101 /* If comparing an integer against a constant more bits wide,
4102 maybe we can deduce a value of 1 or 0 independent of the data.
4103 Or else truncate the constant now
4104 rather than extend the variable at run time.
4106 This is only interesting if the constant is the wider arg.
4107 Also, it is not safe if the constant is unsigned and the
4108 variable arg is signed, since in this case the variable
4109 would be sign-extended and then regarded as unsigned.
4110 Our technique fails in this case because the lowest/highest
4111 possible unsigned results don't follow naturally from the
4112 lowest/highest possible values of the variable operand.
4113 For just EQ_EXPR and NE_EXPR there is another technique that
4114 could be used: see if the constant can be faithfully represented
4115 in the other operand's type, by truncating it and reextending it
4116 and see if that preserves the constant's value. */
4122 {
4125 /* 1 if comparison is nominally unsigned. */
4127 tree val;
4139 {
4140 /* Convert primop1 to target type, but do not introduce
4141 additional overflow. We know primop1 is an int_cst. */
4145 }
4147 {
4150 }
4153 {
4158 }
4159 else
4160 {
4165 }
4168 /* This used to be a switch, but Genix compiler can't handle that. */
4170 {
4173 }
4175 {
4178 }
4180 {
4185 }
4187 {
4192 }
4194 {
4199 }
4201 {
4206 }
4208 /* If primop0 was sign-extended and unsigned comparison specd,
4209 we did a signed comparison above using the signed type bounds.
4210 But the comparison we output must be unsigned.
4212 Also, for inequalities, VAL is no good; but if the signed
4213 comparison had *any* fixed result, it follows that the
4214 unsigned comparison just tests the sign in reverse
4215 (positive values are LE, negative ones GE).
4216 So we can generate an unsigned comparison
4217 against an extreme value of the signed type. */
4220 {
4223 {
4238 }
4240 }
4244 {
4251 }
4254 {
4255 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4259 }
4261 /* Value is not predetermined, but do the comparison
4262 in the type of the operand that is not constant.
4263 TYPE is already properly set. */
4264 }
4266 /* If either arg is decimal float and the other is float, find the
4267 proper common type to use for comparison. */
4278 /* If args' natural types are both narrower than nominal type
4279 and both extend in the same manner, compare them
4280 in the type of the wider arg.
4281 Otherwise must actually extend both to the nominal
4282 common type lest different ways of extending
4283 alter the result.
4284 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4289 {
4293 type);
4294 /* Make sure shorter operand is extended the right way
4295 to match the longer operand. */
4296 primop0
4299 primop0);
4300 primop1
4303 primop1);
4304 }
4305 else
4306 {
4307 /* Here we must do the comparison on the nominal type
4308 using the args exactly as we received them. */
4315 {
4317 /* All unsigned values are >= 0, so we warn. However,
4318 if OP0 is a constant that is >= 0, the signedness of
4319 the comparison isn't an issue, so suppress the
4320 warning. */
4326 primop0)))
4327 /* Do not warn for enumeration types. */
4331 {
4348 }
4351 {
4352 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4357 }
4358 }
4359 }
4367 }
4368 \f
4369 /* Return a tree for the sum or difference (RESULTCODE says which)
4370 of pointer PTROP and integer INTOP. */
4372 tree
4375 {
4378 /* The result is a pointer of the same type that is being added. */
4381 /* If the pointer lives in UPC shared memory, then
4382 drop the 'shared' qualifier. */
4387 {
4394 }
4396 {
4403 }
4404 else
4407 /* We are manipulating pointer values, so we don't need to warn
4408 about relying on undefined signed overflow. We disable the
4409 warning here because we use integer types so fold won't know that
4410 they are really pointers. */
4413 /* If what we are about to multiply by the size of the elements
4414 contains a constant term, apply distributive law
4415 and multiply that constant term separately.
4416 This helps produce common subexpressions. */
4421 /* If the constant comes from pointer subtraction,
4422 skip this optimization--it would cause an error. */
4424 /* If the constant is unsigned, and smaller than the pointer size,
4425 then we must skip this optimization. This is because it could cause
4426 an overflow error if the constant is negative but INTOP is not. */
4430 {
4435 /* Convert both subexpression types to the type of intop,
4436 because weird cases involving pointer arithmetic
4437 can result in a sum or difference with different type args. */
4442 }
4444 /* Convert the integer argument to a type the same size as sizetype
4445 so the multiply won't overflow spuriously. */
4451 /* Replace the integer argument with a suitable product by the object size.
4452 Do this multiplication as signed, then convert to the appropriate type
4453 for the pointer operation and disregard an overflow that occurred only
4454 because of the sign-extension change in the latter conversion. */
4455 {
4463 }
4465 /* Create the sum or difference. */
4474 }
4475 \f
4476 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4477 and if NON_CONST is known not to be permitted in an evaluated part
4478 of a constant expression. */
4480 tree
4482 {
4486 /* This should never be called for C++. */
4490 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4499 }
4501 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4502 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4503 around the SAVE_EXPR if needed so that c_fully_fold does not need
4504 to look inside SAVE_EXPRs. */
4506 tree
4508 {
4517 }
4519 /* Return whether EXPR is a declaration whose address can never be
4520 NULL. */
4522 bool
4524 {
4529 }
4531 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4532 or for an `if' or `while' statement or ?..: exp. It should already
4533 have been validated to be of suitable type; otherwise, a bad
4534 diagnostic may result.
4536 The EXPR is located at LOCATION.
4538 This preparation consists of taking the ordinary
4539 representation of an expression expr and producing a valid tree
4540 boolean expression describing whether expr is nonzero. We could
4541 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4542 but we optimize comparisons, &&, ||, and !.
4544 The resulting type should always be `truthvalue_type_node'. */
4546 tree
4548 {
4550 {
4592 ? truthvalue_true_node
4598 ? truthvalue_true_node
4603 /* Fall through. */
4606 {
4609 {
4610 /* Common Ada/Pascal programmer's mistake. */
4612 OPT_Waddress,
4614 inner);
4616 }
4618 }
4635 /* These don't change whether an object is nonzero or zero. */
4640 /* These don't change whether an object is zero or nonzero, but
4641 we can't ignore them if their second arg has side-effects. */
4643 {
4646 c_common_truthvalue_conversion
4649 }
4650 else
4655 /* Distribute the conversion into the arms of a COND_EXPR. */
4657 {
4660 /* In C++ one of the arms might have void type if it is throw. */
4668 }
4669 else
4670 {
4671 /* Folding will happen later for C. */
4679 }
4681 CASE_CONVERT:
4682 {
4686 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4687 since that affects how `default_conversion' will behave. */
4691 /* Don't strip a conversion from C++0x scoped enum, since they
4692 don't implicitly convert to other types. */
4696 /* If this isn't narrowing the argument, we can ignore it. */
4700 }
4706 {
4710 }
4715 }
4718 {
4720 expr = (build_binary_op
4724 c_common_truthvalue_conversion
4727 c_common_truthvalue_conversion
4732 }
4735 {
4740 }
4741 else
4744 ret:
4747 }
4748 \f
4757 /* Apply the TYPE_QUALS to the new DECL. */
4759 void
4761 {
4769 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4770 constructor can produce constant init, so rely on cp_finish_decl to
4771 clear TREE_READONLY if the variable has non-constant init. */
4774 {
4777 }
4779 {
4781 /* Allow 'restrict' on arrays of pointers.
4782 FIXME currently we just ignore it. */
4788 }
4790 {
4796 /* The declaration's type should have been previously defined
4797 as a UPC shared type. */
4799 }
4800 }
4802 /* Hash function for the problem of multiple type definitions in
4803 different files. This must hash all types that will compare
4804 equal via comptypes to the same value. In practice it hashes
4805 on some of the simple stuff and leaves the details to comptypes. */
4807 static hashval_t
4809 {
4813 tree t2;
4815 {
4816 /* For pointers, hash on pointee type plus some swizzling. */
4819 /* Hash on number of elements and total size. */
4838 }
4839 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4840 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4842 /* We might have a VLA here. */
4845 else
4848 }
4852 /* Return the typed-based alias set for T, which may be an expression
4853 or a type. Return -1 if we don't do anything special. */
4855 alias_set_type
4857 {
4858 tree u;
4861 /* For VLAs, use the alias set of the element type rather than the
4862 default of alias set 0 for types compared structurally. */
4864 {
4868 }
4870 /* Permit type-punning when accessing a union, provided the access
4871 is directly through the union. For example, this code does not
4872 permit taking the address of a union member and then storing
4873 through it. Even the type-punning allowed here is a GCC
4874 extension, albeit a common and useful one; the C standard says
4875 that such accesses have implementation-defined behavior. */
4883 /* That's all the expressions we handle specially. */
4887 /* The C standard guarantees that any object may be accessed via an
4888 lvalue that has character type. */
4894 /* The C standard specifically allows aliasing between signed and
4895 unsigned variants of the same type. We treat the signed
4896 variant as canonical. */
4898 {
4901 /* t1 == t can happen for boolean nodes which are always unsigned. */
4904 }
4906 /* For the time being, make UPC pointers-to-shared conflict
4907 with everything else. Ideally, UPC pointers-to-shared should
4908 only conflict with the internal type used to represent
4909 the UPC pointer-to-shared (i.e., upc_pts_rep_type_node). */
4918 /* Handle the case of multiple type nodes referring to "the same" type,
4919 which occurs with IMA. These share an alias set. FIXME: Currently only
4920 C90 is handled. (In C99 type compatibility is not transitive, which
4921 complicates things mightily. The alias set splay trees can theoretically
4922 represent this, but insertion is tricky when you consider all the
4923 different orders things might arrive in.) */
4928 /* Save time if there's only one input file. */
4932 /* Pointers need special handling if they point to any type that
4933 needs special handling (below). */
4935 {
4936 tree t2;
4937 /* Find bottom type under any nested POINTERs. */
4941 ;
4949 }
4950 /* These are the only cases that need special handling. */
4957 /* Undefined? */
4961 /* Look up t in hash table. Only one of the compatible types within each
4962 alias set is recorded in the table. */
4966 NULL);
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 /* Return the value of THREADS.
4983 UPC defines a reserved variable, THREADS, which returns the
4984 number of threads that will be created when the UPC program
4985 executes. The value of threads can be specified at runtime via
4986 the -fupc-threads=N switch, where N is an integer specifying
4987 the number of threads. When the value of THREADS is specified
4988 at compile-time, this is called the "static threads compilation
4989 environment".
4991 In the static threads compilation environment, THREADS is a
4992 pre-defined preprocessor macro with the value, N.
4994 If no value for threads is given at compile-time, then the value
4995 must be specified when the application program is executed.
4996 This method of establishing the value of THREADS is called
4997 the "dynamic threads compilation environment". */
4999 tree
5001 {
5002 tree n;
5007 {
5009 "when compiling pre-processed source, "
5010 "all -fupc-* switches must be passed on the command line, "
5011 "asserting the same values as supplied when the "
5014 }
5017 }
5018 \f
5019 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5020 the IS_SIZEOF parameter indicates which operator is being applied.
5021 The COMPLAIN flag controls whether we should diagnose possibly
5022 ill-formed constructs or not. LOC is the location of the SIZEOF or
5023 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5024 a type in any context should be returned, rather than the normal
5025 alignment for that type. */
5027 tree
5031 {
5039 {
5041 {
5048 }
5049 else
5050 {
5052 {
5056 else
5059 }
5061 }
5062 }
5064 {
5066 {
5073 }
5074 else
5077 }
5080 {
5085 }
5088 {
5093 }
5094 else
5095 {
5097 /* Convert in case a char is more than one unit. */
5102 {
5105 #ifdef BIGGEST_FIELD_ALIGNMENT
5107 #endif
5109 #ifdef ADJUST_FIELD_ALIGN
5111 type);
5113 #endif
5116 }
5117 else
5119 }
5124 {
5127 }
5129 /* VALUE will have the middle-end integer type sizetype.
5130 However, we should really return a value of type `size_t',
5131 which is just a typedef for an ordinary integer type. */
5135 }
5137 /* Implement the __alignof keyword: Return the minimum required
5138 alignment of EXPR, measured in bytes. For VAR_DECLs,
5139 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5140 from an "aligned" __attribute__ specification). LOC is the
5141 location of the ALIGNOF operator. */
5143 tree
5145 {
5146 tree t;
5153 {
5156 }
5162 {
5169 {
5176 }
5178 }
5179 else
5183 }
5184 \f
5185 /* Handle C and C++ default attributes. */
5187 enum built_in_attribute
5188 {
5189 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5190 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5191 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5192 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5193 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5195 #undef DEF_ATTR_NULL_TREE
5196 #undef DEF_ATTR_INT
5197 #undef DEF_ATTR_STRING
5198 #undef DEF_ATTR_IDENT
5199 #undef DEF_ATTR_TREE_LIST
5200 ATTR_LAST
5201 };
5207 enum c_builtin_type
5208 {
5209 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5210 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5211 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5212 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5213 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5214 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5215 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5216 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5217 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5218 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5219 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5220 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5221 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5222 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5223 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5224 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5225 NAME,
5226 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5228 #undef DEF_PRIMITIVE_TYPE
5229 #undef DEF_FUNCTION_TYPE_0
5230 #undef DEF_FUNCTION_TYPE_1
5231 #undef DEF_FUNCTION_TYPE_2
5232 #undef DEF_FUNCTION_TYPE_3
5233 #undef DEF_FUNCTION_TYPE_4
5234 #undef DEF_FUNCTION_TYPE_5
5235 #undef DEF_FUNCTION_TYPE_6
5236 #undef DEF_FUNCTION_TYPE_7
5237 #undef DEF_FUNCTION_TYPE_8
5238 #undef DEF_FUNCTION_TYPE_VAR_0
5239 #undef DEF_FUNCTION_TYPE_VAR_1
5240 #undef DEF_FUNCTION_TYPE_VAR_2
5241 #undef DEF_FUNCTION_TYPE_VAR_3
5242 #undef DEF_FUNCTION_TYPE_VAR_4
5243 #undef DEF_FUNCTION_TYPE_VAR_5
5244 #undef DEF_POINTER_TYPE
5245 BT_LAST
5246 };
5250 /* A temporary array for c_common_nodes_and_builtins. Used in
5251 communication with def_fn_type. */
5254 /* A helper function for c_common_nodes_and_builtins. Build function type
5255 for DEF with return type RET and N arguments. If VAR is true, then the
5256 function should be variadic after those N arguments.
5258 Takes special care not to ICE if any of the types involved are
5259 error_mark_node, which indicates that said type is not in fact available
5260 (see builtin_type_for_size). In which case the function type as a whole
5261 should be error_mark_node. */
5263 static void
5265 {
5266 tree t;
5273 {
5279 }
5286 else
5289 egress:
5292 }
5294 /* Build builtin functions common to both C and C++ language
5295 frontends. */
5297 static void
5299 {
5300 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5301 builtin_types[ENUM] = VALUE;
5302 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5303 def_fn_type (ENUM, RETURN, 0, 0);
5304 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5305 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5306 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5307 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5308 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5309 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5310 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5311 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5312 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5313 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5314 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5315 ARG6) \
5316 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5317 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5318 ARG6, ARG7) \
5319 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5320 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5321 ARG6, ARG7, ARG8) \
5322 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5323 ARG7, ARG8);
5324 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5325 def_fn_type (ENUM, RETURN, 1, 0);
5326 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5327 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5328 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5329 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5330 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5331 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5332 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5333 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5334 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5335 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5336 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5337 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5341 #undef DEF_PRIMITIVE_TYPE
5342 #undef DEF_FUNCTION_TYPE_1
5343 #undef DEF_FUNCTION_TYPE_2
5344 #undef DEF_FUNCTION_TYPE_3
5345 #undef DEF_FUNCTION_TYPE_4
5346 #undef DEF_FUNCTION_TYPE_5
5347 #undef DEF_FUNCTION_TYPE_6
5348 #undef DEF_FUNCTION_TYPE_VAR_0
5349 #undef DEF_FUNCTION_TYPE_VAR_1
5350 #undef DEF_FUNCTION_TYPE_VAR_2
5351 #undef DEF_FUNCTION_TYPE_VAR_3
5352 #undef DEF_FUNCTION_TYPE_VAR_4
5353 #undef DEF_FUNCTION_TYPE_VAR_5
5354 #undef DEF_POINTER_TYPE
5359 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5360 NONANSI_P, ATTRS, IMPLICIT, COND) \
5361 if (NAME && COND) \
5362 def_builtin_1 (ENUM, NAME, CLASS, \
5363 builtin_types[(int) TYPE], \
5364 builtin_types[(int) LIBTYPE], \
5365 BOTH_P, FALLBACK_P, NONANSI_P, \
5366 built_in_attributes[(int) ATTRS], IMPLICIT);
5368 #undef DEF_BUILTIN
5376 }
5378 /* Like get_identifier, but avoid warnings about null arguments when
5379 the argument may be NULL for targets where GCC lacks stdint.h type
5380 information. */
5384 {
5386 }
5388 /* Build tree nodes and builtin functions common to both C and C++ language
5389 frontends. */
5391 void
5393 {
5397 tree array_domain_type;
5398 tree va_list_ref_type_node;
5399 tree va_list_arg_type_node;
5403 /* Define `int' and `char' first so that dbx will output them first. */
5407 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5408 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5409 but not C. Are the conditionals here needed? */
5415 long_unsigned_type_node);
5417 {
5419 int128_integer_type_node);
5421 int128_unsigned_type_node);
5422 }
5426 long_long_integer_type_node);
5428 long_long_unsigned_type_node);
5431 long_long_unsigned_type_node);
5434 short_unsigned_type_node);
5437 short_unsigned_type_node);
5439 /* Define both `signed char' and `unsigned char'. */
5443 /* These are types that c_common_type_for_size and
5444 c_common_type_for_mode use. */
5447 intQI_type_node));
5450 intHI_type_node));
5453 intSI_type_node));
5456 intDI_type_node));
5457 #if HOST_BITS_PER_WIDE_INT >= 64
5460 TYPE_DECL,
5462 intTI_type_node));
5463 #endif
5466 unsigned_intQI_type_node));
5469 unsigned_intHI_type_node));
5472 unsigned_intSI_type_node));
5475 unsigned_intDI_type_node));
5476 #if HOST_BITS_PER_WIDE_INT >= 64
5479 TYPE_DECL,
5481 unsigned_intTI_type_node));
5482 #endif
5484 /* Create the widest literal types. */
5485 widest_integer_literal_type_node
5489 widest_integer_literal_type_node));
5491 widest_unsigned_literal_type_node
5495 widest_unsigned_literal_type_node));
5499 pid_type_node =
5506 /* Only supported decimal floating point extension if the target
5507 actually supports underlying modes. */
5511 {
5515 }
5518 {
5523 long_long_fract_type_node);
5525 unsigned_short_fract_type_node);
5527 unsigned_fract_type_node);
5529 unsigned_long_fract_type_node);
5531 unsigned_long_long_fract_type_node);
5533 sat_short_fract_type_node);
5536 sat_long_fract_type_node);
5538 sat_long_long_fract_type_node);
5540 sat_unsigned_short_fract_type_node);
5542 sat_unsigned_fract_type_node);
5544 sat_unsigned_long_fract_type_node);
5546 sat_unsigned_long_long_fract_type_node);
5551 long_long_accum_type_node);
5553 unsigned_short_accum_type_node);
5555 unsigned_accum_type_node);
5557 unsigned_long_accum_type_node);
5559 unsigned_long_long_accum_type_node);
5561 sat_short_accum_type_node);
5564 sat_long_accum_type_node);
5566 sat_long_long_accum_type_node);
5568 sat_unsigned_short_accum_type_node);
5570 sat_unsigned_accum_type_node);
5572 sat_unsigned_long_accum_type_node);
5574 sat_unsigned_long_long_accum_type_node);
5576 }
5579 TYPE_DECL,
5581 complex_integer_type_node));
5583 TYPE_DECL,
5585 complex_float_type_node));
5587 TYPE_DECL,
5589 complex_double_type_node));
5593 complex_long_double_type_node));
5596 /* For C++, make fileptr_type_node a distinct void * type until
5597 FILE type is defined. */
5602 /* Set the TYPE_NAME for any variants that were built before
5603 record_builtin_type gave names to the built-in types. */
5604 {
5610 }
5612 /* This node must not be shared. */
5618 /* Make a type to be the domain of a few array types
5619 whose domains don't really matter.
5620 200 is small enough that it always fits in size_t
5621 and large enough that it can hold most function names for the
5622 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5625 /* Make a type for arrays of characters.
5626 With luck nothing will ever really depend on the length of this
5627 array type. */
5628 char_array_type_node
5632 const_string_type_node
5636 /* This is special for C++ so functions can be overloaded. */
5642 {
5645 else
5648 }
5650 /* This is for wide string constants. */
5651 wchar_array_type_node
5654 /* Define 'char16_t'. */
5659 {
5664 }
5666 /* This is for UTF-16 string constants. */
5667 char16_array_type_node
5670 /* Define 'char32_t'. */
5675 {
5680 }
5682 /* This is for UTF-32 string constants. */
5683 char32_array_type_node
5686 wint_type_node =
5689 intmax_type_node =
5691 uintmax_type_node =
5695 sig_atomic_type_node =
5698 int8_type_node =
5701 int16_type_node =
5704 int32_type_node =
5707 int64_type_node =
5710 uint8_type_node =
5713 c_uint16_type_node =
5716 c_uint32_type_node =
5719 c_uint64_type_node =
5722 int_least8_type_node =
5725 int_least16_type_node =
5728 int_least32_type_node =
5731 int_least64_type_node =
5734 uint_least8_type_node =
5737 uint_least16_type_node =
5740 uint_least32_type_node =
5743 uint_least64_type_node =
5746 int_fast8_type_node =
5749 int_fast16_type_node =
5752 int_fast32_type_node =
5755 int_fast64_type_node =
5758 uint_fast8_type_node =
5761 uint_fast16_type_node =
5764 uint_fast32_type_node =
5767 uint_fast64_type_node =
5770 intptr_type_node =
5773 uintptr_type_node =
5776 default_function_type
5778 ptrdiff_type_node
5785 va_list_type_node));
5787 {
5790 tree ptype;
5793 {
5797 ptype));
5799 }
5800 }
5803 {
5806 }
5807 else
5808 {
5811 }
5818 /* Create the built-in __null node. It is important that this is
5819 not shared. */
5823 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5825 }
5827 /* The number of named compound-literals generated thus far. */
5830 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5832 void
5834 {
5837 compound_literal_number);
5838 compound_literal_number++;
5840 }
5842 tree
5844 {
5848 }
5851 /* Linked list of disabled built-in functions. */
5854 {
5862 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5863 begins with "__builtin_", give an error. */
5865 void
5867 {
5870 else
5871 {
5876 }
5877 }
5880 /* Return true if the built-in function NAME has been disabled, false
5881 otherwise. */
5883 static bool
5885 {
5888 {
5891 }
5893 }
5896 /* Worker for DEF_BUILTIN.
5897 Possibly define a builtin function with one or two names.
5898 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5899 nonansi_p and flag_no_nonansi_builtin. */
5901 static void
5908 {
5909 tree decl;
5922 fnattrs);
5931 }
5932 \f
5933 /* Nonzero if the type T promotes to int. This is (nearly) the
5934 integral promotions defined in ISO C99 6.3.1.1/2. */
5936 bool
5938 {
5940 {
5950 /* ??? Technically all enumerations not larger than an int
5951 promote to an int. But this is used along code paths
5952 that only want to notice a size change. */
5960 }
5961 }
5963 /* Return 1 if PARMS specifies a fixed number of parameters
5964 and none of their types is affected by default promotions. */
5966 int
5968 {
5969 const_tree t;
5971 {
5988 }
5990 }
5992 /* Recursively remove any '*' or '&' operator from TYPE. */
5993 tree
5995 {
5999 }
6001 /* Recursively remove pointer or array type from TYPE. */
6002 tree
6004 {
6008 }
6010 /* Used to compare case labels. K1 and K2 are actually tree nodes
6011 representing case labels, or NULL_TREE for a `default' label.
6012 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6013 K2, and 0 if K1 and K2 are equal. */
6015 int
6017 {
6018 /* Consider a NULL key (such as arises with a `default' label) to be
6019 smaller than anything else. */
6026 }
6028 /* Process a case label, located at LOC, for the range LOW_VALUE
6029 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6030 then this case label is actually a `default' label. If only
6031 HIGH_VALUE is NULL_TREE, then case label was declared using the
6032 usual C/C++ syntax, rather than the GNU case range extension.
6033 CASES is a tree containing all the case ranges processed so far;
6034 COND is the condition for the switch-statement itself. Returns the
6035 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6036 is created. */
6038 tree
6041 {
6042 tree type;
6043 tree label;
6044 tree case_label;
6045 splay_tree_node node;
6047 /* Create the LABEL_DECL itself. */
6050 /* If there was an error processing the switch condition, bail now
6051 before we get more confused. */
6059 {
6062 }
6064 /* Case ranges are a GNU extension. */
6071 {
6076 }
6078 {
6083 }
6086 {
6087 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6088 really a case range, even though it was written that way.
6089 Remove the HIGH_VALUE to simplify later processing. */
6094 }
6096 /* See if the case is in range of the type of the original testing
6097 expression. If both low_value and high_value are out of range,
6098 don't insert the case label and return NULL_TREE. */
6104 /* Look up the LOW_VALUE in the table of case labels we already
6105 have. */
6107 /* If there was not an exact match, check for overlapping ranges.
6108 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6109 that's a `default' label and the only overlap is an exact match. */
6111 {
6112 splay_tree_node low_bound;
6113 splay_tree_node high_bound;
6115 /* Even though there wasn't an exact match, there might be an
6116 overlap between this case range and another case range.
6117 Since we've (inductively) not allowed any overlapping case
6118 ranges, we simply need to find the greatest low case label
6119 that is smaller that LOW_VALUE, and the smallest low case
6120 label that is greater than LOW_VALUE. If there is an overlap
6121 it will occur in one of these two ranges. */
6127 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6128 the LOW_VALUE, so there is no need to check unless the
6129 LOW_BOUND is in fact itself a case range. */
6135 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6136 range is bigger than the low end of the current range, so we
6137 are only interested if the current range is a real range, and
6138 not an ordinary case label. */
6140 && high_value
6142 high_value)
6145 }
6146 /* If there was an overlap, issue an error. */
6148 {
6152 {
6156 }
6158 {
6161 }
6162 else
6163 {
6167 }
6169 }
6171 /* Add a CASE_LABEL to the statement-tree. */
6173 /* Register this case label in the splay tree. */
6180 error_out:
6181 /* Add a label so that the back-end doesn't think that the beginning of
6182 the switch is unreachable. Note that we do not add a case label, as
6183 that just leads to duplicates and thence to failure later on. */
6185 {
6188 }
6190 }
6192 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6193 Used to verify that case values match up with enumerator values. */
6195 static void
6197 {
6200 /* ??? Not working too hard to print the double-word value.
6201 Should perhaps be done with %lwd in the diagnostic routines? */
6210 else
6219 buf);
6220 else
6225 }
6227 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6228 Used to verify that case values match up with enumerator values. */
6230 static int
6232 {
6236 /* Skip default case. */
6240 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6241 when we did our enum->case scan. Reset our scratch bit after. */
6244 else
6247 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6248 not set, that means that CASE_HIGH did not appear when we did our
6249 enum->case scan. Reset our scratch bit after. */
6251 {
6254 else
6256 }
6259 }
6261 /* Handle -Wswitch*. Called from the front end after parsing the
6262 switch construct. */
6263 /* ??? Should probably be somewhere generic, since other languages
6264 besides C and C++ would want this. At the moment, however, C/C++
6265 are the only tree-ssa languages that support enumerations at all,
6266 so the point is moot. */
6268 void
6271 {
6272 splay_tree_node default_node;
6273 splay_tree_node node;
6274 tree chain;
6284 /* From here on, we only care about about enumerated types. */
6288 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6292 /* Check the cases. Warn about case values which are not members of
6293 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6294 there is no default case, check that exactly all enumeration
6295 literals are covered by the cases. */
6297 /* Clearing COND if it is not an integer constant simplifies
6298 the tests inside the loop below. */
6302 /* The time complexity here is O(N*lg(N)) worst case, but for the
6303 common case of monotonically increasing enumerators, it is
6304 O(N), since the nature of the splay tree will keep the next
6305 element adjacent to the root at all times. */
6308 {
6314 {
6315 /* Mark the CASE_LOW part of the case entry as seen. */
6319 }
6321 /* Even though there wasn't an exact match, there might be a
6322 case range which includes the enumerator's value. */
6325 {
6329 {
6330 /* If we match the upper bound exactly, mark the CASE_HIGH
6331 part of the case entry as seen. */
6335 }
6336 }
6338 /* We've now determined that this enumerated literal isn't
6339 handled by the case labels of the switch statement. */
6341 /* If the switch expression is a constant, we only really care
6342 about whether that constant is handled by the switch. */
6346 /* If there is a default_node, the only relevant option is
6347 Wswitch-enum. Otherwise, if both are enabled then we prefer
6348 to warn using -Wswitch because -Wswitch is enabled by -Wall
6349 while -Wswitch-enum is explicit. */
6352 ? OPT_Wswitch_enum
6356 }
6358 /* Warn if there are case expressions that don't correspond to
6359 enumerators. This can occur since C and C++ don't enforce
6360 type-checking of assignments to enumeration variables.
6362 The time complexity here is now always O(N) worst case, since
6363 we should have marked both the lower bound and upper bound of
6364 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6365 above. This scan also resets those fields. */
6368 }
6370 /* Finish an expression taking the address of LABEL (an
6371 IDENTIFIER_NODE). Returns an expression for the address.
6373 LOC is the location for the expression returned. */
6375 tree
6377 {
6378 tree result;
6388 else
6389 {
6392 /* The current function is not necessarily uninlinable.
6393 Computed gotos are incompatible with inlining, but the value
6394 here could be used only in a diagnostic, for example. */
6396 }
6399 }
6400 \f
6402 /* Given a boolean expression ARG, return a tree representing an increment
6403 or decrement (as indicated by CODE) of ARG. The front end must check for
6404 invalid cases (e.g., decrement in C++). */
6405 tree
6407 {
6408 tree val;
6413 {
6436 }
6439 }
6440 \f
6441 /* Built-in macros for stddef.h and stdint.h, that require macros
6442 defined in this file. */
6443 void
6445 {
6508 }
6510 static void
6512 {
6513 /* Fill in the built_in_attributes array. */
6514 #define DEF_ATTR_NULL_TREE(ENUM) \
6515 built_in_attributes[(int) ENUM] = NULL_TREE;
6516 #define DEF_ATTR_INT(ENUM, VALUE) \
6517 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6518 #define DEF_ATTR_STRING(ENUM, VALUE) \
6519 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6520 #define DEF_ATTR_IDENT(ENUM, STRING) \
6521 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6522 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6523 built_in_attributes[(int) ENUM] \
6524 = tree_cons (built_in_attributes[(int) PURPOSE], \
6525 built_in_attributes[(int) VALUE], \
6526 built_in_attributes[(int) CHAIN]);
6528 #undef DEF_ATTR_NULL_TREE
6529 #undef DEF_ATTR_INT
6530 #undef DEF_ATTR_IDENT
6531 #undef DEF_ATTR_TREE_LIST
6532 }
6534 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6535 identifier as an argument, so the front end shouldn't look it up. */
6537 bool
6539 {
6542 /* Unknown attribute that we'll end up ignoring, return true so we
6543 don't complain about an identifier argument. */
6549 else
6551 }
6553 /* Attribute handlers common to C front ends. */
6555 /* Handle a "packed" attribute; arguments as in
6556 struct attribute_spec.handler. */
6558 static tree
6561 {
6563 {
6567 }
6569 {
6571 /* Still pack bitfields. */
6576 else
6578 }
6579 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6580 used for DECL_REGISTER. It wouldn't mean anything anyway.
6581 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6582 that changes what the typedef is typing. */
6583 else
6584 {
6587 }
6590 }
6592 /* Handle a "nocommon" attribute; arguments as in
6593 struct attribute_spec.handler. */
6595 static tree
6599 {
6602 else
6603 {
6606 }
6609 }
6611 /* Handle a "common" attribute; arguments as in
6612 struct attribute_spec.handler. */
6614 static tree
6617 {
6620 else
6621 {
6624 }
6627 }
6629 /* Handle a "noreturn" attribute; arguments as in
6630 struct attribute_spec.handler. */
6632 static tree
6635 {
6638 /* See FIXME comment in c_common_attribute_table. */
6645 = build_pointer_type
6648 else
6649 {
6652 }
6655 }
6657 /* Handle a "hot" and attribute; arguments as in
6658 struct attribute_spec.handler. */
6660 static tree
6663 {
6666 {
6668 {
6672 }
6673 /* Most of the rest of the hot processing is done later with
6674 lookup_attribute. */
6675 }
6676 else
6677 {
6680 }
6683 }
6685 /* Handle a "cold" and attribute; arguments as in
6686 struct attribute_spec.handler. */
6688 static tree
6691 {
6694 {
6696 {
6700 }
6701 /* Most of the rest of the cold processing is done later with
6702 lookup_attribute. */
6703 }
6704 else
6705 {
6708 }
6711 }
6713 /* Handle a "no_sanitize_address" attribute; arguments as in
6714 struct attribute_spec.handler. */
6716 static tree
6719 {
6721 {
6724 }
6727 }
6729 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6730 struct attribute_spec.handler. */
6732 static tree
6735 {
6744 }
6746 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6747 struct attribute_spec.handler. */
6749 static tree
6752 {
6754 {
6757 }
6760 }
6762 /* Handle a "noinline" attribute; arguments as in
6763 struct attribute_spec.handler. */
6765 static tree
6769 {
6772 else
6773 {
6776 }
6779 }
6781 /* Handle a "noclone" attribute; arguments as in
6782 struct attribute_spec.handler. */
6784 static tree
6788 {
6790 {
6793 }
6796 }
6798 /* Handle a "always_inline" attribute; arguments as in
6799 struct attribute_spec.handler. */
6801 static tree
6806 {
6808 {
6809 /* Set the attribute and mark it for disregarding inline
6810 limits. */
6812 }
6813 else
6814 {
6817 }
6820 }
6822 /* Handle a "gnu_inline" attribute; arguments as in
6823 struct attribute_spec.handler. */
6825 static tree
6830 {
6832 {
6833 /* Do nothing else, just set the attribute. We'll get at
6834 it later with lookup_attribute. */
6835 }
6836 else
6837 {
6840 }
6843 }
6845 /* Handle a "leaf" attribute; arguments as in
6846 struct attribute_spec.handler. */
6848 static tree
6852 {
6854 {
6857 }
6859 {
6862 }
6865 }
6867 /* Handle an "artificial" attribute; arguments as in
6868 struct attribute_spec.handler. */
6870 static tree
6875 {
6877 {
6878 /* Do nothing else, just set the attribute. We'll get at
6879 it later with lookup_attribute. */
6880 }
6881 else
6882 {
6885 }
6888 }
6890 /* Handle a "flatten" attribute; arguments as in
6891 struct attribute_spec.handler. */
6893 static tree
6895 tree args ATTRIBUTE_UNUSED,
6897 {
6899 /* Do nothing else, just set the attribute. We'll get at
6900 it later with lookup_attribute. */
6901 ;
6902 else
6903 {
6906 }
6909 }
6911 /* Handle a "warning" or "error" attribute; arguments as in
6912 struct attribute_spec.handler. */
6914 static tree
6917 {
6920 /* Do nothing else, just set the attribute. We'll get at
6921 it later with lookup_attribute. */
6922 ;
6923 else
6924 {
6927 }
6930 }
6932 /* Handle a "used" attribute; arguments as in
6933 struct attribute_spec.handler. */
6935 static tree
6938 {
6944 {
6949 }
6950 else
6951 {
6954 }
6957 }
6959 /* Handle a "unused" attribute; arguments as in
6960 struct attribute_spec.handler. */
6962 static tree
6965 {
6967 {
6975 {
6980 }
6981 else
6982 {
6985 }
6986 }
6987 else
6988 {
6992 }
6995 }
6997 /* Handle a "externally_visible" attribute; arguments as in
6998 struct attribute_spec.handler. */
7000 static tree
7005 {
7009 {
7012 {
7016 }
7017 }
7018 else
7019 {
7022 }
7025 }
7027 /* Handle a "const" attribute; arguments as in
7028 struct attribute_spec.handler. */
7030 static tree
7033 {
7036 /* See FIXME comment on noreturn in c_common_attribute_table. */
7042 = build_pointer_type
7045 else
7046 {
7049 }
7052 }
7054 /* Handle a "transparent_union" attribute; arguments as in
7055 struct attribute_spec.handler. */
7057 static tree
7061 {
7062 tree type;
7073 {
7074 /* Make sure that the first field will work for a transparent union.
7075 If the type isn't complete yet, leave the check to the code in
7076 finish_struct. */
7078 {
7084 }
7087 {
7088 /* If the type isn't complete yet, setting the flag
7089 on a variant wouldn't ever be checked. */
7093 /* build_duplicate_type doesn't work for C++. */
7097 /* A type variant isn't good enough, since we don't a cast
7098 to such a type removed as a no-op. */
7100 }
7104 }
7106 ignored:
7109 }
7111 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7112 get the requested priority for a constructor or destructor,
7113 possibly issuing diagnostics for invalid or reserved
7114 priorities. */
7116 static priority_type
7118 {
7119 HOST_WIDE_INT pri;
7120 tree arg;
7126 {
7129 else
7132 }
7149 {
7152 "destructor priorities from 0 to %d are reserved "
7154 MAX_RESERVED_INIT_PRIORITY);
7155 else
7157 "constructor priorities from 0 to %d are reserved "
7159 MAX_RESERVED_INIT_PRIORITY);
7160 }
7163 invalid:
7166 MAX_INIT_PRIORITY);
7167 else
7169 MAX_INIT_PRIORITY);
7171 }
7173 /* Handle a "constructor" attribute; arguments as in
7174 struct attribute_spec.handler. */
7176 static tree
7180 {
7187 {
7188 priority_type priority;
7193 }
7194 else
7195 {
7198 }
7201 }
7203 /* Handle a "destructor" attribute; arguments as in
7204 struct attribute_spec.handler. */
7206 static tree
7210 {
7217 {
7218 priority_type priority;
7223 }
7224 else
7225 {
7228 }
7231 }
7233 /* Nonzero if the mode is a valid vector mode for this architecture.
7234 This returns nonzero even if there is no hardware support for the
7235 vector mode, but we can emulate with narrower modes. */
7237 static int
7239 {
7243 /* Doh! What's going on? */
7252 /* Hardware support. Woo hoo! */
7258 /* We should probably return 1 if requesting V4DI and we have no DI,
7259 but we have V2DI, but this is probably very unlikely. */
7261 /* If we have support for the inner mode, we can safely emulate it.
7262 We may not have V2DI, but me can emulate with a pair of DIs. */
7264 }
7267 /* Handle a "mode" attribute; arguments as in
7268 struct attribute_spec.handler. */
7270 static tree
7273 {
7281 else
7282 {
7287 tree typefm;
7292 {
7298 }
7300 /* Change this type to have a type with the specified mode.
7301 First check for the special modes. */
7314 else
7317 {
7320 }
7323 {
7326 }
7330 {
7362 }
7364 {
7367 }
7370 {
7375 {
7378 }
7382 else
7385 }
7386 else
7387 {
7388 /* For fixed-point modes, we need to test if the signness of type
7389 and the machine mode are consistent. */
7392 {
7395 }
7396 /* For fixed-point modes, we need to pass saturating info. */
7400 }
7403 {
7406 }
7408 {
7409 /* For enumeral types, copy the precision from the integer
7410 type returned above. If not an INTEGER_TYPE, we can't use
7411 this mode for this type. */
7413 {
7416 }
7419 {
7422 }
7423 else
7424 {
7425 /* We cannot build a type variant, as there's code that assumes
7426 that TYPE_MAIN_VARIANT has the same mode. This includes the
7427 debug generators. Instead, create a subrange type. This
7428 results in all of the enumeral values being emitted only once
7429 in the original, and the subtype gets them by reference. */
7432 else
7435 }
7436 }
7440 {
7443 }
7446 }
7449 }
7451 /* Handle a "section" attribute; arguments as in
7452 struct attribute_spec.handler. */
7454 static tree
7457 {
7461 {
7467 {
7471 {
7473 "section attribute cannot be specified for "
7476 }
7478 /* The decl may have already been given a section attribute
7479 from a previous declaration. Ensure they match. */
7483 {
7487 }
7491 {
7494 }
7495 else
7497 }
7498 else
7499 {
7502 }
7503 }
7504 else
7505 {
7509 }
7512 }
7514 /* Check whether ALIGN is a valid user-specified alignment. If so,
7515 return its base-2 log; if not, output an error and return -1. If
7516 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7517 no error. */
7518 int
7520 {
7525 {
7528 }
7533 {
7536 }
7538 {
7541 }
7543 }
7545 /*
7546 If in c++-11, check if the c++-11 alignment constraint with respect
7547 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7548 c++-11 mode, does nothing.
7550 [dcl.align]2/ says:
7552 [* if the constant expression evaluates to a fundamental alignment,
7553 the alignment requirement of the declared entity shall be the
7554 specified fundamental alignment.
7556 * if the constant expression evaluates to an extended alignment
7557 and the implementation supports that alignment in the context
7558 of the declaration, the alignment of the declared entity shall
7559 be that alignment
7561 * if the constant expression evaluates to an extended alignment
7562 and the implementation does not support that alignment in the
7563 context of the declaration, the program is ill-formed]. */
7565 static bool
7569 {
7582 {
7584 {
7585 /* For file scope variables and static members, the target
7586 supports alignments that are at most
7587 MAX_OFILE_ALIGNMENT. */
7590 }
7591 else
7592 {
7593 #ifdef BIGGEST_FIELD_ALIGNMENT
7594 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7595 #else
7596 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7597 #endif
7598 /* For non-static members, the target supports either
7599 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7600 if it is defined or BIGGEST_ALIGNMENT. */
7605 #undef MAX_TARGET_FIELD_ALIGNMENT
7606 /* For stack variables, the target supports at most
7607 MAX_STACK_ALIGNMENT. */
7611 }
7612 }
7614 {
7615 /* Let's be liberal for types. */
7618 }
7626 }
7628 /* Handle a "aligned" attribute; arguments as in
7629 struct attribute_spec.handler. */
7631 static tree
7634 {
7643 {
7647 }
7655 {
7658 /* If we have a TYPE_DECL, then copy the type, so that we
7659 don't accidentally modify a builtin type. See pushdecl. */
7662 {
7669 }
7670 else
7675 }
7678 {
7681 }
7684 /* C++-11 [dcl.align/4]:
7686 When multiple alignment-specifiers are specified for an
7687 entity, the alignment requirement shall be set to the
7688 strictest specified alignment.
7690 This formally comes from the c++11 specification but we are
7691 doing it for the GNU attribute syntax as well. */
7695 {
7700 else
7704 }
7705 else
7706 {
7709 }
7712 }
7714 /* Handle a "weak" attribute; arguments as in
7715 struct attribute_spec.handler. */
7717 static tree
7722 {
7725 {
7728 }
7730 {
7734 }
7738 else
7742 }
7744 /* Handle an "alias" or "ifunc" attribute; arguments as in
7745 struct attribute_spec.handler, except that IS_ALIAS tells us
7746 whether this is an alias as opposed to ifunc attribute. */
7748 static tree
7751 {
7756 {
7759 }
7763 /* A static variable declaration is always a tentative definition,
7764 but the alias is a non-tentative definition which overrides. */
7767 {
7771 }
7775 {
7779 }
7781 /* Note that the very first time we process a nested declaration,
7782 decl_function_context will not be set. Indeed, *would* never
7783 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7784 we do below. After such frobbery, pushdecl would set the context.
7785 In any case, this is never what we want. */
7787 {
7788 tree id;
7792 {
7796 }
7798 /* This counts as a use of the object pointed to. */
7803 else
7807 /* ifuncs are also aliases, so set that attribute too. */
7810 }
7811 else
7812 {
7815 }
7818 }
7820 /* Handle an "alias" or "ifunc" attribute; arguments as in
7821 struct attribute_spec.handler. */
7823 static tree
7826 {
7828 }
7830 /* Handle an "alias" or "ifunc" attribute; arguments as in
7831 struct attribute_spec.handler. */
7833 static tree
7836 {
7838 }
7840 /* Handle a "weakref" attribute; arguments as in struct
7841 attribute_spec.handler. */
7843 static tree
7846 {
7849 /* We must ignore the attribute when it is associated with
7850 local-scoped decls, since attribute alias is ignored and many
7851 such symbols do not even have a DECL_WEAK field. */
7853 || current_function_decl
7855 {
7859 }
7862 {
7866 }
7868 /* The idea here is that `weakref("name")' mutates into `weakref,
7869 alias("name")', and weakref without arguments, in turn,
7870 implicitly adds weak. */
7873 {
7880 }
7881 else
7882 {
7887 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7888 and that isn't supported; and because it wants to add it to
7889 the list of weak decls, which isn't helpful. */
7891 }
7894 }
7896 /* Handle an "visibility" attribute; arguments as in
7897 struct attribute_spec.handler. */
7899 static tree
7903 {
7909 {
7913 {
7915 name);
7917 }
7919 {
7923 }
7924 }
7926 {
7929 }
7932 {
7935 }
7937 /* If this is a type, set the visibility on the type decl. */
7939 {
7944 {
7946 name);
7948 }
7949 }
7959 else
7960 {
7961 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7963 }
7967 {
7981 }
7986 /* Go ahead and attach the attribute to the node as well. This is needed
7987 so we can determine whether we have VISIBILITY_DEFAULT because the
7988 visibility was not specified, or because it was explicitly overridden
7989 from the containing scope. */
7992 }
7994 /* Determine the ELF symbol visibility for DECL, which is either a
7995 variable or a function. It is an error to use this function if a
7996 definition of DECL is not available in this translation unit.
7997 Returns true if the final visibility has been determined by this
7998 function; false if the caller is free to make additional
7999 modifications. */
8001 bool
8003 {
8007 /* If the user explicitly specified the visibility with an
8008 attribute, honor that. DECL_VISIBILITY will have been set during
8009 the processing of the attribute. We check for an explicit
8010 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8011 to distinguish the use of an attribute from the use of a "#pragma
8012 GCC visibility push(...)"; in the latter case we still want other
8013 considerations to be able to overrule the #pragma. */
8015 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8020 /* Set default visibility to whatever the user supplied with
8021 visibility_specified depending on #pragma GCC visibility. */
8023 {
8026 {
8029 /* If visibility changed and DECL already has DECL_RTL, ensure
8030 symbol flags are updated. */
8035 }
8036 }
8038 }
8040 /* Handle an "tls_model" attribute; arguments as in
8041 struct attribute_spec.handler. */
8043 static tree
8046 {
8047 tree id;
8054 {
8057 }
8062 {
8065 }
8075 else
8076 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8080 }
8082 /* Handle a "no_instrument_function" attribute; arguments as in
8083 struct attribute_spec.handler. */
8085 static tree
8090 {
8094 {
8098 }
8100 {
8104 }
8105 else
8109 }
8111 /* Handle a "malloc" attribute; arguments as in
8112 struct attribute_spec.handler. */
8114 static tree
8117 {
8121 else
8122 {
8125 }
8128 }
8130 /* Handle a "alloc_size" attribute; arguments as in
8131 struct attribute_spec.handler. */
8133 static tree
8136 {
8139 {
8146 {
8151 }
8152 }
8154 }
8156 /* Handle a "fn spec" attribute; arguments as in
8157 struct attribute_spec.handler. */
8159 static tree
8163 {
8168 }
8170 /* Handle a "warn_unused" attribute; arguments as in
8171 struct attribute_spec.handler. */
8173 static tree
8175 tree args ATTRIBUTE_UNUSED,
8177 {
8179 /* Do nothing else, just set the attribute. We'll get at
8180 it later with lookup_attribute. */
8181 ;
8182 else
8183 {
8186 }
8189 }
8191 /* Handle an "omp declare simd" attribute; arguments as in
8192 struct attribute_spec.handler. */
8194 static tree
8196 {
8198 }
8200 /* Handle an "omp declare target" attribute; arguments as in
8201 struct attribute_spec.handler. */
8203 static tree
8205 {
8207 }
8209 /* Handle a "returns_twice" attribute; arguments as in
8210 struct attribute_spec.handler. */
8212 static tree
8215 {
8218 else
8219 {
8222 }
8225 }
8227 /* Handle a "no_limit_stack" attribute; arguments as in
8228 struct attribute_spec.handler. */
8230 static tree
8235 {
8239 {
8243 }
8245 {
8249 }
8250 else
8254 }
8256 /* Handle a "pure" attribute; arguments as in
8257 struct attribute_spec.handler. */
8259 static tree
8262 {
8265 /* ??? TODO: Support types. */
8266 else
8267 {
8270 }
8273 }
8275 /* Digest an attribute list destined for a transactional memory statement.
8276 ALLOWED is the set of attributes that are allowed for this statement;
8277 return the attribute we parsed. Multiple attributes are never allowed. */
8279 int
8281 {
8286 {
8294 {
8297 }
8300 {
8303 }
8306 else
8308 }
8311 }
8313 /* Transform a TM attribute name into a maskable integer and back.
8314 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8315 to how the lack of an attribute is treated. */
8317 int
8319 {
8333 }
8335 tree
8337 {
8340 {
8358 }
8360 }
8362 /* Return the first TM attribute seen in LIST. */
8364 tree
8366 {
8368 {
8372 }
8374 }
8376 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8377 Here we accept only function types, and verify that none of the other
8378 function TM attributes are also applied. */
8379 /* ??? We need to accept class types for C++, but not C. This greatly
8380 complicates this function, since we can no longer rely on the extra
8381 processing given by function_type_required. */
8383 static tree
8386 {
8387 /* Only one path adds the attribute; others don't. */
8391 {
8394 /* Only tm_callable and tm_safe apply to classes. */
8397 /* FALLTHRU */
8401 {
8404 ;
8407 else
8409 }
8413 {
8416 {
8421 }
8422 }
8423 /* FALLTHRU */
8426 /* If a function is next, pass it on to be tried next. */
8430 ignored:
8433 }
8436 }
8438 /* Handle the TM_WRAP attribute; arguments as in
8439 struct attribute_spec.handler. */
8441 static tree
8444 {
8447 /* We don't need the attribute even on success, since we
8448 record the entry in an external table. */
8453 else
8454 {
8460 else
8461 {
8465 {
8469 else
8471 }
8472 else
8474 }
8475 }
8478 }
8480 /* Ignore the given attribute. Used when this attribute may be usefully
8481 overridden by the target, but is not used generically. */
8483 static tree
8487 {
8490 }
8492 /* Handle a "no vops" attribute; arguments as in
8493 struct attribute_spec.handler. */
8495 static tree
8499 {
8503 }
8505 /* Handle a "deprecated" attribute; arguments as in
8506 struct attribute_spec.handler. */
8508 static tree
8512 {
8520 {
8523 }
8526 {
8537 else
8539 }
8541 {
8546 }
8547 else
8551 {
8554 {
8560 }
8563 else
8565 }
8568 }
8570 /* Handle a "vector_size" attribute; arguments as in
8571 struct attribute_spec.handler. */
8573 static tree
8577 {
8587 {
8590 }
8592 /* Get the vector size (in bytes). */
8595 /* We need to provide for vector pointers, vector arrays, and
8596 functions returning vectors. For example:
8598 __attribute__((vector_size(16))) short *foo;
8600 In this case, the mode is SI, but the type being modified is
8601 HI, so we need to look further. */
8610 /* Get the mode of the type being modified. */
8621 {
8624 }
8627 {
8630 }
8633 {
8636 }
8638 /* Calculate how many units fit in the vector. */
8641 {
8644 }
8648 /* Build back pointers if needed. */
8652 }
8654 /* Handle the "nonnull" attribute. */
8655 static tree
8659 {
8663 /* If no arguments are specified, all pointer arguments should be
8664 non-null. Verify a full prototype is given so that the arguments
8665 will have the correct types when we actually check them later. */
8667 {
8669 {
8672 }
8674 }
8676 /* Argument list specified. Verify that each argument number references
8677 a pointer argument. */
8679 {
8683 {
8688 }
8691 {
8692 function_args_iterator iter;
8693 tree argument;
8697 {
8701 }
8705 {
8710 }
8713 {
8718 }
8719 }
8720 }
8723 }
8725 /* Check the argument list of a function call for null in argument slots
8726 that are marked as requiring a non-null pointer argument. The NARGS
8727 arguments are passed in the array ARGARRAY.
8728 */
8730 static void
8732 {
8733 tree a;
8741 /* See if any of the nonnull attributes has no arguments. If so,
8742 then every pointer argument is checked (in which case the check
8743 for pointer type is done in check_nonnull_arg). */
8745 do
8753 else
8754 {
8755 /* Walk the argument list. If we encounter an argument number we
8756 should check for non-null, do it. */
8758 {
8760 {
8764 }
8769 }
8770 }
8771 }
8773 /* Check that the Nth argument of a function call (counting backwards
8774 from the end) is a (pointer)0. The NARGS arguments are passed in the
8775 array ARGARRAY. */
8777 static void
8779 {
8783 {
8786 tree sentinel;
8787 function_args_iterator iter;
8788 tree t;
8790 /* Skip over the named arguments. */
8792 {
8795 len++;
8796 }
8799 {
8802 }
8804 /* The sentinel must be one of the varargs, i.e.
8805 in position >= the number of fixed arguments. */
8807 {
8811 }
8813 /* Validate the sentinel. */
8817 /* Although __null (in C++) is only an integer we allow it
8818 nevertheless, as we are guaranteed that it's exactly
8819 as wide as a pointer, and we don't want to force
8820 users to cast the NULL they have written there.
8821 We warn with -Wstrict-null-sentinel, though. */
8824 }
8825 }
8827 /* Helper for check_function_nonnull; given a list of operands which
8828 must be non-null in ARGS, determine if operand PARAM_NUM should be
8829 checked. */
8831 static bool
8833 {
8837 {
8844 }
8846 }
8848 /* Check that the function argument PARAM (which is operand number
8849 PARAM_NUM) is non-null. This is called by check_function_nonnull
8850 via check_function_arguments_recurse. */
8852 static void
8855 {
8856 /* Just skip checking the argument if it's not a pointer. This can
8857 happen if the "nonnull" attribute was given without an operand
8858 list (which means to check every pointer argument). */
8866 }
8868 /* Helper for nonnull attribute handling; fetch the operand number
8869 from the attribute argument list. */
8871 static bool
8873 {
8874 /* Verify the arg number is a constant. */
8881 }
8883 /* Handle a "nothrow" attribute; arguments as in
8884 struct attribute_spec.handler. */
8886 static tree
8889 {
8892 /* ??? TODO: Support types. */
8893 else
8894 {
8897 }
8900 }
8902 /* Handle a "cleanup" attribute; arguments as in
8903 struct attribute_spec.handler. */
8905 static tree
8908 {
8912 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8913 for global destructors in C++. This requires infrastructure that
8914 we don't have generically at the moment. It's also not a feature
8915 we'd be missing too much, since we do have attribute constructor. */
8917 {
8921 }
8923 /* Verify that the argument is a function in scope. */
8924 /* ??? We could support pointers to functions here as well, if
8925 that was considered desirable. */
8928 {
8932 }
8935 {
8939 }
8941 /* That the function has proper type is checked with the
8942 eventual call to build_function_call. */
8945 }
8947 /* Handle a "warn_unused_result" attribute. No special handling. */
8949 static tree
8953 {
8954 /* Ignore the attribute for functions not returning any value. */
8956 {
8959 }
8962 }
8964 /* Handle a "sentinel" attribute. */
8966 static tree
8969 {
8971 {
8975 }
8976 else
8977 {
8979 {
8983 }
8984 }
8987 {
8991 {
8995 }
8996 else
8997 {
8999 {
9003 }
9004 }
9005 }
9008 }
9010 /* Handle a "type_generic" attribute. */
9012 static tree
9016 {
9017 /* Ensure we have a function type. */
9020 /* Ensure we have a variadic function. */
9024 }
9026 /* Handle a "target" attribute. */
9028 static tree
9031 {
9032 /* Ensure we have a function type. */
9034 {
9037 }
9039 flags))
9043 }
9045 /* Arguments being collected for optimization. */
9050 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9051 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9052 false for #pragma GCC optimize. */
9054 bool
9056 {
9064 tree ap;
9066 /* Build up argv vector. Just in case the string is stored away, use garbage
9067 collected strings. */
9072 {
9076 {
9080 }
9083 {
9084 /* Split string into multiple substrings. */
9092 {
9099 {
9103 }
9104 else
9105 {
9108 }
9112 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9113 options. */
9115 {
9120 else
9124 }
9127 {
9130 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9131 itself is -Os, and any other switch begins with a -f. */
9137 }
9142 }
9144 }
9145 }
9155 /* Now parse the options. */
9165 /* Don't allow changing -fstrict-aliasing. */
9170 }
9172 /* For handling "optimize" attribute. arguments as in
9173 struct attribute_spec.handler. */
9175 static tree
9178 {
9179 /* Ensure we have a function type. */
9181 {
9184 }
9185 else
9186 {
9190 /* Save current options. */
9193 /* If we previously had some optimization options, use them as the
9194 default. */
9199 /* Parse options, and update the vector. */
9204 /* Restore current options. */
9206 }
9209 }
9211 /* Handle a "no_split_stack" attribute. */
9213 static tree
9218 {
9222 {
9226 }
9228 {
9232 }
9235 }
9237 /* Handle a "returns_nonnull" attribute; arguments as in
9238 struct attribute_spec.handler. */
9240 static tree
9243 {
9244 // Even without a prototype we still have a return type we can check.
9246 {
9249 }
9251 }
9253 \f
9254 /* Check for valid arguments being passed to a function with FNTYPE.
9255 There are NARGS arguments in the array ARGARRAY. */
9256 void
9258 {
9259 /* Check for null being passed in a pointer argument that must be
9260 non-null. We also need to do this if format checking is enabled. */
9265 /* Check for errors in format strings. */
9272 }
9274 /* Generic argument checking recursion routine. PARAM is the argument to
9275 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9276 once the argument is resolved. CTX is context for the callback. */
9277 void
9282 {
9286 {
9287 /* Strip coercion. */
9291 }
9294 {
9296 tree attrs;
9299 /* See if this is a call to a known internationalization function
9300 that modifies a format arg. Such a function may have multiple
9301 format_arg attributes (for example, ngettext). */
9304 attrs;
9307 {
9308 tree inner_arg;
9309 tree format_num_expr;
9312 call_expr_arg_iterator iter;
9314 /* Extract the argument number, which was previously checked
9315 to be valid. */
9324 {
9329 }
9330 }
9332 /* If we found a format_arg attribute and did a recursive check,
9333 we are done with checking this argument. Otherwise, we continue
9334 and this will be considered a non-literal. */
9337 }
9340 {
9341 /* Check both halves of the conditional expression. */
9347 }
9350 }
9352 /* Checks for a builtin function FNDECL that the number of arguments
9353 NARGS against the required number REQUIRED and issues an error if
9354 there is a mismatch. Returns true if the number of arguments is
9355 correct, otherwise false. */
9357 static bool
9359 {
9361 {
9365 }
9367 {
9371 }
9373 }
9375 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9376 Returns false if there was an error, otherwise true. */
9378 bool
9380 {
9386 {
9396 {
9398 {
9402 }
9404 }
9414 {
9421 {
9425 }
9427 }
9432 {
9437 {
9441 }
9444 {
9446 fndecl);
9448 }
9450 }
9455 {
9457 {
9460 }
9462 }
9467 }
9468 }
9470 /* Function to help qsort sort FIELD_DECLs by name order. */
9472 int
9474 {
9479 /* A nontype is "greater" than a type. */
9488 }
9491 gt_pointer_operator new_value;
9495 /* This routine compares two fields like field_decl_cmp but using the
9496 pointer operator in resort_data. */
9498 static int
9500 {
9505 /* A nontype is "greater" than a type. */
9511 {
9518 }
9520 }
9522 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9524 void
9527 gt_pointer_operator new_value,
9529 {
9534 resort_field_decl_cmp);
9535 }
9537 /* Subroutine of c_parse_error.
9538 Return the result of concatenating LHS and RHS. RHS is really
9539 a string literal, its first character is indicated by RHS_START and
9540 RHS_SIZE is its length (including the terminating NUL character).
9542 The caller is responsible for deleting the returned pointer. */
9546 {
9552 }
9554 /* Issue the error given by GMSGID, indicating that it occurred before
9555 TOKEN, which had the associated VALUE. */
9557 void
9560 {
9561 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9571 {
9576 {
9589 }
9593 else
9599 }
9621 {
9626 }
9634 {
9639 }
9640 else
9644 {
9647 }
9648 #undef catenate_messages
9649 }
9651 /* Mapping for cpp message reasons to the options that enable them. */
9653 struct reason_option_codes_t
9654 {
9657 };
9678 };
9680 /* Return the gcc option code associated with the reason for a cpp
9681 message, or 0 if none. */
9683 static int
9685 {
9689 {
9692 }
9694 }
9696 /* Callback from cpp_error for PFILE to print diagnostics from the
9697 preprocessor. The diagnostic is of type LEVEL, with REASON set
9698 to the reason code if LEVEL is represents a warning, at location
9699 LOCATION unless this is after lexing and the compiler's location
9700 should be used instead, with column number possibly overridden by
9701 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9702 the arguments. Returns true if a diagnostic was emitted, false
9703 otherwise. */
9705 bool
9709 {
9710 diagnostic_info diagnostic;
9711 diagnostic_t dlevel;
9716 {
9721 /* Fall through. */
9746 }
9759 }
9761 /* Convert a character from the host to the target execution character
9762 set. cpplib handles this, mostly. */
9764 HOST_WIDE_INT
9766 {
9767 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9768 zero-extended under -fno-signed-char. cpplib insists that characters
9769 and character constants are always unsigned. Hence we must convert
9770 back and forth. */
9778 else
9780 }
9782 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9783 references with an INDIRECT_REF of a constant at the bottom; much like the
9784 traditional rendering of offsetof as a macro. Return the folded result. */
9786 tree
9788 {
9792 {
9808 {
9811 }
9821 {
9825 }
9838 /* Check if the offset goes beyond the upper bound of the array. */
9840 {
9846 {
9850 {
9851 tree v;
9858 {
9866 }
9867 /* Don't warn if the array might be considered a poor
9868 man's flexible array member with a very permissive
9869 definition thereof. */
9873 "index %E denotes an offset "
9876 }
9877 }
9878 }
9885 /* Handle static members of volatile structs. */
9892 }
9895 }
9897 /* Likewise, but convert it to the return type of offsetof. */
9899 tree
9901 {
9903 }
9905 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9906 expression, because B will always be true. */
9908 void
9910 {
9913 "the omitted middle operand in ?: will always be %<true%>, "
9915 }
9917 /* Give an error for storing into ARG, which is 'const'. USE indicates
9918 how ARG was being used. */
9920 void
9922 {
9925 /* Using this macro rather than (for example) arrays of messages
9926 ensures that all the format strings are checked at compile
9927 time. */
9928 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9929 : (use == lv_increment ? (I) \
9930 : (use == lv_decrement ? (D) : (AS))))
9932 {
9943 else
9949 }
9955 arg);
9961 arg);
9963 {
9973 arg);
9974 }
9980 arg);
9981 else
9986 arg);
9987 }
9989 /* Print an error message for an invalid lvalue. USE says
9990 how the lvalue is being used and so selects the error message. LOC
9991 is the location for the error. */
9993 void
9995 {
9997 {
10015 }
10016 }
10018 /* Print an error message for an invalid indirection of type TYPE.
10019 ERRSTRING is the name of the operator for the indirection. */
10021 void
10023 {
10025 {
10033 type);
10038 type);
10043 type);
10048 type);
10053 type);
10057 }
10058 }
10059 \f
10060 /* *PTYPE is an incomplete array. Complete it with a domain based on
10061 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10062 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10063 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10065 int
10067 {
10075 {
10077 {
10078 int eltsize
10081 }
10083 {
10087 {
10091 }
10092 else
10093 {
10094 tree curindex;
10105 {
10109 else
10110 {
10112 {
10113 /* Since we treat size types now as ordinary
10114 unsigned types, we need an explicit overflow
10115 check. */
10119 }
10121 size_one_node);
10122 }
10125 }
10127 {
10131 }
10132 }
10133 }
10134 else
10135 {
10136 /* Make an error message unless that happened already. */
10139 }
10140 }
10141 else
10142 {
10146 }
10149 /* Force an indefinite layout factor. */
10156 else
10159 /* Using build_distinct_type_copy and modifying things afterward instead
10160 of using build_array_type to create a new type preserves all of the
10161 TYPE_LANG_FLAG_? bits that the front end may have set. */
10169 /* Make sure we have the canonical MAIN_TYPE. */
10172 hashcode);
10175 /* Fix the canonical type. */
10185 else
10190 else
10196 {
10198 /* If we proceed with the array type as it is, we'll eventually
10199 crash in tree_to_[su]hwi(). */
10201 }
10205 }
10207 /* Like c_mark_addressable but don't check register qualifier. */
10208 void
10210 {
10216 }
10219 \f
10220 /* Used to help initialize the builtin-types.def table. When a type of
10221 the correct size doesn't exist, use error_mark_node instead of NULL.
10222 The later results in segfaults even when a decl using the type doesn't
10223 get invoked. */
10225 tree
10227 {
10230 }
10232 /* A helper function for resolve_overloaded_builtin in resolving the
10233 overloaded __sync_ builtins. Returns a positive power of 2 if the
10234 first operand of PARAMS is a pointer to a supported data type.
10235 Returns 0 if an error is encountered. */
10237 static int
10239 {
10240 tree type;
10244 {
10247 }
10261 incompatible:
10264 }
10266 /* A helper function for resolve_overloaded_builtin. Adds casts to
10267 PARAMS to make arguments match up with those of FUNCTION. Drops
10268 the variadic arguments at the end. Returns false if some error
10269 was encountered; true on success. */
10271 static bool
10274 {
10275 function_args_iterator iter;
10276 tree ptype;
10280 /* We've declared the implementation functions to use "volatile void *"
10281 as the pointer parameter, so we shouldn't get any complaints from the
10282 call to check_function_arguments what ever type the user used. */
10287 /* For the rest of the values, we need to cast these to FTYPE, so that we
10288 don't get warnings for passing pointer types, etc. */
10291 {
10295 /* XXX void_type_node belies the abstraction. */
10301 {
10304 }
10306 /* Only convert parameters if arg_type is unsigned integer type with
10307 new format sync routines, i.e. don't attempt to convert pointer
10308 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10309 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10310 kinds). */
10312 {
10313 /* Ideally for the first conversion we'd use convert_for_assignment
10314 so that we get warnings for anything that doesn't match the pointer
10315 type. This isn't portable across the C and C++ front ends atm. */
10320 }
10323 }
10325 /* __atomic routines are not variadic. */
10327 {
10330 }
10332 /* The definition of these primitives is variadic, with the remaining
10333 being "an optional list of variables protected by the memory barrier".
10334 No clue what that's supposed to mean, precisely, but we consider all
10335 call-clobbered variables to be protected so we're safe. */
10339 }
10341 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10342 RESULT to make it match the type of the first pointer argument in
10343 PARAMS. */
10345 static tree
10347 {
10352 /* New format doesn't require casting unless the types are the same size. */
10355 else
10357 }
10359 /* This function verifies the PARAMS to generic atomic FUNCTION.
10360 It returns the size if all the parameters are the same size, otherwise
10361 0 is returned if the parameters are invalid. */
10363 static int
10366 {
10371 tree type_0;
10373 /* Determine the parameter makeup. */
10375 {
10391 }
10394 {
10397 }
10399 /* Get type of first parameter, and determine its size. */
10402 {
10404 function);
10406 }
10408 /* Types must be compile time constant sizes. */
10410 {
10413 function);
10415 }
10419 /* Zero size objects are not allowed. */
10421 {
10424 function);
10426 }
10428 /* Check each other parameter is a pointer and the same size. */
10430 {
10433 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10437 {
10439 function);
10441 }
10444 {
10446 function);
10448 }
10449 }
10451 /* Check memory model parameters for validity. */
10453 {
10456 {
10459 {
10462 function);
10463 }
10464 }
10465 else
10467 {
10469 function);
10471 }
10472 }
10475 }
10478 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10479 at the beginning of the parameter list PARAMS representing the size of the
10480 objects. This is to match the library ABI requirement. LOC is the location
10481 of the function call.
10482 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10483 returned to allow the external call to be constructed. */
10485 static tree
10488 {
10489 tree size_node;
10491 /* Insert a SIZE_T parameter as the first param. If there isn't
10492 enough space, allocate a new vector and recursively re-build with that. */
10494 {
10497 tree f;
10506 }
10508 /* Add the size parameter and leave as a function call for processing. */
10512 }
10515 /* Return whether atomic operations for naturally aligned N-byte
10516 arguments are supported, whether inline or through libatomic. */
10517 static bool
10519 {
10521 {
10533 }
10534 }
10536 /* This will process an __atomic_exchange function call, determine whether it
10537 needs to be mapped to the _N variation, or turned into a library call.
10538 LOC is the location of the builtin call.
10539 FUNCTION is the DECL that has been invoked;
10540 PARAMS is the argument list for the call. The return value is non-null
10541 TRUE is returned if it is translated into the proper format for a call to the
10542 external library, and NEW_RETURN is set the tree for that function.
10543 FALSE is returned if processing for the _N variation is required, and
10544 NEW_RETURN is set to the the return value the result is copied into. */
10545 static bool
10548 {
10553 /* Size of 0 is an error condition. */
10555 {
10558 }
10560 /* If not a lock-free size, change to the library generic format. */
10562 {
10565 }
10567 /* Otherwise there is a lockfree match, transform the call from:
10568 void fn(T* mem, T* desired, T* return, model)
10569 into
10570 *return = (T) (fn (In* mem, (In) *desired, model)) */
10577 /* Create pointer to appropriate size. */
10581 /* Convert object pointer to required type. */
10584 /* Convert new value to required type, and dereference it. */
10589 /* Move memory model to the 3rd position, and end param list. */
10593 /* Convert return pointer and dereference it for later assignment. */
10597 }
10600 /* This will process an __atomic_compare_exchange function call, determine
10601 whether it needs to be mapped to the _N variation, or turned into a lib 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. */
10609 static bool
10613 {
10618 /* Size of 0 is an error condition. */
10620 {
10623 }
10625 /* If not a lock-free size, change to the library generic format. */
10627 {
10628 /* The library generic format does not have the weak parameter, so
10629 remove it from the param list. Since a parameter has been removed,
10630 we can be sure that there is room for the SIZE_T parameter, meaning
10631 there will not be a recursive rebuilding of the parameter list, so
10632 there is no danger this will be done twice. */
10634 {
10638 }
10641 }
10643 /* Otherwise, there is a match, so the call needs to be transformed from:
10644 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10645 into
10646 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10652 /* Create pointer to appropriate size. */
10656 /* Convert object pointer to required type. */
10660 /* Convert expected pointer to required type. */
10664 /* Convert desired value to required type, and dereference it. */
10669 /* The rest of the parameters are fine. NULL means no special return value
10670 processing.*/
10673 }
10676 /* This will process an __atomic_load function call, determine whether it
10677 needs to be mapped to the _N variation, or turned into a library call.
10678 LOC is the location of the builtin call.
10679 FUNCTION is the DECL that has been invoked;
10680 PARAMS is the argument list for the call. The return value is non-null
10681 TRUE is returned if it is translated into the proper format for a call to the
10682 external library, and NEW_RETURN is set the tree for that function.
10683 FALSE is returned if processing for the _N variation is required, and
10684 NEW_RETURN is set to the the return value the result is copied into. */
10686 static bool
10689 {
10694 /* Size of 0 is an error condition. */
10696 {
10699 }
10701 /* If not a lock-free size, change to the library generic format. */
10703 {
10706 }
10708 /* Otherwise, there is a match, so the call needs to be transformed from:
10709 void fn(T* mem, T* return, model)
10710 into
10711 *return = (T) (fn ((In *) mem, model)) */
10717 /* Create pointer to appropriate size. */
10721 /* Convert object pointer to required type. */
10725 /* Move memory model to the 2nd position, and end param list. */
10729 /* Convert return pointer and dereference it for later assignment. */
10733 }
10736 /* This will process an __atomic_store function call, determine whether it
10737 needs to be mapped to the _N variation, or turned into a library call.
10738 LOC is the location of the builtin call.
10739 FUNCTION is the DECL that has been invoked;
10740 PARAMS is the argument list for the call. The return value is non-null
10741 TRUE is returned if it is translated into the proper format for a call to the
10742 external library, and NEW_RETURN is set the tree for that function.
10743 FALSE is returned if processing for the _N variation is required, and
10744 NEW_RETURN is set to the the return value the result is copied into. */
10746 static bool
10749 {
10754 /* Size of 0 is an error condition. */
10756 {
10759 }
10761 /* If not a lock-free size, change to the library generic format. */
10763 {
10766 }
10768 /* Otherwise, there is a match, so the call needs to be transformed from:
10769 void fn(T* mem, T* value, model)
10770 into
10771 fn ((In *) mem, (In) *value, model) */
10776 /* Create pointer to appropriate size. */
10780 /* Convert object pointer to required type. */
10784 /* Convert new value to required type, and dereference it. */
10789 /* The memory model is in the right spot already. Return is void. */
10793 }
10796 /* Some builtin functions are placeholders for other expressions. This
10797 function should be called immediately after parsing the call expression
10798 before surrounding code has committed to the type of the expression.
10800 LOC is the location of the builtin call.
10802 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10803 PARAMS is the argument list for the call. The return value is non-null
10804 when expansion is complete, and null if normal processing should
10805 continue. */
10807 tree
10810 {
10816 {
10822 else
10826 }
10828 /* Handle BUILT_IN_NORMAL here. */
10830 {
10835 {
10836 /* Handle these 4 together so that they can fall through to the next
10837 case if the call is transformed to an _N variant. */
10839 {
10841 {
10845 /* Change to the _N variant. */
10848 }
10851 {
10853 params,
10856 /* Change to the _N variant. */
10859 }
10861 {
10865 /* Change to the _N variant. */
10868 }
10870 {
10874 /* Change to the _N variant. */
10877 }
10880 }
10881 /* Fallthrough to the normal processing. */
10882 }
10899 {
10901 /* Fallthru for parameter processing. */
10902 }
10919 {
10930 orig_format))
10942 /* If new_return is set, assign function to that expr and cast the
10943 result to void since the generic interface returned void. */
10945 {
10946 /* Cast function result from I{1,2,4,8,16} to the required type. */
10949 result);
10953 }
10955 }
10959 }
10960 }
10962 /* vector_types_compatible_elements_p is used in type checks of vectors
10963 values used as operands of binary operators. Where it returns true, and
10964 the other checks of the caller succeed (being vector types in he first
10965 place, and matching number of elements), we can just treat the types
10966 as essentially the same.
10967 Contrast with vector_targets_convertible_p, which is used for vector
10968 pointer types, and vector_types_convertible_p, which will allow
10969 language-specific matches under the control of flag_lax_vector_conversions,
10970 and might still require a conversion. */
10971 /* True if vector types T1 and T2 can be inputs to the same binary
10972 operator without conversion.
10973 We don't check the overall vector size here because some of our callers
10974 want to give different error messages when the vectors are compatible
10975 except for the element count. */
10977 bool
10979 {
10992 /* Equality works here because c_common_signed_type uses
10993 TYPE_MAIN_VARIANT. */
11001 }
11003 /* Check for missing format attributes on function pointers. LTYPE is
11004 the new type or left-hand side type. RTYPE is the old type or
11005 right-hand side type. Returns TRUE if LTYPE is missing the desired
11006 attribute. */
11008 bool
11010 {
11012 tree ra;
11018 {
11019 tree la;
11024 }
11025 else
11027 }
11029 /* Subscripting with type char is likely to lose on a machine where
11030 chars are signed. So warn on any machine, but optionally. Don't
11031 warn for unsigned char since that type is safe. Don't warn for
11032 signed char because anyone who uses that must have done so
11033 deliberately. Furthermore, we reduce the false positive load by
11034 warning only for non-constant value of type char. */
11036 void
11038 {
11042 }
11044 /* Implement -Wparentheses for the unexpected C precedence rules, to
11045 cover cases like x + y << z which readers are likely to
11046 misinterpret. We have seen an expression in which CODE is a binary
11047 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11048 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11049 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11050 expression was not formed using a binary or unary operator, or it
11051 was enclosed in parentheses. */
11053 void
11057 {
11061 /* This macro tests that the expression ARG with original tree code
11062 CODE appears to be a boolean expression. or the result of folding a
11063 boolean expression. */
11064 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11065 (truth_value_p (TREE_CODE (ARG)) \
11066 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11068 || ((CODE) != INTEGER_CST \
11069 && (integer_onep (ARG) || integer_zerop (ARG))))
11072 {
11121 /* Check cases like x|y==z */
11128 /* Check cases like !x | y */
11132 "suggest parentheses around operand of "
11145 /* Check cases like x^y==z */
11167 /* Check cases like x&y==z */
11174 /* Check cases like !x & y */
11178 "suggest parentheses around operand of "
11201 {
11206 "comparisons like %<X<=Y<=Z%> do not "
11212 "comparisons like %<X<=Y<=Z%> do not "
11214 }
11216 }
11217 #undef NOT_A_BOOLEAN_EXPR_P
11218 }
11220 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11222 void
11224 {
11226 {
11229 else
11231 }
11232 }
11234 /* Warn for division by zero according to the value of DIVISOR. LOC
11235 is the location of the division operator. */
11237 void
11239 {
11240 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11241 about division by zero. Do not issue a warning if DIVISOR has a
11242 floating-point type, since we consider 0.0/0.0 a valid way of
11243 generating a NaN. */
11247 }
11249 /* Subroutine of build_binary_op. Give warnings for comparisons
11250 between signed and unsigned quantities that may fail. Do the
11251 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11252 so that casts will be considered, but default promotions won't
11253 be.
11255 LOCATION is the location of the comparison operator.
11257 The arguments of this function map directly to local variables
11258 of build_binary_op. */
11260 void
11265 {
11270 /* In C++, check for comparison of different enum types. */
11276 {
11280 }
11282 /* Do not warn if the comparison is being done in a signed type,
11283 since the signed type will only be chosen if it can represent
11284 all the values of the unsigned type. */
11287 /* Do not warn if both operands are unsigned. */
11290 else
11291 {
11297 else
11305 /* Do not warn if the signed quantity is an unsuffixed integer
11306 literal (or some static constant expression involving such
11307 literals or a conditional expression involving such literals)
11308 and it is non-negative. */
11311 /* Do not warn if the comparison is an equality operation, the
11312 unsigned quantity is an integral constant, and it would fit
11313 in the result if the result were signed. */
11318 /* In C, do not warn if the unsigned quantity is an enumeration
11319 constant and its maximum value would fit in the result if the
11320 result were signed. */
11326 else
11328 OPT_Wsign_compare,
11330 }
11332 /* Warn if two unsigned values are being compared in a size larger
11333 than their original size, and one (and only one) is the result of
11334 a `~' operator. This comparison will always fail.
11336 Also warn if one operand is a constant, and the constant does not
11337 have all bits set that are set in the ~ operand when it is
11338 extended. */
11345 {
11352 {
11353 tree primop;
11359 {
11363 }
11364 else
11365 {
11369 }
11374 {
11377 {
11381 else
11384 }
11385 }
11386 }
11394 }
11395 }
11397 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11398 type via c_common_type. If -Wdouble-promotion is in use, and the
11399 conditions for warning have been met, issue a warning. GMSGID is
11400 the warning message. It must have two %T specifiers for the type
11401 that was converted (generally "float") and the type to which it was
11402 converted (generally "double), respectively. LOC is the location
11403 to which the awrning should refer. */
11405 void
11408 {
11409 tree source_type;
11413 /* If the conversion will not occur at run-time, there is no need to
11414 warn about it. */
11426 else
11429 }
11431 /* Setup a TYPE_DECL node as a typedef representation.
11433 X is a TYPE_DECL for a typedef statement. Create a brand new
11434 ..._TYPE node (which will be just a variant of the existing
11435 ..._TYPE node with identical properties) and then install X
11436 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11438 The whole point here is to end up with a situation where each
11439 and every ..._TYPE node the compiler creates will be uniquely
11440 associated with AT MOST one node representing a typedef name.
11441 This way, even though the compiler substitutes corresponding
11442 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11443 early on, later parts of the compiler can always do the reverse
11444 translation and get back the corresponding typedef name. For
11445 example, given:
11447 typedef struct S MY_TYPE;
11448 MY_TYPE object;
11450 Later parts of the compiler might only know that `object' was of
11451 type `struct S' if it were not for code just below. With this
11452 code however, later parts of the compiler see something like:
11454 struct S' == struct S
11455 typedef struct S' MY_TYPE;
11456 struct S' object;
11458 And they can then deduce (from the node for type struct S') that
11459 the original object declaration was:
11461 MY_TYPE object;
11463 Being able to do this is important for proper support of protoize,
11464 and also for generating precise symbolic debugging information
11465 which takes full account of the programmer's (typedef) vocabulary.
11467 Obviously, we don't want to generate a duplicate ..._TYPE node if
11468 the TYPE_DECL node that we are now processing really represents a
11469 standard built-in type. */
11471 void
11473 {
11477 {
11480 }
11483 {
11491 }
11492 }
11494 /* Record the types used by the current global variable declaration
11495 being parsed, so that we can decide later to emit their debug info.
11496 Those types are in types_used_by_cur_var_decl, and we are going to
11497 store them in the types_used_by_vars_hash hash table.
11498 DECL is the declaration of the global variable that has been parsed. */
11500 void
11502 {
11506 {
11509 }
11510 }
11512 /* If DECL is a typedef that is declared in the current function,
11513 record it for the purpose of -Wunused-local-typedefs. */
11515 void
11517 {
11522 /* if this is not a locally defined typedef then we are not
11523 interested. */
11530 }
11532 /* If T is a TYPE_DECL declared locally, mark it as used. */
11534 void
11536 {
11541 }
11543 /* Warn if there are some unused locally defined typedefs in the
11544 current function. */
11546 void
11548 {
11550 tree decl;
11551 /* The number of times we have emitted -Wunused-local-typedefs
11552 warnings. If this is different from errorcount, that means some
11553 unrelated errors have been issued. In which case, we'll avoid
11554 emitting "unused-local-typedefs" warnings. */
11566 {
11570 OPT_Wunused_local_typedefs,
11573 }
11576 }
11578 /* The C and C++ parsers both use vectors to hold function arguments.
11579 For efficiency, we keep a cache of unused vectors. This is the
11580 cache. */
11585 /* Return a new vector from the cache. If the cache is empty,
11586 allocate a new vector. These vectors are GC'ed, so it is OK if the
11587 pointer is not released.. */
11591 {
11594 else
11595 {
11596 /* Passing 0 to vec::alloc returns NULL, and our callers require
11597 that we always return a non-NULL value. The vector code uses
11598 4 when growing a NULL vector, so we do too. */
11602 }
11603 }
11605 /* Release a vector of trees back to the cache. */
11607 void
11609 {
11611 {
11614 }
11615 }
11617 /* Get a new tree vector holding a single tree. */
11621 {
11625 }
11627 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11631 {
11636 }
11638 /* Get a new tree vector which is a copy of an existing one. */
11642 {
11645 tree t;
11652 }
11654 /* Return true if KEYWORD starts a type specifier. */
11656 bool
11658 {
11660 {
11691 }
11692 }
11694 /* Return true if KEYWORD names a type qualifier. */
11696 bool
11698 {
11700 {
11708 }
11709 }
11711 /* Return true if KEYWORD names a storage class specifier.
11713 RID_TYPEDEF is not included in this list despite `typedef' being
11714 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11715 such for syntactic convenience only. */
11717 bool
11719 {
11721 {
11731 }
11732 }
11734 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11736 static bool
11738 {
11740 {
11748 }
11749 }
11751 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11752 declaration-specifier (C99 6.7). */
11754 bool
11756 {
11763 {
11770 }
11771 }
11773 /* Initialize language-specific-bits of tree_contains_struct. */
11775 void
11777 {
11783 }
11785 /* Build a user-defined numeric literal out of an integer constant type VALUE
11786 with identifier SUFFIX. */
11788 tree
11791 {
11798 }
11800 /* For vector[index], convert the vector to a
11801 pointer of the underlying type. */
11802 void
11805 {
11807 {
11809 tree type1;
11822 }
11823 }
11825 /* Determine which of the operands, if any, is a scalar that needs to be
11826 converted to a vector, for the range of operations. */
11827 enum stv_conv
11830 {
11839 {
11840 /* Most GENERIC binary expressions require homogeneous arguments.
11841 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11842 argument that is a vector and a second one that is a scalar, so
11843 we never return stv_secondarg for them. */
11848 {
11850 {
11855 }
11856 else
11858 }
11865 /* ... fall through ... */
11886 /* What about UNLT_EXPR? */
11888 {
11889 tree tmp;
11891 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11894 }
11898 {
11900 {
11905 }
11907 }
11909 /* Allow integer --> real conversion if safe. */
11913 {
11915 {
11920 }
11922 }
11925 }
11928 }
11930 /* Return true iff ALIGN is an integral constant that is a fundamental
11931 alignment, as defined by [basic.align] in the c++-11
11932 specifications.
11934 That is:
11936 [A fundamental alignment is represented by an alignment less than or
11937 equal to the greatest alignment supported by the implementation
11938 in all contexts, which is equal to
11939 alignof(max_align_t)]. */
11941 bool
11943 {
11946 }