| blob | 016f4f45d7c22caaaaaddf86288c7e3864c886c3 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2015 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/>. */
20 #define GCC_C_COMMON_C
71 /* Mode used to build pointers (VOIDmode means ptr_mode). */
75 /* The following symbols are subsumed in the c_global_trees array, and
76 listed here individually for documentation purposes.
78 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
80 tree short_integer_type_node;
81 tree long_integer_type_node;
82 tree long_long_integer_type_node;
84 tree short_unsigned_type_node;
85 tree long_unsigned_type_node;
86 tree long_long_unsigned_type_node;
88 tree truthvalue_type_node;
89 tree truthvalue_false_node;
90 tree truthvalue_true_node;
92 tree ptrdiff_type_node;
94 tree unsigned_char_type_node;
95 tree signed_char_type_node;
96 tree wchar_type_node;
98 tree char16_type_node;
99 tree char32_type_node;
101 tree float_type_node;
102 tree double_type_node;
103 tree long_double_type_node;
105 tree complex_integer_type_node;
106 tree complex_float_type_node;
107 tree complex_double_type_node;
108 tree complex_long_double_type_node;
110 tree dfloat32_type_node;
111 tree dfloat64_type_node;
112 tree_dfloat128_type_node;
114 tree intQI_type_node;
115 tree intHI_type_node;
116 tree intSI_type_node;
117 tree intDI_type_node;
118 tree intTI_type_node;
120 tree unsigned_intQI_type_node;
121 tree unsigned_intHI_type_node;
122 tree unsigned_intSI_type_node;
123 tree unsigned_intDI_type_node;
124 tree unsigned_intTI_type_node;
126 tree widest_integer_literal_type_node;
127 tree widest_unsigned_literal_type_node;
129 Nodes for types `void *' and `const void *'.
131 tree ptr_type_node, const_ptr_type_node;
133 Nodes for types `char *' and `const char *'.
135 tree string_type_node, const_string_type_node;
137 Type `char[SOMENUMBER]'.
138 Used when an array of char is needed and the size is irrelevant.
140 tree char_array_type_node;
142 Type `wchar_t[SOMENUMBER]' or something like it.
143 Used when a wide string literal is created.
145 tree wchar_array_type_node;
147 Type `char16_t[SOMENUMBER]' or something like it.
148 Used when a UTF-16 string literal is created.
150 tree char16_array_type_node;
152 Type `char32_t[SOMENUMBER]' or something like it.
153 Used when a UTF-32 string literal is created.
155 tree char32_array_type_node;
157 Type `int ()' -- used for implicit declaration of functions.
159 tree default_function_type;
161 A VOID_TYPE node, packaged in a TREE_LIST.
163 tree void_list_node;
165 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
166 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
167 VAR_DECLS, but C++ does.)
169 tree function_name_decl_node;
170 tree pretty_function_name_decl_node;
171 tree c99_function_name_decl_node;
173 Stack of nested function name VAR_DECLs.
175 tree saved_function_name_decls;
177 */
180 \f
181 /* Switches common to the C front ends. */
183 /* Nonzero means don't output line number information. */
187 /* Nonzero causes -E output not to be done, but directives such as
188 #define that have side effects are still obeyed. */
192 /* Nonzero means dump macros in some fashion. */
196 /* Nonzero means pass #include lines through to the output. */
200 /* Nonzero means process PCH files while preprocessing. */
204 /* The file name to which we should write a precompiled header, or
205 NULL if no header will be written in this compile. */
209 /* Nonzero if an ISO standard was selected. It rejects macros in the
210 user's namespace. */
214 /* C/ObjC language option variables. */
217 /* Nonzero means allow type mismatches in conditional expressions;
218 just make their values `void'. */
222 /* Nonzero means enable C89 Amendment 1 features. */
226 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
230 /* Nonzero means use the ISO C11 dialect of C. */
234 /* Nonzero means that we have builtin functions, and main is an int. */
239 /* ObjC language option variables. */
242 /* Tells the compiler that this is a special run. Do not perform any
243 compiling, instead we are to test some platform dependent features
244 and output a C header file with appropriate definitions. */
248 /* Tells the compiler what is the constant string class for ObjC. */
252 /* UPC language option variables. */
254 /* Nonzero whenever UPC -fupc-threads-N is asserted.
255 The value N gives the number of UPC threads to be
256 defined at compile-time. */
259 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
262 /* The implementation model for UPC threads that
263 are mapped to POSIX threads, specified at compilation
264 time by the -fupc-pthreads-model-* switch. */
265 upc_pthreads_model_kind upc_pthreads_model;
267 /* C++ language option variables. */
270 /* Nonzero means generate separate instantiation control files and
271 juggle them at link time. */
275 /* The C++ dialect being used. C++98 is the default. */
279 /* Maximum template instantiation depth. This limit exists to limit the
280 time it takes to notice excessively recursive template instantiations.
282 The default is lower than the 1024 recommended by the C++0x standard
283 because G++ runs out of stack before 1024 with highly recursive template
284 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
288 /* The elements of `ridpointers' are identifier nodes for the reserved
289 type names and storage classes. It is indexed by a RID_... value. */
294 /* Nonzero means don't warn about problems that occur when the code is
295 executed. */
298 /* Whether we are building a boolean conversion inside
299 convert_for_assignment, or some other late binary operation. If
300 build_binary_op is called for C (from code shared by C and C++) in
301 this case, then the operands have already been folded and the
302 result will not be folded again, so C_MAYBE_CONST_EXPR should not
303 be generated. */
306 /* Whether lexing has been completed, so subsequent preprocessor
307 errors should use the compiler's input_location. */
310 /* Information about how a function name is generated. */
311 struct fname_var_t
312 {
316 };
318 /* The three ways of getting then name of the current function. */
321 {
322 /* C99 compliant __func__, must be first. */
324 /* GCC __FUNCTION__ compliant. */
326 /* GCC __PRETTY_FUNCTION__ compliant. */
329 };
331 /* Global visibility options. */
430 /* Reserved words. The third field is a mask: keywords are disabled
431 if they match the mask.
433 Masks for languages:
434 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
435 C --std=c99: D_CXXONLY | D_OBJC
436 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
437 UPC is like C except that D_UPC is not set
438 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
439 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
440 ObjC++ is like C++ except that D_OBJC is not set
442 If -fno-asm is used, D_ASM is added to the mask. If
443 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
444 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
445 In C with -Wc++-compat, we warn if D_CXXWARN is set.
447 Note the complication of the D_CXX_OBJC keywords. These are
448 reserved words such as 'class'. In C++, 'class' is a reserved
449 word. In Objective-C++ it is too. In Objective-C, it is a
450 reserved word too, but only if it follows an '@' sign.
451 */
453 {
618 /* These Objective-C keywords are recognized only immediately after
619 an '@'. */
636 /* These are recognized only in protocol-qualifier context
637 (see above) */
645 /* UPC keywords */
657 /* These are recognized inside a property attribute list */
666 };
671 /* Table of machine-independent attributes common to all C-like languages.
673 All attributes referencing arguments should be additionally processed
674 in chkp_copy_function_type_adding_bounds for correct instrumentation
675 by Pointer Bounds Checker.
676 Current list of processed common attributes: nonnull. */
678 {
679 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
680 affects_type_identity } */
687 /* FIXME: logically, noreturn attributes should be listed as
688 "false, true, true" and apply to function types. But implementing this
689 would require all the places in the compiler that use TREE_THIS_VOLATILE
690 on a decl to identify non-returning functions to be located and fixed
691 to check the function type instead. */
722 /* The same comments as for noreturn attributes apply to const ones. */
746 handle_no_instrument_function_attribute,
764 /* ??? These two attributes didn't make the transition from the
765 Intel language document to the multi-vendor language document. */
770 /* For internal use (marking of builtins) only. The name contains space
771 to prevent its usage in source code. */
793 /* For internal use (marking of builtins) only. The name contains space
794 to prevent its usage in source code. */
805 handle_no_address_safety_analysis_attribute,
808 handle_no_sanitize_address_attribute,
811 handle_no_sanitize_address_attribute,
814 handle_no_sanitize_undefined_attribute,
824 /* For internal use only. The leading '*' both prevents its usage in
825 source code and signals that it may be overridden by machine tables. */
830 /* For internal use (marking of builtins and runtime functions) only.
831 The name contains space to prevent its usage in source code. */
857 };
859 /* Give the specifications for the format attributes, used by C and all
860 descendants.
862 All attributes referencing arguments should be additionally processed
863 in chkp_copy_function_type_adding_bounds for correct instrumentation
864 by Pointer Bounds Checker.
865 Current list of processed format attributes: format, format_arg. */
867 {
868 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
869 affects_type_identity } */
875 };
877 /* Return identifier for address space AS. */
881 {
885 }
887 /* Push current bindings for the function name VAR_DECLS. */
889 void
891 {
896 {
900 {
902 saved);
904 }
905 }
907 /* Normally they'll have been NULL, so only push if we've got a
908 stack, or they are non-NULL. */
910 saved_function_name_decls);
911 }
913 /* Finish up the current bindings, adding them into the current function's
914 statement tree. This must be done _before_ finish_stmt_tree is called.
915 If there is no current function, we must be at file scope and no statements
916 are involved. Pop the previous bindings. */
918 void
920 {
929 {
937 }
943 {
944 /* We had saved values, restore them. */
945 tree saved;
948 {
953 }
955 }
957 }
959 /* Return the text name of the current function, suitably prettified
960 by PRETTY_P. Return string must be freed by caller. */
964 {
971 {
974 }
987 {
990 }
993 }
995 /* Return the VAR_DECL for a const char array naming the current
996 function. If the VAR_DECL has not yet been created, create it
997 now. RID indicates how it should be formatted and IDENTIFIER_NODE
998 ID is its name (unfortunately C and C++ hold the RID values of
999 keywords in different places, so we can't derive RID from ID in
1000 this language independent code. LOC is the location of the
1001 function. */
1003 tree
1005 {
1015 {
1016 /* If a tree is built here, it would normally have the lineno of
1017 the current statement. Later this tree will be moved to the
1018 beginning of the function and this line number will be wrong.
1019 To avoid this problem set the lineno to 0 here; that prevents
1020 it from appearing in the RTL. */
1021 tree stmts;
1029 saved_function_name_decls
1033 }
1038 }
1040 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1042 tree
1044 {
1049 /* Compute the number of elements, for the array type. */
1051 {
1054 }
1056 {
1059 }
1061 {
1064 }
1065 else
1066 {
1069 }
1071 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1072 limit in C++98 Annex B is very large (65536) and is not normative,
1073 so we do not diagnose it (warn_overlength_strings is forced off
1074 in c_common_post_options). */
1076 {
1080 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1081 separate the %d from the 'C'. 'ISO' should not be
1082 translated, but it may be moved after 'C%d' in languages
1083 where modifiers follow nouns. */
1085 "string length %qd is greater than the length %qd "
1088 }
1090 /* Create the array type for the string constant. The ISO C++
1091 standard says that a string literal has type `const char[N]' or
1092 `const wchar_t[N]'. We use the same logic when invoked as a C
1093 front-end with -Wwrite-strings.
1094 ??? We should change the type of an expression depending on the
1095 state of a warning flag. We should just be warning -- see how
1096 this is handled in the C++ front-end for the deprecated implicit
1097 conversion from string literals to `char*' or `wchar_t*'.
1099 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1100 array type being the unqualified version of that type.
1101 Therefore, if we are constructing an array of const char, we must
1102 construct the matching unqualified array type first. The C front
1103 end does not require this, but it does no harm, so we do it
1104 unconditionally. */
1115 }
1116 \f
1117 /* If DISABLE is true, stop issuing warnings. This is used when
1118 parsing code that we know will not be executed. This function may
1119 be called multiple times, and works as a stack. */
1121 static void
1123 {
1125 {
1128 }
1129 }
1131 /* If ENABLE is true, reenable issuing warnings. */
1133 static void
1135 {
1137 {
1140 }
1141 }
1143 /* Fully fold EXPR, an expression that was not folded (beyond integer
1144 constant expressions and null pointer constants) when being built
1145 up. If IN_INIT, this is in a static initializer and certain
1146 changes are made to the folding done. Clear *MAYBE_CONST if
1147 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1148 expression because it contains an evaluated operator (in C99) or an
1149 operator outside of sizeof returning an integer constant (in C90)
1150 not permitted in constant expressions, or because it contains an
1151 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1152 set to true by callers before calling this function.) Return the
1153 folded expression. Function arguments have already been folded
1154 before calling this function, as have the contents of SAVE_EXPR,
1155 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1156 C_MAYBE_CONST_EXPR. */
1158 tree
1160 {
1161 tree ret;
1167 /* This function is not relevant to C++ because C++ folds while
1168 parsing, and may need changes to be correct for C++ when C++
1169 stops folding while parsing. */
1176 {
1179 }
1186 }
1188 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1189 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1190 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1191 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1192 both evaluated and unevaluated subexpressions while
1193 *MAYBE_CONST_ITSELF is carried from only evaluated
1194 subexpressions). */
1196 static tree
1199 {
1211 /* This function is not relevant to C++ because C++ folds while
1212 parsing, and may need changes to be correct for C++ when C++
1213 stops folding while parsing. */
1217 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1218 anything else not counted as an expression cannot usefully be
1219 folded further at this point. */
1225 /* Operands of variable-length expressions (function calls) have
1226 already been folded, as have __builtin_* function calls, and such
1227 expressions cannot occur in constant expressions. */
1229 {
1233 }
1236 {
1245 else
1248 }
1250 /* Assignment, increment, decrement, function call and comma
1251 operators, and statement expressions, cannot occur in constant
1252 expressions if evaluated / outside of sizeof. (Function calls
1253 were handled above, though VA_ARG_EXPR is treated like a function
1254 call here, and statement expressions are handled through
1255 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1257 {
1277 }
1279 /* Fold individual tree codes as appropriate. */
1281 {
1283 /* Any non-constancy will have been marked in a containing
1284 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1292 maybe_const_itself);
1297 {
1300 }
1309 maybe_const_itself);
1312 maybe_const_itself);
1318 {
1322 }
1364 /* Binary operations evaluating both arguments (increment and
1365 decrement are binary internally in GCC). */
1369 maybe_const_itself);
1377 /* The RHS of a MODIFY_EXPR was fully folded when building that
1378 expression for the sake of conversion warnings. */
1381 maybe_const_itself);
1385 ret = in_init
1388 else
1401 {
1414 }
1431 CASE_CONVERT:
1442 /* Unary operations. */
1445 maybe_const_itself);
1449 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1450 not prepared to deal with them if they occur in initializers.
1451 Avoid attempts to fold references to UPC shared components
1452 due to the complexities of UPC pointer-to-shared arithmetic. */
1461 ret = in_init
1464 else
1469 {
1473 }
1475 {
1478 CASE_CONVERT:
1479 /* Don't warn about explicit conversions. We will already
1480 have warned about suspect implicit conversions. */
1487 }
1492 /* Binary operations not necessarily evaluating both
1493 arguments. */
1500 ? truthvalue_false_node
1508 ret = in_init
1511 else
1516 && op0_const
1517 && op0_const_self
1523 && op0_const_self
1549 else
1554 && op0_const
1555 && op0_const_self
1559 && op0_const_self
1563 && op0_const
1564 && op0_const_self
1568 && op0_const_self
1574 /* Each case where an operand with excess precision may be
1575 encountered must remove the EXCESS_PRECISION_EXPR around
1576 inner operands and possibly put one around the whole
1577 expression or possibly convert to the semantic type (which
1578 c_fully_fold does); we cannot tell at this stage which is
1579 appropriate in any particular case. */
1583 /* Various codes may appear through folding built-in functions
1584 and their arguments. */
1586 }
1588 out:
1589 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1590 have been done by this point, so remove them again. */
1594 {
1598 }
1602 }
1604 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1605 return EXP. Otherwise, return either EXP or its known constant
1606 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1607 Is the BLKmode test appropriate? */
1609 tree
1611 {
1612 tree ret;
1614 /* This function is only used by C, for c_fully_fold and other
1615 optimization, and may not be correct for C++. */
1626 /* Avoid unwanted tree sharing between the initializer and current
1627 function's body where the tree can be modified e.g. by the
1628 gimplifier. */
1632 }
1634 /* Print a warning if a constant expression had overflow in folding.
1635 Invoke this function on every expression that the language
1636 requires to be a constant expression.
1637 Note the ANSI C standard says it is erroneous for a
1638 constant expression to overflow. */
1640 void
1642 {
1650 }
1652 /* The same as above but print an unconditional error. */
1653 void
1655 {
1662 }
1664 /* Print a warning if an expression had overflow in folding and its
1665 operands hadn't.
1667 Invoke this function on every expression that
1668 (1) appears in the source code, and
1669 (2) is a constant expression that overflowed, and
1670 (3) is not already checked by convert_and_check;
1671 however, do not invoke this function on operands of explicit casts
1672 or when the expression is the result of an operator and any operand
1673 already overflowed. */
1675 void
1677 {
1682 {
1711 }
1712 }
1714 /* Warn about uses of logical || / && operator in a context where it
1715 is likely that the bitwise equivalent was intended by the
1716 programmer. We have seen an expression in which CODE is a binary
1717 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1718 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1719 void
1723 {
1735 /* We don't want to warn if either operand comes from a macro
1736 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1737 see PR61534. */
1742 /* Warn if &&/|| are being used in a context where it is
1743 likely that the bitwise equivalent was intended by the
1744 programmer. That is, an expression such as op && MASK
1745 where op should not be any boolean expression, nor a
1746 constant, and mask seems to be a non-boolean integer constant. */
1754 {
1758 else
1763 }
1765 /* We do not warn for constants because they are typical of macro
1766 expansions that test for features. */
1770 /* This warning only makes sense with logical operands. */
1777 /* The range computations only work with scalars. */
1782 /* We first test whether either side separately is trivially true
1783 (with OR) or trivially false (with AND). If so, do not warn.
1784 This is a common idiom for testing ranges of data types in
1785 portable code. */
1792 /* If this is an OR operation, invert both sides; now, the result
1793 should be always false to get a warning. */
1807 /* If this is an OR operation, invert both sides; now, the result
1808 should be always false to get a warning. */
1816 /* If both expressions have the same operand, if we can merge the
1817 ranges, ... */
1821 {
1823 /* ... and if the range test is always false, then warn. */
1825 {
1828 "logical %<or%> of collectively exhaustive tests is "
1830 else
1832 "logical %<and%> of mutually exclusive tests is "
1834 }
1835 /* Or warn if the operands have exactly the same range, e.g.
1836 A > 0 && A > 0. */
1838 {
1842 else
1845 }
1846 }
1847 }
1849 /* Warn about logical not used on the left hand side operand of a comparison.
1850 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1851 Do not warn if RHS is of a boolean type. */
1853 void
1855 tree rhs)
1856 {
1862 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1863 !(x == 0) or !(y != 0). */
1869 "logical not is only applied to the left hand side of "
1871 }
1873 /* Warn if EXP contains any computations whose results are not used.
1874 Return true if a warning is printed; false otherwise. LOCUS is the
1875 (potential) location of the expression. */
1877 bool
1879 {
1880 restart:
1884 /* Don't warn about void constructs. This includes casting to void,
1885 void function calls, and statement expressions with a final cast
1886 to void. */
1894 {
1910 /* For a binding, warn if no side effect within it. */
1922 /* In && or ||, warn if 2nd operand has no side effect. */
1929 /* Let people do `(foo (), 0)' without a warning. */
1936 /* If this is an expression with side effects, don't warn; this
1937 case commonly appears in macro expansions. */
1943 /* Don't warn about automatic dereferencing of references, since
1944 the user cannot control it. */
1946 {
1949 }
1950 /* Fall through. */
1953 /* Referencing a volatile value is a side effect, so don't warn. */
1958 /* If this is an expression which has no operands, there is no value
1959 to be unused. There are no such language-independent codes,
1960 but front ends may define such. */
1964 warn:
1966 }
1967 }
1970 /* Print a warning about casts that might indicate violation
1971 of strict aliasing rules if -Wstrict-aliasing is used and
1972 strict aliasing mode is in effect. OTYPE is the original
1973 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1975 bool
1977 {
1978 /* Strip pointer conversion chains and get to the correct original type. */
1986 /* If the type we are casting to is a ref-all pointer
1987 dereferencing it is always valid. */
1994 {
1995 /* Casting the address of an object to non void pointer. Warn
1996 if the cast breaks type based aliasing. */
1998 {
2002 }
2003 else
2004 {
2005 /* warn_strict_aliasing >= 3. This includes the default (3).
2006 Only warn if the cast is dereferenced immediately. */
2007 alias_set_type set1 =
2013 {
2017 }
2020 {
2024 }
2025 }
2026 }
2027 else
2029 {
2030 /* At this level, warn for any conversions, even if an address is
2031 not taken in the same statement. This will likely produce many
2032 false positives, but could be useful to pinpoint problems that
2033 are not revealed at higher levels. */
2038 {
2042 }
2043 }
2046 }
2048 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2049 sizeof as last operand of certain builtins. */
2051 void
2055 {
2059 location_t loc;
2067 {
2071 /* FALLTHRU */
2079 /* FALLTHRU */
2138 }
2166 {
2170 {
2173 "argument to %<sizeof%> in %qD call is the same "
2174 "expression as the destination; did you mean to "
2180 "argument to %<sizeof%> in %qD call is the same "
2181 "expression as the destination; did you mean to "
2183 else
2185 "argument to %<sizeof%> in %qD call is the same "
2186 "expression as the destination; did you mean to "
2189 }
2192 && !strop
2195 {
2197 "argument to %<sizeof%> in %qD call is the same "
2198 "pointer type %qT as the destination; expected %qT "
2202 }
2203 }
2206 {
2210 {
2213 "argument to %<sizeof%> in %qD call is the same "
2214 "expression as the source; did you mean to "
2220 "argument to %<sizeof%> in %qD call is the same "
2221 "expression as the source; did you mean to "
2223 else
2225 "argument to %<sizeof%> in %qD call is the same "
2226 "expression as the source; did you mean to "
2229 }
2232 && !strop
2235 {
2237 "argument to %<sizeof%> in %qD call is the same "
2238 "pointer type %qT as the source; expected %qT "
2242 }
2243 }
2246 {
2250 {
2253 "argument to %<sizeof%> in %qD call is the same "
2254 "expression as the first source; did you mean to "
2260 "argument to %<sizeof%> in %qD call is the same "
2261 "expression as the first source; did you mean to "
2263 else
2265 "argument to %<sizeof%> in %qD call is the same "
2266 "expression as the first source; did you mean to "
2269 }
2272 && !strop
2275 {
2277 "argument to %<sizeof%> in %qD call is the same "
2278 "pointer type %qT as the first source; expected %qT "
2282 }
2283 }
2286 {
2290 {
2293 "argument to %<sizeof%> in %qD call is the same "
2294 "expression as the second source; did you mean to "
2300 "argument to %<sizeof%> in %qD call is the same "
2301 "expression as the second source; did you mean to "
2303 else
2305 "argument to %<sizeof%> in %qD call is the same "
2306 "expression as the second source; did you mean to "
2309 }
2312 && !strop
2315 {
2317 "argument to %<sizeof%> in %qD call is the same "
2318 "pointer type %qT as the second source; expected %qT "
2322 }
2323 }
2325 }
2327 /* Warn for unlikely, improbable, or stupid DECL declarations
2328 of `main'. */
2330 void
2332 {
2333 function_args_iterator iter;
2334 tree type;
2338 {
2339 /* XXX void_type_node belies the abstraction. */
2349 {
2355 }
2359 {
2381 "third argument of %q+D should probably be "
2384 }
2385 }
2387 /* It is intentional that this message does not mention the third
2388 argument because it's only mentioned in an appendix of the
2389 standard. */
2397 }
2399 /* vector_targets_convertible_p is used for vector pointer types. The
2400 callers perform various checks that the qualifiers are satisfactory,
2401 while OTOH vector_targets_convertible_p ignores the number of elements
2402 in the vectors. That's fine with vector pointers as we can consider,
2403 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2404 and that does not require and conversion of the pointer values.
2405 In contrast, vector_types_convertible_p and
2406 vector_types_compatible_elements_p are used for vector value types. */
2407 /* True if pointers to distinct types T1 and T2 can be converted to
2408 each other without an explicit cast. Only returns true for opaque
2409 vector types. */
2410 bool
2412 {
2419 }
2421 /* vector_types_convertible_p is used for vector value types.
2422 It could in principle call vector_targets_convertible_p as a subroutine,
2423 but then the check for vector type would be duplicated with its callers,
2424 and also the purpose of vector_targets_convertible_p would become
2425 muddled.
2426 Where vector_types_convertible_p returns true, a conversion might still be
2427 needed to make the types match.
2428 In contrast, vector_targets_convertible_p is used for vector pointer
2429 values, and vector_types_compatible_elements_p is used specifically
2430 in the context for binary operators, as a check if use is possible without
2431 conversion. */
2432 /* True if vector types T1 and T2 can be converted to each other
2433 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2434 can only be converted with -flax-vector-conversions yet that is not
2435 in effect, emit a note telling the user about that option if such
2436 a note has not previously been emitted. */
2437 bool
2439 {
2447 convertible_lax =
2462 {
2465 "conversions between vectors with differing "
2467 }
2470 }
2472 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2473 and have vector types, V0 has the same type as V1, and the number of
2474 elements of V0, V1, MASK is the same.
2476 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2477 called with two arguments. In this case implementation passes the
2478 first argument twice in order to share the same tree code. This fact
2479 could enable the mask-values being twice the vector length. This is
2480 an implementation accident and this semantics is not guaranteed to
2481 the user. */
2482 tree
2485 {
2486 tree ret;
2492 {
2495 }
2503 {
2508 }
2512 {
2516 }
2519 {
2524 }
2530 {
2533 "argument vector(s) and the mask vector should "
2536 }
2540 {
2545 }
2548 {
2549 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2555 else
2556 {
2559 }
2563 }
2573 }
2575 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2576 to integral type. */
2578 static tree
2580 {
2585 {
2586 /* C++0x scoped enumerations don't implicitly convert to integral
2587 type; if we stripped an explicit conversion to a larger type we
2588 need to replace it so common_type will still work. */
2592 }
2594 }
2596 /* This is a helper function of build_binary_op.
2598 For certain operations if both args were extended from the same
2599 smaller type, do the arithmetic in that type and then extend.
2601 BITWISE indicates a bitwise operation.
2602 For them, this optimization is safe only if
2603 both args are zero-extended or both are sign-extended.
2604 Otherwise, we might change the result.
2605 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2606 but calculated in (unsigned short) it would be (unsigned short)-1.
2607 */
2608 tree
2610 {
2614 tree type;
2616 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2617 excessive narrowing when we call get_narrower below. For
2618 example, suppose that OP0 is of unsigned int extended
2619 from signed char and that RESULT_TYPE is long long int.
2620 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2621 like
2623 (long long int) (unsigned int) signed_char
2625 which get_narrower would narrow down to
2627 (unsigned int) signed char
2629 If we do not cast OP0 first, get_narrower would return
2630 signed_char, which is inconsistent with the case of the
2631 explicit cast. */
2638 /* UNS is 1 if the operation to be done is an unsigned one. */
2641 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2642 but it *requires* conversion to FINAL_TYPE. */
2653 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2655 /* For bitwise operations, signedness of nominal type
2656 does not matter. Consider only how operands were extended. */
2660 /* Note that in all three cases below we refrain from optimizing
2661 an unsigned operation on sign-extended args.
2662 That would not be valid. */
2664 /* Both args variable: if both extended in same way
2665 from same width, do it in that width.
2666 Do it unsigned if args were zero-extended. */
2673 return c_common_signed_or_unsigned_type
2680 && (type
2691 && (type
2699 }
2701 /* Checks if expression EXPR of real/integer type cannot be converted
2702 to the real/integer type TYPE. Function returns non-zero when:
2703 * EXPR is a constant which cannot be exactly converted to TYPE.
2704 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2705 for EXPR type and TYPE being both integers or both real.
2706 * EXPR is not a constant of real type and TYPE is an integer.
2707 * EXPR is not a constant of integer type which cannot be
2708 exactly converted to real type.
2709 Function allows conversions between types of different signedness and
2710 can return SAFE_CONVERSION (zero) in that case. Function can produce
2711 signedness warnings if PRODUCE_WARNS is true. */
2713 enum conversion_safety
2715 {
2721 {
2722 /* Warn for real constant that is not an exact integer converted
2723 to integer type. */
2726 {
2729 }
2730 /* Warn for an integer constant that does not fit into integer type. */
2734 {
2737 {
2741 }
2743 {
2747 }
2748 else
2750 }
2752 {
2753 /* Warn for an integer constant that does not fit into real type. */
2755 {
2759 }
2760 /* Warn for a real constant that does not fit into a smaller
2761 real type. */
2764 {
2768 }
2769 }
2770 }
2771 else
2772 {
2773 /* Warn for real types converted to integer types. */
2780 {
2781 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2785 /* Don't warn for short y; short x = ((int)y & 0xff); */
2789 {
2790 /* If both args were extended from a shortest type,
2791 use that type if that is safe. */
2798 {
2804 /* If one of the operands is a non-negative constant
2805 that fits in the target type, then the type of the
2806 other operand does not matter. */
2815 /* If constant is unsigned and fits in the target
2816 type, then the result will also fit. */
2818 && unsigned0
2821 && unsigned1
2824 }
2825 }
2826 /* Warn for integer types converted to smaller integer types. */
2830 /* When they are the same width but different signedness,
2831 then the value may change. */
2834 /* Even when converted to a bigger type, if the type is
2835 unsigned but expr is signed, then negative values
2836 will be changed. */
2842 }
2844 /* Warn for integer types converted to real types if and only if
2845 all the range of values of the integer type cannot be
2846 represented by the real type. */
2849 {
2853 /* Don't warn about char y = 0xff; float x = (int) y; */
2865 }
2867 /* Warn for real types converted to smaller real types. */
2872 }
2875 }
2877 /* Warns if the conversion of EXPR to TYPE may alter a value.
2878 This is a helper function for warnings_for_convert_and_check. */
2880 static void
2882 {
2889 /* This may happen, because for LHS op= RHS we preevaluate
2890 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2891 means we could no longer see the code of the EXPR. */
2898 {
2911 /* Conversion from boolean to a signed:1 bit-field (which only
2912 can hold the values 0 and -1) doesn't lose information - but
2913 it does change the value. */
2933 {
2934 /* In case of COND_EXPR, we do not care about the type of
2935 COND_EXPR, only about the conversion of each operand. */
2942 }
2954 }
2955 }
2957 /* Produce warnings after a conversion. RESULT is the result of
2958 converting EXPR to TYPE. This is a helper function for
2959 convert_and_check and cp_convert_and_check. */
2961 void
2963 tree result)
2964 {
2971 {
2972 /* Do not diagnose overflow in a constant expression merely
2973 because a conversion overflowed. */
2978 {
2979 /* This detects cases like converting -129 or 256 to
2980 unsigned char. */
2984 else
2986 }
2990 /* No warning for converting 0x80000000 to int. */
2998 else
3000 }
3005 else
3007 }
3010 /* Convert EXPR to TYPE, warning about conversion problems with constants.
3011 Invoke this function on every expression that is converted implicitly,
3012 i.e. because of language rules and not because of an explicit cast. */
3014 tree
3016 {
3017 tree result;
3018 tree expr_for_warning;
3020 /* Convert from a value with possible excess precision rather than
3021 via the semantic type, but do not warn about values not fitting
3022 exactly in the semantic type. */
3024 {
3030 }
3031 else
3045 }
3046 \f
3047 /* A node in a list that describes references to variables (EXPR), which are
3048 either read accesses if WRITER is zero, or write accesses, in which case
3049 WRITER is the parent of EXPR. */
3050 struct tlist
3051 {
3054 };
3056 /* Used to implement a cache the results of a call to verify_tree. We only
3057 use this for SAVE_EXPRs. */
3058 struct tlist_cache
3059 {
3063 tree expr;
3064 };
3066 /* Obstack to use when allocating tlist structures, and corresponding
3067 firstobj. */
3071 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3072 warnings. */
3074 /* SAVE_EXPRs need special treatment. We process them only once and then
3075 cache the results. */
3087 /* Create a new struct tlist and fill in its fields. */
3090 {
3097 }
3099 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3100 is nonnull, we ignore any node we find which has a writer equal to it. */
3102 static void
3104 {
3106 {
3113 }
3114 }
3116 /* Merge the nodes of ADD into TO. This merging process is done so that for
3117 each variable that already exists in TO, no new node is added; however if
3118 there is a write access recorded in ADD, and an occurrence on TO is only
3119 a read access, then the occurrence in TO will be modified to record the
3120 write. */
3122 static void
3124 {
3131 {
3138 {
3142 }
3144 {
3148 }
3150 }
3151 }
3153 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3154 references in list LIST conflict with it, excluding reads if ONLY writers
3155 is nonzero. */
3157 static void
3160 {
3163 /* Avoid duplicate warnings. */
3169 {
3173 {
3178 }
3180 }
3181 }
3183 /* Given a list LIST of references to variables, find whether any of these
3184 can cause conflicts due to missing sequence points. */
3186 static void
3188 {
3192 {
3195 }
3196 }
3198 /* Return nonzero if X is a tree that can be verified by the sequence point
3199 warnings. */
3200 static int
3202 {
3209 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3210 (lvalue_p) crash on TRY/CATCH. */
3217 /* No point to track non-const calls, they will never satisfy
3218 operand_equal_p. */
3226 }
3228 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3229 static bool
3231 {
3233 }
3235 /* Walk the tree X, and record accesses to variables. If X is written by the
3236 parent tree, WRITER is the parent.
3237 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3238 expression or its only operand forces a sequence point, then everything up
3239 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3240 in PNO_SP.
3241 Once we return, we will have emitted warnings if any subexpression before
3242 such a sequence point could be undefined. On a higher level, however, the
3243 sequence point may not be relevant, and we'll merge the two lists.
3245 Example: (b++, a) + b;
3246 The call that processes the COMPOUND_EXPR will store the increment of B
3247 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3248 processes the PLUS_EXPR will need to merge the two lists so that
3249 eventually, all accesses end up on the same list (and we'll warn about the
3250 unordered subexpressions b++ and b.
3252 A note on merging. If we modify the former example so that our expression
3253 becomes
3254 (b++, b) + a
3255 care must be taken not simply to add all three expressions into the final
3256 PNO_SP list. The function merge_tlist takes care of that by merging the
3257 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3258 way, so that no more than one access to B is recorded. */
3260 static void
3262 tree writer)
3263 {
3268 /* X may be NULL if it is the operand of an empty statement expression
3269 ({ }). */
3273 restart:
3281 {
3314 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3315 two first, to avoid warning for (a ? b++ : b++). */
3331 /* Expressions inside the LHS are not ordered wrt. the sequence points
3332 in the RHS. Example:
3333 *a = (a++, 2)
3334 Despite the fact that the modification of "a" is in the before_sp
3335 list (tmp_before), it conflicts with the use of "a" in the LHS.
3336 We can handle this by adding the contents of tmp_list3
3337 to those of tmp_before, and redoing the collision warnings for that
3338 list. */
3341 /* Exclude the LHS itself here; we first have to merge it into the
3342 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3343 didn't exclude the LHS, we'd get it twice, once as a read and once
3344 as a write. */
3355 /* We need to warn about conflicts among arguments and conflicts between
3356 args and the function address. Side effects of the function address,
3357 however, are not ordered by the sequence point of the call. */
3358 {
3359 call_expr_arg_iterator iter;
3360 tree arg;
3364 {
3369 }
3374 }
3377 /* Scan all the list, e.g. indices of multi dimensional array. */
3379 {
3385 }
3389 {
3396 {
3410 }
3414 }
3424 /* For other expressions, simply recurse on their operands.
3425 Manual tail recursion for unary expressions.
3426 Other non-expressions need not be processed. */
3428 {
3432 }
3434 {
3438 {
3443 }
3444 }
3446 }
3447 }
3449 /* Try to warn for undefined behavior in EXPR due to missing sequence
3450 points. */
3452 DEBUG_FUNCTION void
3454 {
3460 {
3463 }
3468 }
3469 \f
3470 /* Validate the expression after `case' and apply default promotions. */
3472 static tree
3474 {
3479 /* Promote char or short to int. */
3482 {
3485 }
3490 }
3491 \f
3492 /* See if the case values LOW and HIGH are in the range of the original
3493 type (i.e. before the default conversion to int) of the switch testing
3494 expression.
3495 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3496 the type before promoting it. CASE_LOW_P is a pointer to the lower
3497 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3498 if the case is not a case range.
3499 The caller has to make sure that we are not called with NULL for
3500 CASE_LOW_P (i.e. the default case).
3501 Returns true if the case label is in range of ORIG_TYPE (saturated or
3502 untouched) or false if the label is out of range. */
3504 static bool
3507 {
3512 /* If there was a problem with the original type, do nothing. */
3519 /* Case label is less than minimum for type. */
3522 {
3526 }
3528 /* Case value is greater than maximum for type. */
3531 {
3534 }
3536 /* Saturate lower case label value to minimum. */
3539 {
3543 }
3545 /* Saturate upper case label value to maximum. */
3548 {
3552 }
3560 }
3561 \f
3562 /* Return an integer type with BITS bits of precision,
3563 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3565 tree
3567 {
3609 }
3611 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3612 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3613 and saturating if SATP is nonzero, otherwise not saturating. */
3615 tree
3618 {
3619 machine_mode mode;
3622 else
3630 {
3632 "fixed-point types that have too many integral and "
3635 }
3638 }
3640 /* Used for communication between c_common_type_for_mode and
3641 c_register_builtin_type. */
3642 tree registered_builtin_types;
3644 /* Return a data type that has machine mode MODE.
3645 If the mode is an integer,
3646 then UNSIGNEDP selects between signed and unsigned types.
3647 If the mode is a fixed-point mode,
3648 then UNSIGNEDP selects between saturating and nonsaturating types. */
3650 tree
3652 {
3653 tree t;
3693 #if HOST_BITS_PER_WIDE_INT >= 64
3696 #endif
3721 {
3722 machine_mode inner_mode;
3723 tree inner_type;
3739 }
3741 {
3746 }
3756 {
3842 }
3850 }
3852 tree
3854 {
3856 }
3858 /* Return a signed type the same as TYPE in other respects. */
3860 tree
3862 {
3864 }
3866 /* Return a type the same as TYPE except unsigned or
3867 signed according to UNSIGNEDP. */
3869 tree
3871 {
3872 tree type1;
3875 /* This block of code emulates the behavior of the old
3876 c_common_unsigned_type. In particular, it returns
3877 long_unsigned_type_node if passed a long, even when a int would
3878 have the same size. This is necessary for warnings to work
3879 correctly in archs where sizeof(int) == sizeof(long) */
3882 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3902 #if HOST_BITS_PER_WIDE_INT >= 64
3905 #endif
3915 #define C_COMMON_FIXED_TYPES(NAME) \
3916 if (type1 == short_ ## NAME ## _type_node \
3917 || type1 == unsigned_short_ ## NAME ## _type_node) \
3918 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3919 : short_ ## NAME ## _type_node; \
3920 if (type1 == NAME ## _type_node \
3921 || type1 == unsigned_ ## NAME ## _type_node) \
3922 return unsignedp ? unsigned_ ## NAME ## _type_node \
3923 : NAME ## _type_node; \
3924 if (type1 == long_ ## NAME ## _type_node \
3925 || type1 == unsigned_long_ ## NAME ## _type_node) \
3926 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3927 : long_ ## NAME ## _type_node; \
3928 if (type1 == long_long_ ## NAME ## _type_node \
3929 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3930 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3931 : long_long_ ## NAME ## _type_node;
3933 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3934 if (type1 == NAME ## _type_node \
3935 || type1 == u ## NAME ## _type_node) \
3936 return unsignedp ? u ## NAME ## _type_node \
3937 : NAME ## _type_node;
3939 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3940 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3941 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3942 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3943 : sat_ ## short_ ## NAME ## _type_node; \
3944 if (type1 == sat_ ## NAME ## _type_node \
3945 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3946 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3947 : sat_ ## NAME ## _type_node; \
3948 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3949 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3950 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3951 : sat_ ## long_ ## NAME ## _type_node; \
3952 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3953 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3954 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3955 : sat_ ## long_long_ ## NAME ## _type_node;
3957 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3958 if (type1 == sat_ ## NAME ## _type_node \
3959 || type1 == sat_ ## u ## NAME ## _type_node) \
3960 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3961 : sat_ ## NAME ## _type_node;
3987 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3988 the precision; they have precision set to match their range, but
3989 may use a wider mode to match an ABI. If we change modes, we may
3990 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3991 the precision as well, so as to yield correct results for
3992 bit-field types. C++ does not have these separate bit-field
3993 types, and producing a signed or unsigned variant of an
3994 ENUMERAL_TYPE may cause other problems as well. */
4000 #define TYPE_OK(node) \
4001 (TYPE_MODE (type) == TYPE_MODE (node) \
4002 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4026 #if HOST_BITS_PER_WIDE_INT >= 64
4029 #endif
4038 #undef TYPE_OK
4041 }
4043 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4045 tree
4047 {
4050 /* Extended integer types of the same width as a standard type have
4051 lesser rank, so those of the same width as int promote to int or
4052 unsigned int and are valid for printf formats expecting int or
4053 unsigned int. To avoid such special cases, avoid creating
4054 extended integer types for bit-fields if a standard integer type
4055 is available. */
4073 }
4075 /* The C version of the register_builtin_type langhook. */
4077 void
4079 {
4080 tree decl;
4090 }
4091 \f
4092 /* Print an error message for invalid operands to arith operation
4093 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4094 LOCATION is the location of the message. */
4096 void
4099 {
4103 {
4148 }
4152 }
4153 \f
4154 /* Given an expression as a tree, return its original type. Do this
4155 by stripping any conversion that preserves the sign and precision. */
4156 static tree
4158 {
4161 }
4163 /* Subroutine of build_binary_op, used for comparison operations.
4164 See if the operands have both been converted from subword integer types
4165 and, if so, perhaps change them both back to their original type.
4166 This function is also responsible for converting the two operands
4167 to the proper common type for comparison.
4169 The arguments of this function are all pointers to local variables
4170 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4171 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4173 LOC is the location of the comparison.
4175 If this function returns nonzero, it means that the comparison has
4176 a constant value. What this function returns is an expression for
4177 that value. */
4179 tree
4182 {
4183 tree type;
4191 /* Throw away any conversions to wider types
4192 already present in the operands. */
4197 /* If primopN is first sign-extended from primopN's precision to opN's
4198 precision, then zero-extended from opN's precision to
4199 *restype_ptr precision, shortenings might be invalid. */
4202 && !unsignedp0
4207 && !unsignedp1
4211 /* Handle the case that OP0 does not *contain* a conversion
4212 but it *requires* conversion to FINAL_TYPE. */
4219 /* If one of the operands must be floated, we cannot optimize. */
4223 /* If first arg is constant, swap the args (changing operation
4224 so value is preserved), for canonicalization. Don't do this if
4225 the second arg is 0. */
4230 {
4247 {
4262 }
4264 }
4266 /* If comparing an integer against a constant more bits wide,
4267 maybe we can deduce a value of 1 or 0 independent of the data.
4268 Or else truncate the constant now
4269 rather than extend the variable at run time.
4271 This is only interesting if the constant is the wider arg.
4272 Also, it is not safe if the constant is unsigned and the
4273 variable arg is signed, since in this case the variable
4274 would be sign-extended and then regarded as unsigned.
4275 Our technique fails in this case because the lowest/highest
4276 possible unsigned results don't follow naturally from the
4277 lowest/highest possible values of the variable operand.
4278 For just EQ_EXPR and NE_EXPR there is another technique that
4279 could be used: see if the constant can be faithfully represented
4280 in the other operand's type, by truncating it and reextending it
4281 and see if that preserves the constant's value. */
4287 {
4290 /* 1 if comparison is nominally unsigned. */
4292 tree val;
4304 {
4305 /* Convert primop1 to target type, but do not introduce
4306 additional overflow. We know primop1 is an int_cst. */
4313 }
4315 {
4318 }
4326 /* This used to be a switch, but Genix compiler can't handle that. */
4328 {
4331 }
4333 {
4336 }
4338 {
4343 }
4345 {
4350 }
4352 {
4357 }
4359 {
4364 }
4366 /* If primop0 was sign-extended and unsigned comparison specd,
4367 we did a signed comparison above using the signed type bounds.
4368 But the comparison we output must be unsigned.
4370 Also, for inequalities, VAL is no good; but if the signed
4371 comparison had *any* fixed result, it follows that the
4372 unsigned comparison just tests the sign in reverse
4373 (positive values are LE, negative ones GE).
4374 So we can generate an unsigned comparison
4375 against an extreme value of the signed type. */
4378 {
4381 {
4396 }
4398 }
4401 {
4408 }
4411 {
4412 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4416 }
4418 /* Value is not predetermined, but do the comparison
4419 in the type of the operand that is not constant.
4420 TYPE is already properly set. */
4421 }
4423 /* If either arg is decimal float and the other is float, find the
4424 proper common type to use for comparison. */
4430 /* If either arg is decimal float and the other is float, fail. */
4441 /* If args' natural types are both narrower than nominal type
4442 and both extend in the same manner, compare them
4443 in the type of the wider arg.
4444 Otherwise must actually extend both to the nominal
4445 common type lest different ways of extending
4446 alter the result.
4447 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4452 {
4456 type);
4457 /* Make sure shorter operand is extended the right way
4458 to match the longer operand. */
4459 primop0
4462 primop0);
4463 primop1
4466 primop1);
4467 }
4468 else
4469 {
4470 /* Here we must do the comparison on the nominal type
4471 using the args exactly as we received them. */
4478 {
4480 /* All unsigned values are >= 0, so we warn. However,
4481 if OP0 is a constant that is >= 0, the signedness of
4482 the comparison isn't an issue, so suppress the
4483 warning. */
4488 primop0)))
4489 /* Do not warn for enumeration types. */
4493 {
4510 }
4513 {
4514 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4519 }
4520 }
4521 }
4529 }
4530 \f
4531 /* Return a tree for the sum or difference (RESULTCODE says which)
4532 of pointer PTROP and integer INTOP. */
4534 tree
4537 {
4540 /* The result is a pointer of the same type that is being added. */
4543 /* If the pointer lives in UPC shared memory, then
4544 drop the 'shared' qualifier. */
4549 {
4556 }
4558 {
4565 }
4566 else
4569 /* We are manipulating pointer values, so we don't need to warn
4570 about relying on undefined signed overflow. We disable the
4571 warning here because we use integer types so fold won't know that
4572 they are really pointers. */
4575 /* If what we are about to multiply by the size of the elements
4576 contains a constant term, apply distributive law
4577 and multiply that constant term separately.
4578 This helps produce common subexpressions. */
4583 /* If the constant comes from pointer subtraction,
4584 skip this optimization--it would cause an error. */
4586 /* If the constant is unsigned, and smaller than the pointer size,
4587 then we must skip this optimization. This is because it could cause
4588 an overflow error if the constant is negative but INTOP is not. */
4592 {
4597 /* Convert both subexpression types to the type of intop,
4598 because weird cases involving pointer arithmetic
4599 can result in a sum or difference with different type args. */
4604 }
4606 /* Convert the integer argument to a type the same size as sizetype
4607 so the multiply won't overflow spuriously. */
4613 /* Replace the integer argument with a suitable product by the object size.
4614 Do this multiplication as signed, then convert to the appropriate type
4615 for the pointer operation and disregard an overflow that occurred only
4616 because of the sign-extension change in the latter conversion. */
4617 {
4624 }
4626 /* Create the sum or difference. */
4635 }
4636 \f
4637 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4638 and if NON_CONST is known not to be permitted in an evaluated part
4639 of a constant expression. */
4641 tree
4643 {
4647 /* This should never be called for C++. */
4651 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4660 }
4662 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4663 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4664 around the SAVE_EXPR if needed so that c_fully_fold does not need
4665 to look inside SAVE_EXPRs. */
4667 tree
4669 {
4678 }
4680 /* Return whether EXPR is a declaration whose address can never be
4681 NULL. */
4683 bool
4685 {
4690 }
4692 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4693 or for an `if' or `while' statement or ?..: exp. It should already
4694 have been validated to be of suitable type; otherwise, a bad
4695 diagnostic may result.
4697 The EXPR is located at LOCATION.
4699 This preparation consists of taking the ordinary
4700 representation of an expression expr and producing a valid tree
4701 boolean expression describing whether expr is nonzero. We could
4702 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4703 but we optimize comparisons, &&, ||, and !.
4705 The resulting type should always be `truthvalue_type_node'. */
4707 tree
4709 {
4711 {
4753 ? truthvalue_true_node
4759 ? truthvalue_true_node
4764 /* Fall through. */
4767 {
4770 {
4771 /* Common Ada/Pascal programmer's mistake. */
4773 OPT_Waddress,
4775 inner);
4777 }
4779 }
4796 /* These don't change whether an object is nonzero or zero. */
4801 /* These don't change whether an object is zero or nonzero, but
4802 we can't ignore them if their second arg has side-effects. */
4804 {
4807 c_common_truthvalue_conversion
4810 }
4811 else
4816 /* Distribute the conversion into the arms of a COND_EXPR. */
4818 {
4821 /* In C++ one of the arms might have void type if it is throw. */
4829 }
4830 else
4831 {
4832 /* Folding will happen later for C. */
4840 }
4842 CASE_CONVERT:
4843 {
4847 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4848 since that affects how `default_conversion' will behave. */
4852 /* Don't strip a conversion from C++0x scoped enum, since they
4853 don't implicitly convert to other types. */
4857 /* If this isn't narrowing the argument, we can ignore it. */
4861 }
4867 {
4871 }
4876 }
4879 {
4881 expr = (build_binary_op
4885 c_common_truthvalue_conversion
4888 c_common_truthvalue_conversion
4893 }
4896 {
4901 }
4902 else
4905 ret:
4908 }
4909 \f
4918 /* Apply the TYPE_QUALS to the new DECL. */
4920 void
4922 {
4930 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4931 constructor can produce constant init, so rely on cp_finish_decl to
4932 clear TREE_READONLY if the variable has non-constant init. */
4935 {
4938 }
4940 {
4942 /* Allow 'restrict' on arrays of pointers.
4943 FIXME currently we just ignore it. */
4949 }
4951 {
4957 /* The declaration's type should have been previously defined
4958 as a UPC shared type. */
4960 }
4961 }
4964 {
4967 };
4969 /* Hash function for the problem of multiple type definitions in
4970 different files. This must hash all types that will compare
4971 equal via comptypes to the same value. In practice it hashes
4972 on some of the simple stuff and leaves the details to comptypes. */
4974 hashval_t
4976 {
4979 tree t2;
4981 {
4982 /* For pointers, hash on pointee type plus some swizzling. */
4985 /* Hash on number of elements and total size. */
5004 }
5005 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
5006 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
5008 /* We might have a VLA here. */
5011 else
5014 }
5016 bool
5018 {
5020 }
5024 /* Return the typed-based alias set for T, which may be an expression
5025 or a type. Return -1 if we don't do anything special. */
5027 alias_set_type
5029 {
5030 tree u;
5032 /* For VLAs, use the alias set of the element type rather than the
5033 default of alias set 0 for types compared structurally. */
5035 {
5039 }
5041 /* Permit type-punning when accessing a union, provided the access
5042 is directly through the union. For example, this code does not
5043 permit taking the address of a union member and then storing
5044 through it. Even the type-punning allowed here is a GCC
5045 extension, albeit a common and useful one; the C standard says
5046 that such accesses have implementation-defined behavior. */
5054 /* That's all the expressions we handle specially. */
5058 /* The C standard guarantees that any object may be accessed via an
5059 lvalue that has character type. */
5065 /* The C standard specifically allows aliasing between signed and
5066 unsigned variants of the same type. We treat the signed
5067 variant as canonical. */
5069 {
5072 /* t1 == t can happen for boolean nodes which are always unsigned. */
5075 }
5077 /* For the time being, make UPC pointers-to-shared conflict
5078 with everything else. Ideally, UPC pointers-to-shared should
5079 only conflict with the internal type used to represent
5080 the UPC pointer-to-shared (i.e., upc_pts_rep_type_node). */
5089 /* Handle the case of multiple type nodes referring to "the same" type,
5090 which occurs with IMA. These share an alias set. FIXME: Currently only
5091 C90 is handled. (In C99 type compatibility is not transitive, which
5092 complicates things mightily. The alias set splay trees can theoretically
5093 represent this, but insertion is tricky when you consider all the
5094 different orders things might arrive in.) */
5099 /* Save time if there's only one input file. */
5103 /* Pointers need special handling if they point to any type that
5104 needs special handling (below). */
5106 {
5107 tree t2;
5108 /* Find bottom type under any nested POINTERs. */
5112 ;
5120 }
5121 /* These are the only cases that need special handling. */
5128 /* Undefined? */
5132 /* Look up t in hash table. Only one of the compatible types within each
5133 alias set is recorded in the table. */
5138 {
5141 }
5142 else
5143 /* Our caller will assign and record (in t) a new alias set; all we need
5144 to do is remember t in the hash table. */
5148 }
5149 \f
5150 /* Return the value of THREADS.
5152 UPC defines a reserved variable, THREADS, which returns the
5153 number of threads that will be created when the UPC program
5154 executes. The value of threads can be specified at runtime via
5155 the -fupc-threads=N switch, where N is an integer specifying
5156 the number of threads. When the value of THREADS is specified
5157 at compile-time, this is called the "static threads compilation
5158 environment".
5160 In the static threads compilation environment, THREADS is a
5161 pre-defined preprocessor macro with the value, N.
5163 If no value for threads is given at compile-time, then the value
5164 must be specified when the application program is executed.
5165 This method of establishing the value of THREADS is called
5166 the "dynamic threads compilation environment". */
5168 tree
5170 {
5171 tree n;
5176 {
5178 "when compiling pre-processed source, "
5179 "all -fupc-* switches must be passed on the command line, "
5180 "asserting the same values as supplied when the "
5183 }
5186 }
5188 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5189 the IS_SIZEOF parameter indicates which operator is being applied.
5190 The COMPLAIN flag controls whether we should diagnose possibly
5191 ill-formed constructs or not. LOC is the location of the SIZEOF or
5192 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5193 a type in any context should be returned, rather than the normal
5194 alignment for that type. */
5196 tree
5200 {
5208 {
5210 {
5217 }
5218 else
5219 {
5221 {
5225 else
5228 }
5230 }
5231 }
5233 {
5235 {
5242 }
5243 else
5246 }
5249 {
5254 }
5257 {
5262 }
5263 else
5264 {
5266 /* Convert in case a char is more than one unit. */
5272 else
5274 }
5279 {
5282 }
5284 /* VALUE will have the middle-end integer type sizetype.
5285 However, we should really return a value of type `size_t',
5286 which is just a typedef for an ordinary integer type. */
5290 }
5292 /* Implement the __alignof keyword: Return the minimum required
5293 alignment of EXPR, measured in bytes. For VAR_DECLs,
5294 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5295 from an "aligned" __attribute__ specification). LOC is the
5296 location of the ALIGNOF operator. */
5298 tree
5300 {
5301 tree t;
5308 {
5311 }
5317 {
5324 {
5331 }
5333 }
5334 else
5338 }
5339 \f
5340 /* Handle C and C++ default attributes. */
5342 enum built_in_attribute
5343 {
5344 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5345 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5346 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5347 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5348 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5350 #undef DEF_ATTR_NULL_TREE
5351 #undef DEF_ATTR_INT
5352 #undef DEF_ATTR_STRING
5353 #undef DEF_ATTR_IDENT
5354 #undef DEF_ATTR_TREE_LIST
5355 ATTR_LAST
5356 };
5362 enum c_builtin_type
5363 {
5364 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5365 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5366 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5367 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5368 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5369 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5370 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5371 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5372 ARG6) NAME,
5373 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5374 ARG6, ARG7) NAME,
5375 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5376 ARG6, ARG7, ARG8) NAME,
5377 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5378 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5379 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5380 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5381 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5382 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5383 NAME,
5384 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5385 ARG6, ARG7) NAME,
5386 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5387 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5388 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5390 #undef DEF_PRIMITIVE_TYPE
5391 #undef DEF_FUNCTION_TYPE_0
5392 #undef DEF_FUNCTION_TYPE_1
5393 #undef DEF_FUNCTION_TYPE_2
5394 #undef DEF_FUNCTION_TYPE_3
5395 #undef DEF_FUNCTION_TYPE_4
5396 #undef DEF_FUNCTION_TYPE_5
5397 #undef DEF_FUNCTION_TYPE_6
5398 #undef DEF_FUNCTION_TYPE_7
5399 #undef DEF_FUNCTION_TYPE_8
5400 #undef DEF_FUNCTION_TYPE_VAR_0
5401 #undef DEF_FUNCTION_TYPE_VAR_1
5402 #undef DEF_FUNCTION_TYPE_VAR_2
5403 #undef DEF_FUNCTION_TYPE_VAR_3
5404 #undef DEF_FUNCTION_TYPE_VAR_4
5405 #undef DEF_FUNCTION_TYPE_VAR_5
5406 #undef DEF_FUNCTION_TYPE_VAR_7
5407 #undef DEF_FUNCTION_TYPE_VAR_11
5408 #undef DEF_POINTER_TYPE
5409 BT_LAST
5410 };
5414 /* A temporary array for c_common_nodes_and_builtins. Used in
5415 communication with def_fn_type. */
5418 /* A helper function for c_common_nodes_and_builtins. Build function type
5419 for DEF with return type RET and N arguments. If VAR is true, then the
5420 function should be variadic after those N arguments.
5422 Takes special care not to ICE if any of the types involved are
5423 error_mark_node, which indicates that said type is not in fact available
5424 (see builtin_type_for_size). In which case the function type as a whole
5425 should be error_mark_node. */
5427 static void
5429 {
5430 tree t;
5437 {
5443 }
5450 else
5453 egress:
5456 }
5458 /* Build builtin functions common to both C and C++ language
5459 frontends. */
5461 static void
5463 {
5464 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5465 builtin_types[ENUM] = VALUE;
5466 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5467 def_fn_type (ENUM, RETURN, 0, 0);
5468 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5469 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5470 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5471 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5472 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5473 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5474 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5475 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5476 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5477 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5478 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5479 ARG6) \
5480 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5481 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5482 ARG6, ARG7) \
5483 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5484 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5485 ARG6, ARG7, ARG8) \
5486 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5487 ARG7, ARG8);
5488 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5489 def_fn_type (ENUM, RETURN, 1, 0);
5490 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5491 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5492 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5493 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5494 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5495 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5496 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5497 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5498 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5499 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5500 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5501 ARG6, ARG7) \
5502 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5503 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5504 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5505 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5506 ARG7, ARG8, ARG9, ARG10, ARG11);
5507 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5508 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5512 #undef DEF_PRIMITIVE_TYPE
5513 #undef DEF_FUNCTION_TYPE_0
5514 #undef DEF_FUNCTION_TYPE_1
5515 #undef DEF_FUNCTION_TYPE_2
5516 #undef DEF_FUNCTION_TYPE_3
5517 #undef DEF_FUNCTION_TYPE_4
5518 #undef DEF_FUNCTION_TYPE_5
5519 #undef DEF_FUNCTION_TYPE_6
5520 #undef DEF_FUNCTION_TYPE_7
5521 #undef DEF_FUNCTION_TYPE_8
5522 #undef DEF_FUNCTION_TYPE_VAR_0
5523 #undef DEF_FUNCTION_TYPE_VAR_1
5524 #undef DEF_FUNCTION_TYPE_VAR_2
5525 #undef DEF_FUNCTION_TYPE_VAR_3
5526 #undef DEF_FUNCTION_TYPE_VAR_4
5527 #undef DEF_FUNCTION_TYPE_VAR_5
5528 #undef DEF_FUNCTION_TYPE_VAR_7
5529 #undef DEF_FUNCTION_TYPE_VAR_11
5530 #undef DEF_POINTER_TYPE
5535 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5536 NONANSI_P, ATTRS, IMPLICIT, COND) \
5537 if (NAME && COND) \
5538 def_builtin_1 (ENUM, NAME, CLASS, \
5539 builtin_types[(int) TYPE], \
5540 builtin_types[(int) LIBTYPE], \
5541 BOTH_P, FALLBACK_P, NONANSI_P, \
5542 built_in_attributes[(int) ATTRS], IMPLICIT);
5544 #undef DEF_BUILTIN
5552 }
5554 /* Like get_identifier, but avoid warnings about null arguments when
5555 the argument may be NULL for targets where GCC lacks stdint.h type
5556 information. */
5560 {
5562 }
5564 /* Build tree nodes and builtin functions common to both C and C++ language
5565 frontends. */
5567 void
5569 {
5573 tree array_domain_type;
5574 tree va_list_ref_type_node;
5575 tree va_list_arg_type_node;
5580 /* Define `int' and `char' first so that dbx will output them first. */
5584 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5585 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5586 but not C. Are the conditionals here needed? */
5592 long_unsigned_type_node);
5595 {
5603 }
5608 long_long_integer_type_node);
5610 long_long_unsigned_type_node);
5613 long_long_unsigned_type_node);
5616 short_unsigned_type_node);
5619 short_unsigned_type_node);
5621 /* Define both `signed char' and `unsigned char'. */
5625 /* These are types that c_common_type_for_size and
5626 c_common_type_for_mode use. */
5629 intQI_type_node));
5632 intHI_type_node));
5635 intSI_type_node));
5638 intDI_type_node));
5639 #if HOST_BITS_PER_WIDE_INT >= 64
5640 /* Note that this is different than the __int128 type that's part of
5641 the generic __intN support. */
5644 TYPE_DECL,
5646 intTI_type_node));
5647 #endif
5650 unsigned_intQI_type_node));
5653 unsigned_intHI_type_node));
5656 unsigned_intSI_type_node));
5659 unsigned_intDI_type_node));
5660 #if HOST_BITS_PER_WIDE_INT >= 64
5663 TYPE_DECL,
5665 unsigned_intTI_type_node));
5666 #endif
5668 /* Create the widest literal types. */
5669 widest_integer_literal_type_node
5673 widest_integer_literal_type_node));
5675 widest_unsigned_literal_type_node
5679 widest_unsigned_literal_type_node));
5683 pid_type_node =
5690 /* Only supported decimal floating point extension if the target
5691 actually supports underlying modes. */
5695 {
5699 }
5702 {
5707 long_long_fract_type_node);
5709 unsigned_short_fract_type_node);
5711 unsigned_fract_type_node);
5713 unsigned_long_fract_type_node);
5715 unsigned_long_long_fract_type_node);
5717 sat_short_fract_type_node);
5720 sat_long_fract_type_node);
5722 sat_long_long_fract_type_node);
5724 sat_unsigned_short_fract_type_node);
5726 sat_unsigned_fract_type_node);
5728 sat_unsigned_long_fract_type_node);
5730 sat_unsigned_long_long_fract_type_node);
5735 long_long_accum_type_node);
5737 unsigned_short_accum_type_node);
5739 unsigned_accum_type_node);
5741 unsigned_long_accum_type_node);
5743 unsigned_long_long_accum_type_node);
5745 sat_short_accum_type_node);
5748 sat_long_accum_type_node);
5750 sat_long_long_accum_type_node);
5752 sat_unsigned_short_accum_type_node);
5754 sat_unsigned_accum_type_node);
5756 sat_unsigned_long_accum_type_node);
5758 sat_unsigned_long_long_accum_type_node);
5760 }
5763 TYPE_DECL,
5765 complex_integer_type_node));
5767 TYPE_DECL,
5769 complex_float_type_node));
5771 TYPE_DECL,
5773 complex_double_type_node));
5777 complex_long_double_type_node));
5780 /* For C++, make fileptr_type_node a distinct void * type until
5781 FILE type is defined. */
5786 /* Set the TYPE_NAME for any variants that were built before
5787 record_builtin_type gave names to the built-in types. */
5788 {
5794 }
5798 /* Make a type to be the domain of a few array types
5799 whose domains don't really matter.
5800 200 is small enough that it always fits in size_t
5801 and large enough that it can hold most function names for the
5802 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5805 /* Make a type for arrays of characters.
5806 With luck nothing will ever really depend on the length of this
5807 array type. */
5808 char_array_type_node
5812 const_string_type_node
5816 /* This is special for C++ so functions can be overloaded. */
5822 {
5825 else
5828 }
5830 /* This is for wide string constants. */
5831 wchar_array_type_node
5834 /* Define 'char16_t'. */
5839 {
5844 }
5846 /* This is for UTF-16 string constants. */
5847 char16_array_type_node
5850 /* Define 'char32_t'. */
5855 {
5860 }
5862 /* This is for UTF-32 string constants. */
5863 char32_array_type_node
5866 wint_type_node =
5869 intmax_type_node =
5871 uintmax_type_node =
5875 sig_atomic_type_node =
5878 int8_type_node =
5881 int16_type_node =
5884 int32_type_node =
5887 int64_type_node =
5890 uint8_type_node =
5902 int_least8_type_node =
5905 int_least16_type_node =
5908 int_least32_type_node =
5911 int_least64_type_node =
5914 uint_least8_type_node =
5917 uint_least16_type_node =
5920 uint_least32_type_node =
5923 uint_least64_type_node =
5926 int_fast8_type_node =
5929 int_fast16_type_node =
5932 int_fast32_type_node =
5935 int_fast64_type_node =
5938 uint_fast8_type_node =
5941 uint_fast16_type_node =
5944 uint_fast32_type_node =
5947 uint_fast64_type_node =
5950 intptr_type_node =
5953 uintptr_type_node =
5956 default_function_type
5958 ptrdiff_type_node
5965 va_list_type_node));
5967 {
5970 tree ptype;
5973 {
5977 ptype));
5979 }
5980 }
5983 {
5986 }
5987 else
5988 {
5991 }
5998 /* Create the built-in __null node. It is important that this is
5999 not shared. */
6003 /* Since builtin_types isn't gc'ed, don't export these nodes. */
6005 }
6007 /* The number of named compound-literals generated thus far. */
6010 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
6012 void
6014 {
6017 compound_literal_number);
6018 compound_literal_number++;
6020 }
6022 tree
6024 {
6028 }
6031 /* Linked list of disabled built-in functions. */
6034 {
6042 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6043 begins with "__builtin_", give an error. */
6045 void
6047 {
6050 else
6051 {
6056 }
6057 }
6060 /* Return true if the built-in function NAME has been disabled, false
6061 otherwise. */
6063 static bool
6065 {
6068 {
6071 }
6073 }
6076 /* Worker for DEF_BUILTIN.
6077 Possibly define a builtin function with one or two names.
6078 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6079 nonansi_p and flag_no_nonansi_builtin. */
6081 static void
6088 {
6089 tree decl;
6102 fnattrs);
6111 }
6112 \f
6113 /* Nonzero if the type T promotes to int. This is (nearly) the
6114 integral promotions defined in ISO C99 6.3.1.1/2. */
6116 bool
6118 {
6120 {
6130 /* ??? Technically all enumerations not larger than an int
6131 promote to an int. But this is used along code paths
6132 that only want to notice a size change. */
6140 }
6141 }
6143 /* Return 1 if PARMS specifies a fixed number of parameters
6144 and none of their types is affected by default promotions. */
6146 int
6148 {
6149 const_tree t;
6151 {
6168 }
6170 }
6172 /* Recursively remove any '*' or '&' operator from TYPE. */
6173 tree
6175 {
6179 }
6181 /* Recursively remove pointer or array type from TYPE. */
6182 tree
6184 {
6188 }
6190 /* Used to compare case labels. K1 and K2 are actually tree nodes
6191 representing case labels, or NULL_TREE for a `default' label.
6192 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6193 K2, and 0 if K1 and K2 are equal. */
6195 int
6197 {
6198 /* Consider a NULL key (such as arises with a `default' label) to be
6199 smaller than anything else. */
6206 }
6208 /* Process a case label, located at LOC, for the range LOW_VALUE
6209 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6210 then this case label is actually a `default' label. If only
6211 HIGH_VALUE is NULL_TREE, then case label was declared using the
6212 usual C/C++ syntax, rather than the GNU case range extension.
6213 CASES is a tree containing all the case ranges processed so far;
6214 COND is the condition for the switch-statement itself. Returns the
6215 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6216 is created. */
6218 tree
6221 {
6222 tree type;
6223 tree label;
6224 tree case_label;
6225 splay_tree_node node;
6227 /* Create the LABEL_DECL itself. */
6230 /* If there was an error processing the switch condition, bail now
6231 before we get more confused. */
6239 {
6242 }
6244 /* Case ranges are a GNU extension. */
6251 {
6256 }
6258 {
6263 }
6266 {
6267 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6268 really a case range, even though it was written that way.
6269 Remove the HIGH_VALUE to simplify later processing. */
6274 }
6276 /* See if the case is in range of the type of the original testing
6277 expression. If both low_value and high_value are out of range,
6278 don't insert the case label and return NULL_TREE. */
6284 /* Look up the LOW_VALUE in the table of case labels we already
6285 have. */
6287 /* If there was not an exact match, check for overlapping ranges.
6288 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6289 that's a `default' label and the only overlap is an exact match. */
6291 {
6292 splay_tree_node low_bound;
6293 splay_tree_node high_bound;
6295 /* Even though there wasn't an exact match, there might be an
6296 overlap between this case range and another case range.
6297 Since we've (inductively) not allowed any overlapping case
6298 ranges, we simply need to find the greatest low case label
6299 that is smaller that LOW_VALUE, and the smallest low case
6300 label that is greater than LOW_VALUE. If there is an overlap
6301 it will occur in one of these two ranges. */
6307 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6308 the LOW_VALUE, so there is no need to check unless the
6309 LOW_BOUND is in fact itself a case range. */
6315 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6316 range is bigger than the low end of the current range, so we
6317 are only interested if the current range is a real range, and
6318 not an ordinary case label. */
6320 && high_value
6322 high_value)
6325 }
6326 /* If there was an overlap, issue an error. */
6328 {
6332 {
6336 }
6338 {
6341 }
6342 else
6343 {
6347 }
6349 }
6351 /* Add a CASE_LABEL to the statement-tree. */
6353 /* Register this case label in the splay tree. */
6360 error_out:
6361 /* Add a label so that the back-end doesn't think that the beginning of
6362 the switch is unreachable. Note that we do not add a case label, as
6363 that just leads to duplicates and thence to failure later on. */
6365 {
6368 }
6370 }
6372 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6373 Used to verify that case values match up with enumerator values. */
6375 static void
6377 {
6384 else
6391 buf);
6392 else
6397 }
6399 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6400 Used to verify that case values match up with enumerator values. */
6402 static int
6404 {
6408 /* Skip default case. */
6412 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6413 when we did our enum->case scan. Reset our scratch bit after. */
6416 else
6419 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6420 not set, that means that CASE_HIGH did not appear when we did our
6421 enum->case scan. Reset our scratch bit after. */
6423 {
6426 else
6428 }
6431 }
6433 /* Handle -Wswitch*. Called from the front end after parsing the
6434 switch construct. */
6435 /* ??? Should probably be somewhere generic, since other languages
6436 besides C and C++ would want this. At the moment, however, C/C++
6437 are the only tree-ssa languages that support enumerations at all,
6438 so the point is moot. */
6440 void
6443 {
6444 splay_tree_node default_node;
6445 splay_tree_node node;
6446 tree chain;
6456 /* From here on, we only care about about enumerated types. */
6460 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6464 /* Check the cases. Warn about case values which are not members of
6465 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6466 there is no default case, check that exactly all enumeration
6467 literals are covered by the cases. */
6469 /* Clearing COND if it is not an integer constant simplifies
6470 the tests inside the loop below. */
6474 /* The time complexity here is O(N*lg(N)) worst case, but for the
6475 common case of monotonically increasing enumerators, it is
6476 O(N), since the nature of the splay tree will keep the next
6477 element adjacent to the root at all times. */
6480 {
6486 {
6487 /* Mark the CASE_LOW part of the case entry as seen. */
6491 }
6493 /* Even though there wasn't an exact match, there might be a
6494 case range which includes the enumerator's value. */
6497 {
6501 {
6502 /* If we match the upper bound exactly, mark the CASE_HIGH
6503 part of the case entry as seen. */
6507 }
6508 }
6510 /* We've now determined that this enumerated literal isn't
6511 handled by the case labels of the switch statement. */
6513 /* If the switch expression is a constant, we only really care
6514 about whether that constant is handled by the switch. */
6518 /* If there is a default_node, the only relevant option is
6519 Wswitch-enum. Otherwise, if both are enabled then we prefer
6520 to warn using -Wswitch because -Wswitch is enabled by -Wall
6521 while -Wswitch-enum is explicit. */
6524 ? OPT_Wswitch_enum
6528 }
6530 /* Warn if there are case expressions that don't correspond to
6531 enumerators. This can occur since C and C++ don't enforce
6532 type-checking of assignments to enumeration variables.
6534 The time complexity here is now always O(N) worst case, since
6535 we should have marked both the lower bound and upper bound of
6536 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6537 above. This scan also resets those fields. */
6540 }
6542 /* Finish an expression taking the address of LABEL (an
6543 IDENTIFIER_NODE). Returns an expression for the address.
6545 LOC is the location for the expression returned. */
6547 tree
6549 {
6550 tree result;
6560 else
6561 {
6564 /* The current function is not necessarily uninlinable.
6565 Computed gotos are incompatible with inlining, but the value
6566 here could be used only in a diagnostic, for example. */
6568 }
6571 }
6572 \f
6574 /* Given a boolean expression ARG, return a tree representing an increment
6575 or decrement (as indicated by CODE) of ARG. The front end must check for
6576 invalid cases (e.g., decrement in C++). */
6577 tree
6579 {
6580 tree val;
6585 {
6608 }
6611 }
6612 \f
6613 /* Built-in macros for stddef.h and stdint.h, that require macros
6614 defined in this file. */
6615 void
6617 {
6680 }
6682 static void
6684 {
6685 /* Fill in the built_in_attributes array. */
6686 #define DEF_ATTR_NULL_TREE(ENUM) \
6687 built_in_attributes[(int) ENUM] = NULL_TREE;
6688 #define DEF_ATTR_INT(ENUM, VALUE) \
6689 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6690 #define DEF_ATTR_STRING(ENUM, VALUE) \
6691 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6692 #define DEF_ATTR_IDENT(ENUM, STRING) \
6693 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6694 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6695 built_in_attributes[(int) ENUM] \
6696 = tree_cons (built_in_attributes[(int) PURPOSE], \
6697 built_in_attributes[(int) VALUE], \
6698 built_in_attributes[(int) CHAIN]);
6700 #undef DEF_ATTR_NULL_TREE
6701 #undef DEF_ATTR_INT
6702 #undef DEF_ATTR_IDENT
6703 #undef DEF_ATTR_TREE_LIST
6704 }
6706 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6707 identifier as an argument, so the front end shouldn't look it up. */
6709 bool
6711 {
6714 /* Unknown attribute that we'll end up ignoring, return true so we
6715 don't complain about an identifier argument. */
6721 else
6723 }
6725 /* Attribute handlers common to C front ends. */
6727 /* Handle a "packed" attribute; arguments as in
6728 struct attribute_spec.handler. */
6730 static tree
6733 {
6735 {
6739 }
6741 {
6743 /* Still pack bitfields. */
6748 else
6750 }
6751 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6752 used for DECL_REGISTER. It wouldn't mean anything anyway.
6753 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6754 that changes what the typedef is typing. */
6755 else
6756 {
6759 }
6762 }
6764 /* Handle a "nocommon" attribute; arguments as in
6765 struct attribute_spec.handler. */
6767 static tree
6771 {
6774 else
6775 {
6778 }
6781 }
6783 /* Handle a "common" attribute; arguments as in
6784 struct attribute_spec.handler. */
6786 static tree
6789 {
6792 else
6793 {
6796 }
6799 }
6801 /* Handle a "noreturn" attribute; arguments as in
6802 struct attribute_spec.handler. */
6804 static tree
6807 {
6810 /* See FIXME comment in c_common_attribute_table. */
6817 = (build_qualified_type
6818 (build_pointer_type
6822 else
6823 {
6826 }
6829 }
6831 /* Handle a "hot" and attribute; arguments as in
6832 struct attribute_spec.handler. */
6834 static tree
6837 {
6840 {
6842 {
6846 }
6847 /* Most of the rest of the hot processing is done later with
6848 lookup_attribute. */
6849 }
6850 else
6851 {
6854 }
6857 }
6859 /* Handle a "cold" and attribute; arguments as in
6860 struct attribute_spec.handler. */
6862 static tree
6865 {
6868 {
6870 {
6874 }
6875 /* Most of the rest of the cold processing is done later with
6876 lookup_attribute. */
6877 }
6878 else
6879 {
6882 }
6885 }
6887 /* Handle a "no_sanitize_address" attribute; arguments as in
6888 struct attribute_spec.handler. */
6890 static tree
6893 {
6895 {
6898 }
6901 }
6903 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6904 struct attribute_spec.handler. */
6906 static tree
6909 {
6918 }
6920 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6921 struct attribute_spec.handler. */
6923 static tree
6926 {
6928 {
6931 }
6934 }
6936 /* Handle a "stack_protect" attribute; arguments as in
6937 struct attribute_spec.handler. */
6938 static tree
6941 {
6943 {
6946 }
6947 else
6953 }
6955 /* Handle a "noinline" attribute; arguments as in
6956 struct attribute_spec.handler. */
6958 static tree
6962 {
6964 {
6966 {
6970 }
6971 else
6973 }
6974 else
6975 {
6978 }
6981 }
6983 /* Handle a "noclone" attribute; arguments as in
6984 struct attribute_spec.handler. */
6986 static tree
6990 {
6992 {
6995 }
6998 }
7000 /* Handle a "no_icf" attribute; arguments as in
7001 struct attribute_spec.handler. */
7003 static tree
7007 {
7009 {
7012 }
7015 }
7018 /* Handle a "always_inline" attribute; arguments as in
7019 struct attribute_spec.handler. */
7021 static tree
7026 {
7028 {
7030 {
7034 }
7035 else
7036 /* Set the attribute and mark it for disregarding inline
7037 limits. */
7039 }
7040 else
7041 {
7044 }
7047 }
7049 /* Handle a "gnu_inline" attribute; arguments as in
7050 struct attribute_spec.handler. */
7052 static tree
7057 {
7059 {
7060 /* Do nothing else, just set the attribute. We'll get at
7061 it later with lookup_attribute. */
7062 }
7063 else
7064 {
7067 }
7070 }
7072 /* Handle a "leaf" attribute; arguments as in
7073 struct attribute_spec.handler. */
7075 static tree
7079 {
7081 {
7084 }
7086 {
7089 }
7092 }
7094 /* Handle an "artificial" attribute; arguments as in
7095 struct attribute_spec.handler. */
7097 static tree
7102 {
7104 {
7105 /* Do nothing else, just set the attribute. We'll get at
7106 it later with lookup_attribute. */
7107 }
7108 else
7109 {
7112 }
7115 }
7117 /* Handle a "flatten" attribute; arguments as in
7118 struct attribute_spec.handler. */
7120 static tree
7122 tree args ATTRIBUTE_UNUSED,
7124 {
7126 /* Do nothing else, just set the attribute. We'll get at
7127 it later with lookup_attribute. */
7128 ;
7129 else
7130 {
7133 }
7136 }
7138 /* Handle a "warning" or "error" attribute; arguments as in
7139 struct attribute_spec.handler. */
7141 static tree
7144 {
7147 /* Do nothing else, just set the attribute. We'll get at
7148 it later with lookup_attribute. */
7149 ;
7150 else
7151 {
7154 }
7157 }
7159 /* Handle a "used" attribute; arguments as in
7160 struct attribute_spec.handler. */
7162 static tree
7165 {
7171 {
7176 }
7177 else
7178 {
7181 }
7184 }
7186 /* Handle a "unused" attribute; arguments as in
7187 struct attribute_spec.handler. */
7189 static tree
7192 {
7194 {
7202 {
7207 }
7208 else
7209 {
7212 }
7213 }
7214 else
7215 {
7219 }
7222 }
7224 /* Handle a "externally_visible" attribute; arguments as in
7225 struct attribute_spec.handler. */
7227 static tree
7232 {
7236 {
7239 {
7243 }
7244 }
7245 else
7246 {
7249 }
7252 }
7254 /* Handle the "no_reorder" attribute. Arguments as in
7255 struct attribute_spec.handler. */
7257 static tree
7259 tree name,
7260 tree,
7263 {
7268 {
7271 name);
7273 }
7276 }
7278 /* Handle a "const" attribute; arguments as in
7279 struct attribute_spec.handler. */
7281 static tree
7284 {
7287 /* See FIXME comment on noreturn in c_common_attribute_table. */
7293 = (build_qualified_type
7294 (build_pointer_type
7298 else
7299 {
7302 }
7305 }
7307 /* Handle a "transparent_union" attribute; arguments as in
7308 struct attribute_spec.handler. */
7310 static tree
7314 {
7315 tree type;
7326 {
7327 /* Make sure that the first field will work for a transparent union.
7328 If the type isn't complete yet, leave the check to the code in
7329 finish_struct. */
7331 {
7337 }
7340 {
7341 /* If the type isn't complete yet, setting the flag
7342 on a variant wouldn't ever be checked. */
7346 /* build_duplicate_type doesn't work for C++. */
7350 /* A type variant isn't good enough, since we don't a cast
7351 to such a type removed as a no-op. */
7353 }
7357 }
7359 ignored:
7362 }
7364 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7365 get the requested priority for a constructor or destructor,
7366 possibly issuing diagnostics for invalid or reserved
7367 priorities. */
7369 static priority_type
7371 {
7372 HOST_WIDE_INT pri;
7373 tree arg;
7379 {
7382 else
7385 }
7402 {
7405 "destructor priorities from 0 to %d are reserved "
7407 MAX_RESERVED_INIT_PRIORITY);
7408 else
7410 "constructor priorities from 0 to %d are reserved "
7412 MAX_RESERVED_INIT_PRIORITY);
7413 }
7416 invalid:
7419 MAX_INIT_PRIORITY);
7420 else
7422 MAX_INIT_PRIORITY);
7424 }
7426 /* Handle a "constructor" attribute; arguments as in
7427 struct attribute_spec.handler. */
7429 static tree
7433 {
7440 {
7441 priority_type priority;
7446 }
7447 else
7448 {
7451 }
7454 }
7456 /* Handle a "destructor" attribute; arguments as in
7457 struct attribute_spec.handler. */
7459 static tree
7463 {
7470 {
7471 priority_type priority;
7476 }
7477 else
7478 {
7481 }
7484 }
7486 /* Nonzero if the mode is a valid vector mode for this architecture.
7487 This returns nonzero even if there is no hardware support for the
7488 vector mode, but we can emulate with narrower modes. */
7490 static int
7492 {
7494 machine_mode innermode;
7496 /* Doh! What's going on? */
7505 /* Hardware support. Woo hoo! */
7511 /* We should probably return 1 if requesting V4DI and we have no DI,
7512 but we have V2DI, but this is probably very unlikely. */
7514 /* If we have support for the inner mode, we can safely emulate it.
7515 We may not have V2DI, but me can emulate with a pair of DIs. */
7517 }
7520 /* Handle a "mode" attribute; arguments as in
7521 struct attribute_spec.handler. */
7523 static tree
7526 {
7534 else
7535 {
7540 tree typefm;
7545 {
7551 }
7553 /* Change this type to have a type with the specified mode.
7554 First check for the special modes. */
7567 else
7570 {
7573 }
7576 {
7579 }
7583 {
7615 }
7617 {
7620 }
7623 {
7628 {
7631 }
7635 else
7638 }
7639 else
7640 {
7641 /* For fixed-point modes, we need to test if the signness of type
7642 and the machine mode are consistent. */
7645 {
7648 }
7649 /* For fixed-point modes, we need to pass saturating info. */
7653 }
7656 {
7659 }
7661 {
7662 /* For enumeral types, copy the precision from the integer
7663 type returned above. If not an INTEGER_TYPE, we can't use
7664 this mode for this type. */
7666 {
7669 }
7672 {
7675 }
7676 else
7677 {
7678 /* We cannot build a type variant, as there's code that assumes
7679 that TYPE_MAIN_VARIANT has the same mode. This includes the
7680 debug generators. Instead, create a subrange type. This
7681 results in all of the enumeral values being emitted only once
7682 in the original, and the subtype gets them by reference. */
7685 else
7688 }
7689 }
7693 {
7696 }
7699 }
7702 }
7704 /* Handle a "section" attribute; arguments as in
7705 struct attribute_spec.handler. */
7707 static tree
7710 {
7714 {
7720 {
7724 {
7726 "section attribute cannot be specified for "
7729 }
7731 /* The decl may have already been given a section attribute
7732 from a previous declaration. Ensure they match. */
7736 {
7740 }
7744 {
7747 }
7748 else
7751 }
7752 else
7753 {
7756 }
7757 }
7758 else
7759 {
7763 }
7766 }
7768 /* Check whether ALIGN is a valid user-specified alignment. If so,
7769 return its base-2 log; if not, output an error and return -1. If
7770 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7771 no error. */
7772 int
7774 {
7781 {
7784 }
7789 {
7792 }
7794 {
7797 }
7799 }
7801 /*
7802 If in c++-11, check if the c++-11 alignment constraint with respect
7803 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7804 c++-11 mode, does nothing.
7806 [dcl.align]2/ says:
7808 [* if the constant expression evaluates to a fundamental alignment,
7809 the alignment requirement of the declared entity shall be the
7810 specified fundamental alignment.
7812 * if the constant expression evaluates to an extended alignment
7813 and the implementation supports that alignment in the context
7814 of the declaration, the alignment of the declared entity shall
7815 be that alignment
7817 * if the constant expression evaluates to an extended alignment
7818 and the implementation does not support that alignment in the
7819 context of the declaration, the program is ill-formed]. */
7821 static bool
7825 {
7838 {
7840 {
7841 /* For file scope variables and static members, the target
7842 supports alignments that are at most
7843 MAX_OFILE_ALIGNMENT. */
7846 }
7847 else
7848 {
7849 #ifdef BIGGEST_FIELD_ALIGNMENT
7850 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7851 #else
7852 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7853 #endif
7854 /* For non-static members, the target supports either
7855 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7856 if it is defined or BIGGEST_ALIGNMENT. */
7861 #undef MAX_TARGET_FIELD_ALIGNMENT
7862 /* For stack variables, the target supports at most
7863 MAX_STACK_ALIGNMENT. */
7867 }
7868 }
7870 {
7871 /* Let's be liberal for types. */
7874 }
7882 }
7884 /* Handle a "aligned" attribute; arguments as in
7885 struct attribute_spec.handler. */
7887 static tree
7890 {
7894 tree align_expr;
7898 {
7903 }
7904 else
7908 {
7912 }
7920 {
7923 /* If we have a TYPE_DECL, then copy the type, so that we
7924 don't accidentally modify a builtin type. See pushdecl. */
7927 {
7934 }
7935 else
7940 }
7943 {
7946 }
7949 /* C++-11 [dcl.align/4]:
7951 When multiple alignment-specifiers are specified for an
7952 entity, the alignment requirement shall be set to the
7953 strictest specified alignment.
7955 This formally comes from the c++11 specification but we are
7956 doing it for the GNU attribute syntax as well. */
7960 {
7965 else
7969 }
7970 else
7971 {
7974 }
7977 }
7979 /* Handle a "weak" attribute; arguments as in
7980 struct attribute_spec.handler. */
7982 static tree
7987 {
7990 {
7993 }
7995 {
7999 }
8002 {
8007 }
8008 else
8012 }
8014 /* Handle an "alias" or "ifunc" attribute; arguments as in
8015 struct attribute_spec.handler, except that IS_ALIAS tells us
8016 whether this is an alias as opposed to ifunc attribute. */
8018 static tree
8021 {
8026 {
8029 }
8033 /* A static variable declaration is always a tentative definition,
8034 but the alias is a non-tentative definition which overrides. */
8037 {
8041 }
8045 {
8049 }
8051 /* Note that the very first time we process a nested declaration,
8052 decl_function_context will not be set. Indeed, *would* never
8053 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8054 we do below. After such frobbery, pushdecl would set the context.
8055 In any case, this is never what we want. */
8057 {
8058 tree id;
8062 {
8066 }
8068 /* This counts as a use of the object pointed to. */
8073 else
8077 /* ifuncs are also aliases, so set that attribute too. */
8080 }
8081 else
8082 {
8085 }
8088 {
8091 {
8094 else
8096 }
8097 }
8101 }
8103 /* Handle an "alias" or "ifunc" attribute; arguments as in
8104 struct attribute_spec.handler. */
8106 static tree
8109 {
8111 }
8113 /* Handle an "alias" or "ifunc" attribute; arguments as in
8114 struct attribute_spec.handler. */
8116 static tree
8119 {
8121 }
8123 /* Handle a "weakref" attribute; arguments as in struct
8124 attribute_spec.handler. */
8126 static tree
8129 {
8132 /* We must ignore the attribute when it is associated with
8133 local-scoped decls, since attribute alias is ignored and many
8134 such symbols do not even have a DECL_WEAK field. */
8136 || current_function_decl
8138 {
8142 }
8145 {
8149 }
8151 /* The idea here is that `weakref("name")' mutates into `weakref,
8152 alias("name")', and weakref without arguments, in turn,
8153 implicitly adds weak. */
8156 {
8163 }
8164 else
8165 {
8170 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8171 and that isn't supported; and because it wants to add it to
8172 the list of weak decls, which isn't helpful. */
8174 }
8177 {
8181 }
8184 }
8186 /* Handle an "visibility" attribute; arguments as in
8187 struct attribute_spec.handler. */
8189 static tree
8193 {
8199 {
8203 {
8205 name);
8207 }
8209 {
8213 }
8214 }
8216 {
8219 }
8222 {
8225 }
8227 /* If this is a type, set the visibility on the type decl. */
8229 {
8234 {
8236 name);
8238 }
8239 }
8249 else
8250 {
8251 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8253 }
8257 {
8271 }
8276 /* Go ahead and attach the attribute to the node as well. This is needed
8277 so we can determine whether we have VISIBILITY_DEFAULT because the
8278 visibility was not specified, or because it was explicitly overridden
8279 from the containing scope. */
8282 }
8284 /* Determine the ELF symbol visibility for DECL, which is either a
8285 variable or a function. It is an error to use this function if a
8286 definition of DECL is not available in this translation unit.
8287 Returns true if the final visibility has been determined by this
8288 function; false if the caller is free to make additional
8289 modifications. */
8291 bool
8293 {
8297 /* If the user explicitly specified the visibility with an
8298 attribute, honor that. DECL_VISIBILITY will have been set during
8299 the processing of the attribute. We check for an explicit
8300 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8301 to distinguish the use of an attribute from the use of a "#pragma
8302 GCC visibility push(...)"; in the latter case we still want other
8303 considerations to be able to overrule the #pragma. */
8305 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8310 /* Set default visibility to whatever the user supplied with
8311 visibility_specified depending on #pragma GCC visibility. */
8313 {
8316 {
8319 /* If visibility changed and DECL already has DECL_RTL, ensure
8320 symbol flags are updated. */
8325 }
8326 }
8328 }
8330 /* Handle an "tls_model" attribute; arguments as in
8331 struct attribute_spec.handler. */
8333 static tree
8336 {
8337 tree id;
8344 {
8347 }
8352 {
8355 }
8365 else
8366 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8370 }
8372 /* Handle a "no_instrument_function" attribute; arguments as in
8373 struct attribute_spec.handler. */
8375 static tree
8380 {
8384 {
8388 }
8389 else
8393 }
8395 /* Handle a "malloc" attribute; arguments as in
8396 struct attribute_spec.handler. */
8398 static tree
8401 {
8405 else
8406 {
8409 }
8412 }
8414 /* Handle a "alloc_size" attribute; arguments as in
8415 struct attribute_spec.handler. */
8417 static tree
8420 {
8423 {
8430 || !arg_count
8432 {
8437 }
8438 }
8440 }
8442 /* Handle a "alloc_align" attribute; arguments as in
8443 struct attribute_spec.handler. */
8445 static tree
8448 {
8455 || !arg_count
8457 {
8462 }
8464 }
8466 /* Handle a "assume_aligned" attribute; arguments as in
8467 struct attribute_spec.handler. */
8469 static tree
8472 {
8474 {
8481 {
8486 }
8487 }
8489 }
8491 /* Handle a "fn spec" attribute; arguments as in
8492 struct attribute_spec.handler. */
8494 static tree
8498 {
8503 }
8505 /* Handle a "bnd_variable_size" attribute; arguments as in
8506 struct attribute_spec.handler. */
8508 static tree
8511 {
8513 {
8516 }
8519 }
8521 /* Handle a "bnd_legacy" attribute; arguments as in
8522 struct attribute_spec.handler. */
8524 static tree
8527 {
8529 {
8532 }
8535 }
8537 /* Handle a "bnd_instrument" attribute; arguments as in
8538 struct attribute_spec.handler. */
8540 static tree
8543 {
8545 {
8548 }
8551 }
8553 /* Handle a "warn_unused" attribute; arguments as in
8554 struct attribute_spec.handler. */
8556 static tree
8558 tree args ATTRIBUTE_UNUSED,
8560 {
8562 /* Do nothing else, just set the attribute. We'll get at
8563 it later with lookup_attribute. */
8564 ;
8565 else
8566 {
8569 }
8572 }
8574 /* Handle an "omp declare simd" attribute; arguments as in
8575 struct attribute_spec.handler. */
8577 static tree
8579 {
8581 }
8583 /* Handle an "omp declare target" attribute; arguments as in
8584 struct attribute_spec.handler. */
8586 static tree
8588 {
8590 }
8592 /* Handle a "returns_twice" attribute; arguments as in
8593 struct attribute_spec.handler. */
8595 static tree
8598 {
8601 else
8602 {
8605 }
8608 }
8610 /* Handle a "no_limit_stack" attribute; arguments as in
8611 struct attribute_spec.handler. */
8613 static tree
8618 {
8622 {
8626 }
8628 {
8632 }
8633 else
8637 }
8639 /* Handle a "pure" attribute; arguments as in
8640 struct attribute_spec.handler. */
8642 static tree
8645 {
8648 /* ??? TODO: Support types. */
8649 else
8650 {
8653 }
8656 }
8658 /* Digest an attribute list destined for a transactional memory statement.
8659 ALLOWED is the set of attributes that are allowed for this statement;
8660 return the attribute we parsed. Multiple attributes are never allowed. */
8662 int
8664 {
8669 {
8677 {
8680 }
8683 {
8686 }
8689 else
8691 }
8694 }
8696 /* Transform a TM attribute name into a maskable integer and back.
8697 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8698 to how the lack of an attribute is treated. */
8700 int
8702 {
8716 }
8718 tree
8720 {
8723 {
8741 }
8743 }
8745 /* Return the first TM attribute seen in LIST. */
8747 tree
8749 {
8751 {
8755 }
8757 }
8759 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8760 Here we accept only function types, and verify that none of the other
8761 function TM attributes are also applied. */
8762 /* ??? We need to accept class types for C++, but not C. This greatly
8763 complicates this function, since we can no longer rely on the extra
8764 processing given by function_type_required. */
8766 static tree
8769 {
8770 /* Only one path adds the attribute; others don't. */
8774 {
8777 /* Only tm_callable and tm_safe apply to classes. */
8780 /* FALLTHRU */
8784 {
8787 ;
8790 else
8792 }
8796 {
8799 {
8804 }
8805 }
8806 /* FALLTHRU */
8809 /* If a function is next, pass it on to be tried next. */
8813 ignored:
8816 }
8819 }
8821 /* Handle the TM_WRAP attribute; arguments as in
8822 struct attribute_spec.handler. */
8824 static tree
8827 {
8830 /* We don't need the attribute even on success, since we
8831 record the entry in an external table. */
8836 else
8837 {
8840 ;
8845 else
8846 {
8850 {
8854 else
8856 }
8857 else
8859 }
8860 }
8863 }
8865 /* Ignore the given attribute. Used when this attribute may be usefully
8866 overridden by the target, but is not used generically. */
8868 static tree
8872 {
8875 }
8877 /* Handle a "no vops" attribute; arguments as in
8878 struct attribute_spec.handler. */
8880 static tree
8884 {
8888 }
8890 /* Handle a "deprecated" attribute; arguments as in
8891 struct attribute_spec.handler. */
8893 static tree
8897 {
8905 {
8908 }
8911 {
8922 else
8924 }
8926 {
8931 }
8932 else
8936 {
8939 {
8945 }
8948 else
8950 }
8953 }
8955 /* Handle a "vector_size" attribute; arguments as in
8956 struct attribute_spec.handler. */
8958 static tree
8962 {
8964 machine_mode orig_mode;
8975 {
8978 }
8980 /* Get the vector size (in bytes). */
8983 /* We need to provide for vector pointers, vector arrays, and
8984 functions returning vectors. For example:
8986 __attribute__((vector_size(16))) short *foo;
8988 In this case, the mode is SI, but the type being modified is
8989 HI, so we need to look further. */
8998 /* Get the mode of the type being modified. */
9009 {
9012 }
9015 {
9018 }
9021 {
9024 }
9026 /* Calculate how many units fit in the vector. */
9029 {
9032 }
9036 /* Build back pointers if needed. */
9040 }
9042 /* Handle the "nonnull" attribute. */
9043 static tree
9047 {
9051 /* If no arguments are specified, all pointer arguments should be
9052 non-null. Verify a full prototype is given so that the arguments
9053 will have the correct types when we actually check them later. */
9055 {
9057 {
9060 }
9062 }
9064 /* Argument list specified. Verify that each argument number references
9065 a pointer argument. */
9067 {
9076 {
9081 }
9084 {
9085 function_args_iterator iter;
9086 tree argument;
9090 {
9094 }
9098 {
9103 }
9106 {
9111 }
9112 }
9113 }
9116 }
9118 /* Check the argument list of a function call for null in argument slots
9119 that are marked as requiring a non-null pointer argument. The NARGS
9120 arguments are passed in the array ARGARRAY.
9121 */
9123 static void
9125 {
9126 tree a;
9134 /* See if any of the nonnull attributes has no arguments. If so,
9135 then every pointer argument is checked (in which case the check
9136 for pointer type is done in check_nonnull_arg). */
9138 do
9146 else
9147 {
9148 /* Walk the argument list. If we encounter an argument number we
9149 should check for non-null, do it. */
9151 {
9153 {
9157 }
9162 }
9163 }
9164 }
9166 /* Check that the Nth argument of a function call (counting backwards
9167 from the end) is a (pointer)0. The NARGS arguments are passed in the
9168 array ARGARRAY. */
9170 static void
9172 {
9176 {
9179 tree sentinel;
9180 function_args_iterator iter;
9181 tree t;
9183 /* Skip over the named arguments. */
9185 {
9188 len++;
9189 }
9192 {
9195 }
9197 /* The sentinel must be one of the varargs, i.e.
9198 in position >= the number of fixed arguments. */
9200 {
9204 }
9206 /* Validate the sentinel. */
9210 /* Although __null (in C++) is only an integer we allow it
9211 nevertheless, as we are guaranteed that it's exactly
9212 as wide as a pointer, and we don't want to force
9213 users to cast the NULL they have written there.
9214 We warn with -Wstrict-null-sentinel, though. */
9217 }
9218 }
9220 /* Helper for check_function_nonnull; given a list of operands which
9221 must be non-null in ARGS, determine if operand PARAM_NUM should be
9222 checked. */
9224 static bool
9226 {
9230 {
9237 }
9239 }
9241 /* Check that the function argument PARAM (which is operand number
9242 PARAM_NUM) is non-null. This is called by check_function_nonnull
9243 via check_function_arguments_recurse. */
9245 static void
9248 {
9249 /* Just skip checking the argument if it's not a pointer. This can
9250 happen if the "nonnull" attribute was given without an operand
9251 list (which means to check every pointer argument). */
9259 }
9261 /* Helper for nonnull attribute handling; fetch the operand number
9262 from the attribute argument list. */
9264 static bool
9266 {
9267 /* Verify the arg number is a small constant. */
9269 {
9272 }
9273 else
9275 }
9277 /* Handle a "nothrow" attribute; arguments as in
9278 struct attribute_spec.handler. */
9280 static tree
9283 {
9286 /* ??? TODO: Support types. */
9287 else
9288 {
9291 }
9294 }
9296 /* Handle a "cleanup" attribute; arguments as in
9297 struct attribute_spec.handler. */
9299 static tree
9302 {
9306 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9307 for global destructors in C++. This requires infrastructure that
9308 we don't have generically at the moment. It's also not a feature
9309 we'd be missing too much, since we do have attribute constructor. */
9311 {
9315 }
9317 /* Verify that the argument is a function in scope. */
9318 /* ??? We could support pointers to functions here as well, if
9319 that was considered desirable. */
9322 {
9326 }
9329 {
9333 }
9335 /* That the function has proper type is checked with the
9336 eventual call to build_function_call. */
9339 }
9341 /* Handle a "warn_unused_result" attribute. No special handling. */
9343 static tree
9347 {
9348 /* Ignore the attribute for functions not returning any value. */
9350 {
9353 }
9356 }
9358 /* Handle a "sentinel" attribute. */
9360 static tree
9363 {
9365 {
9369 }
9370 else
9371 {
9373 {
9377 }
9378 }
9381 {
9389 {
9393 }
9394 else
9395 {
9397 {
9401 }
9402 }
9403 }
9406 }
9408 /* Handle a "type_generic" attribute. */
9410 static tree
9414 {
9415 /* Ensure we have a function type. */
9418 /* Ensure we have a variadic function. */
9422 }
9424 /* Handle a "target" attribute. */
9426 static tree
9429 {
9430 /* Ensure we have a function type. */
9432 {
9435 }
9437 flags))
9441 }
9443 /* Arguments being collected for optimization. */
9448 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9449 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9450 false for #pragma GCC optimize. */
9452 bool
9454 {
9462 tree ap;
9464 /* Build up argv vector. Just in case the string is stored away, use garbage
9465 collected strings. */
9470 {
9474 {
9478 }
9481 {
9482 /* Split string into multiple substrings. */
9490 {
9497 {
9501 }
9502 else
9503 {
9506 }
9510 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9511 options. */
9513 {
9518 else
9522 }
9525 {
9528 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9529 itself is -Os, and any other switch begins with a -f. */
9535 }
9540 }
9542 }
9543 }
9553 /* Now parse the options. */
9563 /* Don't allow changing -fstrict-aliasing. */
9568 }
9570 /* For handling "optimize" attribute. arguments as in
9571 struct attribute_spec.handler. */
9573 static tree
9576 {
9577 /* Ensure we have a function type. */
9579 {
9582 }
9583 else
9584 {
9588 /* Save current options. */
9591 /* If we previously had some optimization options, use them as the
9592 default. */
9597 /* Parse options, and update the vector. */
9602 /* Restore current options. */
9604 }
9607 }
9609 /* Handle a "no_split_stack" attribute. */
9611 static tree
9616 {
9620 {
9624 }
9626 {
9630 }
9633 }
9635 /* Handle a "returns_nonnull" attribute; arguments as in
9636 struct attribute_spec.handler. */
9638 static tree
9641 {
9642 // Even without a prototype we still have a return type we can check.
9644 {
9647 }
9649 }
9651 /* Handle a "designated_init" attribute; arguments as in
9652 struct attribute_spec.handler. */
9654 static tree
9657 {
9659 {
9662 }
9664 }
9666 \f
9667 /* Check for valid arguments being passed to a function with FNTYPE.
9668 There are NARGS arguments in the array ARGARRAY. */
9669 void
9671 {
9672 /* Check for null being passed in a pointer argument that must be
9673 non-null. We also need to do this if format checking is enabled. */
9678 /* Check for errors in format strings. */
9685 }
9687 /* Generic argument checking recursion routine. PARAM is the argument to
9688 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9689 once the argument is resolved. CTX is context for the callback. */
9690 void
9695 {
9699 {
9700 /* Strip coercion. */
9704 }
9707 {
9709 tree attrs;
9712 /* See if this is a call to a known internationalization function
9713 that modifies a format arg. Such a function may have multiple
9714 format_arg attributes (for example, ngettext). */
9717 attrs;
9720 {
9721 tree inner_arg;
9722 tree format_num_expr;
9725 call_expr_arg_iterator iter;
9727 /* Extract the argument number, which was previously checked
9728 to be valid. */
9737 {
9742 }
9743 }
9745 /* If we found a format_arg attribute and did a recursive check,
9746 we are done with checking this argument. Otherwise, we continue
9747 and this will be considered a non-literal. */
9750 }
9753 {
9754 /* Check both halves of the conditional expression. */
9760 }
9763 }
9765 /* Checks for a builtin function FNDECL that the number of arguments
9766 NARGS against the required number REQUIRED and issues an error if
9767 there is a mismatch. Returns true if the number of arguments is
9768 correct, otherwise false. */
9770 static bool
9772 {
9774 {
9778 }
9780 {
9784 }
9786 }
9788 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9789 Returns false if there was an error, otherwise true. */
9791 bool
9793 {
9799 {
9809 {
9811 {
9815 }
9817 }
9827 {
9834 {
9838 }
9840 }
9845 {
9850 {
9854 }
9857 {
9859 fndecl);
9861 }
9863 }
9868 {
9870 {
9873 }
9875 }
9882 {
9886 {
9890 }
9893 {
9897 }
9899 }
9904 }
9905 }
9907 /* Function to help qsort sort FIELD_DECLs by name order. */
9909 int
9911 {
9916 /* A nontype is "greater" than a type. */
9925 }
9928 gt_pointer_operator new_value;
9932 /* This routine compares two fields like field_decl_cmp but using the
9933 pointer operator in resort_data. */
9935 static int
9937 {
9942 /* A nontype is "greater" than a type. */
9948 {
9955 }
9957 }
9959 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9961 void
9964 gt_pointer_operator new_value,
9966 {
9971 resort_field_decl_cmp);
9972 }
9974 /* Subroutine of c_parse_error.
9975 Return the result of concatenating LHS and RHS. RHS is really
9976 a string literal, its first character is indicated by RHS_START and
9977 RHS_SIZE is its length (including the terminating NUL character).
9979 The caller is responsible for deleting the returned pointer. */
9983 {
9989 }
9991 /* Issue the error given by GMSGID, indicating that it occurred before
9992 TOKEN, which had the associated VALUE. */
9994 void
9997 {
9998 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10008 {
10013 {
10026 }
10030 else
10036 }
10058 {
10063 }
10071 {
10076 }
10077 else
10081 {
10084 }
10085 #undef catenate_messages
10086 }
10088 /* Return the gcc option code associated with the reason for a cpp
10089 message, or 0 if none. */
10091 static int
10093 {
10097 {
10100 }
10102 }
10104 /* Callback from cpp_error for PFILE to print diagnostics from the
10105 preprocessor. The diagnostic is of type LEVEL, with REASON set
10106 to the reason code if LEVEL is represents a warning, at location
10107 LOCATION unless this is after lexing and the compiler's location
10108 should be used instead, with column number possibly overridden by
10109 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10110 the arguments. Returns true if a diagnostic was emitted, false
10111 otherwise. */
10113 bool
10117 {
10118 diagnostic_info diagnostic;
10119 diagnostic_t dlevel;
10124 {
10129 /* Fall through. */
10154 }
10167 }
10169 /* Convert a character from the host to the target execution character
10170 set. cpplib handles this, mostly. */
10172 HOST_WIDE_INT
10174 {
10175 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10176 zero-extended under -fno-signed-char. cpplib insists that characters
10177 and character constants are always unsigned. Hence we must convert
10178 back and forth. */
10186 else
10188 }
10190 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10191 references with an INDIRECT_REF of a constant at the bottom; much like the
10192 traditional rendering of offsetof as a macro. Return the folded result. */
10194 tree
10196 {
10200 {
10216 {
10219 }
10229 {
10233 }
10246 /* Check if the offset goes beyond the upper bound of the array. */
10248 {
10254 {
10258 {
10259 tree v;
10266 {
10274 }
10275 /* Don't warn if the array might be considered a poor
10276 man's flexible array member with a very permissive
10277 definition thereof. */
10281 "index %E denotes an offset "
10284 }
10285 }
10286 }
10293 /* Handle static members of volatile structs. */
10300 }
10303 }
10305 /* Likewise, but convert it to the return type of offsetof. */
10307 tree
10309 {
10311 }
10313 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10314 expression, because B will always be true. */
10316 void
10318 {
10321 "the omitted middle operand in ?: will always be %<true%>, "
10323 }
10325 /* Give an error for storing into ARG, which is 'const'. USE indicates
10326 how ARG was being used. */
10328 void
10330 {
10333 /* Using this macro rather than (for example) arrays of messages
10334 ensures that all the format strings are checked at compile
10335 time. */
10336 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10337 : (use == lv_increment ? (I) \
10338 : (use == lv_decrement ? (D) : (AS))))
10340 {
10351 else
10357 }
10363 arg);
10369 arg);
10371 {
10381 arg);
10382 }
10388 arg);
10389 else
10394 arg);
10395 }
10397 /* Print an error message for an invalid lvalue. USE says
10398 how the lvalue is being used and so selects the error message. LOC
10399 is the location for the error. */
10401 void
10403 {
10405 {
10423 }
10424 }
10426 /* Print an error message for an invalid indirection of type TYPE.
10427 ERRSTRING is the name of the operator for the indirection. */
10429 void
10431 {
10433 {
10441 type);
10446 type);
10451 type);
10456 type);
10461 type);
10465 }
10466 }
10467 \f
10468 /* *PTYPE is an incomplete array. Complete it with a domain based on
10469 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10470 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10471 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10473 int
10475 {
10483 {
10485 {
10486 int eltsize
10489 }
10491 {
10495 {
10499 }
10500 else
10501 {
10502 tree curindex;
10513 {
10517 else
10518 {
10520 {
10521 /* Since we treat size types now as ordinary
10522 unsigned types, we need an explicit overflow
10523 check. */
10527 }
10529 size_one_node);
10530 }
10533 }
10535 {
10539 }
10540 }
10541 }
10542 else
10543 {
10544 /* Make an error message unless that happened already. */
10547 }
10548 }
10549 else
10550 {
10554 }
10557 /* Force an indefinite layout factor. */
10560 size_zero_node);
10565 else
10568 /* Using build_distinct_type_copy and modifying things afterward instead
10569 of using build_array_type to create a new type preserves all of the
10570 TYPE_LANG_FLAG_? bits that the front end may have set. */
10578 /* Make sure we have the canonical MAIN_TYPE. */
10581 hashcode);
10584 /* Fix the canonical type. */
10594 else
10599 else
10605 {
10607 /* If we proceed with the array type as it is, we'll eventually
10608 crash in tree_to_[su]hwi(). */
10610 }
10614 }
10616 /* Like c_mark_addressable but don't check register qualifier. */
10617 void
10619 {
10625 }
10628 \f
10629 /* Used to help initialize the builtin-types.def table. When a type of
10630 the correct size doesn't exist, use error_mark_node instead of NULL.
10631 The later results in segfaults even when a decl using the type doesn't
10632 get invoked. */
10634 tree
10636 {
10639 }
10641 /* A helper function for resolve_overloaded_builtin in resolving the
10642 overloaded __sync_ builtins. Returns a positive power of 2 if the
10643 first operand of PARAMS is a pointer to a supported data type.
10644 Returns 0 if an error is encountered. */
10646 static int
10648 {
10649 tree type;
10653 {
10656 }
10660 {
10661 /* Force array-to-pointer decay for C++. */
10665 }
10677 incompatible:
10680 }
10682 /* A helper function for resolve_overloaded_builtin. Adds casts to
10683 PARAMS to make arguments match up with those of FUNCTION. Drops
10684 the variadic arguments at the end. Returns false if some error
10685 was encountered; true on success. */
10687 static bool
10690 {
10691 function_args_iterator iter;
10692 tree ptype;
10696 /* We've declared the implementation functions to use "volatile void *"
10697 as the pointer parameter, so we shouldn't get any complaints from the
10698 call to check_function_arguments what ever type the user used. */
10703 /* For the rest of the values, we need to cast these to FTYPE, so that we
10704 don't get warnings for passing pointer types, etc. */
10707 {
10711 /* XXX void_type_node belies the abstraction. */
10717 {
10720 }
10722 /* Only convert parameters if arg_type is unsigned integer type with
10723 new format sync routines, i.e. don't attempt to convert pointer
10724 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10725 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10726 kinds). */
10728 {
10729 /* Ideally for the first conversion we'd use convert_for_assignment
10730 so that we get warnings for anything that doesn't match the pointer
10731 type. This isn't portable across the C and C++ front ends atm. */
10736 }
10739 }
10741 /* __atomic routines are not variadic. */
10743 {
10746 }
10748 /* The definition of these primitives is variadic, with the remaining
10749 being "an optional list of variables protected by the memory barrier".
10750 No clue what that's supposed to mean, precisely, but we consider all
10751 call-clobbered variables to be protected so we're safe. */
10755 }
10757 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10758 RESULT to make it match the type of the first pointer argument in
10759 PARAMS. */
10761 static tree
10763 {
10768 /* New format doesn't require casting unless the types are the same size. */
10771 else
10773 }
10775 /* This function verifies the PARAMS to generic atomic FUNCTION.
10776 It returns the size if all the parameters are the same size, otherwise
10777 0 is returned if the parameters are invalid. */
10779 static int
10782 {
10787 tree type_0;
10789 /* Determine the parameter makeup. */
10791 {
10807 }
10810 {
10813 }
10815 /* Get type of first parameter, and determine its size. */
10818 {
10819 /* Force array-to-pointer decay for C++. */
10823 }
10825 {
10827 function);
10829 }
10831 /* Types must be compile time constant sizes. */
10833 {
10836 function);
10838 }
10842 /* Zero size objects are not allowed. */
10844 {
10847 function);
10849 }
10851 /* Check each other parameter is a pointer and the same size. */
10853 {
10856 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10860 {
10862 function);
10864 }
10868 {
10870 function);
10872 }
10873 }
10875 /* Check memory model parameters for validity. */
10877 {
10880 {
10883 {
10886 function);
10887 }
10888 }
10889 else
10891 {
10893 function);
10895 }
10896 }
10899 }
10902 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10903 at the beginning of the parameter list PARAMS representing the size of the
10904 objects. This is to match the library ABI requirement. LOC is the location
10905 of the function call.
10906 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10907 returned to allow the external call to be constructed. */
10909 static tree
10912 {
10913 tree size_node;
10915 /* Insert a SIZE_T parameter as the first param. If there isn't
10916 enough space, allocate a new vector and recursively re-build with that. */
10918 {
10921 tree f;
10931 }
10933 /* Add the size parameter and leave as a function call for processing. */
10937 }
10940 /* Return whether atomic operations for naturally aligned N-byte
10941 arguments are supported, whether inline or through libatomic. */
10942 static bool
10944 {
10946 {
10958 }
10959 }
10961 /* This will process an __atomic_exchange function call, determine whether it
10962 needs to be mapped to the _N variation, or turned into a library call.
10963 LOC is the location of the builtin call.
10964 FUNCTION is the DECL that has been invoked;
10965 PARAMS is the argument list for the call. The return value is non-null
10966 TRUE is returned if it is translated into the proper format for a call to the
10967 external library, and NEW_RETURN is set the tree for that function.
10968 FALSE is returned if processing for the _N variation is required, and
10969 NEW_RETURN is set to the the return value the result is copied into. */
10970 static bool
10973 {
10978 /* Size of 0 is an error condition. */
10980 {
10983 }
10985 /* If not a lock-free size, change to the library generic format. */
10987 {
10990 }
10992 /* Otherwise there is a lockfree match, transform the call from:
10993 void fn(T* mem, T* desired, T* return, model)
10994 into
10995 *return = (T) (fn (In* mem, (In) *desired, model)) */
11002 /* Create pointer to appropriate size. */
11006 /* Convert object pointer to required type. */
11009 /* Convert new value to required type, and dereference it. */
11014 /* Move memory model to the 3rd position, and end param list. */
11018 /* Convert return pointer and dereference it for later assignment. */
11022 }
11025 /* This will process an __atomic_compare_exchange function call, determine
11026 whether it needs to be mapped to the _N variation, or turned into a lib call.
11027 LOC is the location of the builtin call.
11028 FUNCTION is the DECL that has been invoked;
11029 PARAMS is the argument list for the call. The return value is non-null
11030 TRUE is returned if it is translated into the proper format for a call to the
11031 external library, and NEW_RETURN is set the tree for that function.
11032 FALSE is returned if processing for the _N variation is required. */
11034 static bool
11038 {
11043 /* Size of 0 is an error condition. */
11045 {
11048 }
11050 /* If not a lock-free size, change to the library generic format. */
11052 {
11053 /* The library generic format does not have the weak parameter, so
11054 remove it from the param list. Since a parameter has been removed,
11055 we can be sure that there is room for the SIZE_T parameter, meaning
11056 there will not be a recursive rebuilding of the parameter list, so
11057 there is no danger this will be done twice. */
11059 {
11063 }
11066 }
11068 /* Otherwise, there is a match, so the call needs to be transformed from:
11069 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11070 into
11071 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11077 /* Create pointer to appropriate size. */
11081 /* Convert object pointer to required type. */
11085 /* Convert expected pointer to required type. */
11089 /* Convert desired value to required type, and dereference it. */
11094 /* The rest of the parameters are fine. NULL means no special return value
11095 processing.*/
11098 }
11101 /* This will process an __atomic_load function call, determine whether it
11102 needs to be mapped to the _N variation, or turned into a library call.
11103 LOC is the location of the builtin call.
11104 FUNCTION is the DECL that has been invoked;
11105 PARAMS is the argument list for the call. The return value is non-null
11106 TRUE is returned if it is translated into the proper format for a call to the
11107 external library, and NEW_RETURN is set the tree for that function.
11108 FALSE is returned if processing for the _N variation is required, and
11109 NEW_RETURN is set to the the return value the result is copied into. */
11111 static bool
11114 {
11119 /* Size of 0 is an error condition. */
11121 {
11124 }
11126 /* If not a lock-free size, change to the library generic format. */
11128 {
11131 }
11133 /* Otherwise, there is a match, so the call needs to be transformed from:
11134 void fn(T* mem, T* return, model)
11135 into
11136 *return = (T) (fn ((In *) mem, model)) */
11142 /* Create pointer to appropriate size. */
11146 /* Convert object pointer to required type. */
11150 /* Move memory model to the 2nd position, and end param list. */
11154 /* Convert return pointer and dereference it for later assignment. */
11158 }
11161 /* This will process an __atomic_store function call, determine whether it
11162 needs to be mapped to the _N variation, or turned into a library call.
11163 LOC is the location of the builtin call.
11164 FUNCTION is the DECL that has been invoked;
11165 PARAMS is the argument list for the call. The return value is non-null
11166 TRUE is returned if it is translated into the proper format for a call to the
11167 external library, and NEW_RETURN is set the tree for that function.
11168 FALSE is returned if processing for the _N variation is required, and
11169 NEW_RETURN is set to the the return value the result is copied into. */
11171 static bool
11174 {
11179 /* Size of 0 is an error condition. */
11181 {
11184 }
11186 /* If not a lock-free size, change to the library generic format. */
11188 {
11191 }
11193 /* Otherwise, there is a match, so the call needs to be transformed from:
11194 void fn(T* mem, T* value, model)
11195 into
11196 fn ((In *) mem, (In) *value, model) */
11201 /* Create pointer to appropriate size. */
11205 /* Convert object pointer to required type. */
11209 /* Convert new value to required type, and dereference it. */
11214 /* The memory model is in the right spot already. Return is void. */
11218 }
11221 /* Some builtin functions are placeholders for other expressions. This
11222 function should be called immediately after parsing the call expression
11223 before surrounding code has committed to the type of the expression.
11225 LOC is the location of the builtin call.
11227 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11228 PARAMS is the argument list for the call. The return value is non-null
11229 when expansion is complete, and null if normal processing should
11230 continue. */
11232 tree
11235 {
11241 {
11247 else
11251 }
11253 /* Handle BUILT_IN_NORMAL here. */
11255 {
11260 {
11261 /* Handle these 4 together so that they can fall through to the next
11262 case if the call is transformed to an _N variant. */
11264 {
11266 {
11270 /* Change to the _N variant. */
11273 }
11276 {
11278 params,
11281 /* Change to the _N variant. */
11284 }
11286 {
11290 /* Change to the _N variant. */
11293 }
11295 {
11299 /* Change to the _N variant. */
11302 }
11305 }
11306 /* Fallthrough to the normal processing. */
11307 }
11324 {
11326 /* Fallthru for parameter processing. */
11327 }
11344 {
11355 orig_format))
11360 NULL);
11368 /* If new_return is set, assign function to that expr and cast the
11369 result to void since the generic interface returned void. */
11371 {
11372 /* Cast function result from I{1,2,4,8,16} to the required type. */
11375 result);
11379 }
11381 }
11385 }
11386 }
11388 /* vector_types_compatible_elements_p is used in type checks of vectors
11389 values used as operands of binary operators. Where it returns true, and
11390 the other checks of the caller succeed (being vector types in he first
11391 place, and matching number of elements), we can just treat the types
11392 as essentially the same.
11393 Contrast with vector_targets_convertible_p, which is used for vector
11394 pointer types, and vector_types_convertible_p, which will allow
11395 language-specific matches under the control of flag_lax_vector_conversions,
11396 and might still require a conversion. */
11397 /* True if vector types T1 and T2 can be inputs to the same binary
11398 operator without conversion.
11399 We don't check the overall vector size here because some of our callers
11400 want to give different error messages when the vectors are compatible
11401 except for the element count. */
11403 bool
11405 {
11418 /* Equality works here because c_common_signed_type uses
11419 TYPE_MAIN_VARIANT. */
11427 }
11429 /* Check for missing format attributes on function pointers. LTYPE is
11430 the new type or left-hand side type. RTYPE is the old type or
11431 right-hand side type. Returns TRUE if LTYPE is missing the desired
11432 attribute. */
11434 bool
11436 {
11438 tree ra;
11444 {
11445 tree la;
11450 }
11451 else
11453 }
11455 /* Subscripting with type char is likely to lose on a machine where
11456 chars are signed. So warn on any machine, but optionally. Don't
11457 warn for unsigned char since that type is safe. Don't warn for
11458 signed char because anyone who uses that must have done so
11459 deliberately. Furthermore, we reduce the false positive load by
11460 warning only for non-constant value of type char. */
11462 void
11464 {
11469 }
11471 /* Implement -Wparentheses for the unexpected C precedence rules, to
11472 cover cases like x + y << z which readers are likely to
11473 misinterpret. We have seen an expression in which CODE is a binary
11474 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11475 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11476 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11477 expression was not formed using a binary or unary operator, or it
11478 was enclosed in parentheses. */
11480 void
11484 {
11488 /* This macro tests that the expression ARG with original tree code
11489 CODE appears to be a boolean expression. or the result of folding a
11490 boolean expression. */
11491 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11492 (truth_value_p (TREE_CODE (ARG)) \
11493 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11495 || ((CODE) != INTEGER_CST \
11496 && (integer_onep (ARG) || integer_zerop (ARG))))
11499 {
11548 /* Check cases like x|y==z */
11555 /* Check cases like !x | y */
11559 "suggest parentheses around operand of "
11572 /* Check cases like x^y==z */
11594 /* Check cases like x&y==z */
11601 /* Check cases like !x & y */
11605 "suggest parentheses around operand of "
11628 {
11633 "comparisons like %<X<=Y<=Z%> do not "
11639 "comparisons like %<X<=Y<=Z%> do not "
11641 }
11643 }
11644 #undef NOT_A_BOOLEAN_EXPR_P
11645 }
11647 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11649 void
11651 {
11653 {
11656 else
11658 }
11659 }
11661 /* Warn for division by zero according to the value of DIVISOR. LOC
11662 is the location of the division operator. */
11664 void
11666 {
11667 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11668 about division by zero. Do not issue a warning if DIVISOR has a
11669 floating-point type, since we consider 0.0/0.0 a valid way of
11670 generating a NaN. */
11674 }
11676 /* Subroutine of build_binary_op. Give warnings for comparisons
11677 between signed and unsigned quantities that may fail. Do the
11678 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11679 so that casts will be considered, but default promotions won't
11680 be.
11682 LOCATION is the location of the comparison operator.
11684 The arguments of this function map directly to local variables
11685 of build_binary_op. */
11687 void
11692 {
11697 /* In C++, check for comparison of different enum types. */
11703 {
11707 }
11709 /* Do not warn if the comparison is being done in a signed type,
11710 since the signed type will only be chosen if it can represent
11711 all the values of the unsigned type. */
11714 /* Do not warn if both operands are unsigned. */
11717 else
11718 {
11724 else
11732 /* Do not warn if the signed quantity is an unsuffixed integer
11733 literal (or some static constant expression involving such
11734 literals or a conditional expression involving such literals)
11735 and it is non-negative. */
11738 /* Do not warn if the comparison is an equality operation, the
11739 unsigned quantity is an integral constant, and it would fit
11740 in the result if the result were signed. */
11745 /* In C, do not warn if the unsigned quantity is an enumeration
11746 constant and its maximum value would fit in the result if the
11747 result were signed. */
11753 else
11755 OPT_Wsign_compare,
11757 }
11759 /* Warn if two unsigned values are being compared in a size larger
11760 than their original size, and one (and only one) is the result of
11761 a `~' operator. This comparison will always fail.
11763 Also warn if one operand is a constant, and the constant does not
11764 have all bits set that are set in the ~ operand when it is
11765 extended. */
11772 {
11779 {
11780 tree primop;
11786 {
11790 }
11791 else
11792 {
11796 }
11801 {
11804 {
11808 else
11811 }
11812 }
11813 }
11821 }
11822 }
11824 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11825 type via c_common_type. If -Wdouble-promotion is in use, and the
11826 conditions for warning have been met, issue a warning. GMSGID is
11827 the warning message. It must have two %T specifiers for the type
11828 that was converted (generally "float") and the type to which it was
11829 converted (generally "double), respectively. LOC is the location
11830 to which the awrning should refer. */
11832 void
11835 {
11836 tree source_type;
11840 /* If the conversion will not occur at run-time, there is no need to
11841 warn about it. */
11853 else
11856 }
11858 /* Setup a TYPE_DECL node as a typedef representation.
11860 X is a TYPE_DECL for a typedef statement. Create a brand new
11861 ..._TYPE node (which will be just a variant of the existing
11862 ..._TYPE node with identical properties) and then install X
11863 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11865 The whole point here is to end up with a situation where each
11866 and every ..._TYPE node the compiler creates will be uniquely
11867 associated with AT MOST one node representing a typedef name.
11868 This way, even though the compiler substitutes corresponding
11869 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11870 early on, later parts of the compiler can always do the reverse
11871 translation and get back the corresponding typedef name. For
11872 example, given:
11874 typedef struct S MY_TYPE;
11875 MY_TYPE object;
11877 Later parts of the compiler might only know that `object' was of
11878 type `struct S' if it were not for code just below. With this
11879 code however, later parts of the compiler see something like:
11881 struct S' == struct S
11882 typedef struct S' MY_TYPE;
11883 struct S' object;
11885 And they can then deduce (from the node for type struct S') that
11886 the original object declaration was:
11888 MY_TYPE object;
11890 Being able to do this is important for proper support of protoize,
11891 and also for generating precise symbolic debugging information
11892 which takes full account of the programmer's (typedef) vocabulary.
11894 Obviously, we don't want to generate a duplicate ..._TYPE node if
11895 the TYPE_DECL node that we are now processing really represents a
11896 standard built-in type. */
11898 void
11900 {
11904 {
11907 }
11910 {
11918 }
11919 }
11921 /* Record the types used by the current global variable declaration
11922 being parsed, so that we can decide later to emit their debug info.
11923 Those types are in types_used_by_cur_var_decl, and we are going to
11924 store them in the types_used_by_vars_hash hash table.
11925 DECL is the declaration of the global variable that has been parsed. */
11927 void
11929 {
11933 {
11936 }
11937 }
11939 /* If DECL is a typedef that is declared in the current function,
11940 record it for the purpose of -Wunused-local-typedefs. */
11942 void
11944 {
11949 /* if this is not a locally defined typedef then we are not
11950 interested. */
11957 }
11959 /* If T is a TYPE_DECL declared locally, mark it as used. */
11961 void
11963 {
11968 }
11970 /* Warn if there are some unused locally defined typedefs in the
11971 current function. */
11973 void
11975 {
11977 tree decl;
11978 /* The number of times we have emitted -Wunused-local-typedefs
11979 warnings. If this is different from errorcount, that means some
11980 unrelated errors have been issued. In which case, we'll avoid
11981 emitting "unused-local-typedefs" warnings. */
11993 {
11997 OPT_Wunused_local_typedefs,
12000 }
12003 }
12005 /* Warn about boolean expression compared with an integer value different
12006 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12007 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12008 are the operands of the comparison. The caller must ensure that
12009 either operand is a boolean expression. */
12011 void
12013 tree op1)
12014 {
12024 {
12032 else
12035 }
12036 }
12038 /* The C and C++ parsers both use vectors to hold function arguments.
12039 For efficiency, we keep a cache of unused vectors. This is the
12040 cache. */
12045 /* Return a new vector from the cache. If the cache is empty,
12046 allocate a new vector. These vectors are GC'ed, so it is OK if the
12047 pointer is not released.. */
12051 {
12054 else
12055 {
12056 /* Passing 0 to vec::alloc returns NULL, and our callers require
12057 that we always return a non-NULL value. The vector code uses
12058 4 when growing a NULL vector, so we do too. */
12062 }
12063 }
12065 /* Release a vector of trees back to the cache. */
12067 void
12069 {
12071 {
12074 }
12075 }
12077 /* Get a new tree vector holding a single tree. */
12081 {
12085 }
12087 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12091 {
12096 }
12098 /* Get a new tree vector which is a copy of an existing one. */
12102 {
12105 tree t;
12112 }
12114 /* Return true if KEYWORD starts a type specifier. */
12116 bool
12118 {
12120 {
12154 }
12155 }
12157 /* Return true if KEYWORD names a type qualifier. */
12159 bool
12161 {
12163 {
12171 }
12172 }
12174 /* Return true if KEYWORD names a storage class specifier.
12176 RID_TYPEDEF is not included in this list despite `typedef' being
12177 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12178 such for syntactic convenience only. */
12180 bool
12182 {
12184 {
12194 }
12195 }
12197 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12199 static bool
12201 {
12203 {
12211 }
12212 }
12214 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12215 declaration-specifier (C99 6.7). */
12217 bool
12219 {
12226 {
12233 }
12234 }
12236 /* Initialize language-specific-bits of tree_contains_struct. */
12238 void
12240 {
12246 }
12248 /* Build a user-defined numeric literal out of an integer constant type VALUE
12249 with identifier SUFFIX. */
12251 tree
12254 {
12261 }
12263 /* For vector[index], convert the vector to a
12264 pointer of the underlying type. Return true if the resulting
12265 ARRAY_REF should not be an lvalue. */
12267 bool
12270 {
12273 {
12275 tree type1;
12284 {
12289 {
12292 *vecp
12295 non_const);
12296 }
12297 else
12302 }
12303 else
12310 {
12311 /* If the original vector isn't declared may_alias and it
12312 isn't a bare vector look if the subscripting would
12313 alias the vector we subscript, and if not, force ref-all. */
12319 }
12323 }
12325 }
12327 /* Determine which of the operands, if any, is a scalar that needs to be
12328 converted to a vector, for the range of operations. */
12329 enum stv_conv
12332 {
12341 {
12342 /* Most GENERIC binary expressions require homogeneous arguments.
12343 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12344 argument that is a vector and a second one that is a scalar, so
12345 we never return stv_secondarg for them. */
12350 {
12352 {
12357 }
12358 else
12360 }
12367 /* ... fall through ... */
12388 /* What about UNLT_EXPR? */
12390 {
12391 tree tmp;
12393 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12396 }
12400 {
12402 {
12407 }
12409 }
12411 /* Allow integer --> real conversion if safe. */
12415 {
12417 {
12422 }
12424 }
12427 }
12430 }
12432 /* Return true iff ALIGN is an integral constant that is a fundamental
12433 alignment, as defined by [basic.align] in the c++-11
12434 specifications.
12436 That is:
12438 [A fundamental alignment is represented by an alignment less than or
12439 equal to the greatest alignment supported by the implementation
12440 in all contexts, which is equal to
12441 alignof(max_align_t)]. */
12443 bool
12445 {
12448 }
12450 /* Return true if T is a pointer to a zero-sized aggregate. */
12452 bool
12454 {
12459 }