| blob | 98a14290753e5c117415cda54c678d83b9c925a5 |
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
59 /* Mode used to build pointers (VOIDmode means ptr_mode). */
63 /* The following symbols are subsumed in the c_global_trees array, and
64 listed here individually for documentation purposes.
66 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
68 tree short_integer_type_node;
69 tree long_integer_type_node;
70 tree long_long_integer_type_node;
72 tree short_unsigned_type_node;
73 tree long_unsigned_type_node;
74 tree long_long_unsigned_type_node;
76 tree truthvalue_type_node;
77 tree truthvalue_false_node;
78 tree truthvalue_true_node;
80 tree ptrdiff_type_node;
82 tree unsigned_char_type_node;
83 tree signed_char_type_node;
84 tree wchar_type_node;
86 tree char16_type_node;
87 tree char32_type_node;
89 tree float_type_node;
90 tree double_type_node;
91 tree long_double_type_node;
93 tree complex_integer_type_node;
94 tree complex_float_type_node;
95 tree complex_double_type_node;
96 tree complex_long_double_type_node;
98 tree dfloat32_type_node;
99 tree dfloat64_type_node;
100 tree_dfloat128_type_node;
102 tree intQI_type_node;
103 tree intHI_type_node;
104 tree intSI_type_node;
105 tree intDI_type_node;
106 tree intTI_type_node;
108 tree unsigned_intQI_type_node;
109 tree unsigned_intHI_type_node;
110 tree unsigned_intSI_type_node;
111 tree unsigned_intDI_type_node;
112 tree unsigned_intTI_type_node;
114 tree widest_integer_literal_type_node;
115 tree widest_unsigned_literal_type_node;
117 Nodes for types `void *' and `const void *'.
119 tree ptr_type_node, const_ptr_type_node;
121 Nodes for types `char *' and `const char *'.
123 tree string_type_node, const_string_type_node;
125 Type `char[SOMENUMBER]'.
126 Used when an array of char is needed and the size is irrelevant.
128 tree char_array_type_node;
130 Type `wchar_t[SOMENUMBER]' or something like it.
131 Used when a wide string literal is created.
133 tree wchar_array_type_node;
135 Type `char16_t[SOMENUMBER]' or something like it.
136 Used when a UTF-16 string literal is created.
138 tree char16_array_type_node;
140 Type `char32_t[SOMENUMBER]' or something like it.
141 Used when a UTF-32 string literal is created.
143 tree char32_array_type_node;
145 Type `int ()' -- used for implicit declaration of functions.
147 tree default_function_type;
149 A VOID_TYPE node, packaged in a TREE_LIST.
151 tree void_list_node;
153 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
154 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
155 VAR_DECLS, but C++ does.)
157 tree function_name_decl_node;
158 tree pretty_function_name_decl_node;
159 tree c99_function_name_decl_node;
161 Stack of nested function name VAR_DECLs.
163 tree saved_function_name_decls;
165 */
168 \f
169 /* Switches common to the C front ends. */
171 /* Nonzero means don't output line number information. */
175 /* Nonzero causes -E output not to be done, but directives such as
176 #define that have side effects are still obeyed. */
180 /* Nonzero means dump macros in some fashion. */
184 /* Nonzero means pass #include lines through to the output. */
188 /* Nonzero means process PCH files while preprocessing. */
192 /* The file name to which we should write a precompiled header, or
193 NULL if no header will be written in this compile. */
197 /* Nonzero if an ISO standard was selected. It rejects macros in the
198 user's namespace. */
201 /* C/ObjC language option variables. */
204 /* Nonzero means allow type mismatches in conditional expressions;
205 just make their values `void'. */
209 /* Nonzero means enable C89 Amendment 1 features. */
213 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
217 /* Nonzero means use the ISO C11 dialect of C. */
221 /* Nonzero means that we have builtin functions, and main is an int. */
226 /* ObjC language option variables. */
229 /* Tells the compiler that this is a special run. Do not perform any
230 compiling, instead we are to test some platform dependent features
231 and output a C header file with appropriate definitions. */
235 /* Tells the compiler what is the constant string class for ObjC. */
240 /* C++ language option variables. */
243 /* Nonzero means generate separate instantiation control files and
244 juggle them at link time. */
248 /* The C++ dialect being used. Default set in c_common_post_options. */
252 /* Maximum template instantiation depth. This limit exists to limit the
253 time it takes to notice excessively recursive template instantiations.
255 The default is lower than the 1024 recommended by the C++0x standard
256 because G++ runs out of stack before 1024 with highly recursive template
257 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
261 /* The elements of `ridpointers' are identifier nodes for the reserved
262 type names and storage classes. It is indexed by a RID_... value. */
267 /* Nonzero means don't warn about problems that occur when the code is
268 executed. */
271 /* Whether we are building a boolean conversion inside
272 convert_for_assignment, or some other late binary operation. If
273 build_binary_op is called for C (from code shared by C and C++) in
274 this case, then the operands have already been folded and the
275 result will not be folded again, so C_MAYBE_CONST_EXPR should not
276 be generated. */
279 /* Whether lexing has been completed, so subsequent preprocessor
280 errors should use the compiler's input_location. */
283 /* Information about how a function name is generated. */
284 struct fname_var_t
285 {
289 };
291 /* The three ways of getting then name of the current function. */
294 {
295 /* C99 compliant __func__, must be first. */
297 /* GCC __FUNCTION__ compliant. */
299 /* GCC __PRETTY_FUNCTION__ compliant. */
302 };
304 /* Global visibility options. */
406 /* Reserved words. The third field is a mask: keywords are disabled
407 if they match the mask.
409 Masks for languages:
410 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
411 C --std=c99: D_CXXONLY | D_OBJC
412 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
413 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
414 C++ --std=c0x: D_CONLY | D_OBJC
415 ObjC++ is like C++ except that D_OBJC is not set
417 If -fno-asm is used, D_ASM is added to the mask. If
418 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
419 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
420 In C with -Wc++-compat, we warn if D_CXXWARN is set.
422 Note the complication of the D_CXX_OBJC keywords. These are
423 reserved words such as 'class'. In C++, 'class' is a reserved
424 word. In Objective-C++ it is too. In Objective-C, it is a
425 reserved word too, but only if it follows an '@' sign.
426 */
428 {
593 /* These Objective-C keywords are recognized only immediately after
594 an '@'. */
611 /* These are recognized only in protocol-qualifier context
612 (see above) */
619 /* These are recognized inside a property attribute list */
628 };
633 /* Table of machine-independent attributes common to all C-like languages.
635 All attributes referencing arguments should be additionally processed
636 in chkp_copy_function_type_adding_bounds for correct instrumentation
637 by Pointer Bounds Checker.
638 Current list of processed common attributes: nonnull. */
640 {
641 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
642 affects_type_identity } */
649 /* FIXME: logically, noreturn attributes should be listed as
650 "false, true, true" and apply to function types. But implementing this
651 would require all the places in the compiler that use TREE_THIS_VOLATILE
652 on a decl to identify non-returning functions to be located and fixed
653 to check the function type instead. */
690 /* The same comments as for noreturn attributes apply to const ones. */
716 handle_no_instrument_function_attribute,
734 /* ??? These two attributes didn't make the transition from the
735 Intel language document to the multi-vendor language document. */
740 /* For internal use (marking of builtins) only. The name contains space
741 to prevent its usage in source code. */
763 /* For internal use (marking of builtins) only. The name contains space
764 to prevent its usage in source code. */
775 handle_no_address_safety_analysis_attribute,
778 handle_no_sanitize_address_attribute,
781 handle_no_sanitize_address_attribute,
784 handle_no_sanitize_undefined_attribute,
794 /* For internal use only. The leading '*' both prevents its usage in
795 source code and signals that it may be overridden by machine tables. */
800 /* For internal use (marking of builtins and runtime functions) only.
801 The name contains space to prevent its usage in source code. */
827 };
829 /* Give the specifications for the format attributes, used by C and all
830 descendants.
832 All attributes referencing arguments should be additionally processed
833 in chkp_copy_function_type_adding_bounds for correct instrumentation
834 by Pointer Bounds Checker.
835 Current list of processed format attributes: format, format_arg. */
837 {
838 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
839 affects_type_identity } */
845 };
847 /* Return identifier for address space AS. */
851 {
855 }
857 /* Push current bindings for the function name VAR_DECLS. */
859 void
861 {
866 {
870 {
872 saved);
874 }
875 }
877 /* Normally they'll have been NULL, so only push if we've got a
878 stack, or they are non-NULL. */
880 saved_function_name_decls);
881 }
883 /* Finish up the current bindings, adding them into the current function's
884 statement tree. This must be done _before_ finish_stmt_tree is called.
885 If there is no current function, we must be at file scope and no statements
886 are involved. Pop the previous bindings. */
888 void
890 {
899 {
907 }
913 {
914 /* We had saved values, restore them. */
915 tree saved;
918 {
923 }
925 }
927 }
929 /* Return the text name of the current function, suitably prettified
930 by PRETTY_P. Return string must be freed by caller. */
934 {
941 {
944 }
957 {
960 }
963 }
965 /* Return the VAR_DECL for a const char array naming the current
966 function. If the VAR_DECL has not yet been created, create it
967 now. RID indicates how it should be formatted and IDENTIFIER_NODE
968 ID is its name (unfortunately C and C++ hold the RID values of
969 keywords in different places, so we can't derive RID from ID in
970 this language independent code. LOC is the location of the
971 function. */
973 tree
975 {
985 {
986 /* If a tree is built here, it would normally have the lineno of
987 the current statement. Later this tree will be moved to the
988 beginning of the function and this line number will be wrong.
989 To avoid this problem set the lineno to 0 here; that prevents
990 it from appearing in the RTL. */
991 tree stmts;
999 saved_function_name_decls
1003 }
1008 }
1010 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1012 tree
1014 {
1019 /* Compute the number of elements, for the array type. */
1021 {
1024 }
1026 {
1029 }
1031 {
1034 }
1035 else
1036 {
1039 }
1041 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1042 limit in C++98 Annex B is very large (65536) and is not normative,
1043 so we do not diagnose it (warn_overlength_strings is forced off
1044 in c_common_post_options). */
1046 {
1050 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1051 separate the %d from the 'C'. 'ISO' should not be
1052 translated, but it may be moved after 'C%d' in languages
1053 where modifiers follow nouns. */
1055 "string length %qd is greater than the length %qd "
1058 }
1060 /* Create the array type for the string constant. The ISO C++
1061 standard says that a string literal has type `const char[N]' or
1062 `const wchar_t[N]'. We use the same logic when invoked as a C
1063 front-end with -Wwrite-strings.
1064 ??? We should change the type of an expression depending on the
1065 state of a warning flag. We should just be warning -- see how
1066 this is handled in the C++ front-end for the deprecated implicit
1067 conversion from string literals to `char*' or `wchar_t*'.
1069 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1070 array type being the unqualified version of that type.
1071 Therefore, if we are constructing an array of const char, we must
1072 construct the matching unqualified array type first. The C front
1073 end does not require this, but it does no harm, so we do it
1074 unconditionally. */
1085 }
1086 \f
1087 /* If DISABLE is true, stop issuing warnings. This is used when
1088 parsing code that we know will not be executed. This function may
1089 be called multiple times, and works as a stack. */
1091 static void
1093 {
1095 {
1098 }
1099 }
1101 /* If ENABLE is true, reenable issuing warnings. */
1103 static void
1105 {
1107 {
1110 }
1111 }
1113 /* Fully fold EXPR, an expression that was not folded (beyond integer
1114 constant expressions and null pointer constants) when being built
1115 up. If IN_INIT, this is in a static initializer and certain
1116 changes are made to the folding done. Clear *MAYBE_CONST if
1117 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1118 expression because it contains an evaluated operator (in C99) or an
1119 operator outside of sizeof returning an integer constant (in C90)
1120 not permitted in constant expressions, or because it contains an
1121 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1122 set to true by callers before calling this function.) Return the
1123 folded expression. Function arguments have already been folded
1124 before calling this function, as have the contents of SAVE_EXPR,
1125 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1126 C_MAYBE_CONST_EXPR. */
1128 tree
1130 {
1131 tree ret;
1137 /* This function is not relevant to C++ because C++ folds while
1138 parsing, and may need changes to be correct for C++ when C++
1139 stops folding while parsing. */
1146 {
1149 }
1156 }
1158 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1159 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1160 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1161 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1162 both evaluated and unevaluated subexpressions while
1163 *MAYBE_CONST_ITSELF is carried from only evaluated
1164 subexpressions). FOR_INT_CONST indicates if EXPR is an expression
1165 with integer constant operands, and if any of the operands doesn't
1166 get folded to an integer constant, don't fold the expression itself. */
1168 static tree
1171 {
1183 /* This function is not relevant to C++ because C++ folds while
1184 parsing, and may need changes to be correct for C++ when C++
1185 stops folding while parsing. */
1189 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1190 anything else not counted as an expression cannot usefully be
1191 folded further at this point. */
1197 /* Operands of variable-length expressions (function calls) have
1198 already been folded, as have __builtin_* function calls, and such
1199 expressions cannot occur in constant expressions. */
1201 {
1205 }
1208 {
1214 {
1218 }
1221 else
1224 }
1226 /* Assignment, increment, decrement, function call and comma
1227 operators, and statement expressions, cannot occur in constant
1228 expressions if evaluated / outside of sizeof. (Function calls
1229 were handled above, though VA_ARG_EXPR is treated like a function
1230 call here, and statement expressions are handled through
1231 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1233 {
1253 }
1255 /* Fold individual tree codes as appropriate. */
1257 {
1259 /* Any non-constancy will have been marked in a containing
1260 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1273 {
1276 }
1294 {
1298 }
1340 /* Binary operations evaluating both arguments (increment and
1341 decrement are binary internally in GCC). */
1353 /* The RHS of a MODIFY_EXPR was fully folded when building that
1354 expression for the sake of conversion warnings. */
1366 ret = in_init
1369 else
1390 {
1403 }
1420 CASE_CONVERT:
1431 /* Unary operations. */
1442 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1443 not prepared to deal with them if they occur in initializers. */
1451 ret = in_init
1454 else
1459 {
1463 }
1465 {
1468 CASE_CONVERT:
1469 /* Don't warn about explicit conversions. We will already
1470 have warned about suspect implicit conversions. */
1477 }
1482 /* Binary operations not necessarily evaluating both
1483 arguments. */
1487 for_int_const);
1491 ? truthvalue_false_node
1495 for_int_const);
1501 /* Require OP1 be an INTEGER_CST only if it's evaluated. */
1506 ret = in_init
1509 else
1514 && op0_const
1515 && op0_const_self
1521 && op0_const_self
1533 for_int_const);
1538 for_int_const);
1544 for_int_const);
1550 /* Only the evaluated operand must be an INTEGER_CST. */
1558 else
1563 && op0_const
1564 && op0_const_self
1568 && op0_const_self
1572 && op0_const
1573 && op0_const_self
1577 && op0_const_self
1583 /* Each case where an operand with excess precision may be
1584 encountered must remove the EXCESS_PRECISION_EXPR around
1585 inner operands and possibly put one around the whole
1586 expression or possibly convert to the semantic type (which
1587 c_fully_fold does); we cannot tell at this stage which is
1588 appropriate in any particular case. */
1592 /* Various codes may appear through folding built-in functions
1593 and their arguments. */
1595 }
1597 out:
1598 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1599 have been done by this point, so remove them again. */
1603 {
1607 }
1611 }
1613 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1614 return EXP. Otherwise, return either EXP or its known constant
1615 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1616 Is the BLKmode test appropriate? */
1618 tree
1620 {
1621 tree ret;
1623 /* This function is only used by C, for c_fully_fold and other
1624 optimization, and may not be correct for C++. */
1635 /* Avoid unwanted tree sharing between the initializer and current
1636 function's body where the tree can be modified e.g. by the
1637 gimplifier. */
1641 }
1643 /* Print a warning if a constant expression had overflow in folding.
1644 Invoke this function on every expression that the language
1645 requires to be a constant expression.
1646 Note the ANSI C standard says it is erroneous for a
1647 constant expression to overflow. */
1649 void
1651 {
1659 }
1661 /* The same as above but print an unconditional error. */
1662 void
1664 {
1671 }
1673 /* Print a warning if an expression had overflow in folding and its
1674 operands hadn't.
1676 Invoke this function on every expression that
1677 (1) appears in the source code, and
1678 (2) is a constant expression that overflowed, and
1679 (3) is not already checked by convert_and_check;
1680 however, do not invoke this function on operands of explicit casts
1681 or when the expression is the result of an operator and any operand
1682 already overflowed. */
1684 void
1686 {
1691 {
1720 }
1721 }
1723 /* Warn about uses of logical || / && operator in a context where it
1724 is likely that the bitwise equivalent was intended by the
1725 programmer. We have seen an expression in which CODE is a binary
1726 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1727 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1728 void
1732 {
1744 /* We don't want to warn if either operand comes from a macro
1745 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1746 see PR61534. */
1751 /* Warn if &&/|| are being used in a context where it is
1752 likely that the bitwise equivalent was intended by the
1753 programmer. That is, an expression such as op && MASK
1754 where op should not be any boolean expression, nor a
1755 constant, and mask seems to be a non-boolean integer constant. */
1763 {
1767 else
1772 }
1774 /* We do not warn for constants because they are typical of macro
1775 expansions that test for features. */
1779 /* This warning only makes sense with logical operands. */
1786 /* The range computations only work with scalars. */
1791 /* We first test whether either side separately is trivially true
1792 (with OR) or trivially false (with AND). If so, do not warn.
1793 This is a common idiom for testing ranges of data types in
1794 portable code. */
1801 /* If this is an OR operation, invert both sides; now, the result
1802 should be always false to get a warning. */
1816 /* If this is an OR operation, invert both sides; now, the result
1817 should be always false to get a warning. */
1825 /* If both expressions have the same operand, if we can merge the
1826 ranges, ... */
1830 {
1832 /* ... and if the range test is always false, then warn. */
1834 {
1837 "logical %<or%> of collectively exhaustive tests is "
1839 else
1841 "logical %<and%> of mutually exclusive tests is "
1843 }
1844 /* Or warn if the operands have exactly the same range, e.g.
1845 A > 0 && A > 0. */
1848 {
1852 else
1855 }
1856 }
1857 }
1859 /* Warn about logical not used on the left hand side operand of a comparison.
1860 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1861 Do not warn if RHS is of a boolean type. */
1863 void
1865 tree rhs)
1866 {
1872 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1873 !(x == 0) or !(y != 0). */
1879 "logical not is only applied to the left hand side of "
1881 }
1883 /* Warn if EXP contains any computations whose results are not used.
1884 Return true if a warning is printed; false otherwise. LOCUS is the
1885 (potential) location of the expression. */
1887 bool
1889 {
1890 restart:
1894 /* Don't warn about void constructs. This includes casting to void,
1895 void function calls, and statement expressions with a final cast
1896 to void. */
1904 {
1920 /* For a binding, warn if no side effect within it. */
1932 /* In && or ||, warn if 2nd operand has no side effect. */
1939 /* Let people do `(foo (), 0)' without a warning. */
1946 /* If this is an expression with side effects, don't warn; this
1947 case commonly appears in macro expansions. */
1953 /* Don't warn about automatic dereferencing of references, since
1954 the user cannot control it. */
1956 {
1959 }
1960 /* Fall through. */
1963 /* Referencing a volatile value is a side effect, so don't warn. */
1968 /* If this is an expression which has no operands, there is no value
1969 to be unused. There are no such language-independent codes,
1970 but front ends may define such. */
1974 warn:
1976 }
1977 }
1980 /* Print a warning about casts that might indicate violation
1981 of strict aliasing rules if -Wstrict-aliasing is used and
1982 strict aliasing mode is in effect. OTYPE is the original
1983 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1985 bool
1987 {
1988 /* Strip pointer conversion chains and get to the correct original type. */
1996 /* If the type we are casting to is a ref-all pointer
1997 dereferencing it is always valid. */
2004 {
2005 /* Casting the address of an object to non void pointer. Warn
2006 if the cast breaks type based aliasing. */
2008 {
2012 }
2013 else
2014 {
2015 /* warn_strict_aliasing >= 3. This includes the default (3).
2016 Only warn if the cast is dereferenced immediately. */
2017 alias_set_type set1 =
2023 {
2027 }
2030 {
2034 }
2035 }
2036 }
2037 else
2039 {
2040 /* At this level, warn for any conversions, even if an address is
2041 not taken in the same statement. This will likely produce many
2042 false positives, but could be useful to pinpoint problems that
2043 are not revealed at higher levels. */
2048 {
2052 }
2053 }
2056 }
2058 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2059 sizeof as last operand of certain builtins. */
2061 void
2065 {
2069 location_t loc;
2077 {
2081 /* FALLTHRU */
2089 /* FALLTHRU */
2148 }
2176 {
2180 {
2183 "argument to %<sizeof%> in %qD call is the same "
2184 "expression as the destination; did you mean to "
2190 "argument to %<sizeof%> in %qD call is the same "
2191 "expression as the destination; did you mean to "
2193 else
2195 "argument to %<sizeof%> in %qD call is the same "
2196 "expression as the destination; did you mean to "
2199 }
2202 && !strop
2205 {
2207 "argument to %<sizeof%> in %qD call is the same "
2208 "pointer type %qT as the destination; expected %qT "
2212 }
2213 }
2216 {
2220 {
2223 "argument to %<sizeof%> in %qD call is the same "
2224 "expression as the source; did you mean to "
2230 "argument to %<sizeof%> in %qD call is the same "
2231 "expression as the source; did you mean to "
2233 else
2235 "argument to %<sizeof%> in %qD call is the same "
2236 "expression as the source; did you mean to "
2239 }
2242 && !strop
2245 {
2247 "argument to %<sizeof%> in %qD call is the same "
2248 "pointer type %qT as the source; expected %qT "
2252 }
2253 }
2256 {
2260 {
2263 "argument to %<sizeof%> in %qD call is the same "
2264 "expression as the first source; did you mean to "
2270 "argument to %<sizeof%> in %qD call is the same "
2271 "expression as the first source; did you mean to "
2273 else
2275 "argument to %<sizeof%> in %qD call is the same "
2276 "expression as the first source; did you mean to "
2279 }
2282 && !strop
2285 {
2287 "argument to %<sizeof%> in %qD call is the same "
2288 "pointer type %qT as the first source; expected %qT "
2292 }
2293 }
2296 {
2300 {
2303 "argument to %<sizeof%> in %qD call is the same "
2304 "expression as the second source; did you mean to "
2310 "argument to %<sizeof%> in %qD call is the same "
2311 "expression as the second source; did you mean to "
2313 else
2315 "argument to %<sizeof%> in %qD call is the same "
2316 "expression as the second source; did you mean to "
2319 }
2322 && !strop
2325 {
2327 "argument to %<sizeof%> in %qD call is the same "
2328 "pointer type %qT as the second source; expected %qT "
2332 }
2333 }
2335 }
2337 /* Warn for unlikely, improbable, or stupid DECL declarations
2338 of `main'. */
2340 void
2342 {
2343 function_args_iterator iter;
2344 tree type;
2348 {
2349 /* XXX void_type_node belies the abstraction. */
2359 {
2365 }
2369 {
2391 "third argument of %q+D should probably be "
2394 }
2395 }
2397 /* It is intentional that this message does not mention the third
2398 argument because it's only mentioned in an appendix of the
2399 standard. */
2407 }
2409 /* vector_targets_convertible_p is used for vector pointer types. The
2410 callers perform various checks that the qualifiers are satisfactory,
2411 while OTOH vector_targets_convertible_p ignores the number of elements
2412 in the vectors. That's fine with vector pointers as we can consider,
2413 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2414 and that does not require and conversion of the pointer values.
2415 In contrast, vector_types_convertible_p and
2416 vector_types_compatible_elements_p are used for vector value types. */
2417 /* True if pointers to distinct types T1 and T2 can be converted to
2418 each other without an explicit cast. Only returns true for opaque
2419 vector types. */
2420 bool
2422 {
2429 }
2431 /* vector_types_convertible_p is used for vector value types.
2432 It could in principle call vector_targets_convertible_p as a subroutine,
2433 but then the check for vector type would be duplicated with its callers,
2434 and also the purpose of vector_targets_convertible_p would become
2435 muddled.
2436 Where vector_types_convertible_p returns true, a conversion might still be
2437 needed to make the types match.
2438 In contrast, vector_targets_convertible_p is used for vector pointer
2439 values, and vector_types_compatible_elements_p is used specifically
2440 in the context for binary operators, as a check if use is possible without
2441 conversion. */
2442 /* True if vector types T1 and T2 can be converted to each other
2443 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2444 can only be converted with -flax-vector-conversions yet that is not
2445 in effect, emit a note telling the user about that option if such
2446 a note has not previously been emitted. */
2447 bool
2449 {
2457 convertible_lax =
2472 {
2475 "conversions between vectors with differing "
2477 }
2480 }
2482 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2483 and have vector types, V0 has the same type as V1, and the number of
2484 elements of V0, V1, MASK is the same.
2486 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2487 called with two arguments. In this case implementation passes the
2488 first argument twice in order to share the same tree code. This fact
2489 could enable the mask-values being twice the vector length. This is
2490 an implementation accident and this semantics is not guaranteed to
2491 the user. */
2492 tree
2495 {
2496 tree ret;
2502 {
2505 }
2512 {
2517 }
2521 {
2525 }
2528 {
2533 }
2539 {
2542 "argument vector(s) and the mask vector should "
2545 }
2549 {
2554 }
2557 {
2558 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2564 else
2565 {
2568 }
2572 }
2582 }
2584 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2585 to integral type. */
2587 static tree
2589 {
2594 {
2595 /* C++0x scoped enumerations don't implicitly convert to integral
2596 type; if we stripped an explicit conversion to a larger type we
2597 need to replace it so common_type will still work. */
2601 }
2603 }
2605 /* This is a helper function of build_binary_op.
2607 For certain operations if both args were extended from the same
2608 smaller type, do the arithmetic in that type and then extend.
2610 BITWISE indicates a bitwise operation.
2611 For them, this optimization is safe only if
2612 both args are zero-extended or both are sign-extended.
2613 Otherwise, we might change the result.
2614 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2615 but calculated in (unsigned short) it would be (unsigned short)-1.
2616 */
2617 tree
2619 {
2623 tree type;
2625 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2626 excessive narrowing when we call get_narrower below. For
2627 example, suppose that OP0 is of unsigned int extended
2628 from signed char and that RESULT_TYPE is long long int.
2629 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2630 like
2632 (long long int) (unsigned int) signed_char
2634 which get_narrower would narrow down to
2636 (unsigned int) signed char
2638 If we do not cast OP0 first, get_narrower would return
2639 signed_char, which is inconsistent with the case of the
2640 explicit cast. */
2647 /* UNS is 1 if the operation to be done is an unsigned one. */
2650 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2651 but it *requires* conversion to FINAL_TYPE. */
2662 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2664 /* For bitwise operations, signedness of nominal type
2665 does not matter. Consider only how operands were extended. */
2669 /* Note that in all three cases below we refrain from optimizing
2670 an unsigned operation on sign-extended args.
2671 That would not be valid. */
2673 /* Both args variable: if both extended in same way
2674 from same width, do it in that width.
2675 Do it unsigned if args were zero-extended. */
2682 return c_common_signed_or_unsigned_type
2689 && (type
2700 && (type
2708 }
2710 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2711 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2713 static bool
2715 {
2718 REAL_VALUE_TYPE real_low_bound =
2720 REAL_VALUE_TYPE real_high_bound =
2725 }
2727 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2728 to the complex/real/integer type TYPE. Function returns non-zero when:
2729 * EXPR is a constant which cannot be exactly converted to TYPE.
2730 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2731 for EXPR type and TYPE being both integers or both real, or both
2732 complex.
2733 * EXPR is not a constant of complex type and TYPE is a real or
2734 an integer.
2735 * EXPR is not a constant of real type and TYPE is an integer.
2736 * EXPR is not a constant of integer type which cannot be
2737 exactly converted to real type.
2739 Function allows conversions between types of different signedness and
2740 can return SAFE_CONVERSION (zero) in that case. Function can produce
2741 signedness warnings if PRODUCE_WARNS is true.
2743 Function allows conversions from complex constants to non-complex types,
2744 provided that imaginary part is zero and real part can be safely converted
2745 to TYPE. */
2747 enum conversion_safety
2749 {
2755 {
2756 /* If type is complex, we are interested in compatibility with
2757 underlying type. */
2761 /* Warn for real constant that is not an exact integer converted
2762 to integer type. */
2765 {
2768 }
2769 /* Warn for an integer constant that does not fit into integer type. */
2773 {
2776 {
2780 }
2782 {
2786 }
2787 else
2789 }
2791 {
2792 /* Warn for an integer constant that does not fit into real type. */
2794 {
2798 }
2799 /* Warn for a real constant that does not fit into a smaller
2800 real type. */
2803 {
2807 }
2808 }
2809 }
2812 {
2814 /* Conversion from complex constant with zero imaginary part,
2815 perform check for conversion of real part. */
2820 /* Note: in this branch we use recursive call to unsafe_conversion_p
2821 with different type of EXPR, but it is still safe, because when EXPR
2822 is a constant, it's type is not used in text of generated warnings
2823 (otherwise they could sound misleading). */
2825 produce_warns);
2826 /* Conversion from complex constant with non-zero imaginary part. */
2827 else
2828 {
2829 /* Conversion to complex type.
2830 Perform checks for both real and imaginary parts. */
2832 {
2833 /* Unfortunately, produce_warns must be false in two subsequent
2834 calls of unsafe_conversion_p, because otherwise we could
2835 produce strange "double" warnings, if both real and imaginary
2836 parts have conversion problems related to signedness.
2838 For example:
2839 int32_t _Complex a = 0x80000000 + 0x80000000i;
2841 Possible solution: add a separate function for checking
2842 constants and combine result of two calls appropriately. */
2848 /* Merge the results into appropriate single warning. */
2850 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2857 else
2859 }
2860 /* Warn about conversion from complex to real or integer type. */
2861 else
2863 }
2864 }
2866 /* Checks for remaining case: EXPR is not constant. */
2867 else
2868 {
2869 /* Warn for real types converted to integer types. */
2876 {
2877 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2881 /* Don't warn for short y; short x = ((int)y & 0xff); */
2885 {
2886 /* If both args were extended from a shortest type,
2887 use that type if that is safe. */
2894 {
2900 /* If one of the operands is a non-negative constant
2901 that fits in the target type, then the type of the
2902 other operand does not matter. */
2911 /* If constant is unsigned and fits in the target
2912 type, then the result will also fit. */
2914 && unsigned0
2917 && unsigned1
2920 }
2921 }
2922 /* Warn for integer types converted to smaller integer types. */
2926 /* When they are the same width but different signedness,
2927 then the value may change. */
2930 /* Even when converted to a bigger type, if the type is
2931 unsigned but expr is signed, then negative values
2932 will be changed. */
2938 }
2940 /* Warn for integer types converted to real types if and only if
2941 all the range of values of the integer type cannot be
2942 represented by the real type. */
2945 {
2946 /* Don't warn about char y = 0xff; float x = (int) y; */
2952 }
2954 /* Warn for real types converted to smaller real types. */
2960 /* Check conversion between two complex types. */
2963 {
2964 /* Extract underlying types (i.e., type of real and imaginary
2965 parts) of expr_type and type. */
2969 /* Warn for real types converted to integer types. */
2974 /* Warn for real types converted to smaller real types. */
2980 /* Check conversion for complex integer types. Here implementation
2981 is simpler than for real-domain integers because it does not
2982 involve sophisticated cases, such as bitmasks, casts, etc. */
2985 {
2986 /* Warn for integer types converted to smaller integer types. */
2990 /* Check for different signedness, see case for real-domain
2991 integers (above) for a more detailed comment. */
2997 "conversion to %qT from %qT "
3000 }
3005 }
3007 /* Warn for complex types converted to real or integer types. */
3011 }
3014 }
3016 /* Warns if the conversion of EXPR to TYPE may alter a value.
3017 This is a helper function for warnings_for_convert_and_check. */
3019 static void
3021 {
3028 /* This may happen, because for LHS op= RHS we preevaluate
3029 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
3030 means we could no longer see the code of the EXPR. */
3037 {
3050 /* Conversion from boolean to a signed:1 bit-field (which only
3051 can hold the values 0 and -1) doesn't lose information - but
3052 it does change the value. */
3073 {
3074 /* In case of COND_EXPR, we do not care about the type of
3075 COND_EXPR, only about the conversion of each operand. */
3082 }
3098 }
3099 }
3101 /* Produce warnings after a conversion. RESULT is the result of
3102 converting EXPR to TYPE. This is a helper function for
3103 convert_and_check and cp_convert_and_check. */
3105 void
3107 tree result)
3108 {
3115 {
3116 /* Do not diagnose overflow in a constant expression merely
3117 because a conversion overflowed. */
3122 {
3123 /* This detects cases like converting -129 or 256 to
3124 unsigned char. */
3128 else
3130 }
3134 /* No warning for converting 0x80000000 to int. */
3142 else
3144 }
3149 else
3151 }
3154 /* Convert EXPR to TYPE, warning about conversion problems with constants.
3155 Invoke this function on every expression that is converted implicitly,
3156 i.e. because of language rules and not because of an explicit cast. */
3158 tree
3160 {
3161 tree result;
3162 tree expr_for_warning;
3164 /* Convert from a value with possible excess precision rather than
3165 via the semantic type, but do not warn about values not fitting
3166 exactly in the semantic type. */
3168 {
3174 }
3175 else
3189 }
3190 \f
3191 /* A node in a list that describes references to variables (EXPR), which are
3192 either read accesses if WRITER is zero, or write accesses, in which case
3193 WRITER is the parent of EXPR. */
3194 struct tlist
3195 {
3198 };
3200 /* Used to implement a cache the results of a call to verify_tree. We only
3201 use this for SAVE_EXPRs. */
3202 struct tlist_cache
3203 {
3207 tree expr;
3208 };
3210 /* Obstack to use when allocating tlist structures, and corresponding
3211 firstobj. */
3215 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3216 warnings. */
3218 /* SAVE_EXPRs need special treatment. We process them only once and then
3219 cache the results. */
3231 /* Create a new struct tlist and fill in its fields. */
3234 {
3241 }
3243 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3244 is nonnull, we ignore any node we find which has a writer equal to it. */
3246 static void
3248 {
3250 {
3257 }
3258 }
3260 /* Merge the nodes of ADD into TO. This merging process is done so that for
3261 each variable that already exists in TO, no new node is added; however if
3262 there is a write access recorded in ADD, and an occurrence on TO is only
3263 a read access, then the occurrence in TO will be modified to record the
3264 write. */
3266 static void
3268 {
3275 {
3282 {
3286 }
3288 {
3292 }
3294 }
3295 }
3297 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3298 references in list LIST conflict with it, excluding reads if ONLY writers
3299 is nonzero. */
3301 static void
3304 {
3307 /* Avoid duplicate warnings. */
3313 {
3317 {
3322 }
3324 }
3325 }
3327 /* Given a list LIST of references to variables, find whether any of these
3328 can cause conflicts due to missing sequence points. */
3330 static void
3332 {
3336 {
3339 }
3340 }
3342 /* Return nonzero if X is a tree that can be verified by the sequence point
3343 warnings. */
3344 static int
3346 {
3353 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3354 (lvalue_p) crash on TRY/CATCH. */
3361 /* No point to track non-const calls, they will never satisfy
3362 operand_equal_p. */
3370 }
3372 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3373 static bool
3375 {
3377 }
3379 /* Walk the tree X, and record accesses to variables. If X is written by the
3380 parent tree, WRITER is the parent.
3381 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3382 expression or its only operand forces a sequence point, then everything up
3383 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3384 in PNO_SP.
3385 Once we return, we will have emitted warnings if any subexpression before
3386 such a sequence point could be undefined. On a higher level, however, the
3387 sequence point may not be relevant, and we'll merge the two lists.
3389 Example: (b++, a) + b;
3390 The call that processes the COMPOUND_EXPR will store the increment of B
3391 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3392 processes the PLUS_EXPR will need to merge the two lists so that
3393 eventually, all accesses end up on the same list (and we'll warn about the
3394 unordered subexpressions b++ and b.
3396 A note on merging. If we modify the former example so that our expression
3397 becomes
3398 (b++, b) + a
3399 care must be taken not simply to add all three expressions into the final
3400 PNO_SP list. The function merge_tlist takes care of that by merging the
3401 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3402 way, so that no more than one access to B is recorded. */
3404 static void
3406 tree writer)
3407 {
3412 /* X may be NULL if it is the operand of an empty statement expression
3413 ({ }). */
3417 restart:
3425 {
3458 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3459 two first, to avoid warning for (a ? b++ : b++). */
3475 /* Expressions inside the LHS are not ordered wrt. the sequence points
3476 in the RHS. Example:
3477 *a = (a++, 2)
3478 Despite the fact that the modification of "a" is in the before_sp
3479 list (tmp_before), it conflicts with the use of "a" in the LHS.
3480 We can handle this by adding the contents of tmp_list3
3481 to those of tmp_before, and redoing the collision warnings for that
3482 list. */
3485 /* Exclude the LHS itself here; we first have to merge it into the
3486 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3487 didn't exclude the LHS, we'd get it twice, once as a read and once
3488 as a write. */
3499 /* We need to warn about conflicts among arguments and conflicts between
3500 args and the function address. Side effects of the function address,
3501 however, are not ordered by the sequence point of the call. */
3502 {
3503 call_expr_arg_iterator iter;
3504 tree arg;
3508 {
3513 }
3518 }
3521 /* Scan all the list, e.g. indices of multi dimensional array. */
3523 {
3529 }
3533 {
3540 {
3554 }
3558 }
3568 /* For other expressions, simply recurse on their operands.
3569 Manual tail recursion for unary expressions.
3570 Other non-expressions need not be processed. */
3572 {
3576 }
3578 {
3582 {
3587 }
3588 }
3590 }
3591 }
3593 /* Try to warn for undefined behavior in EXPR due to missing sequence
3594 points. */
3596 DEBUG_FUNCTION void
3598 {
3604 {
3607 }
3612 }
3613 \f
3614 /* Validate the expression after `case' and apply default promotions. */
3616 static tree
3618 {
3623 /* Promote char or short to int. */
3626 {
3629 }
3634 }
3635 \f
3636 /* See if the case values LOW and HIGH are in the range of the original
3637 type (i.e. before the default conversion to int) of the switch testing
3638 expression.
3639 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3640 the type before promoting it. CASE_LOW_P is a pointer to the lower
3641 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3642 if the case is not a case range.
3643 The caller has to make sure that we are not called with NULL for
3644 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3645 was a case value that doesn't fit into the range of the ORIG_TYPE.
3646 Returns true if the case label is in range of ORIG_TYPE (saturated or
3647 untouched) or false if the label is out of range. */
3649 static bool
3653 {
3658 /* If there was a problem with the original type, do nothing. */
3665 /* Case label is less than minimum for type. */
3668 {
3673 }
3675 /* Case value is greater than maximum for type. */
3678 {
3682 }
3684 /* Saturate lower case label value to minimum. */
3687 {
3692 }
3694 /* Saturate upper case label value to maximum. */
3697 {
3702 }
3710 }
3711 \f
3712 /* Return an integer type with BITS bits of precision,
3713 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3715 tree
3717 {
3759 }
3761 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3762 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3763 and saturating if SATP is nonzero, otherwise not saturating. */
3765 tree
3768 {
3769 machine_mode mode;
3772 else
3780 {
3782 "fixed-point types that have too many integral and "
3785 }
3788 }
3790 /* Used for communication between c_common_type_for_mode and
3791 c_register_builtin_type. */
3792 tree registered_builtin_types;
3794 /* Return a data type that has machine mode MODE.
3795 If the mode is an integer,
3796 then UNSIGNEDP selects between signed and unsigned types.
3797 If the mode is a fixed-point mode,
3798 then UNSIGNEDP selects between saturating and nonsaturating types. */
3800 tree
3802 {
3803 tree t;
3843 #if HOST_BITS_PER_WIDE_INT >= 64
3846 #endif
3871 {
3872 machine_mode inner_mode;
3873 tree inner_type;
3889 }
3891 {
3896 }
3906 {
3992 }
4000 }
4002 tree
4004 {
4006 }
4008 /* Return a signed type the same as TYPE in other respects. */
4010 tree
4012 {
4014 }
4016 /* Return a type the same as TYPE except unsigned or
4017 signed according to UNSIGNEDP. */
4019 tree
4021 {
4022 tree type1;
4025 /* This block of code emulates the behavior of the old
4026 c_common_unsigned_type. In particular, it returns
4027 long_unsigned_type_node if passed a long, even when a int would
4028 have the same size. This is necessary for warnings to work
4029 correctly in archs where sizeof(int) == sizeof(long) */
4032 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
4052 #if HOST_BITS_PER_WIDE_INT >= 64
4055 #endif
4065 #define C_COMMON_FIXED_TYPES(NAME) \
4066 if (type1 == short_ ## NAME ## _type_node \
4067 || type1 == unsigned_short_ ## NAME ## _type_node) \
4068 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4069 : short_ ## NAME ## _type_node; \
4070 if (type1 == NAME ## _type_node \
4071 || type1 == unsigned_ ## NAME ## _type_node) \
4072 return unsignedp ? unsigned_ ## NAME ## _type_node \
4073 : NAME ## _type_node; \
4074 if (type1 == long_ ## NAME ## _type_node \
4075 || type1 == unsigned_long_ ## NAME ## _type_node) \
4076 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4077 : long_ ## NAME ## _type_node; \
4078 if (type1 == long_long_ ## NAME ## _type_node \
4079 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4080 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4081 : long_long_ ## NAME ## _type_node;
4083 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
4084 if (type1 == NAME ## _type_node \
4085 || type1 == u ## NAME ## _type_node) \
4086 return unsignedp ? u ## NAME ## _type_node \
4087 : NAME ## _type_node;
4089 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
4090 if (type1 == sat_ ## short_ ## NAME ## _type_node \
4091 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
4092 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
4093 : sat_ ## short_ ## NAME ## _type_node; \
4094 if (type1 == sat_ ## NAME ## _type_node \
4095 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
4096 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
4097 : sat_ ## NAME ## _type_node; \
4098 if (type1 == sat_ ## long_ ## NAME ## _type_node \
4099 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
4100 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
4101 : sat_ ## long_ ## NAME ## _type_node; \
4102 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
4103 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
4104 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
4105 : sat_ ## long_long_ ## NAME ## _type_node;
4107 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
4108 if (type1 == sat_ ## NAME ## _type_node \
4109 || type1 == sat_ ## u ## NAME ## _type_node) \
4110 return unsignedp ? sat_ ## u ## NAME ## _type_node \
4111 : sat_ ## NAME ## _type_node;
4137 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
4138 the precision; they have precision set to match their range, but
4139 may use a wider mode to match an ABI. If we change modes, we may
4140 wind up with bad conversions. For INTEGER_TYPEs in C, must check
4141 the precision as well, so as to yield correct results for
4142 bit-field types. C++ does not have these separate bit-field
4143 types, and producing a signed or unsigned variant of an
4144 ENUMERAL_TYPE may cause other problems as well. */
4150 #define TYPE_OK(node) \
4151 (TYPE_MODE (type) == TYPE_MODE (node) \
4152 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4176 #if HOST_BITS_PER_WIDE_INT >= 64
4179 #endif
4188 #undef TYPE_OK
4191 }
4193 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4195 tree
4197 {
4200 /* Extended integer types of the same width as a standard type have
4201 lesser rank, so those of the same width as int promote to int or
4202 unsigned int and are valid for printf formats expecting int or
4203 unsigned int. To avoid such special cases, avoid creating
4204 extended integer types for bit-fields if a standard integer type
4205 is available. */
4223 }
4225 /* The C version of the register_builtin_type langhook. */
4227 void
4229 {
4230 tree decl;
4240 }
4241 \f
4242 /* Print an error message for invalid operands to arith operation
4243 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4244 LOCATION is the location of the message. */
4246 void
4249 {
4253 {
4298 }
4302 }
4303 \f
4304 /* Given an expression as a tree, return its original type. Do this
4305 by stripping any conversion that preserves the sign and precision. */
4306 static tree
4308 {
4311 }
4313 /* Subroutine of build_binary_op, used for comparison operations.
4314 See if the operands have both been converted from subword integer types
4315 and, if so, perhaps change them both back to their original type.
4316 This function is also responsible for converting the two operands
4317 to the proper common type for comparison.
4319 The arguments of this function are all pointers to local variables
4320 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4321 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4323 LOC is the location of the comparison.
4325 If this function returns nonzero, it means that the comparison has
4326 a constant value. What this function returns is an expression for
4327 that value. */
4329 tree
4332 {
4333 tree type;
4341 /* Throw away any conversions to wider types
4342 already present in the operands. */
4347 /* If primopN is first sign-extended from primopN's precision to opN's
4348 precision, then zero-extended from opN's precision to
4349 *restype_ptr precision, shortenings might be invalid. */
4352 && !unsignedp0
4357 && !unsignedp1
4361 /* Handle the case that OP0 does not *contain* a conversion
4362 but it *requires* conversion to FINAL_TYPE. */
4369 /* If one of the operands must be floated, we cannot optimize. */
4373 /* If first arg is constant, swap the args (changing operation
4374 so value is preserved), for canonicalization. Don't do this if
4375 the second arg is 0. */
4380 {
4389 {
4404 }
4406 }
4408 /* If comparing an integer against a constant more bits wide,
4409 maybe we can deduce a value of 1 or 0 independent of the data.
4410 Or else truncate the constant now
4411 rather than extend the variable at run time.
4413 This is only interesting if the constant is the wider arg.
4414 Also, it is not safe if the constant is unsigned and the
4415 variable arg is signed, since in this case the variable
4416 would be sign-extended and then regarded as unsigned.
4417 Our technique fails in this case because the lowest/highest
4418 possible unsigned results don't follow naturally from the
4419 lowest/highest possible values of the variable operand.
4420 For just EQ_EXPR and NE_EXPR there is another technique that
4421 could be used: see if the constant can be faithfully represented
4422 in the other operand's type, by truncating it and reextending it
4423 and see if that preserves the constant's value. */
4429 {
4432 /* 1 if comparison is nominally unsigned. */
4434 tree val;
4446 {
4447 /* Convert primop1 to target type, but do not introduce
4448 additional overflow. We know primop1 is an int_cst. */
4455 }
4457 {
4460 }
4468 /* This used to be a switch, but Genix compiler can't handle that. */
4470 {
4473 }
4475 {
4478 }
4480 {
4485 }
4487 {
4492 }
4494 {
4499 }
4501 {
4506 }
4508 /* If primop0 was sign-extended and unsigned comparison specd,
4509 we did a signed comparison above using the signed type bounds.
4510 But the comparison we output must be unsigned.
4512 Also, for inequalities, VAL is no good; but if the signed
4513 comparison had *any* fixed result, it follows that the
4514 unsigned comparison just tests the sign in reverse
4515 (positive values are LE, negative ones GE).
4516 So we can generate an unsigned comparison
4517 against an extreme value of the signed type. */
4520 {
4523 {
4538 }
4540 }
4543 {
4550 }
4553 {
4554 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4558 }
4560 /* Value is not predetermined, but do the comparison
4561 in the type of the operand that is not constant.
4562 TYPE is already properly set. */
4563 }
4565 /* If either arg is decimal float and the other is float, find the
4566 proper common type to use for comparison. */
4572 /* If either arg is decimal float and the other is float, fail. */
4583 /* If args' natural types are both narrower than nominal type
4584 and both extend in the same manner, compare them
4585 in the type of the wider arg.
4586 Otherwise must actually extend both to the nominal
4587 common type lest different ways of extending
4588 alter the result.
4589 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4594 {
4598 type);
4599 /* Make sure shorter operand is extended the right way
4600 to match the longer operand. */
4601 primop0
4604 primop0);
4605 primop1
4608 primop1);
4609 }
4610 else
4611 {
4612 /* Here we must do the comparison on the nominal type
4613 using the args exactly as we received them. */
4620 {
4622 /* All unsigned values are >= 0, so we warn. However,
4623 if OP0 is a constant that is >= 0, the signedness of
4624 the comparison isn't an issue, so suppress the
4625 warning. */
4630 primop0)))
4631 /* Do not warn for enumeration types. */
4635 {
4652 }
4655 {
4656 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4661 }
4662 }
4663 }
4671 }
4672 \f
4673 /* Return a tree for the sum or difference (RESULTCODE says which)
4674 of pointer PTROP and integer INTOP. */
4676 tree
4679 {
4682 /* The result is a pointer of the same type that is being added. */
4686 {
4693 }
4695 {
4702 }
4703 else
4706 /* We are manipulating pointer values, so we don't need to warn
4707 about relying on undefined signed overflow. We disable the
4708 warning here because we use integer types so fold won't know that
4709 they are really pointers. */
4712 /* If what we are about to multiply by the size of the elements
4713 contains a constant term, apply distributive law
4714 and multiply that constant term separately.
4715 This helps produce common subexpressions. */
4720 /* If the constant comes from pointer subtraction,
4721 skip this optimization--it would cause an error. */
4723 /* If the constant is unsigned, and smaller than the pointer size,
4724 then we must skip this optimization. This is because it could cause
4725 an overflow error if the constant is negative but INTOP is not. */
4729 {
4734 /* Convert both subexpression types to the type of intop,
4735 because weird cases involving pointer arithmetic
4736 can result in a sum or difference with different type args. */
4741 }
4743 /* Convert the integer argument to a type the same size as sizetype
4744 so the multiply won't overflow spuriously. */
4750 /* Replace the integer argument with a suitable product by the object size.
4751 Do this multiplication as signed, then convert to the appropriate type
4752 for the pointer operation and disregard an overflow that occurred only
4753 because of the sign-extension change in the latter conversion. */
4754 {
4761 }
4763 /* Create the sum or difference. */
4772 }
4773 \f
4774 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4775 and if NON_CONST is known not to be permitted in an evaluated part
4776 of a constant expression. */
4778 tree
4780 {
4784 /* This should never be called for C++. */
4788 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4797 }
4799 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4800 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4801 around the SAVE_EXPR if needed so that c_fully_fold does not need
4802 to look inside SAVE_EXPRs. */
4804 tree
4806 {
4815 }
4817 /* Return whether EXPR is a declaration whose address can never be
4818 NULL. */
4820 bool
4822 {
4827 }
4829 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4830 or for an `if' or `while' statement or ?..: exp. It should already
4831 have been validated to be of suitable type; otherwise, a bad
4832 diagnostic may result.
4834 The EXPR is located at LOCATION.
4836 This preparation consists of taking the ordinary
4837 representation of an expression expr and producing a valid tree
4838 boolean expression describing whether expr is nonzero. We could
4839 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4840 but we optimize comparisons, &&, ||, and !.
4842 The resulting type should always be `truthvalue_type_node'. */
4844 tree
4846 {
4848 {
4890 ? truthvalue_true_node
4896 ? truthvalue_true_node
4901 /* Fall through. */
4904 {
4907 {
4908 /* Common Ada/Pascal programmer's mistake. */
4910 OPT_Waddress,
4912 inner);
4914 }
4916 }
4933 /* These don't change whether an object is nonzero or zero. */
4938 /* These don't change whether an object is zero or nonzero, but
4939 we can't ignore them if their second arg has side-effects. */
4941 {
4944 c_common_truthvalue_conversion
4947 }
4948 else
4953 /* Distribute the conversion into the arms of a COND_EXPR. */
4955 {
4958 /* In C++ one of the arms might have void type if it is throw. */
4966 }
4967 else
4968 {
4969 /* Folding will happen later for C. */
4977 }
4979 CASE_CONVERT:
4980 {
4986 {
4992 OPT_Waddress,
4993 "the compiler can assume that the address of "
4995 inner);
4996 }
4998 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4999 since that affects how `default_conversion' will behave. */
5003 /* Don't strip a conversion from C++0x scoped enum, since they
5004 don't implicitly convert to other types. */
5008 /* If this isn't narrowing the argument, we can ignore it. */
5012 }
5018 {
5022 }
5027 }
5030 {
5032 expr = (build_binary_op
5036 c_common_truthvalue_conversion
5039 c_common_truthvalue_conversion
5044 }
5047 {
5052 }
5053 else
5056 ret:
5059 }
5060 \f
5069 /* Apply the TYPE_QUALS to the new DECL. */
5071 void
5073 {
5081 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
5082 constructor can produce constant init, so rely on cp_finish_decl to
5083 clear TREE_READONLY if the variable has non-constant init. */
5086 {
5089 }
5091 {
5093 /* Allow 'restrict' on arrays of pointers.
5094 FIXME currently we just ignore it. */
5100 }
5101 }
5104 {
5107 };
5109 /* Hash function for the problem of multiple type definitions in
5110 different files. This must hash all types that will compare
5111 equal via comptypes to the same value. In practice it hashes
5112 on some of the simple stuff and leaves the details to comptypes. */
5114 hashval_t
5116 {
5119 tree t2;
5121 {
5122 /* For pointers, hash on pointee type plus some swizzling. */
5125 /* Hash on number of elements and total size. */
5144 }
5145 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
5146 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
5148 /* We might have a VLA here. */
5151 else
5154 }
5156 bool
5158 {
5160 }
5164 /* Return the typed-based alias set for T, which may be an expression
5165 or a type. Return -1 if we don't do anything special. */
5167 alias_set_type
5169 {
5170 tree u;
5172 /* For VLAs, use the alias set of the element type rather than the
5173 default of alias set 0 for types compared structurally. */
5175 {
5179 }
5181 /* Permit type-punning when accessing a union, provided the access
5182 is directly through the union. For example, this code does not
5183 permit taking the address of a union member and then storing
5184 through it. Even the type-punning allowed here is a GCC
5185 extension, albeit a common and useful one; the C standard says
5186 that such accesses have implementation-defined behavior. */
5194 /* That's all the expressions we handle specially. */
5198 /* The C standard guarantees that any object may be accessed via an
5199 lvalue that has character type. */
5205 /* The C standard specifically allows aliasing between signed and
5206 unsigned variants of the same type. We treat the signed
5207 variant as canonical. */
5209 {
5212 /* t1 == t can happen for boolean nodes which are always unsigned. */
5215 }
5217 /* Handle the case of multiple type nodes referring to "the same" type,
5218 which occurs with IMA. These share an alias set. FIXME: Currently only
5219 C90 is handled. (In C99 type compatibility is not transitive, which
5220 complicates things mightily. The alias set splay trees can theoretically
5221 represent this, but insertion is tricky when you consider all the
5222 different orders things might arrive in.) */
5227 /* Save time if there's only one input file. */
5231 /* Pointers need special handling if they point to any type that
5232 needs special handling (below). */
5234 {
5235 tree t2;
5236 /* Find bottom type under any nested POINTERs. */
5240 ;
5248 }
5249 /* These are the only cases that need special handling. */
5256 /* Undefined? */
5260 /* Look up t in hash table. Only one of the compatible types within each
5261 alias set is recorded in the table. */
5266 {
5269 }
5270 else
5271 /* Our caller will assign and record (in t) a new alias set; all we need
5272 to do is remember t in the hash table. */
5276 }
5277 \f
5278 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5279 the IS_SIZEOF parameter indicates which operator is being applied.
5280 The COMPLAIN flag controls whether we should diagnose possibly
5281 ill-formed constructs or not. LOC is the location of the SIZEOF or
5282 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5283 a type in any context should be returned, rather than the normal
5284 alignment for that type. */
5286 tree
5290 {
5298 {
5300 {
5307 }
5308 else
5309 {
5311 {
5315 else
5318 }
5320 }
5321 }
5323 {
5331 }
5334 {
5339 }
5342 {
5347 }
5348 else
5349 {
5351 /* Convert in case a char is more than one unit. */
5357 else
5359 }
5361 /* VALUE will have the middle-end integer type sizetype.
5362 However, we should really return a value of type `size_t',
5363 which is just a typedef for an ordinary integer type. */
5367 }
5369 /* Implement the __alignof keyword: Return the minimum required
5370 alignment of EXPR, measured in bytes. For VAR_DECLs,
5371 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5372 from an "aligned" __attribute__ specification). LOC is the
5373 location of the ALIGNOF operator. */
5375 tree
5377 {
5378 tree t;
5385 {
5388 }
5394 {
5401 {
5408 }
5410 }
5411 else
5415 }
5416 \f
5417 /* Handle C and C++ default attributes. */
5419 enum built_in_attribute
5420 {
5421 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5422 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5423 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5424 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5425 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5427 #undef DEF_ATTR_NULL_TREE
5428 #undef DEF_ATTR_INT
5429 #undef DEF_ATTR_STRING
5430 #undef DEF_ATTR_IDENT
5431 #undef DEF_ATTR_TREE_LIST
5432 ATTR_LAST
5433 };
5439 enum c_builtin_type
5440 {
5441 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5442 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5443 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5444 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5445 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5446 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5447 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5448 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5449 ARG6) NAME,
5450 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5451 ARG6, ARG7) NAME,
5452 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5453 ARG6, ARG7, ARG8) NAME,
5454 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5455 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5456 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5457 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5458 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5459 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5460 NAME,
5461 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5462 ARG6, ARG7) NAME,
5463 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5464 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5465 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5467 #undef DEF_PRIMITIVE_TYPE
5468 #undef DEF_FUNCTION_TYPE_0
5469 #undef DEF_FUNCTION_TYPE_1
5470 #undef DEF_FUNCTION_TYPE_2
5471 #undef DEF_FUNCTION_TYPE_3
5472 #undef DEF_FUNCTION_TYPE_4
5473 #undef DEF_FUNCTION_TYPE_5
5474 #undef DEF_FUNCTION_TYPE_6
5475 #undef DEF_FUNCTION_TYPE_7
5476 #undef DEF_FUNCTION_TYPE_8
5477 #undef DEF_FUNCTION_TYPE_VAR_0
5478 #undef DEF_FUNCTION_TYPE_VAR_1
5479 #undef DEF_FUNCTION_TYPE_VAR_2
5480 #undef DEF_FUNCTION_TYPE_VAR_3
5481 #undef DEF_FUNCTION_TYPE_VAR_4
5482 #undef DEF_FUNCTION_TYPE_VAR_5
5483 #undef DEF_FUNCTION_TYPE_VAR_7
5484 #undef DEF_FUNCTION_TYPE_VAR_11
5485 #undef DEF_POINTER_TYPE
5486 BT_LAST
5487 };
5491 /* A temporary array for c_common_nodes_and_builtins. Used in
5492 communication with def_fn_type. */
5495 /* A helper function for c_common_nodes_and_builtins. Build function type
5496 for DEF with return type RET and N arguments. If VAR is true, then the
5497 function should be variadic after those N arguments.
5499 Takes special care not to ICE if any of the types involved are
5500 error_mark_node, which indicates that said type is not in fact available
5501 (see builtin_type_for_size). In which case the function type as a whole
5502 should be error_mark_node. */
5504 static void
5506 {
5507 tree t;
5514 {
5520 }
5527 else
5530 egress:
5533 }
5535 /* Build builtin functions common to both C and C++ language
5536 frontends. */
5538 static void
5540 {
5541 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5542 builtin_types[ENUM] = VALUE;
5543 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5544 def_fn_type (ENUM, RETURN, 0, 0);
5545 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5546 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5547 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5548 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5549 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5550 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5551 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5552 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5553 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5554 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5555 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5556 ARG6) \
5557 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5558 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5559 ARG6, ARG7) \
5560 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5561 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5562 ARG6, ARG7, ARG8) \
5563 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5564 ARG7, ARG8);
5565 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5566 def_fn_type (ENUM, RETURN, 1, 0);
5567 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5568 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5569 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5570 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5571 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5572 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5573 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5574 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5575 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5576 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5577 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5578 ARG6, ARG7) \
5579 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5580 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5581 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5582 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5583 ARG7, ARG8, ARG9, ARG10, ARG11);
5584 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5585 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5589 #undef DEF_PRIMITIVE_TYPE
5590 #undef DEF_FUNCTION_TYPE_0
5591 #undef DEF_FUNCTION_TYPE_1
5592 #undef DEF_FUNCTION_TYPE_2
5593 #undef DEF_FUNCTION_TYPE_3
5594 #undef DEF_FUNCTION_TYPE_4
5595 #undef DEF_FUNCTION_TYPE_5
5596 #undef DEF_FUNCTION_TYPE_6
5597 #undef DEF_FUNCTION_TYPE_7
5598 #undef DEF_FUNCTION_TYPE_8
5599 #undef DEF_FUNCTION_TYPE_VAR_0
5600 #undef DEF_FUNCTION_TYPE_VAR_1
5601 #undef DEF_FUNCTION_TYPE_VAR_2
5602 #undef DEF_FUNCTION_TYPE_VAR_3
5603 #undef DEF_FUNCTION_TYPE_VAR_4
5604 #undef DEF_FUNCTION_TYPE_VAR_5
5605 #undef DEF_FUNCTION_TYPE_VAR_7
5606 #undef DEF_FUNCTION_TYPE_VAR_11
5607 #undef DEF_POINTER_TYPE
5612 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5613 NONANSI_P, ATTRS, IMPLICIT, COND) \
5614 if (NAME && COND) \
5615 def_builtin_1 (ENUM, NAME, CLASS, \
5616 builtin_types[(int) TYPE], \
5617 builtin_types[(int) LIBTYPE], \
5618 BOTH_P, FALLBACK_P, NONANSI_P, \
5619 built_in_attributes[(int) ATTRS], IMPLICIT);
5621 #undef DEF_BUILTIN
5629 }
5631 /* Like get_identifier, but avoid warnings about null arguments when
5632 the argument may be NULL for targets where GCC lacks stdint.h type
5633 information. */
5637 {
5639 }
5641 /* Build tree nodes and builtin functions common to both C and C++ language
5642 frontends. */
5644 void
5646 {
5650 tree array_domain_type;
5651 tree va_list_ref_type_node;
5652 tree va_list_arg_type_node;
5657 /* Define `int' and `char' first so that dbx will output them first. */
5661 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5662 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5663 but not C. Are the conditionals here needed? */
5669 long_unsigned_type_node);
5672 {
5680 }
5685 long_long_integer_type_node);
5687 long_long_unsigned_type_node);
5690 long_long_unsigned_type_node);
5693 short_unsigned_type_node);
5696 short_unsigned_type_node);
5698 /* Define both `signed char' and `unsigned char'. */
5702 /* These are types that c_common_type_for_size and
5703 c_common_type_for_mode use. */
5706 intQI_type_node));
5709 intHI_type_node));
5712 intSI_type_node));
5715 intDI_type_node));
5716 #if HOST_BITS_PER_WIDE_INT >= 64
5717 /* Note that this is different than the __int128 type that's part of
5718 the generic __intN support. */
5721 TYPE_DECL,
5723 intTI_type_node));
5724 #endif
5727 unsigned_intQI_type_node));
5730 unsigned_intHI_type_node));
5733 unsigned_intSI_type_node));
5736 unsigned_intDI_type_node));
5737 #if HOST_BITS_PER_WIDE_INT >= 64
5740 TYPE_DECL,
5742 unsigned_intTI_type_node));
5743 #endif
5745 /* Create the widest literal types. */
5746 widest_integer_literal_type_node
5750 widest_integer_literal_type_node));
5752 widest_unsigned_literal_type_node
5756 widest_unsigned_literal_type_node));
5760 pid_type_node =
5767 /* Only supported decimal floating point extension if the target
5768 actually supports underlying modes. */
5772 {
5776 }
5779 {
5784 long_long_fract_type_node);
5786 unsigned_short_fract_type_node);
5788 unsigned_fract_type_node);
5790 unsigned_long_fract_type_node);
5792 unsigned_long_long_fract_type_node);
5794 sat_short_fract_type_node);
5797 sat_long_fract_type_node);
5799 sat_long_long_fract_type_node);
5801 sat_unsigned_short_fract_type_node);
5803 sat_unsigned_fract_type_node);
5805 sat_unsigned_long_fract_type_node);
5807 sat_unsigned_long_long_fract_type_node);
5812 long_long_accum_type_node);
5814 unsigned_short_accum_type_node);
5816 unsigned_accum_type_node);
5818 unsigned_long_accum_type_node);
5820 unsigned_long_long_accum_type_node);
5822 sat_short_accum_type_node);
5825 sat_long_accum_type_node);
5827 sat_long_long_accum_type_node);
5829 sat_unsigned_short_accum_type_node);
5831 sat_unsigned_accum_type_node);
5833 sat_unsigned_long_accum_type_node);
5835 sat_unsigned_long_long_accum_type_node);
5837 }
5840 TYPE_DECL,
5842 complex_integer_type_node));
5844 TYPE_DECL,
5846 complex_float_type_node));
5848 TYPE_DECL,
5850 complex_double_type_node));
5854 complex_long_double_type_node));
5857 /* For C++, make fileptr_type_node a distinct void * type until
5858 FILE type is defined. */
5863 /* Set the TYPE_NAME for any variants that were built before
5864 record_builtin_type gave names to the built-in types. */
5865 {
5871 }
5875 /* Make a type to be the domain of a few array types
5876 whose domains don't really matter.
5877 200 is small enough that it always fits in size_t
5878 and large enough that it can hold most function names for the
5879 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5882 /* Make a type for arrays of characters.
5883 With luck nothing will ever really depend on the length of this
5884 array type. */
5885 char_array_type_node
5889 const_string_type_node
5893 /* This is special for C++ so functions can be overloaded. */
5899 {
5902 else
5905 }
5907 /* This is for wide string constants. */
5908 wchar_array_type_node
5911 /* Define 'char16_t'. */
5916 {
5921 }
5923 /* This is for UTF-16 string constants. */
5924 char16_array_type_node
5927 /* Define 'char32_t'. */
5932 {
5937 }
5939 /* This is for UTF-32 string constants. */
5940 char32_array_type_node
5943 wint_type_node =
5946 intmax_type_node =
5948 uintmax_type_node =
5952 sig_atomic_type_node =
5955 int8_type_node =
5958 int16_type_node =
5961 int32_type_node =
5964 int64_type_node =
5967 uint8_type_node =
5979 int_least8_type_node =
5982 int_least16_type_node =
5985 int_least32_type_node =
5988 int_least64_type_node =
5991 uint_least8_type_node =
5994 uint_least16_type_node =
5997 uint_least32_type_node =
6000 uint_least64_type_node =
6003 int_fast8_type_node =
6006 int_fast16_type_node =
6009 int_fast32_type_node =
6012 int_fast64_type_node =
6015 uint_fast8_type_node =
6018 uint_fast16_type_node =
6021 uint_fast32_type_node =
6024 uint_fast64_type_node =
6027 intptr_type_node =
6030 uintptr_type_node =
6033 default_function_type
6035 ptrdiff_type_node
6042 va_list_type_node));
6044 {
6047 tree ptype;
6050 {
6054 ptype));
6056 }
6057 }
6060 {
6063 }
6064 else
6065 {
6068 }
6075 /* Create the built-in __null node. It is important that this is
6076 not shared. */
6080 /* Since builtin_types isn't gc'ed, don't export these nodes. */
6082 }
6084 /* The number of named compound-literals generated thus far. */
6087 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
6089 void
6091 {
6094 compound_literal_number);
6095 compound_literal_number++;
6097 }
6099 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
6100 TYPE and operand OP. */
6102 static tree
6104 {
6108 }
6110 /* Return a VA_ARG_EXPR corresponding to a source-level expression
6111 va_arg (EXPR, TYPE) at source location LOC. */
6113 tree
6115 {
6118 ? NULL_TREE
6123 {
6124 /* Let's handle things neutrallly, if expr:
6125 - has undeclared type, or
6126 - is not an va_list type. */
6128 }
6131 {
6132 /* Case 1: Not an array type. */
6134 /* Take the address, to get '&ap'. */
6138 /* Verify that &ap is still recognized as having va_list type. */
6139 tree canon_expr_type
6144 }
6146 /* Case 2: Array type.
6148 Background:
6150 For contrast, let's start with the simple case (case 1). If
6151 canon_va_type is not an array type, but say a char *, then when
6152 passing-by-value a va_list, the type of the va_list param decl is
6153 the same as for another va_list decl (all ap's are char *):
6155 f2_1 (char * ap)
6156 D.1815 = VA_ARG (&ap, 0B, 1);
6157 return D.1815;
6159 f2 (int i)
6160 char * ap.0;
6161 char * ap;
6162 __builtin_va_start (&ap, 0);
6163 ap.0 = ap;
6164 res = f2_1 (ap.0);
6165 __builtin_va_end (&ap);
6166 D.1812 = res;
6167 return D.1812;
6169 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
6170 va_list the type of the va_list param decl (case 2b, struct * ap) is not
6171 the same as for another va_list decl (case 2a, struct ap[1]).
6173 f2_1 (struct * ap)
6174 D.1844 = VA_ARG (ap, 0B, 0);
6175 return D.1844;
6177 f2 (int i)
6178 struct ap[1];
6179 __builtin_va_start (&ap, 0);
6180 res = f2_1 (&ap);
6181 __builtin_va_end (&ap);
6182 D.1841 = res;
6183 return D.1841;
6185 Case 2b is different because:
6186 - on the callee side, the parm decl has declared type va_list, but
6187 grokdeclarator changes the type of the parm decl to a pointer to the
6188 array elem type.
6189 - on the caller side, the pass-by-value uses &ap.
6191 We unify these two cases (case 2a: va_list is array type,
6192 case 2b: va_list is pointer to array elem type), by adding '&' for the
6193 array type case, such that we have a pointer to array elem in both
6194 cases. */
6197 {
6198 /* Case 2a: va_list is array type. */
6200 /* Take the address, to get '&ap'. Make sure it's a pointer to array
6201 elem type. */
6204 expr);
6206 /* Verify that &ap is still recognized as having va_list type. */
6207 tree canon_expr_type
6210 }
6211 else
6212 {
6213 /* Case 2b: va_list is pointer to array elem type. */
6217 /* Don't take the address. We've already got '&ap'. */
6218 ;
6219 }
6222 }
6225 /* Linked list of disabled built-in functions. */
6228 {
6236 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6237 begins with "__builtin_", give an error. */
6239 void
6241 {
6244 else
6245 {
6250 }
6251 }
6254 /* Return true if the built-in function NAME has been disabled, false
6255 otherwise. */
6257 static bool
6259 {
6262 {
6265 }
6267 }
6270 /* Worker for DEF_BUILTIN.
6271 Possibly define a builtin function with one or two names.
6272 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6273 nonansi_p and flag_no_nonansi_builtin. */
6275 static void
6282 {
6283 tree decl;
6296 fnattrs);
6305 }
6306 \f
6307 /* Nonzero if the type T promotes to int. This is (nearly) the
6308 integral promotions defined in ISO C99 6.3.1.1/2. */
6310 bool
6312 {
6314 {
6324 /* ??? Technically all enumerations not larger than an int
6325 promote to an int. But this is used along code paths
6326 that only want to notice a size change. */
6334 }
6335 }
6337 /* Return 1 if PARMS specifies a fixed number of parameters
6338 and none of their types is affected by default promotions. */
6340 int
6342 {
6343 const_tree t;
6345 {
6362 }
6364 }
6366 /* Recursively remove any '*' or '&' operator from TYPE. */
6367 tree
6369 {
6373 }
6375 /* Recursively remove pointer or array type from TYPE. */
6376 tree
6378 {
6382 }
6384 /* Used to compare case labels. K1 and K2 are actually tree nodes
6385 representing case labels, or NULL_TREE for a `default' label.
6386 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6387 K2, and 0 if K1 and K2 are equal. */
6389 int
6391 {
6392 /* Consider a NULL key (such as arises with a `default' label) to be
6393 smaller than anything else. */
6400 }
6402 /* Process a case label, located at LOC, for the range LOW_VALUE
6403 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6404 then this case label is actually a `default' label. If only
6405 HIGH_VALUE is NULL_TREE, then case label was declared using the
6406 usual C/C++ syntax, rather than the GNU case range extension.
6407 CASES is a tree containing all the case ranges processed so far;
6408 COND is the condition for the switch-statement itself.
6409 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6410 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6411 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6413 tree
6416 {
6417 tree type;
6418 tree label;
6419 tree case_label;
6420 splay_tree_node node;
6422 /* Create the LABEL_DECL itself. */
6425 /* If there was an error processing the switch condition, bail now
6426 before we get more confused. */
6434 {
6437 }
6439 /* Case ranges are a GNU extension. */
6446 {
6451 }
6453 {
6458 }
6461 {
6462 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6463 really a case range, even though it was written that way.
6464 Remove the HIGH_VALUE to simplify later processing. */
6469 }
6471 /* See if the case is in range of the type of the original testing
6472 expression. If both low_value and high_value are out of range,
6473 don't insert the case label and return NULL_TREE. */
6477 outside_range_p))
6480 /* Look up the LOW_VALUE in the table of case labels we already
6481 have. */
6483 /* If there was not an exact match, check for overlapping ranges.
6484 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6485 that's a `default' label and the only overlap is an exact match. */
6487 {
6488 splay_tree_node low_bound;
6489 splay_tree_node high_bound;
6491 /* Even though there wasn't an exact match, there might be an
6492 overlap between this case range and another case range.
6493 Since we've (inductively) not allowed any overlapping case
6494 ranges, we simply need to find the greatest low case label
6495 that is smaller that LOW_VALUE, and the smallest low case
6496 label that is greater than LOW_VALUE. If there is an overlap
6497 it will occur in one of these two ranges. */
6503 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6504 the LOW_VALUE, so there is no need to check unless the
6505 LOW_BOUND is in fact itself a case range. */
6511 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6512 range is bigger than the low end of the current range, so we
6513 are only interested if the current range is a real range, and
6514 not an ordinary case label. */
6516 && high_value
6518 high_value)
6521 }
6522 /* If there was an overlap, issue an error. */
6524 {
6528 {
6532 }
6534 {
6537 }
6538 else
6539 {
6543 }
6545 }
6547 /* Add a CASE_LABEL to the statement-tree. */
6549 /* Register this case label in the splay tree. */
6556 error_out:
6557 /* Add a label so that the back-end doesn't think that the beginning of
6558 the switch is unreachable. Note that we do not add a case label, as
6559 that just leads to duplicates and thence to failure later on. */
6561 {
6564 }
6566 }
6568 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6569 Used to verify that case values match up with enumerator values. */
6571 static void
6573 {
6580 else
6587 buf);
6588 else
6593 }
6595 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6596 Used to verify that case values match up with enumerator values. */
6598 static int
6600 {
6604 /* Skip default case. */
6608 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6609 when we did our enum->case scan. Reset our scratch bit after. */
6612 else
6615 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6616 not set, that means that CASE_HIGH did not appear when we did our
6617 enum->case scan. Reset our scratch bit after. */
6619 {
6622 else
6624 }
6627 }
6629 /* Handle -Wswitch*. Called from the front end after parsing the
6630 switch construct. */
6631 /* ??? Should probably be somewhere generic, since other languages
6632 besides C and C++ would want this. At the moment, however, C/C++
6633 are the only tree-ssa languages that support enumerations at all,
6634 so the point is moot. */
6636 void
6640 {
6641 splay_tree_node default_node;
6642 splay_tree_node node;
6643 tree chain;
6654 /* There are certain cases where -Wswitch-bool warnings aren't
6655 desirable, such as
6656 switch (boolean)
6657 {
6658 case true: ...
6659 case false: ...
6660 }
6661 so be careful here. */
6663 {
6664 splay_tree_node min_node;
6665 /* If there's a default node, it's also the value with the minimal
6666 key. So look at the penultimate key (if any). */
6669 else
6674 /* This might be a case range, so look at the value with the
6675 maximal key and then check CASE_HIGH. */
6680 /* If there's a case value > 1 or < 0, that is outside bool
6681 range, warn. */
6685 /* And handle the
6686 switch (boolean)
6687 {
6688 case true: ...
6689 case false: ...
6690 default: ...
6691 }
6692 case, where we want to warn. */
6693 || (default_node
6698 }
6700 /* From here on, we only care about enumerated types. */
6704 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6708 /* Check the cases. Warn about case values which are not members of
6709 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6710 there is no default case, check that exactly all enumeration
6711 literals are covered by the cases. */
6713 /* Clearing COND if it is not an integer constant simplifies
6714 the tests inside the loop below. */
6718 /* The time complexity here is O(N*lg(N)) worst case, but for the
6719 common case of monotonically increasing enumerators, it is
6720 O(N), since the nature of the splay tree will keep the next
6721 element adjacent to the root at all times. */
6724 {
6730 {
6731 /* Mark the CASE_LOW part of the case entry as seen. */
6735 }
6737 /* Even though there wasn't an exact match, there might be a
6738 case range which includes the enumerator's value. */
6741 {
6745 {
6746 /* If we match the upper bound exactly, mark the CASE_HIGH
6747 part of the case entry as seen. */
6751 }
6752 }
6754 /* We've now determined that this enumerated literal isn't
6755 handled by the case labels of the switch statement. */
6757 /* If the switch expression is a constant, we only really care
6758 about whether that constant is handled by the switch. */
6762 /* If there is a default_node, the only relevant option is
6763 Wswitch-enum. Otherwise, if both are enabled then we prefer
6764 to warn using -Wswitch because -Wswitch is enabled by -Wall
6765 while -Wswitch-enum is explicit. */
6768 ? OPT_Wswitch_enum
6772 }
6774 /* Warn if there are case expressions that don't correspond to
6775 enumerators. This can occur since C and C++ don't enforce
6776 type-checking of assignments to enumeration variables.
6778 The time complexity here is now always O(N) worst case, since
6779 we should have marked both the lower bound and upper bound of
6780 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6781 above. This scan also resets those fields. */
6784 }
6786 /* Finish an expression taking the address of LABEL (an
6787 IDENTIFIER_NODE). Returns an expression for the address.
6789 LOC is the location for the expression returned. */
6791 tree
6793 {
6794 tree result;
6804 else
6805 {
6808 /* The current function is not necessarily uninlinable.
6809 Computed gotos are incompatible with inlining, but the value
6810 here could be used only in a diagnostic, for example. */
6812 }
6815 }
6816 \f
6818 /* Given a boolean expression ARG, return a tree representing an increment
6819 or decrement (as indicated by CODE) of ARG. The front end must check for
6820 invalid cases (e.g., decrement in C++). */
6821 tree
6823 {
6824 tree val;
6829 {
6852 }
6855 }
6856 \f
6857 /* Built-in macros for stddef.h and stdint.h, that require macros
6858 defined in this file. */
6859 void
6861 {
6924 }
6926 static void
6928 {
6929 /* Fill in the built_in_attributes array. */
6930 #define DEF_ATTR_NULL_TREE(ENUM) \
6931 built_in_attributes[(int) ENUM] = NULL_TREE;
6932 #define DEF_ATTR_INT(ENUM, VALUE) \
6933 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6934 #define DEF_ATTR_STRING(ENUM, VALUE) \
6935 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6936 #define DEF_ATTR_IDENT(ENUM, STRING) \
6937 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6938 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6939 built_in_attributes[(int) ENUM] \
6940 = tree_cons (built_in_attributes[(int) PURPOSE], \
6941 built_in_attributes[(int) VALUE], \
6942 built_in_attributes[(int) CHAIN]);
6944 #undef DEF_ATTR_NULL_TREE
6945 #undef DEF_ATTR_INT
6946 #undef DEF_ATTR_IDENT
6947 #undef DEF_ATTR_TREE_LIST
6948 }
6950 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6951 identifier as an argument, so the front end shouldn't look it up. */
6953 bool
6955 {
6958 /* Unknown attribute that we'll end up ignoring, return true so we
6959 don't complain about an identifier argument. */
6965 else
6967 }
6969 /* Attribute handlers common to C front ends. */
6971 /* Handle a "packed" attribute; arguments as in
6972 struct attribute_spec.handler. */
6974 static tree
6977 {
6979 {
6983 }
6985 {
6987 /* Still pack bitfields. */
6992 else
6994 }
6995 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6996 used for DECL_REGISTER. It wouldn't mean anything anyway.
6997 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6998 that changes what the typedef is typing. */
6999 else
7000 {
7003 }
7006 }
7008 /* Handle a "nocommon" attribute; arguments as in
7009 struct attribute_spec.handler. */
7011 static tree
7015 {
7018 else
7019 {
7022 }
7025 }
7027 /* Handle a "common" attribute; arguments as in
7028 struct attribute_spec.handler. */
7030 static tree
7033 {
7036 else
7037 {
7040 }
7043 }
7045 /* Handle a "noreturn" attribute; arguments as in
7046 struct attribute_spec.handler. */
7048 static tree
7051 {
7054 /* See FIXME comment in c_common_attribute_table. */
7061 = (build_qualified_type
7062 (build_pointer_type
7066 else
7067 {
7070 }
7073 }
7075 /* Handle a "hot" and attribute; arguments as in
7076 struct attribute_spec.handler. */
7078 static tree
7081 {
7084 {
7086 {
7090 }
7091 /* Most of the rest of the hot processing is done later with
7092 lookup_attribute. */
7093 }
7094 else
7095 {
7098 }
7101 }
7103 /* Handle a "cold" and attribute; arguments as in
7104 struct attribute_spec.handler. */
7106 static tree
7109 {
7112 {
7114 {
7118 }
7119 /* Most of the rest of the cold processing is done later with
7120 lookup_attribute. */
7121 }
7122 else
7123 {
7126 }
7129 }
7131 /* Handle a "no_sanitize_address" attribute; arguments as in
7132 struct attribute_spec.handler. */
7134 static tree
7137 {
7139 {
7142 }
7145 }
7147 /* Handle a "no_address_safety_analysis" attribute; arguments as in
7148 struct attribute_spec.handler. */
7150 static tree
7153 {
7162 }
7164 /* Handle a "no_sanitize_undefined" attribute; arguments as in
7165 struct attribute_spec.handler. */
7167 static tree
7170 {
7172 {
7175 }
7178 }
7180 /* Handle a "stack_protect" attribute; arguments as in
7181 struct attribute_spec.handler. */
7182 static tree
7185 {
7187 {
7190 }
7191 else
7197 }
7199 /* Handle a "noinline" attribute; arguments as in
7200 struct attribute_spec.handler. */
7202 static tree
7206 {
7208 {
7210 {
7214 }
7215 else
7217 }
7218 else
7219 {
7222 }
7225 }
7227 /* Handle a "noclone" attribute; arguments as in
7228 struct attribute_spec.handler. */
7230 static tree
7234 {
7236 {
7239 }
7242 }
7244 /* Handle a "no_icf" attribute; arguments as in
7245 struct attribute_spec.handler. */
7247 static tree
7251 {
7253 {
7256 }
7259 }
7261 /* Handle a "hsa" attribute; arguments as in
7262 struct attribute_spec.handler. */
7264 static tree
7268 {
7270 {
7274 }
7285 }
7287 /* Handle a "always_inline" attribute; arguments as in
7288 struct attribute_spec.handler. */
7290 static tree
7295 {
7297 {
7299 {
7303 }
7304 else
7305 /* Set the attribute and mark it for disregarding inline
7306 limits. */
7308 }
7309 else
7310 {
7313 }
7316 }
7318 /* Handle a "gnu_inline" attribute; arguments as in
7319 struct attribute_spec.handler. */
7321 static tree
7326 {
7328 {
7329 /* Do nothing else, just set the attribute. We'll get at
7330 it later with lookup_attribute. */
7331 }
7332 else
7333 {
7336 }
7339 }
7341 /* Handle a "leaf" attribute; arguments as in
7342 struct attribute_spec.handler. */
7344 static tree
7348 {
7350 {
7353 }
7355 {
7358 }
7361 }
7363 /* Handle an "artificial" attribute; arguments as in
7364 struct attribute_spec.handler. */
7366 static tree
7371 {
7373 {
7374 /* Do nothing else, just set the attribute. We'll get at
7375 it later with lookup_attribute. */
7376 }
7377 else
7378 {
7381 }
7384 }
7386 /* Handle a "flatten" attribute; arguments as in
7387 struct attribute_spec.handler. */
7389 static tree
7391 tree args ATTRIBUTE_UNUSED,
7393 {
7395 /* Do nothing else, just set the attribute. We'll get at
7396 it later with lookup_attribute. */
7397 ;
7398 else
7399 {
7402 }
7405 }
7407 /* Handle a "warning" or "error" attribute; arguments as in
7408 struct attribute_spec.handler. */
7410 static tree
7413 {
7416 /* Do nothing else, just set the attribute. We'll get at
7417 it later with lookup_attribute. */
7418 ;
7419 else
7420 {
7423 }
7426 }
7428 /* Handle a "used" attribute; arguments as in
7429 struct attribute_spec.handler. */
7431 static tree
7434 {
7440 {
7445 }
7446 else
7447 {
7450 }
7453 }
7455 /* Handle a "unused" attribute; arguments as in
7456 struct attribute_spec.handler. */
7458 static tree
7461 {
7463 {
7470 {
7474 }
7475 else
7476 {
7479 }
7480 }
7481 else
7482 {
7486 }
7489 }
7491 /* Handle a "externally_visible" attribute; arguments as in
7492 struct attribute_spec.handler. */
7494 static tree
7499 {
7503 {
7506 {
7510 }
7511 }
7512 else
7513 {
7516 }
7519 }
7521 /* Handle the "no_reorder" attribute. Arguments as in
7522 struct attribute_spec.handler. */
7524 static tree
7526 tree name,
7527 tree,
7530 {
7535 {
7538 name);
7540 }
7543 }
7545 /* Handle a "const" attribute; arguments as in
7546 struct attribute_spec.handler. */
7548 static tree
7551 {
7554 /* See FIXME comment on noreturn in c_common_attribute_table. */
7560 = (build_qualified_type
7561 (build_pointer_type
7565 else
7566 {
7569 }
7572 }
7574 /* Handle a "transparent_union" attribute; arguments as in
7575 struct attribute_spec.handler. */
7577 static tree
7581 {
7582 tree type;
7593 {
7594 /* Make sure that the first field will work for a transparent union.
7595 If the type isn't complete yet, leave the check to the code in
7596 finish_struct. */
7598 {
7604 }
7607 {
7608 /* If the type isn't complete yet, setting the flag
7609 on a variant wouldn't ever be checked. */
7613 /* build_duplicate_type doesn't work for C++. */
7617 /* A type variant isn't good enough, since we don't a cast
7618 to such a type removed as a no-op. */
7620 }
7624 }
7626 ignored:
7629 }
7631 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7632 get the requested priority for a constructor or destructor,
7633 possibly issuing diagnostics for invalid or reserved
7634 priorities. */
7636 static priority_type
7638 {
7639 HOST_WIDE_INT pri;
7640 tree arg;
7646 {
7649 else
7652 }
7669 {
7672 "destructor priorities from 0 to %d are reserved "
7674 MAX_RESERVED_INIT_PRIORITY);
7675 else
7677 "constructor priorities from 0 to %d are reserved "
7679 MAX_RESERVED_INIT_PRIORITY);
7680 }
7683 invalid:
7686 MAX_INIT_PRIORITY);
7687 else
7689 MAX_INIT_PRIORITY);
7691 }
7693 /* Handle a "constructor" attribute; arguments as in
7694 struct attribute_spec.handler. */
7696 static tree
7700 {
7707 {
7708 priority_type priority;
7713 }
7714 else
7715 {
7718 }
7721 }
7723 /* Handle a "destructor" attribute; arguments as in
7724 struct attribute_spec.handler. */
7726 static tree
7730 {
7737 {
7738 priority_type priority;
7743 }
7744 else
7745 {
7748 }
7751 }
7753 /* Nonzero if the mode is a valid vector mode for this architecture.
7754 This returns nonzero even if there is no hardware support for the
7755 vector mode, but we can emulate with narrower modes. */
7757 static int
7759 {
7761 machine_mode innermode;
7763 /* Doh! What's going on? */
7772 /* Hardware support. Woo hoo! */
7778 /* We should probably return 1 if requesting V4DI and we have no DI,
7779 but we have V2DI, but this is probably very unlikely. */
7781 /* If we have support for the inner mode, we can safely emulate it.
7782 We may not have V2DI, but me can emulate with a pair of DIs. */
7784 }
7787 /* Handle a "mode" attribute; arguments as in
7788 struct attribute_spec.handler. */
7790 static tree
7793 {
7801 else
7802 {
7807 tree typefm;
7812 {
7818 }
7820 /* Change this type to have a type with the specified mode.
7821 First check for the special modes. */
7834 else
7837 {
7840 }
7843 {
7846 }
7850 {
7882 }
7884 {
7887 }
7890 {
7895 {
7898 }
7902 else
7905 }
7906 else
7907 {
7908 /* For fixed-point modes, we need to test if the signness of type
7909 and the machine mode are consistent. */
7912 {
7915 }
7916 /* For fixed-point modes, we need to pass saturating info. */
7920 }
7923 {
7926 }
7928 {
7929 /* For enumeral types, copy the precision from the integer
7930 type returned above. If not an INTEGER_TYPE, we can't use
7931 this mode for this type. */
7933 {
7936 }
7939 {
7942 }
7943 else
7944 {
7945 /* We cannot build a type variant, as there's code that assumes
7946 that TYPE_MAIN_VARIANT has the same mode. This includes the
7947 debug generators. Instead, create a subrange type. This
7948 results in all of the enumeral values being emitted only once
7949 in the original, and the subtype gets them by reference. */
7952 else
7955 }
7956 }
7960 {
7963 }
7966 }
7969 }
7971 /* Handle a "section" attribute; arguments as in
7972 struct attribute_spec.handler. */
7974 static tree
7977 {
7981 {
7985 }
7990 {
7993 }
7996 {
7999 }
8004 {
8008 }
8010 /* The decl may have already been given a section attribute
8011 from a previous declaration. Ensure they match. */
8015 {
8018 }
8023 {
8026 }
8031 fail:
8034 }
8036 /* Check whether ALIGN is a valid user-specified alignment. If so,
8037 return its base-2 log; if not, output an error and return -1. If
8038 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
8039 no error. */
8040 int
8042 {
8049 {
8052 }
8057 {
8060 }
8062 {
8065 }
8067 }
8069 /*
8070 If in c++-11, check if the c++-11 alignment constraint with respect
8071 to fundamental alignment (in [dcl.align]) are satisfied. If not in
8072 c++-11 mode, does nothing.
8074 [dcl.align]2/ says:
8076 [* if the constant expression evaluates to a fundamental alignment,
8077 the alignment requirement of the declared entity shall be the
8078 specified fundamental alignment.
8080 * if the constant expression evaluates to an extended alignment
8081 and the implementation supports that alignment in the context
8082 of the declaration, the alignment of the declared entity shall
8083 be that alignment
8085 * if the constant expression evaluates to an extended alignment
8086 and the implementation does not support that alignment in the
8087 context of the declaration, the program is ill-formed]. */
8089 static bool
8093 {
8106 {
8108 {
8109 /* For file scope variables and static members, the target
8110 supports alignments that are at most
8111 MAX_OFILE_ALIGNMENT. */
8114 }
8115 else
8116 {
8117 #ifdef BIGGEST_FIELD_ALIGNMENT
8118 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
8119 #else
8120 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
8121 #endif
8122 /* For non-static members, the target supports either
8123 alignments that at most either BIGGEST_FIELD_ALIGNMENT
8124 if it is defined or BIGGEST_ALIGNMENT. */
8129 #undef MAX_TARGET_FIELD_ALIGNMENT
8130 /* For stack variables, the target supports at most
8131 MAX_STACK_ALIGNMENT. */
8135 }
8136 }
8138 {
8139 /* Let's be liberal for types. */
8142 }
8150 }
8152 /* Handle a "aligned" attribute; arguments as in
8153 struct attribute_spec.handler. */
8155 static tree
8158 {
8162 tree align_expr;
8166 {
8171 }
8172 else
8176 {
8180 }
8188 {
8191 /* If we have a TYPE_DECL, then copy the type, so that we
8192 don't accidentally modify a builtin type. See pushdecl. */
8195 {
8202 }
8203 else
8208 }
8211 {
8214 }
8217 /* C++-11 [dcl.align/4]:
8219 When multiple alignment-specifiers are specified for an
8220 entity, the alignment requirement shall be set to the
8221 strictest specified alignment.
8223 This formally comes from the c++11 specification but we are
8224 doing it for the GNU attribute syntax as well. */
8228 {
8233 else
8237 }
8238 else
8239 {
8242 }
8245 }
8247 /* Handle a "weak" attribute; arguments as in
8248 struct attribute_spec.handler. */
8250 static tree
8255 {
8258 {
8261 }
8263 {
8267 }
8269 {
8274 }
8275 else
8279 }
8281 /* Handle a "noplt" attribute; arguments as in
8282 struct attribute_spec.handler. */
8284 static tree
8289 {
8291 {
8296 }
8298 }
8300 /* Handle an "alias" or "ifunc" attribute; arguments as in
8301 struct attribute_spec.handler, except that IS_ALIAS tells us
8302 whether this is an alias as opposed to ifunc attribute. */
8304 static tree
8307 {
8312 {
8315 }
8319 /* A static variable declaration is always a tentative definition,
8320 but the alias is a non-tentative definition which overrides. */
8323 {
8327 }
8331 {
8335 }
8337 /* Note that the very first time we process a nested declaration,
8338 decl_function_context will not be set. Indeed, *would* never
8339 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8340 we do below. After such frobbery, pushdecl would set the context.
8341 In any case, this is never what we want. */
8343 {
8344 tree id;
8348 {
8352 }
8354 /* This counts as a use of the object pointed to. */
8359 else
8363 /* ifuncs are also aliases, so set that attribute too. */
8366 }
8367 else
8368 {
8371 }
8374 {
8377 {
8380 else
8382 }
8383 }
8387 }
8389 /* Handle an "alias" or "ifunc" attribute; arguments as in
8390 struct attribute_spec.handler. */
8392 static tree
8395 {
8397 }
8399 /* Handle an "alias" or "ifunc" attribute; arguments as in
8400 struct attribute_spec.handler. */
8402 static tree
8405 {
8407 }
8409 /* Handle a "weakref" attribute; arguments as in struct
8410 attribute_spec.handler. */
8412 static tree
8415 {
8418 /* We must ignore the attribute when it is associated with
8419 local-scoped decls, since attribute alias is ignored and many
8420 such symbols do not even have a DECL_WEAK field. */
8422 || current_function_decl
8424 {
8428 }
8431 {
8435 }
8437 /* The idea here is that `weakref("name")' mutates into `weakref,
8438 alias("name")', and weakref without arguments, in turn,
8439 implicitly adds weak. */
8442 {
8449 }
8450 else
8451 {
8456 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8457 and that isn't supported; and because it wants to add it to
8458 the list of weak decls, which isn't helpful. */
8460 }
8463 {
8467 }
8470 }
8472 /* Handle an "visibility" attribute; arguments as in
8473 struct attribute_spec.handler. */
8475 static tree
8479 {
8485 {
8489 {
8491 name);
8493 }
8495 {
8499 }
8500 }
8502 {
8505 }
8508 {
8511 }
8513 /* If this is a type, set the visibility on the type decl. */
8515 {
8520 {
8522 name);
8524 }
8525 }
8535 else
8536 {
8537 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8539 }
8543 {
8557 }
8562 /* Go ahead and attach the attribute to the node as well. This is needed
8563 so we can determine whether we have VISIBILITY_DEFAULT because the
8564 visibility was not specified, or because it was explicitly overridden
8565 from the containing scope. */
8568 }
8570 /* Determine the ELF symbol visibility for DECL, which is either a
8571 variable or a function. It is an error to use this function if a
8572 definition of DECL is not available in this translation unit.
8573 Returns true if the final visibility has been determined by this
8574 function; false if the caller is free to make additional
8575 modifications. */
8577 bool
8579 {
8582 /* If the user explicitly specified the visibility with an
8583 attribute, honor that. DECL_VISIBILITY will have been set during
8584 the processing of the attribute. We check for an explicit
8585 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8586 to distinguish the use of an attribute from the use of a "#pragma
8587 GCC visibility push(...)"; in the latter case we still want other
8588 considerations to be able to overrule the #pragma. */
8590 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8595 /* Set default visibility to whatever the user supplied with
8596 visibility_specified depending on #pragma GCC visibility. */
8598 {
8601 {
8604 /* If visibility changed and DECL already has DECL_RTL, ensure
8605 symbol flags are updated. */
8610 }
8611 }
8613 }
8615 /* Handle an "tls_model" attribute; arguments as in
8616 struct attribute_spec.handler. */
8618 static tree
8621 {
8622 tree id;
8629 {
8632 }
8637 {
8640 }
8650 else
8651 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8655 }
8657 /* Handle a "no_instrument_function" attribute; arguments as in
8658 struct attribute_spec.handler. */
8660 static tree
8665 {
8669 {
8673 }
8674 else
8678 }
8680 /* Handle a "malloc" attribute; arguments as in
8681 struct attribute_spec.handler. */
8683 static tree
8686 {
8690 else
8691 {
8694 }
8697 }
8699 /* Handle a "alloc_size" attribute; arguments as in
8700 struct attribute_spec.handler. */
8702 static tree
8705 {
8708 {
8715 || !arg_count
8717 {
8722 }
8723 }
8725 }
8727 /* Handle a "alloc_align" attribute; arguments as in
8728 struct attribute_spec.handler. */
8730 static tree
8733 {
8740 || !arg_count
8742 {
8747 }
8749 }
8751 /* Handle a "assume_aligned" attribute; arguments as in
8752 struct attribute_spec.handler. */
8754 static tree
8757 {
8759 {
8766 {
8771 }
8772 }
8774 }
8776 /* Handle a "fn spec" attribute; arguments as in
8777 struct attribute_spec.handler. */
8779 static tree
8783 {
8788 }
8790 /* Handle a "bnd_variable_size" attribute; arguments as in
8791 struct attribute_spec.handler. */
8793 static tree
8796 {
8798 {
8801 }
8804 }
8806 /* Handle a "bnd_legacy" attribute; arguments as in
8807 struct attribute_spec.handler. */
8809 static tree
8812 {
8814 {
8817 }
8820 }
8822 /* Handle a "bnd_instrument" attribute; arguments as in
8823 struct attribute_spec.handler. */
8825 static tree
8828 {
8830 {
8833 }
8836 }
8838 /* Handle a "warn_unused" attribute; arguments as in
8839 struct attribute_spec.handler. */
8841 static tree
8843 tree args ATTRIBUTE_UNUSED,
8845 {
8847 /* Do nothing else, just set the attribute. We'll get at
8848 it later with lookup_attribute. */
8849 ;
8850 else
8851 {
8854 }
8857 }
8859 /* Handle an "omp declare simd" attribute; arguments as in
8860 struct attribute_spec.handler. */
8862 static tree
8864 {
8866 }
8868 /* Handle an "omp declare target" attribute; arguments as in
8869 struct attribute_spec.handler. */
8871 static tree
8873 {
8875 }
8877 /* Handle a "returns_twice" attribute; arguments as in
8878 struct attribute_spec.handler. */
8880 static tree
8883 {
8886 else
8887 {
8890 }
8893 }
8895 /* Handle a "no_limit_stack" attribute; arguments as in
8896 struct attribute_spec.handler. */
8898 static tree
8903 {
8907 {
8911 }
8913 {
8917 }
8918 else
8922 }
8924 /* Handle a "pure" attribute; arguments as in
8925 struct attribute_spec.handler. */
8927 static tree
8930 {
8933 /* ??? TODO: Support types. */
8934 else
8935 {
8938 }
8941 }
8943 /* Digest an attribute list destined for a transactional memory statement.
8944 ALLOWED is the set of attributes that are allowed for this statement;
8945 return the attribute we parsed. Multiple attributes are never allowed. */
8947 int
8949 {
8954 {
8962 {
8965 }
8968 {
8971 }
8974 else
8976 }
8979 }
8981 /* Transform a TM attribute name into a maskable integer and back.
8982 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8983 to how the lack of an attribute is treated. */
8985 int
8987 {
9001 }
9003 tree
9005 {
9008 {
9026 }
9028 }
9030 /* Return the first TM attribute seen in LIST. */
9032 tree
9034 {
9036 {
9040 }
9042 }
9044 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
9045 Here we accept only function types, and verify that none of the other
9046 function TM attributes are also applied. */
9047 /* ??? We need to accept class types for C++, but not C. This greatly
9048 complicates this function, since we can no longer rely on the extra
9049 processing given by function_type_required. */
9051 static tree
9054 {
9055 /* Only one path adds the attribute; others don't. */
9059 {
9062 /* Only tm_callable and tm_safe apply to classes. */
9065 /* FALLTHRU */
9069 {
9072 ;
9075 else
9077 }
9081 {
9084 {
9089 }
9090 }
9091 /* FALLTHRU */
9094 /* If a function is next, pass it on to be tried next. */
9098 ignored:
9101 }
9104 }
9106 /* Handle the TM_WRAP attribute; arguments as in
9107 struct attribute_spec.handler. */
9109 static tree
9112 {
9115 /* We don't need the attribute even on success, since we
9116 record the entry in an external table. */
9121 else
9122 {
9125 ;
9129 else
9130 {
9134 {
9138 else
9140 }
9141 else
9143 }
9144 }
9147 }
9149 /* Ignore the given attribute. Used when this attribute may be usefully
9150 overridden by the target, but is not used generically. */
9152 static tree
9156 {
9159 }
9161 /* Handle a "no vops" attribute; arguments as in
9162 struct attribute_spec.handler. */
9164 static tree
9168 {
9172 }
9174 /* Handle a "deprecated" attribute; arguments as in
9175 struct attribute_spec.handler. */
9177 static tree
9181 {
9189 {
9192 }
9195 {
9206 else
9208 }
9210 {
9215 }
9216 else
9220 {
9223 {
9229 }
9232 else
9234 }
9237 }
9239 /* Handle a "vector_size" attribute; arguments as in
9240 struct attribute_spec.handler. */
9242 static tree
9246 {
9248 machine_mode orig_mode;
9259 {
9262 }
9264 /* Get the vector size (in bytes). */
9267 /* We need to provide for vector pointers, vector arrays, and
9268 functions returning vectors. For example:
9270 __attribute__((vector_size(16))) short *foo;
9272 In this case, the mode is SI, but the type being modified is
9273 HI, so we need to look further. */
9282 /* Get the mode of the type being modified. */
9293 {
9296 }
9299 {
9302 }
9305 {
9308 }
9310 /* Calculate how many units fit in the vector. */
9313 {
9316 }
9320 /* Build back pointers if needed. */
9324 }
9326 /* Handle the "nonnull" attribute. */
9327 static tree
9331 {
9335 /* If no arguments are specified, all pointer arguments should be
9336 non-null. Verify a full prototype is given so that the arguments
9337 will have the correct types when we actually check them later. */
9339 {
9341 {
9344 }
9346 }
9348 /* Argument list specified. Verify that each argument number references
9349 a pointer argument. */
9351 {
9360 {
9365 }
9368 {
9369 function_args_iterator iter;
9370 tree argument;
9374 {
9378 }
9382 {
9387 }
9390 {
9395 }
9396 }
9397 }
9400 }
9402 /* Check the argument list of a function call for null in argument slots
9403 that are marked as requiring a non-null pointer argument. The NARGS
9404 arguments are passed in the array ARGARRAY.
9405 */
9407 static void
9409 {
9410 tree a;
9418 /* See if any of the nonnull attributes has no arguments. If so,
9419 then every pointer argument is checked (in which case the check
9420 for pointer type is done in check_nonnull_arg). */
9422 do
9430 else
9431 {
9432 /* Walk the argument list. If we encounter an argument number we
9433 should check for non-null, do it. */
9435 {
9437 {
9441 }
9446 }
9447 }
9448 }
9450 /* Check that the Nth argument of a function call (counting backwards
9451 from the end) is a (pointer)0. The NARGS arguments are passed in the
9452 array ARGARRAY. */
9454 static void
9456 {
9460 {
9463 tree sentinel;
9464 function_args_iterator iter;
9465 tree t;
9467 /* Skip over the named arguments. */
9469 {
9472 len++;
9473 }
9476 {
9479 }
9481 /* The sentinel must be one of the varargs, i.e.
9482 in position >= the number of fixed arguments. */
9484 {
9488 }
9490 /* Validate the sentinel. */
9494 /* Although __null (in C++) is only an integer we allow it
9495 nevertheless, as we are guaranteed that it's exactly
9496 as wide as a pointer, and we don't want to force
9497 users to cast the NULL they have written there.
9498 We warn with -Wstrict-null-sentinel, though. */
9501 }
9502 }
9504 /* Helper for check_function_nonnull; given a list of operands which
9505 must be non-null in ARGS, determine if operand PARAM_NUM should be
9506 checked. */
9508 static bool
9510 {
9514 {
9521 }
9523 }
9525 /* Check that the function argument PARAM (which is operand number
9526 PARAM_NUM) is non-null. This is called by check_function_nonnull
9527 via check_function_arguments_recurse. */
9529 static void
9532 {
9533 /* Just skip checking the argument if it's not a pointer. This can
9534 happen if the "nonnull" attribute was given without an operand
9535 list (which means to check every pointer argument). */
9543 }
9545 /* Helper for nonnull attribute handling; fetch the operand number
9546 from the attribute argument list. */
9548 static bool
9550 {
9551 /* Verify the arg number is a small constant. */
9553 {
9556 }
9557 else
9559 }
9561 /* Handle a "nothrow" attribute; arguments as in
9562 struct attribute_spec.handler. */
9564 static tree
9567 {
9570 /* ??? TODO: Support types. */
9571 else
9572 {
9575 }
9578 }
9580 /* Handle a "cleanup" attribute; arguments as in
9581 struct attribute_spec.handler. */
9583 static tree
9586 {
9590 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9591 for global destructors in C++. This requires infrastructure that
9592 we don't have generically at the moment. It's also not a feature
9593 we'd be missing too much, since we do have attribute constructor. */
9595 {
9599 }
9601 /* Verify that the argument is a function in scope. */
9602 /* ??? We could support pointers to functions here as well, if
9603 that was considered desirable. */
9606 {
9610 }
9613 {
9617 }
9619 /* That the function has proper type is checked with the
9620 eventual call to build_function_call. */
9623 }
9625 /* Handle a "warn_unused_result" attribute. No special handling. */
9627 static tree
9631 {
9632 /* Ignore the attribute for functions not returning any value. */
9634 {
9637 }
9640 }
9642 /* Handle a "sentinel" attribute. */
9644 static tree
9647 {
9649 {
9653 }
9654 else
9655 {
9657 {
9661 }
9662 }
9665 {
9673 {
9677 }
9678 else
9679 {
9681 {
9685 }
9686 }
9687 }
9690 }
9692 /* Handle a "type_generic" attribute. */
9694 static tree
9698 {
9699 /* Ensure we have a function type. */
9702 /* Ensure we have a variadic function. */
9706 }
9708 /* Handle a "target" attribute. */
9710 static tree
9713 {
9714 /* Ensure we have a function type. */
9716 {
9719 }
9721 flags))
9725 }
9727 /* Arguments being collected for optimization. */
9732 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9733 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9734 false for #pragma GCC optimize. */
9736 bool
9738 {
9746 tree ap;
9748 /* Build up argv vector. Just in case the string is stored away, use garbage
9749 collected strings. */
9754 {
9758 {
9762 }
9765 {
9766 /* Split string into multiple substrings. */
9774 {
9781 {
9785 }
9786 else
9787 {
9790 }
9794 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9795 options. */
9797 {
9802 else
9806 }
9809 {
9812 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9813 itself is -Os, and any other switch begins with a -f. */
9819 }
9824 }
9826 }
9827 }
9837 /* Now parse the options. */
9847 /* Don't allow changing -fstrict-aliasing. */
9852 }
9854 /* For handling "optimize" attribute. arguments as in
9855 struct attribute_spec.handler. */
9857 static tree
9860 {
9861 /* Ensure we have a function type. */
9863 {
9866 }
9867 else
9868 {
9872 /* Save current options. */
9875 /* If we previously had some optimization options, use them as the
9876 default. */
9881 /* Parse options, and update the vector. */
9886 /* Restore current options. */
9888 }
9891 }
9893 /* Handle a "no_split_stack" attribute. */
9895 static tree
9900 {
9904 {
9908 }
9910 {
9914 }
9917 }
9919 /* Handle a "returns_nonnull" attribute; arguments as in
9920 struct attribute_spec.handler. */
9922 static tree
9925 {
9926 // Even without a prototype we still have a return type we can check.
9928 {
9931 }
9933 }
9935 /* Handle a "designated_init" attribute; arguments as in
9936 struct attribute_spec.handler. */
9938 static tree
9941 {
9943 {
9946 }
9948 }
9950 \f
9951 /* Check for valid arguments being passed to a function with FNTYPE.
9952 There are NARGS arguments in the array ARGARRAY. */
9953 void
9955 {
9956 /* Check for null being passed in a pointer argument that must be
9957 non-null. We also need to do this if format checking is enabled. */
9962 /* Check for errors in format strings. */
9969 }
9971 /* Generic argument checking recursion routine. PARAM is the argument to
9972 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9973 once the argument is resolved. CTX is context for the callback. */
9974 void
9979 {
9983 {
9984 /* Strip coercion. */
9988 }
9991 {
9993 tree attrs;
9996 /* See if this is a call to a known internationalization function
9997 that modifies a format arg. Such a function may have multiple
9998 format_arg attributes (for example, ngettext). */
10001 attrs;
10004 {
10005 tree inner_arg;
10006 tree format_num_expr;
10009 call_expr_arg_iterator iter;
10011 /* Extract the argument number, which was previously checked
10012 to be valid. */
10021 {
10026 }
10027 }
10029 /* If we found a format_arg attribute and did a recursive check,
10030 we are done with checking this argument. Otherwise, we continue
10031 and this will be considered a non-literal. */
10034 }
10037 {
10038 /* Check both halves of the conditional expression. */
10044 }
10047 }
10049 /* Checks for a builtin function FNDECL that the number of arguments
10050 NARGS against the required number REQUIRED and issues an error if
10051 there is a mismatch. Returns true if the number of arguments is
10052 correct, otherwise false. */
10054 static bool
10056 {
10058 {
10062 }
10064 {
10068 }
10070 }
10072 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
10073 Returns false if there was an error, otherwise true. */
10075 bool
10077 {
10083 {
10093 {
10095 {
10099 }
10101 }
10111 {
10118 {
10122 }
10124 }
10129 {
10134 {
10138 }
10141 {
10143 fndecl);
10145 }
10147 }
10152 {
10154 {
10157 }
10159 }
10166 {
10170 {
10174 }
10177 {
10181 }
10183 }
10188 }
10189 }
10191 /* Function to help qsort sort FIELD_DECLs by name order. */
10193 int
10195 {
10200 /* A nontype is "greater" than a type. */
10209 }
10212 gt_pointer_operator new_value;
10216 /* This routine compares two fields like field_decl_cmp but using the
10217 pointer operator in resort_data. */
10219 static int
10221 {
10226 /* A nontype is "greater" than a type. */
10232 {
10239 }
10241 }
10243 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10245 void
10248 gt_pointer_operator new_value,
10250 {
10255 resort_field_decl_cmp);
10256 }
10258 /* Subroutine of c_parse_error.
10259 Return the result of concatenating LHS and RHS. RHS is really
10260 a string literal, its first character is indicated by RHS_START and
10261 RHS_SIZE is its length (including the terminating NUL character).
10263 The caller is responsible for deleting the returned pointer. */
10267 {
10273 }
10275 /* Issue the error given by GMSGID, indicating that it occurred before
10276 TOKEN, which had the associated VALUE. */
10278 void
10281 {
10282 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10293 {
10298 {
10314 }
10318 else
10324 }
10347 {
10352 }
10360 {
10365 }
10366 else
10370 {
10373 }
10374 #undef catenate_messages
10375 }
10377 /* Return the gcc option code associated with the reason for a cpp
10378 message, or 0 if none. */
10380 static int
10382 {
10386 {
10389 }
10391 }
10393 /* Callback from cpp_error for PFILE to print diagnostics from the
10394 preprocessor. The diagnostic is of type LEVEL, with REASON set
10395 to the reason code if LEVEL is represents a warning, at location
10396 LOCATION unless this is after lexing and the compiler's location
10397 should be used instead, with column number possibly overridden by
10398 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10399 the arguments. Returns true if a diagnostic was emitted, false
10400 otherwise. */
10402 bool
10406 {
10407 diagnostic_info diagnostic;
10408 diagnostic_t dlevel;
10413 {
10418 /* Fall through. */
10443 }
10456 }
10458 /* Convert a character from the host to the target execution character
10459 set. cpplib handles this, mostly. */
10461 HOST_WIDE_INT
10463 {
10464 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10465 zero-extended under -fno-signed-char. cpplib insists that characters
10466 and character constants are always unsigned. Hence we must convert
10467 back and forth. */
10475 else
10477 }
10479 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10480 references with an INDIRECT_REF of a constant at the bottom; much like the
10481 traditional rendering of offsetof as a macro. Return the folded result. */
10483 tree
10485 {
10489 {
10505 {
10508 }
10518 {
10522 }
10535 /* Check if the offset goes beyond the upper bound of the array. */
10537 {
10543 {
10547 {
10548 tree v;
10555 {
10563 }
10564 /* Don't warn if the array might be considered a poor
10565 man's flexible array member with a very permissive
10566 definition thereof. */
10570 "index %E denotes an offset "
10573 }
10574 }
10575 }
10582 /* Handle static members of volatile structs. */
10589 }
10592 }
10594 /* Likewise, but convert it to the return type of offsetof. */
10596 tree
10598 {
10600 }
10602 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10603 expression, because B will always be true. */
10605 void
10607 {
10610 "the omitted middle operand in ?: will always be %<true%>, "
10612 }
10614 /* Give an error for storing into ARG, which is 'const'. USE indicates
10615 how ARG was being used. */
10617 void
10619 {
10622 /* Using this macro rather than (for example) arrays of messages
10623 ensures that all the format strings are checked at compile
10624 time. */
10625 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10626 : (use == lv_increment ? (I) \
10627 : (use == lv_decrement ? (D) : (AS))))
10629 {
10640 else
10646 }
10652 arg);
10658 arg);
10660 {
10670 arg);
10671 }
10677 arg);
10678 else
10683 arg);
10684 }
10686 /* Print an error message for an invalid lvalue. USE says
10687 how the lvalue is being used and so selects the error message. LOC
10688 is the location for the error. */
10690 void
10692 {
10694 {
10712 }
10713 }
10715 /* Print an error message for an invalid indirection of type TYPE.
10716 ERRSTRING is the name of the operator for the indirection. */
10718 void
10720 {
10722 {
10730 type);
10735 type);
10740 type);
10745 type);
10750 type);
10754 }
10755 }
10756 \f
10757 /* *PTYPE is an incomplete array. Complete it with a domain based on
10758 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10759 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10760 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10762 int
10764 {
10772 {
10774 {
10775 int eltsize
10778 }
10780 {
10784 {
10788 }
10789 else
10790 {
10791 tree curindex;
10802 {
10806 else
10807 {
10809 {
10810 /* Since we treat size types now as ordinary
10811 unsigned types, we need an explicit overflow
10812 check. */
10816 }
10818 size_one_node);
10819 }
10822 }
10824 {
10828 }
10829 }
10830 }
10831 else
10832 {
10833 /* Make an error message unless that happened already. */
10836 }
10837 }
10838 else
10839 {
10843 }
10850 else
10853 /* Using build_distinct_type_copy and modifying things afterward instead
10854 of using build_array_type to create a new type preserves all of the
10855 TYPE_LANG_FLAG_? bits that the front end may have set. */
10863 /* Make sure we have the canonical MAIN_TYPE. */
10866 hashcode);
10869 /* Fix the canonical type. */
10879 else
10884 else
10890 {
10892 /* If we proceed with the array type as it is, we'll eventually
10893 crash in tree_to_[su]hwi(). */
10895 }
10899 }
10901 /* Like c_mark_addressable but don't check register qualifier. */
10902 void
10904 {
10910 }
10913 \f
10914 /* Used to help initialize the builtin-types.def table. When a type of
10915 the correct size doesn't exist, use error_mark_node instead of NULL.
10916 The later results in segfaults even when a decl using the type doesn't
10917 get invoked. */
10919 tree
10921 {
10924 }
10926 /* A helper function for resolve_overloaded_builtin in resolving the
10927 overloaded __sync_ builtins. Returns a positive power of 2 if the
10928 first operand of PARAMS is a pointer to a supported data type.
10929 Returns 0 if an error is encountered. */
10931 static int
10933 {
10934 tree type;
10938 {
10941 }
10945 {
10946 /* Force array-to-pointer decay for C++. */
10950 }
10962 incompatible:
10965 }
10967 /* A helper function for resolve_overloaded_builtin. Adds casts to
10968 PARAMS to make arguments match up with those of FUNCTION. Drops
10969 the variadic arguments at the end. Returns false if some error
10970 was encountered; true on success. */
10972 static bool
10975 {
10976 function_args_iterator iter;
10977 tree ptype;
10981 /* We've declared the implementation functions to use "volatile void *"
10982 as the pointer parameter, so we shouldn't get any complaints from the
10983 call to check_function_arguments what ever type the user used. */
10988 /* For the rest of the values, we need to cast these to FTYPE, so that we
10989 don't get warnings for passing pointer types, etc. */
10992 {
10996 /* XXX void_type_node belies the abstraction. */
11002 {
11005 }
11007 /* Only convert parameters if arg_type is unsigned integer type with
11008 new format sync routines, i.e. don't attempt to convert pointer
11009 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
11010 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
11011 kinds). */
11013 {
11014 /* Ideally for the first conversion we'd use convert_for_assignment
11015 so that we get warnings for anything that doesn't match the pointer
11016 type. This isn't portable across the C and C++ front ends atm. */
11021 }
11024 }
11026 /* __atomic routines are not variadic. */
11028 {
11031 }
11033 /* The definition of these primitives is variadic, with the remaining
11034 being "an optional list of variables protected by the memory barrier".
11035 No clue what that's supposed to mean, precisely, but we consider all
11036 call-clobbered variables to be protected so we're safe. */
11040 }
11042 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11043 RESULT to make it match the type of the first pointer argument in
11044 PARAMS. */
11046 static tree
11048 {
11053 /* New format doesn't require casting unless the types are the same size. */
11056 else
11058 }
11060 /* This function verifies the PARAMS to generic atomic FUNCTION.
11061 It returns the size if all the parameters are the same size, otherwise
11062 0 is returned if the parameters are invalid. */
11064 static int
11067 {
11072 tree type_0;
11074 /* Determine the parameter makeup. */
11076 {
11092 }
11095 {
11098 }
11100 /* Get type of first parameter, and determine its size. */
11103 {
11104 /* Force array-to-pointer decay for C++. */
11108 }
11110 {
11112 function);
11114 }
11116 /* Types must be compile time constant sizes. */
11118 {
11121 function);
11123 }
11127 /* Zero size objects are not allowed. */
11129 {
11132 function);
11134 }
11136 /* Check each other parameter is a pointer and the same size. */
11138 {
11141 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11145 {
11147 function);
11149 }
11153 {
11155 function);
11157 }
11158 }
11160 /* Check memory model parameters for validity. */
11162 {
11165 {
11168 {
11171 function);
11172 }
11173 }
11174 else
11176 {
11178 function);
11180 }
11181 }
11184 }
11187 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11188 at the beginning of the parameter list PARAMS representing the size of the
11189 objects. This is to match the library ABI requirement. LOC is the location
11190 of the function call.
11191 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11192 returned to allow the external call to be constructed. */
11194 static tree
11197 {
11198 tree size_node;
11200 /* Insert a SIZE_T parameter as the first param. If there isn't
11201 enough space, allocate a new vector and recursively re-build with that. */
11203 {
11206 tree f;
11216 }
11218 /* Add the size parameter and leave as a function call for processing. */
11222 }
11225 /* Return whether atomic operations for naturally aligned N-byte
11226 arguments are supported, whether inline or through libatomic. */
11227 static bool
11229 {
11231 {
11243 }
11244 }
11246 /* This will process an __atomic_exchange function call, determine whether it
11247 needs to be mapped to the _N variation, or turned into a library call.
11248 LOC is the location of the builtin call.
11249 FUNCTION is the DECL that has been invoked;
11250 PARAMS is the argument list for the call. The return value is non-null
11251 TRUE is returned if it is translated into the proper format for a call to the
11252 external library, and NEW_RETURN is set the tree for that function.
11253 FALSE is returned if processing for the _N variation is required, and
11254 NEW_RETURN is set to the return value the result is copied into. */
11255 static bool
11258 {
11263 /* Size of 0 is an error condition. */
11265 {
11268 }
11270 /* If not a lock-free size, change to the library generic format. */
11272 {
11275 }
11277 /* Otherwise there is a lockfree match, transform the call from:
11278 void fn(T* mem, T* desired, T* return, model)
11279 into
11280 *return = (T) (fn (In* mem, (In) *desired, model)) */
11287 /* Create pointer to appropriate size. */
11291 /* Convert object pointer to required type. */
11294 /* Convert new value to required type, and dereference it. */
11299 /* Move memory model to the 3rd position, and end param list. */
11303 /* Convert return pointer and dereference it for later assignment. */
11307 }
11310 /* This will process an __atomic_compare_exchange function call, determine
11311 whether it needs to be mapped to the _N variation, or turned into a lib call.
11312 LOC is the location of the builtin call.
11313 FUNCTION is the DECL that has been invoked;
11314 PARAMS is the argument list for the call. The return value is non-null
11315 TRUE is returned if it is translated into the proper format for a call to the
11316 external library, and NEW_RETURN is set the tree for that function.
11317 FALSE is returned if processing for the _N variation is required. */
11319 static bool
11323 {
11328 /* Size of 0 is an error condition. */
11330 {
11333 }
11335 /* If not a lock-free size, change to the library generic format. */
11337 {
11338 /* The library generic format does not have the weak parameter, so
11339 remove it from the param list. Since a parameter has been removed,
11340 we can be sure that there is room for the SIZE_T parameter, meaning
11341 there will not be a recursive rebuilding of the parameter list, so
11342 there is no danger this will be done twice. */
11344 {
11348 }
11351 }
11353 /* Otherwise, there is a match, so the call needs to be transformed from:
11354 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11355 into
11356 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11362 /* Create pointer to appropriate size. */
11366 /* Convert object pointer to required type. */
11370 /* Convert expected pointer to required type. */
11374 /* Convert desired value to required type, and dereference it. */
11379 /* The rest of the parameters are fine. NULL means no special return value
11380 processing.*/
11383 }
11386 /* This will process an __atomic_load function call, determine whether it
11387 needs to be mapped to the _N variation, or turned into a library call.
11388 LOC is the location of the builtin call.
11389 FUNCTION is the DECL that has been invoked;
11390 PARAMS is the argument list for the call. The return value is non-null
11391 TRUE is returned if it is translated into the proper format for a call to the
11392 external library, and NEW_RETURN is set the tree for that function.
11393 FALSE is returned if processing for the _N variation is required, and
11394 NEW_RETURN is set to the return value the result is copied into. */
11396 static bool
11399 {
11404 /* Size of 0 is an error condition. */
11406 {
11409 }
11411 /* If not a lock-free size, change to the library generic format. */
11413 {
11416 }
11418 /* Otherwise, there is a match, so the call needs to be transformed from:
11419 void fn(T* mem, T* return, model)
11420 into
11421 *return = (T) (fn ((In *) mem, model)) */
11427 /* Create pointer to appropriate size. */
11431 /* Convert object pointer to required type. */
11435 /* Move memory model to the 2nd position, and end param list. */
11439 /* Convert return pointer and dereference it for later assignment. */
11443 }
11446 /* This will process an __atomic_store function call, determine whether it
11447 needs to be mapped to the _N variation, or turned into a library call.
11448 LOC is the location of the builtin call.
11449 FUNCTION is the DECL that has been invoked;
11450 PARAMS is the argument list for the call. The return value is non-null
11451 TRUE is returned if it is translated into the proper format for a call to the
11452 external library, and NEW_RETURN is set the tree for that function.
11453 FALSE is returned if processing for the _N variation is required, and
11454 NEW_RETURN is set to the return value the result is copied into. */
11456 static bool
11459 {
11464 /* Size of 0 is an error condition. */
11466 {
11469 }
11471 /* If not a lock-free size, change to the library generic format. */
11473 {
11476 }
11478 /* Otherwise, there is a match, so the call needs to be transformed from:
11479 void fn(T* mem, T* value, model)
11480 into
11481 fn ((In *) mem, (In) *value, model) */
11486 /* Create pointer to appropriate size. */
11490 /* Convert object pointer to required type. */
11494 /* Convert new value to required type, and dereference it. */
11499 /* The memory model is in the right spot already. Return is void. */
11503 }
11506 /* Some builtin functions are placeholders for other expressions. This
11507 function should be called immediately after parsing the call expression
11508 before surrounding code has committed to the type of the expression.
11510 LOC is the location of the builtin call.
11512 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11513 PARAMS is the argument list for the call. The return value is non-null
11514 when expansion is complete, and null if normal processing should
11515 continue. */
11517 tree
11520 {
11526 {
11532 else
11536 }
11538 /* Handle BUILT_IN_NORMAL here. */
11540 {
11545 {
11546 /* Handle these 4 together so that they can fall through to the next
11547 case if the call is transformed to an _N variant. */
11549 {
11551 {
11555 /* Change to the _N variant. */
11558 }
11561 {
11563 params,
11566 /* Change to the _N variant. */
11569 }
11571 {
11575 /* Change to the _N variant. */
11578 }
11580 {
11584 /* Change to the _N variant. */
11587 }
11590 }
11591 /* Fallthrough to the normal processing. */
11592 }
11609 {
11611 /* Fallthru for parameter processing. */
11612 }
11629 {
11640 orig_format))
11645 NULL);
11653 /* If new_return is set, assign function to that expr and cast the
11654 result to void since the generic interface returned void. */
11656 {
11657 /* Cast function result from I{1,2,4,8,16} to the required type. */
11660 result);
11664 }
11666 }
11670 }
11671 }
11673 /* vector_types_compatible_elements_p is used in type checks of vectors
11674 values used as operands of binary operators. Where it returns true, and
11675 the other checks of the caller succeed (being vector types in he first
11676 place, and matching number of elements), we can just treat the types
11677 as essentially the same.
11678 Contrast with vector_targets_convertible_p, which is used for vector
11679 pointer types, and vector_types_convertible_p, which will allow
11680 language-specific matches under the control of flag_lax_vector_conversions,
11681 and might still require a conversion. */
11682 /* True if vector types T1 and T2 can be inputs to the same binary
11683 operator without conversion.
11684 We don't check the overall vector size here because some of our callers
11685 want to give different error messages when the vectors are compatible
11686 except for the element count. */
11688 bool
11690 {
11703 /* Equality works here because c_common_signed_type uses
11704 TYPE_MAIN_VARIANT. */
11712 }
11714 /* Check for missing format attributes on function pointers. LTYPE is
11715 the new type or left-hand side type. RTYPE is the old type or
11716 right-hand side type. Returns TRUE if LTYPE is missing the desired
11717 attribute. */
11719 bool
11721 {
11723 tree ra;
11729 {
11730 tree la;
11735 }
11736 else
11738 }
11740 /* Subscripting with type char is likely to lose on a machine where
11741 chars are signed. So warn on any machine, but optionally. Don't
11742 warn for unsigned char since that type is safe. Don't warn for
11743 signed char because anyone who uses that must have done so
11744 deliberately. Furthermore, we reduce the false positive load by
11745 warning only for non-constant value of type char. */
11747 void
11749 {
11754 }
11756 /* Implement -Wparentheses for the unexpected C precedence rules, to
11757 cover cases like x + y << z which readers are likely to
11758 misinterpret. We have seen an expression in which CODE is a binary
11759 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11760 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11761 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11762 expression was not formed using a binary or unary operator, or it
11763 was enclosed in parentheses. */
11765 void
11769 {
11773 /* This macro tests that the expression ARG with original tree code
11774 CODE appears to be a boolean expression. or the result of folding a
11775 boolean expression. */
11776 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11777 (truth_value_p (TREE_CODE (ARG)) \
11778 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11780 || ((CODE) != INTEGER_CST \
11781 && (integer_onep (ARG) || integer_zerop (ARG))))
11784 {
11833 /* Check cases like x|y==z */
11840 /* Check cases like !x | y */
11844 "suggest parentheses around operand of "
11857 /* Check cases like x^y==z */
11879 /* Check cases like x&y==z */
11886 /* Check cases like !x & y */
11890 "suggest parentheses around operand of "
11913 {
11918 "comparisons like %<X<=Y<=Z%> do not "
11924 "comparisons like %<X<=Y<=Z%> do not "
11926 }
11928 }
11929 #undef NOT_A_BOOLEAN_EXPR_P
11930 }
11932 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11934 void
11936 {
11938 {
11941 else
11943 }
11944 }
11946 /* Warn for division by zero according to the value of DIVISOR. LOC
11947 is the location of the division operator. */
11949 void
11951 {
11952 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11953 about division by zero. Do not issue a warning if DIVISOR has a
11954 floating-point type, since we consider 0.0/0.0 a valid way of
11955 generating a NaN. */
11959 }
11961 /* Subroutine of build_binary_op. Give warnings for comparisons
11962 between signed and unsigned quantities that may fail. Do the
11963 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11964 so that casts will be considered, but default promotions won't
11965 be.
11967 LOCATION is the location of the comparison operator.
11969 The arguments of this function map directly to local variables
11970 of build_binary_op. */
11972 void
11977 {
11982 /* In C++, check for comparison of different enum types. */
11988 {
11992 }
11994 /* Do not warn if the comparison is being done in a signed type,
11995 since the signed type will only be chosen if it can represent
11996 all the values of the unsigned type. */
11999 /* Do not warn if both operands are unsigned. */
12002 else
12003 {
12009 else
12017 /* Do not warn if the signed quantity is an unsuffixed integer
12018 literal (or some static constant expression involving such
12019 literals or a conditional expression involving such literals)
12020 and it is non-negative. */
12023 /* Do not warn if the comparison is an equality operation, the
12024 unsigned quantity is an integral constant, and it would fit
12025 in the result if the result were signed. */
12030 /* In C, do not warn if the unsigned quantity is an enumeration
12031 constant and its maximum value would fit in the result if the
12032 result were signed. */
12038 else
12040 OPT_Wsign_compare,
12042 }
12044 /* Warn if two unsigned values are being compared in a size larger
12045 than their original size, and one (and only one) is the result of
12046 a `~' operator. This comparison will always fail.
12048 Also warn if one operand is a constant, and the constant does not
12049 have all bits set that are set in the ~ operand when it is
12050 extended. */
12057 {
12064 {
12065 tree primop;
12071 {
12075 }
12076 else
12077 {
12081 }
12086 {
12089 {
12093 else
12096 }
12097 }
12098 }
12106 }
12107 }
12109 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12110 type via c_common_type. If -Wdouble-promotion is in use, and the
12111 conditions for warning have been met, issue a warning. GMSGID is
12112 the warning message. It must have two %T specifiers for the type
12113 that was converted (generally "float") and the type to which it was
12114 converted (generally "double), respectively. LOC is the location
12115 to which the awrning should refer. */
12117 void
12120 {
12121 tree source_type;
12125 /* If the conversion will not occur at run-time, there is no need to
12126 warn about it. */
12138 else
12141 }
12143 /* Possibly warn about unused parameters. */
12145 void
12147 {
12148 tree decl;
12157 }
12160 /* Setup a TYPE_DECL node as a typedef representation.
12162 X is a TYPE_DECL for a typedef statement. Create a brand new
12163 ..._TYPE node (which will be just a variant of the existing
12164 ..._TYPE node with identical properties) and then install X
12165 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12167 The whole point here is to end up with a situation where each
12168 and every ..._TYPE node the compiler creates will be uniquely
12169 associated with AT MOST one node representing a typedef name.
12170 This way, even though the compiler substitutes corresponding
12171 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12172 early on, later parts of the compiler can always do the reverse
12173 translation and get back the corresponding typedef name. For
12174 example, given:
12176 typedef struct S MY_TYPE;
12177 MY_TYPE object;
12179 Later parts of the compiler might only know that `object' was of
12180 type `struct S' if it were not for code just below. With this
12181 code however, later parts of the compiler see something like:
12183 struct S' == struct S
12184 typedef struct S' MY_TYPE;
12185 struct S' object;
12187 And they can then deduce (from the node for type struct S') that
12188 the original object declaration was:
12190 MY_TYPE object;
12192 Being able to do this is important for proper support of protoize,
12193 and also for generating precise symbolic debugging information
12194 which takes full account of the programmer's (typedef) vocabulary.
12196 Obviously, we don't want to generate a duplicate ..._TYPE node if
12197 the TYPE_DECL node that we are now processing really represents a
12198 standard built-in type. */
12200 void
12202 {
12206 {
12209 }
12212 {
12220 }
12221 }
12223 /* Record the types used by the current global variable declaration
12224 being parsed, so that we can decide later to emit their debug info.
12225 Those types are in types_used_by_cur_var_decl, and we are going to
12226 store them in the types_used_by_vars_hash hash table.
12227 DECL is the declaration of the global variable that has been parsed. */
12229 void
12231 {
12235 {
12238 }
12239 }
12241 /* If DECL is a typedef that is declared in the current function,
12242 record it for the purpose of -Wunused-local-typedefs. */
12244 void
12246 {
12251 /* if this is not a locally defined typedef then we are not
12252 interested. */
12259 }
12261 /* If T is a TYPE_DECL declared locally, mark it as used. */
12263 void
12265 {
12270 }
12272 /* Warn if there are some unused locally defined typedefs in the
12273 current function. */
12275 void
12277 {
12279 tree decl;
12280 /* The number of times we have emitted -Wunused-local-typedefs
12281 warnings. If this is different from errorcount, that means some
12282 unrelated errors have been issued. In which case, we'll avoid
12283 emitting "unused-local-typedefs" warnings. */
12295 {
12299 OPT_Wunused_local_typedefs,
12302 }
12305 }
12307 /* Warn about boolean expression compared with an integer value different
12308 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12309 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12310 are the operands of the comparison. The caller must ensure that
12311 either operand is a boolean expression. */
12313 void
12315 tree op1)
12316 {
12326 {
12334 else
12337 }
12339 {
12340 /* If the non-constant operand isn't of a boolean type, we
12341 don't want to warn here. */
12343 /* Handle booleans promoted to integers. */
12351 /* Do some magic to get the right diagnostics. */
12360 }
12361 }
12363 /* The C and C++ parsers both use vectors to hold function arguments.
12364 For efficiency, we keep a cache of unused vectors. This is the
12365 cache. */
12370 /* Return a new vector from the cache. If the cache is empty,
12371 allocate a new vector. These vectors are GC'ed, so it is OK if the
12372 pointer is not released.. */
12376 {
12379 else
12380 {
12381 /* Passing 0 to vec::alloc returns NULL, and our callers require
12382 that we always return a non-NULL value. The vector code uses
12383 4 when growing a NULL vector, so we do too. */
12387 }
12388 }
12390 /* Release a vector of trees back to the cache. */
12392 void
12394 {
12396 {
12399 }
12400 }
12402 /* Get a new tree vector holding a single tree. */
12406 {
12410 }
12412 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12416 {
12421 }
12423 /* Get a new tree vector which is a copy of an existing one. */
12427 {
12430 tree t;
12437 }
12439 /* Return true if KEYWORD starts a type specifier. */
12441 bool
12443 {
12445 {
12479 }
12480 }
12482 /* Return true if KEYWORD names a type qualifier. */
12484 bool
12486 {
12488 {
12496 }
12497 }
12499 /* Return true if KEYWORD names a storage class specifier.
12501 RID_TYPEDEF is not included in this list despite `typedef' being
12502 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12503 such for syntactic convenience only. */
12505 bool
12507 {
12509 {
12519 }
12520 }
12522 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12524 static bool
12526 {
12528 {
12536 }
12537 }
12539 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12540 declaration-specifier (C99 6.7). */
12542 bool
12544 {
12551 {
12558 }
12559 }
12561 /* Initialize language-specific-bits of tree_contains_struct. */
12563 void
12565 {
12569 }
12571 /* Build a user-defined numeric literal out of an integer constant type VALUE
12572 with identifier SUFFIX. */
12574 tree
12577 {
12584 }
12586 /* For vector[index], convert the vector to a
12587 pointer of the underlying type. Return true if the resulting
12588 ARRAY_REF should not be an lvalue. */
12590 bool
12593 {
12596 {
12598 tree type1;
12607 {
12612 {
12615 *vecp
12618 non_const);
12619 }
12620 else
12625 }
12626 else
12633 {
12634 /* If the original vector isn't declared may_alias and it
12635 isn't a bare vector look if the subscripting would
12636 alias the vector we subscript, and if not, force ref-all. */
12642 }
12646 }
12648 }
12650 /* Determine which of the operands, if any, is a scalar that needs to be
12651 converted to a vector, for the range of operations. */
12652 enum stv_conv
12655 {
12663 {
12664 /* Most GENERIC binary expressions require homogeneous arguments.
12665 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12666 argument that is a vector and a second one that is a scalar, so
12667 we never return stv_secondarg for them. */
12672 {
12674 {
12679 }
12680 else
12682 }
12689 /* ... fall through ... */
12710 /* What about UNLT_EXPR? */
12712 {
12716 }
12720 {
12722 {
12727 }
12729 }
12731 /* Allow integer --> real conversion if safe. */
12735 {
12737 {
12742 }
12744 }
12747 }
12750 }
12752 /* Return true iff ALIGN is an integral constant that is a fundamental
12753 alignment, as defined by [basic.align] in the c++-11
12754 specifications.
12756 That is:
12758 [A fundamental alignment is represented by an alignment less than or
12759 equal to the greatest alignment supported by the implementation
12760 in all contexts, which is equal to
12761 alignof(max_align_t)]. */
12763 bool
12765 {
12768 }
12770 /* Return true if T is a pointer to a zero-sized aggregate. */
12772 bool
12774 {
12779 }