| blob | 64c44550ef2495d3b1e4b14f5942bb86f921de24 |
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. */
405 /* Reserved words. The third field is a mask: keywords are disabled
406 if they match the mask.
408 Masks for languages:
409 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
410 C --std=c99: D_CXXONLY | D_OBJC
411 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
412 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
413 C++ --std=c0x: D_CONLY | D_OBJC
414 ObjC++ is like C++ except that D_OBJC is not set
416 If -fno-asm is used, D_ASM is added to the mask. If
417 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
418 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
419 In C with -Wc++-compat, we warn if D_CXXWARN is set.
421 Note the complication of the D_CXX_OBJC keywords. These are
422 reserved words such as 'class'. In C++, 'class' is a reserved
423 word. In Objective-C++ it is too. In Objective-C, it is a
424 reserved word too, but only if it follows an '@' sign.
425 */
427 {
592 /* These Objective-C keywords are recognized only immediately after
593 an '@'. */
610 /* These are recognized only in protocol-qualifier context
611 (see above) */
618 /* These are recognized inside a property attribute list */
627 };
632 /* Table of machine-independent attributes common to all C-like languages.
634 All attributes referencing arguments should be additionally processed
635 in chkp_copy_function_type_adding_bounds for correct instrumentation
636 by Pointer Bounds Checker.
637 Current list of processed common attributes: nonnull. */
639 {
640 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
641 affects_type_identity } */
648 /* FIXME: logically, noreturn attributes should be listed as
649 "false, true, true" and apply to function types. But implementing this
650 would require all the places in the compiler that use TREE_THIS_VOLATILE
651 on a decl to identify non-returning functions to be located and fixed
652 to check the function type instead. */
683 /* The same comments as for noreturn attributes apply to const ones. */
709 handle_no_instrument_function_attribute,
727 /* ??? These two attributes didn't make the transition from the
728 Intel language document to the multi-vendor language document. */
733 /* For internal use (marking of builtins) only. The name contains space
734 to prevent its usage in source code. */
756 /* For internal use (marking of builtins) only. The name contains space
757 to prevent its usage in source code. */
768 handle_no_address_safety_analysis_attribute,
771 handle_no_sanitize_address_attribute,
774 handle_no_sanitize_address_attribute,
777 handle_no_sanitize_undefined_attribute,
787 /* For internal use only. The leading '*' both prevents its usage in
788 source code and signals that it may be overridden by machine tables. */
793 /* For internal use (marking of builtins and runtime functions) only.
794 The name contains space to prevent its usage in source code. */
820 };
822 /* Give the specifications for the format attributes, used by C and all
823 descendants.
825 All attributes referencing arguments should be additionally processed
826 in chkp_copy_function_type_adding_bounds for correct instrumentation
827 by Pointer Bounds Checker.
828 Current list of processed format attributes: format, format_arg. */
830 {
831 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
832 affects_type_identity } */
838 };
840 /* Return identifier for address space AS. */
844 {
848 }
850 /* Push current bindings for the function name VAR_DECLS. */
852 void
854 {
859 {
863 {
865 saved);
867 }
868 }
870 /* Normally they'll have been NULL, so only push if we've got a
871 stack, or they are non-NULL. */
873 saved_function_name_decls);
874 }
876 /* Finish up the current bindings, adding them into the current function's
877 statement tree. This must be done _before_ finish_stmt_tree is called.
878 If there is no current function, we must be at file scope and no statements
879 are involved. Pop the previous bindings. */
881 void
883 {
892 {
900 }
906 {
907 /* We had saved values, restore them. */
908 tree saved;
911 {
916 }
918 }
920 }
922 /* Return the text name of the current function, suitably prettified
923 by PRETTY_P. Return string must be freed by caller. */
927 {
934 {
937 }
950 {
953 }
956 }
958 /* Return the VAR_DECL for a const char array naming the current
959 function. If the VAR_DECL has not yet been created, create it
960 now. RID indicates how it should be formatted and IDENTIFIER_NODE
961 ID is its name (unfortunately C and C++ hold the RID values of
962 keywords in different places, so we can't derive RID from ID in
963 this language independent code. LOC is the location of the
964 function. */
966 tree
968 {
978 {
979 /* If a tree is built here, it would normally have the lineno of
980 the current statement. Later this tree will be moved to the
981 beginning of the function and this line number will be wrong.
982 To avoid this problem set the lineno to 0 here; that prevents
983 it from appearing in the RTL. */
984 tree stmts;
992 saved_function_name_decls
996 }
1001 }
1003 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1005 tree
1007 {
1012 /* Compute the number of elements, for the array type. */
1014 {
1017 }
1019 {
1022 }
1024 {
1027 }
1028 else
1029 {
1032 }
1034 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1035 limit in C++98 Annex B is very large (65536) and is not normative,
1036 so we do not diagnose it (warn_overlength_strings is forced off
1037 in c_common_post_options). */
1039 {
1043 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1044 separate the %d from the 'C'. 'ISO' should not be
1045 translated, but it may be moved after 'C%d' in languages
1046 where modifiers follow nouns. */
1048 "string length %qd is greater than the length %qd "
1051 }
1053 /* Create the array type for the string constant. The ISO C++
1054 standard says that a string literal has type `const char[N]' or
1055 `const wchar_t[N]'. We use the same logic when invoked as a C
1056 front-end with -Wwrite-strings.
1057 ??? We should change the type of an expression depending on the
1058 state of a warning flag. We should just be warning -- see how
1059 this is handled in the C++ front-end for the deprecated implicit
1060 conversion from string literals to `char*' or `wchar_t*'.
1062 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1063 array type being the unqualified version of that type.
1064 Therefore, if we are constructing an array of const char, we must
1065 construct the matching unqualified array type first. The C front
1066 end does not require this, but it does no harm, so we do it
1067 unconditionally. */
1078 }
1079 \f
1080 /* If DISABLE is true, stop issuing warnings. This is used when
1081 parsing code that we know will not be executed. This function may
1082 be called multiple times, and works as a stack. */
1084 static void
1086 {
1088 {
1091 }
1092 }
1094 /* If ENABLE is true, reenable issuing warnings. */
1096 static void
1098 {
1100 {
1103 }
1104 }
1106 /* Fully fold EXPR, an expression that was not folded (beyond integer
1107 constant expressions and null pointer constants) when being built
1108 up. If IN_INIT, this is in a static initializer and certain
1109 changes are made to the folding done. Clear *MAYBE_CONST if
1110 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1111 expression because it contains an evaluated operator (in C99) or an
1112 operator outside of sizeof returning an integer constant (in C90)
1113 not permitted in constant expressions, or because it contains an
1114 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1115 set to true by callers before calling this function.) Return the
1116 folded expression. Function arguments have already been folded
1117 before calling this function, as have the contents of SAVE_EXPR,
1118 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1119 C_MAYBE_CONST_EXPR. */
1121 tree
1123 {
1124 tree ret;
1130 /* This function is not relevant to C++ because C++ folds while
1131 parsing, and may need changes to be correct for C++ when C++
1132 stops folding while parsing. */
1139 {
1142 }
1149 }
1151 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1152 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1153 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1154 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1155 both evaluated and unevaluated subexpressions while
1156 *MAYBE_CONST_ITSELF is carried from only evaluated
1157 subexpressions). FOR_INT_CONST indicates if EXPR is an expression
1158 with integer constant operands, and if any of the operands doesn't
1159 get folded to an integer constant, don't fold the expression itself. */
1161 static tree
1164 {
1176 /* This function is not relevant to C++ because C++ folds while
1177 parsing, and may need changes to be correct for C++ when C++
1178 stops folding while parsing. */
1182 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1183 anything else not counted as an expression cannot usefully be
1184 folded further at this point. */
1190 /* Operands of variable-length expressions (function calls) have
1191 already been folded, as have __builtin_* function calls, and such
1192 expressions cannot occur in constant expressions. */
1194 {
1198 }
1201 {
1207 {
1211 }
1214 else
1217 }
1219 /* Assignment, increment, decrement, function call and comma
1220 operators, and statement expressions, cannot occur in constant
1221 expressions if evaluated / outside of sizeof. (Function calls
1222 were handled above, though VA_ARG_EXPR is treated like a function
1223 call here, and statement expressions are handled through
1224 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1226 {
1246 }
1248 /* Fold individual tree codes as appropriate. */
1250 {
1252 /* Any non-constancy will have been marked in a containing
1253 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1266 {
1269 }
1287 {
1291 }
1333 /* Binary operations evaluating both arguments (increment and
1334 decrement are binary internally in GCC). */
1346 /* The RHS of a MODIFY_EXPR was fully folded when building that
1347 expression for the sake of conversion warnings. */
1359 ret = in_init
1362 else
1383 {
1396 }
1413 CASE_CONVERT:
1424 /* Unary operations. */
1435 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1436 not prepared to deal with them if they occur in initializers. */
1444 ret = in_init
1447 else
1452 {
1456 }
1458 {
1461 CASE_CONVERT:
1462 /* Don't warn about explicit conversions. We will already
1463 have warned about suspect implicit conversions. */
1470 }
1475 /* Binary operations not necessarily evaluating both
1476 arguments. */
1480 for_int_const);
1484 ? truthvalue_false_node
1488 for_int_const);
1494 /* Require OP1 be an INTEGER_CST only if it's evaluated. */
1499 ret = in_init
1502 else
1507 && op0_const
1508 && op0_const_self
1514 && op0_const_self
1526 for_int_const);
1531 for_int_const);
1537 for_int_const);
1543 /* Only the evaluated operand must be an INTEGER_CST. */
1551 else
1556 && op0_const
1557 && op0_const_self
1561 && op0_const_self
1565 && op0_const
1566 && op0_const_self
1570 && op0_const_self
1576 /* Each case where an operand with excess precision may be
1577 encountered must remove the EXCESS_PRECISION_EXPR around
1578 inner operands and possibly put one around the whole
1579 expression or possibly convert to the semantic type (which
1580 c_fully_fold does); we cannot tell at this stage which is
1581 appropriate in any particular case. */
1585 /* Various codes may appear through folding built-in functions
1586 and their arguments. */
1588 }
1590 out:
1591 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1592 have been done by this point, so remove them again. */
1596 {
1600 }
1604 }
1606 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1607 return EXP. Otherwise, return either EXP or its known constant
1608 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1609 Is the BLKmode test appropriate? */
1611 tree
1613 {
1614 tree ret;
1616 /* This function is only used by C, for c_fully_fold and other
1617 optimization, and may not be correct for C++. */
1628 /* Avoid unwanted tree sharing between the initializer and current
1629 function's body where the tree can be modified e.g. by the
1630 gimplifier. */
1634 }
1636 /* Print a warning if a constant expression had overflow in folding.
1637 Invoke this function on every expression that the language
1638 requires to be a constant expression.
1639 Note the ANSI C standard says it is erroneous for a
1640 constant expression to overflow. */
1642 void
1644 {
1652 }
1654 /* The same as above but print an unconditional error. */
1655 void
1657 {
1664 }
1666 /* Print a warning if an expression had overflow in folding and its
1667 operands hadn't.
1669 Invoke this function on every expression that
1670 (1) appears in the source code, and
1671 (2) is a constant expression that overflowed, and
1672 (3) is not already checked by convert_and_check;
1673 however, do not invoke this function on operands of explicit casts
1674 or when the expression is the result of an operator and any operand
1675 already overflowed. */
1677 void
1679 {
1684 {
1713 }
1714 }
1716 /* Warn about uses of logical || / && operator in a context where it
1717 is likely that the bitwise equivalent was intended by the
1718 programmer. We have seen an expression in which CODE is a binary
1719 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1720 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1721 void
1725 {
1737 /* We don't want to warn if either operand comes from a macro
1738 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1739 see PR61534. */
1744 /* Warn if &&/|| are being used in a context where it is
1745 likely that the bitwise equivalent was intended by the
1746 programmer. That is, an expression such as op && MASK
1747 where op should not be any boolean expression, nor a
1748 constant, and mask seems to be a non-boolean integer constant. */
1756 {
1760 else
1765 }
1767 /* We do not warn for constants because they are typical of macro
1768 expansions that test for features. */
1772 /* This warning only makes sense with logical operands. */
1779 /* The range computations only work with scalars. */
1784 /* We first test whether either side separately is trivially true
1785 (with OR) or trivially false (with AND). If so, do not warn.
1786 This is a common idiom for testing ranges of data types in
1787 portable code. */
1794 /* If this is an OR operation, invert both sides; now, the result
1795 should be always false to get a warning. */
1809 /* If this is an OR operation, invert both sides; now, the result
1810 should be always false to get a warning. */
1818 /* If both expressions have the same operand, if we can merge the
1819 ranges, ... */
1823 {
1825 /* ... and if the range test is always false, then warn. */
1827 {
1830 "logical %<or%> of collectively exhaustive tests is "
1832 else
1834 "logical %<and%> of mutually exclusive tests is "
1836 }
1837 /* Or warn if the operands have exactly the same range, e.g.
1838 A > 0 && A > 0. */
1841 {
1845 else
1848 }
1849 }
1850 }
1852 /* Warn about logical not used on the left hand side operand of a comparison.
1853 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1854 Do not warn if RHS is of a boolean type. */
1856 void
1858 tree rhs)
1859 {
1865 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1866 !(x == 0) or !(y != 0). */
1872 "logical not is only applied to the left hand side of "
1874 }
1876 /* Warn if EXP contains any computations whose results are not used.
1877 Return true if a warning is printed; false otherwise. LOCUS is the
1878 (potential) location of the expression. */
1880 bool
1882 {
1883 restart:
1887 /* Don't warn about void constructs. This includes casting to void,
1888 void function calls, and statement expressions with a final cast
1889 to void. */
1897 {
1913 /* For a binding, warn if no side effect within it. */
1925 /* In && or ||, warn if 2nd operand has no side effect. */
1932 /* Let people do `(foo (), 0)' without a warning. */
1939 /* If this is an expression with side effects, don't warn; this
1940 case commonly appears in macro expansions. */
1946 /* Don't warn about automatic dereferencing of references, since
1947 the user cannot control it. */
1949 {
1952 }
1953 /* Fall through. */
1956 /* Referencing a volatile value is a side effect, so don't warn. */
1961 /* If this is an expression which has no operands, there is no value
1962 to be unused. There are no such language-independent codes,
1963 but front ends may define such. */
1967 warn:
1969 }
1970 }
1973 /* Print a warning about casts that might indicate violation
1974 of strict aliasing rules if -Wstrict-aliasing is used and
1975 strict aliasing mode is in effect. OTYPE is the original
1976 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1978 bool
1980 {
1981 /* Strip pointer conversion chains and get to the correct original type. */
1989 /* If the type we are casting to is a ref-all pointer
1990 dereferencing it is always valid. */
1997 {
1998 /* Casting the address of an object to non void pointer. Warn
1999 if the cast breaks type based aliasing. */
2001 {
2005 }
2006 else
2007 {
2008 /* warn_strict_aliasing >= 3. This includes the default (3).
2009 Only warn if the cast is dereferenced immediately. */
2010 alias_set_type set1 =
2016 {
2020 }
2023 {
2027 }
2028 }
2029 }
2030 else
2032 {
2033 /* At this level, warn for any conversions, even if an address is
2034 not taken in the same statement. This will likely produce many
2035 false positives, but could be useful to pinpoint problems that
2036 are not revealed at higher levels. */
2041 {
2045 }
2046 }
2049 }
2051 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2052 sizeof as last operand of certain builtins. */
2054 void
2058 {
2062 location_t loc;
2070 {
2074 /* FALLTHRU */
2082 /* FALLTHRU */
2141 }
2169 {
2173 {
2176 "argument to %<sizeof%> in %qD call is the same "
2177 "expression as the destination; did you mean to "
2183 "argument to %<sizeof%> in %qD call is the same "
2184 "expression as the destination; did you mean to "
2186 else
2188 "argument to %<sizeof%> in %qD call is the same "
2189 "expression as the destination; did you mean to "
2192 }
2195 && !strop
2198 {
2200 "argument to %<sizeof%> in %qD call is the same "
2201 "pointer type %qT as the destination; expected %qT "
2205 }
2206 }
2209 {
2213 {
2216 "argument to %<sizeof%> in %qD call is the same "
2217 "expression as the source; did you mean to "
2223 "argument to %<sizeof%> in %qD call is the same "
2224 "expression as the source; did you mean to "
2226 else
2228 "argument to %<sizeof%> in %qD call is the same "
2229 "expression as the source; did you mean to "
2232 }
2235 && !strop
2238 {
2240 "argument to %<sizeof%> in %qD call is the same "
2241 "pointer type %qT as the source; expected %qT "
2245 }
2246 }
2249 {
2253 {
2256 "argument to %<sizeof%> in %qD call is the same "
2257 "expression as the first source; did you mean to "
2263 "argument to %<sizeof%> in %qD call is the same "
2264 "expression as the first source; did you mean to "
2266 else
2268 "argument to %<sizeof%> in %qD call is the same "
2269 "expression as the first source; did you mean to "
2272 }
2275 && !strop
2278 {
2280 "argument to %<sizeof%> in %qD call is the same "
2281 "pointer type %qT as the first source; expected %qT "
2285 }
2286 }
2289 {
2293 {
2296 "argument to %<sizeof%> in %qD call is the same "
2297 "expression as the second source; did you mean to "
2303 "argument to %<sizeof%> in %qD call is the same "
2304 "expression as the second source; did you mean to "
2306 else
2308 "argument to %<sizeof%> in %qD call is the same "
2309 "expression as the second source; did you mean to "
2312 }
2315 && !strop
2318 {
2320 "argument to %<sizeof%> in %qD call is the same "
2321 "pointer type %qT as the second source; expected %qT "
2325 }
2326 }
2328 }
2330 /* Warn for unlikely, improbable, or stupid DECL declarations
2331 of `main'. */
2333 void
2335 {
2336 function_args_iterator iter;
2337 tree type;
2341 {
2342 /* XXX void_type_node belies the abstraction. */
2352 {
2358 }
2362 {
2384 "third argument of %q+D should probably be "
2387 }
2388 }
2390 /* It is intentional that this message does not mention the third
2391 argument because it's only mentioned in an appendix of the
2392 standard. */
2400 }
2402 /* vector_targets_convertible_p is used for vector pointer types. The
2403 callers perform various checks that the qualifiers are satisfactory,
2404 while OTOH vector_targets_convertible_p ignores the number of elements
2405 in the vectors. That's fine with vector pointers as we can consider,
2406 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2407 and that does not require and conversion of the pointer values.
2408 In contrast, vector_types_convertible_p and
2409 vector_types_compatible_elements_p are used for vector value types. */
2410 /* True if pointers to distinct types T1 and T2 can be converted to
2411 each other without an explicit cast. Only returns true for opaque
2412 vector types. */
2413 bool
2415 {
2422 }
2424 /* vector_types_convertible_p is used for vector value types.
2425 It could in principle call vector_targets_convertible_p as a subroutine,
2426 but then the check for vector type would be duplicated with its callers,
2427 and also the purpose of vector_targets_convertible_p would become
2428 muddled.
2429 Where vector_types_convertible_p returns true, a conversion might still be
2430 needed to make the types match.
2431 In contrast, vector_targets_convertible_p is used for vector pointer
2432 values, and vector_types_compatible_elements_p is used specifically
2433 in the context for binary operators, as a check if use is possible without
2434 conversion. */
2435 /* True if vector types T1 and T2 can be converted to each other
2436 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2437 can only be converted with -flax-vector-conversions yet that is not
2438 in effect, emit a note telling the user about that option if such
2439 a note has not previously been emitted. */
2440 bool
2442 {
2450 convertible_lax =
2465 {
2468 "conversions between vectors with differing "
2470 }
2473 }
2475 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2476 and have vector types, V0 has the same type as V1, and the number of
2477 elements of V0, V1, MASK is the same.
2479 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2480 called with two arguments. In this case implementation passes the
2481 first argument twice in order to share the same tree code. This fact
2482 could enable the mask-values being twice the vector length. This is
2483 an implementation accident and this semantics is not guaranteed to
2484 the user. */
2485 tree
2488 {
2489 tree ret;
2495 {
2498 }
2505 {
2510 }
2514 {
2518 }
2521 {
2526 }
2532 {
2535 "argument vector(s) and the mask vector should "
2538 }
2542 {
2547 }
2550 {
2551 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2557 else
2558 {
2561 }
2565 }
2575 }
2577 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2578 to integral type. */
2580 static tree
2582 {
2587 {
2588 /* C++0x scoped enumerations don't implicitly convert to integral
2589 type; if we stripped an explicit conversion to a larger type we
2590 need to replace it so common_type will still work. */
2594 }
2596 }
2598 /* This is a helper function of build_binary_op.
2600 For certain operations if both args were extended from the same
2601 smaller type, do the arithmetic in that type and then extend.
2603 BITWISE indicates a bitwise operation.
2604 For them, this optimization is safe only if
2605 both args are zero-extended or both are sign-extended.
2606 Otherwise, we might change the result.
2607 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2608 but calculated in (unsigned short) it would be (unsigned short)-1.
2609 */
2610 tree
2612 {
2616 tree type;
2618 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2619 excessive narrowing when we call get_narrower below. For
2620 example, suppose that OP0 is of unsigned int extended
2621 from signed char and that RESULT_TYPE is long long int.
2622 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2623 like
2625 (long long int) (unsigned int) signed_char
2627 which get_narrower would narrow down to
2629 (unsigned int) signed char
2631 If we do not cast OP0 first, get_narrower would return
2632 signed_char, which is inconsistent with the case of the
2633 explicit cast. */
2640 /* UNS is 1 if the operation to be done is an unsigned one. */
2643 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2644 but it *requires* conversion to FINAL_TYPE. */
2655 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2657 /* For bitwise operations, signedness of nominal type
2658 does not matter. Consider only how operands were extended. */
2662 /* Note that in all three cases below we refrain from optimizing
2663 an unsigned operation on sign-extended args.
2664 That would not be valid. */
2666 /* Both args variable: if both extended in same way
2667 from same width, do it in that width.
2668 Do it unsigned if args were zero-extended. */
2675 return c_common_signed_or_unsigned_type
2682 && (type
2693 && (type
2701 }
2703 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2704 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2706 static bool
2708 {
2711 REAL_VALUE_TYPE real_low_bound =
2713 REAL_VALUE_TYPE real_high_bound =
2718 }
2720 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2721 to the complex/real/integer type TYPE. Function returns non-zero when:
2722 * EXPR is a constant which cannot be exactly converted to TYPE.
2723 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2724 for EXPR type and TYPE being both integers or both real, or both
2725 complex.
2726 * EXPR is not a constant of complex type and TYPE is a real or
2727 an integer.
2728 * EXPR is not a constant of real type and TYPE is an integer.
2729 * EXPR is not a constant of integer type which cannot be
2730 exactly converted to real type.
2732 Function allows conversions between types of different signedness and
2733 can return SAFE_CONVERSION (zero) in that case. Function can produce
2734 signedness warnings if PRODUCE_WARNS is true.
2736 Function allows conversions from complex constants to non-complex types,
2737 provided that imaginary part is zero and real part can be safely converted
2738 to TYPE. */
2740 enum conversion_safety
2742 {
2748 {
2749 /* If type is complex, we are interested in compatibility with
2750 underlying type. */
2754 /* Warn for real constant that is not an exact integer converted
2755 to integer type. */
2758 {
2761 }
2762 /* Warn for an integer constant that does not fit into integer type. */
2766 {
2769 {
2773 }
2775 {
2779 }
2780 else
2782 }
2784 {
2785 /* Warn for an integer constant that does not fit into real type. */
2787 {
2791 }
2792 /* Warn for a real constant that does not fit into a smaller
2793 real type. */
2796 {
2800 }
2801 }
2802 }
2805 {
2807 /* Conversion from complex constant with zero imaginary part,
2808 perform check for conversion of real part. */
2813 /* Note: in this branch we use recursive call to unsafe_conversion_p
2814 with different type of EXPR, but it is still safe, because when EXPR
2815 is a constant, it's type is not used in text of generated warnings
2816 (otherwise they could sound misleading). */
2818 produce_warns);
2819 /* Conversion from complex constant with non-zero imaginary part. */
2820 else
2821 {
2822 /* Conversion to complex type.
2823 Perform checks for both real and imaginary parts. */
2825 {
2826 /* Unfortunately, produce_warns must be false in two subsequent
2827 calls of unsafe_conversion_p, because otherwise we could
2828 produce strange "double" warnings, if both real and imaginary
2829 parts have conversion problems related to signedness.
2831 For example:
2832 int32_t _Complex a = 0x80000000 + 0x80000000i;
2834 Possible solution: add a separate function for checking
2835 constants and combine result of two calls appropriately. */
2841 /* Merge the results into appropriate single warning. */
2843 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2850 else
2852 }
2853 /* Warn about conversion from complex to real or integer type. */
2854 else
2856 }
2857 }
2859 /* Checks for remaining case: EXPR is not constant. */
2860 else
2861 {
2862 /* Warn for real types converted to integer types. */
2869 {
2870 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2874 /* Don't warn for short y; short x = ((int)y & 0xff); */
2878 {
2879 /* If both args were extended from a shortest type,
2880 use that type if that is safe. */
2887 {
2893 /* If one of the operands is a non-negative constant
2894 that fits in the target type, then the type of the
2895 other operand does not matter. */
2904 /* If constant is unsigned and fits in the target
2905 type, then the result will also fit. */
2907 && unsigned0
2910 && unsigned1
2913 }
2914 }
2915 /* Warn for integer types converted to smaller integer types. */
2919 /* When they are the same width but different signedness,
2920 then the value may change. */
2923 /* Even when converted to a bigger type, if the type is
2924 unsigned but expr is signed, then negative values
2925 will be changed. */
2931 }
2933 /* Warn for integer types converted to real types if and only if
2934 all the range of values of the integer type cannot be
2935 represented by the real type. */
2938 {
2939 /* Don't warn about char y = 0xff; float x = (int) y; */
2945 }
2947 /* Warn for real types converted to smaller real types. */
2953 /* Check conversion between two complex types. */
2956 {
2957 /* Extract underlying types (i.e., type of real and imaginary
2958 parts) of expr_type and type. */
2962 /* Warn for real types converted to integer types. */
2967 /* Warn for real types converted to smaller real types. */
2973 /* Check conversion for complex integer types. Here implementation
2974 is simpler than for real-domain integers because it does not
2975 involve sophisticated cases, such as bitmasks, casts, etc. */
2978 {
2979 /* Warn for integer types converted to smaller integer types. */
2983 /* Check for different signedness, see case for real-domain
2984 integers (above) for a more detailed comment. */
2990 "conversion to %qT from %qT "
2993 }
2998 }
3000 /* Warn for complex types converted to real or integer types. */
3004 }
3007 }
3009 /* Warns if the conversion of EXPR to TYPE may alter a value.
3010 This is a helper function for warnings_for_convert_and_check. */
3012 static void
3014 {
3021 /* This may happen, because for LHS op= RHS we preevaluate
3022 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
3023 means we could no longer see the code of the EXPR. */
3030 {
3043 /* Conversion from boolean to a signed:1 bit-field (which only
3044 can hold the values 0 and -1) doesn't lose information - but
3045 it does change the value. */
3066 {
3067 /* In case of COND_EXPR, we do not care about the type of
3068 COND_EXPR, only about the conversion of each operand. */
3075 }
3091 }
3092 }
3094 /* Produce warnings after a conversion. RESULT is the result of
3095 converting EXPR to TYPE. This is a helper function for
3096 convert_and_check and cp_convert_and_check. */
3098 void
3100 tree result)
3101 {
3108 {
3109 /* Do not diagnose overflow in a constant expression merely
3110 because a conversion overflowed. */
3115 {
3116 /* This detects cases like converting -129 or 256 to
3117 unsigned char. */
3121 else
3123 }
3127 /* No warning for converting 0x80000000 to int. */
3135 else
3137 }
3142 else
3144 }
3147 /* Convert EXPR to TYPE, warning about conversion problems with constants.
3148 Invoke this function on every expression that is converted implicitly,
3149 i.e. because of language rules and not because of an explicit cast. */
3151 tree
3153 {
3154 tree result;
3155 tree expr_for_warning;
3157 /* Convert from a value with possible excess precision rather than
3158 via the semantic type, but do not warn about values not fitting
3159 exactly in the semantic type. */
3161 {
3167 }
3168 else
3182 }
3183 \f
3184 /* A node in a list that describes references to variables (EXPR), which are
3185 either read accesses if WRITER is zero, or write accesses, in which case
3186 WRITER is the parent of EXPR. */
3187 struct tlist
3188 {
3191 };
3193 /* Used to implement a cache the results of a call to verify_tree. We only
3194 use this for SAVE_EXPRs. */
3195 struct tlist_cache
3196 {
3200 tree expr;
3201 };
3203 /* Obstack to use when allocating tlist structures, and corresponding
3204 firstobj. */
3208 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3209 warnings. */
3211 /* SAVE_EXPRs need special treatment. We process them only once and then
3212 cache the results. */
3224 /* Create a new struct tlist and fill in its fields. */
3227 {
3234 }
3236 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3237 is nonnull, we ignore any node we find which has a writer equal to it. */
3239 static void
3241 {
3243 {
3250 }
3251 }
3253 /* Merge the nodes of ADD into TO. This merging process is done so that for
3254 each variable that already exists in TO, no new node is added; however if
3255 there is a write access recorded in ADD, and an occurrence on TO is only
3256 a read access, then the occurrence in TO will be modified to record the
3257 write. */
3259 static void
3261 {
3268 {
3275 {
3279 }
3281 {
3285 }
3287 }
3288 }
3290 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3291 references in list LIST conflict with it, excluding reads if ONLY writers
3292 is nonzero. */
3294 static void
3297 {
3300 /* Avoid duplicate warnings. */
3306 {
3310 {
3315 }
3317 }
3318 }
3320 /* Given a list LIST of references to variables, find whether any of these
3321 can cause conflicts due to missing sequence points. */
3323 static void
3325 {
3329 {
3332 }
3333 }
3335 /* Return nonzero if X is a tree that can be verified by the sequence point
3336 warnings. */
3337 static int
3339 {
3346 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3347 (lvalue_p) crash on TRY/CATCH. */
3354 /* No point to track non-const calls, they will never satisfy
3355 operand_equal_p. */
3363 }
3365 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3366 static bool
3368 {
3370 }
3372 /* Walk the tree X, and record accesses to variables. If X is written by the
3373 parent tree, WRITER is the parent.
3374 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3375 expression or its only operand forces a sequence point, then everything up
3376 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3377 in PNO_SP.
3378 Once we return, we will have emitted warnings if any subexpression before
3379 such a sequence point could be undefined. On a higher level, however, the
3380 sequence point may not be relevant, and we'll merge the two lists.
3382 Example: (b++, a) + b;
3383 The call that processes the COMPOUND_EXPR will store the increment of B
3384 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3385 processes the PLUS_EXPR will need to merge the two lists so that
3386 eventually, all accesses end up on the same list (and we'll warn about the
3387 unordered subexpressions b++ and b.
3389 A note on merging. If we modify the former example so that our expression
3390 becomes
3391 (b++, b) + a
3392 care must be taken not simply to add all three expressions into the final
3393 PNO_SP list. The function merge_tlist takes care of that by merging the
3394 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3395 way, so that no more than one access to B is recorded. */
3397 static void
3399 tree writer)
3400 {
3405 /* X may be NULL if it is the operand of an empty statement expression
3406 ({ }). */
3410 restart:
3418 {
3451 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3452 two first, to avoid warning for (a ? b++ : b++). */
3468 /* Expressions inside the LHS are not ordered wrt. the sequence points
3469 in the RHS. Example:
3470 *a = (a++, 2)
3471 Despite the fact that the modification of "a" is in the before_sp
3472 list (tmp_before), it conflicts with the use of "a" in the LHS.
3473 We can handle this by adding the contents of tmp_list3
3474 to those of tmp_before, and redoing the collision warnings for that
3475 list. */
3478 /* Exclude the LHS itself here; we first have to merge it into the
3479 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3480 didn't exclude the LHS, we'd get it twice, once as a read and once
3481 as a write. */
3492 /* We need to warn about conflicts among arguments and conflicts between
3493 args and the function address. Side effects of the function address,
3494 however, are not ordered by the sequence point of the call. */
3495 {
3496 call_expr_arg_iterator iter;
3497 tree arg;
3501 {
3506 }
3511 }
3514 /* Scan all the list, e.g. indices of multi dimensional array. */
3516 {
3522 }
3526 {
3533 {
3547 }
3551 }
3561 /* For other expressions, simply recurse on their operands.
3562 Manual tail recursion for unary expressions.
3563 Other non-expressions need not be processed. */
3565 {
3569 }
3571 {
3575 {
3580 }
3581 }
3583 }
3584 }
3586 /* Try to warn for undefined behavior in EXPR due to missing sequence
3587 points. */
3589 DEBUG_FUNCTION void
3591 {
3597 {
3600 }
3605 }
3606 \f
3607 /* Validate the expression after `case' and apply default promotions. */
3609 static tree
3611 {
3616 /* Promote char or short to int. */
3619 {
3622 }
3627 }
3628 \f
3629 /* See if the case values LOW and HIGH are in the range of the original
3630 type (i.e. before the default conversion to int) of the switch testing
3631 expression.
3632 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3633 the type before promoting it. CASE_LOW_P is a pointer to the lower
3634 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3635 if the case is not a case range.
3636 The caller has to make sure that we are not called with NULL for
3637 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3638 was a case value that doesn't fit into the range of the ORIG_TYPE.
3639 Returns true if the case label is in range of ORIG_TYPE (saturated or
3640 untouched) or false if the label is out of range. */
3642 static bool
3646 {
3651 /* If there was a problem with the original type, do nothing. */
3658 /* Case label is less than minimum for type. */
3661 {
3666 }
3668 /* Case value is greater than maximum for type. */
3671 {
3675 }
3677 /* Saturate lower case label value to minimum. */
3680 {
3685 }
3687 /* Saturate upper case label value to maximum. */
3690 {
3695 }
3703 }
3704 \f
3705 /* Return an integer type with BITS bits of precision,
3706 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3708 tree
3710 {
3752 }
3754 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3755 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3756 and saturating if SATP is nonzero, otherwise not saturating. */
3758 tree
3761 {
3762 machine_mode mode;
3765 else
3773 {
3775 "fixed-point types that have too many integral and "
3778 }
3781 }
3783 /* Used for communication between c_common_type_for_mode and
3784 c_register_builtin_type. */
3785 tree registered_builtin_types;
3787 /* Return a data type that has machine mode MODE.
3788 If the mode is an integer,
3789 then UNSIGNEDP selects between signed and unsigned types.
3790 If the mode is a fixed-point mode,
3791 then UNSIGNEDP selects between saturating and nonsaturating types. */
3793 tree
3795 {
3796 tree t;
3836 #if HOST_BITS_PER_WIDE_INT >= 64
3839 #endif
3864 {
3865 machine_mode inner_mode;
3866 tree inner_type;
3882 }
3884 {
3889 }
3899 {
3985 }
3993 }
3995 tree
3997 {
3999 }
4001 /* Return a signed type the same as TYPE in other respects. */
4003 tree
4005 {
4007 }
4009 /* Return a type the same as TYPE except unsigned or
4010 signed according to UNSIGNEDP. */
4012 tree
4014 {
4015 tree type1;
4018 /* This block of code emulates the behavior of the old
4019 c_common_unsigned_type. In particular, it returns
4020 long_unsigned_type_node if passed a long, even when a int would
4021 have the same size. This is necessary for warnings to work
4022 correctly in archs where sizeof(int) == sizeof(long) */
4025 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
4045 #if HOST_BITS_PER_WIDE_INT >= 64
4048 #endif
4058 #define C_COMMON_FIXED_TYPES(NAME) \
4059 if (type1 == short_ ## NAME ## _type_node \
4060 || type1 == unsigned_short_ ## NAME ## _type_node) \
4061 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4062 : short_ ## NAME ## _type_node; \
4063 if (type1 == NAME ## _type_node \
4064 || type1 == unsigned_ ## NAME ## _type_node) \
4065 return unsignedp ? unsigned_ ## NAME ## _type_node \
4066 : NAME ## _type_node; \
4067 if (type1 == long_ ## NAME ## _type_node \
4068 || type1 == unsigned_long_ ## NAME ## _type_node) \
4069 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4070 : long_ ## NAME ## _type_node; \
4071 if (type1 == long_long_ ## NAME ## _type_node \
4072 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4073 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4074 : long_long_ ## NAME ## _type_node;
4076 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
4077 if (type1 == NAME ## _type_node \
4078 || type1 == u ## NAME ## _type_node) \
4079 return unsignedp ? u ## NAME ## _type_node \
4080 : NAME ## _type_node;
4082 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
4083 if (type1 == sat_ ## short_ ## NAME ## _type_node \
4084 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
4085 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
4086 : sat_ ## short_ ## NAME ## _type_node; \
4087 if (type1 == sat_ ## NAME ## _type_node \
4088 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
4089 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
4090 : sat_ ## NAME ## _type_node; \
4091 if (type1 == sat_ ## long_ ## NAME ## _type_node \
4092 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
4093 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
4094 : sat_ ## long_ ## NAME ## _type_node; \
4095 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
4096 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
4097 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
4098 : sat_ ## long_long_ ## NAME ## _type_node;
4100 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
4101 if (type1 == sat_ ## NAME ## _type_node \
4102 || type1 == sat_ ## u ## NAME ## _type_node) \
4103 return unsignedp ? sat_ ## u ## NAME ## _type_node \
4104 : sat_ ## NAME ## _type_node;
4130 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
4131 the precision; they have precision set to match their range, but
4132 may use a wider mode to match an ABI. If we change modes, we may
4133 wind up with bad conversions. For INTEGER_TYPEs in C, must check
4134 the precision as well, so as to yield correct results for
4135 bit-field types. C++ does not have these separate bit-field
4136 types, and producing a signed or unsigned variant of an
4137 ENUMERAL_TYPE may cause other problems as well. */
4143 #define TYPE_OK(node) \
4144 (TYPE_MODE (type) == TYPE_MODE (node) \
4145 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4169 #if HOST_BITS_PER_WIDE_INT >= 64
4172 #endif
4181 #undef TYPE_OK
4184 }
4186 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4188 tree
4190 {
4193 /* Extended integer types of the same width as a standard type have
4194 lesser rank, so those of the same width as int promote to int or
4195 unsigned int and are valid for printf formats expecting int or
4196 unsigned int. To avoid such special cases, avoid creating
4197 extended integer types for bit-fields if a standard integer type
4198 is available. */
4216 }
4218 /* The C version of the register_builtin_type langhook. */
4220 void
4222 {
4223 tree decl;
4233 }
4234 \f
4235 /* Print an error message for invalid operands to arith operation
4236 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4237 LOCATION is the location of the message. */
4239 void
4242 {
4246 {
4291 }
4295 }
4296 \f
4297 /* Given an expression as a tree, return its original type. Do this
4298 by stripping any conversion that preserves the sign and precision. */
4299 static tree
4301 {
4304 }
4306 /* Subroutine of build_binary_op, used for comparison operations.
4307 See if the operands have both been converted from subword integer types
4308 and, if so, perhaps change them both back to their original type.
4309 This function is also responsible for converting the two operands
4310 to the proper common type for comparison.
4312 The arguments of this function are all pointers to local variables
4313 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4314 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4316 LOC is the location of the comparison.
4318 If this function returns nonzero, it means that the comparison has
4319 a constant value. What this function returns is an expression for
4320 that value. */
4322 tree
4325 {
4326 tree type;
4334 /* Throw away any conversions to wider types
4335 already present in the operands. */
4340 /* If primopN is first sign-extended from primopN's precision to opN's
4341 precision, then zero-extended from opN's precision to
4342 *restype_ptr precision, shortenings might be invalid. */
4345 && !unsignedp0
4350 && !unsignedp1
4354 /* Handle the case that OP0 does not *contain* a conversion
4355 but it *requires* conversion to FINAL_TYPE. */
4362 /* If one of the operands must be floated, we cannot optimize. */
4366 /* If first arg is constant, swap the args (changing operation
4367 so value is preserved), for canonicalization. Don't do this if
4368 the second arg is 0. */
4373 {
4382 {
4397 }
4399 }
4401 /* If comparing an integer against a constant more bits wide,
4402 maybe we can deduce a value of 1 or 0 independent of the data.
4403 Or else truncate the constant now
4404 rather than extend the variable at run time.
4406 This is only interesting if the constant is the wider arg.
4407 Also, it is not safe if the constant is unsigned and the
4408 variable arg is signed, since in this case the variable
4409 would be sign-extended and then regarded as unsigned.
4410 Our technique fails in this case because the lowest/highest
4411 possible unsigned results don't follow naturally from the
4412 lowest/highest possible values of the variable operand.
4413 For just EQ_EXPR and NE_EXPR there is another technique that
4414 could be used: see if the constant can be faithfully represented
4415 in the other operand's type, by truncating it and reextending it
4416 and see if that preserves the constant's value. */
4422 {
4425 /* 1 if comparison is nominally unsigned. */
4427 tree val;
4439 {
4440 /* Convert primop1 to target type, but do not introduce
4441 additional overflow. We know primop1 is an int_cst. */
4448 }
4450 {
4453 }
4461 /* This used to be a switch, but Genix compiler can't handle that. */
4463 {
4466 }
4468 {
4471 }
4473 {
4478 }
4480 {
4485 }
4487 {
4492 }
4494 {
4499 }
4501 /* If primop0 was sign-extended and unsigned comparison specd,
4502 we did a signed comparison above using the signed type bounds.
4503 But the comparison we output must be unsigned.
4505 Also, for inequalities, VAL is no good; but if the signed
4506 comparison had *any* fixed result, it follows that the
4507 unsigned comparison just tests the sign in reverse
4508 (positive values are LE, negative ones GE).
4509 So we can generate an unsigned comparison
4510 against an extreme value of the signed type. */
4513 {
4516 {
4531 }
4533 }
4536 {
4543 }
4546 {
4547 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4551 }
4553 /* Value is not predetermined, but do the comparison
4554 in the type of the operand that is not constant.
4555 TYPE is already properly set. */
4556 }
4558 /* If either arg is decimal float and the other is float, find the
4559 proper common type to use for comparison. */
4565 /* If either arg is decimal float and the other is float, fail. */
4576 /* If args' natural types are both narrower than nominal type
4577 and both extend in the same manner, compare them
4578 in the type of the wider arg.
4579 Otherwise must actually extend both to the nominal
4580 common type lest different ways of extending
4581 alter the result.
4582 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4587 {
4591 type);
4592 /* Make sure shorter operand is extended the right way
4593 to match the longer operand. */
4594 primop0
4597 primop0);
4598 primop1
4601 primop1);
4602 }
4603 else
4604 {
4605 /* Here we must do the comparison on the nominal type
4606 using the args exactly as we received them. */
4613 {
4615 /* All unsigned values are >= 0, so we warn. However,
4616 if OP0 is a constant that is >= 0, the signedness of
4617 the comparison isn't an issue, so suppress the
4618 warning. */
4623 primop0)))
4624 /* Do not warn for enumeration types. */
4628 {
4645 }
4648 {
4649 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4654 }
4655 }
4656 }
4664 }
4665 \f
4666 /* Return a tree for the sum or difference (RESULTCODE says which)
4667 of pointer PTROP and integer INTOP. */
4669 tree
4672 {
4675 /* The result is a pointer of the same type that is being added. */
4679 {
4686 }
4688 {
4695 }
4696 else
4699 /* We are manipulating pointer values, so we don't need to warn
4700 about relying on undefined signed overflow. We disable the
4701 warning here because we use integer types so fold won't know that
4702 they are really pointers. */
4705 /* If what we are about to multiply by the size of the elements
4706 contains a constant term, apply distributive law
4707 and multiply that constant term separately.
4708 This helps produce common subexpressions. */
4713 /* If the constant comes from pointer subtraction,
4714 skip this optimization--it would cause an error. */
4716 /* If the constant is unsigned, and smaller than the pointer size,
4717 then we must skip this optimization. This is because it could cause
4718 an overflow error if the constant is negative but INTOP is not. */
4722 {
4727 /* Convert both subexpression types to the type of intop,
4728 because weird cases involving pointer arithmetic
4729 can result in a sum or difference with different type args. */
4734 }
4736 /* Convert the integer argument to a type the same size as sizetype
4737 so the multiply won't overflow spuriously. */
4743 /* Replace the integer argument with a suitable product by the object size.
4744 Do this multiplication as signed, then convert to the appropriate type
4745 for the pointer operation and disregard an overflow that occurred only
4746 because of the sign-extension change in the latter conversion. */
4747 {
4754 }
4756 /* Create the sum or difference. */
4765 }
4766 \f
4767 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4768 and if NON_CONST is known not to be permitted in an evaluated part
4769 of a constant expression. */
4771 tree
4773 {
4777 /* This should never be called for C++. */
4781 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4790 }
4792 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4793 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4794 around the SAVE_EXPR if needed so that c_fully_fold does not need
4795 to look inside SAVE_EXPRs. */
4797 tree
4799 {
4808 }
4810 /* Return whether EXPR is a declaration whose address can never be
4811 NULL. */
4813 bool
4815 {
4820 }
4822 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4823 or for an `if' or `while' statement or ?..: exp. It should already
4824 have been validated to be of suitable type; otherwise, a bad
4825 diagnostic may result.
4827 The EXPR is located at LOCATION.
4829 This preparation consists of taking the ordinary
4830 representation of an expression expr and producing a valid tree
4831 boolean expression describing whether expr is nonzero. We could
4832 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4833 but we optimize comparisons, &&, ||, and !.
4835 The resulting type should always be `truthvalue_type_node'. */
4837 tree
4839 {
4841 {
4883 ? truthvalue_true_node
4889 ? truthvalue_true_node
4894 /* Fall through. */
4897 {
4900 {
4901 /* Common Ada/Pascal programmer's mistake. */
4903 OPT_Waddress,
4905 inner);
4907 }
4909 }
4926 /* These don't change whether an object is nonzero or zero. */
4931 /* These don't change whether an object is zero or nonzero, but
4932 we can't ignore them if their second arg has side-effects. */
4934 {
4937 c_common_truthvalue_conversion
4940 }
4941 else
4946 /* Distribute the conversion into the arms of a COND_EXPR. */
4948 {
4951 /* In C++ one of the arms might have void type if it is throw. */
4959 }
4960 else
4961 {
4962 /* Folding will happen later for C. */
4970 }
4972 CASE_CONVERT:
4973 {
4979 {
4985 OPT_Waddress,
4986 "the compiler can assume that the address of "
4988 inner);
4989 }
4991 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4992 since that affects how `default_conversion' will behave. */
4996 /* Don't strip a conversion from C++0x scoped enum, since they
4997 don't implicitly convert to other types. */
5001 /* If this isn't narrowing the argument, we can ignore it. */
5005 }
5011 {
5015 }
5020 }
5023 {
5025 expr = (build_binary_op
5029 c_common_truthvalue_conversion
5032 c_common_truthvalue_conversion
5037 }
5040 {
5045 }
5046 else
5049 ret:
5052 }
5053 \f
5062 /* Apply the TYPE_QUALS to the new DECL. */
5064 void
5066 {
5074 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
5075 constructor can produce constant init, so rely on cp_finish_decl to
5076 clear TREE_READONLY if the variable has non-constant init. */
5079 {
5082 }
5084 {
5086 /* Allow 'restrict' on arrays of pointers.
5087 FIXME currently we just ignore it. */
5093 }
5094 }
5097 {
5100 };
5102 /* Hash function for the problem of multiple type definitions in
5103 different files. This must hash all types that will compare
5104 equal via comptypes to the same value. In practice it hashes
5105 on some of the simple stuff and leaves the details to comptypes. */
5107 hashval_t
5109 {
5112 tree t2;
5114 {
5115 /* For pointers, hash on pointee type plus some swizzling. */
5118 /* Hash on number of elements and total size. */
5137 }
5138 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
5139 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
5141 /* We might have a VLA here. */
5144 else
5147 }
5149 bool
5151 {
5153 }
5157 /* Return the typed-based alias set for T, which may be an expression
5158 or a type. Return -1 if we don't do anything special. */
5160 alias_set_type
5162 {
5163 tree u;
5165 /* For VLAs, use the alias set of the element type rather than the
5166 default of alias set 0 for types compared structurally. */
5168 {
5172 }
5174 /* Permit type-punning when accessing a union, provided the access
5175 is directly through the union. For example, this code does not
5176 permit taking the address of a union member and then storing
5177 through it. Even the type-punning allowed here is a GCC
5178 extension, albeit a common and useful one; the C standard says
5179 that such accesses have implementation-defined behavior. */
5187 /* That's all the expressions we handle specially. */
5191 /* The C standard guarantees that any object may be accessed via an
5192 lvalue that has character type. */
5198 /* The C standard specifically allows aliasing between signed and
5199 unsigned variants of the same type. We treat the signed
5200 variant as canonical. */
5202 {
5205 /* t1 == t can happen for boolean nodes which are always unsigned. */
5208 }
5210 /* Handle the case of multiple type nodes referring to "the same" type,
5211 which occurs with IMA. These share an alias set. FIXME: Currently only
5212 C90 is handled. (In C99 type compatibility is not transitive, which
5213 complicates things mightily. The alias set splay trees can theoretically
5214 represent this, but insertion is tricky when you consider all the
5215 different orders things might arrive in.) */
5220 /* Save time if there's only one input file. */
5224 /* Pointers need special handling if they point to any type that
5225 needs special handling (below). */
5227 {
5228 tree t2;
5229 /* Find bottom type under any nested POINTERs. */
5233 ;
5241 }
5242 /* These are the only cases that need special handling. */
5249 /* Undefined? */
5253 /* Look up t in hash table. Only one of the compatible types within each
5254 alias set is recorded in the table. */
5259 {
5262 }
5263 else
5264 /* Our caller will assign and record (in t) a new alias set; all we need
5265 to do is remember t in the hash table. */
5269 }
5270 \f
5271 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5272 the IS_SIZEOF parameter indicates which operator is being applied.
5273 The COMPLAIN flag controls whether we should diagnose possibly
5274 ill-formed constructs or not. LOC is the location of the SIZEOF or
5275 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5276 a type in any context should be returned, rather than the normal
5277 alignment for that type. */
5279 tree
5283 {
5291 {
5293 {
5300 }
5301 else
5302 {
5304 {
5308 else
5311 }
5313 }
5314 }
5316 {
5324 }
5327 {
5332 }
5335 {
5340 }
5341 else
5342 {
5344 /* Convert in case a char is more than one unit. */
5350 else
5352 }
5354 /* VALUE will have the middle-end integer type sizetype.
5355 However, we should really return a value of type `size_t',
5356 which is just a typedef for an ordinary integer type. */
5360 }
5362 /* Implement the __alignof keyword: Return the minimum required
5363 alignment of EXPR, measured in bytes. For VAR_DECLs,
5364 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5365 from an "aligned" __attribute__ specification). LOC is the
5366 location of the ALIGNOF operator. */
5368 tree
5370 {
5371 tree t;
5378 {
5381 }
5387 {
5394 {
5401 }
5403 }
5404 else
5408 }
5409 \f
5410 /* Handle C and C++ default attributes. */
5412 enum built_in_attribute
5413 {
5414 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5415 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5416 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5417 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5418 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5420 #undef DEF_ATTR_NULL_TREE
5421 #undef DEF_ATTR_INT
5422 #undef DEF_ATTR_STRING
5423 #undef DEF_ATTR_IDENT
5424 #undef DEF_ATTR_TREE_LIST
5425 ATTR_LAST
5426 };
5432 enum c_builtin_type
5433 {
5434 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5435 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5436 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5437 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5438 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5439 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5440 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5441 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5442 ARG6) NAME,
5443 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5444 ARG6, ARG7) NAME,
5445 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5446 ARG6, ARG7, ARG8) NAME,
5447 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5448 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5449 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5450 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5451 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5452 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5453 NAME,
5454 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5455 ARG6, ARG7) NAME,
5456 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5457 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5458 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5460 #undef DEF_PRIMITIVE_TYPE
5461 #undef DEF_FUNCTION_TYPE_0
5462 #undef DEF_FUNCTION_TYPE_1
5463 #undef DEF_FUNCTION_TYPE_2
5464 #undef DEF_FUNCTION_TYPE_3
5465 #undef DEF_FUNCTION_TYPE_4
5466 #undef DEF_FUNCTION_TYPE_5
5467 #undef DEF_FUNCTION_TYPE_6
5468 #undef DEF_FUNCTION_TYPE_7
5469 #undef DEF_FUNCTION_TYPE_8
5470 #undef DEF_FUNCTION_TYPE_VAR_0
5471 #undef DEF_FUNCTION_TYPE_VAR_1
5472 #undef DEF_FUNCTION_TYPE_VAR_2
5473 #undef DEF_FUNCTION_TYPE_VAR_3
5474 #undef DEF_FUNCTION_TYPE_VAR_4
5475 #undef DEF_FUNCTION_TYPE_VAR_5
5476 #undef DEF_FUNCTION_TYPE_VAR_7
5477 #undef DEF_FUNCTION_TYPE_VAR_11
5478 #undef DEF_POINTER_TYPE
5479 BT_LAST
5480 };
5484 /* A temporary array for c_common_nodes_and_builtins. Used in
5485 communication with def_fn_type. */
5488 /* A helper function for c_common_nodes_and_builtins. Build function type
5489 for DEF with return type RET and N arguments. If VAR is true, then the
5490 function should be variadic after those N arguments.
5492 Takes special care not to ICE if any of the types involved are
5493 error_mark_node, which indicates that said type is not in fact available
5494 (see builtin_type_for_size). In which case the function type as a whole
5495 should be error_mark_node. */
5497 static void
5499 {
5500 tree t;
5507 {
5513 }
5520 else
5523 egress:
5526 }
5528 /* Build builtin functions common to both C and C++ language
5529 frontends. */
5531 static void
5533 {
5534 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5535 builtin_types[ENUM] = VALUE;
5536 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5537 def_fn_type (ENUM, RETURN, 0, 0);
5538 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5539 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5540 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5541 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5542 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5543 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5544 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5545 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5546 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5547 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5548 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5549 ARG6) \
5550 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5551 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5552 ARG6, ARG7) \
5553 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5554 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5555 ARG6, ARG7, ARG8) \
5556 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5557 ARG7, ARG8);
5558 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5559 def_fn_type (ENUM, RETURN, 1, 0);
5560 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5561 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5562 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5563 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5564 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5565 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5566 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5567 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5568 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5569 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5570 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5571 ARG6, ARG7) \
5572 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5573 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5574 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5575 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5576 ARG7, ARG8, ARG9, ARG10, ARG11);
5577 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5578 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5582 #undef DEF_PRIMITIVE_TYPE
5583 #undef DEF_FUNCTION_TYPE_0
5584 #undef DEF_FUNCTION_TYPE_1
5585 #undef DEF_FUNCTION_TYPE_2
5586 #undef DEF_FUNCTION_TYPE_3
5587 #undef DEF_FUNCTION_TYPE_4
5588 #undef DEF_FUNCTION_TYPE_5
5589 #undef DEF_FUNCTION_TYPE_6
5590 #undef DEF_FUNCTION_TYPE_7
5591 #undef DEF_FUNCTION_TYPE_8
5592 #undef DEF_FUNCTION_TYPE_VAR_0
5593 #undef DEF_FUNCTION_TYPE_VAR_1
5594 #undef DEF_FUNCTION_TYPE_VAR_2
5595 #undef DEF_FUNCTION_TYPE_VAR_3
5596 #undef DEF_FUNCTION_TYPE_VAR_4
5597 #undef DEF_FUNCTION_TYPE_VAR_5
5598 #undef DEF_FUNCTION_TYPE_VAR_7
5599 #undef DEF_FUNCTION_TYPE_VAR_11
5600 #undef DEF_POINTER_TYPE
5605 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5606 NONANSI_P, ATTRS, IMPLICIT, COND) \
5607 if (NAME && COND) \
5608 def_builtin_1 (ENUM, NAME, CLASS, \
5609 builtin_types[(int) TYPE], \
5610 builtin_types[(int) LIBTYPE], \
5611 BOTH_P, FALLBACK_P, NONANSI_P, \
5612 built_in_attributes[(int) ATTRS], IMPLICIT);
5614 #undef DEF_BUILTIN
5622 }
5624 /* Like get_identifier, but avoid warnings about null arguments when
5625 the argument may be NULL for targets where GCC lacks stdint.h type
5626 information. */
5630 {
5632 }
5634 /* Build tree nodes and builtin functions common to both C and C++ language
5635 frontends. */
5637 void
5639 {
5643 tree array_domain_type;
5644 tree va_list_ref_type_node;
5645 tree va_list_arg_type_node;
5650 /* Define `int' and `char' first so that dbx will output them first. */
5654 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5655 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5656 but not C. Are the conditionals here needed? */
5662 long_unsigned_type_node);
5665 {
5673 }
5678 long_long_integer_type_node);
5680 long_long_unsigned_type_node);
5683 long_long_unsigned_type_node);
5686 short_unsigned_type_node);
5689 short_unsigned_type_node);
5691 /* Define both `signed char' and `unsigned char'. */
5695 /* These are types that c_common_type_for_size and
5696 c_common_type_for_mode use. */
5699 intQI_type_node));
5702 intHI_type_node));
5705 intSI_type_node));
5708 intDI_type_node));
5709 #if HOST_BITS_PER_WIDE_INT >= 64
5710 /* Note that this is different than the __int128 type that's part of
5711 the generic __intN support. */
5714 TYPE_DECL,
5716 intTI_type_node));
5717 #endif
5720 unsigned_intQI_type_node));
5723 unsigned_intHI_type_node));
5726 unsigned_intSI_type_node));
5729 unsigned_intDI_type_node));
5730 #if HOST_BITS_PER_WIDE_INT >= 64
5733 TYPE_DECL,
5735 unsigned_intTI_type_node));
5736 #endif
5738 /* Create the widest literal types. */
5739 widest_integer_literal_type_node
5743 widest_integer_literal_type_node));
5745 widest_unsigned_literal_type_node
5749 widest_unsigned_literal_type_node));
5753 pid_type_node =
5760 /* Only supported decimal floating point extension if the target
5761 actually supports underlying modes. */
5765 {
5769 }
5772 {
5777 long_long_fract_type_node);
5779 unsigned_short_fract_type_node);
5781 unsigned_fract_type_node);
5783 unsigned_long_fract_type_node);
5785 unsigned_long_long_fract_type_node);
5787 sat_short_fract_type_node);
5790 sat_long_fract_type_node);
5792 sat_long_long_fract_type_node);
5794 sat_unsigned_short_fract_type_node);
5796 sat_unsigned_fract_type_node);
5798 sat_unsigned_long_fract_type_node);
5800 sat_unsigned_long_long_fract_type_node);
5805 long_long_accum_type_node);
5807 unsigned_short_accum_type_node);
5809 unsigned_accum_type_node);
5811 unsigned_long_accum_type_node);
5813 unsigned_long_long_accum_type_node);
5815 sat_short_accum_type_node);
5818 sat_long_accum_type_node);
5820 sat_long_long_accum_type_node);
5822 sat_unsigned_short_accum_type_node);
5824 sat_unsigned_accum_type_node);
5826 sat_unsigned_long_accum_type_node);
5828 sat_unsigned_long_long_accum_type_node);
5830 }
5833 TYPE_DECL,
5835 complex_integer_type_node));
5837 TYPE_DECL,
5839 complex_float_type_node));
5841 TYPE_DECL,
5843 complex_double_type_node));
5847 complex_long_double_type_node));
5850 /* For C++, make fileptr_type_node a distinct void * type until
5851 FILE type is defined. */
5856 /* Set the TYPE_NAME for any variants that were built before
5857 record_builtin_type gave names to the built-in types. */
5858 {
5864 }
5868 /* Make a type to be the domain of a few array types
5869 whose domains don't really matter.
5870 200 is small enough that it always fits in size_t
5871 and large enough that it can hold most function names for the
5872 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5875 /* Make a type for arrays of characters.
5876 With luck nothing will ever really depend on the length of this
5877 array type. */
5878 char_array_type_node
5882 const_string_type_node
5886 /* This is special for C++ so functions can be overloaded. */
5892 {
5895 else
5898 }
5900 /* This is for wide string constants. */
5901 wchar_array_type_node
5904 /* Define 'char16_t'. */
5909 {
5914 }
5916 /* This is for UTF-16 string constants. */
5917 char16_array_type_node
5920 /* Define 'char32_t'. */
5925 {
5930 }
5932 /* This is for UTF-32 string constants. */
5933 char32_array_type_node
5936 wint_type_node =
5939 intmax_type_node =
5941 uintmax_type_node =
5945 sig_atomic_type_node =
5948 int8_type_node =
5951 int16_type_node =
5954 int32_type_node =
5957 int64_type_node =
5960 uint8_type_node =
5972 int_least8_type_node =
5975 int_least16_type_node =
5978 int_least32_type_node =
5981 int_least64_type_node =
5984 uint_least8_type_node =
5987 uint_least16_type_node =
5990 uint_least32_type_node =
5993 uint_least64_type_node =
5996 int_fast8_type_node =
5999 int_fast16_type_node =
6002 int_fast32_type_node =
6005 int_fast64_type_node =
6008 uint_fast8_type_node =
6011 uint_fast16_type_node =
6014 uint_fast32_type_node =
6017 uint_fast64_type_node =
6020 intptr_type_node =
6023 uintptr_type_node =
6026 default_function_type
6028 ptrdiff_type_node
6035 va_list_type_node));
6037 {
6040 tree ptype;
6043 {
6047 ptype));
6049 }
6050 }
6053 {
6056 }
6057 else
6058 {
6061 }
6068 /* Create the built-in __null node. It is important that this is
6069 not shared. */
6073 /* Since builtin_types isn't gc'ed, don't export these nodes. */
6075 }
6077 /* The number of named compound-literals generated thus far. */
6080 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
6082 void
6084 {
6087 compound_literal_number);
6088 compound_literal_number++;
6090 }
6092 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
6093 TYPE and operand OP. */
6095 static tree
6097 {
6101 }
6103 /* Return a VA_ARG_EXPR corresponding to a source-level expression
6104 va_arg (EXPR, TYPE) at source location LOC. */
6106 tree
6108 {
6111 ? NULL_TREE
6116 {
6117 /* Let's handle things neutrallly, if expr:
6118 - has undeclared type, or
6119 - is not an va_list type. */
6121 }
6124 {
6125 /* Case 1: Not an array type. */
6127 /* Take the address, to get '&ap'. */
6131 /* Verify that &ap is still recognized as having va_list type. */
6132 tree canon_expr_type
6137 }
6139 /* Case 2: Array type.
6141 Background:
6143 For contrast, let's start with the simple case (case 1). If
6144 canon_va_type is not an array type, but say a char *, then when
6145 passing-by-value a va_list, the type of the va_list param decl is
6146 the same as for another va_list decl (all ap's are char *):
6148 f2_1 (char * ap)
6149 D.1815 = VA_ARG (&ap, 0B, 1);
6150 return D.1815;
6152 f2 (int i)
6153 char * ap.0;
6154 char * ap;
6155 __builtin_va_start (&ap, 0);
6156 ap.0 = ap;
6157 res = f2_1 (ap.0);
6158 __builtin_va_end (&ap);
6159 D.1812 = res;
6160 return D.1812;
6162 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
6163 va_list the type of the va_list param decl (case 2b, struct * ap) is not
6164 the same as for another va_list decl (case 2a, struct ap[1]).
6166 f2_1 (struct * ap)
6167 D.1844 = VA_ARG (ap, 0B, 0);
6168 return D.1844;
6170 f2 (int i)
6171 struct ap[1];
6172 __builtin_va_start (&ap, 0);
6173 res = f2_1 (&ap);
6174 __builtin_va_end (&ap);
6175 D.1841 = res;
6176 return D.1841;
6178 Case 2b is different because:
6179 - on the callee side, the parm decl has declared type va_list, but
6180 grokdeclarator changes the type of the parm decl to a pointer to the
6181 array elem type.
6182 - on the caller side, the pass-by-value uses &ap.
6184 We unify these two cases (case 2a: va_list is array type,
6185 case 2b: va_list is pointer to array elem type), by adding '&' for the
6186 array type case, such that we have a pointer to array elem in both
6187 cases. */
6190 {
6191 /* Case 2a: va_list is array type. */
6193 /* Take the address, to get '&ap'. Make sure it's a pointer to array
6194 elem type. */
6197 expr);
6199 /* Verify that &ap is still recognized as having va_list type. */
6200 tree canon_expr_type
6203 }
6204 else
6205 {
6206 /* Case 2b: va_list is pointer to array elem type. */
6210 /* Don't take the address. We've already got '&ap'. */
6211 ;
6212 }
6215 }
6218 /* Linked list of disabled built-in functions. */
6221 {
6229 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6230 begins with "__builtin_", give an error. */
6232 void
6234 {
6237 else
6238 {
6243 }
6244 }
6247 /* Return true if the built-in function NAME has been disabled, false
6248 otherwise. */
6250 static bool
6252 {
6255 {
6258 }
6260 }
6263 /* Worker for DEF_BUILTIN.
6264 Possibly define a builtin function with one or two names.
6265 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6266 nonansi_p and flag_no_nonansi_builtin. */
6268 static void
6275 {
6276 tree decl;
6289 fnattrs);
6298 }
6299 \f
6300 /* Nonzero if the type T promotes to int. This is (nearly) the
6301 integral promotions defined in ISO C99 6.3.1.1/2. */
6303 bool
6305 {
6307 {
6317 /* ??? Technically all enumerations not larger than an int
6318 promote to an int. But this is used along code paths
6319 that only want to notice a size change. */
6327 }
6328 }
6330 /* Return 1 if PARMS specifies a fixed number of parameters
6331 and none of their types is affected by default promotions. */
6333 int
6335 {
6336 const_tree t;
6338 {
6355 }
6357 }
6359 /* Recursively remove any '*' or '&' operator from TYPE. */
6360 tree
6362 {
6366 }
6368 /* Recursively remove pointer or array type from TYPE. */
6369 tree
6371 {
6375 }
6377 /* Used to compare case labels. K1 and K2 are actually tree nodes
6378 representing case labels, or NULL_TREE for a `default' label.
6379 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6380 K2, and 0 if K1 and K2 are equal. */
6382 int
6384 {
6385 /* Consider a NULL key (such as arises with a `default' label) to be
6386 smaller than anything else. */
6393 }
6395 /* Process a case label, located at LOC, for the range LOW_VALUE
6396 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6397 then this case label is actually a `default' label. If only
6398 HIGH_VALUE is NULL_TREE, then case label was declared using the
6399 usual C/C++ syntax, rather than the GNU case range extension.
6400 CASES is a tree containing all the case ranges processed so far;
6401 COND is the condition for the switch-statement itself.
6402 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6403 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6404 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6406 tree
6409 {
6410 tree type;
6411 tree label;
6412 tree case_label;
6413 splay_tree_node node;
6415 /* Create the LABEL_DECL itself. */
6418 /* If there was an error processing the switch condition, bail now
6419 before we get more confused. */
6427 {
6430 }
6432 /* Case ranges are a GNU extension. */
6439 {
6444 }
6446 {
6451 }
6454 {
6455 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6456 really a case range, even though it was written that way.
6457 Remove the HIGH_VALUE to simplify later processing. */
6462 }
6464 /* See if the case is in range of the type of the original testing
6465 expression. If both low_value and high_value are out of range,
6466 don't insert the case label and return NULL_TREE. */
6470 outside_range_p))
6473 /* Look up the LOW_VALUE in the table of case labels we already
6474 have. */
6476 /* If there was not an exact match, check for overlapping ranges.
6477 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6478 that's a `default' label and the only overlap is an exact match. */
6480 {
6481 splay_tree_node low_bound;
6482 splay_tree_node high_bound;
6484 /* Even though there wasn't an exact match, there might be an
6485 overlap between this case range and another case range.
6486 Since we've (inductively) not allowed any overlapping case
6487 ranges, we simply need to find the greatest low case label
6488 that is smaller that LOW_VALUE, and the smallest low case
6489 label that is greater than LOW_VALUE. If there is an overlap
6490 it will occur in one of these two ranges. */
6496 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6497 the LOW_VALUE, so there is no need to check unless the
6498 LOW_BOUND is in fact itself a case range. */
6504 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6505 range is bigger than the low end of the current range, so we
6506 are only interested if the current range is a real range, and
6507 not an ordinary case label. */
6509 && high_value
6511 high_value)
6514 }
6515 /* If there was an overlap, issue an error. */
6517 {
6521 {
6525 }
6527 {
6530 }
6531 else
6532 {
6536 }
6538 }
6540 /* Add a CASE_LABEL to the statement-tree. */
6542 /* Register this case label in the splay tree. */
6549 error_out:
6550 /* Add a label so that the back-end doesn't think that the beginning of
6551 the switch is unreachable. Note that we do not add a case label, as
6552 that just leads to duplicates and thence to failure later on. */
6554 {
6557 }
6559 }
6561 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6562 Used to verify that case values match up with enumerator values. */
6564 static void
6566 {
6573 else
6580 buf);
6581 else
6586 }
6588 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6589 Used to verify that case values match up with enumerator values. */
6591 static int
6593 {
6597 /* Skip default case. */
6601 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6602 when we did our enum->case scan. Reset our scratch bit after. */
6605 else
6608 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6609 not set, that means that CASE_HIGH did not appear when we did our
6610 enum->case scan. Reset our scratch bit after. */
6612 {
6615 else
6617 }
6620 }
6622 /* Handle -Wswitch*. Called from the front end after parsing the
6623 switch construct. */
6624 /* ??? Should probably be somewhere generic, since other languages
6625 besides C and C++ would want this. At the moment, however, C/C++
6626 are the only tree-ssa languages that support enumerations at all,
6627 so the point is moot. */
6629 void
6633 {
6634 splay_tree_node default_node;
6635 splay_tree_node node;
6636 tree chain;
6647 /* There are certain cases where -Wswitch-bool warnings aren't
6648 desirable, such as
6649 switch (boolean)
6650 {
6651 case true: ...
6652 case false: ...
6653 }
6654 so be careful here. */
6656 {
6657 splay_tree_node min_node;
6658 /* If there's a default node, it's also the value with the minimal
6659 key. So look at the penultimate key (if any). */
6662 else
6667 /* This might be a case range, so look at the value with the
6668 maximal key and then check CASE_HIGH. */
6673 /* If there's a case value > 1 or < 0, that is outside bool
6674 range, warn. */
6678 /* And handle the
6679 switch (boolean)
6680 {
6681 case true: ...
6682 case false: ...
6683 default: ...
6684 }
6685 case, where we want to warn. */
6686 || (default_node
6691 }
6693 /* From here on, we only care about about enumerated types. */
6697 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6701 /* Check the cases. Warn about case values which are not members of
6702 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6703 there is no default case, check that exactly all enumeration
6704 literals are covered by the cases. */
6706 /* Clearing COND if it is not an integer constant simplifies
6707 the tests inside the loop below. */
6711 /* The time complexity here is O(N*lg(N)) worst case, but for the
6712 common case of monotonically increasing enumerators, it is
6713 O(N), since the nature of the splay tree will keep the next
6714 element adjacent to the root at all times. */
6717 {
6723 {
6724 /* Mark the CASE_LOW part of the case entry as seen. */
6728 }
6730 /* Even though there wasn't an exact match, there might be a
6731 case range which includes the enumerator's value. */
6734 {
6738 {
6739 /* If we match the upper bound exactly, mark the CASE_HIGH
6740 part of the case entry as seen. */
6744 }
6745 }
6747 /* We've now determined that this enumerated literal isn't
6748 handled by the case labels of the switch statement. */
6750 /* If the switch expression is a constant, we only really care
6751 about whether that constant is handled by the switch. */
6755 /* If there is a default_node, the only relevant option is
6756 Wswitch-enum. Otherwise, if both are enabled then we prefer
6757 to warn using -Wswitch because -Wswitch is enabled by -Wall
6758 while -Wswitch-enum is explicit. */
6761 ? OPT_Wswitch_enum
6765 }
6767 /* Warn if there are case expressions that don't correspond to
6768 enumerators. This can occur since C and C++ don't enforce
6769 type-checking of assignments to enumeration variables.
6771 The time complexity here is now always O(N) worst case, since
6772 we should have marked both the lower bound and upper bound of
6773 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6774 above. This scan also resets those fields. */
6777 }
6779 /* Finish an expression taking the address of LABEL (an
6780 IDENTIFIER_NODE). Returns an expression for the address.
6782 LOC is the location for the expression returned. */
6784 tree
6786 {
6787 tree result;
6797 else
6798 {
6801 /* The current function is not necessarily uninlinable.
6802 Computed gotos are incompatible with inlining, but the value
6803 here could be used only in a diagnostic, for example. */
6805 }
6808 }
6809 \f
6811 /* Given a boolean expression ARG, return a tree representing an increment
6812 or decrement (as indicated by CODE) of ARG. The front end must check for
6813 invalid cases (e.g., decrement in C++). */
6814 tree
6816 {
6817 tree val;
6822 {
6845 }
6848 }
6849 \f
6850 /* Built-in macros for stddef.h and stdint.h, that require macros
6851 defined in this file. */
6852 void
6854 {
6917 }
6919 static void
6921 {
6922 /* Fill in the built_in_attributes array. */
6923 #define DEF_ATTR_NULL_TREE(ENUM) \
6924 built_in_attributes[(int) ENUM] = NULL_TREE;
6925 #define DEF_ATTR_INT(ENUM, VALUE) \
6926 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6927 #define DEF_ATTR_STRING(ENUM, VALUE) \
6928 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6929 #define DEF_ATTR_IDENT(ENUM, STRING) \
6930 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6931 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6932 built_in_attributes[(int) ENUM] \
6933 = tree_cons (built_in_attributes[(int) PURPOSE], \
6934 built_in_attributes[(int) VALUE], \
6935 built_in_attributes[(int) CHAIN]);
6937 #undef DEF_ATTR_NULL_TREE
6938 #undef DEF_ATTR_INT
6939 #undef DEF_ATTR_IDENT
6940 #undef DEF_ATTR_TREE_LIST
6941 }
6943 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6944 identifier as an argument, so the front end shouldn't look it up. */
6946 bool
6948 {
6951 /* Unknown attribute that we'll end up ignoring, return true so we
6952 don't complain about an identifier argument. */
6958 else
6960 }
6962 /* Attribute handlers common to C front ends. */
6964 /* Handle a "packed" attribute; arguments as in
6965 struct attribute_spec.handler. */
6967 static tree
6970 {
6972 {
6976 }
6978 {
6980 /* Still pack bitfields. */
6985 else
6987 }
6988 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6989 used for DECL_REGISTER. It wouldn't mean anything anyway.
6990 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6991 that changes what the typedef is typing. */
6992 else
6993 {
6996 }
6999 }
7001 /* Handle a "nocommon" attribute; arguments as in
7002 struct attribute_spec.handler. */
7004 static tree
7008 {
7011 else
7012 {
7015 }
7018 }
7020 /* Handle a "common" attribute; arguments as in
7021 struct attribute_spec.handler. */
7023 static tree
7026 {
7029 else
7030 {
7033 }
7036 }
7038 /* Handle a "noreturn" attribute; arguments as in
7039 struct attribute_spec.handler. */
7041 static tree
7044 {
7047 /* See FIXME comment in c_common_attribute_table. */
7054 = (build_qualified_type
7055 (build_pointer_type
7059 else
7060 {
7063 }
7066 }
7068 /* Handle a "hot" and attribute; arguments as in
7069 struct attribute_spec.handler. */
7071 static tree
7074 {
7077 {
7079 {
7083 }
7084 /* Most of the rest of the hot processing is done later with
7085 lookup_attribute. */
7086 }
7087 else
7088 {
7091 }
7094 }
7096 /* Handle a "cold" and attribute; arguments as in
7097 struct attribute_spec.handler. */
7099 static tree
7102 {
7105 {
7107 {
7111 }
7112 /* Most of the rest of the cold processing is done later with
7113 lookup_attribute. */
7114 }
7115 else
7116 {
7119 }
7122 }
7124 /* Handle a "no_sanitize_address" attribute; arguments as in
7125 struct attribute_spec.handler. */
7127 static tree
7130 {
7132 {
7135 }
7138 }
7140 /* Handle a "no_address_safety_analysis" attribute; arguments as in
7141 struct attribute_spec.handler. */
7143 static tree
7146 {
7155 }
7157 /* Handle a "no_sanitize_undefined" attribute; arguments as in
7158 struct attribute_spec.handler. */
7160 static tree
7163 {
7165 {
7168 }
7171 }
7173 /* Handle a "stack_protect" attribute; arguments as in
7174 struct attribute_spec.handler. */
7175 static tree
7178 {
7180 {
7183 }
7184 else
7190 }
7192 /* Handle a "noinline" attribute; arguments as in
7193 struct attribute_spec.handler. */
7195 static tree
7199 {
7201 {
7203 {
7207 }
7208 else
7210 }
7211 else
7212 {
7215 }
7218 }
7220 /* Handle a "noclone" attribute; arguments as in
7221 struct attribute_spec.handler. */
7223 static tree
7227 {
7229 {
7232 }
7235 }
7237 /* Handle a "no_icf" attribute; arguments as in
7238 struct attribute_spec.handler. */
7240 static tree
7244 {
7246 {
7249 }
7252 }
7255 /* Handle a "always_inline" attribute; arguments as in
7256 struct attribute_spec.handler. */
7258 static tree
7263 {
7265 {
7267 {
7271 }
7272 else
7273 /* Set the attribute and mark it for disregarding inline
7274 limits. */
7276 }
7277 else
7278 {
7281 }
7284 }
7286 /* Handle a "gnu_inline" attribute; arguments as in
7287 struct attribute_spec.handler. */
7289 static tree
7294 {
7296 {
7297 /* Do nothing else, just set the attribute. We'll get at
7298 it later with lookup_attribute. */
7299 }
7300 else
7301 {
7304 }
7307 }
7309 /* Handle a "leaf" attribute; arguments as in
7310 struct attribute_spec.handler. */
7312 static tree
7316 {
7318 {
7321 }
7323 {
7326 }
7329 }
7331 /* Handle an "artificial" attribute; arguments as in
7332 struct attribute_spec.handler. */
7334 static tree
7339 {
7341 {
7342 /* Do nothing else, just set the attribute. We'll get at
7343 it later with lookup_attribute. */
7344 }
7345 else
7346 {
7349 }
7352 }
7354 /* Handle a "flatten" attribute; arguments as in
7355 struct attribute_spec.handler. */
7357 static tree
7359 tree args ATTRIBUTE_UNUSED,
7361 {
7363 /* Do nothing else, just set the attribute. We'll get at
7364 it later with lookup_attribute. */
7365 ;
7366 else
7367 {
7370 }
7373 }
7375 /* Handle a "warning" or "error" attribute; arguments as in
7376 struct attribute_spec.handler. */
7378 static tree
7381 {
7384 /* Do nothing else, just set the attribute. We'll get at
7385 it later with lookup_attribute. */
7386 ;
7387 else
7388 {
7391 }
7394 }
7396 /* Handle a "used" attribute; arguments as in
7397 struct attribute_spec.handler. */
7399 static tree
7402 {
7408 {
7413 }
7414 else
7415 {
7418 }
7421 }
7423 /* Handle a "unused" attribute; arguments as in
7424 struct attribute_spec.handler. */
7426 static tree
7429 {
7431 {
7438 {
7442 }
7443 else
7444 {
7447 }
7448 }
7449 else
7450 {
7454 }
7457 }
7459 /* Handle a "externally_visible" attribute; arguments as in
7460 struct attribute_spec.handler. */
7462 static tree
7467 {
7471 {
7474 {
7478 }
7479 }
7480 else
7481 {
7484 }
7487 }
7489 /* Handle the "no_reorder" attribute. Arguments as in
7490 struct attribute_spec.handler. */
7492 static tree
7494 tree name,
7495 tree,
7498 {
7503 {
7506 name);
7508 }
7511 }
7513 /* Handle a "const" attribute; arguments as in
7514 struct attribute_spec.handler. */
7516 static tree
7519 {
7522 /* See FIXME comment on noreturn in c_common_attribute_table. */
7528 = (build_qualified_type
7529 (build_pointer_type
7533 else
7534 {
7537 }
7540 }
7542 /* Handle a "transparent_union" attribute; arguments as in
7543 struct attribute_spec.handler. */
7545 static tree
7549 {
7550 tree type;
7561 {
7562 /* Make sure that the first field will work for a transparent union.
7563 If the type isn't complete yet, leave the check to the code in
7564 finish_struct. */
7566 {
7572 }
7575 {
7576 /* If the type isn't complete yet, setting the flag
7577 on a variant wouldn't ever be checked. */
7581 /* build_duplicate_type doesn't work for C++. */
7585 /* A type variant isn't good enough, since we don't a cast
7586 to such a type removed as a no-op. */
7588 }
7592 }
7594 ignored:
7597 }
7599 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7600 get the requested priority for a constructor or destructor,
7601 possibly issuing diagnostics for invalid or reserved
7602 priorities. */
7604 static priority_type
7606 {
7607 HOST_WIDE_INT pri;
7608 tree arg;
7614 {
7617 else
7620 }
7637 {
7640 "destructor priorities from 0 to %d are reserved "
7642 MAX_RESERVED_INIT_PRIORITY);
7643 else
7645 "constructor priorities from 0 to %d are reserved "
7647 MAX_RESERVED_INIT_PRIORITY);
7648 }
7651 invalid:
7654 MAX_INIT_PRIORITY);
7655 else
7657 MAX_INIT_PRIORITY);
7659 }
7661 /* Handle a "constructor" attribute; arguments as in
7662 struct attribute_spec.handler. */
7664 static tree
7668 {
7675 {
7676 priority_type priority;
7681 }
7682 else
7683 {
7686 }
7689 }
7691 /* Handle a "destructor" attribute; arguments as in
7692 struct attribute_spec.handler. */
7694 static tree
7698 {
7705 {
7706 priority_type priority;
7711 }
7712 else
7713 {
7716 }
7719 }
7721 /* Nonzero if the mode is a valid vector mode for this architecture.
7722 This returns nonzero even if there is no hardware support for the
7723 vector mode, but we can emulate with narrower modes. */
7725 static int
7727 {
7729 machine_mode innermode;
7731 /* Doh! What's going on? */
7740 /* Hardware support. Woo hoo! */
7746 /* We should probably return 1 if requesting V4DI and we have no DI,
7747 but we have V2DI, but this is probably very unlikely. */
7749 /* If we have support for the inner mode, we can safely emulate it.
7750 We may not have V2DI, but me can emulate with a pair of DIs. */
7752 }
7755 /* Handle a "mode" attribute; arguments as in
7756 struct attribute_spec.handler. */
7758 static tree
7761 {
7769 else
7770 {
7775 tree typefm;
7780 {
7786 }
7788 /* Change this type to have a type with the specified mode.
7789 First check for the special modes. */
7802 else
7805 {
7808 }
7811 {
7814 }
7818 {
7850 }
7852 {
7855 }
7858 {
7863 {
7866 }
7870 else
7873 }
7874 else
7875 {
7876 /* For fixed-point modes, we need to test if the signness of type
7877 and the machine mode are consistent. */
7880 {
7883 }
7884 /* For fixed-point modes, we need to pass saturating info. */
7888 }
7891 {
7894 }
7896 {
7897 /* For enumeral types, copy the precision from the integer
7898 type returned above. If not an INTEGER_TYPE, we can't use
7899 this mode for this type. */
7901 {
7904 }
7907 {
7910 }
7911 else
7912 {
7913 /* We cannot build a type variant, as there's code that assumes
7914 that TYPE_MAIN_VARIANT has the same mode. This includes the
7915 debug generators. Instead, create a subrange type. This
7916 results in all of the enumeral values being emitted only once
7917 in the original, and the subtype gets them by reference. */
7920 else
7923 }
7924 }
7928 {
7931 }
7934 }
7937 }
7939 /* Handle a "section" attribute; arguments as in
7940 struct attribute_spec.handler. */
7942 static tree
7945 {
7949 {
7953 }
7958 {
7961 }
7964 {
7967 }
7972 {
7976 }
7978 /* The decl may have already been given a section attribute
7979 from a previous declaration. Ensure they match. */
7983 {
7986 }
7991 {
7994 }
7999 fail:
8002 }
8004 /* Check whether ALIGN is a valid user-specified alignment. If so,
8005 return its base-2 log; if not, output an error and return -1. If
8006 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
8007 no error. */
8008 int
8010 {
8017 {
8020 }
8025 {
8028 }
8030 {
8033 }
8035 }
8037 /*
8038 If in c++-11, check if the c++-11 alignment constraint with respect
8039 to fundamental alignment (in [dcl.align]) are satisfied. If not in
8040 c++-11 mode, does nothing.
8042 [dcl.align]2/ says:
8044 [* if the constant expression evaluates to a fundamental alignment,
8045 the alignment requirement of the declared entity shall be the
8046 specified fundamental alignment.
8048 * if the constant expression evaluates to an extended alignment
8049 and the implementation supports that alignment in the context
8050 of the declaration, the alignment of the declared entity shall
8051 be that alignment
8053 * if the constant expression evaluates to an extended alignment
8054 and the implementation does not support that alignment in the
8055 context of the declaration, the program is ill-formed]. */
8057 static bool
8061 {
8074 {
8076 {
8077 /* For file scope variables and static members, the target
8078 supports alignments that are at most
8079 MAX_OFILE_ALIGNMENT. */
8082 }
8083 else
8084 {
8085 #ifdef BIGGEST_FIELD_ALIGNMENT
8086 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
8087 #else
8088 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
8089 #endif
8090 /* For non-static members, the target supports either
8091 alignments that at most either BIGGEST_FIELD_ALIGNMENT
8092 if it is defined or BIGGEST_ALIGNMENT. */
8097 #undef MAX_TARGET_FIELD_ALIGNMENT
8098 /* For stack variables, the target supports at most
8099 MAX_STACK_ALIGNMENT. */
8103 }
8104 }
8106 {
8107 /* Let's be liberal for types. */
8110 }
8118 }
8120 /* Handle a "aligned" attribute; arguments as in
8121 struct attribute_spec.handler. */
8123 static tree
8126 {
8130 tree align_expr;
8134 {
8139 }
8140 else
8144 {
8148 }
8156 {
8159 /* If we have a TYPE_DECL, then copy the type, so that we
8160 don't accidentally modify a builtin type. See pushdecl. */
8163 {
8170 }
8171 else
8176 }
8179 {
8182 }
8185 /* C++-11 [dcl.align/4]:
8187 When multiple alignment-specifiers are specified for an
8188 entity, the alignment requirement shall be set to the
8189 strictest specified alignment.
8191 This formally comes from the c++11 specification but we are
8192 doing it for the GNU attribute syntax as well. */
8196 {
8201 else
8205 }
8206 else
8207 {
8210 }
8213 }
8215 /* Handle a "weak" attribute; arguments as in
8216 struct attribute_spec.handler. */
8218 static tree
8223 {
8226 {
8229 }
8231 {
8235 }
8237 {
8242 }
8243 else
8247 }
8249 /* Handle a "noplt" attribute; arguments as in
8250 struct attribute_spec.handler. */
8252 static tree
8257 {
8259 {
8264 }
8266 }
8268 /* Handle an "alias" or "ifunc" attribute; arguments as in
8269 struct attribute_spec.handler, except that IS_ALIAS tells us
8270 whether this is an alias as opposed to ifunc attribute. */
8272 static tree
8275 {
8280 {
8283 }
8287 /* A static variable declaration is always a tentative definition,
8288 but the alias is a non-tentative definition which overrides. */
8291 {
8295 }
8299 {
8303 }
8305 /* Note that the very first time we process a nested declaration,
8306 decl_function_context will not be set. Indeed, *would* never
8307 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8308 we do below. After such frobbery, pushdecl would set the context.
8309 In any case, this is never what we want. */
8311 {
8312 tree id;
8316 {
8320 }
8322 /* This counts as a use of the object pointed to. */
8327 else
8331 /* ifuncs are also aliases, so set that attribute too. */
8334 }
8335 else
8336 {
8339 }
8342 {
8345 {
8348 else
8350 }
8351 }
8355 }
8357 /* Handle an "alias" or "ifunc" attribute; arguments as in
8358 struct attribute_spec.handler. */
8360 static tree
8363 {
8365 }
8367 /* Handle an "alias" or "ifunc" attribute; arguments as in
8368 struct attribute_spec.handler. */
8370 static tree
8373 {
8375 }
8377 /* Handle a "weakref" attribute; arguments as in struct
8378 attribute_spec.handler. */
8380 static tree
8383 {
8386 /* We must ignore the attribute when it is associated with
8387 local-scoped decls, since attribute alias is ignored and many
8388 such symbols do not even have a DECL_WEAK field. */
8390 || current_function_decl
8392 {
8396 }
8399 {
8403 }
8405 /* The idea here is that `weakref("name")' mutates into `weakref,
8406 alias("name")', and weakref without arguments, in turn,
8407 implicitly adds weak. */
8410 {
8417 }
8418 else
8419 {
8424 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8425 and that isn't supported; and because it wants to add it to
8426 the list of weak decls, which isn't helpful. */
8428 }
8431 {
8435 }
8438 }
8440 /* Handle an "visibility" attribute; arguments as in
8441 struct attribute_spec.handler. */
8443 static tree
8447 {
8453 {
8457 {
8459 name);
8461 }
8463 {
8467 }
8468 }
8470 {
8473 }
8476 {
8479 }
8481 /* If this is a type, set the visibility on the type decl. */
8483 {
8488 {
8490 name);
8492 }
8493 }
8503 else
8504 {
8505 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8507 }
8511 {
8525 }
8530 /* Go ahead and attach the attribute to the node as well. This is needed
8531 so we can determine whether we have VISIBILITY_DEFAULT because the
8532 visibility was not specified, or because it was explicitly overridden
8533 from the containing scope. */
8536 }
8538 /* Determine the ELF symbol visibility for DECL, which is either a
8539 variable or a function. It is an error to use this function if a
8540 definition of DECL is not available in this translation unit.
8541 Returns true if the final visibility has been determined by this
8542 function; false if the caller is free to make additional
8543 modifications. */
8545 bool
8547 {
8550 /* If the user explicitly specified the visibility with an
8551 attribute, honor that. DECL_VISIBILITY will have been set during
8552 the processing of the attribute. We check for an explicit
8553 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8554 to distinguish the use of an attribute from the use of a "#pragma
8555 GCC visibility push(...)"; in the latter case we still want other
8556 considerations to be able to overrule the #pragma. */
8558 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8563 /* Set default visibility to whatever the user supplied with
8564 visibility_specified depending on #pragma GCC visibility. */
8566 {
8569 {
8572 /* If visibility changed and DECL already has DECL_RTL, ensure
8573 symbol flags are updated. */
8578 }
8579 }
8581 }
8583 /* Handle an "tls_model" attribute; arguments as in
8584 struct attribute_spec.handler. */
8586 static tree
8589 {
8590 tree id;
8597 {
8600 }
8605 {
8608 }
8618 else
8619 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8623 }
8625 /* Handle a "no_instrument_function" attribute; arguments as in
8626 struct attribute_spec.handler. */
8628 static tree
8633 {
8637 {
8641 }
8642 else
8646 }
8648 /* Handle a "malloc" attribute; arguments as in
8649 struct attribute_spec.handler. */
8651 static tree
8654 {
8658 else
8659 {
8662 }
8665 }
8667 /* Handle a "alloc_size" attribute; arguments as in
8668 struct attribute_spec.handler. */
8670 static tree
8673 {
8676 {
8683 || !arg_count
8685 {
8690 }
8691 }
8693 }
8695 /* Handle a "alloc_align" attribute; arguments as in
8696 struct attribute_spec.handler. */
8698 static tree
8701 {
8708 || !arg_count
8710 {
8715 }
8717 }
8719 /* Handle a "assume_aligned" attribute; arguments as in
8720 struct attribute_spec.handler. */
8722 static tree
8725 {
8727 {
8734 {
8739 }
8740 }
8742 }
8744 /* Handle a "fn spec" attribute; arguments as in
8745 struct attribute_spec.handler. */
8747 static tree
8751 {
8756 }
8758 /* Handle a "bnd_variable_size" attribute; arguments as in
8759 struct attribute_spec.handler. */
8761 static tree
8764 {
8766 {
8769 }
8772 }
8774 /* Handle a "bnd_legacy" attribute; arguments as in
8775 struct attribute_spec.handler. */
8777 static tree
8780 {
8782 {
8785 }
8788 }
8790 /* Handle a "bnd_instrument" attribute; arguments as in
8791 struct attribute_spec.handler. */
8793 static tree
8796 {
8798 {
8801 }
8804 }
8806 /* Handle a "warn_unused" attribute; arguments as in
8807 struct attribute_spec.handler. */
8809 static tree
8811 tree args ATTRIBUTE_UNUSED,
8813 {
8815 /* Do nothing else, just set the attribute. We'll get at
8816 it later with lookup_attribute. */
8817 ;
8818 else
8819 {
8822 }
8825 }
8827 /* Handle an "omp declare simd" attribute; arguments as in
8828 struct attribute_spec.handler. */
8830 static tree
8832 {
8834 }
8836 /* Handle an "omp declare target" attribute; arguments as in
8837 struct attribute_spec.handler. */
8839 static tree
8841 {
8843 }
8845 /* Handle a "returns_twice" attribute; arguments as in
8846 struct attribute_spec.handler. */
8848 static tree
8851 {
8854 else
8855 {
8858 }
8861 }
8863 /* Handle a "no_limit_stack" attribute; arguments as in
8864 struct attribute_spec.handler. */
8866 static tree
8871 {
8875 {
8879 }
8881 {
8885 }
8886 else
8890 }
8892 /* Handle a "pure" attribute; arguments as in
8893 struct attribute_spec.handler. */
8895 static tree
8898 {
8901 /* ??? TODO: Support types. */
8902 else
8903 {
8906 }
8909 }
8911 /* Digest an attribute list destined for a transactional memory statement.
8912 ALLOWED is the set of attributes that are allowed for this statement;
8913 return the attribute we parsed. Multiple attributes are never allowed. */
8915 int
8917 {
8922 {
8930 {
8933 }
8936 {
8939 }
8942 else
8944 }
8947 }
8949 /* Transform a TM attribute name into a maskable integer and back.
8950 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8951 to how the lack of an attribute is treated. */
8953 int
8955 {
8969 }
8971 tree
8973 {
8976 {
8994 }
8996 }
8998 /* Return the first TM attribute seen in LIST. */
9000 tree
9002 {
9004 {
9008 }
9010 }
9012 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
9013 Here we accept only function types, and verify that none of the other
9014 function TM attributes are also applied. */
9015 /* ??? We need to accept class types for C++, but not C. This greatly
9016 complicates this function, since we can no longer rely on the extra
9017 processing given by function_type_required. */
9019 static tree
9022 {
9023 /* Only one path adds the attribute; others don't. */
9027 {
9030 /* Only tm_callable and tm_safe apply to classes. */
9033 /* FALLTHRU */
9037 {
9040 ;
9043 else
9045 }
9049 {
9052 {
9057 }
9058 }
9059 /* FALLTHRU */
9062 /* If a function is next, pass it on to be tried next. */
9066 ignored:
9069 }
9072 }
9074 /* Handle the TM_WRAP attribute; arguments as in
9075 struct attribute_spec.handler. */
9077 static tree
9080 {
9083 /* We don't need the attribute even on success, since we
9084 record the entry in an external table. */
9089 else
9090 {
9093 ;
9097 else
9098 {
9102 {
9106 else
9108 }
9109 else
9111 }
9112 }
9115 }
9117 /* Ignore the given attribute. Used when this attribute may be usefully
9118 overridden by the target, but is not used generically. */
9120 static tree
9124 {
9127 }
9129 /* Handle a "no vops" attribute; arguments as in
9130 struct attribute_spec.handler. */
9132 static tree
9136 {
9140 }
9142 /* Handle a "deprecated" attribute; arguments as in
9143 struct attribute_spec.handler. */
9145 static tree
9149 {
9157 {
9160 }
9163 {
9174 else
9176 }
9178 {
9183 }
9184 else
9188 {
9191 {
9197 }
9200 else
9202 }
9205 }
9207 /* Handle a "vector_size" attribute; arguments as in
9208 struct attribute_spec.handler. */
9210 static tree
9214 {
9216 machine_mode orig_mode;
9227 {
9230 }
9232 /* Get the vector size (in bytes). */
9235 /* We need to provide for vector pointers, vector arrays, and
9236 functions returning vectors. For example:
9238 __attribute__((vector_size(16))) short *foo;
9240 In this case, the mode is SI, but the type being modified is
9241 HI, so we need to look further. */
9250 /* Get the mode of the type being modified. */
9261 {
9264 }
9267 {
9270 }
9273 {
9276 }
9278 /* Calculate how many units fit in the vector. */
9281 {
9284 }
9288 /* Build back pointers if needed. */
9292 }
9294 /* Handle the "nonnull" attribute. */
9295 static tree
9299 {
9303 /* If no arguments are specified, all pointer arguments should be
9304 non-null. Verify a full prototype is given so that the arguments
9305 will have the correct types when we actually check them later. */
9307 {
9309 {
9312 }
9314 }
9316 /* Argument list specified. Verify that each argument number references
9317 a pointer argument. */
9319 {
9328 {
9333 }
9336 {
9337 function_args_iterator iter;
9338 tree argument;
9342 {
9346 }
9350 {
9355 }
9358 {
9363 }
9364 }
9365 }
9368 }
9370 /* Check the argument list of a function call for null in argument slots
9371 that are marked as requiring a non-null pointer argument. The NARGS
9372 arguments are passed in the array ARGARRAY.
9373 */
9375 static void
9377 {
9378 tree a;
9386 /* See if any of the nonnull attributes has no arguments. If so,
9387 then every pointer argument is checked (in which case the check
9388 for pointer type is done in check_nonnull_arg). */
9390 do
9398 else
9399 {
9400 /* Walk the argument list. If we encounter an argument number we
9401 should check for non-null, do it. */
9403 {
9405 {
9409 }
9414 }
9415 }
9416 }
9418 /* Check that the Nth argument of a function call (counting backwards
9419 from the end) is a (pointer)0. The NARGS arguments are passed in the
9420 array ARGARRAY. */
9422 static void
9424 {
9428 {
9431 tree sentinel;
9432 function_args_iterator iter;
9433 tree t;
9435 /* Skip over the named arguments. */
9437 {
9440 len++;
9441 }
9444 {
9447 }
9449 /* The sentinel must be one of the varargs, i.e.
9450 in position >= the number of fixed arguments. */
9452 {
9456 }
9458 /* Validate the sentinel. */
9462 /* Although __null (in C++) is only an integer we allow it
9463 nevertheless, as we are guaranteed that it's exactly
9464 as wide as a pointer, and we don't want to force
9465 users to cast the NULL they have written there.
9466 We warn with -Wstrict-null-sentinel, though. */
9469 }
9470 }
9472 /* Helper for check_function_nonnull; given a list of operands which
9473 must be non-null in ARGS, determine if operand PARAM_NUM should be
9474 checked. */
9476 static bool
9478 {
9482 {
9489 }
9491 }
9493 /* Check that the function argument PARAM (which is operand number
9494 PARAM_NUM) is non-null. This is called by check_function_nonnull
9495 via check_function_arguments_recurse. */
9497 static void
9500 {
9501 /* Just skip checking the argument if it's not a pointer. This can
9502 happen if the "nonnull" attribute was given without an operand
9503 list (which means to check every pointer argument). */
9511 }
9513 /* Helper for nonnull attribute handling; fetch the operand number
9514 from the attribute argument list. */
9516 static bool
9518 {
9519 /* Verify the arg number is a small constant. */
9521 {
9524 }
9525 else
9527 }
9529 /* Handle a "nothrow" attribute; arguments as in
9530 struct attribute_spec.handler. */
9532 static tree
9535 {
9538 /* ??? TODO: Support types. */
9539 else
9540 {
9543 }
9546 }
9548 /* Handle a "cleanup" attribute; arguments as in
9549 struct attribute_spec.handler. */
9551 static tree
9554 {
9558 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9559 for global destructors in C++. This requires infrastructure that
9560 we don't have generically at the moment. It's also not a feature
9561 we'd be missing too much, since we do have attribute constructor. */
9563 {
9567 }
9569 /* Verify that the argument is a function in scope. */
9570 /* ??? We could support pointers to functions here as well, if
9571 that was considered desirable. */
9574 {
9578 }
9581 {
9585 }
9587 /* That the function has proper type is checked with the
9588 eventual call to build_function_call. */
9591 }
9593 /* Handle a "warn_unused_result" attribute. No special handling. */
9595 static tree
9599 {
9600 /* Ignore the attribute for functions not returning any value. */
9602 {
9605 }
9608 }
9610 /* Handle a "sentinel" attribute. */
9612 static tree
9615 {
9617 {
9621 }
9622 else
9623 {
9625 {
9629 }
9630 }
9633 {
9641 {
9645 }
9646 else
9647 {
9649 {
9653 }
9654 }
9655 }
9658 }
9660 /* Handle a "type_generic" attribute. */
9662 static tree
9666 {
9667 /* Ensure we have a function type. */
9670 /* Ensure we have a variadic function. */
9674 }
9676 /* Handle a "target" attribute. */
9678 static tree
9681 {
9682 /* Ensure we have a function type. */
9684 {
9687 }
9689 flags))
9693 }
9695 /* Arguments being collected for optimization. */
9700 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9701 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9702 false for #pragma GCC optimize. */
9704 bool
9706 {
9714 tree ap;
9716 /* Build up argv vector. Just in case the string is stored away, use garbage
9717 collected strings. */
9722 {
9726 {
9730 }
9733 {
9734 /* Split string into multiple substrings. */
9742 {
9749 {
9753 }
9754 else
9755 {
9758 }
9762 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9763 options. */
9765 {
9770 else
9774 }
9777 {
9780 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9781 itself is -Os, and any other switch begins with a -f. */
9787 }
9792 }
9794 }
9795 }
9805 /* Now parse the options. */
9815 /* Don't allow changing -fstrict-aliasing. */
9820 }
9822 /* For handling "optimize" attribute. arguments as in
9823 struct attribute_spec.handler. */
9825 static tree
9828 {
9829 /* Ensure we have a function type. */
9831 {
9834 }
9835 else
9836 {
9840 /* Save current options. */
9843 /* If we previously had some optimization options, use them as the
9844 default. */
9849 /* Parse options, and update the vector. */
9854 /* Restore current options. */
9856 }
9859 }
9861 /* Handle a "no_split_stack" attribute. */
9863 static tree
9868 {
9872 {
9876 }
9878 {
9882 }
9885 }
9887 /* Handle a "returns_nonnull" attribute; arguments as in
9888 struct attribute_spec.handler. */
9890 static tree
9893 {
9894 // Even without a prototype we still have a return type we can check.
9896 {
9899 }
9901 }
9903 /* Handle a "designated_init" attribute; arguments as in
9904 struct attribute_spec.handler. */
9906 static tree
9909 {
9911 {
9914 }
9916 }
9918 \f
9919 /* Check for valid arguments being passed to a function with FNTYPE.
9920 There are NARGS arguments in the array ARGARRAY. */
9921 void
9923 {
9924 /* Check for null being passed in a pointer argument that must be
9925 non-null. We also need to do this if format checking is enabled. */
9930 /* Check for errors in format strings. */
9937 }
9939 /* Generic argument checking recursion routine. PARAM is the argument to
9940 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9941 once the argument is resolved. CTX is context for the callback. */
9942 void
9947 {
9951 {
9952 /* Strip coercion. */
9956 }
9959 {
9961 tree attrs;
9964 /* See if this is a call to a known internationalization function
9965 that modifies a format arg. Such a function may have multiple
9966 format_arg attributes (for example, ngettext). */
9969 attrs;
9972 {
9973 tree inner_arg;
9974 tree format_num_expr;
9977 call_expr_arg_iterator iter;
9979 /* Extract the argument number, which was previously checked
9980 to be valid. */
9989 {
9994 }
9995 }
9997 /* If we found a format_arg attribute and did a recursive check,
9998 we are done with checking this argument. Otherwise, we continue
9999 and this will be considered a non-literal. */
10002 }
10005 {
10006 /* Check both halves of the conditional expression. */
10012 }
10015 }
10017 /* Checks for a builtin function FNDECL that the number of arguments
10018 NARGS against the required number REQUIRED and issues an error if
10019 there is a mismatch. Returns true if the number of arguments is
10020 correct, otherwise false. */
10022 static bool
10024 {
10026 {
10030 }
10032 {
10036 }
10038 }
10040 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
10041 Returns false if there was an error, otherwise true. */
10043 bool
10045 {
10051 {
10061 {
10063 {
10067 }
10069 }
10079 {
10086 {
10090 }
10092 }
10097 {
10102 {
10106 }
10109 {
10111 fndecl);
10113 }
10115 }
10120 {
10122 {
10125 }
10127 }
10134 {
10138 {
10142 }
10145 {
10149 }
10151 }
10156 }
10157 }
10159 /* Function to help qsort sort FIELD_DECLs by name order. */
10161 int
10163 {
10168 /* A nontype is "greater" than a type. */
10177 }
10180 gt_pointer_operator new_value;
10184 /* This routine compares two fields like field_decl_cmp but using the
10185 pointer operator in resort_data. */
10187 static int
10189 {
10194 /* A nontype is "greater" than a type. */
10200 {
10207 }
10209 }
10211 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10213 void
10216 gt_pointer_operator new_value,
10218 {
10223 resort_field_decl_cmp);
10224 }
10226 /* Subroutine of c_parse_error.
10227 Return the result of concatenating LHS and RHS. RHS is really
10228 a string literal, its first character is indicated by RHS_START and
10229 RHS_SIZE is its length (including the terminating NUL character).
10231 The caller is responsible for deleting the returned pointer. */
10235 {
10241 }
10243 /* Issue the error given by GMSGID, indicating that it occurred before
10244 TOKEN, which had the associated VALUE. */
10246 void
10249 {
10250 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10261 {
10266 {
10282 }
10286 else
10292 }
10315 {
10320 }
10328 {
10333 }
10334 else
10338 {
10341 }
10342 #undef catenate_messages
10343 }
10345 /* Return the gcc option code associated with the reason for a cpp
10346 message, or 0 if none. */
10348 static int
10350 {
10354 {
10357 }
10359 }
10361 /* Callback from cpp_error for PFILE to print diagnostics from the
10362 preprocessor. The diagnostic is of type LEVEL, with REASON set
10363 to the reason code if LEVEL is represents a warning, at location
10364 LOCATION unless this is after lexing and the compiler's location
10365 should be used instead, with column number possibly overridden by
10366 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10367 the arguments. Returns true if a diagnostic was emitted, false
10368 otherwise. */
10370 bool
10374 {
10375 diagnostic_info diagnostic;
10376 diagnostic_t dlevel;
10381 {
10386 /* Fall through. */
10411 }
10424 }
10426 /* Convert a character from the host to the target execution character
10427 set. cpplib handles this, mostly. */
10429 HOST_WIDE_INT
10431 {
10432 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10433 zero-extended under -fno-signed-char. cpplib insists that characters
10434 and character constants are always unsigned. Hence we must convert
10435 back and forth. */
10443 else
10445 }
10447 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10448 references with an INDIRECT_REF of a constant at the bottom; much like the
10449 traditional rendering of offsetof as a macro. Return the folded result. */
10451 tree
10453 {
10457 {
10473 {
10476 }
10486 {
10490 }
10503 /* Check if the offset goes beyond the upper bound of the array. */
10505 {
10511 {
10515 {
10516 tree v;
10523 {
10531 }
10532 /* Don't warn if the array might be considered a poor
10533 man's flexible array member with a very permissive
10534 definition thereof. */
10538 "index %E denotes an offset "
10541 }
10542 }
10543 }
10550 /* Handle static members of volatile structs. */
10557 }
10560 }
10562 /* Likewise, but convert it to the return type of offsetof. */
10564 tree
10566 {
10568 }
10570 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10571 expression, because B will always be true. */
10573 void
10575 {
10578 "the omitted middle operand in ?: will always be %<true%>, "
10580 }
10582 /* Give an error for storing into ARG, which is 'const'. USE indicates
10583 how ARG was being used. */
10585 void
10587 {
10590 /* Using this macro rather than (for example) arrays of messages
10591 ensures that all the format strings are checked at compile
10592 time. */
10593 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10594 : (use == lv_increment ? (I) \
10595 : (use == lv_decrement ? (D) : (AS))))
10597 {
10608 else
10614 }
10620 arg);
10626 arg);
10628 {
10638 arg);
10639 }
10645 arg);
10646 else
10651 arg);
10652 }
10654 /* Print an error message for an invalid lvalue. USE says
10655 how the lvalue is being used and so selects the error message. LOC
10656 is the location for the error. */
10658 void
10660 {
10662 {
10680 }
10681 }
10683 /* Print an error message for an invalid indirection of type TYPE.
10684 ERRSTRING is the name of the operator for the indirection. */
10686 void
10688 {
10690 {
10698 type);
10703 type);
10708 type);
10713 type);
10718 type);
10722 }
10723 }
10724 \f
10725 /* *PTYPE is an incomplete array. Complete it with a domain based on
10726 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10727 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10728 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10730 int
10732 {
10740 {
10742 {
10743 int eltsize
10746 }
10748 {
10752 {
10756 }
10757 else
10758 {
10759 tree curindex;
10770 {
10774 else
10775 {
10777 {
10778 /* Since we treat size types now as ordinary
10779 unsigned types, we need an explicit overflow
10780 check. */
10784 }
10786 size_one_node);
10787 }
10790 }
10792 {
10796 }
10797 }
10798 }
10799 else
10800 {
10801 /* Make an error message unless that happened already. */
10804 }
10805 }
10806 else
10807 {
10811 }
10818 else
10821 /* Using build_distinct_type_copy and modifying things afterward instead
10822 of using build_array_type to create a new type preserves all of the
10823 TYPE_LANG_FLAG_? bits that the front end may have set. */
10831 /* Make sure we have the canonical MAIN_TYPE. */
10834 hashcode);
10837 /* Fix the canonical type. */
10847 else
10852 else
10858 {
10860 /* If we proceed with the array type as it is, we'll eventually
10861 crash in tree_to_[su]hwi(). */
10863 }
10867 }
10869 /* Like c_mark_addressable but don't check register qualifier. */
10870 void
10872 {
10878 }
10881 \f
10882 /* Used to help initialize the builtin-types.def table. When a type of
10883 the correct size doesn't exist, use error_mark_node instead of NULL.
10884 The later results in segfaults even when a decl using the type doesn't
10885 get invoked. */
10887 tree
10889 {
10892 }
10894 /* A helper function for resolve_overloaded_builtin in resolving the
10895 overloaded __sync_ builtins. Returns a positive power of 2 if the
10896 first operand of PARAMS is a pointer to a supported data type.
10897 Returns 0 if an error is encountered. */
10899 static int
10901 {
10902 tree type;
10906 {
10909 }
10913 {
10914 /* Force array-to-pointer decay for C++. */
10918 }
10930 incompatible:
10933 }
10935 /* A helper function for resolve_overloaded_builtin. Adds casts to
10936 PARAMS to make arguments match up with those of FUNCTION. Drops
10937 the variadic arguments at the end. Returns false if some error
10938 was encountered; true on success. */
10940 static bool
10943 {
10944 function_args_iterator iter;
10945 tree ptype;
10949 /* We've declared the implementation functions to use "volatile void *"
10950 as the pointer parameter, so we shouldn't get any complaints from the
10951 call to check_function_arguments what ever type the user used. */
10956 /* For the rest of the values, we need to cast these to FTYPE, so that we
10957 don't get warnings for passing pointer types, etc. */
10960 {
10964 /* XXX void_type_node belies the abstraction. */
10970 {
10973 }
10975 /* Only convert parameters if arg_type is unsigned integer type with
10976 new format sync routines, i.e. don't attempt to convert pointer
10977 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10978 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10979 kinds). */
10981 {
10982 /* Ideally for the first conversion we'd use convert_for_assignment
10983 so that we get warnings for anything that doesn't match the pointer
10984 type. This isn't portable across the C and C++ front ends atm. */
10989 }
10992 }
10994 /* __atomic routines are not variadic. */
10996 {
10999 }
11001 /* The definition of these primitives is variadic, with the remaining
11002 being "an optional list of variables protected by the memory barrier".
11003 No clue what that's supposed to mean, precisely, but we consider all
11004 call-clobbered variables to be protected so we're safe. */
11008 }
11010 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11011 RESULT to make it match the type of the first pointer argument in
11012 PARAMS. */
11014 static tree
11016 {
11021 /* New format doesn't require casting unless the types are the same size. */
11024 else
11026 }
11028 /* This function verifies the PARAMS to generic atomic FUNCTION.
11029 It returns the size if all the parameters are the same size, otherwise
11030 0 is returned if the parameters are invalid. */
11032 static int
11035 {
11040 tree type_0;
11042 /* Determine the parameter makeup. */
11044 {
11060 }
11063 {
11066 }
11068 /* Get type of first parameter, and determine its size. */
11071 {
11072 /* Force array-to-pointer decay for C++. */
11076 }
11078 {
11080 function);
11082 }
11084 /* Types must be compile time constant sizes. */
11086 {
11089 function);
11091 }
11095 /* Zero size objects are not allowed. */
11097 {
11100 function);
11102 }
11104 /* Check each other parameter is a pointer and the same size. */
11106 {
11109 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11113 {
11115 function);
11117 }
11121 {
11123 function);
11125 }
11126 }
11128 /* Check memory model parameters for validity. */
11130 {
11133 {
11136 {
11139 function);
11140 }
11141 }
11142 else
11144 {
11146 function);
11148 }
11149 }
11152 }
11155 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11156 at the beginning of the parameter list PARAMS representing the size of the
11157 objects. This is to match the library ABI requirement. LOC is the location
11158 of the function call.
11159 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11160 returned to allow the external call to be constructed. */
11162 static tree
11165 {
11166 tree size_node;
11168 /* Insert a SIZE_T parameter as the first param. If there isn't
11169 enough space, allocate a new vector and recursively re-build with that. */
11171 {
11174 tree f;
11184 }
11186 /* Add the size parameter and leave as a function call for processing. */
11190 }
11193 /* Return whether atomic operations for naturally aligned N-byte
11194 arguments are supported, whether inline or through libatomic. */
11195 static bool
11197 {
11199 {
11211 }
11212 }
11214 /* This will process an __atomic_exchange function call, determine whether it
11215 needs to be mapped to the _N variation, or turned into a library call.
11216 LOC is the location of the builtin call.
11217 FUNCTION is the DECL that has been invoked;
11218 PARAMS is the argument list for the call. The return value is non-null
11219 TRUE is returned if it is translated into the proper format for a call to the
11220 external library, and NEW_RETURN is set the tree for that function.
11221 FALSE is returned if processing for the _N variation is required, and
11222 NEW_RETURN is set to the the return value the result is copied into. */
11223 static bool
11226 {
11231 /* Size of 0 is an error condition. */
11233 {
11236 }
11238 /* If not a lock-free size, change to the library generic format. */
11240 {
11243 }
11245 /* Otherwise there is a lockfree match, transform the call from:
11246 void fn(T* mem, T* desired, T* return, model)
11247 into
11248 *return = (T) (fn (In* mem, (In) *desired, model)) */
11255 /* Create pointer to appropriate size. */
11259 /* Convert object pointer to required type. */
11262 /* Convert new value to required type, and dereference it. */
11267 /* Move memory model to the 3rd position, and end param list. */
11271 /* Convert return pointer and dereference it for later assignment. */
11275 }
11278 /* This will process an __atomic_compare_exchange function call, determine
11279 whether it needs to be mapped to the _N variation, or turned into a lib call.
11280 LOC is the location of the builtin call.
11281 FUNCTION is the DECL that has been invoked;
11282 PARAMS is the argument list for the call. The return value is non-null
11283 TRUE is returned if it is translated into the proper format for a call to the
11284 external library, and NEW_RETURN is set the tree for that function.
11285 FALSE is returned if processing for the _N variation is required. */
11287 static bool
11291 {
11296 /* Size of 0 is an error condition. */
11298 {
11301 }
11303 /* If not a lock-free size, change to the library generic format. */
11305 {
11306 /* The library generic format does not have the weak parameter, so
11307 remove it from the param list. Since a parameter has been removed,
11308 we can be sure that there is room for the SIZE_T parameter, meaning
11309 there will not be a recursive rebuilding of the parameter list, so
11310 there is no danger this will be done twice. */
11312 {
11316 }
11319 }
11321 /* Otherwise, there is a match, so the call needs to be transformed from:
11322 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11323 into
11324 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11330 /* Create pointer to appropriate size. */
11334 /* Convert object pointer to required type. */
11338 /* Convert expected pointer to required type. */
11342 /* Convert desired value to required type, and dereference it. */
11347 /* The rest of the parameters are fine. NULL means no special return value
11348 processing.*/
11351 }
11354 /* This will process an __atomic_load function call, determine whether it
11355 needs to be mapped to the _N variation, or turned into a library call.
11356 LOC is the location of the builtin call.
11357 FUNCTION is the DECL that has been invoked;
11358 PARAMS is the argument list for the call. The return value is non-null
11359 TRUE is returned if it is translated into the proper format for a call to the
11360 external library, and NEW_RETURN is set the tree for that function.
11361 FALSE is returned if processing for the _N variation is required, and
11362 NEW_RETURN is set to the the return value the result is copied into. */
11364 static bool
11367 {
11372 /* Size of 0 is an error condition. */
11374 {
11377 }
11379 /* If not a lock-free size, change to the library generic format. */
11381 {
11384 }
11386 /* Otherwise, there is a match, so the call needs to be transformed from:
11387 void fn(T* mem, T* return, model)
11388 into
11389 *return = (T) (fn ((In *) mem, model)) */
11395 /* Create pointer to appropriate size. */
11399 /* Convert object pointer to required type. */
11403 /* Move memory model to the 2nd position, and end param list. */
11407 /* Convert return pointer and dereference it for later assignment. */
11411 }
11414 /* This will process an __atomic_store function call, determine whether it
11415 needs to be mapped to the _N variation, or turned into a library call.
11416 LOC is the location of the builtin call.
11417 FUNCTION is the DECL that has been invoked;
11418 PARAMS is the argument list for the call. The return value is non-null
11419 TRUE is returned if it is translated into the proper format for a call to the
11420 external library, and NEW_RETURN is set the tree for that function.
11421 FALSE is returned if processing for the _N variation is required, and
11422 NEW_RETURN is set to the the return value the result is copied into. */
11424 static bool
11427 {
11432 /* Size of 0 is an error condition. */
11434 {
11437 }
11439 /* If not a lock-free size, change to the library generic format. */
11441 {
11444 }
11446 /* Otherwise, there is a match, so the call needs to be transformed from:
11447 void fn(T* mem, T* value, model)
11448 into
11449 fn ((In *) mem, (In) *value, model) */
11454 /* Create pointer to appropriate size. */
11458 /* Convert object pointer to required type. */
11462 /* Convert new value to required type, and dereference it. */
11467 /* The memory model is in the right spot already. Return is void. */
11471 }
11474 /* Some builtin functions are placeholders for other expressions. This
11475 function should be called immediately after parsing the call expression
11476 before surrounding code has committed to the type of the expression.
11478 LOC is the location of the builtin call.
11480 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11481 PARAMS is the argument list for the call. The return value is non-null
11482 when expansion is complete, and null if normal processing should
11483 continue. */
11485 tree
11488 {
11494 {
11500 else
11504 }
11506 /* Handle BUILT_IN_NORMAL here. */
11508 {
11513 {
11514 /* Handle these 4 together so that they can fall through to the next
11515 case if the call is transformed to an _N variant. */
11517 {
11519 {
11523 /* Change to the _N variant. */
11526 }
11529 {
11531 params,
11534 /* Change to the _N variant. */
11537 }
11539 {
11543 /* Change to the _N variant. */
11546 }
11548 {
11552 /* Change to the _N variant. */
11555 }
11558 }
11559 /* Fallthrough to the normal processing. */
11560 }
11577 {
11579 /* Fallthru for parameter processing. */
11580 }
11597 {
11608 orig_format))
11613 NULL);
11621 /* If new_return is set, assign function to that expr and cast the
11622 result to void since the generic interface returned void. */
11624 {
11625 /* Cast function result from I{1,2,4,8,16} to the required type. */
11628 result);
11632 }
11634 }
11638 }
11639 }
11641 /* vector_types_compatible_elements_p is used in type checks of vectors
11642 values used as operands of binary operators. Where it returns true, and
11643 the other checks of the caller succeed (being vector types in he first
11644 place, and matching number of elements), we can just treat the types
11645 as essentially the same.
11646 Contrast with vector_targets_convertible_p, which is used for vector
11647 pointer types, and vector_types_convertible_p, which will allow
11648 language-specific matches under the control of flag_lax_vector_conversions,
11649 and might still require a conversion. */
11650 /* True if vector types T1 and T2 can be inputs to the same binary
11651 operator without conversion.
11652 We don't check the overall vector size here because some of our callers
11653 want to give different error messages when the vectors are compatible
11654 except for the element count. */
11656 bool
11658 {
11671 /* Equality works here because c_common_signed_type uses
11672 TYPE_MAIN_VARIANT. */
11680 }
11682 /* Check for missing format attributes on function pointers. LTYPE is
11683 the new type or left-hand side type. RTYPE is the old type or
11684 right-hand side type. Returns TRUE if LTYPE is missing the desired
11685 attribute. */
11687 bool
11689 {
11691 tree ra;
11697 {
11698 tree la;
11703 }
11704 else
11706 }
11708 /* Subscripting with type char is likely to lose on a machine where
11709 chars are signed. So warn on any machine, but optionally. Don't
11710 warn for unsigned char since that type is safe. Don't warn for
11711 signed char because anyone who uses that must have done so
11712 deliberately. Furthermore, we reduce the false positive load by
11713 warning only for non-constant value of type char. */
11715 void
11717 {
11722 }
11724 /* Implement -Wparentheses for the unexpected C precedence rules, to
11725 cover cases like x + y << z which readers are likely to
11726 misinterpret. We have seen an expression in which CODE is a binary
11727 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11728 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11729 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11730 expression was not formed using a binary or unary operator, or it
11731 was enclosed in parentheses. */
11733 void
11737 {
11741 /* This macro tests that the expression ARG with original tree code
11742 CODE appears to be a boolean expression. or the result of folding a
11743 boolean expression. */
11744 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11745 (truth_value_p (TREE_CODE (ARG)) \
11746 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11748 || ((CODE) != INTEGER_CST \
11749 && (integer_onep (ARG) || integer_zerop (ARG))))
11752 {
11801 /* Check cases like x|y==z */
11808 /* Check cases like !x | y */
11812 "suggest parentheses around operand of "
11825 /* Check cases like x^y==z */
11847 /* Check cases like x&y==z */
11854 /* Check cases like !x & y */
11858 "suggest parentheses around operand of "
11881 {
11886 "comparisons like %<X<=Y<=Z%> do not "
11892 "comparisons like %<X<=Y<=Z%> do not "
11894 }
11896 }
11897 #undef NOT_A_BOOLEAN_EXPR_P
11898 }
11900 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11902 void
11904 {
11906 {
11909 else
11911 }
11912 }
11914 /* Warn for division by zero according to the value of DIVISOR. LOC
11915 is the location of the division operator. */
11917 void
11919 {
11920 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11921 about division by zero. Do not issue a warning if DIVISOR has a
11922 floating-point type, since we consider 0.0/0.0 a valid way of
11923 generating a NaN. */
11927 }
11929 /* Subroutine of build_binary_op. Give warnings for comparisons
11930 between signed and unsigned quantities that may fail. Do the
11931 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11932 so that casts will be considered, but default promotions won't
11933 be.
11935 LOCATION is the location of the comparison operator.
11937 The arguments of this function map directly to local variables
11938 of build_binary_op. */
11940 void
11945 {
11950 /* In C++, check for comparison of different enum types. */
11956 {
11960 }
11962 /* Do not warn if the comparison is being done in a signed type,
11963 since the signed type will only be chosen if it can represent
11964 all the values of the unsigned type. */
11967 /* Do not warn if both operands are unsigned. */
11970 else
11971 {
11977 else
11985 /* Do not warn if the signed quantity is an unsuffixed integer
11986 literal (or some static constant expression involving such
11987 literals or a conditional expression involving such literals)
11988 and it is non-negative. */
11991 /* Do not warn if the comparison is an equality operation, the
11992 unsigned quantity is an integral constant, and it would fit
11993 in the result if the result were signed. */
11998 /* In C, do not warn if the unsigned quantity is an enumeration
11999 constant and its maximum value would fit in the result if the
12000 result were signed. */
12006 else
12008 OPT_Wsign_compare,
12010 }
12012 /* Warn if two unsigned values are being compared in a size larger
12013 than their original size, and one (and only one) is the result of
12014 a `~' operator. This comparison will always fail.
12016 Also warn if one operand is a constant, and the constant does not
12017 have all bits set that are set in the ~ operand when it is
12018 extended. */
12025 {
12032 {
12033 tree primop;
12039 {
12043 }
12044 else
12045 {
12049 }
12054 {
12057 {
12061 else
12064 }
12065 }
12066 }
12074 }
12075 }
12077 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12078 type via c_common_type. If -Wdouble-promotion is in use, and the
12079 conditions for warning have been met, issue a warning. GMSGID is
12080 the warning message. It must have two %T specifiers for the type
12081 that was converted (generally "float") and the type to which it was
12082 converted (generally "double), respectively. LOC is the location
12083 to which the awrning should refer. */
12085 void
12088 {
12089 tree source_type;
12093 /* If the conversion will not occur at run-time, there is no need to
12094 warn about it. */
12106 else
12109 }
12111 /* Possibly warn about unused parameters. */
12113 void
12115 {
12116 tree decl;
12125 }
12128 /* Setup a TYPE_DECL node as a typedef representation.
12130 X is a TYPE_DECL for a typedef statement. Create a brand new
12131 ..._TYPE node (which will be just a variant of the existing
12132 ..._TYPE node with identical properties) and then install X
12133 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12135 The whole point here is to end up with a situation where each
12136 and every ..._TYPE node the compiler creates will be uniquely
12137 associated with AT MOST one node representing a typedef name.
12138 This way, even though the compiler substitutes corresponding
12139 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12140 early on, later parts of the compiler can always do the reverse
12141 translation and get back the corresponding typedef name. For
12142 example, given:
12144 typedef struct S MY_TYPE;
12145 MY_TYPE object;
12147 Later parts of the compiler might only know that `object' was of
12148 type `struct S' if it were not for code just below. With this
12149 code however, later parts of the compiler see something like:
12151 struct S' == struct S
12152 typedef struct S' MY_TYPE;
12153 struct S' object;
12155 And they can then deduce (from the node for type struct S') that
12156 the original object declaration was:
12158 MY_TYPE object;
12160 Being able to do this is important for proper support of protoize,
12161 and also for generating precise symbolic debugging information
12162 which takes full account of the programmer's (typedef) vocabulary.
12164 Obviously, we don't want to generate a duplicate ..._TYPE node if
12165 the TYPE_DECL node that we are now processing really represents a
12166 standard built-in type. */
12168 void
12170 {
12174 {
12177 }
12180 {
12188 }
12189 }
12191 /* Record the types used by the current global variable declaration
12192 being parsed, so that we can decide later to emit their debug info.
12193 Those types are in types_used_by_cur_var_decl, and we are going to
12194 store them in the types_used_by_vars_hash hash table.
12195 DECL is the declaration of the global variable that has been parsed. */
12197 void
12199 {
12203 {
12206 }
12207 }
12209 /* If DECL is a typedef that is declared in the current function,
12210 record it for the purpose of -Wunused-local-typedefs. */
12212 void
12214 {
12219 /* if this is not a locally defined typedef then we are not
12220 interested. */
12227 }
12229 /* If T is a TYPE_DECL declared locally, mark it as used. */
12231 void
12233 {
12238 }
12240 /* Warn if there are some unused locally defined typedefs in the
12241 current function. */
12243 void
12245 {
12247 tree decl;
12248 /* The number of times we have emitted -Wunused-local-typedefs
12249 warnings. If this is different from errorcount, that means some
12250 unrelated errors have been issued. In which case, we'll avoid
12251 emitting "unused-local-typedefs" warnings. */
12263 {
12267 OPT_Wunused_local_typedefs,
12270 }
12273 }
12275 /* Warn about boolean expression compared with an integer value different
12276 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12277 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12278 are the operands of the comparison. The caller must ensure that
12279 either operand is a boolean expression. */
12281 void
12283 tree op1)
12284 {
12294 {
12302 else
12305 }
12307 {
12308 /* If the non-constant operand isn't of a boolean type, we
12309 don't want to warn here. */
12311 /* Handle booleans promoted to integers. */
12319 /* Do some magic to get the right diagnostics. */
12328 }
12329 }
12331 /* The C and C++ parsers both use vectors to hold function arguments.
12332 For efficiency, we keep a cache of unused vectors. This is the
12333 cache. */
12338 /* Return a new vector from the cache. If the cache is empty,
12339 allocate a new vector. These vectors are GC'ed, so it is OK if the
12340 pointer is not released.. */
12344 {
12347 else
12348 {
12349 /* Passing 0 to vec::alloc returns NULL, and our callers require
12350 that we always return a non-NULL value. The vector code uses
12351 4 when growing a NULL vector, so we do too. */
12355 }
12356 }
12358 /* Release a vector of trees back to the cache. */
12360 void
12362 {
12364 {
12367 }
12368 }
12370 /* Get a new tree vector holding a single tree. */
12374 {
12378 }
12380 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12384 {
12389 }
12391 /* Get a new tree vector which is a copy of an existing one. */
12395 {
12398 tree t;
12405 }
12407 /* Return true if KEYWORD starts a type specifier. */
12409 bool
12411 {
12413 {
12447 }
12448 }
12450 /* Return true if KEYWORD names a type qualifier. */
12452 bool
12454 {
12456 {
12464 }
12465 }
12467 /* Return true if KEYWORD names a storage class specifier.
12469 RID_TYPEDEF is not included in this list despite `typedef' being
12470 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12471 such for syntactic convenience only. */
12473 bool
12475 {
12477 {
12487 }
12488 }
12490 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12492 static bool
12494 {
12496 {
12504 }
12505 }
12507 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12508 declaration-specifier (C99 6.7). */
12510 bool
12512 {
12519 {
12526 }
12527 }
12529 /* Initialize language-specific-bits of tree_contains_struct. */
12531 void
12533 {
12537 }
12539 /* Build a user-defined numeric literal out of an integer constant type VALUE
12540 with identifier SUFFIX. */
12542 tree
12545 {
12552 }
12554 /* For vector[index], convert the vector to a
12555 pointer of the underlying type. Return true if the resulting
12556 ARRAY_REF should not be an lvalue. */
12558 bool
12561 {
12564 {
12566 tree type1;
12575 {
12580 {
12583 *vecp
12586 non_const);
12587 }
12588 else
12593 }
12594 else
12601 {
12602 /* If the original vector isn't declared may_alias and it
12603 isn't a bare vector look if the subscripting would
12604 alias the vector we subscript, and if not, force ref-all. */
12610 }
12614 }
12616 }
12618 /* Determine which of the operands, if any, is a scalar that needs to be
12619 converted to a vector, for the range of operations. */
12620 enum stv_conv
12623 {
12631 {
12632 /* Most GENERIC binary expressions require homogeneous arguments.
12633 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12634 argument that is a vector and a second one that is a scalar, so
12635 we never return stv_secondarg for them. */
12640 {
12642 {
12647 }
12648 else
12650 }
12657 /* ... fall through ... */
12678 /* What about UNLT_EXPR? */
12680 {
12684 }
12688 {
12690 {
12695 }
12697 }
12699 /* Allow integer --> real conversion if safe. */
12703 {
12705 {
12710 }
12712 }
12715 }
12718 }
12720 /* Return true iff ALIGN is an integral constant that is a fundamental
12721 alignment, as defined by [basic.align] in the c++-11
12722 specifications.
12724 That is:
12726 [A fundamental alignment is represented by an alignment less than or
12727 equal to the greatest alignment supported by the implementation
12728 in all contexts, which is equal to
12729 alignof(max_align_t)]. */
12731 bool
12733 {
12736 }
12738 /* Return true if T is a pointer to a zero-sized aggregate. */
12740 bool
12742 {
12747 }