| blob | de3c0ddaa270670b45bfc497ecfcb4ab56adb1a2 |
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 /* The following symbols are subsumed in the c_global_trees array, and
72 listed here individually for documentation purposes.
74 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
76 tree short_integer_type_node;
77 tree long_integer_type_node;
78 tree long_long_integer_type_node;
80 tree short_unsigned_type_node;
81 tree long_unsigned_type_node;
82 tree long_long_unsigned_type_node;
84 tree truthvalue_type_node;
85 tree truthvalue_false_node;
86 tree truthvalue_true_node;
88 tree ptrdiff_type_node;
90 tree unsigned_char_type_node;
91 tree signed_char_type_node;
92 tree wchar_type_node;
94 tree char16_type_node;
95 tree char32_type_node;
97 tree float_type_node;
98 tree double_type_node;
99 tree long_double_type_node;
101 tree complex_integer_type_node;
102 tree complex_float_type_node;
103 tree complex_double_type_node;
104 tree complex_long_double_type_node;
106 tree dfloat32_type_node;
107 tree dfloat64_type_node;
108 tree_dfloat128_type_node;
110 tree intQI_type_node;
111 tree intHI_type_node;
112 tree intSI_type_node;
113 tree intDI_type_node;
114 tree intTI_type_node;
116 tree unsigned_intQI_type_node;
117 tree unsigned_intHI_type_node;
118 tree unsigned_intSI_type_node;
119 tree unsigned_intDI_type_node;
120 tree unsigned_intTI_type_node;
122 tree widest_integer_literal_type_node;
123 tree widest_unsigned_literal_type_node;
125 Nodes for types `void *' and `const void *'.
127 tree ptr_type_node, const_ptr_type_node;
129 Nodes for types `char *' and `const char *'.
131 tree string_type_node, const_string_type_node;
133 Type `char[SOMENUMBER]'.
134 Used when an array of char is needed and the size is irrelevant.
136 tree char_array_type_node;
138 Type `wchar_t[SOMENUMBER]' or something like it.
139 Used when a wide string literal is created.
141 tree wchar_array_type_node;
143 Type `char16_t[SOMENUMBER]' or something like it.
144 Used when a UTF-16 string literal is created.
146 tree char16_array_type_node;
148 Type `char32_t[SOMENUMBER]' or something like it.
149 Used when a UTF-32 string literal is created.
151 tree char32_array_type_node;
153 Type `int ()' -- used for implicit declaration of functions.
155 tree default_function_type;
157 A VOID_TYPE node, packaged in a TREE_LIST.
159 tree void_list_node;
161 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
162 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
163 VAR_DECLS, but C++ does.)
165 tree function_name_decl_node;
166 tree pretty_function_name_decl_node;
167 tree c99_function_name_decl_node;
169 Stack of nested function name VAR_DECLs.
171 tree saved_function_name_decls;
173 */
176 \f
177 /* Switches common to the C front ends. */
179 /* Nonzero means don't output line number information. */
183 /* Nonzero causes -E output not to be done, but directives such as
184 #define that have side effects are still obeyed. */
188 /* Nonzero means dump macros in some fashion. */
192 /* Nonzero means pass #include lines through to the output. */
196 /* Nonzero means process PCH files while preprocessing. */
200 /* The file name to which we should write a precompiled header, or
201 NULL if no header will be written in this compile. */
205 /* Nonzero if an ISO standard was selected. It rejects macros in the
206 user's namespace. */
210 /* C/ObjC language option variables. */
213 /* Nonzero means allow type mismatches in conditional expressions;
214 just make their values `void'. */
218 /* Nonzero means enable C89 Amendment 1 features. */
222 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
226 /* Nonzero means use the ISO C11 dialect of C. */
230 /* Nonzero means that we have builtin functions, and main is an int. */
235 /* ObjC language option variables. */
238 /* Tells the compiler that this is a special run. Do not perform any
239 compiling, instead we are to test some platform dependent features
240 and output a C header file with appropriate definitions. */
244 /* Tells the compiler what is the constant string class for ObjC. */
248 /* UPC language option variables. */
250 /* Nonzero whenever UPC -fupc-threads-N is asserted.
251 The value N gives the number of UPC threads to be
252 defined at compile-time. */
255 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
258 /* The implementation model for UPC threads that
259 are mapped to POSIX threads, specified at compilation
260 time by the -fupc-pthreads-model-* switch. */
261 upc_pthreads_model_kind upc_pthreads_model;
263 /* C++ language option variables. */
266 /* Nonzero means generate separate instantiation control files and
267 juggle them at link time. */
271 /* The C++ dialect being used. C++98 is the default. */
275 /* Maximum template instantiation depth. This limit exists to limit the
276 time it takes to notice excessively recursive template instantiations.
278 The default is lower than the 1024 recommended by the C++0x standard
279 because G++ runs out of stack before 1024 with highly recursive template
280 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
284 /* The elements of `ridpointers' are identifier nodes for the reserved
285 type names and storage classes. It is indexed by a RID_... value. */
290 /* Nonzero means don't warn about problems that occur when the code is
291 executed. */
294 /* Whether we are building a boolean conversion inside
295 convert_for_assignment, or some other late binary operation. If
296 build_binary_op is called for C (from code shared by C and C++) in
297 this case, then the operands have already been folded and the
298 result will not be folded again, so C_MAYBE_CONST_EXPR should not
299 be generated. */
302 /* Whether lexing has been completed, so subsequent preprocessor
303 errors should use the compiler's input_location. */
306 /* Information about how a function name is generated. */
307 struct fname_var_t
308 {
312 };
314 /* The three ways of getting then name of the current function. */
317 {
318 /* C99 compliant __func__, must be first. */
320 /* GCC __FUNCTION__ compliant. */
322 /* GCC __PRETTY_FUNCTION__ compliant. */
325 };
327 /* Global visibility options. */
426 /* Reserved words. The third field is a mask: keywords are disabled
427 if they match the mask.
429 Masks for languages:
430 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
431 C --std=c99: D_CXXONLY | D_OBJC
432 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
433 UPC is like C except that D_UPC is not set
434 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
435 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
436 ObjC++ is like C++ except that D_OBJC is not set
438 If -fno-asm is used, D_ASM is added to the mask. If
439 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
440 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
441 In C with -Wc++-compat, we warn if D_CXXWARN is set.
443 Note the complication of the D_CXX_OBJC keywords. These are
444 reserved words such as 'class'. In C++, 'class' is a reserved
445 word. In Objective-C++ it is too. In Objective-C, it is a
446 reserved word too, but only if it follows an '@' sign.
447 */
449 {
614 /* These Objective-C keywords are recognized only immediately after
615 an '@'. */
632 /* These are recognized only in protocol-qualifier context
633 (see above) */
641 /* UPC keywords */
653 /* These are recognized inside a property attribute list */
662 };
667 /* Table of machine-independent attributes common to all C-like languages.
669 All attributes referencing arguments should be additionally processed
670 in chkp_copy_function_type_adding_bounds for correct instrumentation
671 by Pointer Bounds Checker.
672 Current list of processed common attributes: nonnull. */
674 {
675 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
676 affects_type_identity } */
683 /* FIXME: logically, noreturn attributes should be listed as
684 "false, true, true" and apply to function types. But implementing this
685 would require all the places in the compiler that use TREE_THIS_VOLATILE
686 on a decl to identify non-returning functions to be located and fixed
687 to check the function type instead. */
718 /* The same comments as for noreturn attributes apply to const ones. */
742 handle_no_instrument_function_attribute,
760 /* ??? These two attributes didn't make the transition from the
761 Intel language document to the multi-vendor language document. */
766 /* For internal use (marking of builtins) only. The name contains space
767 to prevent its usage in source code. */
789 /* For internal use (marking of builtins) only. The name contains space
790 to prevent its usage in source code. */
801 handle_no_address_safety_analysis_attribute,
804 handle_no_sanitize_address_attribute,
807 handle_no_sanitize_address_attribute,
810 handle_no_sanitize_undefined_attribute,
820 /* For internal use only. The leading '*' both prevents its usage in
821 source code and signals that it may be overridden by machine tables. */
826 /* For internal use (marking of builtins and runtime functions) only.
827 The name contains space to prevent its usage in source code. */
853 };
855 /* Give the specifications for the format attributes, used by C and all
856 descendants.
858 All attributes referencing arguments should be additionally processed
859 in chkp_copy_function_type_adding_bounds for correct instrumentation
860 by Pointer Bounds Checker.
861 Current list of processed format attributes: format, format_arg. */
863 {
864 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
865 affects_type_identity } */
871 };
873 /* Return identifier for address space AS. */
877 {
881 }
883 /* Push current bindings for the function name VAR_DECLS. */
885 void
887 {
892 {
896 {
898 saved);
900 }
901 }
903 /* Normally they'll have been NULL, so only push if we've got a
904 stack, or they are non-NULL. */
906 saved_function_name_decls);
907 }
909 /* Finish up the current bindings, adding them into the current function's
910 statement tree. This must be done _before_ finish_stmt_tree is called.
911 If there is no current function, we must be at file scope and no statements
912 are involved. Pop the previous bindings. */
914 void
916 {
925 {
933 }
939 {
940 /* We had saved values, restore them. */
941 tree saved;
944 {
949 }
951 }
953 }
955 /* Return the text name of the current function, suitably prettified
956 by PRETTY_P. Return string must be freed by caller. */
960 {
967 {
970 }
983 {
986 }
989 }
991 /* Return the VAR_DECL for a const char array naming the current
992 function. If the VAR_DECL has not yet been created, create it
993 now. RID indicates how it should be formatted and IDENTIFIER_NODE
994 ID is its name (unfortunately C and C++ hold the RID values of
995 keywords in different places, so we can't derive RID from ID in
996 this language independent code. LOC is the location of the
997 function. */
999 tree
1001 {
1011 {
1012 /* If a tree is built here, it would normally have the lineno of
1013 the current statement. Later this tree will be moved to the
1014 beginning of the function and this line number will be wrong.
1015 To avoid this problem set the lineno to 0 here; that prevents
1016 it from appearing in the RTL. */
1017 tree stmts;
1025 saved_function_name_decls
1029 }
1034 }
1036 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1038 tree
1040 {
1045 /* Compute the number of elements, for the array type. */
1047 {
1050 }
1052 {
1055 }
1057 {
1060 }
1061 else
1062 {
1065 }
1067 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1068 limit in C++98 Annex B is very large (65536) and is not normative,
1069 so we do not diagnose it (warn_overlength_strings is forced off
1070 in c_common_post_options). */
1072 {
1076 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1077 separate the %d from the 'C'. 'ISO' should not be
1078 translated, but it may be moved after 'C%d' in languages
1079 where modifiers follow nouns. */
1081 "string length %qd is greater than the length %qd "
1084 }
1086 /* Create the array type for the string constant. The ISO C++
1087 standard says that a string literal has type `const char[N]' or
1088 `const wchar_t[N]'. We use the same logic when invoked as a C
1089 front-end with -Wwrite-strings.
1090 ??? We should change the type of an expression depending on the
1091 state of a warning flag. We should just be warning -- see how
1092 this is handled in the C++ front-end for the deprecated implicit
1093 conversion from string literals to `char*' or `wchar_t*'.
1095 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1096 array type being the unqualified version of that type.
1097 Therefore, if we are constructing an array of const char, we must
1098 construct the matching unqualified array type first. The C front
1099 end does not require this, but it does no harm, so we do it
1100 unconditionally. */
1111 }
1112 \f
1113 /* If DISABLE is true, stop issuing warnings. This is used when
1114 parsing code that we know will not be executed. This function may
1115 be called multiple times, and works as a stack. */
1117 static void
1119 {
1121 {
1124 }
1125 }
1127 /* If ENABLE is true, reenable issuing warnings. */
1129 static void
1131 {
1133 {
1136 }
1137 }
1139 /* Fully fold EXPR, an expression that was not folded (beyond integer
1140 constant expressions and null pointer constants) when being built
1141 up. If IN_INIT, this is in a static initializer and certain
1142 changes are made to the folding done. Clear *MAYBE_CONST if
1143 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1144 expression because it contains an evaluated operator (in C99) or an
1145 operator outside of sizeof returning an integer constant (in C90)
1146 not permitted in constant expressions, or because it contains an
1147 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1148 set to true by callers before calling this function.) Return the
1149 folded expression. Function arguments have already been folded
1150 before calling this function, as have the contents of SAVE_EXPR,
1151 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1152 C_MAYBE_CONST_EXPR. */
1154 tree
1156 {
1157 tree ret;
1163 /* This function is not relevant to C++ because C++ folds while
1164 parsing, and may need changes to be correct for C++ when C++
1165 stops folding while parsing. */
1172 {
1175 }
1182 }
1184 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1185 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1186 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1187 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1188 both evaluated and unevaluated subexpressions while
1189 *MAYBE_CONST_ITSELF is carried from only evaluated
1190 subexpressions). */
1192 static tree
1195 {
1207 /* This function is not relevant to C++ because C++ folds while
1208 parsing, and may need changes to be correct for C++ when C++
1209 stops folding while parsing. */
1213 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1214 anything else not counted as an expression cannot usefully be
1215 folded further at this point. */
1221 /* Operands of variable-length expressions (function calls) have
1222 already been folded, as have __builtin_* function calls, and such
1223 expressions cannot occur in constant expressions. */
1225 {
1229 }
1232 {
1241 else
1244 }
1246 /* Assignment, increment, decrement, function call and comma
1247 operators, and statement expressions, cannot occur in constant
1248 expressions if evaluated / outside of sizeof. (Function calls
1249 were handled above, though VA_ARG_EXPR is treated like a function
1250 call here, and statement expressions are handled through
1251 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1253 {
1273 }
1275 /* Fold individual tree codes as appropriate. */
1277 {
1279 /* Any non-constancy will have been marked in a containing
1280 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1288 maybe_const_itself);
1293 {
1296 }
1305 maybe_const_itself);
1308 maybe_const_itself);
1314 {
1318 }
1360 /* Binary operations evaluating both arguments (increment and
1361 decrement are binary internally in GCC). */
1365 maybe_const_itself);
1373 /* The RHS of a MODIFY_EXPR was fully folded when building that
1374 expression for the sake of conversion warnings. */
1377 maybe_const_itself);
1381 ret = in_init
1384 else
1397 {
1408 }
1425 CASE_CONVERT:
1436 /* Unary operations. */
1439 maybe_const_itself);
1443 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1444 not prepared to deal with them if they occur in initializers.
1445 Avoid attempts to fold references to UPC shared components
1446 due to the complexities of UPC pointer-to-shared arithmetic. */
1455 ret = in_init
1458 else
1463 {
1467 }
1469 {
1472 CASE_CONVERT:
1473 /* Don't warn about explicit conversions. We will already
1474 have warned about suspect implicit conversions. */
1481 }
1486 /* Binary operations not necessarily evaluating both
1487 arguments. */
1494 ? truthvalue_false_node
1502 ret = in_init
1505 else
1510 && op0_const
1511 && op0_const_self
1517 && op0_const_self
1543 else
1548 && op0_const
1549 && op0_const_self
1553 && op0_const_self
1557 && op0_const
1558 && op0_const_self
1562 && op0_const_self
1568 /* Each case where an operand with excess precision may be
1569 encountered must remove the EXCESS_PRECISION_EXPR around
1570 inner operands and possibly put one around the whole
1571 expression or possibly convert to the semantic type (which
1572 c_fully_fold does); we cannot tell at this stage which is
1573 appropriate in any particular case. */
1577 /* Various codes may appear through folding built-in functions
1578 and their arguments. */
1580 }
1582 out:
1583 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1584 have been done by this point, so remove them again. */
1588 {
1592 }
1596 }
1598 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1599 return EXP. Otherwise, return either EXP or its known constant
1600 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1601 Is the BLKmode test appropriate? */
1603 tree
1605 {
1606 tree ret;
1608 /* This function is only used by C, for c_fully_fold and other
1609 optimization, and may not be correct for C++. */
1620 /* Avoid unwanted tree sharing between the initializer and current
1621 function's body where the tree can be modified e.g. by the
1622 gimplifier. */
1626 }
1628 /* Print a warning if a constant expression had overflow in folding.
1629 Invoke this function on every expression that the language
1630 requires to be a constant expression.
1631 Note the ANSI C standard says it is erroneous for a
1632 constant expression to overflow. */
1634 void
1636 {
1644 }
1646 /* The same as above but print an unconditional error. */
1647 void
1649 {
1656 }
1658 /* Print a warning if an expression had overflow in folding and its
1659 operands hadn't.
1661 Invoke this function on every expression that
1662 (1) appears in the source code, and
1663 (2) is a constant expression that overflowed, and
1664 (3) is not already checked by convert_and_check;
1665 however, do not invoke this function on operands of explicit casts
1666 or when the expression is the result of an operator and any operand
1667 already overflowed. */
1669 void
1671 {
1676 {
1705 }
1706 }
1708 /* Warn about uses of logical || / && operator in a context where it
1709 is likely that the bitwise equivalent was intended by the
1710 programmer. We have seen an expression in which CODE is a binary
1711 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1712 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1713 void
1717 {
1729 /* Warn if &&/|| are being used in a context where it is
1730 likely that the bitwise equivalent was intended by the
1731 programmer. That is, an expression such as op && MASK
1732 where op should not be any boolean expression, nor a
1733 constant, and mask seems to be a non-boolean integer constant. */
1741 {
1745 else
1750 }
1752 /* We do not warn for constants because they are typical of macro
1753 expansions that test for features. */
1757 /* This warning only makes sense with logical operands. */
1764 /* The range computations only work with scalars. */
1769 /* We first test whether either side separately is trivially true
1770 (with OR) or trivially false (with AND). If so, do not warn.
1771 This is a common idiom for testing ranges of data types in
1772 portable code. */
1779 /* If this is an OR operation, invert both sides; now, the result
1780 should be always false to get a warning. */
1794 /* If this is an OR operation, invert both sides; now, the result
1795 should be always false to get a warning. */
1803 /* If both expressions have the same operand, if we can merge the
1804 ranges, and if the range test is always false, then warn. */
1811 {
1814 "logical %<or%> "
1816 else
1818 "logical %<and%> "
1820 }
1821 }
1823 /* Warn about logical not used on the left hand side operand of a comparison.
1824 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1825 Do not warn if RHS is of a boolean type. */
1827 void
1829 tree rhs)
1830 {
1836 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1837 !(x == 0) or !(y != 0). */
1843 "logical not is only applied to the left hand side of "
1845 }
1847 /* Warn if EXP contains any computations whose results are not used.
1848 Return true if a warning is printed; false otherwise. LOCUS is the
1849 (potential) location of the expression. */
1851 bool
1853 {
1854 restart:
1858 /* Don't warn about void constructs. This includes casting to void,
1859 void function calls, and statement expressions with a final cast
1860 to void. */
1868 {
1884 /* For a binding, warn if no side effect within it. */
1896 /* In && or ||, warn if 2nd operand has no side effect. */
1903 /* Let people do `(foo (), 0)' without a warning. */
1910 /* If this is an expression with side effects, don't warn; this
1911 case commonly appears in macro expansions. */
1917 /* Don't warn about automatic dereferencing of references, since
1918 the user cannot control it. */
1920 {
1923 }
1924 /* Fall through. */
1927 /* Referencing a volatile value is a side effect, so don't warn. */
1932 /* If this is an expression which has no operands, there is no value
1933 to be unused. There are no such language-independent codes,
1934 but front ends may define such. */
1938 warn:
1940 }
1941 }
1944 /* Print a warning about casts that might indicate violation
1945 of strict aliasing rules if -Wstrict-aliasing is used and
1946 strict aliasing mode is in effect. OTYPE is the original
1947 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1949 bool
1951 {
1952 /* Strip pointer conversion chains and get to the correct original type. */
1960 /* If the type we are casting to is a ref-all pointer
1961 dereferencing it is always valid. */
1968 {
1969 /* Casting the address of an object to non void pointer. Warn
1970 if the cast breaks type based aliasing. */
1972 {
1976 }
1977 else
1978 {
1979 /* warn_strict_aliasing >= 3. This includes the default (3).
1980 Only warn if the cast is dereferenced immediately. */
1981 alias_set_type set1 =
1987 {
1991 }
1994 {
1998 }
1999 }
2000 }
2001 else
2003 {
2004 /* At this level, warn for any conversions, even if an address is
2005 not taken in the same statement. This will likely produce many
2006 false positives, but could be useful to pinpoint problems that
2007 are not revealed at higher levels. */
2012 {
2016 }
2017 }
2020 }
2022 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2023 sizeof as last operand of certain builtins. */
2025 void
2029 {
2033 location_t loc;
2041 {
2045 /* FALLTHRU */
2053 /* FALLTHRU */
2112 }
2140 {
2144 {
2147 "argument to %<sizeof%> in %qD call is the same "
2148 "expression as the destination; did you mean to "
2154 "argument to %<sizeof%> in %qD call is the same "
2155 "expression as the destination; did you mean to "
2157 else
2159 "argument to %<sizeof%> in %qD call is the same "
2160 "expression as the destination; did you mean to "
2163 }
2166 && !strop
2169 {
2171 "argument to %<sizeof%> in %qD call is the same "
2172 "pointer type %qT as the destination; expected %qT "
2176 }
2177 }
2180 {
2184 {
2187 "argument to %<sizeof%> in %qD call is the same "
2188 "expression as the source; did you mean to "
2194 "argument to %<sizeof%> in %qD call is the same "
2195 "expression as the source; did you mean to "
2197 else
2199 "argument to %<sizeof%> in %qD call is the same "
2200 "expression as the source; did you mean to "
2203 }
2206 && !strop
2209 {
2211 "argument to %<sizeof%> in %qD call is the same "
2212 "pointer type %qT as the source; expected %qT "
2216 }
2217 }
2220 {
2224 {
2227 "argument to %<sizeof%> in %qD call is the same "
2228 "expression as the first source; did you mean to "
2234 "argument to %<sizeof%> in %qD call is the same "
2235 "expression as the first source; did you mean to "
2237 else
2239 "argument to %<sizeof%> in %qD call is the same "
2240 "expression as the first source; did you mean to "
2243 }
2246 && !strop
2249 {
2251 "argument to %<sizeof%> in %qD call is the same "
2252 "pointer type %qT as the first source; expected %qT "
2256 }
2257 }
2260 {
2264 {
2267 "argument to %<sizeof%> in %qD call is the same "
2268 "expression as the second source; did you mean to "
2274 "argument to %<sizeof%> in %qD call is the same "
2275 "expression as the second source; did you mean to "
2277 else
2279 "argument to %<sizeof%> in %qD call is the same "
2280 "expression as the second source; did you mean to "
2283 }
2286 && !strop
2289 {
2291 "argument to %<sizeof%> in %qD call is the same "
2292 "pointer type %qT as the second source; expected %qT "
2296 }
2297 }
2299 }
2301 /* Warn for unlikely, improbable, or stupid DECL declarations
2302 of `main'. */
2304 void
2306 {
2307 function_args_iterator iter;
2308 tree type;
2312 {
2313 /* XXX void_type_node belies the abstraction. */
2323 {
2329 }
2333 {
2355 "third argument of %q+D should probably be "
2358 }
2359 }
2361 /* It is intentional that this message does not mention the third
2362 argument because it's only mentioned in an appendix of the
2363 standard. */
2371 }
2373 /* vector_targets_convertible_p is used for vector pointer types. The
2374 callers perform various checks that the qualifiers are satisfactory,
2375 while OTOH vector_targets_convertible_p ignores the number of elements
2376 in the vectors. That's fine with vector pointers as we can consider,
2377 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2378 and that does not require and conversion of the pointer values.
2379 In contrast, vector_types_convertible_p and
2380 vector_types_compatible_elements_p are used for vector value types. */
2381 /* True if pointers to distinct types T1 and T2 can be converted to
2382 each other without an explicit cast. Only returns true for opaque
2383 vector types. */
2384 bool
2386 {
2393 }
2395 /* vector_types_convertible_p is used for vector value types.
2396 It could in principle call vector_targets_convertible_p as a subroutine,
2397 but then the check for vector type would be duplicated with its callers,
2398 and also the purpose of vector_targets_convertible_p would become
2399 muddled.
2400 Where vector_types_convertible_p returns true, a conversion might still be
2401 needed to make the types match.
2402 In contrast, vector_targets_convertible_p is used for vector pointer
2403 values, and vector_types_compatible_elements_p is used specifically
2404 in the context for binary operators, as a check if use is possible without
2405 conversion. */
2406 /* True if vector types T1 and T2 can be converted to each other
2407 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2408 can only be converted with -flax-vector-conversions yet that is not
2409 in effect, emit a note telling the user about that option if such
2410 a note has not previously been emitted. */
2411 bool
2413 {
2421 convertible_lax =
2436 {
2439 "conversions between vectors with differing "
2441 }
2444 }
2446 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2447 and have vector types, V0 has the same type as V1, and the number of
2448 elements of V0, V1, MASK is the same.
2450 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2451 called with two arguments. In this case implementation passes the
2452 first argument twice in order to share the same tree code. This fact
2453 could enable the mask-values being twice the vector length. This is
2454 an implementation accident and this semantics is not guaranteed to
2455 the user. */
2456 tree
2459 {
2460 tree ret;
2466 {
2469 }
2477 {
2482 }
2486 {
2490 }
2493 {
2498 }
2504 {
2507 "argument vector(s) and the mask vector should "
2510 }
2514 {
2519 }
2522 {
2523 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2529 else
2530 {
2533 }
2537 }
2547 }
2549 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2550 to integral type. */
2552 static tree
2554 {
2559 {
2560 /* C++0x scoped enumerations don't implicitly convert to integral
2561 type; if we stripped an explicit conversion to a larger type we
2562 need to replace it so common_type will still work. */
2566 }
2568 }
2570 /* This is a helper function of build_binary_op.
2572 For certain operations if both args were extended from the same
2573 smaller type, do the arithmetic in that type and then extend.
2575 BITWISE indicates a bitwise operation.
2576 For them, this optimization is safe only if
2577 both args are zero-extended or both are sign-extended.
2578 Otherwise, we might change the result.
2579 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2580 but calculated in (unsigned short) it would be (unsigned short)-1.
2581 */
2582 tree
2584 {
2588 tree type;
2590 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2591 excessive narrowing when we call get_narrower below. For
2592 example, suppose that OP0 is of unsigned int extended
2593 from signed char and that RESULT_TYPE is long long int.
2594 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2595 like
2597 (long long int) (unsigned int) signed_char
2599 which get_narrower would narrow down to
2601 (unsigned int) signed char
2603 If we do not cast OP0 first, get_narrower would return
2604 signed_char, which is inconsistent with the case of the
2605 explicit cast. */
2612 /* UNS is 1 if the operation to be done is an unsigned one. */
2615 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2616 but it *requires* conversion to FINAL_TYPE. */
2627 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2629 /* For bitwise operations, signedness of nominal type
2630 does not matter. Consider only how operands were extended. */
2634 /* Note that in all three cases below we refrain from optimizing
2635 an unsigned operation on sign-extended args.
2636 That would not be valid. */
2638 /* Both args variable: if both extended in same way
2639 from same width, do it in that width.
2640 Do it unsigned if args were zero-extended. */
2647 return c_common_signed_or_unsigned_type
2654 && (type
2665 && (type
2673 }
2675 /* Checks if expression EXPR of real/integer type cannot be converted
2676 to the real/integer type TYPE. Function returns non-zero when:
2677 * EXPR is a constant which cannot be exactly converted to TYPE.
2678 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2679 for EXPR type and TYPE being both integers or both real.
2680 * EXPR is not a constant of real type and TYPE is an integer.
2681 * EXPR is not a constant of integer type which cannot be
2682 exactly converted to real type.
2683 Function allows conversions between types of different signedness and
2684 can return SAFE_CONVERSION (zero) in that case. Function can produce
2685 signedness warnings if PRODUCE_WARNS is true. */
2687 enum conversion_safety
2689 {
2695 {
2696 /* Warn for real constant that is not an exact integer converted
2697 to integer type. */
2700 {
2703 }
2704 /* Warn for an integer constant that does not fit into integer type. */
2708 {
2711 {
2715 }
2717 {
2721 }
2722 else
2724 }
2726 {
2727 /* Warn for an integer constant that does not fit into real type. */
2729 {
2733 }
2734 /* Warn for a real constant that does not fit into a smaller
2735 real type. */
2738 {
2742 }
2743 }
2744 }
2745 else
2746 {
2747 /* Warn for real types converted to integer types. */
2754 {
2755 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2759 /* Don't warn for short y; short x = ((int)y & 0xff); */
2763 {
2764 /* If both args were extended from a shortest type,
2765 use that type if that is safe. */
2772 {
2778 /* If one of the operands is a non-negative constant
2779 that fits in the target type, then the type of the
2780 other operand does not matter. */
2789 /* If constant is unsigned and fits in the target
2790 type, then the result will also fit. */
2792 && unsigned0
2795 && unsigned1
2798 }
2799 }
2800 /* Warn for integer types converted to smaller integer types. */
2804 /* When they are the same width but different signedness,
2805 then the value may change. */
2808 /* Even when converted to a bigger type, if the type is
2809 unsigned but expr is signed, then negative values
2810 will be changed. */
2816 }
2818 /* Warn for integer types converted to real types if and only if
2819 all the range of values of the integer type cannot be
2820 represented by the real type. */
2823 {
2827 /* Don't warn about char y = 0xff; float x = (int) y; */
2839 }
2841 /* Warn for real types converted to smaller real types. */
2846 }
2849 }
2851 /* Warns if the conversion of EXPR to TYPE may alter a value.
2852 This is a helper function for warnings_for_convert_and_check. */
2854 static void
2856 {
2863 /* This may happen, because for LHS op= RHS we preevaluate
2864 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2865 means we could no longer see the code of the EXPR. */
2872 {
2885 /* Conversion from boolean to a signed:1 bit-field (which only
2886 can hold the values 0 and -1) doesn't lose information - but
2887 it does change the value. */
2907 {
2908 /* In case of COND_EXPR, we do not care about the type of
2909 COND_EXPR, only about the conversion of each operand. */
2916 }
2928 }
2929 }
2931 /* Produce warnings after a conversion. RESULT is the result of
2932 converting EXPR to TYPE. This is a helper function for
2933 convert_and_check and cp_convert_and_check. */
2935 void
2937 tree result)
2938 {
2945 {
2946 /* Do not diagnose overflow in a constant expression merely
2947 because a conversion overflowed. */
2952 {
2953 /* This detects cases like converting -129 or 256 to
2954 unsigned char. */
2958 else
2960 }
2964 /* No warning for converting 0x80000000 to int. */
2972 else
2974 }
2979 else
2981 }
2984 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2985 Invoke this function on every expression that is converted implicitly,
2986 i.e. because of language rules and not because of an explicit cast. */
2988 tree
2990 {
2991 tree result;
2992 tree expr_for_warning;
2994 /* Convert from a value with possible excess precision rather than
2995 via the semantic type, but do not warn about values not fitting
2996 exactly in the semantic type. */
2998 {
3004 }
3005 else
3019 }
3020 \f
3021 /* A node in a list that describes references to variables (EXPR), which are
3022 either read accesses if WRITER is zero, or write accesses, in which case
3023 WRITER is the parent of EXPR. */
3024 struct tlist
3025 {
3028 };
3030 /* Used to implement a cache the results of a call to verify_tree. We only
3031 use this for SAVE_EXPRs. */
3032 struct tlist_cache
3033 {
3037 tree expr;
3038 };
3040 /* Obstack to use when allocating tlist structures, and corresponding
3041 firstobj. */
3045 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3046 warnings. */
3048 /* SAVE_EXPRs need special treatment. We process them only once and then
3049 cache the results. */
3061 /* Create a new struct tlist and fill in its fields. */
3064 {
3071 }
3073 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3074 is nonnull, we ignore any node we find which has a writer equal to it. */
3076 static void
3078 {
3080 {
3087 }
3088 }
3090 /* Merge the nodes of ADD into TO. This merging process is done so that for
3091 each variable that already exists in TO, no new node is added; however if
3092 there is a write access recorded in ADD, and an occurrence on TO is only
3093 a read access, then the occurrence in TO will be modified to record the
3094 write. */
3096 static void
3098 {
3105 {
3112 {
3116 }
3118 {
3122 }
3124 }
3125 }
3127 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3128 references in list LIST conflict with it, excluding reads if ONLY writers
3129 is nonzero. */
3131 static void
3134 {
3137 /* Avoid duplicate warnings. */
3143 {
3147 {
3152 }
3154 }
3155 }
3157 /* Given a list LIST of references to variables, find whether any of these
3158 can cause conflicts due to missing sequence points. */
3160 static void
3162 {
3166 {
3169 }
3170 }
3172 /* Return nonzero if X is a tree that can be verified by the sequence point
3173 warnings. */
3174 static int
3176 {
3183 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3184 (lvalue_p) crash on TRY/CATCH. */
3191 /* No point to track non-const calls, they will never satisfy
3192 operand_equal_p. */
3200 }
3202 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3203 static bool
3205 {
3207 }
3209 /* Walk the tree X, and record accesses to variables. If X is written by the
3210 parent tree, WRITER is the parent.
3211 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3212 expression or its only operand forces a sequence point, then everything up
3213 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3214 in PNO_SP.
3215 Once we return, we will have emitted warnings if any subexpression before
3216 such a sequence point could be undefined. On a higher level, however, the
3217 sequence point may not be relevant, and we'll merge the two lists.
3219 Example: (b++, a) + b;
3220 The call that processes the COMPOUND_EXPR will store the increment of B
3221 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3222 processes the PLUS_EXPR will need to merge the two lists so that
3223 eventually, all accesses end up on the same list (and we'll warn about the
3224 unordered subexpressions b++ and b.
3226 A note on merging. If we modify the former example so that our expression
3227 becomes
3228 (b++, b) + a
3229 care must be taken not simply to add all three expressions into the final
3230 PNO_SP list. The function merge_tlist takes care of that by merging the
3231 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3232 way, so that no more than one access to B is recorded. */
3234 static void
3236 tree writer)
3237 {
3242 /* X may be NULL if it is the operand of an empty statement expression
3243 ({ }). */
3247 restart:
3255 {
3288 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3289 two first, to avoid warning for (a ? b++ : b++). */
3305 /* Expressions inside the LHS are not ordered wrt. the sequence points
3306 in the RHS. Example:
3307 *a = (a++, 2)
3308 Despite the fact that the modification of "a" is in the before_sp
3309 list (tmp_before), it conflicts with the use of "a" in the LHS.
3310 We can handle this by adding the contents of tmp_list3
3311 to those of tmp_before, and redoing the collision warnings for that
3312 list. */
3315 /* Exclude the LHS itself here; we first have to merge it into the
3316 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3317 didn't exclude the LHS, we'd get it twice, once as a read and once
3318 as a write. */
3329 /* We need to warn about conflicts among arguments and conflicts between
3330 args and the function address. Side effects of the function address,
3331 however, are not ordered by the sequence point of the call. */
3332 {
3333 call_expr_arg_iterator iter;
3334 tree arg;
3338 {
3343 }
3348 }
3351 /* Scan all the list, e.g. indices of multi dimensional array. */
3353 {
3359 }
3363 {
3370 {
3384 }
3388 }
3398 /* For other expressions, simply recurse on their operands.
3399 Manual tail recursion for unary expressions.
3400 Other non-expressions need not be processed. */
3402 {
3406 }
3408 {
3412 {
3417 }
3418 }
3420 }
3421 }
3423 /* Try to warn for undefined behavior in EXPR due to missing sequence
3424 points. */
3426 DEBUG_FUNCTION void
3428 {
3434 {
3437 }
3442 }
3443 \f
3444 /* Validate the expression after `case' and apply default promotions. */
3446 static tree
3448 {
3453 /* Promote char or short to int. */
3456 {
3459 }
3464 }
3465 \f
3466 /* See if the case values LOW and HIGH are in the range of the original
3467 type (i.e. before the default conversion to int) of the switch testing
3468 expression.
3469 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3470 the type before promoting it. CASE_LOW_P is a pointer to the lower
3471 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3472 if the case is not a case range.
3473 The caller has to make sure that we are not called with NULL for
3474 CASE_LOW_P (i.e. the default case).
3475 Returns true if the case label is in range of ORIG_TYPE (saturated or
3476 untouched) or false if the label is out of range. */
3478 static bool
3481 {
3486 /* If there was a problem with the original type, do nothing. */
3493 /* Case label is less than minimum for type. */
3496 {
3500 }
3502 /* Case value is greater than maximum for type. */
3505 {
3508 }
3510 /* Saturate lower case label value to minimum. */
3513 {
3517 }
3519 /* Saturate upper case label value to maximum. */
3522 {
3526 }
3534 }
3535 \f
3536 /* Return an integer type with BITS bits of precision,
3537 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3539 tree
3541 {
3583 }
3585 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3586 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3587 and saturating if SATP is nonzero, otherwise not saturating. */
3589 tree
3592 {
3593 machine_mode mode;
3596 else
3604 {
3606 "fixed-point types that have too many integral and "
3609 }
3612 }
3614 /* Used for communication between c_common_type_for_mode and
3615 c_register_builtin_type. */
3616 tree registered_builtin_types;
3618 /* Return a data type that has machine mode MODE.
3619 If the mode is an integer,
3620 then UNSIGNEDP selects between signed and unsigned types.
3621 If the mode is a fixed-point mode,
3622 then UNSIGNEDP selects between saturating and nonsaturating types. */
3624 tree
3626 {
3627 tree t;
3667 #if HOST_BITS_PER_WIDE_INT >= 64
3670 #endif
3695 {
3696 machine_mode inner_mode;
3697 tree inner_type;
3713 }
3715 {
3720 }
3730 {
3816 }
3824 }
3826 tree
3828 {
3830 }
3832 /* Return a signed type the same as TYPE in other respects. */
3834 tree
3836 {
3838 }
3840 /* Return a type the same as TYPE except unsigned or
3841 signed according to UNSIGNEDP. */
3843 tree
3845 {
3846 tree type1;
3849 /* This block of code emulates the behavior of the old
3850 c_common_unsigned_type. In particular, it returns
3851 long_unsigned_type_node if passed a long, even when a int would
3852 have the same size. This is necessary for warnings to work
3853 correctly in archs where sizeof(int) == sizeof(long) */
3856 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3876 #if HOST_BITS_PER_WIDE_INT >= 64
3879 #endif
3889 #define C_COMMON_FIXED_TYPES(NAME) \
3890 if (type1 == short_ ## NAME ## _type_node \
3891 || type1 == unsigned_short_ ## NAME ## _type_node) \
3892 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3893 : short_ ## NAME ## _type_node; \
3894 if (type1 == NAME ## _type_node \
3895 || type1 == unsigned_ ## NAME ## _type_node) \
3896 return unsignedp ? unsigned_ ## NAME ## _type_node \
3897 : NAME ## _type_node; \
3898 if (type1 == long_ ## NAME ## _type_node \
3899 || type1 == unsigned_long_ ## NAME ## _type_node) \
3900 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3901 : long_ ## NAME ## _type_node; \
3902 if (type1 == long_long_ ## NAME ## _type_node \
3903 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3904 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3905 : long_long_ ## NAME ## _type_node;
3907 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3908 if (type1 == NAME ## _type_node \
3909 || type1 == u ## NAME ## _type_node) \
3910 return unsignedp ? u ## NAME ## _type_node \
3911 : NAME ## _type_node;
3913 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3914 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3915 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3916 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3917 : sat_ ## short_ ## NAME ## _type_node; \
3918 if (type1 == sat_ ## NAME ## _type_node \
3919 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3920 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3921 : sat_ ## NAME ## _type_node; \
3922 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3923 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3924 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3925 : sat_ ## long_ ## NAME ## _type_node; \
3926 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3927 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3928 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3929 : sat_ ## long_long_ ## NAME ## _type_node;
3931 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3932 if (type1 == sat_ ## NAME ## _type_node \
3933 || type1 == sat_ ## u ## NAME ## _type_node) \
3934 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3935 : sat_ ## NAME ## _type_node;
3961 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3962 the precision; they have precision set to match their range, but
3963 may use a wider mode to match an ABI. If we change modes, we may
3964 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3965 the precision as well, so as to yield correct results for
3966 bit-field types. C++ does not have these separate bit-field
3967 types, and producing a signed or unsigned variant of an
3968 ENUMERAL_TYPE may cause other problems as well. */
3974 #define TYPE_OK(node) \
3975 (TYPE_MODE (type) == TYPE_MODE (node) \
3976 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4000 #if HOST_BITS_PER_WIDE_INT >= 64
4003 #endif
4012 #undef TYPE_OK
4015 }
4017 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4019 tree
4021 {
4024 /* Extended integer types of the same width as a standard type have
4025 lesser rank, so those of the same width as int promote to int or
4026 unsigned int and are valid for printf formats expecting int or
4027 unsigned int. To avoid such special cases, avoid creating
4028 extended integer types for bit-fields if a standard integer type
4029 is available. */
4047 }
4049 /* The C version of the register_builtin_type langhook. */
4051 void
4053 {
4054 tree decl;
4064 }
4065 \f
4066 /* Print an error message for invalid operands to arith operation
4067 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4068 LOCATION is the location of the message. */
4070 void
4073 {
4077 {
4122 }
4126 }
4127 \f
4128 /* Given an expression as a tree, return its original type. Do this
4129 by stripping any conversion that preserves the sign and precision. */
4130 static tree
4132 {
4135 }
4137 /* Subroutine of build_binary_op, used for comparison operations.
4138 See if the operands have both been converted from subword integer types
4139 and, if so, perhaps change them both back to their original type.
4140 This function is also responsible for converting the two operands
4141 to the proper common type for comparison.
4143 The arguments of this function are all pointers to local variables
4144 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4145 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4147 LOC is the location of the comparison.
4149 If this function returns nonzero, it means that the comparison has
4150 a constant value. What this function returns is an expression for
4151 that value. */
4153 tree
4156 {
4157 tree type;
4165 /* Throw away any conversions to wider types
4166 already present in the operands. */
4171 /* If primopN is first sign-extended from primopN's precision to opN's
4172 precision, then zero-extended from opN's precision to
4173 *restype_ptr precision, shortenings might be invalid. */
4176 && !unsignedp0
4181 && !unsignedp1
4185 /* Handle the case that OP0 does not *contain* a conversion
4186 but it *requires* conversion to FINAL_TYPE. */
4193 /* If one of the operands must be floated, we cannot optimize. */
4197 /* If first arg is constant, swap the args (changing operation
4198 so value is preserved), for canonicalization. Don't do this if
4199 the second arg is 0. */
4204 {
4221 {
4236 }
4238 }
4240 /* If comparing an integer against a constant more bits wide,
4241 maybe we can deduce a value of 1 or 0 independent of the data.
4242 Or else truncate the constant now
4243 rather than extend the variable at run time.
4245 This is only interesting if the constant is the wider arg.
4246 Also, it is not safe if the constant is unsigned and the
4247 variable arg is signed, since in this case the variable
4248 would be sign-extended and then regarded as unsigned.
4249 Our technique fails in this case because the lowest/highest
4250 possible unsigned results don't follow naturally from the
4251 lowest/highest possible values of the variable operand.
4252 For just EQ_EXPR and NE_EXPR there is another technique that
4253 could be used: see if the constant can be faithfully represented
4254 in the other operand's type, by truncating it and reextending it
4255 and see if that preserves the constant's value. */
4261 {
4264 /* 1 if comparison is nominally unsigned. */
4266 tree val;
4278 {
4279 /* Convert primop1 to target type, but do not introduce
4280 additional overflow. We know primop1 is an int_cst. */
4287 }
4289 {
4292 }
4300 /* This used to be a switch, but Genix compiler can't handle that. */
4302 {
4305 }
4307 {
4310 }
4312 {
4317 }
4319 {
4324 }
4326 {
4331 }
4333 {
4338 }
4340 /* If primop0 was sign-extended and unsigned comparison specd,
4341 we did a signed comparison above using the signed type bounds.
4342 But the comparison we output must be unsigned.
4344 Also, for inequalities, VAL is no good; but if the signed
4345 comparison had *any* fixed result, it follows that the
4346 unsigned comparison just tests the sign in reverse
4347 (positive values are LE, negative ones GE).
4348 So we can generate an unsigned comparison
4349 against an extreme value of the signed type. */
4352 {
4355 {
4370 }
4372 }
4375 {
4382 }
4385 {
4386 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4390 }
4392 /* Value is not predetermined, but do the comparison
4393 in the type of the operand that is not constant.
4394 TYPE is already properly set. */
4395 }
4397 /* If either arg is decimal float and the other is float, find the
4398 proper common type to use for comparison. */
4404 /* If either arg is decimal float and the other is float, fail. */
4415 /* If args' natural types are both narrower than nominal type
4416 and both extend in the same manner, compare them
4417 in the type of the wider arg.
4418 Otherwise must actually extend both to the nominal
4419 common type lest different ways of extending
4420 alter the result.
4421 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4426 {
4430 type);
4431 /* Make sure shorter operand is extended the right way
4432 to match the longer operand. */
4433 primop0
4436 primop0);
4437 primop1
4440 primop1);
4441 }
4442 else
4443 {
4444 /* Here we must do the comparison on the nominal type
4445 using the args exactly as we received them. */
4452 {
4454 /* All unsigned values are >= 0, so we warn. However,
4455 if OP0 is a constant that is >= 0, the signedness of
4456 the comparison isn't an issue, so suppress the
4457 warning. */
4462 primop0)))
4463 /* Do not warn for enumeration types. */
4467 {
4484 }
4487 {
4488 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4493 }
4494 }
4495 }
4503 }
4504 \f
4505 /* Return a tree for the sum or difference (RESULTCODE says which)
4506 of pointer PTROP and integer INTOP. */
4508 tree
4511 {
4514 /* The result is a pointer of the same type that is being added. */
4517 /* If the pointer lives in UPC shared memory, then
4518 drop the 'shared' qualifier. */
4523 {
4530 }
4532 {
4539 }
4540 else
4543 /* We are manipulating pointer values, so we don't need to warn
4544 about relying on undefined signed overflow. We disable the
4545 warning here because we use integer types so fold won't know that
4546 they are really pointers. */
4549 /* If what we are about to multiply by the size of the elements
4550 contains a constant term, apply distributive law
4551 and multiply that constant term separately.
4552 This helps produce common subexpressions. */
4557 /* If the constant comes from pointer subtraction,
4558 skip this optimization--it would cause an error. */
4560 /* If the constant is unsigned, and smaller than the pointer size,
4561 then we must skip this optimization. This is because it could cause
4562 an overflow error if the constant is negative but INTOP is not. */
4566 {
4571 /* Convert both subexpression types to the type of intop,
4572 because weird cases involving pointer arithmetic
4573 can result in a sum or difference with different type args. */
4578 }
4580 /* Convert the integer argument to a type the same size as sizetype
4581 so the multiply won't overflow spuriously. */
4587 /* Replace the integer argument with a suitable product by the object size.
4588 Do this multiplication as signed, then convert to the appropriate type
4589 for the pointer operation and disregard an overflow that occurred only
4590 because of the sign-extension change in the latter conversion. */
4591 {
4598 }
4600 /* Create the sum or difference. */
4609 }
4610 \f
4611 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4612 and if NON_CONST is known not to be permitted in an evaluated part
4613 of a constant expression. */
4615 tree
4617 {
4621 /* This should never be called for C++. */
4625 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4634 }
4636 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4637 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4638 around the SAVE_EXPR if needed so that c_fully_fold does not need
4639 to look inside SAVE_EXPRs. */
4641 tree
4643 {
4652 }
4654 /* Return whether EXPR is a declaration whose address can never be
4655 NULL. */
4657 bool
4659 {
4664 }
4666 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4667 or for an `if' or `while' statement or ?..: exp. It should already
4668 have been validated to be of suitable type; otherwise, a bad
4669 diagnostic may result.
4671 The EXPR is located at LOCATION.
4673 This preparation consists of taking the ordinary
4674 representation of an expression expr and producing a valid tree
4675 boolean expression describing whether expr is nonzero. We could
4676 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4677 but we optimize comparisons, &&, ||, and !.
4679 The resulting type should always be `truthvalue_type_node'. */
4681 tree
4683 {
4685 {
4727 ? truthvalue_true_node
4733 ? truthvalue_true_node
4738 /* Fall through. */
4741 {
4744 {
4745 /* Common Ada/Pascal programmer's mistake. */
4747 OPT_Waddress,
4749 inner);
4751 }
4753 }
4770 /* These don't change whether an object is nonzero or zero. */
4775 /* These don't change whether an object is zero or nonzero, but
4776 we can't ignore them if their second arg has side-effects. */
4778 {
4781 c_common_truthvalue_conversion
4784 }
4785 else
4790 /* Distribute the conversion into the arms of a COND_EXPR. */
4792 {
4795 /* In C++ one of the arms might have void type if it is throw. */
4803 }
4804 else
4805 {
4806 /* Folding will happen later for C. */
4814 }
4816 CASE_CONVERT:
4817 {
4821 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4822 since that affects how `default_conversion' will behave. */
4826 /* Don't strip a conversion from C++0x scoped enum, since they
4827 don't implicitly convert to other types. */
4831 /* If this isn't narrowing the argument, we can ignore it. */
4835 }
4841 {
4845 }
4850 }
4853 {
4855 expr = (build_binary_op
4859 c_common_truthvalue_conversion
4862 c_common_truthvalue_conversion
4867 }
4870 {
4875 }
4876 else
4879 ret:
4882 }
4883 \f
4892 /* Apply the TYPE_QUALS to the new DECL. */
4894 void
4896 {
4904 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4905 constructor can produce constant init, so rely on cp_finish_decl to
4906 clear TREE_READONLY if the variable has non-constant init. */
4909 {
4912 }
4914 {
4916 /* Allow 'restrict' on arrays of pointers.
4917 FIXME currently we just ignore it. */
4923 }
4925 {
4931 /* The declaration's type should have been previously defined
4932 as a UPC shared type. */
4934 }
4935 }
4938 {
4941 };
4943 /* Hash function for the problem of multiple type definitions in
4944 different files. This must hash all types that will compare
4945 equal via comptypes to the same value. In practice it hashes
4946 on some of the simple stuff and leaves the details to comptypes. */
4948 hashval_t
4950 {
4953 tree t2;
4955 {
4956 /* For pointers, hash on pointee type plus some swizzling. */
4959 /* Hash on number of elements and total size. */
4978 }
4979 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4980 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4982 /* We might have a VLA here. */
4985 else
4988 }
4990 bool
4992 {
4994 }
4998 /* Return the typed-based alias set for T, which may be an expression
4999 or a type. Return -1 if we don't do anything special. */
5001 alias_set_type
5003 {
5004 tree u;
5006 /* For VLAs, use the alias set of the element type rather than the
5007 default of alias set 0 for types compared structurally. */
5009 {
5013 }
5015 /* Permit type-punning when accessing a union, provided the access
5016 is directly through the union. For example, this code does not
5017 permit taking the address of a union member and then storing
5018 through it. Even the type-punning allowed here is a GCC
5019 extension, albeit a common and useful one; the C standard says
5020 that such accesses have implementation-defined behavior. */
5028 /* That's all the expressions we handle specially. */
5032 /* The C standard guarantees that any object may be accessed via an
5033 lvalue that has character type. */
5039 /* The C standard specifically allows aliasing between signed and
5040 unsigned variants of the same type. We treat the signed
5041 variant as canonical. */
5043 {
5046 /* t1 == t can happen for boolean nodes which are always unsigned. */
5049 }
5051 /* For the time being, make UPC pointers-to-shared conflict
5052 with everything else. Ideally, UPC pointers-to-shared should
5053 only conflict with the internal type used to represent
5054 the UPC pointer-to-shared (i.e., upc_pts_rep_type_node). */
5063 /* Handle the case of multiple type nodes referring to "the same" type,
5064 which occurs with IMA. These share an alias set. FIXME: Currently only
5065 C90 is handled. (In C99 type compatibility is not transitive, which
5066 complicates things mightily. The alias set splay trees can theoretically
5067 represent this, but insertion is tricky when you consider all the
5068 different orders things might arrive in.) */
5073 /* Save time if there's only one input file. */
5077 /* Pointers need special handling if they point to any type that
5078 needs special handling (below). */
5080 {
5081 tree t2;
5082 /* Find bottom type under any nested POINTERs. */
5086 ;
5094 }
5095 /* These are the only cases that need special handling. */
5102 /* Undefined? */
5106 /* Look up t in hash table. Only one of the compatible types within each
5107 alias set is recorded in the table. */
5112 {
5115 }
5116 else
5117 /* Our caller will assign and record (in t) a new alias set; all we need
5118 to do is remember t in the hash table. */
5122 }
5123 \f
5124 /* Return the value of THREADS.
5126 UPC defines a reserved variable, THREADS, which returns the
5127 number of threads that will be created when the UPC program
5128 executes. The value of threads can be specified at runtime via
5129 the -fupc-threads=N switch, where N is an integer specifying
5130 the number of threads. When the value of THREADS is specified
5131 at compile-time, this is called the "static threads compilation
5132 environment".
5134 In the static threads compilation environment, THREADS is a
5135 pre-defined preprocessor macro with the value, N.
5137 If no value for threads is given at compile-time, then the value
5138 must be specified when the application program is executed.
5139 This method of establishing the value of THREADS is called
5140 the "dynamic threads compilation environment". */
5142 tree
5144 {
5145 tree n;
5150 {
5152 "when compiling pre-processed source, "
5153 "all -fupc-* switches must be passed on the command line, "
5154 "asserting the same values as supplied when the "
5157 }
5160 }
5162 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5163 the IS_SIZEOF parameter indicates which operator is being applied.
5164 The COMPLAIN flag controls whether we should diagnose possibly
5165 ill-formed constructs or not. LOC is the location of the SIZEOF or
5166 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5167 a type in any context should be returned, rather than the normal
5168 alignment for that type. */
5170 tree
5174 {
5182 {
5184 {
5191 }
5192 else
5193 {
5195 {
5199 else
5202 }
5204 }
5205 }
5207 {
5209 {
5216 }
5217 else
5220 }
5223 {
5228 }
5231 {
5236 }
5237 else
5238 {
5240 /* Convert in case a char is more than one unit. */
5246 else
5248 }
5253 {
5256 }
5258 /* VALUE will have the middle-end integer type sizetype.
5259 However, we should really return a value of type `size_t',
5260 which is just a typedef for an ordinary integer type. */
5264 }
5266 /* Implement the __alignof keyword: Return the minimum required
5267 alignment of EXPR, measured in bytes. For VAR_DECLs,
5268 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5269 from an "aligned" __attribute__ specification). LOC is the
5270 location of the ALIGNOF operator. */
5272 tree
5274 {
5275 tree t;
5282 {
5285 }
5291 {
5298 {
5305 }
5307 }
5308 else
5312 }
5313 \f
5314 /* Handle C and C++ default attributes. */
5316 enum built_in_attribute
5317 {
5318 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5319 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5320 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5321 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5322 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5324 #undef DEF_ATTR_NULL_TREE
5325 #undef DEF_ATTR_INT
5326 #undef DEF_ATTR_STRING
5327 #undef DEF_ATTR_IDENT
5328 #undef DEF_ATTR_TREE_LIST
5329 ATTR_LAST
5330 };
5336 enum c_builtin_type
5337 {
5338 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5339 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5340 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5341 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5342 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5343 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5344 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5345 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5346 ARG6) NAME,
5347 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5348 ARG6, ARG7) NAME,
5349 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5350 ARG6, ARG7, ARG8) NAME,
5351 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5352 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5353 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5354 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5355 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5356 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5357 NAME,
5358 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5359 ARG6, ARG7) NAME,
5360 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5361 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5362 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5364 #undef DEF_PRIMITIVE_TYPE
5365 #undef DEF_FUNCTION_TYPE_0
5366 #undef DEF_FUNCTION_TYPE_1
5367 #undef DEF_FUNCTION_TYPE_2
5368 #undef DEF_FUNCTION_TYPE_3
5369 #undef DEF_FUNCTION_TYPE_4
5370 #undef DEF_FUNCTION_TYPE_5
5371 #undef DEF_FUNCTION_TYPE_6
5372 #undef DEF_FUNCTION_TYPE_7
5373 #undef DEF_FUNCTION_TYPE_8
5374 #undef DEF_FUNCTION_TYPE_VAR_0
5375 #undef DEF_FUNCTION_TYPE_VAR_1
5376 #undef DEF_FUNCTION_TYPE_VAR_2
5377 #undef DEF_FUNCTION_TYPE_VAR_3
5378 #undef DEF_FUNCTION_TYPE_VAR_4
5379 #undef DEF_FUNCTION_TYPE_VAR_5
5380 #undef DEF_FUNCTION_TYPE_VAR_7
5381 #undef DEF_FUNCTION_TYPE_VAR_11
5382 #undef DEF_POINTER_TYPE
5383 BT_LAST
5384 };
5388 /* A temporary array for c_common_nodes_and_builtins. Used in
5389 communication with def_fn_type. */
5392 /* A helper function for c_common_nodes_and_builtins. Build function type
5393 for DEF with return type RET and N arguments. If VAR is true, then the
5394 function should be variadic after those N arguments.
5396 Takes special care not to ICE if any of the types involved are
5397 error_mark_node, which indicates that said type is not in fact available
5398 (see builtin_type_for_size). In which case the function type as a whole
5399 should be error_mark_node. */
5401 static void
5403 {
5404 tree t;
5411 {
5417 }
5424 else
5427 egress:
5430 }
5432 /* Build builtin functions common to both C and C++ language
5433 frontends. */
5435 static void
5437 {
5438 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5439 builtin_types[ENUM] = VALUE;
5440 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5441 def_fn_type (ENUM, RETURN, 0, 0);
5442 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5443 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5444 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5445 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5446 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5447 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5448 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5449 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5450 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5451 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5452 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5453 ARG6) \
5454 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5455 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5456 ARG6, ARG7) \
5457 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5458 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5459 ARG6, ARG7, ARG8) \
5460 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5461 ARG7, ARG8);
5462 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5463 def_fn_type (ENUM, RETURN, 1, 0);
5464 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5465 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5466 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5467 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5468 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5469 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5470 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5471 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5472 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5473 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5474 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5475 ARG6, ARG7) \
5476 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5477 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5478 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5479 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5480 ARG7, ARG8, ARG9, ARG10, ARG11);
5481 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5482 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5486 #undef DEF_PRIMITIVE_TYPE
5487 #undef DEF_FUNCTION_TYPE_0
5488 #undef DEF_FUNCTION_TYPE_1
5489 #undef DEF_FUNCTION_TYPE_2
5490 #undef DEF_FUNCTION_TYPE_3
5491 #undef DEF_FUNCTION_TYPE_4
5492 #undef DEF_FUNCTION_TYPE_5
5493 #undef DEF_FUNCTION_TYPE_6
5494 #undef DEF_FUNCTION_TYPE_7
5495 #undef DEF_FUNCTION_TYPE_8
5496 #undef DEF_FUNCTION_TYPE_VAR_0
5497 #undef DEF_FUNCTION_TYPE_VAR_1
5498 #undef DEF_FUNCTION_TYPE_VAR_2
5499 #undef DEF_FUNCTION_TYPE_VAR_3
5500 #undef DEF_FUNCTION_TYPE_VAR_4
5501 #undef DEF_FUNCTION_TYPE_VAR_5
5502 #undef DEF_FUNCTION_TYPE_VAR_7
5503 #undef DEF_FUNCTION_TYPE_VAR_11
5504 #undef DEF_POINTER_TYPE
5509 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5510 NONANSI_P, ATTRS, IMPLICIT, COND) \
5511 if (NAME && COND) \
5512 def_builtin_1 (ENUM, NAME, CLASS, \
5513 builtin_types[(int) TYPE], \
5514 builtin_types[(int) LIBTYPE], \
5515 BOTH_P, FALLBACK_P, NONANSI_P, \
5516 built_in_attributes[(int) ATTRS], IMPLICIT);
5518 #undef DEF_BUILTIN
5526 }
5528 /* Like get_identifier, but avoid warnings about null arguments when
5529 the argument may be NULL for targets where GCC lacks stdint.h type
5530 information. */
5534 {
5536 }
5538 /* Build tree nodes and builtin functions common to both C and C++ language
5539 frontends. */
5541 void
5543 {
5547 tree array_domain_type;
5548 tree va_list_ref_type_node;
5549 tree va_list_arg_type_node;
5554 /* Define `int' and `char' first so that dbx will output them first. */
5558 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5559 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5560 but not C. Are the conditionals here needed? */
5566 long_unsigned_type_node);
5569 {
5577 }
5582 long_long_integer_type_node);
5584 long_long_unsigned_type_node);
5587 long_long_unsigned_type_node);
5590 short_unsigned_type_node);
5593 short_unsigned_type_node);
5595 /* Define both `signed char' and `unsigned char'. */
5599 /* These are types that c_common_type_for_size and
5600 c_common_type_for_mode use. */
5603 intQI_type_node));
5606 intHI_type_node));
5609 intSI_type_node));
5612 intDI_type_node));
5613 #if HOST_BITS_PER_WIDE_INT >= 64
5614 /* Note that this is different than the __int128 type that's part of
5615 the generic __intN support. */
5618 TYPE_DECL,
5620 intTI_type_node));
5621 #endif
5624 unsigned_intQI_type_node));
5627 unsigned_intHI_type_node));
5630 unsigned_intSI_type_node));
5633 unsigned_intDI_type_node));
5634 #if HOST_BITS_PER_WIDE_INT >= 64
5637 TYPE_DECL,
5639 unsigned_intTI_type_node));
5640 #endif
5642 /* Create the widest literal types. */
5643 widest_integer_literal_type_node
5647 widest_integer_literal_type_node));
5649 widest_unsigned_literal_type_node
5653 widest_unsigned_literal_type_node));
5657 pid_type_node =
5664 /* Only supported decimal floating point extension if the target
5665 actually supports underlying modes. */
5669 {
5673 }
5676 {
5681 long_long_fract_type_node);
5683 unsigned_short_fract_type_node);
5685 unsigned_fract_type_node);
5687 unsigned_long_fract_type_node);
5689 unsigned_long_long_fract_type_node);
5691 sat_short_fract_type_node);
5694 sat_long_fract_type_node);
5696 sat_long_long_fract_type_node);
5698 sat_unsigned_short_fract_type_node);
5700 sat_unsigned_fract_type_node);
5702 sat_unsigned_long_fract_type_node);
5704 sat_unsigned_long_long_fract_type_node);
5709 long_long_accum_type_node);
5711 unsigned_short_accum_type_node);
5713 unsigned_accum_type_node);
5715 unsigned_long_accum_type_node);
5717 unsigned_long_long_accum_type_node);
5719 sat_short_accum_type_node);
5722 sat_long_accum_type_node);
5724 sat_long_long_accum_type_node);
5726 sat_unsigned_short_accum_type_node);
5728 sat_unsigned_accum_type_node);
5730 sat_unsigned_long_accum_type_node);
5732 sat_unsigned_long_long_accum_type_node);
5734 }
5737 TYPE_DECL,
5739 complex_integer_type_node));
5741 TYPE_DECL,
5743 complex_float_type_node));
5745 TYPE_DECL,
5747 complex_double_type_node));
5751 complex_long_double_type_node));
5754 /* For C++, make fileptr_type_node a distinct void * type until
5755 FILE type is defined. */
5760 /* Set the TYPE_NAME for any variants that were built before
5761 record_builtin_type gave names to the built-in types. */
5762 {
5768 }
5772 /* Make a type to be the domain of a few array types
5773 whose domains don't really matter.
5774 200 is small enough that it always fits in size_t
5775 and large enough that it can hold most function names for the
5776 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5779 /* Make a type for arrays of characters.
5780 With luck nothing will ever really depend on the length of this
5781 array type. */
5782 char_array_type_node
5786 const_string_type_node
5790 /* This is special for C++ so functions can be overloaded. */
5796 {
5799 else
5802 }
5804 /* This is for wide string constants. */
5805 wchar_array_type_node
5808 /* Define 'char16_t'. */
5813 {
5818 }
5820 /* This is for UTF-16 string constants. */
5821 char16_array_type_node
5824 /* Define 'char32_t'. */
5829 {
5834 }
5836 /* This is for UTF-32 string constants. */
5837 char32_array_type_node
5840 wint_type_node =
5843 intmax_type_node =
5845 uintmax_type_node =
5849 sig_atomic_type_node =
5852 int8_type_node =
5855 int16_type_node =
5858 int32_type_node =
5861 int64_type_node =
5864 uint8_type_node =
5876 int_least8_type_node =
5879 int_least16_type_node =
5882 int_least32_type_node =
5885 int_least64_type_node =
5888 uint_least8_type_node =
5891 uint_least16_type_node =
5894 uint_least32_type_node =
5897 uint_least64_type_node =
5900 int_fast8_type_node =
5903 int_fast16_type_node =
5906 int_fast32_type_node =
5909 int_fast64_type_node =
5912 uint_fast8_type_node =
5915 uint_fast16_type_node =
5918 uint_fast32_type_node =
5921 uint_fast64_type_node =
5924 intptr_type_node =
5927 uintptr_type_node =
5930 default_function_type
5932 ptrdiff_type_node
5939 va_list_type_node));
5941 {
5944 tree ptype;
5947 {
5951 ptype));
5953 }
5954 }
5957 {
5960 }
5961 else
5962 {
5965 }
5972 /* Create the built-in __null node. It is important that this is
5973 not shared. */
5977 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5979 }
5981 /* The number of named compound-literals generated thus far. */
5984 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5986 void
5988 {
5991 compound_literal_number);
5992 compound_literal_number++;
5994 }
5996 tree
5998 {
6002 }
6005 /* Linked list of disabled built-in functions. */
6008 {
6016 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6017 begins with "__builtin_", give an error. */
6019 void
6021 {
6024 else
6025 {
6030 }
6031 }
6034 /* Return true if the built-in function NAME has been disabled, false
6035 otherwise. */
6037 static bool
6039 {
6042 {
6045 }
6047 }
6050 /* Worker for DEF_BUILTIN.
6051 Possibly define a builtin function with one or two names.
6052 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6053 nonansi_p and flag_no_nonansi_builtin. */
6055 static void
6062 {
6063 tree decl;
6076 fnattrs);
6085 }
6086 \f
6087 /* Nonzero if the type T promotes to int. This is (nearly) the
6088 integral promotions defined in ISO C99 6.3.1.1/2. */
6090 bool
6092 {
6094 {
6104 /* ??? Technically all enumerations not larger than an int
6105 promote to an int. But this is used along code paths
6106 that only want to notice a size change. */
6114 }
6115 }
6117 /* Return 1 if PARMS specifies a fixed number of parameters
6118 and none of their types is affected by default promotions. */
6120 int
6122 {
6123 const_tree t;
6125 {
6142 }
6144 }
6146 /* Recursively remove any '*' or '&' operator from TYPE. */
6147 tree
6149 {
6153 }
6155 /* Recursively remove pointer or array type from TYPE. */
6156 tree
6158 {
6162 }
6164 /* Used to compare case labels. K1 and K2 are actually tree nodes
6165 representing case labels, or NULL_TREE for a `default' label.
6166 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6167 K2, and 0 if K1 and K2 are equal. */
6169 int
6171 {
6172 /* Consider a NULL key (such as arises with a `default' label) to be
6173 smaller than anything else. */
6180 }
6182 /* Process a case label, located at LOC, for the range LOW_VALUE
6183 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6184 then this case label is actually a `default' label. If only
6185 HIGH_VALUE is NULL_TREE, then case label was declared using the
6186 usual C/C++ syntax, rather than the GNU case range extension.
6187 CASES is a tree containing all the case ranges processed so far;
6188 COND is the condition for the switch-statement itself. Returns the
6189 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6190 is created. */
6192 tree
6195 {
6196 tree type;
6197 tree label;
6198 tree case_label;
6199 splay_tree_node node;
6201 /* Create the LABEL_DECL itself. */
6204 /* If there was an error processing the switch condition, bail now
6205 before we get more confused. */
6213 {
6216 }
6218 /* Case ranges are a GNU extension. */
6225 {
6230 }
6232 {
6237 }
6240 {
6241 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6242 really a case range, even though it was written that way.
6243 Remove the HIGH_VALUE to simplify later processing. */
6248 }
6250 /* See if the case is in range of the type of the original testing
6251 expression. If both low_value and high_value are out of range,
6252 don't insert the case label and return NULL_TREE. */
6258 /* Look up the LOW_VALUE in the table of case labels we already
6259 have. */
6261 /* If there was not an exact match, check for overlapping ranges.
6262 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6263 that's a `default' label and the only overlap is an exact match. */
6265 {
6266 splay_tree_node low_bound;
6267 splay_tree_node high_bound;
6269 /* Even though there wasn't an exact match, there might be an
6270 overlap between this case range and another case range.
6271 Since we've (inductively) not allowed any overlapping case
6272 ranges, we simply need to find the greatest low case label
6273 that is smaller that LOW_VALUE, and the smallest low case
6274 label that is greater than LOW_VALUE. If there is an overlap
6275 it will occur in one of these two ranges. */
6281 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6282 the LOW_VALUE, so there is no need to check unless the
6283 LOW_BOUND is in fact itself a case range. */
6289 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6290 range is bigger than the low end of the current range, so we
6291 are only interested if the current range is a real range, and
6292 not an ordinary case label. */
6294 && high_value
6296 high_value)
6299 }
6300 /* If there was an overlap, issue an error. */
6302 {
6306 {
6310 }
6312 {
6315 }
6316 else
6317 {
6321 }
6323 }
6325 /* Add a CASE_LABEL to the statement-tree. */
6327 /* Register this case label in the splay tree. */
6334 error_out:
6335 /* Add a label so that the back-end doesn't think that the beginning of
6336 the switch is unreachable. Note that we do not add a case label, as
6337 that just leads to duplicates and thence to failure later on. */
6339 {
6342 }
6344 }
6346 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6347 Used to verify that case values match up with enumerator values. */
6349 static void
6351 {
6358 else
6365 buf);
6366 else
6371 }
6373 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6374 Used to verify that case values match up with enumerator values. */
6376 static int
6378 {
6382 /* Skip default case. */
6386 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6387 when we did our enum->case scan. Reset our scratch bit after. */
6390 else
6393 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6394 not set, that means that CASE_HIGH did not appear when we did our
6395 enum->case scan. Reset our scratch bit after. */
6397 {
6400 else
6402 }
6405 }
6407 /* Handle -Wswitch*. Called from the front end after parsing the
6408 switch construct. */
6409 /* ??? Should probably be somewhere generic, since other languages
6410 besides C and C++ would want this. At the moment, however, C/C++
6411 are the only tree-ssa languages that support enumerations at all,
6412 so the point is moot. */
6414 void
6417 {
6418 splay_tree_node default_node;
6419 splay_tree_node node;
6420 tree chain;
6430 /* From here on, we only care about about enumerated types. */
6434 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6438 /* Check the cases. Warn about case values which are not members of
6439 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6440 there is no default case, check that exactly all enumeration
6441 literals are covered by the cases. */
6443 /* Clearing COND if it is not an integer constant simplifies
6444 the tests inside the loop below. */
6448 /* The time complexity here is O(N*lg(N)) worst case, but for the
6449 common case of monotonically increasing enumerators, it is
6450 O(N), since the nature of the splay tree will keep the next
6451 element adjacent to the root at all times. */
6454 {
6460 {
6461 /* Mark the CASE_LOW part of the case entry as seen. */
6465 }
6467 /* Even though there wasn't an exact match, there might be a
6468 case range which includes the enumerator's value. */
6471 {
6475 {
6476 /* If we match the upper bound exactly, mark the CASE_HIGH
6477 part of the case entry as seen. */
6481 }
6482 }
6484 /* We've now determined that this enumerated literal isn't
6485 handled by the case labels of the switch statement. */
6487 /* If the switch expression is a constant, we only really care
6488 about whether that constant is handled by the switch. */
6492 /* If there is a default_node, the only relevant option is
6493 Wswitch-enum. Otherwise, if both are enabled then we prefer
6494 to warn using -Wswitch because -Wswitch is enabled by -Wall
6495 while -Wswitch-enum is explicit. */
6498 ? OPT_Wswitch_enum
6502 }
6504 /* Warn if there are case expressions that don't correspond to
6505 enumerators. This can occur since C and C++ don't enforce
6506 type-checking of assignments to enumeration variables.
6508 The time complexity here is now always O(N) worst case, since
6509 we should have marked both the lower bound and upper bound of
6510 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6511 above. This scan also resets those fields. */
6514 }
6516 /* Finish an expression taking the address of LABEL (an
6517 IDENTIFIER_NODE). Returns an expression for the address.
6519 LOC is the location for the expression returned. */
6521 tree
6523 {
6524 tree result;
6534 else
6535 {
6538 /* The current function is not necessarily uninlinable.
6539 Computed gotos are incompatible with inlining, but the value
6540 here could be used only in a diagnostic, for example. */
6542 }
6545 }
6546 \f
6548 /* Given a boolean expression ARG, return a tree representing an increment
6549 or decrement (as indicated by CODE) of ARG. The front end must check for
6550 invalid cases (e.g., decrement in C++). */
6551 tree
6553 {
6554 tree val;
6559 {
6582 }
6585 }
6586 \f
6587 /* Built-in macros for stddef.h and stdint.h, that require macros
6588 defined in this file. */
6589 void
6591 {
6654 }
6656 static void
6658 {
6659 /* Fill in the built_in_attributes array. */
6660 #define DEF_ATTR_NULL_TREE(ENUM) \
6661 built_in_attributes[(int) ENUM] = NULL_TREE;
6662 #define DEF_ATTR_INT(ENUM, VALUE) \
6663 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6664 #define DEF_ATTR_STRING(ENUM, VALUE) \
6665 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6666 #define DEF_ATTR_IDENT(ENUM, STRING) \
6667 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6668 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6669 built_in_attributes[(int) ENUM] \
6670 = tree_cons (built_in_attributes[(int) PURPOSE], \
6671 built_in_attributes[(int) VALUE], \
6672 built_in_attributes[(int) CHAIN]);
6674 #undef DEF_ATTR_NULL_TREE
6675 #undef DEF_ATTR_INT
6676 #undef DEF_ATTR_IDENT
6677 #undef DEF_ATTR_TREE_LIST
6678 }
6680 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6681 identifier as an argument, so the front end shouldn't look it up. */
6683 bool
6685 {
6688 /* Unknown attribute that we'll end up ignoring, return true so we
6689 don't complain about an identifier argument. */
6695 else
6697 }
6699 /* Attribute handlers common to C front ends. */
6701 /* Handle a "packed" attribute; arguments as in
6702 struct attribute_spec.handler. */
6704 static tree
6707 {
6709 {
6713 }
6715 {
6717 /* Still pack bitfields. */
6722 else
6724 }
6725 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6726 used for DECL_REGISTER. It wouldn't mean anything anyway.
6727 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6728 that changes what the typedef is typing. */
6729 else
6730 {
6733 }
6736 }
6738 /* Handle a "nocommon" attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6745 {
6748 else
6749 {
6752 }
6755 }
6757 /* Handle a "common" attribute; arguments as in
6758 struct attribute_spec.handler. */
6760 static tree
6763 {
6766 else
6767 {
6770 }
6773 }
6775 /* Handle a "noreturn" attribute; arguments as in
6776 struct attribute_spec.handler. */
6778 static tree
6781 {
6784 /* See FIXME comment in c_common_attribute_table. */
6791 = (build_qualified_type
6792 (build_pointer_type
6796 else
6797 {
6800 }
6803 }
6805 /* Handle a "hot" and attribute; arguments as in
6806 struct attribute_spec.handler. */
6808 static tree
6811 {
6814 {
6816 {
6820 }
6821 /* Most of the rest of the hot processing is done later with
6822 lookup_attribute. */
6823 }
6824 else
6825 {
6828 }
6831 }
6833 /* Handle a "cold" and attribute; arguments as in
6834 struct attribute_spec.handler. */
6836 static tree
6839 {
6842 {
6844 {
6848 }
6849 /* Most of the rest of the cold processing is done later with
6850 lookup_attribute. */
6851 }
6852 else
6853 {
6856 }
6859 }
6861 /* Handle a "no_sanitize_address" attribute; arguments as in
6862 struct attribute_spec.handler. */
6864 static tree
6867 {
6869 {
6872 }
6875 }
6877 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6878 struct attribute_spec.handler. */
6880 static tree
6883 {
6892 }
6894 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6895 struct attribute_spec.handler. */
6897 static tree
6900 {
6902 {
6905 }
6908 }
6910 /* Handle a "stack_protect" attribute; arguments as in
6911 struct attribute_spec.handler. */
6912 static tree
6915 {
6917 {
6920 }
6921 else
6927 }
6929 /* Handle a "noinline" attribute; arguments as in
6930 struct attribute_spec.handler. */
6932 static tree
6936 {
6938 {
6940 {
6944 }
6945 else
6947 }
6948 else
6949 {
6952 }
6955 }
6957 /* Handle a "noclone" attribute; arguments as in
6958 struct attribute_spec.handler. */
6960 static tree
6964 {
6966 {
6969 }
6972 }
6974 /* Handle a "no_icf" attribute; arguments as in
6975 struct attribute_spec.handler. */
6977 static tree
6981 {
6983 {
6986 }
6989 }
6992 /* Handle a "always_inline" attribute; arguments as in
6993 struct attribute_spec.handler. */
6995 static tree
7000 {
7002 {
7004 {
7008 }
7009 else
7010 /* Set the attribute and mark it for disregarding inline
7011 limits. */
7013 }
7014 else
7015 {
7018 }
7021 }
7023 /* Handle a "gnu_inline" attribute; arguments as in
7024 struct attribute_spec.handler. */
7026 static tree
7031 {
7033 {
7034 /* Do nothing else, just set the attribute. We'll get at
7035 it later with lookup_attribute. */
7036 }
7037 else
7038 {
7041 }
7044 }
7046 /* Handle a "leaf" attribute; arguments as in
7047 struct attribute_spec.handler. */
7049 static tree
7053 {
7055 {
7058 }
7060 {
7063 }
7066 }
7068 /* Handle an "artificial" attribute; arguments as in
7069 struct attribute_spec.handler. */
7071 static tree
7076 {
7078 {
7079 /* Do nothing else, just set the attribute. We'll get at
7080 it later with lookup_attribute. */
7081 }
7082 else
7083 {
7086 }
7089 }
7091 /* Handle a "flatten" attribute; arguments as in
7092 struct attribute_spec.handler. */
7094 static tree
7096 tree args ATTRIBUTE_UNUSED,
7098 {
7100 /* Do nothing else, just set the attribute. We'll get at
7101 it later with lookup_attribute. */
7102 ;
7103 else
7104 {
7107 }
7110 }
7112 /* Handle a "warning" or "error" attribute; arguments as in
7113 struct attribute_spec.handler. */
7115 static tree
7118 {
7121 /* Do nothing else, just set the attribute. We'll get at
7122 it later with lookup_attribute. */
7123 ;
7124 else
7125 {
7128 }
7131 }
7133 /* Handle a "used" attribute; arguments as in
7134 struct attribute_spec.handler. */
7136 static tree
7139 {
7145 {
7150 }
7151 else
7152 {
7155 }
7158 }
7160 /* Handle a "unused" attribute; arguments as in
7161 struct attribute_spec.handler. */
7163 static tree
7166 {
7168 {
7176 {
7181 }
7182 else
7183 {
7186 }
7187 }
7188 else
7189 {
7193 }
7196 }
7198 /* Handle a "externally_visible" attribute; arguments as in
7199 struct attribute_spec.handler. */
7201 static tree
7206 {
7210 {
7213 {
7217 }
7218 }
7219 else
7220 {
7223 }
7226 }
7228 /* Handle the "no_reorder" attribute. Arguments as in
7229 struct attribute_spec.handler. */
7231 static tree
7233 tree name,
7234 tree,
7237 {
7242 {
7245 name);
7247 }
7250 }
7252 /* Handle a "const" attribute; arguments as in
7253 struct attribute_spec.handler. */
7255 static tree
7258 {
7261 /* See FIXME comment on noreturn in c_common_attribute_table. */
7267 = (build_qualified_type
7268 (build_pointer_type
7272 else
7273 {
7276 }
7279 }
7281 /* Handle a "transparent_union" attribute; arguments as in
7282 struct attribute_spec.handler. */
7284 static tree
7288 {
7289 tree type;
7300 {
7301 /* Make sure that the first field will work for a transparent union.
7302 If the type isn't complete yet, leave the check to the code in
7303 finish_struct. */
7305 {
7311 }
7314 {
7315 /* If the type isn't complete yet, setting the flag
7316 on a variant wouldn't ever be checked. */
7320 /* build_duplicate_type doesn't work for C++. */
7324 /* A type variant isn't good enough, since we don't a cast
7325 to such a type removed as a no-op. */
7327 }
7331 }
7333 ignored:
7336 }
7338 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7339 get the requested priority for a constructor or destructor,
7340 possibly issuing diagnostics for invalid or reserved
7341 priorities. */
7343 static priority_type
7345 {
7346 HOST_WIDE_INT pri;
7347 tree arg;
7353 {
7356 else
7359 }
7376 {
7379 "destructor priorities from 0 to %d are reserved "
7381 MAX_RESERVED_INIT_PRIORITY);
7382 else
7384 "constructor priorities from 0 to %d are reserved "
7386 MAX_RESERVED_INIT_PRIORITY);
7387 }
7390 invalid:
7393 MAX_INIT_PRIORITY);
7394 else
7396 MAX_INIT_PRIORITY);
7398 }
7400 /* Handle a "constructor" attribute; arguments as in
7401 struct attribute_spec.handler. */
7403 static tree
7407 {
7414 {
7415 priority_type priority;
7420 }
7421 else
7422 {
7425 }
7428 }
7430 /* Handle a "destructor" attribute; arguments as in
7431 struct attribute_spec.handler. */
7433 static tree
7437 {
7444 {
7445 priority_type priority;
7450 }
7451 else
7452 {
7455 }
7458 }
7460 /* Nonzero if the mode is a valid vector mode for this architecture.
7461 This returns nonzero even if there is no hardware support for the
7462 vector mode, but we can emulate with narrower modes. */
7464 static int
7466 {
7468 machine_mode innermode;
7470 /* Doh! What's going on? */
7479 /* Hardware support. Woo hoo! */
7485 /* We should probably return 1 if requesting V4DI and we have no DI,
7486 but we have V2DI, but this is probably very unlikely. */
7488 /* If we have support for the inner mode, we can safely emulate it.
7489 We may not have V2DI, but me can emulate with a pair of DIs. */
7491 }
7494 /* Handle a "mode" attribute; arguments as in
7495 struct attribute_spec.handler. */
7497 static tree
7500 {
7508 else
7509 {
7514 tree typefm;
7519 {
7525 }
7527 /* Change this type to have a type with the specified mode.
7528 First check for the special modes. */
7541 else
7544 {
7547 }
7550 {
7553 }
7557 {
7589 }
7591 {
7594 }
7597 {
7602 {
7605 }
7609 else
7612 }
7613 else
7614 {
7615 /* For fixed-point modes, we need to test if the signness of type
7616 and the machine mode are consistent. */
7619 {
7622 }
7623 /* For fixed-point modes, we need to pass saturating info. */
7627 }
7630 {
7633 }
7635 {
7636 /* For enumeral types, copy the precision from the integer
7637 type returned above. If not an INTEGER_TYPE, we can't use
7638 this mode for this type. */
7640 {
7643 }
7646 {
7649 }
7650 else
7651 {
7652 /* We cannot build a type variant, as there's code that assumes
7653 that TYPE_MAIN_VARIANT has the same mode. This includes the
7654 debug generators. Instead, create a subrange type. This
7655 results in all of the enumeral values being emitted only once
7656 in the original, and the subtype gets them by reference. */
7659 else
7662 }
7663 }
7667 {
7670 }
7673 }
7676 }
7678 /* Handle a "section" attribute; arguments as in
7679 struct attribute_spec.handler. */
7681 static tree
7684 {
7688 {
7694 {
7698 {
7700 "section attribute cannot be specified for "
7703 }
7705 /* The decl may have already been given a section attribute
7706 from a previous declaration. Ensure they match. */
7710 {
7714 }
7718 {
7721 }
7722 else
7725 }
7726 else
7727 {
7730 }
7731 }
7732 else
7733 {
7737 }
7740 }
7742 /* Check whether ALIGN is a valid user-specified alignment. If so,
7743 return its base-2 log; if not, output an error and return -1. If
7744 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7745 no error. */
7746 int
7748 {
7755 {
7758 }
7763 {
7766 }
7768 {
7771 }
7773 }
7775 /*
7776 If in c++-11, check if the c++-11 alignment constraint with respect
7777 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7778 c++-11 mode, does nothing.
7780 [dcl.align]2/ says:
7782 [* if the constant expression evaluates to a fundamental alignment,
7783 the alignment requirement of the declared entity shall be the
7784 specified fundamental alignment.
7786 * if the constant expression evaluates to an extended alignment
7787 and the implementation supports that alignment in the context
7788 of the declaration, the alignment of the declared entity shall
7789 be that alignment
7791 * if the constant expression evaluates to an extended alignment
7792 and the implementation does not support that alignment in the
7793 context of the declaration, the program is ill-formed]. */
7795 static bool
7799 {
7812 {
7814 {
7815 /* For file scope variables and static members, the target
7816 supports alignments that are at most
7817 MAX_OFILE_ALIGNMENT. */
7820 }
7821 else
7822 {
7823 #ifdef BIGGEST_FIELD_ALIGNMENT
7824 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7825 #else
7826 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7827 #endif
7828 /* For non-static members, the target supports either
7829 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7830 if it is defined or BIGGEST_ALIGNMENT. */
7835 #undef MAX_TARGET_FIELD_ALIGNMENT
7836 /* For stack variables, the target supports at most
7837 MAX_STACK_ALIGNMENT. */
7841 }
7842 }
7844 {
7845 /* Let's be liberal for types. */
7848 }
7856 }
7858 /* Handle a "aligned" attribute; arguments as in
7859 struct attribute_spec.handler. */
7861 static tree
7864 {
7868 tree align_expr;
7872 {
7877 }
7878 else
7882 {
7886 }
7894 {
7897 /* If we have a TYPE_DECL, then copy the type, so that we
7898 don't accidentally modify a builtin type. See pushdecl. */
7901 {
7908 }
7909 else
7914 }
7917 {
7920 }
7923 /* C++-11 [dcl.align/4]:
7925 When multiple alignment-specifiers are specified for an
7926 entity, the alignment requirement shall be set to the
7927 strictest specified alignment.
7929 This formally comes from the c++11 specification but we are
7930 doing it for the GNU attribute syntax as well. */
7934 {
7939 else
7943 }
7944 else
7945 {
7948 }
7951 }
7953 /* Handle a "weak" attribute; arguments as in
7954 struct attribute_spec.handler. */
7956 static tree
7961 {
7964 {
7967 }
7969 {
7973 }
7976 {
7981 }
7982 else
7986 }
7988 /* Handle an "alias" or "ifunc" attribute; arguments as in
7989 struct attribute_spec.handler, except that IS_ALIAS tells us
7990 whether this is an alias as opposed to ifunc attribute. */
7992 static tree
7995 {
8000 {
8003 }
8007 /* A static variable declaration is always a tentative definition,
8008 but the alias is a non-tentative definition which overrides. */
8011 {
8015 }
8019 {
8023 }
8025 /* Note that the very first time we process a nested declaration,
8026 decl_function_context will not be set. Indeed, *would* never
8027 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8028 we do below. After such frobbery, pushdecl would set the context.
8029 In any case, this is never what we want. */
8031 {
8032 tree id;
8036 {
8040 }
8042 /* This counts as a use of the object pointed to. */
8047 else
8051 /* ifuncs are also aliases, so set that attribute too. */
8054 }
8055 else
8056 {
8059 }
8062 {
8065 {
8068 else
8070 }
8071 }
8075 }
8077 /* Handle an "alias" or "ifunc" attribute; arguments as in
8078 struct attribute_spec.handler. */
8080 static tree
8083 {
8085 }
8087 /* Handle an "alias" or "ifunc" attribute; arguments as in
8088 struct attribute_spec.handler. */
8090 static tree
8093 {
8095 }
8097 /* Handle a "weakref" attribute; arguments as in struct
8098 attribute_spec.handler. */
8100 static tree
8103 {
8106 /* We must ignore the attribute when it is associated with
8107 local-scoped decls, since attribute alias is ignored and many
8108 such symbols do not even have a DECL_WEAK field. */
8110 || current_function_decl
8112 {
8116 }
8119 {
8123 }
8125 /* The idea here is that `weakref("name")' mutates into `weakref,
8126 alias("name")', and weakref without arguments, in turn,
8127 implicitly adds weak. */
8130 {
8137 }
8138 else
8139 {
8144 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8145 and that isn't supported; and because it wants to add it to
8146 the list of weak decls, which isn't helpful. */
8148 }
8151 {
8155 }
8158 }
8160 /* Handle an "visibility" attribute; arguments as in
8161 struct attribute_spec.handler. */
8163 static tree
8167 {
8173 {
8177 {
8179 name);
8181 }
8183 {
8187 }
8188 }
8190 {
8193 }
8196 {
8199 }
8201 /* If this is a type, set the visibility on the type decl. */
8203 {
8208 {
8210 name);
8212 }
8213 }
8223 else
8224 {
8225 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8227 }
8231 {
8245 }
8250 /* Go ahead and attach the attribute to the node as well. This is needed
8251 so we can determine whether we have VISIBILITY_DEFAULT because the
8252 visibility was not specified, or because it was explicitly overridden
8253 from the containing scope. */
8256 }
8258 /* Determine the ELF symbol visibility for DECL, which is either a
8259 variable or a function. It is an error to use this function if a
8260 definition of DECL is not available in this translation unit.
8261 Returns true if the final visibility has been determined by this
8262 function; false if the caller is free to make additional
8263 modifications. */
8265 bool
8267 {
8271 /* If the user explicitly specified the visibility with an
8272 attribute, honor that. DECL_VISIBILITY will have been set during
8273 the processing of the attribute. We check for an explicit
8274 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8275 to distinguish the use of an attribute from the use of a "#pragma
8276 GCC visibility push(...)"; in the latter case we still want other
8277 considerations to be able to overrule the #pragma. */
8279 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8284 /* Set default visibility to whatever the user supplied with
8285 visibility_specified depending on #pragma GCC visibility. */
8287 {
8290 {
8293 /* If visibility changed and DECL already has DECL_RTL, ensure
8294 symbol flags are updated. */
8299 }
8300 }
8302 }
8304 /* Handle an "tls_model" attribute; arguments as in
8305 struct attribute_spec.handler. */
8307 static tree
8310 {
8311 tree id;
8318 {
8321 }
8326 {
8329 }
8339 else
8340 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8344 }
8346 /* Handle a "no_instrument_function" attribute; arguments as in
8347 struct attribute_spec.handler. */
8349 static tree
8354 {
8358 {
8362 }
8363 else
8367 }
8369 /* Handle a "malloc" attribute; arguments as in
8370 struct attribute_spec.handler. */
8372 static tree
8375 {
8379 else
8380 {
8383 }
8386 }
8388 /* Handle a "alloc_size" attribute; arguments as in
8389 struct attribute_spec.handler. */
8391 static tree
8394 {
8397 {
8404 || !arg_count
8406 {
8411 }
8412 }
8414 }
8416 /* Handle a "alloc_align" attribute; arguments as in
8417 struct attribute_spec.handler. */
8419 static tree
8422 {
8429 || !arg_count
8431 {
8436 }
8438 }
8440 /* Handle a "assume_aligned" attribute; arguments as in
8441 struct attribute_spec.handler. */
8443 static tree
8446 {
8448 {
8455 {
8460 }
8461 }
8463 }
8465 /* Handle a "fn spec" attribute; arguments as in
8466 struct attribute_spec.handler. */
8468 static tree
8472 {
8477 }
8479 /* Handle a "bnd_variable_size" attribute; arguments as in
8480 struct attribute_spec.handler. */
8482 static tree
8485 {
8487 {
8490 }
8493 }
8495 /* Handle a "bnd_legacy" attribute; arguments as in
8496 struct attribute_spec.handler. */
8498 static tree
8501 {
8503 {
8506 }
8509 }
8511 /* Handle a "bnd_instrument" attribute; arguments as in
8512 struct attribute_spec.handler. */
8514 static tree
8517 {
8519 {
8522 }
8525 }
8527 /* Handle a "warn_unused" attribute; arguments as in
8528 struct attribute_spec.handler. */
8530 static tree
8532 tree args ATTRIBUTE_UNUSED,
8534 {
8536 /* Do nothing else, just set the attribute. We'll get at
8537 it later with lookup_attribute. */
8538 ;
8539 else
8540 {
8543 }
8546 }
8548 /* Handle an "omp declare simd" attribute; arguments as in
8549 struct attribute_spec.handler. */
8551 static tree
8553 {
8555 }
8557 /* Handle an "omp declare target" attribute; arguments as in
8558 struct attribute_spec.handler. */
8560 static tree
8562 {
8564 }
8566 /* Handle a "returns_twice" attribute; arguments as in
8567 struct attribute_spec.handler. */
8569 static tree
8572 {
8575 else
8576 {
8579 }
8582 }
8584 /* Handle a "no_limit_stack" attribute; arguments as in
8585 struct attribute_spec.handler. */
8587 static tree
8592 {
8596 {
8600 }
8602 {
8606 }
8607 else
8611 }
8613 /* Handle a "pure" attribute; arguments as in
8614 struct attribute_spec.handler. */
8616 static tree
8619 {
8622 /* ??? TODO: Support types. */
8623 else
8624 {
8627 }
8630 }
8632 /* Digest an attribute list destined for a transactional memory statement.
8633 ALLOWED is the set of attributes that are allowed for this statement;
8634 return the attribute we parsed. Multiple attributes are never allowed. */
8636 int
8638 {
8643 {
8651 {
8654 }
8657 {
8660 }
8663 else
8665 }
8668 }
8670 /* Transform a TM attribute name into a maskable integer and back.
8671 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8672 to how the lack of an attribute is treated. */
8674 int
8676 {
8690 }
8692 tree
8694 {
8697 {
8715 }
8717 }
8719 /* Return the first TM attribute seen in LIST. */
8721 tree
8723 {
8725 {
8729 }
8731 }
8733 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8734 Here we accept only function types, and verify that none of the other
8735 function TM attributes are also applied. */
8736 /* ??? We need to accept class types for C++, but not C. This greatly
8737 complicates this function, since we can no longer rely on the extra
8738 processing given by function_type_required. */
8740 static tree
8743 {
8744 /* Only one path adds the attribute; others don't. */
8748 {
8751 /* Only tm_callable and tm_safe apply to classes. */
8754 /* FALLTHRU */
8758 {
8761 ;
8764 else
8766 }
8770 {
8773 {
8778 }
8779 }
8780 /* FALLTHRU */
8783 /* If a function is next, pass it on to be tried next. */
8787 ignored:
8790 }
8793 }
8795 /* Handle the TM_WRAP attribute; arguments as in
8796 struct attribute_spec.handler. */
8798 static tree
8801 {
8804 /* We don't need the attribute even on success, since we
8805 record the entry in an external table. */
8810 else
8811 {
8814 ;
8819 else
8820 {
8824 {
8828 else
8830 }
8831 else
8833 }
8834 }
8837 }
8839 /* Ignore the given attribute. Used when this attribute may be usefully
8840 overridden by the target, but is not used generically. */
8842 static tree
8846 {
8849 }
8851 /* Handle a "no vops" attribute; arguments as in
8852 struct attribute_spec.handler. */
8854 static tree
8858 {
8862 }
8864 /* Handle a "deprecated" attribute; arguments as in
8865 struct attribute_spec.handler. */
8867 static tree
8871 {
8879 {
8882 }
8885 {
8896 else
8898 }
8900 {
8905 }
8906 else
8910 {
8913 {
8919 }
8922 else
8924 }
8927 }
8929 /* Handle a "vector_size" attribute; arguments as in
8930 struct attribute_spec.handler. */
8932 static tree
8936 {
8938 machine_mode orig_mode;
8949 {
8952 }
8954 /* Get the vector size (in bytes). */
8957 /* We need to provide for vector pointers, vector arrays, and
8958 functions returning vectors. For example:
8960 __attribute__((vector_size(16))) short *foo;
8962 In this case, the mode is SI, but the type being modified is
8963 HI, so we need to look further. */
8972 /* Get the mode of the type being modified. */
8983 {
8986 }
8989 {
8992 }
8995 {
8998 }
9000 /* Calculate how many units fit in the vector. */
9003 {
9006 }
9010 /* Build back pointers if needed. */
9014 }
9016 /* Handle the "nonnull" attribute. */
9017 static tree
9021 {
9025 /* If no arguments are specified, all pointer arguments should be
9026 non-null. Verify a full prototype is given so that the arguments
9027 will have the correct types when we actually check them later. */
9029 {
9031 {
9034 }
9036 }
9038 /* Argument list specified. Verify that each argument number references
9039 a pointer argument. */
9041 {
9050 {
9055 }
9058 {
9059 function_args_iterator iter;
9060 tree argument;
9064 {
9068 }
9072 {
9077 }
9080 {
9085 }
9086 }
9087 }
9090 }
9092 /* Check the argument list of a function call for null in argument slots
9093 that are marked as requiring a non-null pointer argument. The NARGS
9094 arguments are passed in the array ARGARRAY.
9095 */
9097 static void
9099 {
9100 tree a;
9108 /* See if any of the nonnull attributes has no arguments. If so,
9109 then every pointer argument is checked (in which case the check
9110 for pointer type is done in check_nonnull_arg). */
9112 do
9120 else
9121 {
9122 /* Walk the argument list. If we encounter an argument number we
9123 should check for non-null, do it. */
9125 {
9127 {
9131 }
9136 }
9137 }
9138 }
9140 /* Check that the Nth argument of a function call (counting backwards
9141 from the end) is a (pointer)0. The NARGS arguments are passed in the
9142 array ARGARRAY. */
9144 static void
9146 {
9150 {
9153 tree sentinel;
9154 function_args_iterator iter;
9155 tree t;
9157 /* Skip over the named arguments. */
9159 {
9162 len++;
9163 }
9166 {
9169 }
9171 /* The sentinel must be one of the varargs, i.e.
9172 in position >= the number of fixed arguments. */
9174 {
9178 }
9180 /* Validate the sentinel. */
9184 /* Although __null (in C++) is only an integer we allow it
9185 nevertheless, as we are guaranteed that it's exactly
9186 as wide as a pointer, and we don't want to force
9187 users to cast the NULL they have written there.
9188 We warn with -Wstrict-null-sentinel, though. */
9191 }
9192 }
9194 /* Helper for check_function_nonnull; given a list of operands which
9195 must be non-null in ARGS, determine if operand PARAM_NUM should be
9196 checked. */
9198 static bool
9200 {
9204 {
9211 }
9213 }
9215 /* Check that the function argument PARAM (which is operand number
9216 PARAM_NUM) is non-null. This is called by check_function_nonnull
9217 via check_function_arguments_recurse. */
9219 static void
9222 {
9223 /* Just skip checking the argument if it's not a pointer. This can
9224 happen if the "nonnull" attribute was given without an operand
9225 list (which means to check every pointer argument). */
9233 }
9235 /* Helper for nonnull attribute handling; fetch the operand number
9236 from the attribute argument list. */
9238 static bool
9240 {
9241 /* Verify the arg number is a small constant. */
9243 {
9246 }
9247 else
9249 }
9251 /* Handle a "nothrow" attribute; arguments as in
9252 struct attribute_spec.handler. */
9254 static tree
9257 {
9260 /* ??? TODO: Support types. */
9261 else
9262 {
9265 }
9268 }
9270 /* Handle a "cleanup" attribute; arguments as in
9271 struct attribute_spec.handler. */
9273 static tree
9276 {
9280 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9281 for global destructors in C++. This requires infrastructure that
9282 we don't have generically at the moment. It's also not a feature
9283 we'd be missing too much, since we do have attribute constructor. */
9285 {
9289 }
9291 /* Verify that the argument is a function in scope. */
9292 /* ??? We could support pointers to functions here as well, if
9293 that was considered desirable. */
9296 {
9300 }
9303 {
9307 }
9309 /* That the function has proper type is checked with the
9310 eventual call to build_function_call. */
9313 }
9315 /* Handle a "warn_unused_result" attribute. No special handling. */
9317 static tree
9321 {
9322 /* Ignore the attribute for functions not returning any value. */
9324 {
9327 }
9330 }
9332 /* Handle a "sentinel" attribute. */
9334 static tree
9337 {
9339 {
9343 }
9344 else
9345 {
9347 {
9351 }
9352 }
9355 {
9363 {
9367 }
9368 else
9369 {
9371 {
9375 }
9376 }
9377 }
9380 }
9382 /* Handle a "type_generic" attribute. */
9384 static tree
9388 {
9389 /* Ensure we have a function type. */
9392 /* Ensure we have a variadic function. */
9396 }
9398 /* Handle a "target" attribute. */
9400 static tree
9403 {
9404 /* Ensure we have a function type. */
9406 {
9409 }
9411 flags))
9415 }
9417 /* Arguments being collected for optimization. */
9422 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9423 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9424 false for #pragma GCC optimize. */
9426 bool
9428 {
9436 tree ap;
9438 /* Build up argv vector. Just in case the string is stored away, use garbage
9439 collected strings. */
9444 {
9448 {
9452 }
9455 {
9456 /* Split string into multiple substrings. */
9464 {
9471 {
9475 }
9476 else
9477 {
9480 }
9484 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9485 options. */
9487 {
9492 else
9496 }
9499 {
9502 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9503 itself is -Os, and any other switch begins with a -f. */
9509 }
9514 }
9516 }
9517 }
9527 /* Now parse the options. */
9537 /* Don't allow changing -fstrict-aliasing. */
9542 }
9544 /* For handling "optimize" attribute. arguments as in
9545 struct attribute_spec.handler. */
9547 static tree
9550 {
9551 /* Ensure we have a function type. */
9553 {
9556 }
9557 else
9558 {
9562 /* Save current options. */
9565 /* If we previously had some optimization options, use them as the
9566 default. */
9571 /* Parse options, and update the vector. */
9576 /* Restore current options. */
9578 }
9581 }
9583 /* Handle a "no_split_stack" attribute. */
9585 static tree
9590 {
9594 {
9598 }
9600 {
9604 }
9607 }
9609 /* Handle a "returns_nonnull" attribute; arguments as in
9610 struct attribute_spec.handler. */
9612 static tree
9615 {
9616 // Even without a prototype we still have a return type we can check.
9618 {
9621 }
9623 }
9625 /* Handle a "designated_init" attribute; arguments as in
9626 struct attribute_spec.handler. */
9628 static tree
9631 {
9633 {
9636 }
9638 }
9640 \f
9641 /* Check for valid arguments being passed to a function with FNTYPE.
9642 There are NARGS arguments in the array ARGARRAY. */
9643 void
9645 {
9646 /* Check for null being passed in a pointer argument that must be
9647 non-null. We also need to do this if format checking is enabled. */
9652 /* Check for errors in format strings. */
9659 }
9661 /* Generic argument checking recursion routine. PARAM is the argument to
9662 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9663 once the argument is resolved. CTX is context for the callback. */
9664 void
9669 {
9673 {
9674 /* Strip coercion. */
9678 }
9681 {
9683 tree attrs;
9686 /* See if this is a call to a known internationalization function
9687 that modifies a format arg. Such a function may have multiple
9688 format_arg attributes (for example, ngettext). */
9691 attrs;
9694 {
9695 tree inner_arg;
9696 tree format_num_expr;
9699 call_expr_arg_iterator iter;
9701 /* Extract the argument number, which was previously checked
9702 to be valid. */
9711 {
9716 }
9717 }
9719 /* If we found a format_arg attribute and did a recursive check,
9720 we are done with checking this argument. Otherwise, we continue
9721 and this will be considered a non-literal. */
9724 }
9727 {
9728 /* Check both halves of the conditional expression. */
9734 }
9737 }
9739 /* Checks for a builtin function FNDECL that the number of arguments
9740 NARGS against the required number REQUIRED and issues an error if
9741 there is a mismatch. Returns true if the number of arguments is
9742 correct, otherwise false. */
9744 static bool
9746 {
9748 {
9752 }
9754 {
9758 }
9760 }
9762 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9763 Returns false if there was an error, otherwise true. */
9765 bool
9767 {
9773 {
9783 {
9785 {
9789 }
9791 }
9801 {
9808 {
9812 }
9814 }
9819 {
9824 {
9828 }
9831 {
9833 fndecl);
9835 }
9837 }
9842 {
9844 {
9847 }
9849 }
9856 {
9860 {
9864 }
9867 {
9871 }
9873 }
9878 }
9879 }
9881 /* Function to help qsort sort FIELD_DECLs by name order. */
9883 int
9885 {
9890 /* A nontype is "greater" than a type. */
9899 }
9902 gt_pointer_operator new_value;
9906 /* This routine compares two fields like field_decl_cmp but using the
9907 pointer operator in resort_data. */
9909 static int
9911 {
9916 /* A nontype is "greater" than a type. */
9922 {
9929 }
9931 }
9933 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9935 void
9938 gt_pointer_operator new_value,
9940 {
9945 resort_field_decl_cmp);
9946 }
9948 /* Subroutine of c_parse_error.
9949 Return the result of concatenating LHS and RHS. RHS is really
9950 a string literal, its first character is indicated by RHS_START and
9951 RHS_SIZE is its length (including the terminating NUL character).
9953 The caller is responsible for deleting the returned pointer. */
9957 {
9963 }
9965 /* Issue the error given by GMSGID, indicating that it occurred before
9966 TOKEN, which had the associated VALUE. */
9968 void
9971 {
9972 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9982 {
9987 {
10000 }
10004 else
10010 }
10032 {
10037 }
10045 {
10050 }
10051 else
10055 {
10058 }
10059 #undef catenate_messages
10060 }
10062 /* Return the gcc option code associated with the reason for a cpp
10063 message, or 0 if none. */
10065 static int
10067 {
10071 {
10074 }
10076 }
10078 /* Callback from cpp_error for PFILE to print diagnostics from the
10079 preprocessor. The diagnostic is of type LEVEL, with REASON set
10080 to the reason code if LEVEL is represents a warning, at location
10081 LOCATION unless this is after lexing and the compiler's location
10082 should be used instead, with column number possibly overridden by
10083 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10084 the arguments. Returns true if a diagnostic was emitted, false
10085 otherwise. */
10087 bool
10091 {
10092 diagnostic_info diagnostic;
10093 diagnostic_t dlevel;
10098 {
10103 /* Fall through. */
10128 }
10141 }
10143 /* Convert a character from the host to the target execution character
10144 set. cpplib handles this, mostly. */
10146 HOST_WIDE_INT
10148 {
10149 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10150 zero-extended under -fno-signed-char. cpplib insists that characters
10151 and character constants are always unsigned. Hence we must convert
10152 back and forth. */
10160 else
10162 }
10164 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10165 references with an INDIRECT_REF of a constant at the bottom; much like the
10166 traditional rendering of offsetof as a macro. Return the folded result. */
10168 tree
10170 {
10174 {
10190 {
10193 }
10203 {
10207 }
10220 /* Check if the offset goes beyond the upper bound of the array. */
10222 {
10228 {
10232 {
10233 tree v;
10240 {
10248 }
10249 /* Don't warn if the array might be considered a poor
10250 man's flexible array member with a very permissive
10251 definition thereof. */
10255 "index %E denotes an offset "
10258 }
10259 }
10260 }
10267 /* Handle static members of volatile structs. */
10274 }
10277 }
10279 /* Likewise, but convert it to the return type of offsetof. */
10281 tree
10283 {
10285 }
10287 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10288 expression, because B will always be true. */
10290 void
10292 {
10295 "the omitted middle operand in ?: will always be %<true%>, "
10297 }
10299 /* Give an error for storing into ARG, which is 'const'. USE indicates
10300 how ARG was being used. */
10302 void
10304 {
10307 /* Using this macro rather than (for example) arrays of messages
10308 ensures that all the format strings are checked at compile
10309 time. */
10310 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10311 : (use == lv_increment ? (I) \
10312 : (use == lv_decrement ? (D) : (AS))))
10314 {
10325 else
10331 }
10337 arg);
10343 arg);
10345 {
10355 arg);
10356 }
10362 arg);
10363 else
10368 arg);
10369 }
10371 /* Print an error message for an invalid lvalue. USE says
10372 how the lvalue is being used and so selects the error message. LOC
10373 is the location for the error. */
10375 void
10377 {
10379 {
10397 }
10398 }
10400 /* Print an error message for an invalid indirection of type TYPE.
10401 ERRSTRING is the name of the operator for the indirection. */
10403 void
10405 {
10407 {
10415 type);
10420 type);
10425 type);
10430 type);
10435 type);
10439 }
10440 }
10441 \f
10442 /* *PTYPE is an incomplete array. Complete it with a domain based on
10443 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10444 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10445 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10447 int
10449 {
10457 {
10459 {
10460 int eltsize
10463 }
10465 {
10469 {
10473 }
10474 else
10475 {
10476 tree curindex;
10487 {
10491 else
10492 {
10494 {
10495 /* Since we treat size types now as ordinary
10496 unsigned types, we need an explicit overflow
10497 check. */
10501 }
10503 size_one_node);
10504 }
10507 }
10509 {
10513 }
10514 }
10515 }
10516 else
10517 {
10518 /* Make an error message unless that happened already. */
10521 }
10522 }
10523 else
10524 {
10528 }
10531 /* Force an indefinite layout factor. */
10534 size_zero_node);
10539 else
10542 /* Using build_distinct_type_copy and modifying things afterward instead
10543 of using build_array_type to create a new type preserves all of the
10544 TYPE_LANG_FLAG_? bits that the front end may have set. */
10552 /* Make sure we have the canonical MAIN_TYPE. */
10555 hashcode);
10558 /* Fix the canonical type. */
10568 else
10573 else
10579 {
10581 /* If we proceed with the array type as it is, we'll eventually
10582 crash in tree_to_[su]hwi(). */
10584 }
10588 }
10590 /* Like c_mark_addressable but don't check register qualifier. */
10591 void
10593 {
10599 }
10602 \f
10603 /* Used to help initialize the builtin-types.def table. When a type of
10604 the correct size doesn't exist, use error_mark_node instead of NULL.
10605 The later results in segfaults even when a decl using the type doesn't
10606 get invoked. */
10608 tree
10610 {
10613 }
10615 /* A helper function for resolve_overloaded_builtin in resolving the
10616 overloaded __sync_ builtins. Returns a positive power of 2 if the
10617 first operand of PARAMS is a pointer to a supported data type.
10618 Returns 0 if an error is encountered. */
10620 static int
10622 {
10623 tree type;
10627 {
10630 }
10634 {
10635 /* Force array-to-pointer decay for C++. */
10639 }
10651 incompatible:
10654 }
10656 /* A helper function for resolve_overloaded_builtin. Adds casts to
10657 PARAMS to make arguments match up with those of FUNCTION. Drops
10658 the variadic arguments at the end. Returns false if some error
10659 was encountered; true on success. */
10661 static bool
10664 {
10665 function_args_iterator iter;
10666 tree ptype;
10670 /* We've declared the implementation functions to use "volatile void *"
10671 as the pointer parameter, so we shouldn't get any complaints from the
10672 call to check_function_arguments what ever type the user used. */
10677 /* For the rest of the values, we need to cast these to FTYPE, so that we
10678 don't get warnings for passing pointer types, etc. */
10681 {
10685 /* XXX void_type_node belies the abstraction. */
10691 {
10694 }
10696 /* Only convert parameters if arg_type is unsigned integer type with
10697 new format sync routines, i.e. don't attempt to convert pointer
10698 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10699 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10700 kinds). */
10702 {
10703 /* Ideally for the first conversion we'd use convert_for_assignment
10704 so that we get warnings for anything that doesn't match the pointer
10705 type. This isn't portable across the C and C++ front ends atm. */
10710 }
10713 }
10715 /* __atomic routines are not variadic. */
10717 {
10720 }
10722 /* The definition of these primitives is variadic, with the remaining
10723 being "an optional list of variables protected by the memory barrier".
10724 No clue what that's supposed to mean, precisely, but we consider all
10725 call-clobbered variables to be protected so we're safe. */
10729 }
10731 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10732 RESULT to make it match the type of the first pointer argument in
10733 PARAMS. */
10735 static tree
10737 {
10742 /* New format doesn't require casting unless the types are the same size. */
10745 else
10747 }
10749 /* This function verifies the PARAMS to generic atomic FUNCTION.
10750 It returns the size if all the parameters are the same size, otherwise
10751 0 is returned if the parameters are invalid. */
10753 static int
10756 {
10761 tree type_0;
10763 /* Determine the parameter makeup. */
10765 {
10781 }
10784 {
10787 }
10789 /* Get type of first parameter, and determine its size. */
10792 {
10793 /* Force array-to-pointer decay for C++. */
10797 }
10799 {
10801 function);
10803 }
10805 /* Types must be compile time constant sizes. */
10807 {
10810 function);
10812 }
10816 /* Zero size objects are not allowed. */
10818 {
10821 function);
10823 }
10825 /* Check each other parameter is a pointer and the same size. */
10827 {
10830 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10834 {
10836 function);
10838 }
10842 {
10844 function);
10846 }
10847 }
10849 /* Check memory model parameters for validity. */
10851 {
10854 {
10857 {
10860 function);
10861 }
10862 }
10863 else
10865 {
10867 function);
10869 }
10870 }
10873 }
10876 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10877 at the beginning of the parameter list PARAMS representing the size of the
10878 objects. This is to match the library ABI requirement. LOC is the location
10879 of the function call.
10880 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10881 returned to allow the external call to be constructed. */
10883 static tree
10886 {
10887 tree size_node;
10889 /* Insert a SIZE_T parameter as the first param. If there isn't
10890 enough space, allocate a new vector and recursively re-build with that. */
10892 {
10895 tree f;
10905 }
10907 /* Add the size parameter and leave as a function call for processing. */
10911 }
10914 /* Return whether atomic operations for naturally aligned N-byte
10915 arguments are supported, whether inline or through libatomic. */
10916 static bool
10918 {
10920 {
10932 }
10933 }
10935 /* This will process an __atomic_exchange function call, determine whether it
10936 needs to be mapped to the _N variation, or turned into a library call.
10937 LOC is the location of the builtin call.
10938 FUNCTION is the DECL that has been invoked;
10939 PARAMS is the argument list for the call. The return value is non-null
10940 TRUE is returned if it is translated into the proper format for a call to the
10941 external library, and NEW_RETURN is set the tree for that function.
10942 FALSE is returned if processing for the _N variation is required, and
10943 NEW_RETURN is set to the the return value the result is copied into. */
10944 static bool
10947 {
10952 /* Size of 0 is an error condition. */
10954 {
10957 }
10959 /* If not a lock-free size, change to the library generic format. */
10961 {
10964 }
10966 /* Otherwise there is a lockfree match, transform the call from:
10967 void fn(T* mem, T* desired, T* return, model)
10968 into
10969 *return = (T) (fn (In* mem, (In) *desired, model)) */
10976 /* Create pointer to appropriate size. */
10980 /* Convert object pointer to required type. */
10983 /* Convert new value to required type, and dereference it. */
10988 /* Move memory model to the 3rd position, and end param list. */
10992 /* Convert return pointer and dereference it for later assignment. */
10996 }
10999 /* This will process an __atomic_compare_exchange function call, determine
11000 whether it needs to be mapped to the _N variation, or turned into a lib call.
11001 LOC is the location of the builtin call.
11002 FUNCTION is the DECL that has been invoked;
11003 PARAMS is the argument list for the call. The return value is non-null
11004 TRUE is returned if it is translated into the proper format for a call to the
11005 external library, and NEW_RETURN is set the tree for that function.
11006 FALSE is returned if processing for the _N variation is required. */
11008 static bool
11012 {
11017 /* Size of 0 is an error condition. */
11019 {
11022 }
11024 /* If not a lock-free size, change to the library generic format. */
11026 {
11027 /* The library generic format does not have the weak parameter, so
11028 remove it from the param list. Since a parameter has been removed,
11029 we can be sure that there is room for the SIZE_T parameter, meaning
11030 there will not be a recursive rebuilding of the parameter list, so
11031 there is no danger this will be done twice. */
11033 {
11037 }
11040 }
11042 /* Otherwise, there is a match, so the call needs to be transformed from:
11043 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11044 into
11045 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11051 /* Create pointer to appropriate size. */
11055 /* Convert object pointer to required type. */
11059 /* Convert expected pointer to required type. */
11063 /* Convert desired value to required type, and dereference it. */
11068 /* The rest of the parameters are fine. NULL means no special return value
11069 processing.*/
11072 }
11075 /* This will process an __atomic_load function call, determine whether it
11076 needs to be mapped to the _N variation, or turned into a library call.
11077 LOC is the location of the builtin call.
11078 FUNCTION is the DECL that has been invoked;
11079 PARAMS is the argument list for the call. The return value is non-null
11080 TRUE is returned if it is translated into the proper format for a call to the
11081 external library, and NEW_RETURN is set the tree for that function.
11082 FALSE is returned if processing for the _N variation is required, and
11083 NEW_RETURN is set to the the return value the result is copied into. */
11085 static bool
11088 {
11093 /* Size of 0 is an error condition. */
11095 {
11098 }
11100 /* If not a lock-free size, change to the library generic format. */
11102 {
11105 }
11107 /* Otherwise, there is a match, so the call needs to be transformed from:
11108 void fn(T* mem, T* return, model)
11109 into
11110 *return = (T) (fn ((In *) mem, model)) */
11116 /* Create pointer to appropriate size. */
11120 /* Convert object pointer to required type. */
11124 /* Move memory model to the 2nd position, and end param list. */
11128 /* Convert return pointer and dereference it for later assignment. */
11132 }
11135 /* This will process an __atomic_store function call, determine whether it
11136 needs to be mapped to the _N variation, or turned into a library call.
11137 LOC is the location of the builtin call.
11138 FUNCTION is the DECL that has been invoked;
11139 PARAMS is the argument list for the call. The return value is non-null
11140 TRUE is returned if it is translated into the proper format for a call to the
11141 external library, and NEW_RETURN is set the tree for that function.
11142 FALSE is returned if processing for the _N variation is required, and
11143 NEW_RETURN is set to the the return value the result is copied into. */
11145 static bool
11148 {
11153 /* Size of 0 is an error condition. */
11155 {
11158 }
11160 /* If not a lock-free size, change to the library generic format. */
11162 {
11165 }
11167 /* Otherwise, there is a match, so the call needs to be transformed from:
11168 void fn(T* mem, T* value, model)
11169 into
11170 fn ((In *) mem, (In) *value, model) */
11175 /* Create pointer to appropriate size. */
11179 /* Convert object pointer to required type. */
11183 /* Convert new value to required type, and dereference it. */
11188 /* The memory model is in the right spot already. Return is void. */
11192 }
11195 /* Some builtin functions are placeholders for other expressions. This
11196 function should be called immediately after parsing the call expression
11197 before surrounding code has committed to the type of the expression.
11199 LOC is the location of the builtin call.
11201 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11202 PARAMS is the argument list for the call. The return value is non-null
11203 when expansion is complete, and null if normal processing should
11204 continue. */
11206 tree
11209 {
11215 {
11221 else
11225 }
11227 /* Handle BUILT_IN_NORMAL here. */
11229 {
11234 {
11235 /* Handle these 4 together so that they can fall through to the next
11236 case if the call is transformed to an _N variant. */
11238 {
11240 {
11244 /* Change to the _N variant. */
11247 }
11250 {
11252 params,
11255 /* Change to the _N variant. */
11258 }
11260 {
11264 /* Change to the _N variant. */
11267 }
11269 {
11273 /* Change to the _N variant. */
11276 }
11279 }
11280 /* Fallthrough to the normal processing. */
11281 }
11298 {
11300 /* Fallthru for parameter processing. */
11301 }
11318 {
11329 orig_format))
11334 NULL);
11342 /* If new_return is set, assign function to that expr and cast the
11343 result to void since the generic interface returned void. */
11345 {
11346 /* Cast function result from I{1,2,4,8,16} to the required type. */
11349 result);
11353 }
11355 }
11359 }
11360 }
11362 /* vector_types_compatible_elements_p is used in type checks of vectors
11363 values used as operands of binary operators. Where it returns true, and
11364 the other checks of the caller succeed (being vector types in he first
11365 place, and matching number of elements), we can just treat the types
11366 as essentially the same.
11367 Contrast with vector_targets_convertible_p, which is used for vector
11368 pointer types, and vector_types_convertible_p, which will allow
11369 language-specific matches under the control of flag_lax_vector_conversions,
11370 and might still require a conversion. */
11371 /* True if vector types T1 and T2 can be inputs to the same binary
11372 operator without conversion.
11373 We don't check the overall vector size here because some of our callers
11374 want to give different error messages when the vectors are compatible
11375 except for the element count. */
11377 bool
11379 {
11392 /* Equality works here because c_common_signed_type uses
11393 TYPE_MAIN_VARIANT. */
11401 }
11403 /* Check for missing format attributes on function pointers. LTYPE is
11404 the new type or left-hand side type. RTYPE is the old type or
11405 right-hand side type. Returns TRUE if LTYPE is missing the desired
11406 attribute. */
11408 bool
11410 {
11412 tree ra;
11418 {
11419 tree la;
11424 }
11425 else
11427 }
11429 /* Subscripting with type char is likely to lose on a machine where
11430 chars are signed. So warn on any machine, but optionally. Don't
11431 warn for unsigned char since that type is safe. Don't warn for
11432 signed char because anyone who uses that must have done so
11433 deliberately. Furthermore, we reduce the false positive load by
11434 warning only for non-constant value of type char. */
11436 void
11438 {
11443 }
11445 /* Implement -Wparentheses for the unexpected C precedence rules, to
11446 cover cases like x + y << z which readers are likely to
11447 misinterpret. We have seen an expression in which CODE is a binary
11448 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11449 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11450 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11451 expression was not formed using a binary or unary operator, or it
11452 was enclosed in parentheses. */
11454 void
11458 {
11462 /* This macro tests that the expression ARG with original tree code
11463 CODE appears to be a boolean expression. or the result of folding a
11464 boolean expression. */
11465 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11466 (truth_value_p (TREE_CODE (ARG)) \
11467 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11469 || ((CODE) != INTEGER_CST \
11470 && (integer_onep (ARG) || integer_zerop (ARG))))
11473 {
11522 /* Check cases like x|y==z */
11529 /* Check cases like !x | y */
11533 "suggest parentheses around operand of "
11546 /* Check cases like x^y==z */
11568 /* Check cases like x&y==z */
11575 /* Check cases like !x & y */
11579 "suggest parentheses around operand of "
11602 {
11607 "comparisons like %<X<=Y<=Z%> do not "
11613 "comparisons like %<X<=Y<=Z%> do not "
11615 }
11617 }
11618 #undef NOT_A_BOOLEAN_EXPR_P
11619 }
11621 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11623 void
11625 {
11627 {
11630 else
11632 }
11633 }
11635 /* Warn for division by zero according to the value of DIVISOR. LOC
11636 is the location of the division operator. */
11638 void
11640 {
11641 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11642 about division by zero. Do not issue a warning if DIVISOR has a
11643 floating-point type, since we consider 0.0/0.0 a valid way of
11644 generating a NaN. */
11648 }
11650 /* Subroutine of build_binary_op. Give warnings for comparisons
11651 between signed and unsigned quantities that may fail. Do the
11652 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11653 so that casts will be considered, but default promotions won't
11654 be.
11656 LOCATION is the location of the comparison operator.
11658 The arguments of this function map directly to local variables
11659 of build_binary_op. */
11661 void
11666 {
11671 /* In C++, check for comparison of different enum types. */
11677 {
11681 }
11683 /* Do not warn if the comparison is being done in a signed type,
11684 since the signed type will only be chosen if it can represent
11685 all the values of the unsigned type. */
11688 /* Do not warn if both operands are unsigned. */
11691 else
11692 {
11698 else
11706 /* Do not warn if the signed quantity is an unsuffixed integer
11707 literal (or some static constant expression involving such
11708 literals or a conditional expression involving such literals)
11709 and it is non-negative. */
11712 /* Do not warn if the comparison is an equality operation, the
11713 unsigned quantity is an integral constant, and it would fit
11714 in the result if the result were signed. */
11719 /* In C, do not warn if the unsigned quantity is an enumeration
11720 constant and its maximum value would fit in the result if the
11721 result were signed. */
11727 else
11729 OPT_Wsign_compare,
11731 }
11733 /* Warn if two unsigned values are being compared in a size larger
11734 than their original size, and one (and only one) is the result of
11735 a `~' operator. This comparison will always fail.
11737 Also warn if one operand is a constant, and the constant does not
11738 have all bits set that are set in the ~ operand when it is
11739 extended. */
11746 {
11753 {
11754 tree primop;
11760 {
11764 }
11765 else
11766 {
11770 }
11775 {
11778 {
11782 else
11785 }
11786 }
11787 }
11795 }
11796 }
11798 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11799 type via c_common_type. If -Wdouble-promotion is in use, and the
11800 conditions for warning have been met, issue a warning. GMSGID is
11801 the warning message. It must have two %T specifiers for the type
11802 that was converted (generally "float") and the type to which it was
11803 converted (generally "double), respectively. LOC is the location
11804 to which the awrning should refer. */
11806 void
11809 {
11810 tree source_type;
11814 /* If the conversion will not occur at run-time, there is no need to
11815 warn about it. */
11827 else
11830 }
11832 /* Setup a TYPE_DECL node as a typedef representation.
11834 X is a TYPE_DECL for a typedef statement. Create a brand new
11835 ..._TYPE node (which will be just a variant of the existing
11836 ..._TYPE node with identical properties) and then install X
11837 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11839 The whole point here is to end up with a situation where each
11840 and every ..._TYPE node the compiler creates will be uniquely
11841 associated with AT MOST one node representing a typedef name.
11842 This way, even though the compiler substitutes corresponding
11843 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11844 early on, later parts of the compiler can always do the reverse
11845 translation and get back the corresponding typedef name. For
11846 example, given:
11848 typedef struct S MY_TYPE;
11849 MY_TYPE object;
11851 Later parts of the compiler might only know that `object' was of
11852 type `struct S' if it were not for code just below. With this
11853 code however, later parts of the compiler see something like:
11855 struct S' == struct S
11856 typedef struct S' MY_TYPE;
11857 struct S' object;
11859 And they can then deduce (from the node for type struct S') that
11860 the original object declaration was:
11862 MY_TYPE object;
11864 Being able to do this is important for proper support of protoize,
11865 and also for generating precise symbolic debugging information
11866 which takes full account of the programmer's (typedef) vocabulary.
11868 Obviously, we don't want to generate a duplicate ..._TYPE node if
11869 the TYPE_DECL node that we are now processing really represents a
11870 standard built-in type. */
11872 void
11874 {
11878 {
11881 }
11884 {
11892 }
11893 }
11895 /* Record the types used by the current global variable declaration
11896 being parsed, so that we can decide later to emit their debug info.
11897 Those types are in types_used_by_cur_var_decl, and we are going to
11898 store them in the types_used_by_vars_hash hash table.
11899 DECL is the declaration of the global variable that has been parsed. */
11901 void
11903 {
11907 {
11910 }
11911 }
11913 /* If DECL is a typedef that is declared in the current function,
11914 record it for the purpose of -Wunused-local-typedefs. */
11916 void
11918 {
11923 /* if this is not a locally defined typedef then we are not
11924 interested. */
11931 }
11933 /* If T is a TYPE_DECL declared locally, mark it as used. */
11935 void
11937 {
11942 }
11944 /* Warn if there are some unused locally defined typedefs in the
11945 current function. */
11947 void
11949 {
11951 tree decl;
11952 /* The number of times we have emitted -Wunused-local-typedefs
11953 warnings. If this is different from errorcount, that means some
11954 unrelated errors have been issued. In which case, we'll avoid
11955 emitting "unused-local-typedefs" warnings. */
11967 {
11971 OPT_Wunused_local_typedefs,
11974 }
11977 }
11979 /* Warn about boolean expression compared with an integer value different
11980 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11981 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11982 are the operands of the comparison. The caller must ensure that
11983 either operand is a boolean expression. */
11985 void
11987 tree op1)
11988 {
11998 {
12006 else
12009 }
12010 }
12012 /* The C and C++ parsers both use vectors to hold function arguments.
12013 For efficiency, we keep a cache of unused vectors. This is the
12014 cache. */
12019 /* Return a new vector from the cache. If the cache is empty,
12020 allocate a new vector. These vectors are GC'ed, so it is OK if the
12021 pointer is not released.. */
12025 {
12028 else
12029 {
12030 /* Passing 0 to vec::alloc returns NULL, and our callers require
12031 that we always return a non-NULL value. The vector code uses
12032 4 when growing a NULL vector, so we do too. */
12036 }
12037 }
12039 /* Release a vector of trees back to the cache. */
12041 void
12043 {
12045 {
12048 }
12049 }
12051 /* Get a new tree vector holding a single tree. */
12055 {
12059 }
12061 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12065 {
12070 }
12072 /* Get a new tree vector which is a copy of an existing one. */
12076 {
12079 tree t;
12086 }
12088 /* Return true if KEYWORD starts a type specifier. */
12090 bool
12092 {
12094 {
12128 }
12129 }
12131 /* Return true if KEYWORD names a type qualifier. */
12133 bool
12135 {
12137 {
12145 }
12146 }
12148 /* Return true if KEYWORD names a storage class specifier.
12150 RID_TYPEDEF is not included in this list despite `typedef' being
12151 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12152 such for syntactic convenience only. */
12154 bool
12156 {
12158 {
12168 }
12169 }
12171 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12173 static bool
12175 {
12177 {
12185 }
12186 }
12188 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12189 declaration-specifier (C99 6.7). */
12191 bool
12193 {
12200 {
12207 }
12208 }
12210 /* Initialize language-specific-bits of tree_contains_struct. */
12212 void
12214 {
12220 }
12222 /* Build a user-defined numeric literal out of an integer constant type VALUE
12223 with identifier SUFFIX. */
12225 tree
12228 {
12235 }
12237 /* For vector[index], convert the vector to a
12238 pointer of the underlying type. Return true if the resulting
12239 ARRAY_REF should not be an lvalue. */
12241 bool
12244 {
12247 {
12249 tree type1;
12258 {
12263 {
12266 *vecp
12269 non_const);
12270 }
12271 else
12276 }
12277 else
12284 {
12285 /* If the original vector isn't declared may_alias and it
12286 isn't a bare vector look if the subscripting would
12287 alias the vector we subscript, and if not, force ref-all. */
12293 }
12297 }
12299 }
12301 /* Determine which of the operands, if any, is a scalar that needs to be
12302 converted to a vector, for the range of operations. */
12303 enum stv_conv
12306 {
12315 {
12316 /* Most GENERIC binary expressions require homogeneous arguments.
12317 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12318 argument that is a vector and a second one that is a scalar, so
12319 we never return stv_secondarg for them. */
12324 {
12326 {
12331 }
12332 else
12334 }
12341 /* ... fall through ... */
12362 /* What about UNLT_EXPR? */
12364 {
12365 tree tmp;
12367 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12370 }
12374 {
12376 {
12381 }
12383 }
12385 /* Allow integer --> real conversion if safe. */
12389 {
12391 {
12396 }
12398 }
12401 }
12404 }
12406 /* Return true iff ALIGN is an integral constant that is a fundamental
12407 alignment, as defined by [basic.align] in the c++-11
12408 specifications.
12410 That is:
12412 [A fundamental alignment is represented by an alignment less than or
12413 equal to the greatest alignment supported by the implementation
12414 in all contexts, which is equal to
12415 alignof(max_align_t)]. */
12417 bool
12419 {
12422 }
12424 /* Return true if T is a pointer to a zero-sized aggregate. */
12426 bool
12428 {
12433 }