| blob | 2dd8308b5fa10254a915da24fc2f59103c317b9a |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
57 /* The following symbols are subsumed in the c_global_trees array, and
58 listed here individually for documentation purposes.
60 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
62 tree short_integer_type_node;
63 tree long_integer_type_node;
64 tree long_long_integer_type_node;
65 tree int128_integer_type_node;
67 tree short_unsigned_type_node;
68 tree long_unsigned_type_node;
69 tree long_long_unsigned_type_node;
70 tree int128_unsigned_type_node;
72 tree truthvalue_type_node;
73 tree truthvalue_false_node;
74 tree truthvalue_true_node;
76 tree ptrdiff_type_node;
78 tree unsigned_char_type_node;
79 tree signed_char_type_node;
80 tree wchar_type_node;
82 tree char16_type_node;
83 tree char32_type_node;
85 tree float_type_node;
86 tree double_type_node;
87 tree long_double_type_node;
89 tree complex_integer_type_node;
90 tree complex_float_type_node;
91 tree complex_double_type_node;
92 tree complex_long_double_type_node;
94 tree dfloat32_type_node;
95 tree dfloat64_type_node;
96 tree_dfloat128_type_node;
98 tree intQI_type_node;
99 tree intHI_type_node;
100 tree intSI_type_node;
101 tree intDI_type_node;
102 tree intTI_type_node;
104 tree unsigned_intQI_type_node;
105 tree unsigned_intHI_type_node;
106 tree unsigned_intSI_type_node;
107 tree unsigned_intDI_type_node;
108 tree unsigned_intTI_type_node;
110 tree widest_integer_literal_type_node;
111 tree widest_unsigned_literal_type_node;
113 Nodes for types `void *' and `const void *'.
115 tree ptr_type_node, const_ptr_type_node;
117 Nodes for types `char *' and `const char *'.
119 tree string_type_node, const_string_type_node;
121 Type `char[SOMENUMBER]'.
122 Used when an array of char is needed and the size is irrelevant.
124 tree char_array_type_node;
126 Type `wchar_t[SOMENUMBER]' or something like it.
127 Used when a wide string literal is created.
129 tree wchar_array_type_node;
131 Type `char16_t[SOMENUMBER]' or something like it.
132 Used when a UTF-16 string literal is created.
134 tree char16_array_type_node;
136 Type `char32_t[SOMENUMBER]' or something like it.
137 Used when a UTF-32 string literal is created.
139 tree char32_array_type_node;
141 Type `int ()' -- used for implicit declaration of functions.
143 tree default_function_type;
145 A VOID_TYPE node, packaged in a TREE_LIST.
147 tree void_list_node;
149 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
150 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
151 VAR_DECLS, but C++ does.)
153 tree function_name_decl_node;
154 tree pretty_function_name_decl_node;
155 tree c99_function_name_decl_node;
157 Stack of nested function name VAR_DECLs.
159 tree saved_function_name_decls;
161 */
164 \f
165 /* Switches common to the C front ends. */
167 /* Nonzero means don't output line number information. */
171 /* Nonzero causes -E output not to be done, but directives such as
172 #define that have side effects are still obeyed. */
176 /* Nonzero means dump macros in some fashion. */
180 /* Nonzero means pass #include lines through to the output. */
184 /* Nonzero means process PCH files while preprocessing. */
188 /* The file name to which we should write a precompiled header, or
189 NULL if no header will be written in this compile. */
193 /* Nonzero if an ISO standard was selected. It rejects macros in the
194 user's namespace. */
198 /* C/ObjC language option variables. */
201 /* Nonzero means allow type mismatches in conditional expressions;
202 just make their values `void'. */
206 /* Nonzero means enable C89 Amendment 1 features. */
210 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
214 /* Nonzero means use the ISO C11 dialect of C. */
218 /* Nonzero means that we have builtin functions, and main is an int. */
223 /* ObjC language option variables. */
226 /* Tells the compiler that this is a special run. Do not perform any
227 compiling, instead we are to test some platform dependent features
228 and output a C header file with appropriate definitions. */
232 /* Tells the compiler what is the constant string class for ObjC. */
236 /* UPC language option variables. */
238 /* Nonzero whenever UPC -fupc-threads-N is asserted.
239 The value N gives the number of UPC threads to be
240 defined at compile-time. */
243 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
246 /* The implementation model for UPC threads that
247 are mapped to POSIX threads, specified at compilation
248 time by the -fupc-pthreads-model-* switch. */
249 upc_pthreads_model_kind upc_pthreads_model;
251 /* C++ language option variables. */
254 /* Nonzero means generate separate instantiation control files and
255 juggle them at link time. */
259 /* The C++ dialect being used. C++98 is the default. */
263 /* Maximum template instantiation depth. This limit exists to limit the
264 time it takes to notice excessively recursive template instantiations.
266 The default is lower than the 1024 recommended by the C++0x standard
267 because G++ runs out of stack before 1024 with highly recursive template
268 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
272 /* The elements of `ridpointers' are identifier nodes for the reserved
273 type names and storage classes. It is indexed by a RID_... value. */
278 /* Nonzero means don't warn about problems that occur when the code is
279 executed. */
282 /* Whether we are building a boolean conversion inside
283 convert_for_assignment, or some other late binary operation. If
284 build_binary_op is called for C (from code shared by C and C++) in
285 this case, then the operands have already been folded and the
286 result will not be folded again, so C_MAYBE_CONST_EXPR should not
287 be generated. */
290 /* Whether lexing has been completed, so subsequent preprocessor
291 errors should use the compiler's input_location. */
294 /* Information about how a function name is generated. */
295 struct fname_var_t
296 {
300 };
302 /* The three ways of getting then name of the current function. */
305 {
306 /* C99 compliant __func__, must be first. */
308 /* GCC __FUNCTION__ compliant. */
310 /* GCC __PRETTY_FUNCTION__ compliant. */
313 };
315 /* Global visibility options. */
407 /* Reserved words. The third field is a mask: keywords are disabled
408 if they match the mask.
410 Masks for languages:
411 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
412 C --std=c99: D_CXXONLY | D_OBJC
413 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
414 UPC is like C except that D_UPC is not set
415 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
416 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
417 ObjC++ is like C++ except that D_OBJC is not set
419 If -fno-asm is used, D_ASM is added to the mask. If
420 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
421 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
422 In C with -Wc++-compat, we warn if D_CXXWARN is set.
424 Note the complication of the D_CXX_OBJC keywords. These are
425 reserved words such as 'class'. In C++, 'class' is a reserved
426 word. In Objective-C++ it is too. In Objective-C, it is a
427 reserved word too, but only if it follows an '@' sign.
428 */
430 {
592 /* These Objective-C keywords are recognized only immediately after
593 an '@'. */
610 /* These are recognized only in protocol-qualifier context
611 (see above) */
619 /* UPC keywords */
631 /* These are recognized inside a property attribute list */
640 };
645 /* Table of machine-independent attributes common to all C-like languages. */
647 {
648 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
649 affects_type_identity } */
656 /* FIXME: logically, noreturn attributes should be listed as
657 "false, true, true" and apply to function types. But implementing this
658 would require all the places in the compiler that use TREE_THIS_VOLATILE
659 on a decl to identify non-returning functions to be located and fixed
660 to check the function type instead. */
685 /* The same comments as for noreturn attributes apply to const ones. */
709 handle_no_instrument_function_attribute,
727 /* ??? These two attributes didn't make the transition from the
728 Intel language document to the multi-vendor language document. */
733 /* For internal use (marking of builtins) only. The name contains space
734 to prevent its usage in source code. */
756 /* For internal use (marking of builtins) only. The name contains space
757 to prevent its usage in source code. */
768 handle_no_address_safety_analysis_attribute,
771 handle_no_sanitize_address_attribute,
774 handle_no_sanitize_undefined_attribute,
784 /* For internal use only. The leading '*' both prevents its usage in
785 source code and signals that it may be overridden by machine tables. */
790 /* For internal use (marking of builtins and runtime functions) only.
791 The name contains space to prevent its usage in source code. */
811 };
813 /* Give the specifications for the format attributes, used by C and all
814 descendants. */
817 {
818 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
819 affects_type_identity } */
825 };
827 /* Return identifier for address space AS. */
831 {
835 }
837 /* Push current bindings for the function name VAR_DECLS. */
839 void
841 {
846 {
850 {
852 saved);
854 }
855 }
857 /* Normally they'll have been NULL, so only push if we've got a
858 stack, or they are non-NULL. */
860 saved_function_name_decls);
861 }
863 /* Finish up the current bindings, adding them into the current function's
864 statement tree. This must be done _before_ finish_stmt_tree is called.
865 If there is no current function, we must be at file scope and no statements
866 are involved. Pop the previous bindings. */
868 void
870 {
879 {
887 }
893 {
894 /* We had saved values, restore them. */
895 tree saved;
898 {
903 }
905 }
907 }
909 /* Return the text name of the current function, suitably prettified
910 by PRETTY_P. Return string must be freed by caller. */
914 {
921 {
924 }
937 {
940 }
943 }
945 /* Return the VAR_DECL for a const char array naming the current
946 function. If the VAR_DECL has not yet been created, create it
947 now. RID indicates how it should be formatted and IDENTIFIER_NODE
948 ID is its name (unfortunately C and C++ hold the RID values of
949 keywords in different places, so we can't derive RID from ID in
950 this language independent code. LOC is the location of the
951 function. */
953 tree
955 {
965 {
966 /* If a tree is built here, it would normally have the lineno of
967 the current statement. Later this tree will be moved to the
968 beginning of the function and this line number will be wrong.
969 To avoid this problem set the lineno to 0 here; that prevents
970 it from appearing in the RTL. */
971 tree stmts;
979 saved_function_name_decls
983 }
988 }
990 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
992 tree
994 {
999 /* Compute the number of elements, for the array type. */
1001 {
1004 }
1006 {
1009 }
1011 {
1014 }
1015 else
1016 {
1019 }
1021 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1022 limit in C++98 Annex B is very large (65536) and is not normative,
1023 so we do not diagnose it (warn_overlength_strings is forced off
1024 in c_common_post_options). */
1026 {
1030 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1031 separate the %d from the 'C'. 'ISO' should not be
1032 translated, but it may be moved after 'C%d' in languages
1033 where modifiers follow nouns. */
1035 "string length %qd is greater than the length %qd "
1038 }
1040 /* Create the array type for the string constant. The ISO C++
1041 standard says that a string literal has type `const char[N]' or
1042 `const wchar_t[N]'. We use the same logic when invoked as a C
1043 front-end with -Wwrite-strings.
1044 ??? We should change the type of an expression depending on the
1045 state of a warning flag. We should just be warning -- see how
1046 this is handled in the C++ front-end for the deprecated implicit
1047 conversion from string literals to `char*' or `wchar_t*'.
1049 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1050 array type being the unqualified version of that type.
1051 Therefore, if we are constructing an array of const char, we must
1052 construct the matching unqualified array type first. The C front
1053 end does not require this, but it does no harm, so we do it
1054 unconditionally. */
1065 }
1066 \f
1067 /* If DISABLE is true, stop issuing warnings. This is used when
1068 parsing code that we know will not be executed. This function may
1069 be called multiple times, and works as a stack. */
1071 static void
1073 {
1075 {
1078 }
1079 }
1081 /* If ENABLE is true, reenable issuing warnings. */
1083 static void
1085 {
1087 {
1090 }
1091 }
1093 /* Fully fold EXPR, an expression that was not folded (beyond integer
1094 constant expressions and null pointer constants) when being built
1095 up. If IN_INIT, this is in a static initializer and certain
1096 changes are made to the folding done. Clear *MAYBE_CONST if
1097 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1098 expression because it contains an evaluated operator (in C99) or an
1099 operator outside of sizeof returning an integer constant (in C90)
1100 not permitted in constant expressions, or because it contains an
1101 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1102 set to true by callers before calling this function.) Return the
1103 folded expression. Function arguments have already been folded
1104 before calling this function, as have the contents of SAVE_EXPR,
1105 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1106 C_MAYBE_CONST_EXPR. */
1108 tree
1110 {
1111 tree ret;
1117 /* This function is not relevant to C++ because C++ folds while
1118 parsing, and may need changes to be correct for C++ when C++
1119 stops folding while parsing. */
1126 {
1129 }
1136 }
1138 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1139 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1140 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1141 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1142 both evaluated and unevaluated subexpressions while
1143 *MAYBE_CONST_ITSELF is carried from only evaluated
1144 subexpressions). */
1146 static tree
1149 {
1161 /* This function is not relevant to C++ because C++ folds while
1162 parsing, and may need changes to be correct for C++ when C++
1163 stops folding while parsing. */
1167 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1168 anything else not counted as an expression cannot usefully be
1169 folded further at this point. */
1175 /* Operands of variable-length expressions (function calls) have
1176 already been folded, as have __builtin_* function calls, and such
1177 expressions cannot occur in constant expressions. */
1179 {
1183 }
1186 {
1195 else
1198 }
1200 /* Assignment, increment, decrement, function call and comma
1201 operators, and statement expressions, cannot occur in constant
1202 expressions if evaluated / outside of sizeof. (Function calls
1203 were handled above, though VA_ARG_EXPR is treated like a function
1204 call here, and statement expressions are handled through
1205 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1207 {
1227 }
1229 /* Fold individual tree codes as appropriate. */
1231 {
1233 /* Any non-constancy will have been marked in a containing
1234 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1242 maybe_const_itself);
1247 {
1250 }
1259 maybe_const_itself);
1262 maybe_const_itself);
1268 {
1272 }
1314 /* Binary operations evaluating both arguments (increment and
1315 decrement are binary internally in GCC). */
1319 maybe_const_itself);
1327 /* The RHS of a MODIFY_EXPR was fully folded when building that
1328 expression for the sake of conversion warnings. */
1331 maybe_const_itself);
1335 ret = in_init
1338 else
1351 {
1362 }
1368 CASE_CONVERT:
1379 /* Unary operations. */
1382 maybe_const_itself);
1386 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1387 not prepared to deal with them if they occur in initializers.
1388 Avoid attempts to fold references to UPC shared components
1389 due to the complexities of UPC pointer-to-shared arithmetic. */
1398 ret = in_init
1401 else
1406 {
1410 }
1412 {
1415 CASE_CONVERT:
1416 /* Don't warn about explicit conversions. We will already
1417 have warned about suspect implicit conversions. */
1424 }
1429 /* Binary operations not necessarily evaluating both
1430 arguments. */
1437 ? truthvalue_false_node
1445 ret = in_init
1448 else
1453 && op0_const
1454 && op0_const_self
1460 && op0_const_self
1486 else
1491 && op0_const
1492 && op0_const_self
1496 && op0_const_self
1500 && op0_const
1501 && op0_const_self
1505 && op0_const_self
1511 /* Each case where an operand with excess precision may be
1512 encountered must remove the EXCESS_PRECISION_EXPR around
1513 inner operands and possibly put one around the whole
1514 expression or possibly convert to the semantic type (which
1515 c_fully_fold does); we cannot tell at this stage which is
1516 appropriate in any particular case. */
1520 /* Various codes may appear through folding built-in functions
1521 and their arguments. */
1523 }
1525 out:
1526 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1527 have been done by this point, so remove them again. */
1531 {
1535 }
1539 }
1541 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1542 return EXP. Otherwise, return either EXP or its known constant
1543 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1544 Is the BLKmode test appropriate? */
1546 tree
1548 {
1549 tree ret;
1551 /* This function is only used by C, for c_fully_fold and other
1552 optimization, and may not be correct for C++. */
1563 /* Avoid unwanted tree sharing between the initializer and current
1564 function's body where the tree can be modified e.g. by the
1565 gimplifier. */
1569 }
1571 /* Print a warning if a constant expression had overflow in folding.
1572 Invoke this function on every expression that the language
1573 requires to be a constant expression.
1574 Note the ANSI C standard says it is erroneous for a
1575 constant expression to overflow. */
1577 void
1579 {
1587 }
1589 /* The same as above but print an unconditional error. */
1590 void
1592 {
1599 }
1601 /* Print a warning if an expression had overflow in folding and its
1602 operands hadn't.
1604 Invoke this function on every expression that
1605 (1) appears in the source code, and
1606 (2) is a constant expression that overflowed, and
1607 (3) is not already checked by convert_and_check;
1608 however, do not invoke this function on operands of explicit casts
1609 or when the expression is the result of an operator and any operand
1610 already overflowed. */
1612 void
1614 {
1619 {
1648 }
1649 }
1651 /* Warn about uses of logical || / && operator in a context where it
1652 is likely that the bitwise equivalent was intended by the
1653 programmer. We have seen an expression in which CODE is a binary
1654 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1655 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1656 void
1660 {
1672 /* Warn if &&/|| are being used in a context where it is
1673 likely that the bitwise equivalent was intended by the
1674 programmer. That is, an expression such as op && MASK
1675 where op should not be any boolean expression, nor a
1676 constant, and mask seems to be a non-boolean integer constant. */
1684 {
1688 else
1693 }
1695 /* We do not warn for constants because they are typical of macro
1696 expansions that test for features. */
1700 /* This warning only makes sense with logical operands. */
1708 /* We first test whether either side separately is trivially true
1709 (with OR) or trivially false (with AND). If so, do not warn.
1710 This is a common idiom for testing ranges of data types in
1711 portable code. */
1718 /* If this is an OR operation, invert both sides; now, the result
1719 should be always false to get a warning. */
1733 /* If this is an OR operation, invert both sides; now, the result
1734 should be always false to get a warning. */
1742 /* If both expressions have the same operand, if we can merge the
1743 ranges, and if the range test is always false, then warn. */
1750 {
1753 "logical %<or%> "
1755 else
1757 "logical %<and%> "
1759 }
1760 }
1762 /* Warn about logical not used on the left hand side operand of a comparison.
1763 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1764 Do not warn if RHS is of a boolean type. */
1766 void
1768 tree rhs)
1769 {
1776 "logical not is only applied to the left hand side of "
1778 }
1780 /* Warn if EXP contains any computations whose results are not used.
1781 Return true if a warning is printed; false otherwise. LOCUS is the
1782 (potential) location of the expression. */
1784 bool
1786 {
1787 restart:
1791 /* Don't warn about void constructs. This includes casting to void,
1792 void function calls, and statement expressions with a final cast
1793 to void. */
1801 {
1817 /* For a binding, warn if no side effect within it. */
1829 /* In && or ||, warn if 2nd operand has no side effect. */
1836 /* Let people do `(foo (), 0)' without a warning. */
1843 /* If this is an expression with side effects, don't warn; this
1844 case commonly appears in macro expansions. */
1850 /* Don't warn about automatic dereferencing of references, since
1851 the user cannot control it. */
1853 {
1856 }
1857 /* Fall through. */
1860 /* Referencing a volatile value is a side effect, so don't warn. */
1865 /* If this is an expression which has no operands, there is no value
1866 to be unused. There are no such language-independent codes,
1867 but front ends may define such. */
1871 warn:
1873 }
1874 }
1877 /* Print a warning about casts that might indicate violation
1878 of strict aliasing rules if -Wstrict-aliasing is used and
1879 strict aliasing mode is in effect. OTYPE is the original
1880 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1882 bool
1884 {
1885 /* Strip pointer conversion chains and get to the correct original type. */
1893 /* If the type we are casting to is a ref-all pointer
1894 dereferencing it is always valid. */
1901 {
1902 /* Casting the address of an object to non void pointer. Warn
1903 if the cast breaks type based aliasing. */
1905 {
1909 }
1910 else
1911 {
1912 /* warn_strict_aliasing >= 3. This includes the default (3).
1913 Only warn if the cast is dereferenced immediately. */
1914 alias_set_type set1 =
1920 {
1924 }
1927 {
1931 }
1932 }
1933 }
1934 else
1936 {
1937 /* At this level, warn for any conversions, even if an address is
1938 not taken in the same statement. This will likely produce many
1939 false positives, but could be useful to pinpoint problems that
1940 are not revealed at higher levels. */
1945 {
1949 }
1950 }
1953 }
1955 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1956 sizeof as last operand of certain builtins. */
1958 void
1962 {
1966 location_t loc;
1974 {
1978 /* FALLTHRU */
1986 /* FALLTHRU */
2045 }
2073 {
2077 {
2080 "argument to %<sizeof%> in %qD call is the same "
2081 "expression as the destination; did you mean to "
2087 "argument to %<sizeof%> in %qD call is the same "
2088 "expression as the destination; did you mean to "
2090 else
2092 "argument to %<sizeof%> in %qD call is the same "
2093 "expression as the destination; did you mean to "
2096 }
2099 && !strop
2102 {
2104 "argument to %<sizeof%> in %qD call is the same "
2105 "pointer type %qT as the destination; expected %qT "
2109 }
2110 }
2113 {
2117 {
2120 "argument to %<sizeof%> in %qD call is the same "
2121 "expression as the source; did you mean to "
2127 "argument to %<sizeof%> in %qD call is the same "
2128 "expression as the source; did you mean to "
2130 else
2132 "argument to %<sizeof%> in %qD call is the same "
2133 "expression as the source; did you mean to "
2136 }
2139 && !strop
2142 {
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "pointer type %qT as the source; expected %qT "
2149 }
2150 }
2153 {
2157 {
2160 "argument to %<sizeof%> in %qD call is the same "
2161 "expression as the first source; did you mean to "
2167 "argument to %<sizeof%> in %qD call is the same "
2168 "expression as the first source; did you mean to "
2170 else
2172 "argument to %<sizeof%> in %qD call is the same "
2173 "expression as the first source; did you mean to "
2176 }
2179 && !strop
2182 {
2184 "argument to %<sizeof%> in %qD call is the same "
2185 "pointer type %qT as the first source; expected %qT "
2189 }
2190 }
2193 {
2197 {
2200 "argument to %<sizeof%> in %qD call is the same "
2201 "expression as the second source; did you mean to "
2207 "argument to %<sizeof%> in %qD call is the same "
2208 "expression as the second source; did you mean to "
2210 else
2212 "argument to %<sizeof%> in %qD call is the same "
2213 "expression as the second source; did you mean to "
2216 }
2219 && !strop
2222 {
2224 "argument to %<sizeof%> in %qD call is the same "
2225 "pointer type %qT as the second source; expected %qT "
2229 }
2230 }
2232 }
2234 /* Warn for unlikely, improbable, or stupid DECL declarations
2235 of `main'. */
2237 void
2239 {
2240 function_args_iterator iter;
2241 tree type;
2245 {
2246 /* XXX void_type_node belies the abstraction. */
2256 {
2262 }
2266 {
2288 "third argument of %q+D should probably be "
2291 }
2292 }
2294 /* It is intentional that this message does not mention the third
2295 argument because it's only mentioned in an appendix of the
2296 standard. */
2304 }
2306 /* vector_targets_convertible_p is used for vector pointer types. The
2307 callers perform various checks that the qualifiers are satisfactory,
2308 while OTOH vector_targets_convertible_p ignores the number of elements
2309 in the vectors. That's fine with vector pointers as we can consider,
2310 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2311 and that does not require and conversion of the pointer values.
2312 In contrast, vector_types_convertible_p and
2313 vector_types_compatible_elements_p are used for vector value types. */
2314 /* True if pointers to distinct types T1 and T2 can be converted to
2315 each other without an explicit cast. Only returns true for opaque
2316 vector types. */
2317 bool
2319 {
2326 }
2328 /* vector_types_convertible_p is used for vector value types.
2329 It could in principle call vector_targets_convertible_p as a subroutine,
2330 but then the check for vector type would be duplicated with its callers,
2331 and also the purpose of vector_targets_convertible_p would become
2332 muddled.
2333 Where vector_types_convertible_p returns true, a conversion might still be
2334 needed to make the types match.
2335 In contrast, vector_targets_convertible_p is used for vector pointer
2336 values, and vector_types_compatible_elements_p is used specifically
2337 in the context for binary operators, as a check if use is possible without
2338 conversion. */
2339 /* True if vector types T1 and T2 can be converted to each other
2340 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2341 can only be converted with -flax-vector-conversions yet that is not
2342 in effect, emit a note telling the user about that option if such
2343 a note has not previously been emitted. */
2344 bool
2346 {
2354 convertible_lax =
2369 {
2372 "conversions between vectors with differing "
2374 }
2377 }
2379 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2380 and have vector types, V0 has the same type as V1, and the number of
2381 elements of V0, V1, MASK is the same.
2383 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2384 called with two arguments. In this case implementation passes the
2385 first argument twice in order to share the same tree code. This fact
2386 could enable the mask-values being twice the vector length. This is
2387 an implementation accident and this semantics is not guaranteed to
2388 the user. */
2389 tree
2392 {
2393 tree ret;
2399 {
2402 }
2410 {
2415 }
2419 {
2423 }
2426 {
2431 }
2437 {
2440 "argument vector(s) and the mask vector should "
2443 }
2447 {
2452 }
2455 {
2456 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2462 else
2463 {
2466 }
2470 }
2480 }
2482 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2483 to integral type. */
2485 static tree
2487 {
2492 {
2493 /* C++0x scoped enumerations don't implicitly convert to integral
2494 type; if we stripped an explicit conversion to a larger type we
2495 need to replace it so common_type will still work. */
2499 }
2501 }
2503 /* This is a helper function of build_binary_op.
2505 For certain operations if both args were extended from the same
2506 smaller type, do the arithmetic in that type and then extend.
2508 BITWISE indicates a bitwise operation.
2509 For them, this optimization is safe only if
2510 both args are zero-extended or both are sign-extended.
2511 Otherwise, we might change the result.
2512 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2513 but calculated in (unsigned short) it would be (unsigned short)-1.
2514 */
2515 tree
2517 {
2521 tree type;
2523 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2524 excessive narrowing when we call get_narrower below. For
2525 example, suppose that OP0 is of unsigned int extended
2526 from signed char and that RESULT_TYPE is long long int.
2527 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2528 like
2530 (long long int) (unsigned int) signed_char
2532 which get_narrower would narrow down to
2534 (unsigned int) signed char
2536 If we do not cast OP0 first, get_narrower would return
2537 signed_char, which is inconsistent with the case of the
2538 explicit cast. */
2545 /* UNS is 1 if the operation to be done is an unsigned one. */
2548 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2549 but it *requires* conversion to FINAL_TYPE. */
2560 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2562 /* For bitwise operations, signedness of nominal type
2563 does not matter. Consider only how operands were extended. */
2567 /* Note that in all three cases below we refrain from optimizing
2568 an unsigned operation on sign-extended args.
2569 That would not be valid. */
2571 /* Both args variable: if both extended in same way
2572 from same width, do it in that width.
2573 Do it unsigned if args were zero-extended. */
2580 return c_common_signed_or_unsigned_type
2587 && (type
2598 && (type
2606 }
2608 /* Checks if expression EXPR of real/integer type cannot be converted
2609 to the real/integer type TYPE. Function returns non-zero when:
2610 * EXPR is a constant which cannot be exactly converted to TYPE.
2611 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2612 for EXPR type and TYPE being both integers or both real.
2613 * EXPR is not a constant of real type and TYPE is an integer.
2614 * EXPR is not a constant of integer type which cannot be
2615 exactly converted to real type.
2616 Function allows conversions between types of different signedness and
2617 can return SAFE_CONVERSION (zero) in that case. Function can produce
2618 signedness warnings if PRODUCE_WARNS is true. */
2620 enum conversion_safety
2622 {
2628 {
2629 /* Warn for real constant that is not an exact integer converted
2630 to integer type. */
2633 {
2636 }
2637 /* Warn for an integer constant that does not fit into integer type. */
2641 {
2644 {
2648 }
2650 {
2654 }
2655 else
2657 }
2659 {
2660 /* Warn for an integer constant that does not fit into real type. */
2662 {
2666 }
2667 /* Warn for a real constant that does not fit into a smaller
2668 real type. */
2671 {
2675 }
2676 }
2677 }
2678 else
2679 {
2680 /* Warn for real types converted to integer types. */
2687 {
2688 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2692 /* Don't warn for short y; short x = ((int)y & 0xff); */
2696 {
2697 /* If both args were extended from a shortest type,
2698 use that type if that is safe. */
2705 {
2711 /* If one of the operands is a non-negative constant
2712 that fits in the target type, then the type of the
2713 other operand does not matter. */
2722 /* If constant is unsigned and fits in the target
2723 type, then the result will also fit. */
2725 && unsigned0
2728 && unsigned1
2731 }
2732 }
2733 /* Warn for integer types converted to smaller integer types. */
2737 /* When they are the same width but different signedness,
2738 then the value may change. */
2741 /* Even when converted to a bigger type, if the type is
2742 unsigned but expr is signed, then negative values
2743 will be changed. */
2749 }
2751 /* Warn for integer types converted to real types if and only if
2752 all the range of values of the integer type cannot be
2753 represented by the real type. */
2756 {
2760 /* Don't warn about char y = 0xff; float x = (int) y; */
2772 }
2774 /* Warn for real types converted to smaller real types. */
2779 }
2782 }
2784 /* Warns if the conversion of EXPR to TYPE may alter a value.
2785 This is a helper function for warnings_for_convert_and_check. */
2787 static void
2789 {
2796 /* This may happen, because for LHS op= RHS we preevaluate
2797 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2798 means we could no longer see the code of the EXPR. */
2805 {
2818 /* Conversion from boolean to a signed:1 bit-field (which only
2819 can hold the values 0 and -1) doesn't lose information - but
2820 it does change the value. */
2840 {
2841 /* In case of COND_EXPR, we do not care about the type of
2842 COND_EXPR, only about the conversion of each operand. */
2849 }
2861 }
2862 }
2864 /* Produce warnings after a conversion. RESULT is the result of
2865 converting EXPR to TYPE. This is a helper function for
2866 convert_and_check and cp_convert_and_check. */
2868 void
2870 tree result)
2871 {
2878 {
2879 /* Do not diagnose overflow in a constant expression merely
2880 because a conversion overflowed. */
2885 {
2886 /* This detects cases like converting -129 or 256 to
2887 unsigned char. */
2891 else
2893 }
2897 /* No warning for converting 0x80000000 to int. */
2905 else
2907 }
2912 else
2914 }
2917 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2918 Invoke this function on every expression that is converted implicitly,
2919 i.e. because of language rules and not because of an explicit cast. */
2921 tree
2923 {
2924 tree result;
2925 tree expr_for_warning;
2927 /* Convert from a value with possible excess precision rather than
2928 via the semantic type, but do not warn about values not fitting
2929 exactly in the semantic type. */
2931 {
2937 }
2938 else
2952 }
2953 \f
2954 /* A node in a list that describes references to variables (EXPR), which are
2955 either read accesses if WRITER is zero, or write accesses, in which case
2956 WRITER is the parent of EXPR. */
2957 struct tlist
2958 {
2961 };
2963 /* Used to implement a cache the results of a call to verify_tree. We only
2964 use this for SAVE_EXPRs. */
2965 struct tlist_cache
2966 {
2970 tree expr;
2971 };
2973 /* Obstack to use when allocating tlist structures, and corresponding
2974 firstobj. */
2978 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2979 warnings. */
2981 /* SAVE_EXPRs need special treatment. We process them only once and then
2982 cache the results. */
2994 /* Create a new struct tlist and fill in its fields. */
2997 {
3004 }
3006 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3007 is nonnull, we ignore any node we find which has a writer equal to it. */
3009 static void
3011 {
3013 {
3020 }
3021 }
3023 /* Merge the nodes of ADD into TO. This merging process is done so that for
3024 each variable that already exists in TO, no new node is added; however if
3025 there is a write access recorded in ADD, and an occurrence on TO is only
3026 a read access, then the occurrence in TO will be modified to record the
3027 write. */
3029 static void
3031 {
3038 {
3045 {
3049 }
3051 {
3055 }
3057 }
3058 }
3060 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3061 references in list LIST conflict with it, excluding reads if ONLY writers
3062 is nonzero. */
3064 static void
3067 {
3070 /* Avoid duplicate warnings. */
3076 {
3080 {
3085 }
3087 }
3088 }
3090 /* Given a list LIST of references to variables, find whether any of these
3091 can cause conflicts due to missing sequence points. */
3093 static void
3095 {
3099 {
3102 }
3103 }
3105 /* Return nonzero if X is a tree that can be verified by the sequence point
3106 warnings. */
3107 static int
3109 {
3116 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3117 (lvalue_p) crash on TRY/CATCH. */
3124 /* No point to track non-const calls, they will never satisfy
3125 operand_equal_p. */
3133 }
3135 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3136 static bool
3138 {
3140 }
3142 /* Walk the tree X, and record accesses to variables. If X is written by the
3143 parent tree, WRITER is the parent.
3144 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3145 expression or its only operand forces a sequence point, then everything up
3146 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3147 in PNO_SP.
3148 Once we return, we will have emitted warnings if any subexpression before
3149 such a sequence point could be undefined. On a higher level, however, the
3150 sequence point may not be relevant, and we'll merge the two lists.
3152 Example: (b++, a) + b;
3153 The call that processes the COMPOUND_EXPR will store the increment of B
3154 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3155 processes the PLUS_EXPR will need to merge the two lists so that
3156 eventually, all accesses end up on the same list (and we'll warn about the
3157 unordered subexpressions b++ and b.
3159 A note on merging. If we modify the former example so that our expression
3160 becomes
3161 (b++, b) + a
3162 care must be taken not simply to add all three expressions into the final
3163 PNO_SP list. The function merge_tlist takes care of that by merging the
3164 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3165 way, so that no more than one access to B is recorded. */
3167 static void
3169 tree writer)
3170 {
3175 /* X may be NULL if it is the operand of an empty statement expression
3176 ({ }). */
3180 restart:
3188 {
3221 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3222 two first, to avoid warning for (a ? b++ : b++). */
3238 /* Expressions inside the LHS are not ordered wrt. the sequence points
3239 in the RHS. Example:
3240 *a = (a++, 2)
3241 Despite the fact that the modification of "a" is in the before_sp
3242 list (tmp_before), it conflicts with the use of "a" in the LHS.
3243 We can handle this by adding the contents of tmp_list3
3244 to those of tmp_before, and redoing the collision warnings for that
3245 list. */
3248 /* Exclude the LHS itself here; we first have to merge it into the
3249 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3250 didn't exclude the LHS, we'd get it twice, once as a read and once
3251 as a write. */
3262 /* We need to warn about conflicts among arguments and conflicts between
3263 args and the function address. Side effects of the function address,
3264 however, are not ordered by the sequence point of the call. */
3265 {
3266 call_expr_arg_iterator iter;
3267 tree arg;
3271 {
3276 }
3281 }
3284 /* Scan all the list, e.g. indices of multi dimensional array. */
3286 {
3292 }
3296 {
3303 {
3317 }
3321 }
3331 /* For other expressions, simply recurse on their operands.
3332 Manual tail recursion for unary expressions.
3333 Other non-expressions need not be processed. */
3335 {
3339 }
3341 {
3345 {
3350 }
3351 }
3353 }
3354 }
3356 /* Try to warn for undefined behavior in EXPR due to missing sequence
3357 points. */
3359 DEBUG_FUNCTION void
3361 {
3367 {
3370 }
3375 }
3376 \f
3377 /* Validate the expression after `case' and apply default promotions. */
3379 static tree
3381 {
3386 /* Promote char or short to int. */
3389 {
3392 }
3397 }
3398 \f
3399 /* See if the case values LOW and HIGH are in the range of the original
3400 type (i.e. before the default conversion to int) of the switch testing
3401 expression.
3402 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3403 the type before promoting it. CASE_LOW_P is a pointer to the lower
3404 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3405 if the case is not a case range.
3406 The caller has to make sure that we are not called with NULL for
3407 CASE_LOW_P (i.e. the default case).
3408 Returns true if the case label is in range of ORIG_TYPE (saturated or
3409 untouched) or false if the label is out of range. */
3411 static bool
3414 {
3419 /* If there was a problem with the original type, do nothing. */
3426 /* Case label is less than minimum for type. */
3429 {
3433 }
3435 /* Case value is greater than maximum for type. */
3438 {
3441 }
3443 /* Saturate lower case label value to minimum. */
3446 {
3450 }
3452 /* Saturate upper case label value to maximum. */
3455 {
3459 }
3467 }
3468 \f
3469 /* Return an integer type with BITS bits of precision,
3470 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3472 tree
3474 {
3513 }
3515 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3516 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3517 and saturating if SATP is nonzero, otherwise not saturating. */
3519 tree
3522 {
3526 else
3534 {
3536 "fixed-point types that have too many integral and "
3539 }
3542 }
3544 /* Used for communication between c_common_type_for_mode and
3545 c_register_builtin_type. */
3546 tree registered_builtin_types;
3548 /* Return a data type that has machine mode MODE.
3549 If the mode is an integer,
3550 then UNSIGNEDP selects between signed and unsigned types.
3551 If the mode is a fixed-point mode,
3552 then UNSIGNEDP selects between saturating and nonsaturating types. */
3554 tree
3556 {
3557 tree t;
3594 #if HOST_BITS_PER_WIDE_INT >= 64
3597 #endif
3622 {
3624 tree inner_type;
3640 }
3642 {
3647 }
3657 {
3743 }
3751 }
3753 tree
3755 {
3757 }
3759 /* Return a signed type the same as TYPE in other respects. */
3761 tree
3763 {
3765 }
3767 /* Return a type the same as TYPE except unsigned or
3768 signed according to UNSIGNEDP. */
3770 tree
3772 {
3773 tree type1;
3775 /* This block of code emulates the behavior of the old
3776 c_common_unsigned_type. In particular, it returns
3777 long_unsigned_type_node if passed a long, even when a int would
3778 have the same size. This is necessary for warnings to work
3779 correctly in archs where sizeof(int) == sizeof(long) */
3782 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3798 #if HOST_BITS_PER_WIDE_INT >= 64
3801 #endif
3811 #define C_COMMON_FIXED_TYPES(NAME) \
3812 if (type1 == short_ ## NAME ## _type_node \
3813 || type1 == unsigned_short_ ## NAME ## _type_node) \
3814 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3815 : short_ ## NAME ## _type_node; \
3816 if (type1 == NAME ## _type_node \
3817 || type1 == unsigned_ ## NAME ## _type_node) \
3818 return unsignedp ? unsigned_ ## NAME ## _type_node \
3819 : NAME ## _type_node; \
3820 if (type1 == long_ ## NAME ## _type_node \
3821 || type1 == unsigned_long_ ## NAME ## _type_node) \
3822 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3823 : long_ ## NAME ## _type_node; \
3824 if (type1 == long_long_ ## NAME ## _type_node \
3825 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3826 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3827 : long_long_ ## NAME ## _type_node;
3829 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3830 if (type1 == NAME ## _type_node \
3831 || type1 == u ## NAME ## _type_node) \
3832 return unsignedp ? u ## NAME ## _type_node \
3833 : NAME ## _type_node;
3835 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3836 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3837 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3838 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3839 : sat_ ## short_ ## NAME ## _type_node; \
3840 if (type1 == sat_ ## NAME ## _type_node \
3841 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3842 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3843 : sat_ ## NAME ## _type_node; \
3844 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3845 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3846 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3847 : sat_ ## long_ ## NAME ## _type_node; \
3848 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3849 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3850 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3851 : sat_ ## long_long_ ## NAME ## _type_node;
3853 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3854 if (type1 == sat_ ## NAME ## _type_node \
3855 || type1 == sat_ ## u ## NAME ## _type_node) \
3856 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3857 : sat_ ## NAME ## _type_node;
3883 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3884 the precision; they have precision set to match their range, but
3885 may use a wider mode to match an ABI. If we change modes, we may
3886 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3887 the precision as well, so as to yield correct results for
3888 bit-field types. C++ does not have these separate bit-field
3889 types, and producing a signed or unsigned variant of an
3890 ENUMERAL_TYPE may cause other problems as well. */
3896 #define TYPE_OK(node) \
3897 (TYPE_MODE (type) == TYPE_MODE (node) \
3898 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3917 #if HOST_BITS_PER_WIDE_INT >= 64
3920 #endif
3929 #undef TYPE_OK
3932 }
3934 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3936 tree
3938 {
3939 /* Extended integer types of the same width as a standard type have
3940 lesser rank, so those of the same width as int promote to int or
3941 unsigned int and are valid for printf formats expecting int or
3942 unsigned int. To avoid such special cases, avoid creating
3943 extended integer types for bit-fields if a standard integer type
3944 is available. */
3961 }
3963 /* The C version of the register_builtin_type langhook. */
3965 void
3967 {
3968 tree decl;
3978 }
3979 \f
3980 /* Print an error message for invalid operands to arith operation
3981 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3982 LOCATION is the location of the message. */
3984 void
3987 {
3991 {
4036 }
4040 }
4041 \f
4042 /* Given an expression as a tree, return its original type. Do this
4043 by stripping any conversion that preserves the sign and precision. */
4044 static tree
4046 {
4049 }
4051 /* Subroutine of build_binary_op, used for comparison operations.
4052 See if the operands have both been converted from subword integer types
4053 and, if so, perhaps change them both back to their original type.
4054 This function is also responsible for converting the two operands
4055 to the proper common type for comparison.
4057 The arguments of this function are all pointers to local variables
4058 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4059 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4061 LOC is the location of the comparison.
4063 If this function returns nonzero, it means that the comparison has
4064 a constant value. What this function returns is an expression for
4065 that value. */
4067 tree
4070 {
4071 tree type;
4079 /* Throw away any conversions to wider types
4080 already present in the operands. */
4085 /* If primopN is first sign-extended from primopN's precision to opN's
4086 precision, then zero-extended from opN's precision to
4087 *restype_ptr precision, shortenings might be invalid. */
4090 && !unsignedp0
4095 && !unsignedp1
4099 /* Handle the case that OP0 does not *contain* a conversion
4100 but it *requires* conversion to FINAL_TYPE. */
4107 /* If one of the operands must be floated, we cannot optimize. */
4111 /* If first arg is constant, swap the args (changing operation
4112 so value is preserved), for canonicalization. Don't do this if
4113 the second arg is 0. */
4118 {
4135 {
4150 }
4152 }
4154 /* If comparing an integer against a constant more bits wide,
4155 maybe we can deduce a value of 1 or 0 independent of the data.
4156 Or else truncate the constant now
4157 rather than extend the variable at run time.
4159 This is only interesting if the constant is the wider arg.
4160 Also, it is not safe if the constant is unsigned and the
4161 variable arg is signed, since in this case the variable
4162 would be sign-extended and then regarded as unsigned.
4163 Our technique fails in this case because the lowest/highest
4164 possible unsigned results don't follow naturally from the
4165 lowest/highest possible values of the variable operand.
4166 For just EQ_EXPR and NE_EXPR there is another technique that
4167 could be used: see if the constant can be faithfully represented
4168 in the other operand's type, by truncating it and reextending it
4169 and see if that preserves the constant's value. */
4175 {
4178 /* 1 if comparison is nominally unsigned. */
4180 tree val;
4192 {
4193 /* Convert primop1 to target type, but do not introduce
4194 additional overflow. We know primop1 is an int_cst. */
4201 }
4203 {
4206 }
4214 /* This used to be a switch, but Genix compiler can't handle that. */
4216 {
4219 }
4221 {
4224 }
4226 {
4231 }
4233 {
4238 }
4240 {
4245 }
4247 {
4252 }
4254 /* If primop0 was sign-extended and unsigned comparison specd,
4255 we did a signed comparison above using the signed type bounds.
4256 But the comparison we output must be unsigned.
4258 Also, for inequalities, VAL is no good; but if the signed
4259 comparison had *any* fixed result, it follows that the
4260 unsigned comparison just tests the sign in reverse
4261 (positive values are LE, negative ones GE).
4262 So we can generate an unsigned comparison
4263 against an extreme value of the signed type. */
4266 {
4269 {
4284 }
4286 }
4289 {
4296 }
4299 {
4300 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4304 }
4306 /* Value is not predetermined, but do the comparison
4307 in the type of the operand that is not constant.
4308 TYPE is already properly set. */
4309 }
4311 /* If either arg is decimal float and the other is float, find the
4312 proper common type to use for comparison. */
4323 /* If args' natural types are both narrower than nominal type
4324 and both extend in the same manner, compare them
4325 in the type of the wider arg.
4326 Otherwise must actually extend both to the nominal
4327 common type lest different ways of extending
4328 alter the result.
4329 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4334 {
4338 type);
4339 /* Make sure shorter operand is extended the right way
4340 to match the longer operand. */
4341 primop0
4344 primop0);
4345 primop1
4348 primop1);
4349 }
4350 else
4351 {
4352 /* Here we must do the comparison on the nominal type
4353 using the args exactly as we received them. */
4360 {
4362 /* All unsigned values are >= 0, so we warn. However,
4363 if OP0 is a constant that is >= 0, the signedness of
4364 the comparison isn't an issue, so suppress the
4365 warning. */
4370 primop0)))
4371 /* Do not warn for enumeration types. */
4375 {
4392 }
4395 {
4396 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4401 }
4402 }
4403 }
4411 }
4412 \f
4413 /* Return a tree for the sum or difference (RESULTCODE says which)
4414 of pointer PTROP and integer INTOP. */
4416 tree
4419 {
4422 /* The result is a pointer of the same type that is being added. */
4425 /* If the pointer lives in UPC shared memory, then
4426 drop the 'shared' qualifier. */
4431 {
4438 }
4440 {
4447 }
4448 else
4451 /* We are manipulating pointer values, so we don't need to warn
4452 about relying on undefined signed overflow. We disable the
4453 warning here because we use integer types so fold won't know that
4454 they are really pointers. */
4457 /* If what we are about to multiply by the size of the elements
4458 contains a constant term, apply distributive law
4459 and multiply that constant term separately.
4460 This helps produce common subexpressions. */
4465 /* If the constant comes from pointer subtraction,
4466 skip this optimization--it would cause an error. */
4468 /* If the constant is unsigned, and smaller than the pointer size,
4469 then we must skip this optimization. This is because it could cause
4470 an overflow error if the constant is negative but INTOP is not. */
4474 {
4479 /* Convert both subexpression types to the type of intop,
4480 because weird cases involving pointer arithmetic
4481 can result in a sum or difference with different type args. */
4486 }
4488 /* Convert the integer argument to a type the same size as sizetype
4489 so the multiply won't overflow spuriously. */
4495 /* Replace the integer argument with a suitable product by the object size.
4496 Do this multiplication as signed, then convert to the appropriate type
4497 for the pointer operation and disregard an overflow that occurred only
4498 because of the sign-extension change in the latter conversion. */
4499 {
4506 }
4508 /* Create the sum or difference. */
4517 }
4518 \f
4519 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4520 and if NON_CONST is known not to be permitted in an evaluated part
4521 of a constant expression. */
4523 tree
4525 {
4529 /* This should never be called for C++. */
4533 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4542 }
4544 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4545 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4546 around the SAVE_EXPR if needed so that c_fully_fold does not need
4547 to look inside SAVE_EXPRs. */
4549 tree
4551 {
4560 }
4562 /* Return whether EXPR is a declaration whose address can never be
4563 NULL. */
4565 bool
4567 {
4572 }
4574 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4575 or for an `if' or `while' statement or ?..: exp. It should already
4576 have been validated to be of suitable type; otherwise, a bad
4577 diagnostic may result.
4579 The EXPR is located at LOCATION.
4581 This preparation consists of taking the ordinary
4582 representation of an expression expr and producing a valid tree
4583 boolean expression describing whether expr is nonzero. We could
4584 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4585 but we optimize comparisons, &&, ||, and !.
4587 The resulting type should always be `truthvalue_type_node'. */
4589 tree
4591 {
4593 {
4635 ? truthvalue_true_node
4641 ? truthvalue_true_node
4646 /* Fall through. */
4649 {
4652 {
4653 /* Common Ada/Pascal programmer's mistake. */
4655 OPT_Waddress,
4657 inner);
4659 }
4661 }
4678 /* These don't change whether an object is nonzero or zero. */
4683 /* These don't change whether an object is zero or nonzero, but
4684 we can't ignore them if their second arg has side-effects. */
4686 {
4689 c_common_truthvalue_conversion
4692 }
4693 else
4698 /* Distribute the conversion into the arms of a COND_EXPR. */
4700 {
4703 /* In C++ one of the arms might have void type if it is throw. */
4711 }
4712 else
4713 {
4714 /* Folding will happen later for C. */
4722 }
4724 CASE_CONVERT:
4725 {
4729 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4730 since that affects how `default_conversion' will behave. */
4734 /* Don't strip a conversion from C++0x scoped enum, since they
4735 don't implicitly convert to other types. */
4739 /* If this isn't narrowing the argument, we can ignore it. */
4743 }
4749 {
4753 }
4758 }
4761 {
4763 expr = (build_binary_op
4767 c_common_truthvalue_conversion
4770 c_common_truthvalue_conversion
4775 }
4778 {
4783 }
4784 else
4787 ret:
4790 }
4791 \f
4800 /* Apply the TYPE_QUALS to the new DECL. */
4802 void
4804 {
4812 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4813 constructor can produce constant init, so rely on cp_finish_decl to
4814 clear TREE_READONLY if the variable has non-constant init. */
4817 {
4820 }
4822 {
4824 /* Allow 'restrict' on arrays of pointers.
4825 FIXME currently we just ignore it. */
4831 }
4833 {
4839 /* The declaration's type should have been previously defined
4840 as a UPC shared type. */
4842 }
4843 }
4845 /* Hash function for the problem of multiple type definitions in
4846 different files. This must hash all types that will compare
4847 equal via comptypes to the same value. In practice it hashes
4848 on some of the simple stuff and leaves the details to comptypes. */
4850 static hashval_t
4852 {
4856 tree t2;
4858 {
4859 /* For pointers, hash on pointee type plus some swizzling. */
4862 /* Hash on number of elements and total size. */
4881 }
4882 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4883 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4885 /* We might have a VLA here. */
4888 else
4891 }
4895 /* Return the typed-based alias set for T, which may be an expression
4896 or a type. Return -1 if we don't do anything special. */
4898 alias_set_type
4900 {
4901 tree u;
4904 /* For VLAs, use the alias set of the element type rather than the
4905 default of alias set 0 for types compared structurally. */
4907 {
4911 }
4913 /* Permit type-punning when accessing a union, provided the access
4914 is directly through the union. For example, this code does not
4915 permit taking the address of a union member and then storing
4916 through it. Even the type-punning allowed here is a GCC
4917 extension, albeit a common and useful one; the C standard says
4918 that such accesses have implementation-defined behavior. */
4926 /* That's all the expressions we handle specially. */
4930 /* The C standard guarantees that any object may be accessed via an
4931 lvalue that has character type. */
4937 /* The C standard specifically allows aliasing between signed and
4938 unsigned variants of the same type. We treat the signed
4939 variant as canonical. */
4941 {
4944 /* t1 == t can happen for boolean nodes which are always unsigned. */
4947 }
4949 /* For the time being, make UPC pointers-to-shared conflict
4950 with everything else. Ideally, UPC pointers-to-shared should
4951 only conflict with the internal type used to represent
4952 the UPC pointer-to-shared (i.e., upc_pts_rep_type_node). */
4961 /* Handle the case of multiple type nodes referring to "the same" type,
4962 which occurs with IMA. These share an alias set. FIXME: Currently only
4963 C90 is handled. (In C99 type compatibility is not transitive, which
4964 complicates things mightily. The alias set splay trees can theoretically
4965 represent this, but insertion is tricky when you consider all the
4966 different orders things might arrive in.) */
4971 /* Save time if there's only one input file. */
4975 /* Pointers need special handling if they point to any type that
4976 needs special handling (below). */
4978 {
4979 tree t2;
4980 /* Find bottom type under any nested POINTERs. */
4984 ;
4992 }
4993 /* These are the only cases that need special handling. */
5000 /* Undefined? */
5004 /* Look up t in hash table. Only one of the compatible types within each
5005 alias set is recorded in the table. */
5009 NULL);
5012 {
5015 }
5016 else
5017 /* Our caller will assign and record (in t) a new alias set; all we need
5018 to do is remember t in the hash table. */
5022 }
5023 \f
5024 /* Return the value of THREADS.
5026 UPC defines a reserved variable, THREADS, which returns the
5027 number of threads that will be created when the UPC program
5028 executes. The value of threads can be specified at runtime via
5029 the -fupc-threads=N switch, where N is an integer specifying
5030 the number of threads. When the value of THREADS is specified
5031 at compile-time, this is called the "static threads compilation
5032 environment".
5034 In the static threads compilation environment, THREADS is a
5035 pre-defined preprocessor macro with the value, N.
5037 If no value for threads is given at compile-time, then the value
5038 must be specified when the application program is executed.
5039 This method of establishing the value of THREADS is called
5040 the "dynamic threads compilation environment". */
5042 tree
5044 {
5045 tree n;
5050 {
5052 "when compiling pre-processed source, "
5053 "all -fupc-* switches must be passed on the command line, "
5054 "asserting the same values as supplied when the "
5057 }
5060 }
5062 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5063 the IS_SIZEOF parameter indicates which operator is being applied.
5064 The COMPLAIN flag controls whether we should diagnose possibly
5065 ill-formed constructs or not. LOC is the location of the SIZEOF or
5066 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5067 a type in any context should be returned, rather than the normal
5068 alignment for that type. */
5070 tree
5074 {
5082 {
5084 {
5091 }
5092 else
5093 {
5095 {
5099 else
5102 }
5104 }
5105 }
5107 {
5109 {
5116 }
5117 else
5120 }
5123 {
5128 }
5131 {
5136 }
5137 else
5138 {
5140 /* Convert in case a char is more than one unit. */
5146 else
5148 }
5153 {
5156 }
5158 /* VALUE will have the middle-end integer type sizetype.
5159 However, we should really return a value of type `size_t',
5160 which is just a typedef for an ordinary integer type. */
5164 }
5166 /* Implement the __alignof keyword: Return the minimum required
5167 alignment of EXPR, measured in bytes. For VAR_DECLs,
5168 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5169 from an "aligned" __attribute__ specification). LOC is the
5170 location of the ALIGNOF operator. */
5172 tree
5174 {
5175 tree t;
5182 {
5185 }
5191 {
5198 {
5205 }
5207 }
5208 else
5212 }
5213 \f
5214 /* Handle C and C++ default attributes. */
5216 enum built_in_attribute
5217 {
5218 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5219 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5220 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5221 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5222 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5224 #undef DEF_ATTR_NULL_TREE
5225 #undef DEF_ATTR_INT
5226 #undef DEF_ATTR_STRING
5227 #undef DEF_ATTR_IDENT
5228 #undef DEF_ATTR_TREE_LIST
5229 ATTR_LAST
5230 };
5236 enum c_builtin_type
5237 {
5238 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5239 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5240 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5241 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5242 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5243 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5244 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5245 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5246 ARG6) NAME,
5247 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5248 ARG6, ARG7) NAME,
5249 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5250 ARG6, ARG7, ARG8) NAME,
5251 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5252 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5253 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5254 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5255 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5256 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5257 NAME,
5258 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5260 #undef DEF_PRIMITIVE_TYPE
5261 #undef DEF_FUNCTION_TYPE_0
5262 #undef DEF_FUNCTION_TYPE_1
5263 #undef DEF_FUNCTION_TYPE_2
5264 #undef DEF_FUNCTION_TYPE_3
5265 #undef DEF_FUNCTION_TYPE_4
5266 #undef DEF_FUNCTION_TYPE_5
5267 #undef DEF_FUNCTION_TYPE_6
5268 #undef DEF_FUNCTION_TYPE_7
5269 #undef DEF_FUNCTION_TYPE_8
5270 #undef DEF_FUNCTION_TYPE_VAR_0
5271 #undef DEF_FUNCTION_TYPE_VAR_1
5272 #undef DEF_FUNCTION_TYPE_VAR_2
5273 #undef DEF_FUNCTION_TYPE_VAR_3
5274 #undef DEF_FUNCTION_TYPE_VAR_4
5275 #undef DEF_FUNCTION_TYPE_VAR_5
5276 #undef DEF_POINTER_TYPE
5277 BT_LAST
5278 };
5282 /* A temporary array for c_common_nodes_and_builtins. Used in
5283 communication with def_fn_type. */
5286 /* A helper function for c_common_nodes_and_builtins. Build function type
5287 for DEF with return type RET and N arguments. If VAR is true, then the
5288 function should be variadic after those N arguments.
5290 Takes special care not to ICE if any of the types involved are
5291 error_mark_node, which indicates that said type is not in fact available
5292 (see builtin_type_for_size). In which case the function type as a whole
5293 should be error_mark_node. */
5295 static void
5297 {
5298 tree t;
5305 {
5311 }
5318 else
5321 egress:
5324 }
5326 /* Build builtin functions common to both C and C++ language
5327 frontends. */
5329 static void
5331 {
5332 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5333 builtin_types[ENUM] = VALUE;
5334 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5335 def_fn_type (ENUM, RETURN, 0, 0);
5336 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5337 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5338 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5339 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5340 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5341 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5342 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5343 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5344 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5345 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5346 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5347 ARG6) \
5348 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5349 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5350 ARG6, ARG7) \
5351 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5352 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5353 ARG6, ARG7, ARG8) \
5354 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5355 ARG7, ARG8);
5356 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5357 def_fn_type (ENUM, RETURN, 1, 0);
5358 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5359 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5360 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5361 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5362 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5363 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5364 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5365 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5366 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5367 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5368 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5369 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5373 #undef DEF_PRIMITIVE_TYPE
5374 #undef DEF_FUNCTION_TYPE_0
5375 #undef DEF_FUNCTION_TYPE_1
5376 #undef DEF_FUNCTION_TYPE_2
5377 #undef DEF_FUNCTION_TYPE_3
5378 #undef DEF_FUNCTION_TYPE_4
5379 #undef DEF_FUNCTION_TYPE_5
5380 #undef DEF_FUNCTION_TYPE_6
5381 #undef DEF_FUNCTION_TYPE_7
5382 #undef DEF_FUNCTION_TYPE_8
5383 #undef DEF_FUNCTION_TYPE_VAR_0
5384 #undef DEF_FUNCTION_TYPE_VAR_1
5385 #undef DEF_FUNCTION_TYPE_VAR_2
5386 #undef DEF_FUNCTION_TYPE_VAR_3
5387 #undef DEF_FUNCTION_TYPE_VAR_4
5388 #undef DEF_FUNCTION_TYPE_VAR_5
5389 #undef DEF_POINTER_TYPE
5394 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5395 NONANSI_P, ATTRS, IMPLICIT, COND) \
5396 if (NAME && COND) \
5397 def_builtin_1 (ENUM, NAME, CLASS, \
5398 builtin_types[(int) TYPE], \
5399 builtin_types[(int) LIBTYPE], \
5400 BOTH_P, FALLBACK_P, NONANSI_P, \
5401 built_in_attributes[(int) ATTRS], IMPLICIT);
5403 #undef DEF_BUILTIN
5411 }
5413 /* Like get_identifier, but avoid warnings about null arguments when
5414 the argument may be NULL for targets where GCC lacks stdint.h type
5415 information. */
5419 {
5421 }
5423 /* Build tree nodes and builtin functions common to both C and C++ language
5424 frontends. */
5426 void
5428 {
5432 tree array_domain_type;
5433 tree va_list_ref_type_node;
5434 tree va_list_arg_type_node;
5438 /* Define `int' and `char' first so that dbx will output them first. */
5442 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5443 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5444 but not C. Are the conditionals here needed? */
5450 long_unsigned_type_node);
5452 {
5454 int128_integer_type_node);
5456 int128_unsigned_type_node);
5457 }
5461 long_long_integer_type_node);
5463 long_long_unsigned_type_node);
5466 long_long_unsigned_type_node);
5469 short_unsigned_type_node);
5472 short_unsigned_type_node);
5474 /* Define both `signed char' and `unsigned char'. */
5478 /* These are types that c_common_type_for_size and
5479 c_common_type_for_mode use. */
5482 intQI_type_node));
5485 intHI_type_node));
5488 intSI_type_node));
5491 intDI_type_node));
5492 #if HOST_BITS_PER_WIDE_INT >= 64
5495 TYPE_DECL,
5497 intTI_type_node));
5498 #endif
5501 unsigned_intQI_type_node));
5504 unsigned_intHI_type_node));
5507 unsigned_intSI_type_node));
5510 unsigned_intDI_type_node));
5511 #if HOST_BITS_PER_WIDE_INT >= 64
5514 TYPE_DECL,
5516 unsigned_intTI_type_node));
5517 #endif
5519 /* Create the widest literal types. */
5520 widest_integer_literal_type_node
5524 widest_integer_literal_type_node));
5526 widest_unsigned_literal_type_node
5530 widest_unsigned_literal_type_node));
5534 pid_type_node =
5541 /* Only supported decimal floating point extension if the target
5542 actually supports underlying modes. */
5546 {
5550 }
5553 {
5558 long_long_fract_type_node);
5560 unsigned_short_fract_type_node);
5562 unsigned_fract_type_node);
5564 unsigned_long_fract_type_node);
5566 unsigned_long_long_fract_type_node);
5568 sat_short_fract_type_node);
5571 sat_long_fract_type_node);
5573 sat_long_long_fract_type_node);
5575 sat_unsigned_short_fract_type_node);
5577 sat_unsigned_fract_type_node);
5579 sat_unsigned_long_fract_type_node);
5581 sat_unsigned_long_long_fract_type_node);
5586 long_long_accum_type_node);
5588 unsigned_short_accum_type_node);
5590 unsigned_accum_type_node);
5592 unsigned_long_accum_type_node);
5594 unsigned_long_long_accum_type_node);
5596 sat_short_accum_type_node);
5599 sat_long_accum_type_node);
5601 sat_long_long_accum_type_node);
5603 sat_unsigned_short_accum_type_node);
5605 sat_unsigned_accum_type_node);
5607 sat_unsigned_long_accum_type_node);
5609 sat_unsigned_long_long_accum_type_node);
5611 }
5614 TYPE_DECL,
5616 complex_integer_type_node));
5618 TYPE_DECL,
5620 complex_float_type_node));
5622 TYPE_DECL,
5624 complex_double_type_node));
5628 complex_long_double_type_node));
5631 /* For C++, make fileptr_type_node a distinct void * type until
5632 FILE type is defined. */
5637 /* Set the TYPE_NAME for any variants that were built before
5638 record_builtin_type gave names to the built-in types. */
5639 {
5645 }
5649 /* Make a type to be the domain of a few array types
5650 whose domains don't really matter.
5651 200 is small enough that it always fits in size_t
5652 and large enough that it can hold most function names for the
5653 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5656 /* Make a type for arrays of characters.
5657 With luck nothing will ever really depend on the length of this
5658 array type. */
5659 char_array_type_node
5663 const_string_type_node
5667 /* This is special for C++ so functions can be overloaded. */
5673 {
5676 else
5679 }
5681 /* This is for wide string constants. */
5682 wchar_array_type_node
5685 /* Define 'char16_t'. */
5690 {
5695 }
5697 /* This is for UTF-16 string constants. */
5698 char16_array_type_node
5701 /* Define 'char32_t'. */
5706 {
5711 }
5713 /* This is for UTF-32 string constants. */
5714 char32_array_type_node
5717 wint_type_node =
5720 intmax_type_node =
5722 uintmax_type_node =
5726 sig_atomic_type_node =
5729 int8_type_node =
5732 int16_type_node =
5735 int32_type_node =
5738 int64_type_node =
5741 uint8_type_node =
5753 int_least8_type_node =
5756 int_least16_type_node =
5759 int_least32_type_node =
5762 int_least64_type_node =
5765 uint_least8_type_node =
5768 uint_least16_type_node =
5771 uint_least32_type_node =
5774 uint_least64_type_node =
5777 int_fast8_type_node =
5780 int_fast16_type_node =
5783 int_fast32_type_node =
5786 int_fast64_type_node =
5789 uint_fast8_type_node =
5792 uint_fast16_type_node =
5795 uint_fast32_type_node =
5798 uint_fast64_type_node =
5801 intptr_type_node =
5804 uintptr_type_node =
5807 default_function_type
5809 ptrdiff_type_node
5816 va_list_type_node));
5818 {
5821 tree ptype;
5824 {
5828 ptype));
5830 }
5831 }
5834 {
5837 }
5838 else
5839 {
5842 }
5849 /* Create the built-in __null node. It is important that this is
5850 not shared. */
5854 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5856 }
5858 /* The number of named compound-literals generated thus far. */
5861 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5863 void
5865 {
5868 compound_literal_number);
5869 compound_literal_number++;
5871 }
5873 tree
5875 {
5879 }
5882 /* Linked list of disabled built-in functions. */
5885 {
5893 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5894 begins with "__builtin_", give an error. */
5896 void
5898 {
5901 else
5902 {
5907 }
5908 }
5911 /* Return true if the built-in function NAME has been disabled, false
5912 otherwise. */
5914 static bool
5916 {
5919 {
5922 }
5924 }
5927 /* Worker for DEF_BUILTIN.
5928 Possibly define a builtin function with one or two names.
5929 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5930 nonansi_p and flag_no_nonansi_builtin. */
5932 static void
5939 {
5940 tree decl;
5953 fnattrs);
5962 }
5963 \f
5964 /* Nonzero if the type T promotes to int. This is (nearly) the
5965 integral promotions defined in ISO C99 6.3.1.1/2. */
5967 bool
5969 {
5971 {
5981 /* ??? Technically all enumerations not larger than an int
5982 promote to an int. But this is used along code paths
5983 that only want to notice a size change. */
5991 }
5992 }
5994 /* Return 1 if PARMS specifies a fixed number of parameters
5995 and none of their types is affected by default promotions. */
5997 int
5999 {
6000 const_tree t;
6002 {
6019 }
6021 }
6023 /* Recursively remove any '*' or '&' operator from TYPE. */
6024 tree
6026 {
6030 }
6032 /* Recursively remove pointer or array type from TYPE. */
6033 tree
6035 {
6039 }
6041 /* Used to compare case labels. K1 and K2 are actually tree nodes
6042 representing case labels, or NULL_TREE for a `default' label.
6043 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6044 K2, and 0 if K1 and K2 are equal. */
6046 int
6048 {
6049 /* Consider a NULL key (such as arises with a `default' label) to be
6050 smaller than anything else. */
6057 }
6059 /* Process a case label, located at LOC, for the range LOW_VALUE
6060 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6061 then this case label is actually a `default' label. If only
6062 HIGH_VALUE is NULL_TREE, then case label was declared using the
6063 usual C/C++ syntax, rather than the GNU case range extension.
6064 CASES is a tree containing all the case ranges processed so far;
6065 COND is the condition for the switch-statement itself. Returns the
6066 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6067 is created. */
6069 tree
6072 {
6073 tree type;
6074 tree label;
6075 tree case_label;
6076 splay_tree_node node;
6078 /* Create the LABEL_DECL itself. */
6081 /* If there was an error processing the switch condition, bail now
6082 before we get more confused. */
6090 {
6093 }
6095 /* Case ranges are a GNU extension. */
6102 {
6107 }
6109 {
6114 }
6117 {
6118 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6119 really a case range, even though it was written that way.
6120 Remove the HIGH_VALUE to simplify later processing. */
6125 }
6127 /* See if the case is in range of the type of the original testing
6128 expression. If both low_value and high_value are out of range,
6129 don't insert the case label and return NULL_TREE. */
6135 /* Look up the LOW_VALUE in the table of case labels we already
6136 have. */
6138 /* If there was not an exact match, check for overlapping ranges.
6139 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6140 that's a `default' label and the only overlap is an exact match. */
6142 {
6143 splay_tree_node low_bound;
6144 splay_tree_node high_bound;
6146 /* Even though there wasn't an exact match, there might be an
6147 overlap between this case range and another case range.
6148 Since we've (inductively) not allowed any overlapping case
6149 ranges, we simply need to find the greatest low case label
6150 that is smaller that LOW_VALUE, and the smallest low case
6151 label that is greater than LOW_VALUE. If there is an overlap
6152 it will occur in one of these two ranges. */
6158 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6159 the LOW_VALUE, so there is no need to check unless the
6160 LOW_BOUND is in fact itself a case range. */
6166 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6167 range is bigger than the low end of the current range, so we
6168 are only interested if the current range is a real range, and
6169 not an ordinary case label. */
6171 && high_value
6173 high_value)
6176 }
6177 /* If there was an overlap, issue an error. */
6179 {
6183 {
6187 }
6189 {
6192 }
6193 else
6194 {
6198 }
6200 }
6202 /* Add a CASE_LABEL to the statement-tree. */
6204 /* Register this case label in the splay tree. */
6211 error_out:
6212 /* Add a label so that the back-end doesn't think that the beginning of
6213 the switch is unreachable. Note that we do not add a case label, as
6214 that just leads to duplicates and thence to failure later on. */
6216 {
6219 }
6221 }
6223 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6224 Used to verify that case values match up with enumerator values. */
6226 static void
6228 {
6235 else
6242 buf);
6243 else
6248 }
6250 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6251 Used to verify that case values match up with enumerator values. */
6253 static int
6255 {
6259 /* Skip default case. */
6263 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6264 when we did our enum->case scan. Reset our scratch bit after. */
6267 else
6270 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6271 not set, that means that CASE_HIGH did not appear when we did our
6272 enum->case scan. Reset our scratch bit after. */
6274 {
6277 else
6279 }
6282 }
6284 /* Handle -Wswitch*. Called from the front end after parsing the
6285 switch construct. */
6286 /* ??? Should probably be somewhere generic, since other languages
6287 besides C and C++ would want this. At the moment, however, C/C++
6288 are the only tree-ssa languages that support enumerations at all,
6289 so the point is moot. */
6291 void
6294 {
6295 splay_tree_node default_node;
6296 splay_tree_node node;
6297 tree chain;
6307 /* From here on, we only care about about enumerated types. */
6311 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6315 /* Check the cases. Warn about case values which are not members of
6316 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6317 there is no default case, check that exactly all enumeration
6318 literals are covered by the cases. */
6320 /* Clearing COND if it is not an integer constant simplifies
6321 the tests inside the loop below. */
6325 /* The time complexity here is O(N*lg(N)) worst case, but for the
6326 common case of monotonically increasing enumerators, it is
6327 O(N), since the nature of the splay tree will keep the next
6328 element adjacent to the root at all times. */
6331 {
6337 {
6338 /* Mark the CASE_LOW part of the case entry as seen. */
6342 }
6344 /* Even though there wasn't an exact match, there might be a
6345 case range which includes the enumerator's value. */
6348 {
6352 {
6353 /* If we match the upper bound exactly, mark the CASE_HIGH
6354 part of the case entry as seen. */
6358 }
6359 }
6361 /* We've now determined that this enumerated literal isn't
6362 handled by the case labels of the switch statement. */
6364 /* If the switch expression is a constant, we only really care
6365 about whether that constant is handled by the switch. */
6369 /* If there is a default_node, the only relevant option is
6370 Wswitch-enum. Otherwise, if both are enabled then we prefer
6371 to warn using -Wswitch because -Wswitch is enabled by -Wall
6372 while -Wswitch-enum is explicit. */
6375 ? OPT_Wswitch_enum
6379 }
6381 /* Warn if there are case expressions that don't correspond to
6382 enumerators. This can occur since C and C++ don't enforce
6383 type-checking of assignments to enumeration variables.
6385 The time complexity here is now always O(N) worst case, since
6386 we should have marked both the lower bound and upper bound of
6387 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6388 above. This scan also resets those fields. */
6391 }
6393 /* Finish an expression taking the address of LABEL (an
6394 IDENTIFIER_NODE). Returns an expression for the address.
6396 LOC is the location for the expression returned. */
6398 tree
6400 {
6401 tree result;
6411 else
6412 {
6415 /* The current function is not necessarily uninlinable.
6416 Computed gotos are incompatible with inlining, but the value
6417 here could be used only in a diagnostic, for example. */
6419 }
6422 }
6423 \f
6425 /* Given a boolean expression ARG, return a tree representing an increment
6426 or decrement (as indicated by CODE) of ARG. The front end must check for
6427 invalid cases (e.g., decrement in C++). */
6428 tree
6430 {
6431 tree val;
6436 {
6459 }
6462 }
6463 \f
6464 /* Built-in macros for stddef.h and stdint.h, that require macros
6465 defined in this file. */
6466 void
6468 {
6531 }
6533 static void
6535 {
6536 /* Fill in the built_in_attributes array. */
6537 #define DEF_ATTR_NULL_TREE(ENUM) \
6538 built_in_attributes[(int) ENUM] = NULL_TREE;
6539 #define DEF_ATTR_INT(ENUM, VALUE) \
6540 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6541 #define DEF_ATTR_STRING(ENUM, VALUE) \
6542 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6543 #define DEF_ATTR_IDENT(ENUM, STRING) \
6544 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6545 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6546 built_in_attributes[(int) ENUM] \
6547 = tree_cons (built_in_attributes[(int) PURPOSE], \
6548 built_in_attributes[(int) VALUE], \
6549 built_in_attributes[(int) CHAIN]);
6551 #undef DEF_ATTR_NULL_TREE
6552 #undef DEF_ATTR_INT
6553 #undef DEF_ATTR_IDENT
6554 #undef DEF_ATTR_TREE_LIST
6555 }
6557 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6558 identifier as an argument, so the front end shouldn't look it up. */
6560 bool
6562 {
6565 /* Unknown attribute that we'll end up ignoring, return true so we
6566 don't complain about an identifier argument. */
6572 else
6574 }
6576 /* Attribute handlers common to C front ends. */
6578 /* Handle a "packed" attribute; arguments as in
6579 struct attribute_spec.handler. */
6581 static tree
6584 {
6586 {
6590 }
6592 {
6594 /* Still pack bitfields. */
6599 else
6601 }
6602 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6603 used for DECL_REGISTER. It wouldn't mean anything anyway.
6604 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6605 that changes what the typedef is typing. */
6606 else
6607 {
6610 }
6613 }
6615 /* Handle a "nocommon" attribute; arguments as in
6616 struct attribute_spec.handler. */
6618 static tree
6622 {
6625 else
6626 {
6629 }
6632 }
6634 /* Handle a "common" attribute; arguments as in
6635 struct attribute_spec.handler. */
6637 static tree
6640 {
6643 else
6644 {
6647 }
6650 }
6652 /* Handle a "noreturn" attribute; arguments as in
6653 struct attribute_spec.handler. */
6655 static tree
6658 {
6661 /* See FIXME comment in c_common_attribute_table. */
6668 = (build_qualified_type
6669 (build_pointer_type
6673 else
6674 {
6677 }
6680 }
6682 /* Handle a "hot" and attribute; arguments as in
6683 struct attribute_spec.handler. */
6685 static tree
6688 {
6691 {
6693 {
6697 }
6698 /* Most of the rest of the hot processing is done later with
6699 lookup_attribute. */
6700 }
6701 else
6702 {
6705 }
6708 }
6710 /* Handle a "cold" and attribute; arguments as in
6711 struct attribute_spec.handler. */
6713 static tree
6716 {
6719 {
6721 {
6725 }
6726 /* Most of the rest of the cold processing is done later with
6727 lookup_attribute. */
6728 }
6729 else
6730 {
6733 }
6736 }
6738 /* Handle a "no_sanitize_address" attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6744 {
6746 {
6749 }
6752 }
6754 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6755 struct attribute_spec.handler. */
6757 static tree
6760 {
6769 }
6771 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6772 struct attribute_spec.handler. */
6774 static tree
6777 {
6779 {
6782 }
6785 }
6787 /* Handle a "noinline" attribute; arguments as in
6788 struct attribute_spec.handler. */
6790 static tree
6794 {
6796 {
6798 {
6802 }
6803 else
6805 }
6806 else
6807 {
6810 }
6813 }
6815 /* Handle a "noclone" attribute; arguments as in
6816 struct attribute_spec.handler. */
6818 static tree
6822 {
6824 {
6827 }
6830 }
6832 /* Handle a "always_inline" attribute; arguments as in
6833 struct attribute_spec.handler. */
6835 static tree
6840 {
6842 {
6844 {
6848 }
6849 else
6850 /* Set the attribute and mark it for disregarding inline
6851 limits. */
6853 }
6854 else
6855 {
6858 }
6861 }
6863 /* Handle a "gnu_inline" attribute; arguments as in
6864 struct attribute_spec.handler. */
6866 static tree
6871 {
6873 {
6874 /* Do nothing else, just set the attribute. We'll get at
6875 it later with lookup_attribute. */
6876 }
6877 else
6878 {
6881 }
6884 }
6886 /* Handle a "leaf" attribute; arguments as in
6887 struct attribute_spec.handler. */
6889 static tree
6893 {
6895 {
6898 }
6900 {
6903 }
6906 }
6908 /* Handle an "artificial" attribute; arguments as in
6909 struct attribute_spec.handler. */
6911 static tree
6916 {
6918 {
6919 /* Do nothing else, just set the attribute. We'll get at
6920 it later with lookup_attribute. */
6921 }
6922 else
6923 {
6926 }
6929 }
6931 /* Handle a "flatten" attribute; arguments as in
6932 struct attribute_spec.handler. */
6934 static tree
6936 tree args ATTRIBUTE_UNUSED,
6938 {
6940 /* Do nothing else, just set the attribute. We'll get at
6941 it later with lookup_attribute. */
6942 ;
6943 else
6944 {
6947 }
6950 }
6952 /* Handle a "warning" or "error" attribute; arguments as in
6953 struct attribute_spec.handler. */
6955 static tree
6958 {
6961 /* Do nothing else, just set the attribute. We'll get at
6962 it later with lookup_attribute. */
6963 ;
6964 else
6965 {
6968 }
6971 }
6973 /* Handle a "used" attribute; arguments as in
6974 struct attribute_spec.handler. */
6976 static tree
6979 {
6985 {
6990 }
6991 else
6992 {
6995 }
6998 }
7000 /* Handle a "unused" attribute; arguments as in
7001 struct attribute_spec.handler. */
7003 static tree
7006 {
7008 {
7016 {
7021 }
7022 else
7023 {
7026 }
7027 }
7028 else
7029 {
7033 }
7036 }
7038 /* Handle a "externally_visible" attribute; arguments as in
7039 struct attribute_spec.handler. */
7041 static tree
7046 {
7050 {
7053 {
7057 }
7058 }
7059 else
7060 {
7063 }
7066 }
7068 /* Handle a "const" attribute; arguments as in
7069 struct attribute_spec.handler. */
7071 static tree
7074 {
7077 /* See FIXME comment on noreturn in c_common_attribute_table. */
7083 = (build_qualified_type
7084 (build_pointer_type
7088 else
7089 {
7092 }
7095 }
7097 /* Handle a "transparent_union" attribute; arguments as in
7098 struct attribute_spec.handler. */
7100 static tree
7104 {
7105 tree type;
7116 {
7117 /* Make sure that the first field will work for a transparent union.
7118 If the type isn't complete yet, leave the check to the code in
7119 finish_struct. */
7121 {
7127 }
7130 {
7131 /* If the type isn't complete yet, setting the flag
7132 on a variant wouldn't ever be checked. */
7136 /* build_duplicate_type doesn't work for C++. */
7140 /* A type variant isn't good enough, since we don't a cast
7141 to such a type removed as a no-op. */
7143 }
7147 }
7149 ignored:
7152 }
7154 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7155 get the requested priority for a constructor or destructor,
7156 possibly issuing diagnostics for invalid or reserved
7157 priorities. */
7159 static priority_type
7161 {
7162 HOST_WIDE_INT pri;
7163 tree arg;
7169 {
7172 else
7175 }
7192 {
7195 "destructor priorities from 0 to %d are reserved "
7197 MAX_RESERVED_INIT_PRIORITY);
7198 else
7200 "constructor priorities from 0 to %d are reserved "
7202 MAX_RESERVED_INIT_PRIORITY);
7203 }
7206 invalid:
7209 MAX_INIT_PRIORITY);
7210 else
7212 MAX_INIT_PRIORITY);
7214 }
7216 /* Handle a "constructor" attribute; arguments as in
7217 struct attribute_spec.handler. */
7219 static tree
7223 {
7230 {
7231 priority_type priority;
7236 }
7237 else
7238 {
7241 }
7244 }
7246 /* Handle a "destructor" attribute; arguments as in
7247 struct attribute_spec.handler. */
7249 static tree
7253 {
7260 {
7261 priority_type priority;
7266 }
7267 else
7268 {
7271 }
7274 }
7276 /* Nonzero if the mode is a valid vector mode for this architecture.
7277 This returns nonzero even if there is no hardware support for the
7278 vector mode, but we can emulate with narrower modes. */
7280 static int
7282 {
7286 /* Doh! What's going on? */
7295 /* Hardware support. Woo hoo! */
7301 /* We should probably return 1 if requesting V4DI and we have no DI,
7302 but we have V2DI, but this is probably very unlikely. */
7304 /* If we have support for the inner mode, we can safely emulate it.
7305 We may not have V2DI, but me can emulate with a pair of DIs. */
7307 }
7310 /* Handle a "mode" attribute; arguments as in
7311 struct attribute_spec.handler. */
7313 static tree
7316 {
7324 else
7325 {
7330 tree typefm;
7335 {
7341 }
7343 /* Change this type to have a type with the specified mode.
7344 First check for the special modes. */
7357 else
7360 {
7363 }
7366 {
7369 }
7373 {
7405 }
7407 {
7410 }
7413 {
7418 {
7421 }
7425 else
7428 }
7429 else
7430 {
7431 /* For fixed-point modes, we need to test if the signness of type
7432 and the machine mode are consistent. */
7435 {
7438 }
7439 /* For fixed-point modes, we need to pass saturating info. */
7443 }
7446 {
7449 }
7451 {
7452 /* For enumeral types, copy the precision from the integer
7453 type returned above. If not an INTEGER_TYPE, we can't use
7454 this mode for this type. */
7456 {
7459 }
7462 {
7465 }
7466 else
7467 {
7468 /* We cannot build a type variant, as there's code that assumes
7469 that TYPE_MAIN_VARIANT has the same mode. This includes the
7470 debug generators. Instead, create a subrange type. This
7471 results in all of the enumeral values being emitted only once
7472 in the original, and the subtype gets them by reference. */
7475 else
7478 }
7479 }
7483 {
7486 }
7489 }
7492 }
7494 /* Handle a "section" attribute; arguments as in
7495 struct attribute_spec.handler. */
7497 static tree
7500 {
7504 {
7510 {
7514 {
7516 "section attribute cannot be specified for "
7519 }
7521 /* The decl may have already been given a section attribute
7522 from a previous declaration. Ensure they match. */
7526 {
7530 }
7534 {
7537 }
7538 else
7541 }
7542 else
7543 {
7546 }
7547 }
7548 else
7549 {
7553 }
7556 }
7558 /* Check whether ALIGN is a valid user-specified alignment. If so,
7559 return its base-2 log; if not, output an error and return -1. If
7560 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7561 no error. */
7562 int
7564 {
7571 {
7574 }
7579 {
7582 }
7584 {
7587 }
7589 }
7591 /*
7592 If in c++-11, check if the c++-11 alignment constraint with respect
7593 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7594 c++-11 mode, does nothing.
7596 [dcl.align]2/ says:
7598 [* if the constant expression evaluates to a fundamental alignment,
7599 the alignment requirement of the declared entity shall be the
7600 specified fundamental alignment.
7602 * if the constant expression evaluates to an extended alignment
7603 and the implementation supports that alignment in the context
7604 of the declaration, the alignment of the declared entity shall
7605 be that alignment
7607 * if the constant expression evaluates to an extended alignment
7608 and the implementation does not support that alignment in the
7609 context of the declaration, the program is ill-formed]. */
7611 static bool
7615 {
7628 {
7630 {
7631 /* For file scope variables and static members, the target
7632 supports alignments that are at most
7633 MAX_OFILE_ALIGNMENT. */
7636 }
7637 else
7638 {
7639 #ifdef BIGGEST_FIELD_ALIGNMENT
7640 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7641 #else
7642 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7643 #endif
7644 /* For non-static members, the target supports either
7645 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7646 if it is defined or BIGGEST_ALIGNMENT. */
7651 #undef MAX_TARGET_FIELD_ALIGNMENT
7652 /* For stack variables, the target supports at most
7653 MAX_STACK_ALIGNMENT. */
7657 }
7658 }
7660 {
7661 /* Let's be liberal for types. */
7664 }
7672 }
7674 /* Handle a "aligned" attribute; arguments as in
7675 struct attribute_spec.handler. */
7677 static tree
7680 {
7684 tree align_expr;
7688 {
7693 }
7694 else
7698 {
7702 }
7710 {
7713 /* If we have a TYPE_DECL, then copy the type, so that we
7714 don't accidentally modify a builtin type. See pushdecl. */
7717 {
7724 }
7725 else
7730 }
7733 {
7736 }
7739 /* C++-11 [dcl.align/4]:
7741 When multiple alignment-specifiers are specified for an
7742 entity, the alignment requirement shall be set to the
7743 strictest specified alignment.
7745 This formally comes from the c++11 specification but we are
7746 doing it for the GNU attribute syntax as well. */
7750 {
7755 else
7759 }
7760 else
7761 {
7764 }
7767 }
7769 /* Handle a "weak" attribute; arguments as in
7770 struct attribute_spec.handler. */
7772 static tree
7777 {
7780 {
7783 }
7785 {
7789 }
7793 else
7797 }
7799 /* Handle an "alias" or "ifunc" attribute; arguments as in
7800 struct attribute_spec.handler, except that IS_ALIAS tells us
7801 whether this is an alias as opposed to ifunc attribute. */
7803 static tree
7806 {
7811 {
7814 }
7818 /* A static variable declaration is always a tentative definition,
7819 but the alias is a non-tentative definition which overrides. */
7822 {
7826 }
7830 {
7834 }
7836 /* Note that the very first time we process a nested declaration,
7837 decl_function_context will not be set. Indeed, *would* never
7838 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7839 we do below. After such frobbery, pushdecl would set the context.
7840 In any case, this is never what we want. */
7842 {
7843 tree id;
7847 {
7851 }
7853 /* This counts as a use of the object pointed to. */
7858 else
7862 /* ifuncs are also aliases, so set that attribute too. */
7865 }
7866 else
7867 {
7870 }
7873 }
7875 /* Handle an "alias" or "ifunc" attribute; arguments as in
7876 struct attribute_spec.handler. */
7878 static tree
7881 {
7883 }
7885 /* Handle an "alias" or "ifunc" attribute; arguments as in
7886 struct attribute_spec.handler. */
7888 static tree
7891 {
7893 }
7895 /* Handle a "weakref" attribute; arguments as in struct
7896 attribute_spec.handler. */
7898 static tree
7901 {
7904 /* We must ignore the attribute when it is associated with
7905 local-scoped decls, since attribute alias is ignored and many
7906 such symbols do not even have a DECL_WEAK field. */
7908 || current_function_decl
7910 {
7914 }
7917 {
7921 }
7923 /* The idea here is that `weakref("name")' mutates into `weakref,
7924 alias("name")', and weakref without arguments, in turn,
7925 implicitly adds weak. */
7928 {
7935 }
7936 else
7937 {
7942 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7943 and that isn't supported; and because it wants to add it to
7944 the list of weak decls, which isn't helpful. */
7946 }
7949 }
7951 /* Handle an "visibility" attribute; arguments as in
7952 struct attribute_spec.handler. */
7954 static tree
7958 {
7964 {
7968 {
7970 name);
7972 }
7974 {
7978 }
7979 }
7981 {
7984 }
7987 {
7990 }
7992 /* If this is a type, set the visibility on the type decl. */
7994 {
7999 {
8001 name);
8003 }
8004 }
8014 else
8015 {
8016 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8018 }
8022 {
8036 }
8041 /* Go ahead and attach the attribute to the node as well. This is needed
8042 so we can determine whether we have VISIBILITY_DEFAULT because the
8043 visibility was not specified, or because it was explicitly overridden
8044 from the containing scope. */
8047 }
8049 /* Determine the ELF symbol visibility for DECL, which is either a
8050 variable or a function. It is an error to use this function if a
8051 definition of DECL is not available in this translation unit.
8052 Returns true if the final visibility has been determined by this
8053 function; false if the caller is free to make additional
8054 modifications. */
8056 bool
8058 {
8062 /* If the user explicitly specified the visibility with an
8063 attribute, honor that. DECL_VISIBILITY will have been set during
8064 the processing of the attribute. We check for an explicit
8065 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8066 to distinguish the use of an attribute from the use of a "#pragma
8067 GCC visibility push(...)"; in the latter case we still want other
8068 considerations to be able to overrule the #pragma. */
8070 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8075 /* Set default visibility to whatever the user supplied with
8076 visibility_specified depending on #pragma GCC visibility. */
8078 {
8081 {
8084 /* If visibility changed and DECL already has DECL_RTL, ensure
8085 symbol flags are updated. */
8090 }
8091 }
8093 }
8095 /* Handle an "tls_model" attribute; arguments as in
8096 struct attribute_spec.handler. */
8098 static tree
8101 {
8102 tree id;
8109 {
8112 }
8117 {
8120 }
8130 else
8131 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8135 }
8137 /* Handle a "no_instrument_function" attribute; arguments as in
8138 struct attribute_spec.handler. */
8140 static tree
8145 {
8149 {
8153 }
8154 else
8158 }
8160 /* Handle a "malloc" attribute; arguments as in
8161 struct attribute_spec.handler. */
8163 static tree
8166 {
8170 else
8171 {
8174 }
8177 }
8179 /* Handle a "alloc_size" attribute; arguments as in
8180 struct attribute_spec.handler. */
8182 static tree
8185 {
8188 {
8195 || !arg_count
8197 {
8202 }
8203 }
8205 }
8207 /* Handle a "alloc_align" attribute; arguments as in
8208 struct attribute_spec.handler. */
8210 static tree
8213 {
8220 || !arg_count
8222 {
8227 }
8229 }
8231 /* Handle a "assume_aligned" attribute; arguments as in
8232 struct attribute_spec.handler. */
8234 static tree
8237 {
8239 {
8246 {
8251 }
8252 }
8254 }
8256 /* Handle a "fn spec" attribute; arguments as in
8257 struct attribute_spec.handler. */
8259 static tree
8263 {
8268 }
8270 /* Handle a "warn_unused" attribute; arguments as in
8271 struct attribute_spec.handler. */
8273 static tree
8275 tree args ATTRIBUTE_UNUSED,
8277 {
8279 /* Do nothing else, just set the attribute. We'll get at
8280 it later with lookup_attribute. */
8281 ;
8282 else
8283 {
8286 }
8289 }
8291 /* Handle an "omp declare simd" attribute; arguments as in
8292 struct attribute_spec.handler. */
8294 static tree
8296 {
8298 }
8300 /* Handle an "omp declare target" attribute; arguments as in
8301 struct attribute_spec.handler. */
8303 static tree
8305 {
8307 }
8309 /* Handle a "returns_twice" attribute; arguments as in
8310 struct attribute_spec.handler. */
8312 static tree
8315 {
8318 else
8319 {
8322 }
8325 }
8327 /* Handle a "no_limit_stack" attribute; arguments as in
8328 struct attribute_spec.handler. */
8330 static tree
8335 {
8339 {
8343 }
8345 {
8349 }
8350 else
8354 }
8356 /* Handle a "pure" attribute; arguments as in
8357 struct attribute_spec.handler. */
8359 static tree
8362 {
8365 /* ??? TODO: Support types. */
8366 else
8367 {
8370 }
8373 }
8375 /* Digest an attribute list destined for a transactional memory statement.
8376 ALLOWED is the set of attributes that are allowed for this statement;
8377 return the attribute we parsed. Multiple attributes are never allowed. */
8379 int
8381 {
8386 {
8394 {
8397 }
8400 {
8403 }
8406 else
8408 }
8411 }
8413 /* Transform a TM attribute name into a maskable integer and back.
8414 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8415 to how the lack of an attribute is treated. */
8417 int
8419 {
8433 }
8435 tree
8437 {
8440 {
8458 }
8460 }
8462 /* Return the first TM attribute seen in LIST. */
8464 tree
8466 {
8468 {
8472 }
8474 }
8476 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8477 Here we accept only function types, and verify that none of the other
8478 function TM attributes are also applied. */
8479 /* ??? We need to accept class types for C++, but not C. This greatly
8480 complicates this function, since we can no longer rely on the extra
8481 processing given by function_type_required. */
8483 static tree
8486 {
8487 /* Only one path adds the attribute; others don't. */
8491 {
8494 /* Only tm_callable and tm_safe apply to classes. */
8497 /* FALLTHRU */
8501 {
8504 ;
8507 else
8509 }
8513 {
8516 {
8521 }
8522 }
8523 /* FALLTHRU */
8526 /* If a function is next, pass it on to be tried next. */
8530 ignored:
8533 }
8536 }
8538 /* Handle the TM_WRAP attribute; arguments as in
8539 struct attribute_spec.handler. */
8541 static tree
8544 {
8547 /* We don't need the attribute even on success, since we
8548 record the entry in an external table. */
8553 else
8554 {
8557 ;
8562 else
8563 {
8567 {
8571 else
8573 }
8574 else
8576 }
8577 }
8580 }
8582 /* Ignore the given attribute. Used when this attribute may be usefully
8583 overridden by the target, but is not used generically. */
8585 static tree
8589 {
8592 }
8594 /* Handle a "no vops" attribute; arguments as in
8595 struct attribute_spec.handler. */
8597 static tree
8601 {
8605 }
8607 /* Handle a "deprecated" attribute; arguments as in
8608 struct attribute_spec.handler. */
8610 static tree
8614 {
8622 {
8625 }
8628 {
8639 else
8641 }
8643 {
8648 }
8649 else
8653 {
8656 {
8662 }
8665 else
8667 }
8670 }
8672 /* Handle a "vector_size" attribute; arguments as in
8673 struct attribute_spec.handler. */
8675 static tree
8679 {
8692 {
8695 }
8697 /* Get the vector size (in bytes). */
8700 /* We need to provide for vector pointers, vector arrays, and
8701 functions returning vectors. For example:
8703 __attribute__((vector_size(16))) short *foo;
8705 In this case, the mode is SI, but the type being modified is
8706 HI, so we need to look further. */
8715 /* Get the mode of the type being modified. */
8726 {
8729 }
8732 {
8735 }
8738 {
8741 }
8743 /* Calculate how many units fit in the vector. */
8746 {
8749 }
8753 /* Build back pointers if needed. */
8757 }
8759 /* Handle the "nonnull" attribute. */
8760 static tree
8764 {
8768 /* If no arguments are specified, all pointer arguments should be
8769 non-null. Verify a full prototype is given so that the arguments
8770 will have the correct types when we actually check them later. */
8772 {
8774 {
8777 }
8779 }
8781 /* Argument list specified. Verify that each argument number references
8782 a pointer argument. */
8784 {
8793 {
8798 }
8801 {
8802 function_args_iterator iter;
8803 tree argument;
8807 {
8811 }
8815 {
8820 }
8823 {
8828 }
8829 }
8830 }
8833 }
8835 /* Check the argument list of a function call for null in argument slots
8836 that are marked as requiring a non-null pointer argument. The NARGS
8837 arguments are passed in the array ARGARRAY.
8838 */
8840 static void
8842 {
8843 tree a;
8851 /* See if any of the nonnull attributes has no arguments. If so,
8852 then every pointer argument is checked (in which case the check
8853 for pointer type is done in check_nonnull_arg). */
8855 do
8863 else
8864 {
8865 /* Walk the argument list. If we encounter an argument number we
8866 should check for non-null, do it. */
8868 {
8870 {
8874 }
8879 }
8880 }
8881 }
8883 /* Check that the Nth argument of a function call (counting backwards
8884 from the end) is a (pointer)0. The NARGS arguments are passed in the
8885 array ARGARRAY. */
8887 static void
8889 {
8893 {
8896 tree sentinel;
8897 function_args_iterator iter;
8898 tree t;
8900 /* Skip over the named arguments. */
8902 {
8905 len++;
8906 }
8909 {
8912 }
8914 /* The sentinel must be one of the varargs, i.e.
8915 in position >= the number of fixed arguments. */
8917 {
8921 }
8923 /* Validate the sentinel. */
8927 /* Although __null (in C++) is only an integer we allow it
8928 nevertheless, as we are guaranteed that it's exactly
8929 as wide as a pointer, and we don't want to force
8930 users to cast the NULL they have written there.
8931 We warn with -Wstrict-null-sentinel, though. */
8934 }
8935 }
8937 /* Helper for check_function_nonnull; given a list of operands which
8938 must be non-null in ARGS, determine if operand PARAM_NUM should be
8939 checked. */
8941 static bool
8943 {
8947 {
8954 }
8956 }
8958 /* Check that the function argument PARAM (which is operand number
8959 PARAM_NUM) is non-null. This is called by check_function_nonnull
8960 via check_function_arguments_recurse. */
8962 static void
8965 {
8966 /* Just skip checking the argument if it's not a pointer. This can
8967 happen if the "nonnull" attribute was given without an operand
8968 list (which means to check every pointer argument). */
8976 }
8978 /* Helper for nonnull attribute handling; fetch the operand number
8979 from the attribute argument list. */
8981 static bool
8983 {
8984 /* Verify the arg number is a small constant. */
8986 {
8989 }
8990 else
8992 }
8994 /* Handle a "nothrow" attribute; arguments as in
8995 struct attribute_spec.handler. */
8997 static tree
9000 {
9003 /* ??? TODO: Support types. */
9004 else
9005 {
9008 }
9011 }
9013 /* Handle a "cleanup" attribute; arguments as in
9014 struct attribute_spec.handler. */
9016 static tree
9019 {
9023 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9024 for global destructors in C++. This requires infrastructure that
9025 we don't have generically at the moment. It's also not a feature
9026 we'd be missing too much, since we do have attribute constructor. */
9028 {
9032 }
9034 /* Verify that the argument is a function in scope. */
9035 /* ??? We could support pointers to functions here as well, if
9036 that was considered desirable. */
9039 {
9043 }
9046 {
9050 }
9052 /* That the function has proper type is checked with the
9053 eventual call to build_function_call. */
9056 }
9058 /* Handle a "warn_unused_result" attribute. No special handling. */
9060 static tree
9064 {
9065 /* Ignore the attribute for functions not returning any value. */
9067 {
9070 }
9073 }
9075 /* Handle a "sentinel" attribute. */
9077 static tree
9080 {
9082 {
9086 }
9087 else
9088 {
9090 {
9094 }
9095 }
9098 {
9106 {
9110 }
9111 else
9112 {
9114 {
9118 }
9119 }
9120 }
9123 }
9125 /* Handle a "type_generic" attribute. */
9127 static tree
9131 {
9132 /* Ensure we have a function type. */
9135 /* Ensure we have a variadic function. */
9139 }
9141 /* Handle a "target" attribute. */
9143 static tree
9146 {
9147 /* Ensure we have a function type. */
9149 {
9152 }
9154 flags))
9158 }
9160 /* Arguments being collected for optimization. */
9165 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9166 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9167 false for #pragma GCC optimize. */
9169 bool
9171 {
9179 tree ap;
9181 /* Build up argv vector. Just in case the string is stored away, use garbage
9182 collected strings. */
9187 {
9191 {
9195 }
9198 {
9199 /* Split string into multiple substrings. */
9207 {
9214 {
9218 }
9219 else
9220 {
9223 }
9227 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9228 options. */
9230 {
9235 else
9239 }
9242 {
9245 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9246 itself is -Os, and any other switch begins with a -f. */
9252 }
9257 }
9259 }
9260 }
9270 /* Now parse the options. */
9280 /* Don't allow changing -fstrict-aliasing. */
9285 }
9287 /* For handling "optimize" attribute. arguments as in
9288 struct attribute_spec.handler. */
9290 static tree
9293 {
9294 /* Ensure we have a function type. */
9296 {
9299 }
9300 else
9301 {
9305 /* Save current options. */
9308 /* If we previously had some optimization options, use them as the
9309 default. */
9314 /* Parse options, and update the vector. */
9319 /* Restore current options. */
9321 }
9324 }
9326 /* Handle a "no_split_stack" attribute. */
9328 static tree
9333 {
9337 {
9341 }
9343 {
9347 }
9350 }
9352 /* Handle a "returns_nonnull" attribute; arguments as in
9353 struct attribute_spec.handler. */
9355 static tree
9358 {
9359 // Even without a prototype we still have a return type we can check.
9361 {
9364 }
9366 }
9368 /* Handle a "designated_init" attribute; arguments as in
9369 struct attribute_spec.handler. */
9371 static tree
9374 {
9376 {
9379 }
9381 }
9383 \f
9384 /* Check for valid arguments being passed to a function with FNTYPE.
9385 There are NARGS arguments in the array ARGARRAY. */
9386 void
9388 {
9389 /* Check for null being passed in a pointer argument that must be
9390 non-null. We also need to do this if format checking is enabled. */
9395 /* Check for errors in format strings. */
9402 }
9404 /* Generic argument checking recursion routine. PARAM is the argument to
9405 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9406 once the argument is resolved. CTX is context for the callback. */
9407 void
9412 {
9416 {
9417 /* Strip coercion. */
9421 }
9424 {
9426 tree attrs;
9429 /* See if this is a call to a known internationalization function
9430 that modifies a format arg. Such a function may have multiple
9431 format_arg attributes (for example, ngettext). */
9434 attrs;
9437 {
9438 tree inner_arg;
9439 tree format_num_expr;
9442 call_expr_arg_iterator iter;
9444 /* Extract the argument number, which was previously checked
9445 to be valid. */
9454 {
9459 }
9460 }
9462 /* If we found a format_arg attribute and did a recursive check,
9463 we are done with checking this argument. Otherwise, we continue
9464 and this will be considered a non-literal. */
9467 }
9470 {
9471 /* Check both halves of the conditional expression. */
9477 }
9480 }
9482 /* Checks for a builtin function FNDECL that the number of arguments
9483 NARGS against the required number REQUIRED and issues an error if
9484 there is a mismatch. Returns true if the number of arguments is
9485 correct, otherwise false. */
9487 static bool
9489 {
9491 {
9495 }
9497 {
9501 }
9503 }
9505 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9506 Returns false if there was an error, otherwise true. */
9508 bool
9510 {
9516 {
9526 {
9528 {
9532 }
9534 }
9544 {
9551 {
9555 }
9557 }
9562 {
9567 {
9571 }
9574 {
9576 fndecl);
9578 }
9580 }
9585 {
9587 {
9590 }
9592 }
9597 }
9598 }
9600 /* Function to help qsort sort FIELD_DECLs by name order. */
9602 int
9604 {
9609 /* A nontype is "greater" than a type. */
9618 }
9621 gt_pointer_operator new_value;
9625 /* This routine compares two fields like field_decl_cmp but using the
9626 pointer operator in resort_data. */
9628 static int
9630 {
9635 /* A nontype is "greater" than a type. */
9641 {
9648 }
9650 }
9652 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9654 void
9657 gt_pointer_operator new_value,
9659 {
9664 resort_field_decl_cmp);
9665 }
9667 /* Subroutine of c_parse_error.
9668 Return the result of concatenating LHS and RHS. RHS is really
9669 a string literal, its first character is indicated by RHS_START and
9670 RHS_SIZE is its length (including the terminating NUL character).
9672 The caller is responsible for deleting the returned pointer. */
9676 {
9682 }
9684 /* Issue the error given by GMSGID, indicating that it occurred before
9685 TOKEN, which had the associated VALUE. */
9687 void
9690 {
9691 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9701 {
9706 {
9719 }
9723 else
9729 }
9751 {
9756 }
9764 {
9769 }
9770 else
9774 {
9777 }
9778 #undef catenate_messages
9779 }
9781 /* Mapping for cpp message reasons to the options that enable them. */
9783 struct reason_option_codes_t
9784 {
9787 };
9811 };
9813 /* Return the gcc option code associated with the reason for a cpp
9814 message, or 0 if none. */
9816 static int
9818 {
9822 {
9825 }
9827 }
9829 /* Callback from cpp_error for PFILE to print diagnostics from the
9830 preprocessor. The diagnostic is of type LEVEL, with REASON set
9831 to the reason code if LEVEL is represents a warning, at location
9832 LOCATION unless this is after lexing and the compiler's location
9833 should be used instead, with column number possibly overridden by
9834 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9835 the arguments. Returns true if a diagnostic was emitted, false
9836 otherwise. */
9838 bool
9842 {
9843 diagnostic_info diagnostic;
9844 diagnostic_t dlevel;
9849 {
9854 /* Fall through. */
9879 }
9892 }
9894 /* Convert a character from the host to the target execution character
9895 set. cpplib handles this, mostly. */
9897 HOST_WIDE_INT
9899 {
9900 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9901 zero-extended under -fno-signed-char. cpplib insists that characters
9902 and character constants are always unsigned. Hence we must convert
9903 back and forth. */
9911 else
9913 }
9915 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9916 references with an INDIRECT_REF of a constant at the bottom; much like the
9917 traditional rendering of offsetof as a macro. Return the folded result. */
9919 tree
9921 {
9925 {
9941 {
9944 }
9954 {
9958 }
9971 /* Check if the offset goes beyond the upper bound of the array. */
9973 {
9979 {
9983 {
9984 tree v;
9991 {
9999 }
10000 /* Don't warn if the array might be considered a poor
10001 man's flexible array member with a very permissive
10002 definition thereof. */
10006 "index %E denotes an offset "
10009 }
10010 }
10011 }
10018 /* Handle static members of volatile structs. */
10025 }
10028 }
10030 /* Likewise, but convert it to the return type of offsetof. */
10032 tree
10034 {
10036 }
10038 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10039 expression, because B will always be true. */
10041 void
10043 {
10046 "the omitted middle operand in ?: will always be %<true%>, "
10048 }
10050 /* Give an error for storing into ARG, which is 'const'. USE indicates
10051 how ARG was being used. */
10053 void
10055 {
10058 /* Using this macro rather than (for example) arrays of messages
10059 ensures that all the format strings are checked at compile
10060 time. */
10061 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10062 : (use == lv_increment ? (I) \
10063 : (use == lv_decrement ? (D) : (AS))))
10065 {
10076 else
10082 }
10088 arg);
10094 arg);
10096 {
10106 arg);
10107 }
10113 arg);
10114 else
10119 arg);
10120 }
10122 /* Print an error message for an invalid lvalue. USE says
10123 how the lvalue is being used and so selects the error message. LOC
10124 is the location for the error. */
10126 void
10128 {
10130 {
10148 }
10149 }
10151 /* Print an error message for an invalid indirection of type TYPE.
10152 ERRSTRING is the name of the operator for the indirection. */
10154 void
10156 {
10158 {
10166 type);
10171 type);
10176 type);
10181 type);
10186 type);
10190 }
10191 }
10192 \f
10193 /* *PTYPE is an incomplete array. Complete it with a domain based on
10194 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10195 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10196 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10198 int
10200 {
10208 {
10210 {
10211 int eltsize
10214 }
10216 {
10220 {
10224 }
10225 else
10226 {
10227 tree curindex;
10238 {
10242 else
10243 {
10245 {
10246 /* Since we treat size types now as ordinary
10247 unsigned types, we need an explicit overflow
10248 check. */
10252 }
10254 size_one_node);
10255 }
10258 }
10260 {
10264 }
10265 }
10266 }
10267 else
10268 {
10269 /* Make an error message unless that happened already. */
10272 }
10273 }
10274 else
10275 {
10279 }
10282 /* Force an indefinite layout factor. */
10285 size_zero_node);
10290 else
10293 /* Using build_distinct_type_copy and modifying things afterward instead
10294 of using build_array_type to create a new type preserves all of the
10295 TYPE_LANG_FLAG_? bits that the front end may have set. */
10303 /* Make sure we have the canonical MAIN_TYPE. */
10306 hashcode);
10309 /* Fix the canonical type. */
10319 else
10324 else
10330 {
10332 /* If we proceed with the array type as it is, we'll eventually
10333 crash in tree_to_[su]hwi(). */
10335 }
10339 }
10341 /* Like c_mark_addressable but don't check register qualifier. */
10342 void
10344 {
10350 }
10353 \f
10354 /* Used to help initialize the builtin-types.def table. When a type of
10355 the correct size doesn't exist, use error_mark_node instead of NULL.
10356 The later results in segfaults even when a decl using the type doesn't
10357 get invoked. */
10359 tree
10361 {
10364 }
10366 /* A helper function for resolve_overloaded_builtin in resolving the
10367 overloaded __sync_ builtins. Returns a positive power of 2 if the
10368 first operand of PARAMS is a pointer to a supported data type.
10369 Returns 0 if an error is encountered. */
10371 static int
10373 {
10374 tree type;
10378 {
10381 }
10385 {
10386 /* Force array-to-pointer decay for C++. */
10390 }
10402 incompatible:
10405 }
10407 /* A helper function for resolve_overloaded_builtin. Adds casts to
10408 PARAMS to make arguments match up with those of FUNCTION. Drops
10409 the variadic arguments at the end. Returns false if some error
10410 was encountered; true on success. */
10412 static bool
10415 {
10416 function_args_iterator iter;
10417 tree ptype;
10421 /* We've declared the implementation functions to use "volatile void *"
10422 as the pointer parameter, so we shouldn't get any complaints from the
10423 call to check_function_arguments what ever type the user used. */
10428 /* For the rest of the values, we need to cast these to FTYPE, so that we
10429 don't get warnings for passing pointer types, etc. */
10432 {
10436 /* XXX void_type_node belies the abstraction. */
10442 {
10445 }
10447 /* Only convert parameters if arg_type is unsigned integer type with
10448 new format sync routines, i.e. don't attempt to convert pointer
10449 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10450 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10451 kinds). */
10453 {
10454 /* Ideally for the first conversion we'd use convert_for_assignment
10455 so that we get warnings for anything that doesn't match the pointer
10456 type. This isn't portable across the C and C++ front ends atm. */
10461 }
10464 }
10466 /* __atomic routines are not variadic. */
10468 {
10471 }
10473 /* The definition of these primitives is variadic, with the remaining
10474 being "an optional list of variables protected by the memory barrier".
10475 No clue what that's supposed to mean, precisely, but we consider all
10476 call-clobbered variables to be protected so we're safe. */
10480 }
10482 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10483 RESULT to make it match the type of the first pointer argument in
10484 PARAMS. */
10486 static tree
10488 {
10493 /* New format doesn't require casting unless the types are the same size. */
10496 else
10498 }
10500 /* This function verifies the PARAMS to generic atomic FUNCTION.
10501 It returns the size if all the parameters are the same size, otherwise
10502 0 is returned if the parameters are invalid. */
10504 static int
10507 {
10512 tree type_0;
10514 /* Determine the parameter makeup. */
10516 {
10532 }
10535 {
10538 }
10540 /* Get type of first parameter, and determine its size. */
10543 {
10544 /* Force array-to-pointer decay for C++. */
10548 }
10550 {
10552 function);
10554 }
10556 /* Types must be compile time constant sizes. */
10558 {
10561 function);
10563 }
10567 /* Zero size objects are not allowed. */
10569 {
10572 function);
10574 }
10576 /* Check each other parameter is a pointer and the same size. */
10578 {
10581 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10585 {
10587 function);
10589 }
10593 {
10595 function);
10597 }
10598 }
10600 /* Check memory model parameters for validity. */
10602 {
10605 {
10608 {
10611 function);
10612 }
10613 }
10614 else
10616 {
10618 function);
10620 }
10621 }
10624 }
10627 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10628 at the beginning of the parameter list PARAMS representing the size of the
10629 objects. This is to match the library ABI requirement. LOC is the location
10630 of the function call.
10631 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10632 returned to allow the external call to be constructed. */
10634 static tree
10637 {
10638 tree size_node;
10640 /* Insert a SIZE_T parameter as the first param. If there isn't
10641 enough space, allocate a new vector and recursively re-build with that. */
10643 {
10646 tree f;
10656 }
10658 /* Add the size parameter and leave as a function call for processing. */
10662 }
10665 /* Return whether atomic operations for naturally aligned N-byte
10666 arguments are supported, whether inline or through libatomic. */
10667 static bool
10669 {
10671 {
10683 }
10684 }
10686 /* This will process an __atomic_exchange function call, determine whether it
10687 needs to be mapped to the _N variation, or turned into a library call.
10688 LOC is the location of the builtin call.
10689 FUNCTION is the DECL that has been invoked;
10690 PARAMS is the argument list for the call. The return value is non-null
10691 TRUE is returned if it is translated into the proper format for a call to the
10692 external library, and NEW_RETURN is set the tree for that function.
10693 FALSE is returned if processing for the _N variation is required, and
10694 NEW_RETURN is set to the the return value the result is copied into. */
10695 static bool
10698 {
10703 /* Size of 0 is an error condition. */
10705 {
10708 }
10710 /* If not a lock-free size, change to the library generic format. */
10712 {
10715 }
10717 /* Otherwise there is a lockfree match, transform the call from:
10718 void fn(T* mem, T* desired, T* return, model)
10719 into
10720 *return = (T) (fn (In* mem, (In) *desired, model)) */
10727 /* Create pointer to appropriate size. */
10731 /* Convert object pointer to required type. */
10734 /* Convert new value to required type, and dereference it. */
10739 /* Move memory model to the 3rd position, and end param list. */
10743 /* Convert return pointer and dereference it for later assignment. */
10747 }
10750 /* This will process an __atomic_compare_exchange function call, determine
10751 whether it needs to be mapped to the _N variation, or turned into a lib call.
10752 LOC is the location of the builtin call.
10753 FUNCTION is the DECL that has been invoked;
10754 PARAMS is the argument list for the call. The return value is non-null
10755 TRUE is returned if it is translated into the proper format for a call to the
10756 external library, and NEW_RETURN is set the tree for that function.
10757 FALSE is returned if processing for the _N variation is required. */
10759 static bool
10763 {
10768 /* Size of 0 is an error condition. */
10770 {
10773 }
10775 /* If not a lock-free size, change to the library generic format. */
10777 {
10778 /* The library generic format does not have the weak parameter, so
10779 remove it from the param list. Since a parameter has been removed,
10780 we can be sure that there is room for the SIZE_T parameter, meaning
10781 there will not be a recursive rebuilding of the parameter list, so
10782 there is no danger this will be done twice. */
10784 {
10788 }
10791 }
10793 /* Otherwise, there is a match, so the call needs to be transformed from:
10794 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10795 into
10796 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10802 /* Create pointer to appropriate size. */
10806 /* Convert object pointer to required type. */
10810 /* Convert expected pointer to required type. */
10814 /* Convert desired value to required type, and dereference it. */
10819 /* The rest of the parameters are fine. NULL means no special return value
10820 processing.*/
10823 }
10826 /* This will process an __atomic_load function call, determine whether it
10827 needs to be mapped to the _N variation, or turned into a library call.
10828 LOC is the location of the builtin call.
10829 FUNCTION is the DECL that has been invoked;
10830 PARAMS is the argument list for the call. The return value is non-null
10831 TRUE is returned if it is translated into the proper format for a call to the
10832 external library, and NEW_RETURN is set the tree for that function.
10833 FALSE is returned if processing for the _N variation is required, and
10834 NEW_RETURN is set to the the return value the result is copied into. */
10836 static bool
10839 {
10844 /* Size of 0 is an error condition. */
10846 {
10849 }
10851 /* If not a lock-free size, change to the library generic format. */
10853 {
10856 }
10858 /* Otherwise, there is a match, so the call needs to be transformed from:
10859 void fn(T* mem, T* return, model)
10860 into
10861 *return = (T) (fn ((In *) mem, model)) */
10867 /* Create pointer to appropriate size. */
10871 /* Convert object pointer to required type. */
10875 /* Move memory model to the 2nd position, and end param list. */
10879 /* Convert return pointer and dereference it for later assignment. */
10883 }
10886 /* This will process an __atomic_store function call, determine whether it
10887 needs to be mapped to the _N variation, or turned into a library call.
10888 LOC is the location of the builtin call.
10889 FUNCTION is the DECL that has been invoked;
10890 PARAMS is the argument list for the call. The return value is non-null
10891 TRUE is returned if it is translated into the proper format for a call to the
10892 external library, and NEW_RETURN is set the tree for that function.
10893 FALSE is returned if processing for the _N variation is required, and
10894 NEW_RETURN is set to the the return value the result is copied into. */
10896 static bool
10899 {
10904 /* Size of 0 is an error condition. */
10906 {
10909 }
10911 /* If not a lock-free size, change to the library generic format. */
10913 {
10916 }
10918 /* Otherwise, there is a match, so the call needs to be transformed from:
10919 void fn(T* mem, T* value, model)
10920 into
10921 fn ((In *) mem, (In) *value, model) */
10926 /* Create pointer to appropriate size. */
10930 /* Convert object pointer to required type. */
10934 /* Convert new value to required type, and dereference it. */
10939 /* The memory model is in the right spot already. Return is void. */
10943 }
10946 /* Some builtin functions are placeholders for other expressions. This
10947 function should be called immediately after parsing the call expression
10948 before surrounding code has committed to the type of the expression.
10950 LOC is the location of the builtin call.
10952 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10953 PARAMS is the argument list for the call. The return value is non-null
10954 when expansion is complete, and null if normal processing should
10955 continue. */
10957 tree
10960 {
10966 {
10972 else
10976 }
10978 /* Handle BUILT_IN_NORMAL here. */
10980 {
10985 {
10986 /* Handle these 4 together so that they can fall through to the next
10987 case if the call is transformed to an _N variant. */
10989 {
10991 {
10995 /* Change to the _N variant. */
10998 }
11001 {
11003 params,
11006 /* Change to the _N variant. */
11009 }
11011 {
11015 /* Change to the _N variant. */
11018 }
11020 {
11024 /* Change to the _N variant. */
11027 }
11030 }
11031 /* Fallthrough to the normal processing. */
11032 }
11049 {
11051 /* Fallthru for parameter processing. */
11052 }
11069 {
11080 orig_format))
11085 NULL);
11093 /* If new_return is set, assign function to that expr and cast the
11094 result to void since the generic interface returned void. */
11096 {
11097 /* Cast function result from I{1,2,4,8,16} to the required type. */
11100 result);
11104 }
11106 }
11110 }
11111 }
11113 /* vector_types_compatible_elements_p is used in type checks of vectors
11114 values used as operands of binary operators. Where it returns true, and
11115 the other checks of the caller succeed (being vector types in he first
11116 place, and matching number of elements), we can just treat the types
11117 as essentially the same.
11118 Contrast with vector_targets_convertible_p, which is used for vector
11119 pointer types, and vector_types_convertible_p, which will allow
11120 language-specific matches under the control of flag_lax_vector_conversions,
11121 and might still require a conversion. */
11122 /* True if vector types T1 and T2 can be inputs to the same binary
11123 operator without conversion.
11124 We don't check the overall vector size here because some of our callers
11125 want to give different error messages when the vectors are compatible
11126 except for the element count. */
11128 bool
11130 {
11143 /* Equality works here because c_common_signed_type uses
11144 TYPE_MAIN_VARIANT. */
11152 }
11154 /* Check for missing format attributes on function pointers. LTYPE is
11155 the new type or left-hand side type. RTYPE is the old type or
11156 right-hand side type. Returns TRUE if LTYPE is missing the desired
11157 attribute. */
11159 bool
11161 {
11163 tree ra;
11169 {
11170 tree la;
11175 }
11176 else
11178 }
11180 /* Subscripting with type char is likely to lose on a machine where
11181 chars are signed. So warn on any machine, but optionally. Don't
11182 warn for unsigned char since that type is safe. Don't warn for
11183 signed char because anyone who uses that must have done so
11184 deliberately. Furthermore, we reduce the false positive load by
11185 warning only for non-constant value of type char. */
11187 void
11189 {
11193 }
11195 /* Implement -Wparentheses for the unexpected C precedence rules, to
11196 cover cases like x + y << z which readers are likely to
11197 misinterpret. We have seen an expression in which CODE is a binary
11198 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11199 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11200 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11201 expression was not formed using a binary or unary operator, or it
11202 was enclosed in parentheses. */
11204 void
11208 {
11212 /* This macro tests that the expression ARG with original tree code
11213 CODE appears to be a boolean expression. or the result of folding a
11214 boolean expression. */
11215 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11216 (truth_value_p (TREE_CODE (ARG)) \
11217 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11219 || ((CODE) != INTEGER_CST \
11220 && (integer_onep (ARG) || integer_zerop (ARG))))
11223 {
11272 /* Check cases like x|y==z */
11279 /* Check cases like !x | y */
11283 "suggest parentheses around operand of "
11296 /* Check cases like x^y==z */
11318 /* Check cases like x&y==z */
11325 /* Check cases like !x & y */
11329 "suggest parentheses around operand of "
11352 {
11357 "comparisons like %<X<=Y<=Z%> do not "
11363 "comparisons like %<X<=Y<=Z%> do not "
11365 }
11367 }
11368 #undef NOT_A_BOOLEAN_EXPR_P
11369 }
11371 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11373 void
11375 {
11377 {
11380 else
11382 }
11383 }
11385 /* Warn for division by zero according to the value of DIVISOR. LOC
11386 is the location of the division operator. */
11388 void
11390 {
11391 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11392 about division by zero. Do not issue a warning if DIVISOR has a
11393 floating-point type, since we consider 0.0/0.0 a valid way of
11394 generating a NaN. */
11398 }
11400 /* Subroutine of build_binary_op. Give warnings for comparisons
11401 between signed and unsigned quantities that may fail. Do the
11402 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11403 so that casts will be considered, but default promotions won't
11404 be.
11406 LOCATION is the location of the comparison operator.
11408 The arguments of this function map directly to local variables
11409 of build_binary_op. */
11411 void
11416 {
11421 /* In C++, check for comparison of different enum types. */
11427 {
11431 }
11433 /* Do not warn if the comparison is being done in a signed type,
11434 since the signed type will only be chosen if it can represent
11435 all the values of the unsigned type. */
11438 /* Do not warn if both operands are unsigned. */
11441 else
11442 {
11448 else
11456 /* Do not warn if the signed quantity is an unsuffixed integer
11457 literal (or some static constant expression involving such
11458 literals or a conditional expression involving such literals)
11459 and it is non-negative. */
11462 /* Do not warn if the comparison is an equality operation, the
11463 unsigned quantity is an integral constant, and it would fit
11464 in the result if the result were signed. */
11469 /* In C, do not warn if the unsigned quantity is an enumeration
11470 constant and its maximum value would fit in the result if the
11471 result were signed. */
11477 else
11479 OPT_Wsign_compare,
11481 }
11483 /* Warn if two unsigned values are being compared in a size larger
11484 than their original size, and one (and only one) is the result of
11485 a `~' operator. This comparison will always fail.
11487 Also warn if one operand is a constant, and the constant does not
11488 have all bits set that are set in the ~ operand when it is
11489 extended. */
11496 {
11503 {
11504 tree primop;
11510 {
11514 }
11515 else
11516 {
11520 }
11525 {
11528 {
11532 else
11535 }
11536 }
11537 }
11545 }
11546 }
11548 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11549 type via c_common_type. If -Wdouble-promotion is in use, and the
11550 conditions for warning have been met, issue a warning. GMSGID is
11551 the warning message. It must have two %T specifiers for the type
11552 that was converted (generally "float") and the type to which it was
11553 converted (generally "double), respectively. LOC is the location
11554 to which the awrning should refer. */
11556 void
11559 {
11560 tree source_type;
11564 /* If the conversion will not occur at run-time, there is no need to
11565 warn about it. */
11577 else
11580 }
11582 /* Setup a TYPE_DECL node as a typedef representation.
11584 X is a TYPE_DECL for a typedef statement. Create a brand new
11585 ..._TYPE node (which will be just a variant of the existing
11586 ..._TYPE node with identical properties) and then install X
11587 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11589 The whole point here is to end up with a situation where each
11590 and every ..._TYPE node the compiler creates will be uniquely
11591 associated with AT MOST one node representing a typedef name.
11592 This way, even though the compiler substitutes corresponding
11593 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11594 early on, later parts of the compiler can always do the reverse
11595 translation and get back the corresponding typedef name. For
11596 example, given:
11598 typedef struct S MY_TYPE;
11599 MY_TYPE object;
11601 Later parts of the compiler might only know that `object' was of
11602 type `struct S' if it were not for code just below. With this
11603 code however, later parts of the compiler see something like:
11605 struct S' == struct S
11606 typedef struct S' MY_TYPE;
11607 struct S' object;
11609 And they can then deduce (from the node for type struct S') that
11610 the original object declaration was:
11612 MY_TYPE object;
11614 Being able to do this is important for proper support of protoize,
11615 and also for generating precise symbolic debugging information
11616 which takes full account of the programmer's (typedef) vocabulary.
11618 Obviously, we don't want to generate a duplicate ..._TYPE node if
11619 the TYPE_DECL node that we are now processing really represents a
11620 standard built-in type. */
11622 void
11624 {
11628 {
11631 }
11634 {
11642 }
11643 }
11645 /* Record the types used by the current global variable declaration
11646 being parsed, so that we can decide later to emit their debug info.
11647 Those types are in types_used_by_cur_var_decl, and we are going to
11648 store them in the types_used_by_vars_hash hash table.
11649 DECL is the declaration of the global variable that has been parsed. */
11651 void
11653 {
11657 {
11660 }
11661 }
11663 /* If DECL is a typedef that is declared in the current function,
11664 record it for the purpose of -Wunused-local-typedefs. */
11666 void
11668 {
11673 /* if this is not a locally defined typedef then we are not
11674 interested. */
11681 }
11683 /* If T is a TYPE_DECL declared locally, mark it as used. */
11685 void
11687 {
11692 }
11694 /* Warn if there are some unused locally defined typedefs in the
11695 current function. */
11697 void
11699 {
11701 tree decl;
11702 /* The number of times we have emitted -Wunused-local-typedefs
11703 warnings. If this is different from errorcount, that means some
11704 unrelated errors have been issued. In which case, we'll avoid
11705 emitting "unused-local-typedefs" warnings. */
11717 {
11721 OPT_Wunused_local_typedefs,
11724 }
11727 }
11729 /* Warn about boolean expression compared with an integer value different
11730 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11731 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11732 are the operands of the comparison. The caller must ensure that
11733 either operand is a boolean expression. */
11735 void
11737 tree op1)
11738 {
11748 {
11756 else
11759 }
11760 }
11762 /* The C and C++ parsers both use vectors to hold function arguments.
11763 For efficiency, we keep a cache of unused vectors. This is the
11764 cache. */
11769 /* Return a new vector from the cache. If the cache is empty,
11770 allocate a new vector. These vectors are GC'ed, so it is OK if the
11771 pointer is not released.. */
11775 {
11778 else
11779 {
11780 /* Passing 0 to vec::alloc returns NULL, and our callers require
11781 that we always return a non-NULL value. The vector code uses
11782 4 when growing a NULL vector, so we do too. */
11786 }
11787 }
11789 /* Release a vector of trees back to the cache. */
11791 void
11793 {
11795 {
11798 }
11799 }
11801 /* Get a new tree vector holding a single tree. */
11805 {
11809 }
11811 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11815 {
11820 }
11822 /* Get a new tree vector which is a copy of an existing one. */
11826 {
11829 tree t;
11836 }
11838 /* Return true if KEYWORD starts a type specifier. */
11840 bool
11842 {
11844 {
11875 }
11876 }
11878 /* Return true if KEYWORD names a type qualifier. */
11880 bool
11882 {
11884 {
11892 }
11893 }
11895 /* Return true if KEYWORD names a storage class specifier.
11897 RID_TYPEDEF is not included in this list despite `typedef' being
11898 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11899 such for syntactic convenience only. */
11901 bool
11903 {
11905 {
11915 }
11916 }
11918 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11920 static bool
11922 {
11924 {
11932 }
11933 }
11935 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11936 declaration-specifier (C99 6.7). */
11938 bool
11940 {
11947 {
11954 }
11955 }
11957 /* Initialize language-specific-bits of tree_contains_struct. */
11959 void
11961 {
11967 }
11969 /* Build a user-defined numeric literal out of an integer constant type VALUE
11970 with identifier SUFFIX. */
11972 tree
11975 {
11982 }
11984 /* For vector[index], convert the vector to a
11985 pointer of the underlying type. */
11986 void
11989 {
11991 {
11993 tree type1;
12006 {
12007 /* If the original vector isn't declared may_alias and it
12008 isn't a bare vector look if the subscripting would
12009 alias the vector we subscript, and if not, force ref-all. */
12015 }
12019 }
12020 }
12022 /* Determine which of the operands, if any, is a scalar that needs to be
12023 converted to a vector, for the range of operations. */
12024 enum stv_conv
12027 {
12036 {
12037 /* Most GENERIC binary expressions require homogeneous arguments.
12038 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12039 argument that is a vector and a second one that is a scalar, so
12040 we never return stv_secondarg for them. */
12045 {
12047 {
12052 }
12053 else
12055 }
12062 /* ... fall through ... */
12083 /* What about UNLT_EXPR? */
12085 {
12086 tree tmp;
12088 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12091 }
12095 {
12097 {
12102 }
12104 }
12106 /* Allow integer --> real conversion if safe. */
12110 {
12112 {
12117 }
12119 }
12122 }
12125 }
12127 /* Return true iff ALIGN is an integral constant that is a fundamental
12128 alignment, as defined by [basic.align] in the c++-11
12129 specifications.
12131 That is:
12133 [A fundamental alignment is represented by an alignment less than or
12134 equal to the greatest alignment supported by the implementation
12135 in all contexts, which is equal to
12136 alignof(max_align_t)]. */
12138 bool
12140 {
12143 }
12145 /* Return true if T is a pointer to a zero-sized aggregate. */
12147 bool
12149 {
12154 }