| blob | 12f7de36c4e922e6a72a53f49dbb625038a54af1 |
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
70 /* The following symbols are subsumed in the c_global_trees array, and
71 listed here individually for documentation purposes.
73 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
75 tree short_integer_type_node;
76 tree long_integer_type_node;
77 tree long_long_integer_type_node;
79 tree short_unsigned_type_node;
80 tree long_unsigned_type_node;
81 tree long_long_unsigned_type_node;
83 tree truthvalue_type_node;
84 tree truthvalue_false_node;
85 tree truthvalue_true_node;
87 tree ptrdiff_type_node;
89 tree unsigned_char_type_node;
90 tree signed_char_type_node;
91 tree wchar_type_node;
93 tree char16_type_node;
94 tree char32_type_node;
96 tree float_type_node;
97 tree double_type_node;
98 tree long_double_type_node;
100 tree complex_integer_type_node;
101 tree complex_float_type_node;
102 tree complex_double_type_node;
103 tree complex_long_double_type_node;
105 tree dfloat32_type_node;
106 tree dfloat64_type_node;
107 tree_dfloat128_type_node;
109 tree intQI_type_node;
110 tree intHI_type_node;
111 tree intSI_type_node;
112 tree intDI_type_node;
113 tree intTI_type_node;
115 tree unsigned_intQI_type_node;
116 tree unsigned_intHI_type_node;
117 tree unsigned_intSI_type_node;
118 tree unsigned_intDI_type_node;
119 tree unsigned_intTI_type_node;
121 tree widest_integer_literal_type_node;
122 tree widest_unsigned_literal_type_node;
124 Nodes for types `void *' and `const void *'.
126 tree ptr_type_node, const_ptr_type_node;
128 Nodes for types `char *' and `const char *'.
130 tree string_type_node, const_string_type_node;
132 Type `char[SOMENUMBER]'.
133 Used when an array of char is needed and the size is irrelevant.
135 tree char_array_type_node;
137 Type `wchar_t[SOMENUMBER]' or something like it.
138 Used when a wide string literal is created.
140 tree wchar_array_type_node;
142 Type `char16_t[SOMENUMBER]' or something like it.
143 Used when a UTF-16 string literal is created.
145 tree char16_array_type_node;
147 Type `char32_t[SOMENUMBER]' or something like it.
148 Used when a UTF-32 string literal is created.
150 tree char32_array_type_node;
152 Type `int ()' -- used for implicit declaration of functions.
154 tree default_function_type;
156 A VOID_TYPE node, packaged in a TREE_LIST.
158 tree void_list_node;
160 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
161 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
162 VAR_DECLS, but C++ does.)
164 tree function_name_decl_node;
165 tree pretty_function_name_decl_node;
166 tree c99_function_name_decl_node;
168 Stack of nested function name VAR_DECLs.
170 tree saved_function_name_decls;
172 */
175 \f
176 /* Switches common to the C front ends. */
178 /* Nonzero means don't output line number information. */
182 /* Nonzero causes -E output not to be done, but directives such as
183 #define that have side effects are still obeyed. */
187 /* Nonzero means dump macros in some fashion. */
191 /* Nonzero means pass #include lines through to the output. */
195 /* Nonzero means process PCH files while preprocessing. */
199 /* The file name to which we should write a precompiled header, or
200 NULL if no header will be written in this compile. */
204 /* Nonzero if an ISO standard was selected. It rejects macros in the
205 user's namespace. */
208 /* C/ObjC language option variables. */
211 /* Nonzero means allow type mismatches in conditional expressions;
212 just make their values `void'. */
216 /* Nonzero means enable C89 Amendment 1 features. */
220 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
224 /* Nonzero means use the ISO C11 dialect of C. */
228 /* Nonzero means that we have builtin functions, and main is an int. */
233 /* ObjC language option variables. */
236 /* Tells the compiler that this is a special run. Do not perform any
237 compiling, instead we are to test some platform dependent features
238 and output a C header file with appropriate definitions. */
242 /* Tells the compiler what is the constant string class for ObjC. */
247 /* C++ language option variables. */
250 /* Nonzero means generate separate instantiation control files and
251 juggle them at link time. */
255 /* The C++ dialect being used. C++11 is the default. */
259 /* Maximum template instantiation depth. This limit exists to limit the
260 time it takes to notice excessively recursive template instantiations.
262 The default is lower than the 1024 recommended by the C++0x standard
263 because G++ runs out of stack before 1024 with highly recursive template
264 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
268 /* The elements of `ridpointers' are identifier nodes for the reserved
269 type names and storage classes. It is indexed by a RID_... value. */
274 /* Nonzero means don't warn about problems that occur when the code is
275 executed. */
278 /* Whether we are building a boolean conversion inside
279 convert_for_assignment, or some other late binary operation. If
280 build_binary_op is called for C (from code shared by C and C++) in
281 this case, then the operands have already been folded and the
282 result will not be folded again, so C_MAYBE_CONST_EXPR should not
283 be generated. */
286 /* Whether lexing has been completed, so subsequent preprocessor
287 errors should use the compiler's input_location. */
290 /* Information about how a function name is generated. */
291 struct fname_var_t
292 {
296 };
298 /* The three ways of getting then name of the current function. */
301 {
302 /* C99 compliant __func__, must be first. */
304 /* GCC __FUNCTION__ compliant. */
306 /* GCC __PRETTY_FUNCTION__ compliant. */
309 };
311 /* Global visibility options. */
410 /* Reserved words. The third field is a mask: keywords are disabled
411 if they match the mask.
413 Masks for languages:
414 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
415 C --std=c99: D_CXXONLY | D_OBJC
416 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
417 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
418 C++ --std=c0x: D_CONLY | D_OBJC
419 ObjC++ is like C++ except that D_OBJC is not set
421 If -fno-asm is used, D_ASM is added to the mask. If
422 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
423 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
424 In C with -Wc++-compat, we warn if D_CXXWARN is set.
426 Note the complication of the D_CXX_OBJC keywords. These are
427 reserved words such as 'class'. In C++, 'class' is a reserved
428 word. In Objective-C++ it is too. In Objective-C, it is a
429 reserved word too, but only if it follows an '@' sign.
430 */
432 {
599 /* Concepts-related keywords */
603 /* These Objective-C keywords are recognized only immediately after
604 an '@'. */
621 /* These are recognized only in protocol-qualifier context
622 (see above) */
629 /* These are recognized inside a property attribute list */
638 };
643 /* Table of machine-independent attributes common to all C-like languages.
645 All attributes referencing arguments should be additionally processed
646 in chkp_copy_function_type_adding_bounds for correct instrumentation
647 by Pointer Bounds Checker.
648 Current list of processed common attributes: nonnull. */
650 {
651 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
652 affects_type_identity } */
659 /* FIXME: logically, noreturn attributes should be listed as
660 "false, true, true" and apply to function types. But implementing this
661 would require all the places in the compiler that use TREE_THIS_VOLATILE
662 on a decl to identify non-returning functions to be located and fixed
663 to check the function type instead. */
694 /* The same comments as for noreturn attributes apply to const ones. */
718 handle_no_instrument_function_attribute,
736 /* ??? These two attributes didn't make the transition from the
737 Intel language document to the multi-vendor language document. */
742 /* For internal use (marking of builtins) only. The name contains space
743 to prevent its usage in source code. */
765 /* For internal use (marking of builtins) only. The name contains space
766 to prevent its usage in source code. */
777 handle_no_address_safety_analysis_attribute,
780 handle_no_sanitize_address_attribute,
783 handle_no_sanitize_address_attribute,
786 handle_no_sanitize_undefined_attribute,
796 /* For internal use only. The leading '*' both prevents its usage in
797 source code and signals that it may be overridden by machine tables. */
802 /* For internal use (marking of builtins and runtime functions) only.
803 The name contains space to prevent its usage in source code. */
829 };
831 /* Give the specifications for the format attributes, used by C and all
832 descendants.
834 All attributes referencing arguments should be additionally processed
835 in chkp_copy_function_type_adding_bounds for correct instrumentation
836 by Pointer Bounds Checker.
837 Current list of processed format attributes: format, format_arg. */
839 {
840 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
841 affects_type_identity } */
847 };
849 /* Return identifier for address space AS. */
853 {
857 }
859 /* Push current bindings for the function name VAR_DECLS. */
861 void
863 {
868 {
872 {
874 saved);
876 }
877 }
879 /* Normally they'll have been NULL, so only push if we've got a
880 stack, or they are non-NULL. */
882 saved_function_name_decls);
883 }
885 /* Finish up the current bindings, adding them into the current function's
886 statement tree. This must be done _before_ finish_stmt_tree is called.
887 If there is no current function, we must be at file scope and no statements
888 are involved. Pop the previous bindings. */
890 void
892 {
901 {
909 }
915 {
916 /* We had saved values, restore them. */
917 tree saved;
920 {
925 }
927 }
929 }
931 /* Return the text name of the current function, suitably prettified
932 by PRETTY_P. Return string must be freed by caller. */
936 {
943 {
946 }
959 {
962 }
965 }
967 /* Return the VAR_DECL for a const char array naming the current
968 function. If the VAR_DECL has not yet been created, create it
969 now. RID indicates how it should be formatted and IDENTIFIER_NODE
970 ID is its name (unfortunately C and C++ hold the RID values of
971 keywords in different places, so we can't derive RID from ID in
972 this language independent code. LOC is the location of the
973 function. */
975 tree
977 {
987 {
988 /* If a tree is built here, it would normally have the lineno of
989 the current statement. Later this tree will be moved to the
990 beginning of the function and this line number will be wrong.
991 To avoid this problem set the lineno to 0 here; that prevents
992 it from appearing in the RTL. */
993 tree stmts;
1001 saved_function_name_decls
1005 }
1010 }
1012 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1014 tree
1016 {
1021 /* Compute the number of elements, for the array type. */
1023 {
1026 }
1028 {
1031 }
1033 {
1036 }
1037 else
1038 {
1041 }
1043 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1044 limit in C++98 Annex B is very large (65536) and is not normative,
1045 so we do not diagnose it (warn_overlength_strings is forced off
1046 in c_common_post_options). */
1048 {
1052 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1053 separate the %d from the 'C'. 'ISO' should not be
1054 translated, but it may be moved after 'C%d' in languages
1055 where modifiers follow nouns. */
1057 "string length %qd is greater than the length %qd "
1060 }
1062 /* Create the array type for the string constant. The ISO C++
1063 standard says that a string literal has type `const char[N]' or
1064 `const wchar_t[N]'. We use the same logic when invoked as a C
1065 front-end with -Wwrite-strings.
1066 ??? We should change the type of an expression depending on the
1067 state of a warning flag. We should just be warning -- see how
1068 this is handled in the C++ front-end for the deprecated implicit
1069 conversion from string literals to `char*' or `wchar_t*'.
1071 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1072 array type being the unqualified version of that type.
1073 Therefore, if we are constructing an array of const char, we must
1074 construct the matching unqualified array type first. The C front
1075 end does not require this, but it does no harm, so we do it
1076 unconditionally. */
1087 }
1088 \f
1089 /* If DISABLE is true, stop issuing warnings. This is used when
1090 parsing code that we know will not be executed. This function may
1091 be called multiple times, and works as a stack. */
1093 static void
1095 {
1097 {
1100 }
1101 }
1103 /* If ENABLE is true, reenable issuing warnings. */
1105 static void
1107 {
1109 {
1112 }
1113 }
1115 /* Fully fold EXPR, an expression that was not folded (beyond integer
1116 constant expressions and null pointer constants) when being built
1117 up. If IN_INIT, this is in a static initializer and certain
1118 changes are made to the folding done. Clear *MAYBE_CONST if
1119 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1120 expression because it contains an evaluated operator (in C99) or an
1121 operator outside of sizeof returning an integer constant (in C90)
1122 not permitted in constant expressions, or because it contains an
1123 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1124 set to true by callers before calling this function.) Return the
1125 folded expression. Function arguments have already been folded
1126 before calling this function, as have the contents of SAVE_EXPR,
1127 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1128 C_MAYBE_CONST_EXPR. */
1130 tree
1132 {
1133 tree ret;
1139 /* This function is not relevant to C++ because C++ folds while
1140 parsing, and may need changes to be correct for C++ when C++
1141 stops folding while parsing. */
1148 {
1151 }
1158 }
1160 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1161 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1162 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1163 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1164 both evaluated and unevaluated subexpressions while
1165 *MAYBE_CONST_ITSELF is carried from only evaluated
1166 subexpressions). */
1168 static tree
1171 {
1183 /* This function is not relevant to C++ because C++ folds while
1184 parsing, and may need changes to be correct for C++ when C++
1185 stops folding while parsing. */
1189 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1190 anything else not counted as an expression cannot usefully be
1191 folded further at this point. */
1197 /* Operands of variable-length expressions (function calls) have
1198 already been folded, as have __builtin_* function calls, and such
1199 expressions cannot occur in constant expressions. */
1201 {
1205 }
1208 {
1217 else
1220 }
1222 /* Assignment, increment, decrement, function call and comma
1223 operators, and statement expressions, cannot occur in constant
1224 expressions if evaluated / outside of sizeof. (Function calls
1225 were handled above, though VA_ARG_EXPR is treated like a function
1226 call here, and statement expressions are handled through
1227 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1229 {
1249 }
1251 /* Fold individual tree codes as appropriate. */
1253 {
1255 /* Any non-constancy will have been marked in a containing
1256 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1264 maybe_const_itself);
1269 {
1272 }
1281 maybe_const_itself);
1284 maybe_const_itself);
1290 {
1294 }
1336 /* Binary operations evaluating both arguments (increment and
1337 decrement are binary internally in GCC). */
1341 maybe_const_itself);
1349 /* The RHS of a MODIFY_EXPR was fully folded when building that
1350 expression for the sake of conversion warnings. */
1353 maybe_const_itself);
1357 ret = in_init
1360 else
1373 {
1384 }
1401 CASE_CONVERT:
1412 /* Unary operations. */
1415 maybe_const_itself);
1419 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1420 not prepared to deal with them if they occur in initializers. */
1428 ret = in_init
1431 else
1436 {
1440 }
1442 {
1445 CASE_CONVERT:
1446 /* Don't warn about explicit conversions. We will already
1447 have warned about suspect implicit conversions. */
1454 }
1459 /* Binary operations not necessarily evaluating both
1460 arguments. */
1467 ? truthvalue_false_node
1475 ret = in_init
1478 else
1483 && op0_const
1484 && op0_const_self
1490 && op0_const_self
1516 else
1521 && op0_const
1522 && op0_const_self
1526 && op0_const_self
1530 && op0_const
1531 && op0_const_self
1535 && op0_const_self
1541 /* Each case where an operand with excess precision may be
1542 encountered must remove the EXCESS_PRECISION_EXPR around
1543 inner operands and possibly put one around the whole
1544 expression or possibly convert to the semantic type (which
1545 c_fully_fold does); we cannot tell at this stage which is
1546 appropriate in any particular case. */
1550 /* Various codes may appear through folding built-in functions
1551 and their arguments. */
1553 }
1555 out:
1556 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1557 have been done by this point, so remove them again. */
1561 {
1565 }
1569 }
1571 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1572 return EXP. Otherwise, return either EXP or its known constant
1573 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1574 Is the BLKmode test appropriate? */
1576 tree
1578 {
1579 tree ret;
1581 /* This function is only used by C, for c_fully_fold and other
1582 optimization, and may not be correct for C++. */
1593 /* Avoid unwanted tree sharing between the initializer and current
1594 function's body where the tree can be modified e.g. by the
1595 gimplifier. */
1599 }
1601 /* Print a warning if a constant expression had overflow in folding.
1602 Invoke this function on every expression that the language
1603 requires to be a constant expression.
1604 Note the ANSI C standard says it is erroneous for a
1605 constant expression to overflow. */
1607 void
1609 {
1617 }
1619 /* The same as above but print an unconditional error. */
1620 void
1622 {
1629 }
1631 /* Print a warning if an expression had overflow in folding and its
1632 operands hadn't.
1634 Invoke this function on every expression that
1635 (1) appears in the source code, and
1636 (2) is a constant expression that overflowed, and
1637 (3) is not already checked by convert_and_check;
1638 however, do not invoke this function on operands of explicit casts
1639 or when the expression is the result of an operator and any operand
1640 already overflowed. */
1642 void
1644 {
1649 {
1678 }
1679 }
1681 /* Warn about uses of logical || / && operator in a context where it
1682 is likely that the bitwise equivalent was intended by the
1683 programmer. We have seen an expression in which CODE is a binary
1684 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1685 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1686 void
1690 {
1702 /* Warn if &&/|| are being used in a context where it is
1703 likely that the bitwise equivalent was intended by the
1704 programmer. That is, an expression such as op && MASK
1705 where op should not be any boolean expression, nor a
1706 constant, and mask seems to be a non-boolean integer constant. */
1714 {
1718 else
1723 }
1725 /* We do not warn for constants because they are typical of macro
1726 expansions that test for features. */
1730 /* This warning only makes sense with logical operands. */
1737 /* The range computations only work with scalars. */
1742 /* We first test whether either side separately is trivially true
1743 (with OR) or trivially false (with AND). If so, do not warn.
1744 This is a common idiom for testing ranges of data types in
1745 portable code. */
1752 /* If this is an OR operation, invert both sides; now, the result
1753 should be always false to get a warning. */
1767 /* If this is an OR operation, invert both sides; now, the result
1768 should be always false to get a warning. */
1776 /* If both expressions have the same operand, if we can merge the
1777 ranges, and if the range test is always false, then warn. */
1784 {
1787 "logical %<or%> "
1789 else
1791 "logical %<and%> "
1793 }
1794 }
1796 /* Warn about logical not used on the left hand side operand of a comparison.
1797 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1798 Do not warn if RHS is of a boolean type. */
1800 void
1802 tree rhs)
1803 {
1809 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1810 !(x == 0) or !(y != 0). */
1816 "logical not is only applied to the left hand side of "
1818 }
1820 /* Warn if EXP contains any computations whose results are not used.
1821 Return true if a warning is printed; false otherwise. LOCUS is the
1822 (potential) location of the expression. */
1824 bool
1826 {
1827 restart:
1831 /* Don't warn about void constructs. This includes casting to void,
1832 void function calls, and statement expressions with a final cast
1833 to void. */
1841 {
1857 /* For a binding, warn if no side effect within it. */
1869 /* In && or ||, warn if 2nd operand has no side effect. */
1876 /* Let people do `(foo (), 0)' without a warning. */
1883 /* If this is an expression with side effects, don't warn; this
1884 case commonly appears in macro expansions. */
1890 /* Don't warn about automatic dereferencing of references, since
1891 the user cannot control it. */
1893 {
1896 }
1897 /* Fall through. */
1900 /* Referencing a volatile value is a side effect, so don't warn. */
1905 /* If this is an expression which has no operands, there is no value
1906 to be unused. There are no such language-independent codes,
1907 but front ends may define such. */
1911 warn:
1913 }
1914 }
1917 /* Print a warning about casts that might indicate violation
1918 of strict aliasing rules if -Wstrict-aliasing is used and
1919 strict aliasing mode is in effect. OTYPE is the original
1920 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1922 bool
1924 {
1925 /* Strip pointer conversion chains and get to the correct original type. */
1933 /* If the type we are casting to is a ref-all pointer
1934 dereferencing it is always valid. */
1941 {
1942 /* Casting the address of an object to non void pointer. Warn
1943 if the cast breaks type based aliasing. */
1945 {
1949 }
1950 else
1951 {
1952 /* warn_strict_aliasing >= 3. This includes the default (3).
1953 Only warn if the cast is dereferenced immediately. */
1954 alias_set_type set1 =
1960 {
1964 }
1967 {
1971 }
1972 }
1973 }
1974 else
1976 {
1977 /* At this level, warn for any conversions, even if an address is
1978 not taken in the same statement. This will likely produce many
1979 false positives, but could be useful to pinpoint problems that
1980 are not revealed at higher levels. */
1985 {
1989 }
1990 }
1993 }
1995 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1996 sizeof as last operand of certain builtins. */
1998 void
2002 {
2006 location_t loc;
2014 {
2018 /* FALLTHRU */
2026 /* FALLTHRU */
2085 }
2113 {
2117 {
2120 "argument to %<sizeof%> in %qD call is the same "
2121 "expression as the destination; did you mean to "
2127 "argument to %<sizeof%> in %qD call is the same "
2128 "expression as the destination; did you mean to "
2130 else
2132 "argument to %<sizeof%> in %qD call is the same "
2133 "expression as the destination; did you mean to "
2136 }
2139 && !strop
2142 {
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "pointer type %qT as the destination; expected %qT "
2149 }
2150 }
2153 {
2157 {
2160 "argument to %<sizeof%> in %qD call is the same "
2161 "expression as the source; did you mean to "
2167 "argument to %<sizeof%> in %qD call is the same "
2168 "expression as the source; did you mean to "
2170 else
2172 "argument to %<sizeof%> in %qD call is the same "
2173 "expression as the source; did you mean to "
2176 }
2179 && !strop
2182 {
2184 "argument to %<sizeof%> in %qD call is the same "
2185 "pointer type %qT as the source; expected %qT "
2189 }
2190 }
2193 {
2197 {
2200 "argument to %<sizeof%> in %qD call is the same "
2201 "expression as the first source; did you mean to "
2207 "argument to %<sizeof%> in %qD call is the same "
2208 "expression as the first source; did you mean to "
2210 else
2212 "argument to %<sizeof%> in %qD call is the same "
2213 "expression as the first source; did you mean to "
2216 }
2219 && !strop
2222 {
2224 "argument to %<sizeof%> in %qD call is the same "
2225 "pointer type %qT as the first source; expected %qT "
2229 }
2230 }
2233 {
2237 {
2240 "argument to %<sizeof%> in %qD call is the same "
2241 "expression as the second source; did you mean to "
2247 "argument to %<sizeof%> in %qD call is the same "
2248 "expression as the second source; did you mean to "
2250 else
2252 "argument to %<sizeof%> in %qD call is the same "
2253 "expression as the second source; did you mean to "
2256 }
2259 && !strop
2262 {
2264 "argument to %<sizeof%> in %qD call is the same "
2265 "pointer type %qT as the second source; expected %qT "
2269 }
2270 }
2272 }
2274 /* Warn for unlikely, improbable, or stupid DECL declarations
2275 of `main'. */
2277 void
2279 {
2280 function_args_iterator iter;
2281 tree type;
2285 {
2286 /* XXX void_type_node belies the abstraction. */
2296 {
2302 }
2306 {
2328 "third argument of %q+D should probably be "
2331 }
2332 }
2334 /* It is intentional that this message does not mention the third
2335 argument because it's only mentioned in an appendix of the
2336 standard. */
2344 }
2346 /* vector_targets_convertible_p is used for vector pointer types. The
2347 callers perform various checks that the qualifiers are satisfactory,
2348 while OTOH vector_targets_convertible_p ignores the number of elements
2349 in the vectors. That's fine with vector pointers as we can consider,
2350 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2351 and that does not require and conversion of the pointer values.
2352 In contrast, vector_types_convertible_p and
2353 vector_types_compatible_elements_p are used for vector value types. */
2354 /* True if pointers to distinct types T1 and T2 can be converted to
2355 each other without an explicit cast. Only returns true for opaque
2356 vector types. */
2357 bool
2359 {
2366 }
2368 /* vector_types_convertible_p is used for vector value types.
2369 It could in principle call vector_targets_convertible_p as a subroutine,
2370 but then the check for vector type would be duplicated with its callers,
2371 and also the purpose of vector_targets_convertible_p would become
2372 muddled.
2373 Where vector_types_convertible_p returns true, a conversion might still be
2374 needed to make the types match.
2375 In contrast, vector_targets_convertible_p is used for vector pointer
2376 values, and vector_types_compatible_elements_p is used specifically
2377 in the context for binary operators, as a check if use is possible without
2378 conversion. */
2379 /* True if vector types T1 and T2 can be converted to each other
2380 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2381 can only be converted with -flax-vector-conversions yet that is not
2382 in effect, emit a note telling the user about that option if such
2383 a note has not previously been emitted. */
2384 bool
2386 {
2394 convertible_lax =
2409 {
2412 "conversions between vectors with differing "
2414 }
2417 }
2419 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2420 and have vector types, V0 has the same type as V1, and the number of
2421 elements of V0, V1, MASK is the same.
2423 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2424 called with two arguments. In this case implementation passes the
2425 first argument twice in order to share the same tree code. This fact
2426 could enable the mask-values being twice the vector length. This is
2427 an implementation accident and this semantics is not guaranteed to
2428 the user. */
2429 tree
2432 {
2433 tree ret;
2439 {
2442 }
2450 {
2455 }
2459 {
2463 }
2466 {
2471 }
2477 {
2480 "argument vector(s) and the mask vector should "
2483 }
2487 {
2492 }
2495 {
2496 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2502 else
2503 {
2506 }
2510 }
2520 }
2522 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2523 to integral type. */
2525 static tree
2527 {
2532 {
2533 /* C++0x scoped enumerations don't implicitly convert to integral
2534 type; if we stripped an explicit conversion to a larger type we
2535 need to replace it so common_type will still work. */
2539 }
2541 }
2543 /* This is a helper function of build_binary_op.
2545 For certain operations if both args were extended from the same
2546 smaller type, do the arithmetic in that type and then extend.
2548 BITWISE indicates a bitwise operation.
2549 For them, this optimization is safe only if
2550 both args are zero-extended or both are sign-extended.
2551 Otherwise, we might change the result.
2552 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2553 but calculated in (unsigned short) it would be (unsigned short)-1.
2554 */
2555 tree
2557 {
2561 tree type;
2563 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2564 excessive narrowing when we call get_narrower below. For
2565 example, suppose that OP0 is of unsigned int extended
2566 from signed char and that RESULT_TYPE is long long int.
2567 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2568 like
2570 (long long int) (unsigned int) signed_char
2572 which get_narrower would narrow down to
2574 (unsigned int) signed char
2576 If we do not cast OP0 first, get_narrower would return
2577 signed_char, which is inconsistent with the case of the
2578 explicit cast. */
2585 /* UNS is 1 if the operation to be done is an unsigned one. */
2588 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2589 but it *requires* conversion to FINAL_TYPE. */
2600 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2602 /* For bitwise operations, signedness of nominal type
2603 does not matter. Consider only how operands were extended. */
2607 /* Note that in all three cases below we refrain from optimizing
2608 an unsigned operation on sign-extended args.
2609 That would not be valid. */
2611 /* Both args variable: if both extended in same way
2612 from same width, do it in that width.
2613 Do it unsigned if args were zero-extended. */
2620 return c_common_signed_or_unsigned_type
2627 && (type
2638 && (type
2646 }
2648 /* Checks if expression EXPR of real/integer type cannot be converted
2649 to the real/integer type TYPE. Function returns non-zero when:
2650 * EXPR is a constant which cannot be exactly converted to TYPE.
2651 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2652 for EXPR type and TYPE being both integers or both real.
2653 * EXPR is not a constant of real type and TYPE is an integer.
2654 * EXPR is not a constant of integer type which cannot be
2655 exactly converted to real type.
2656 Function allows conversions between types of different signedness and
2657 can return SAFE_CONVERSION (zero) in that case. Function can produce
2658 signedness warnings if PRODUCE_WARNS is true. */
2660 enum conversion_safety
2662 {
2668 {
2669 /* Warn for real constant that is not an exact integer converted
2670 to integer type. */
2673 {
2676 }
2677 /* Warn for an integer constant that does not fit into integer type. */
2681 {
2684 {
2688 }
2690 {
2694 }
2695 else
2697 }
2699 {
2700 /* Warn for an integer constant that does not fit into real type. */
2702 {
2706 }
2707 /* Warn for a real constant that does not fit into a smaller
2708 real type. */
2711 {
2715 }
2716 }
2717 }
2718 else
2719 {
2720 /* Warn for real types converted to integer types. */
2727 {
2728 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2732 /* Don't warn for short y; short x = ((int)y & 0xff); */
2736 {
2737 /* If both args were extended from a shortest type,
2738 use that type if that is safe. */
2745 {
2751 /* If one of the operands is a non-negative constant
2752 that fits in the target type, then the type of the
2753 other operand does not matter. */
2762 /* If constant is unsigned and fits in the target
2763 type, then the result will also fit. */
2765 && unsigned0
2768 && unsigned1
2771 }
2772 }
2773 /* Warn for integer types converted to smaller integer types. */
2777 /* When they are the same width but different signedness,
2778 then the value may change. */
2781 /* Even when converted to a bigger type, if the type is
2782 unsigned but expr is signed, then negative values
2783 will be changed. */
2789 }
2791 /* Warn for integer types converted to real types if and only if
2792 all the range of values of the integer type cannot be
2793 represented by the real type. */
2796 {
2800 /* Don't warn about char y = 0xff; float x = (int) y; */
2812 }
2814 /* Warn for real types converted to smaller real types. */
2819 }
2822 }
2824 /* Warns if the conversion of EXPR to TYPE may alter a value.
2825 This is a helper function for warnings_for_convert_and_check. */
2827 static void
2829 {
2836 /* This may happen, because for LHS op= RHS we preevaluate
2837 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2838 means we could no longer see the code of the EXPR. */
2845 {
2858 /* Conversion from boolean to a signed:1 bit-field (which only
2859 can hold the values 0 and -1) doesn't lose information - but
2860 it does change the value. */
2880 {
2881 /* In case of COND_EXPR, we do not care about the type of
2882 COND_EXPR, only about the conversion of each operand. */
2889 }
2901 }
2902 }
2904 /* Produce warnings after a conversion. RESULT is the result of
2905 converting EXPR to TYPE. This is a helper function for
2906 convert_and_check and cp_convert_and_check. */
2908 void
2910 tree result)
2911 {
2918 {
2919 /* Do not diagnose overflow in a constant expression merely
2920 because a conversion overflowed. */
2925 {
2926 /* This detects cases like converting -129 or 256 to
2927 unsigned char. */
2931 else
2933 }
2937 /* No warning for converting 0x80000000 to int. */
2945 else
2947 }
2952 else
2954 }
2957 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2958 Invoke this function on every expression that is converted implicitly,
2959 i.e. because of language rules and not because of an explicit cast. */
2961 tree
2963 {
2964 tree result;
2965 tree expr_for_warning;
2967 /* Convert from a value with possible excess precision rather than
2968 via the semantic type, but do not warn about values not fitting
2969 exactly in the semantic type. */
2971 {
2977 }
2978 else
2992 }
2993 \f
2994 /* A node in a list that describes references to variables (EXPR), which are
2995 either read accesses if WRITER is zero, or write accesses, in which case
2996 WRITER is the parent of EXPR. */
2997 struct tlist
2998 {
3001 };
3003 /* Used to implement a cache the results of a call to verify_tree. We only
3004 use this for SAVE_EXPRs. */
3005 struct tlist_cache
3006 {
3010 tree expr;
3011 };
3013 /* Obstack to use when allocating tlist structures, and corresponding
3014 firstobj. */
3018 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3019 warnings. */
3021 /* SAVE_EXPRs need special treatment. We process them only once and then
3022 cache the results. */
3034 /* Create a new struct tlist and fill in its fields. */
3037 {
3044 }
3046 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3047 is nonnull, we ignore any node we find which has a writer equal to it. */
3049 static void
3051 {
3053 {
3060 }
3061 }
3063 /* Merge the nodes of ADD into TO. This merging process is done so that for
3064 each variable that already exists in TO, no new node is added; however if
3065 there is a write access recorded in ADD, and an occurrence on TO is only
3066 a read access, then the occurrence in TO will be modified to record the
3067 write. */
3069 static void
3071 {
3078 {
3085 {
3089 }
3091 {
3095 }
3097 }
3098 }
3100 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3101 references in list LIST conflict with it, excluding reads if ONLY writers
3102 is nonzero. */
3104 static void
3107 {
3110 /* Avoid duplicate warnings. */
3116 {
3120 {
3125 }
3127 }
3128 }
3130 /* Given a list LIST of references to variables, find whether any of these
3131 can cause conflicts due to missing sequence points. */
3133 static void
3135 {
3139 {
3142 }
3143 }
3145 /* Return nonzero if X is a tree that can be verified by the sequence point
3146 warnings. */
3147 static int
3149 {
3156 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3157 (lvalue_p) crash on TRY/CATCH. */
3164 /* No point to track non-const calls, they will never satisfy
3165 operand_equal_p. */
3173 }
3175 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3176 static bool
3178 {
3180 }
3182 /* Walk the tree X, and record accesses to variables. If X is written by the
3183 parent tree, WRITER is the parent.
3184 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3185 expression or its only operand forces a sequence point, then everything up
3186 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3187 in PNO_SP.
3188 Once we return, we will have emitted warnings if any subexpression before
3189 such a sequence point could be undefined. On a higher level, however, the
3190 sequence point may not be relevant, and we'll merge the two lists.
3192 Example: (b++, a) + b;
3193 The call that processes the COMPOUND_EXPR will store the increment of B
3194 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3195 processes the PLUS_EXPR will need to merge the two lists so that
3196 eventually, all accesses end up on the same list (and we'll warn about the
3197 unordered subexpressions b++ and b.
3199 A note on merging. If we modify the former example so that our expression
3200 becomes
3201 (b++, b) + a
3202 care must be taken not simply to add all three expressions into the final
3203 PNO_SP list. The function merge_tlist takes care of that by merging the
3204 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3205 way, so that no more than one access to B is recorded. */
3207 static void
3209 tree writer)
3210 {
3215 /* X may be NULL if it is the operand of an empty statement expression
3216 ({ }). */
3220 restart:
3228 {
3261 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3262 two first, to avoid warning for (a ? b++ : b++). */
3278 /* Expressions inside the LHS are not ordered wrt. the sequence points
3279 in the RHS. Example:
3280 *a = (a++, 2)
3281 Despite the fact that the modification of "a" is in the before_sp
3282 list (tmp_before), it conflicts with the use of "a" in the LHS.
3283 We can handle this by adding the contents of tmp_list3
3284 to those of tmp_before, and redoing the collision warnings for that
3285 list. */
3288 /* Exclude the LHS itself here; we first have to merge it into the
3289 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3290 didn't exclude the LHS, we'd get it twice, once as a read and once
3291 as a write. */
3302 /* We need to warn about conflicts among arguments and conflicts between
3303 args and the function address. Side effects of the function address,
3304 however, are not ordered by the sequence point of the call. */
3305 {
3306 call_expr_arg_iterator iter;
3307 tree arg;
3311 {
3316 }
3321 }
3324 /* Scan all the list, e.g. indices of multi dimensional array. */
3326 {
3332 }
3336 {
3343 {
3357 }
3361 }
3371 /* For other expressions, simply recurse on their operands.
3372 Manual tail recursion for unary expressions.
3373 Other non-expressions need not be processed. */
3375 {
3379 }
3381 {
3385 {
3390 }
3391 }
3393 }
3394 }
3396 /* Try to warn for undefined behavior in EXPR due to missing sequence
3397 points. */
3399 DEBUG_FUNCTION void
3401 {
3407 {
3410 }
3415 }
3416 \f
3417 /* Validate the expression after `case' and apply default promotions. */
3419 static tree
3421 {
3426 /* Promote char or short to int. */
3429 {
3432 }
3437 }
3438 \f
3439 /* See if the case values LOW and HIGH are in the range of the original
3440 type (i.e. before the default conversion to int) of the switch testing
3441 expression.
3442 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3443 the type before promoting it. CASE_LOW_P is a pointer to the lower
3444 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3445 if the case is not a case range.
3446 The caller has to make sure that we are not called with NULL for
3447 CASE_LOW_P (i.e. the default case).
3448 Returns true if the case label is in range of ORIG_TYPE (saturated or
3449 untouched) or false if the label is out of range. */
3451 static bool
3454 {
3459 /* If there was a problem with the original type, do nothing. */
3466 /* Case label is less than minimum for type. */
3469 {
3473 }
3475 /* Case value is greater than maximum for type. */
3478 {
3481 }
3483 /* Saturate lower case label value to minimum. */
3486 {
3490 }
3492 /* Saturate upper case label value to maximum. */
3495 {
3499 }
3507 }
3508 \f
3509 /* Return an integer type with BITS bits of precision,
3510 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3512 tree
3514 {
3556 }
3558 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3559 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3560 and saturating if SATP is nonzero, otherwise not saturating. */
3562 tree
3565 {
3566 machine_mode mode;
3569 else
3577 {
3579 "fixed-point types that have too many integral and "
3582 }
3585 }
3587 /* Used for communication between c_common_type_for_mode and
3588 c_register_builtin_type. */
3589 tree registered_builtin_types;
3591 /* Return a data type that has machine mode MODE.
3592 If the mode is an integer,
3593 then UNSIGNEDP selects between signed and unsigned types.
3594 If the mode is a fixed-point mode,
3595 then UNSIGNEDP selects between saturating and nonsaturating types. */
3597 tree
3599 {
3600 tree t;
3640 #if HOST_BITS_PER_WIDE_INT >= 64
3643 #endif
3668 {
3669 machine_mode inner_mode;
3670 tree inner_type;
3686 }
3688 {
3693 }
3703 {
3789 }
3797 }
3799 tree
3801 {
3803 }
3805 /* Return a signed type the same as TYPE in other respects. */
3807 tree
3809 {
3811 }
3813 /* Return a type the same as TYPE except unsigned or
3814 signed according to UNSIGNEDP. */
3816 tree
3818 {
3819 tree type1;
3822 /* This block of code emulates the behavior of the old
3823 c_common_unsigned_type. In particular, it returns
3824 long_unsigned_type_node if passed a long, even when a int would
3825 have the same size. This is necessary for warnings to work
3826 correctly in archs where sizeof(int) == sizeof(long) */
3829 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3849 #if HOST_BITS_PER_WIDE_INT >= 64
3852 #endif
3862 #define C_COMMON_FIXED_TYPES(NAME) \
3863 if (type1 == short_ ## NAME ## _type_node \
3864 || type1 == unsigned_short_ ## NAME ## _type_node) \
3865 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3866 : short_ ## NAME ## _type_node; \
3867 if (type1 == NAME ## _type_node \
3868 || type1 == unsigned_ ## NAME ## _type_node) \
3869 return unsignedp ? unsigned_ ## NAME ## _type_node \
3870 : NAME ## _type_node; \
3871 if (type1 == long_ ## NAME ## _type_node \
3872 || type1 == unsigned_long_ ## NAME ## _type_node) \
3873 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3874 : long_ ## NAME ## _type_node; \
3875 if (type1 == long_long_ ## NAME ## _type_node \
3876 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3877 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3878 : long_long_ ## NAME ## _type_node;
3880 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3881 if (type1 == NAME ## _type_node \
3882 || type1 == u ## NAME ## _type_node) \
3883 return unsignedp ? u ## NAME ## _type_node \
3884 : NAME ## _type_node;
3886 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3887 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3888 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3889 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3890 : sat_ ## short_ ## NAME ## _type_node; \
3891 if (type1 == sat_ ## NAME ## _type_node \
3892 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3893 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3894 : sat_ ## NAME ## _type_node; \
3895 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3896 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3897 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3898 : sat_ ## long_ ## NAME ## _type_node; \
3899 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3900 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3901 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3902 : sat_ ## long_long_ ## NAME ## _type_node;
3904 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3905 if (type1 == sat_ ## NAME ## _type_node \
3906 || type1 == sat_ ## u ## NAME ## _type_node) \
3907 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3908 : sat_ ## NAME ## _type_node;
3934 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3935 the precision; they have precision set to match their range, but
3936 may use a wider mode to match an ABI. If we change modes, we may
3937 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3938 the precision as well, so as to yield correct results for
3939 bit-field types. C++ does not have these separate bit-field
3940 types, and producing a signed or unsigned variant of an
3941 ENUMERAL_TYPE may cause other problems as well. */
3947 #define TYPE_OK(node) \
3948 (TYPE_MODE (type) == TYPE_MODE (node) \
3949 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3973 #if HOST_BITS_PER_WIDE_INT >= 64
3976 #endif
3985 #undef TYPE_OK
3988 }
3990 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3992 tree
3994 {
3997 /* Extended integer types of the same width as a standard type have
3998 lesser rank, so those of the same width as int promote to int or
3999 unsigned int and are valid for printf formats expecting int or
4000 unsigned int. To avoid such special cases, avoid creating
4001 extended integer types for bit-fields if a standard integer type
4002 is available. */
4020 }
4022 /* The C version of the register_builtin_type langhook. */
4024 void
4026 {
4027 tree decl;
4037 }
4038 \f
4039 /* Print an error message for invalid operands to arith operation
4040 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4041 LOCATION is the location of the message. */
4043 void
4046 {
4050 {
4095 }
4099 }
4100 \f
4101 /* Given an expression as a tree, return its original type. Do this
4102 by stripping any conversion that preserves the sign and precision. */
4103 static tree
4105 {
4108 }
4110 /* Subroutine of build_binary_op, used for comparison operations.
4111 See if the operands have both been converted from subword integer types
4112 and, if so, perhaps change them both back to their original type.
4113 This function is also responsible for converting the two operands
4114 to the proper common type for comparison.
4116 The arguments of this function are all pointers to local variables
4117 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4118 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4120 LOC is the location of the comparison.
4122 If this function returns nonzero, it means that the comparison has
4123 a constant value. What this function returns is an expression for
4124 that value. */
4126 tree
4129 {
4130 tree type;
4138 /* Throw away any conversions to wider types
4139 already present in the operands. */
4144 /* If primopN is first sign-extended from primopN's precision to opN's
4145 precision, then zero-extended from opN's precision to
4146 *restype_ptr precision, shortenings might be invalid. */
4149 && !unsignedp0
4154 && !unsignedp1
4158 /* Handle the case that OP0 does not *contain* a conversion
4159 but it *requires* conversion to FINAL_TYPE. */
4166 /* If one of the operands must be floated, we cannot optimize. */
4170 /* If first arg is constant, swap the args (changing operation
4171 so value is preserved), for canonicalization. Don't do this if
4172 the second arg is 0. */
4177 {
4194 {
4209 }
4211 }
4213 /* If comparing an integer against a constant more bits wide,
4214 maybe we can deduce a value of 1 or 0 independent of the data.
4215 Or else truncate the constant now
4216 rather than extend the variable at run time.
4218 This is only interesting if the constant is the wider arg.
4219 Also, it is not safe if the constant is unsigned and the
4220 variable arg is signed, since in this case the variable
4221 would be sign-extended and then regarded as unsigned.
4222 Our technique fails in this case because the lowest/highest
4223 possible unsigned results don't follow naturally from the
4224 lowest/highest possible values of the variable operand.
4225 For just EQ_EXPR and NE_EXPR there is another technique that
4226 could be used: see if the constant can be faithfully represented
4227 in the other operand's type, by truncating it and reextending it
4228 and see if that preserves the constant's value. */
4234 {
4237 /* 1 if comparison is nominally unsigned. */
4239 tree val;
4251 {
4252 /* Convert primop1 to target type, but do not introduce
4253 additional overflow. We know primop1 is an int_cst. */
4260 }
4262 {
4265 }
4273 /* This used to be a switch, but Genix compiler can't handle that. */
4275 {
4278 }
4280 {
4283 }
4285 {
4290 }
4292 {
4297 }
4299 {
4304 }
4306 {
4311 }
4313 /* If primop0 was sign-extended and unsigned comparison specd,
4314 we did a signed comparison above using the signed type bounds.
4315 But the comparison we output must be unsigned.
4317 Also, for inequalities, VAL is no good; but if the signed
4318 comparison had *any* fixed result, it follows that the
4319 unsigned comparison just tests the sign in reverse
4320 (positive values are LE, negative ones GE).
4321 So we can generate an unsigned comparison
4322 against an extreme value of the signed type. */
4325 {
4328 {
4343 }
4345 }
4348 {
4355 }
4358 {
4359 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4363 }
4365 /* Value is not predetermined, but do the comparison
4366 in the type of the operand that is not constant.
4367 TYPE is already properly set. */
4368 }
4370 /* If either arg is decimal float and the other is float, find the
4371 proper common type to use for comparison. */
4377 /* If either arg is decimal float and the other is float, fail. */
4388 /* If args' natural types are both narrower than nominal type
4389 and both extend in the same manner, compare them
4390 in the type of the wider arg.
4391 Otherwise must actually extend both to the nominal
4392 common type lest different ways of extending
4393 alter the result.
4394 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4399 {
4403 type);
4404 /* Make sure shorter operand is extended the right way
4405 to match the longer operand. */
4406 primop0
4409 primop0);
4410 primop1
4413 primop1);
4414 }
4415 else
4416 {
4417 /* Here we must do the comparison on the nominal type
4418 using the args exactly as we received them. */
4425 {
4427 /* All unsigned values are >= 0, so we warn. However,
4428 if OP0 is a constant that is >= 0, the signedness of
4429 the comparison isn't an issue, so suppress the
4430 warning. */
4435 primop0)))
4436 /* Do not warn for enumeration types. */
4440 {
4457 }
4460 {
4461 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4466 }
4467 }
4468 }
4476 }
4477 \f
4478 /* Return a tree for the sum or difference (RESULTCODE says which)
4479 of pointer PTROP and integer INTOP. */
4481 tree
4484 {
4487 /* The result is a pointer of the same type that is being added. */
4491 {
4498 }
4500 {
4507 }
4508 else
4511 /* We are manipulating pointer values, so we don't need to warn
4512 about relying on undefined signed overflow. We disable the
4513 warning here because we use integer types so fold won't know that
4514 they are really pointers. */
4517 /* If what we are about to multiply by the size of the elements
4518 contains a constant term, apply distributive law
4519 and multiply that constant term separately.
4520 This helps produce common subexpressions. */
4525 /* If the constant comes from pointer subtraction,
4526 skip this optimization--it would cause an error. */
4528 /* If the constant is unsigned, and smaller than the pointer size,
4529 then we must skip this optimization. This is because it could cause
4530 an overflow error if the constant is negative but INTOP is not. */
4534 {
4539 /* Convert both subexpression types to the type of intop,
4540 because weird cases involving pointer arithmetic
4541 can result in a sum or difference with different type args. */
4546 }
4548 /* Convert the integer argument to a type the same size as sizetype
4549 so the multiply won't overflow spuriously. */
4555 /* Replace the integer argument with a suitable product by the object size.
4556 Do this multiplication as signed, then convert to the appropriate type
4557 for the pointer operation and disregard an overflow that occurred only
4558 because of the sign-extension change in the latter conversion. */
4559 {
4566 }
4568 /* Create the sum or difference. */
4577 }
4578 \f
4579 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4580 and if NON_CONST is known not to be permitted in an evaluated part
4581 of a constant expression. */
4583 tree
4585 {
4589 /* This should never be called for C++. */
4593 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4602 }
4604 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4605 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4606 around the SAVE_EXPR if needed so that c_fully_fold does not need
4607 to look inside SAVE_EXPRs. */
4609 tree
4611 {
4620 }
4622 /* Return whether EXPR is a declaration whose address can never be
4623 NULL. */
4625 bool
4627 {
4632 }
4634 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4635 or for an `if' or `while' statement or ?..: exp. It should already
4636 have been validated to be of suitable type; otherwise, a bad
4637 diagnostic may result.
4639 The EXPR is located at LOCATION.
4641 This preparation consists of taking the ordinary
4642 representation of an expression expr and producing a valid tree
4643 boolean expression describing whether expr is nonzero. We could
4644 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4645 but we optimize comparisons, &&, ||, and !.
4647 The resulting type should always be `truthvalue_type_node'. */
4649 tree
4651 {
4653 {
4695 ? truthvalue_true_node
4701 ? truthvalue_true_node
4706 /* Fall through. */
4709 {
4712 {
4713 /* Common Ada/Pascal programmer's mistake. */
4715 OPT_Waddress,
4717 inner);
4719 }
4721 }
4738 /* These don't change whether an object is nonzero or zero. */
4743 /* These don't change whether an object is zero or nonzero, but
4744 we can't ignore them if their second arg has side-effects. */
4746 {
4749 c_common_truthvalue_conversion
4752 }
4753 else
4758 /* Distribute the conversion into the arms of a COND_EXPR. */
4760 {
4763 /* In C++ one of the arms might have void type if it is throw. */
4771 }
4772 else
4773 {
4774 /* Folding will happen later for C. */
4782 }
4784 CASE_CONVERT:
4785 {
4789 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4790 since that affects how `default_conversion' will behave. */
4794 /* Don't strip a conversion from C++0x scoped enum, since they
4795 don't implicitly convert to other types. */
4799 /* If this isn't narrowing the argument, we can ignore it. */
4803 }
4809 {
4813 }
4818 }
4821 {
4823 expr = (build_binary_op
4827 c_common_truthvalue_conversion
4830 c_common_truthvalue_conversion
4835 }
4838 {
4843 }
4844 else
4847 ret:
4850 }
4851 \f
4860 /* Apply the TYPE_QUALS to the new DECL. */
4862 void
4864 {
4872 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4873 constructor can produce constant init, so rely on cp_finish_decl to
4874 clear TREE_READONLY if the variable has non-constant init. */
4877 {
4880 }
4882 {
4884 /* Allow 'restrict' on arrays of pointers.
4885 FIXME currently we just ignore it. */
4891 }
4892 }
4895 {
4898 };
4900 /* Hash function for the problem of multiple type definitions in
4901 different files. This must hash all types that will compare
4902 equal via comptypes to the same value. In practice it hashes
4903 on some of the simple stuff and leaves the details to comptypes. */
4905 hashval_t
4907 {
4910 tree t2;
4912 {
4913 /* For pointers, hash on pointee type plus some swizzling. */
4916 /* Hash on number of elements and total size. */
4935 }
4936 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4937 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4939 /* We might have a VLA here. */
4942 else
4945 }
4947 bool
4949 {
4951 }
4955 /* Return the typed-based alias set for T, which may be an expression
4956 or a type. Return -1 if we don't do anything special. */
4958 alias_set_type
4960 {
4961 tree u;
4963 /* For VLAs, use the alias set of the element type rather than the
4964 default of alias set 0 for types compared structurally. */
4966 {
4970 }
4972 /* Permit type-punning when accessing a union, provided the access
4973 is directly through the union. For example, this code does not
4974 permit taking the address of a union member and then storing
4975 through it. Even the type-punning allowed here is a GCC
4976 extension, albeit a common and useful one; the C standard says
4977 that such accesses have implementation-defined behavior. */
4985 /* That's all the expressions we handle specially. */
4989 /* The C standard guarantees that any object may be accessed via an
4990 lvalue that has character type. */
4996 /* The C standard specifically allows aliasing between signed and
4997 unsigned variants of the same type. We treat the signed
4998 variant as canonical. */
5000 {
5003 /* t1 == t can happen for boolean nodes which are always unsigned. */
5006 }
5008 /* Handle the case of multiple type nodes referring to "the same" type,
5009 which occurs with IMA. These share an alias set. FIXME: Currently only
5010 C90 is handled. (In C99 type compatibility is not transitive, which
5011 complicates things mightily. The alias set splay trees can theoretically
5012 represent this, but insertion is tricky when you consider all the
5013 different orders things might arrive in.) */
5018 /* Save time if there's only one input file. */
5022 /* Pointers need special handling if they point to any type that
5023 needs special handling (below). */
5025 {
5026 tree t2;
5027 /* Find bottom type under any nested POINTERs. */
5031 ;
5039 }
5040 /* These are the only cases that need special handling. */
5047 /* Undefined? */
5051 /* Look up t in hash table. Only one of the compatible types within each
5052 alias set is recorded in the table. */
5057 {
5060 }
5061 else
5062 /* Our caller will assign and record (in t) a new alias set; all we need
5063 to do is remember t in the hash table. */
5067 }
5068 \f
5069 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5070 the IS_SIZEOF parameter indicates which operator is being applied.
5071 The COMPLAIN flag controls whether we should diagnose possibly
5072 ill-formed constructs or not. LOC is the location of the SIZEOF or
5073 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5074 a type in any context should be returned, rather than the normal
5075 alignment for that type. */
5077 tree
5081 {
5089 {
5091 {
5098 }
5099 else
5100 {
5102 {
5106 else
5109 }
5111 }
5112 }
5114 {
5122 }
5125 {
5130 }
5133 {
5138 }
5139 else
5140 {
5142 /* Convert in case a char is more than one unit. */
5148 else
5150 }
5152 /* VALUE will have the middle-end integer type sizetype.
5153 However, we should really return a value of type `size_t',
5154 which is just a typedef for an ordinary integer type. */
5158 }
5160 /* Implement the __alignof keyword: Return the minimum required
5161 alignment of EXPR, measured in bytes. For VAR_DECLs,
5162 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5163 from an "aligned" __attribute__ specification). LOC is the
5164 location of the ALIGNOF operator. */
5166 tree
5168 {
5169 tree t;
5176 {
5179 }
5185 {
5192 {
5199 }
5201 }
5202 else
5206 }
5207 \f
5208 /* Handle C and C++ default attributes. */
5210 enum built_in_attribute
5211 {
5212 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5213 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5214 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5215 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5216 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5218 #undef DEF_ATTR_NULL_TREE
5219 #undef DEF_ATTR_INT
5220 #undef DEF_ATTR_STRING
5221 #undef DEF_ATTR_IDENT
5222 #undef DEF_ATTR_TREE_LIST
5223 ATTR_LAST
5224 };
5230 enum c_builtin_type
5231 {
5232 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5233 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5234 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5235 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5236 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5237 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5238 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5239 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5240 ARG6) NAME,
5241 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5242 ARG6, ARG7) NAME,
5243 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5244 ARG6, ARG7, ARG8) NAME,
5245 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5246 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5247 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5248 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5249 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5250 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5251 NAME,
5252 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5253 ARG6, ARG7) NAME,
5254 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5255 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5256 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5258 #undef DEF_PRIMITIVE_TYPE
5259 #undef DEF_FUNCTION_TYPE_0
5260 #undef DEF_FUNCTION_TYPE_1
5261 #undef DEF_FUNCTION_TYPE_2
5262 #undef DEF_FUNCTION_TYPE_3
5263 #undef DEF_FUNCTION_TYPE_4
5264 #undef DEF_FUNCTION_TYPE_5
5265 #undef DEF_FUNCTION_TYPE_6
5266 #undef DEF_FUNCTION_TYPE_7
5267 #undef DEF_FUNCTION_TYPE_8
5268 #undef DEF_FUNCTION_TYPE_VAR_0
5269 #undef DEF_FUNCTION_TYPE_VAR_1
5270 #undef DEF_FUNCTION_TYPE_VAR_2
5271 #undef DEF_FUNCTION_TYPE_VAR_3
5272 #undef DEF_FUNCTION_TYPE_VAR_4
5273 #undef DEF_FUNCTION_TYPE_VAR_5
5274 #undef DEF_FUNCTION_TYPE_VAR_7
5275 #undef DEF_FUNCTION_TYPE_VAR_11
5276 #undef DEF_POINTER_TYPE
5277 BT_LAST
5278 };
5282 /* A temporary array for c_common_nodes_and_builtins. Used in
5283 communication with def_fn_type. */
5286 /* A helper function for c_common_nodes_and_builtins. Build function type
5287 for DEF with return type RET and N arguments. If VAR is true, then the
5288 function should be variadic after those N arguments.
5290 Takes special care not to ICE if any of the types involved are
5291 error_mark_node, which indicates that said type is not in fact available
5292 (see builtin_type_for_size). In which case the function type as a whole
5293 should be error_mark_node. */
5295 static void
5297 {
5298 tree t;
5305 {
5311 }
5318 else
5321 egress:
5324 }
5326 /* Build builtin functions common to both C and C++ language
5327 frontends. */
5329 static void
5331 {
5332 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5333 builtin_types[ENUM] = VALUE;
5334 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5335 def_fn_type (ENUM, RETURN, 0, 0);
5336 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5337 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5338 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5339 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5340 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5341 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5342 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5343 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5344 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5345 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5346 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5347 ARG6) \
5348 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5349 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5350 ARG6, ARG7) \
5351 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5352 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5353 ARG6, ARG7, ARG8) \
5354 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5355 ARG7, ARG8);
5356 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5357 def_fn_type (ENUM, RETURN, 1, 0);
5358 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5359 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5360 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5361 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5362 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5363 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5364 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5365 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5366 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5367 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5368 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5369 ARG6, ARG7) \
5370 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5371 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5372 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5373 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5374 ARG7, ARG8, ARG9, ARG10, ARG11);
5375 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5376 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5380 #undef DEF_PRIMITIVE_TYPE
5381 #undef DEF_FUNCTION_TYPE_0
5382 #undef DEF_FUNCTION_TYPE_1
5383 #undef DEF_FUNCTION_TYPE_2
5384 #undef DEF_FUNCTION_TYPE_3
5385 #undef DEF_FUNCTION_TYPE_4
5386 #undef DEF_FUNCTION_TYPE_5
5387 #undef DEF_FUNCTION_TYPE_6
5388 #undef DEF_FUNCTION_TYPE_7
5389 #undef DEF_FUNCTION_TYPE_8
5390 #undef DEF_FUNCTION_TYPE_VAR_0
5391 #undef DEF_FUNCTION_TYPE_VAR_1
5392 #undef DEF_FUNCTION_TYPE_VAR_2
5393 #undef DEF_FUNCTION_TYPE_VAR_3
5394 #undef DEF_FUNCTION_TYPE_VAR_4
5395 #undef DEF_FUNCTION_TYPE_VAR_5
5396 #undef DEF_FUNCTION_TYPE_VAR_7
5397 #undef DEF_FUNCTION_TYPE_VAR_11
5398 #undef DEF_POINTER_TYPE
5403 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5404 NONANSI_P, ATTRS, IMPLICIT, COND) \
5405 if (NAME && COND) \
5406 def_builtin_1 (ENUM, NAME, CLASS, \
5407 builtin_types[(int) TYPE], \
5408 builtin_types[(int) LIBTYPE], \
5409 BOTH_P, FALLBACK_P, NONANSI_P, \
5410 built_in_attributes[(int) ATTRS], IMPLICIT);
5412 #undef DEF_BUILTIN
5420 }
5422 /* Like get_identifier, but avoid warnings about null arguments when
5423 the argument may be NULL for targets where GCC lacks stdint.h type
5424 information. */
5428 {
5430 }
5432 /* Build tree nodes and builtin functions common to both C and C++ language
5433 frontends. */
5435 void
5437 {
5441 tree array_domain_type;
5442 tree va_list_ref_type_node;
5443 tree va_list_arg_type_node;
5448 /* Define `int' and `char' first so that dbx will output them first. */
5452 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5453 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5454 but not C. Are the conditionals here needed? */
5460 long_unsigned_type_node);
5463 {
5471 }
5476 long_long_integer_type_node);
5478 long_long_unsigned_type_node);
5481 long_long_unsigned_type_node);
5484 short_unsigned_type_node);
5487 short_unsigned_type_node);
5489 /* Define both `signed char' and `unsigned char'. */
5493 /* These are types that c_common_type_for_size and
5494 c_common_type_for_mode use. */
5497 intQI_type_node));
5500 intHI_type_node));
5503 intSI_type_node));
5506 intDI_type_node));
5507 #if HOST_BITS_PER_WIDE_INT >= 64
5508 /* Note that this is different than the __int128 type that's part of
5509 the generic __intN support. */
5512 TYPE_DECL,
5514 intTI_type_node));
5515 #endif
5518 unsigned_intQI_type_node));
5521 unsigned_intHI_type_node));
5524 unsigned_intSI_type_node));
5527 unsigned_intDI_type_node));
5528 #if HOST_BITS_PER_WIDE_INT >= 64
5531 TYPE_DECL,
5533 unsigned_intTI_type_node));
5534 #endif
5536 /* Create the widest literal types. */
5537 widest_integer_literal_type_node
5541 widest_integer_literal_type_node));
5543 widest_unsigned_literal_type_node
5547 widest_unsigned_literal_type_node));
5551 pid_type_node =
5558 /* Only supported decimal floating point extension if the target
5559 actually supports underlying modes. */
5563 {
5567 }
5570 {
5575 long_long_fract_type_node);
5577 unsigned_short_fract_type_node);
5579 unsigned_fract_type_node);
5581 unsigned_long_fract_type_node);
5583 unsigned_long_long_fract_type_node);
5585 sat_short_fract_type_node);
5588 sat_long_fract_type_node);
5590 sat_long_long_fract_type_node);
5592 sat_unsigned_short_fract_type_node);
5594 sat_unsigned_fract_type_node);
5596 sat_unsigned_long_fract_type_node);
5598 sat_unsigned_long_long_fract_type_node);
5603 long_long_accum_type_node);
5605 unsigned_short_accum_type_node);
5607 unsigned_accum_type_node);
5609 unsigned_long_accum_type_node);
5611 unsigned_long_long_accum_type_node);
5613 sat_short_accum_type_node);
5616 sat_long_accum_type_node);
5618 sat_long_long_accum_type_node);
5620 sat_unsigned_short_accum_type_node);
5622 sat_unsigned_accum_type_node);
5624 sat_unsigned_long_accum_type_node);
5626 sat_unsigned_long_long_accum_type_node);
5628 }
5631 TYPE_DECL,
5633 complex_integer_type_node));
5635 TYPE_DECL,
5637 complex_float_type_node));
5639 TYPE_DECL,
5641 complex_double_type_node));
5645 complex_long_double_type_node));
5648 /* For C++, make fileptr_type_node a distinct void * type until
5649 FILE type is defined. */
5654 /* Set the TYPE_NAME for any variants that were built before
5655 record_builtin_type gave names to the built-in types. */
5656 {
5662 }
5666 /* Make a type to be the domain of a few array types
5667 whose domains don't really matter.
5668 200 is small enough that it always fits in size_t
5669 and large enough that it can hold most function names for the
5670 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5673 /* Make a type for arrays of characters.
5674 With luck nothing will ever really depend on the length of this
5675 array type. */
5676 char_array_type_node
5680 const_string_type_node
5684 /* This is special for C++ so functions can be overloaded. */
5690 {
5693 else
5696 }
5698 /* This is for wide string constants. */
5699 wchar_array_type_node
5702 /* Define 'char16_t'. */
5707 {
5712 }
5714 /* This is for UTF-16 string constants. */
5715 char16_array_type_node
5718 /* Define 'char32_t'. */
5723 {
5728 }
5730 /* This is for UTF-32 string constants. */
5731 char32_array_type_node
5734 wint_type_node =
5737 intmax_type_node =
5739 uintmax_type_node =
5743 sig_atomic_type_node =
5746 int8_type_node =
5749 int16_type_node =
5752 int32_type_node =
5755 int64_type_node =
5758 uint8_type_node =
5770 int_least8_type_node =
5773 int_least16_type_node =
5776 int_least32_type_node =
5779 int_least64_type_node =
5782 uint_least8_type_node =
5785 uint_least16_type_node =
5788 uint_least32_type_node =
5791 uint_least64_type_node =
5794 int_fast8_type_node =
5797 int_fast16_type_node =
5800 int_fast32_type_node =
5803 int_fast64_type_node =
5806 uint_fast8_type_node =
5809 uint_fast16_type_node =
5812 uint_fast32_type_node =
5815 uint_fast64_type_node =
5818 intptr_type_node =
5821 uintptr_type_node =
5824 default_function_type
5826 ptrdiff_type_node
5833 va_list_type_node));
5835 {
5838 tree ptype;
5841 {
5845 ptype));
5847 }
5848 }
5851 {
5854 }
5855 else
5856 {
5859 }
5866 /* Create the built-in __null node. It is important that this is
5867 not shared. */
5871 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5873 }
5875 /* The number of named compound-literals generated thus far. */
5878 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5880 void
5882 {
5885 compound_literal_number);
5886 compound_literal_number++;
5888 }
5890 tree
5892 {
5896 }
5899 /* Linked list of disabled built-in functions. */
5902 {
5910 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5911 begins with "__builtin_", give an error. */
5913 void
5915 {
5918 else
5919 {
5924 }
5925 }
5928 /* Return true if the built-in function NAME has been disabled, false
5929 otherwise. */
5931 static bool
5933 {
5936 {
5939 }
5941 }
5944 /* Worker for DEF_BUILTIN.
5945 Possibly define a builtin function with one or two names.
5946 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5947 nonansi_p and flag_no_nonansi_builtin. */
5949 static void
5956 {
5957 tree decl;
5970 fnattrs);
5979 }
5980 \f
5981 /* Nonzero if the type T promotes to int. This is (nearly) the
5982 integral promotions defined in ISO C99 6.3.1.1/2. */
5984 bool
5986 {
5988 {
5998 /* ??? Technically all enumerations not larger than an int
5999 promote to an int. But this is used along code paths
6000 that only want to notice a size change. */
6008 }
6009 }
6011 /* Return 1 if PARMS specifies a fixed number of parameters
6012 and none of their types is affected by default promotions. */
6014 int
6016 {
6017 const_tree t;
6019 {
6036 }
6038 }
6040 /* Recursively remove any '*' or '&' operator from TYPE. */
6041 tree
6043 {
6047 }
6049 /* Recursively remove pointer or array type from TYPE. */
6050 tree
6052 {
6056 }
6058 /* Used to compare case labels. K1 and K2 are actually tree nodes
6059 representing case labels, or NULL_TREE for a `default' label.
6060 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6061 K2, and 0 if K1 and K2 are equal. */
6063 int
6065 {
6066 /* Consider a NULL key (such as arises with a `default' label) to be
6067 smaller than anything else. */
6074 }
6076 /* Process a case label, located at LOC, for the range LOW_VALUE
6077 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6078 then this case label is actually a `default' label. If only
6079 HIGH_VALUE is NULL_TREE, then case label was declared using the
6080 usual C/C++ syntax, rather than the GNU case range extension.
6081 CASES is a tree containing all the case ranges processed so far;
6082 COND is the condition for the switch-statement itself. Returns the
6083 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6084 is created. */
6086 tree
6089 {
6090 tree type;
6091 tree label;
6092 tree case_label;
6093 splay_tree_node node;
6095 /* Create the LABEL_DECL itself. */
6098 /* If there was an error processing the switch condition, bail now
6099 before we get more confused. */
6107 {
6110 }
6112 /* Case ranges are a GNU extension. */
6119 {
6124 }
6126 {
6131 }
6134 {
6135 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6136 really a case range, even though it was written that way.
6137 Remove the HIGH_VALUE to simplify later processing. */
6142 }
6144 /* See if the case is in range of the type of the original testing
6145 expression. If both low_value and high_value are out of range,
6146 don't insert the case label and return NULL_TREE. */
6152 /* Look up the LOW_VALUE in the table of case labels we already
6153 have. */
6155 /* If there was not an exact match, check for overlapping ranges.
6156 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6157 that's a `default' label and the only overlap is an exact match. */
6159 {
6160 splay_tree_node low_bound;
6161 splay_tree_node high_bound;
6163 /* Even though there wasn't an exact match, there might be an
6164 overlap between this case range and another case range.
6165 Since we've (inductively) not allowed any overlapping case
6166 ranges, we simply need to find the greatest low case label
6167 that is smaller that LOW_VALUE, and the smallest low case
6168 label that is greater than LOW_VALUE. If there is an overlap
6169 it will occur in one of these two ranges. */
6175 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6176 the LOW_VALUE, so there is no need to check unless the
6177 LOW_BOUND is in fact itself a case range. */
6183 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6184 range is bigger than the low end of the current range, so we
6185 are only interested if the current range is a real range, and
6186 not an ordinary case label. */
6188 && high_value
6190 high_value)
6193 }
6194 /* If there was an overlap, issue an error. */
6196 {
6200 {
6204 }
6206 {
6209 }
6210 else
6211 {
6215 }
6217 }
6219 /* Add a CASE_LABEL to the statement-tree. */
6221 /* Register this case label in the splay tree. */
6228 error_out:
6229 /* Add a label so that the back-end doesn't think that the beginning of
6230 the switch is unreachable. Note that we do not add a case label, as
6231 that just leads to duplicates and thence to failure later on. */
6233 {
6236 }
6238 }
6240 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6241 Used to verify that case values match up with enumerator values. */
6243 static void
6245 {
6252 else
6259 buf);
6260 else
6265 }
6267 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6268 Used to verify that case values match up with enumerator values. */
6270 static int
6272 {
6276 /* Skip default case. */
6280 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6281 when we did our enum->case scan. Reset our scratch bit after. */
6284 else
6287 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6288 not set, that means that CASE_HIGH did not appear when we did our
6289 enum->case scan. Reset our scratch bit after. */
6291 {
6294 else
6296 }
6299 }
6301 /* Handle -Wswitch*. Called from the front end after parsing the
6302 switch construct. */
6303 /* ??? Should probably be somewhere generic, since other languages
6304 besides C and C++ would want this. At the moment, however, C/C++
6305 are the only tree-ssa languages that support enumerations at all,
6306 so the point is moot. */
6308 void
6311 {
6312 splay_tree_node default_node;
6313 splay_tree_node node;
6314 tree chain;
6324 /* From here on, we only care about about enumerated types. */
6328 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6332 /* Check the cases. Warn about case values which are not members of
6333 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6334 there is no default case, check that exactly all enumeration
6335 literals are covered by the cases. */
6337 /* Clearing COND if it is not an integer constant simplifies
6338 the tests inside the loop below. */
6342 /* The time complexity here is O(N*lg(N)) worst case, but for the
6343 common case of monotonically increasing enumerators, it is
6344 O(N), since the nature of the splay tree will keep the next
6345 element adjacent to the root at all times. */
6348 {
6354 {
6355 /* Mark the CASE_LOW part of the case entry as seen. */
6359 }
6361 /* Even though there wasn't an exact match, there might be a
6362 case range which includes the enumerator's value. */
6365 {
6369 {
6370 /* If we match the upper bound exactly, mark the CASE_HIGH
6371 part of the case entry as seen. */
6375 }
6376 }
6378 /* We've now determined that this enumerated literal isn't
6379 handled by the case labels of the switch statement. */
6381 /* If the switch expression is a constant, we only really care
6382 about whether that constant is handled by the switch. */
6386 /* If there is a default_node, the only relevant option is
6387 Wswitch-enum. Otherwise, if both are enabled then we prefer
6388 to warn using -Wswitch because -Wswitch is enabled by -Wall
6389 while -Wswitch-enum is explicit. */
6392 ? OPT_Wswitch_enum
6396 }
6398 /* Warn if there are case expressions that don't correspond to
6399 enumerators. This can occur since C and C++ don't enforce
6400 type-checking of assignments to enumeration variables.
6402 The time complexity here is now always O(N) worst case, since
6403 we should have marked both the lower bound and upper bound of
6404 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6405 above. This scan also resets those fields. */
6408 }
6410 /* Finish an expression taking the address of LABEL (an
6411 IDENTIFIER_NODE). Returns an expression for the address.
6413 LOC is the location for the expression returned. */
6415 tree
6417 {
6418 tree result;
6428 else
6429 {
6432 /* The current function is not necessarily uninlinable.
6433 Computed gotos are incompatible with inlining, but the value
6434 here could be used only in a diagnostic, for example. */
6436 }
6439 }
6440 \f
6442 /* Given a boolean expression ARG, return a tree representing an increment
6443 or decrement (as indicated by CODE) of ARG. The front end must check for
6444 invalid cases (e.g., decrement in C++). */
6445 tree
6447 {
6448 tree val;
6453 {
6476 }
6479 }
6480 \f
6481 /* Built-in macros for stddef.h and stdint.h, that require macros
6482 defined in this file. */
6483 void
6485 {
6548 }
6550 static void
6552 {
6553 /* Fill in the built_in_attributes array. */
6554 #define DEF_ATTR_NULL_TREE(ENUM) \
6555 built_in_attributes[(int) ENUM] = NULL_TREE;
6556 #define DEF_ATTR_INT(ENUM, VALUE) \
6557 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6558 #define DEF_ATTR_STRING(ENUM, VALUE) \
6559 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6560 #define DEF_ATTR_IDENT(ENUM, STRING) \
6561 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6562 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6563 built_in_attributes[(int) ENUM] \
6564 = tree_cons (built_in_attributes[(int) PURPOSE], \
6565 built_in_attributes[(int) VALUE], \
6566 built_in_attributes[(int) CHAIN]);
6568 #undef DEF_ATTR_NULL_TREE
6569 #undef DEF_ATTR_INT
6570 #undef DEF_ATTR_IDENT
6571 #undef DEF_ATTR_TREE_LIST
6572 }
6574 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6575 identifier as an argument, so the front end shouldn't look it up. */
6577 bool
6579 {
6582 /* Unknown attribute that we'll end up ignoring, return true so we
6583 don't complain about an identifier argument. */
6589 else
6591 }
6593 /* Attribute handlers common to C front ends. */
6595 /* Handle a "packed" attribute; arguments as in
6596 struct attribute_spec.handler. */
6598 static tree
6601 {
6603 {
6607 }
6609 {
6611 /* Still pack bitfields. */
6616 else
6618 }
6619 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6620 used for DECL_REGISTER. It wouldn't mean anything anyway.
6621 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6622 that changes what the typedef is typing. */
6623 else
6624 {
6627 }
6630 }
6632 /* Handle a "nocommon" attribute; arguments as in
6633 struct attribute_spec.handler. */
6635 static tree
6639 {
6642 else
6643 {
6646 }
6649 }
6651 /* Handle a "common" attribute; arguments as in
6652 struct attribute_spec.handler. */
6654 static tree
6657 {
6660 else
6661 {
6664 }
6667 }
6669 /* Handle a "noreturn" attribute; arguments as in
6670 struct attribute_spec.handler. */
6672 static tree
6675 {
6678 /* See FIXME comment in c_common_attribute_table. */
6685 = (build_qualified_type
6686 (build_pointer_type
6690 else
6691 {
6694 }
6697 }
6699 /* Handle a "hot" and attribute; arguments as in
6700 struct attribute_spec.handler. */
6702 static tree
6705 {
6708 {
6710 {
6714 }
6715 /* Most of the rest of the hot processing is done later with
6716 lookup_attribute. */
6717 }
6718 else
6719 {
6722 }
6725 }
6727 /* Handle a "cold" and attribute; arguments as in
6728 struct attribute_spec.handler. */
6730 static tree
6733 {
6736 {
6738 {
6742 }
6743 /* Most of the rest of the cold processing is done later with
6744 lookup_attribute. */
6745 }
6746 else
6747 {
6750 }
6753 }
6755 /* Handle a "no_sanitize_address" attribute; arguments as in
6756 struct attribute_spec.handler. */
6758 static tree
6761 {
6763 {
6766 }
6769 }
6771 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6772 struct attribute_spec.handler. */
6774 static tree
6777 {
6786 }
6788 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6789 struct attribute_spec.handler. */
6791 static tree
6794 {
6796 {
6799 }
6802 }
6804 /* Handle a "stack_protect" attribute; arguments as in
6805 struct attribute_spec.handler. */
6806 static tree
6809 {
6811 {
6814 }
6815 else
6821 }
6823 /* Handle a "noinline" attribute; arguments as in
6824 struct attribute_spec.handler. */
6826 static tree
6830 {
6832 {
6834 {
6838 }
6839 else
6841 }
6842 else
6843 {
6846 }
6849 }
6851 /* Handle a "noclone" attribute; arguments as in
6852 struct attribute_spec.handler. */
6854 static tree
6858 {
6860 {
6863 }
6866 }
6868 /* Handle a "no_icf" attribute; arguments as in
6869 struct attribute_spec.handler. */
6871 static tree
6875 {
6877 {
6880 }
6883 }
6886 /* Handle a "always_inline" attribute; arguments as in
6887 struct attribute_spec.handler. */
6889 static tree
6894 {
6896 {
6898 {
6902 }
6903 else
6904 /* Set the attribute and mark it for disregarding inline
6905 limits. */
6907 }
6908 else
6909 {
6912 }
6915 }
6917 /* Handle a "gnu_inline" attribute; arguments as in
6918 struct attribute_spec.handler. */
6920 static tree
6925 {
6927 {
6928 /* Do nothing else, just set the attribute. We'll get at
6929 it later with lookup_attribute. */
6930 }
6931 else
6932 {
6935 }
6938 }
6940 /* Handle a "leaf" attribute; arguments as in
6941 struct attribute_spec.handler. */
6943 static tree
6947 {
6949 {
6952 }
6954 {
6957 }
6960 }
6962 /* Handle an "artificial" attribute; arguments as in
6963 struct attribute_spec.handler. */
6965 static tree
6970 {
6972 {
6973 /* Do nothing else, just set the attribute. We'll get at
6974 it later with lookup_attribute. */
6975 }
6976 else
6977 {
6980 }
6983 }
6985 /* Handle a "flatten" attribute; arguments as in
6986 struct attribute_spec.handler. */
6988 static tree
6990 tree args ATTRIBUTE_UNUSED,
6992 {
6994 /* Do nothing else, just set the attribute. We'll get at
6995 it later with lookup_attribute. */
6996 ;
6997 else
6998 {
7001 }
7004 }
7006 /* Handle a "warning" or "error" attribute; arguments as in
7007 struct attribute_spec.handler. */
7009 static tree
7012 {
7015 /* Do nothing else, just set the attribute. We'll get at
7016 it later with lookup_attribute. */
7017 ;
7018 else
7019 {
7022 }
7025 }
7027 /* Handle a "used" attribute; arguments as in
7028 struct attribute_spec.handler. */
7030 static tree
7033 {
7039 {
7044 }
7045 else
7046 {
7049 }
7052 }
7054 /* Handle a "unused" attribute; arguments as in
7055 struct attribute_spec.handler. */
7057 static tree
7060 {
7062 {
7070 {
7075 }
7076 else
7077 {
7080 }
7081 }
7082 else
7083 {
7087 }
7090 }
7092 /* Handle a "externally_visible" attribute; arguments as in
7093 struct attribute_spec.handler. */
7095 static tree
7100 {
7104 {
7107 {
7111 }
7112 }
7113 else
7114 {
7117 }
7120 }
7122 /* Handle the "no_reorder" attribute. Arguments as in
7123 struct attribute_spec.handler. */
7125 static tree
7127 tree name,
7128 tree,
7131 {
7136 {
7139 name);
7141 }
7144 }
7146 /* Handle a "const" attribute; arguments as in
7147 struct attribute_spec.handler. */
7149 static tree
7152 {
7155 /* See FIXME comment on noreturn in c_common_attribute_table. */
7161 = (build_qualified_type
7162 (build_pointer_type
7166 else
7167 {
7170 }
7173 }
7175 /* Handle a "transparent_union" attribute; arguments as in
7176 struct attribute_spec.handler. */
7178 static tree
7182 {
7183 tree type;
7194 {
7195 /* Make sure that the first field will work for a transparent union.
7196 If the type isn't complete yet, leave the check to the code in
7197 finish_struct. */
7199 {
7205 }
7208 {
7209 /* If the type isn't complete yet, setting the flag
7210 on a variant wouldn't ever be checked. */
7214 /* build_duplicate_type doesn't work for C++. */
7218 /* A type variant isn't good enough, since we don't a cast
7219 to such a type removed as a no-op. */
7221 }
7225 }
7227 ignored:
7230 }
7232 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7233 get the requested priority for a constructor or destructor,
7234 possibly issuing diagnostics for invalid or reserved
7235 priorities. */
7237 static priority_type
7239 {
7240 HOST_WIDE_INT pri;
7241 tree arg;
7247 {
7250 else
7253 }
7270 {
7273 "destructor priorities from 0 to %d are reserved "
7275 MAX_RESERVED_INIT_PRIORITY);
7276 else
7278 "constructor priorities from 0 to %d are reserved "
7280 MAX_RESERVED_INIT_PRIORITY);
7281 }
7284 invalid:
7287 MAX_INIT_PRIORITY);
7288 else
7290 MAX_INIT_PRIORITY);
7292 }
7294 /* Handle a "constructor" attribute; arguments as in
7295 struct attribute_spec.handler. */
7297 static tree
7301 {
7308 {
7309 priority_type priority;
7314 }
7315 else
7316 {
7319 }
7322 }
7324 /* Handle a "destructor" attribute; arguments as in
7325 struct attribute_spec.handler. */
7327 static tree
7331 {
7338 {
7339 priority_type priority;
7344 }
7345 else
7346 {
7349 }
7352 }
7354 /* Nonzero if the mode is a valid vector mode for this architecture.
7355 This returns nonzero even if there is no hardware support for the
7356 vector mode, but we can emulate with narrower modes. */
7358 static int
7360 {
7362 machine_mode innermode;
7364 /* Doh! What's going on? */
7373 /* Hardware support. Woo hoo! */
7379 /* We should probably return 1 if requesting V4DI and we have no DI,
7380 but we have V2DI, but this is probably very unlikely. */
7382 /* If we have support for the inner mode, we can safely emulate it.
7383 We may not have V2DI, but me can emulate with a pair of DIs. */
7385 }
7388 /* Handle a "mode" attribute; arguments as in
7389 struct attribute_spec.handler. */
7391 static tree
7394 {
7402 else
7403 {
7408 tree typefm;
7413 {
7419 }
7421 /* Change this type to have a type with the specified mode.
7422 First check for the special modes. */
7435 else
7438 {
7441 }
7444 {
7447 }
7451 {
7483 }
7485 {
7488 }
7491 {
7496 {
7499 }
7503 else
7506 }
7507 else
7508 {
7509 /* For fixed-point modes, we need to test if the signness of type
7510 and the machine mode are consistent. */
7513 {
7516 }
7517 /* For fixed-point modes, we need to pass saturating info. */
7521 }
7524 {
7527 }
7529 {
7530 /* For enumeral types, copy the precision from the integer
7531 type returned above. If not an INTEGER_TYPE, we can't use
7532 this mode for this type. */
7534 {
7537 }
7540 {
7543 }
7544 else
7545 {
7546 /* We cannot build a type variant, as there's code that assumes
7547 that TYPE_MAIN_VARIANT has the same mode. This includes the
7548 debug generators. Instead, create a subrange type. This
7549 results in all of the enumeral values being emitted only once
7550 in the original, and the subtype gets them by reference. */
7553 else
7556 }
7557 }
7561 {
7564 }
7567 }
7570 }
7572 /* Handle a "section" attribute; arguments as in
7573 struct attribute_spec.handler. */
7575 static tree
7578 {
7582 {
7588 {
7592 {
7594 "section attribute cannot be specified for "
7597 }
7599 /* The decl may have already been given a section attribute
7600 from a previous declaration. Ensure they match. */
7604 {
7608 }
7612 {
7615 }
7616 else
7619 }
7620 else
7621 {
7624 }
7625 }
7626 else
7627 {
7631 }
7634 }
7636 /* Check whether ALIGN is a valid user-specified alignment. If so,
7637 return its base-2 log; if not, output an error and return -1. If
7638 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7639 no error. */
7640 int
7642 {
7649 {
7652 }
7657 {
7660 }
7662 {
7665 }
7667 }
7669 /*
7670 If in c++-11, check if the c++-11 alignment constraint with respect
7671 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7672 c++-11 mode, does nothing.
7674 [dcl.align]2/ says:
7676 [* if the constant expression evaluates to a fundamental alignment,
7677 the alignment requirement of the declared entity shall be the
7678 specified fundamental alignment.
7680 * if the constant expression evaluates to an extended alignment
7681 and the implementation supports that alignment in the context
7682 of the declaration, the alignment of the declared entity shall
7683 be that alignment
7685 * if the constant expression evaluates to an extended alignment
7686 and the implementation does not support that alignment in the
7687 context of the declaration, the program is ill-formed]. */
7689 static bool
7693 {
7706 {
7708 {
7709 /* For file scope variables and static members, the target
7710 supports alignments that are at most
7711 MAX_OFILE_ALIGNMENT. */
7714 }
7715 else
7716 {
7717 #ifdef BIGGEST_FIELD_ALIGNMENT
7718 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7719 #else
7720 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7721 #endif
7722 /* For non-static members, the target supports either
7723 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7724 if it is defined or BIGGEST_ALIGNMENT. */
7729 #undef MAX_TARGET_FIELD_ALIGNMENT
7730 /* For stack variables, the target supports at most
7731 MAX_STACK_ALIGNMENT. */
7735 }
7736 }
7738 {
7739 /* Let's be liberal for types. */
7742 }
7750 }
7752 /* Handle a "aligned" attribute; arguments as in
7753 struct attribute_spec.handler. */
7755 static tree
7758 {
7762 tree align_expr;
7766 {
7771 }
7772 else
7776 {
7780 }
7788 {
7791 /* If we have a TYPE_DECL, then copy the type, so that we
7792 don't accidentally modify a builtin type. See pushdecl. */
7795 {
7802 }
7803 else
7808 }
7811 {
7814 }
7817 /* C++-11 [dcl.align/4]:
7819 When multiple alignment-specifiers are specified for an
7820 entity, the alignment requirement shall be set to the
7821 strictest specified alignment.
7823 This formally comes from the c++11 specification but we are
7824 doing it for the GNU attribute syntax as well. */
7828 {
7833 else
7837 }
7838 else
7839 {
7842 }
7845 }
7847 /* Handle a "weak" attribute; arguments as in
7848 struct attribute_spec.handler. */
7850 static tree
7855 {
7858 {
7861 }
7863 {
7867 }
7870 {
7875 }
7876 else
7880 }
7882 /* Handle an "alias" or "ifunc" attribute; arguments as in
7883 struct attribute_spec.handler, except that IS_ALIAS tells us
7884 whether this is an alias as opposed to ifunc attribute. */
7886 static tree
7889 {
7894 {
7897 }
7901 /* A static variable declaration is always a tentative definition,
7902 but the alias is a non-tentative definition which overrides. */
7905 {
7909 }
7913 {
7917 }
7919 /* Note that the very first time we process a nested declaration,
7920 decl_function_context will not be set. Indeed, *would* never
7921 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7922 we do below. After such frobbery, pushdecl would set the context.
7923 In any case, this is never what we want. */
7925 {
7926 tree id;
7930 {
7934 }
7936 /* This counts as a use of the object pointed to. */
7941 else
7945 /* ifuncs are also aliases, so set that attribute too. */
7948 }
7949 else
7950 {
7953 }
7956 {
7959 {
7962 else
7964 }
7965 }
7969 }
7971 /* Handle an "alias" or "ifunc" attribute; arguments as in
7972 struct attribute_spec.handler. */
7974 static tree
7977 {
7979 }
7981 /* Handle an "alias" or "ifunc" attribute; arguments as in
7982 struct attribute_spec.handler. */
7984 static tree
7987 {
7989 }
7991 /* Handle a "weakref" attribute; arguments as in struct
7992 attribute_spec.handler. */
7994 static tree
7997 {
8000 /* We must ignore the attribute when it is associated with
8001 local-scoped decls, since attribute alias is ignored and many
8002 such symbols do not even have a DECL_WEAK field. */
8004 || current_function_decl
8006 {
8010 }
8013 {
8017 }
8019 /* The idea here is that `weakref("name")' mutates into `weakref,
8020 alias("name")', and weakref without arguments, in turn,
8021 implicitly adds weak. */
8024 {
8031 }
8032 else
8033 {
8038 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8039 and that isn't supported; and because it wants to add it to
8040 the list of weak decls, which isn't helpful. */
8042 }
8045 {
8049 }
8052 }
8054 /* Handle an "visibility" attribute; arguments as in
8055 struct attribute_spec.handler. */
8057 static tree
8061 {
8067 {
8071 {
8073 name);
8075 }
8077 {
8081 }
8082 }
8084 {
8087 }
8090 {
8093 }
8095 /* If this is a type, set the visibility on the type decl. */
8097 {
8102 {
8104 name);
8106 }
8107 }
8117 else
8118 {
8119 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8121 }
8125 {
8139 }
8144 /* Go ahead and attach the attribute to the node as well. This is needed
8145 so we can determine whether we have VISIBILITY_DEFAULT because the
8146 visibility was not specified, or because it was explicitly overridden
8147 from the containing scope. */
8150 }
8152 /* Determine the ELF symbol visibility for DECL, which is either a
8153 variable or a function. It is an error to use this function if a
8154 definition of DECL is not available in this translation unit.
8155 Returns true if the final visibility has been determined by this
8156 function; false if the caller is free to make additional
8157 modifications. */
8159 bool
8161 {
8165 /* If the user explicitly specified the visibility with an
8166 attribute, honor that. DECL_VISIBILITY will have been set during
8167 the processing of the attribute. We check for an explicit
8168 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8169 to distinguish the use of an attribute from the use of a "#pragma
8170 GCC visibility push(...)"; in the latter case we still want other
8171 considerations to be able to overrule the #pragma. */
8173 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8178 /* Set default visibility to whatever the user supplied with
8179 visibility_specified depending on #pragma GCC visibility. */
8181 {
8184 {
8187 /* If visibility changed and DECL already has DECL_RTL, ensure
8188 symbol flags are updated. */
8193 }
8194 }
8196 }
8198 /* Handle an "tls_model" attribute; arguments as in
8199 struct attribute_spec.handler. */
8201 static tree
8204 {
8205 tree id;
8212 {
8215 }
8220 {
8223 }
8233 else
8234 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8238 }
8240 /* Handle a "no_instrument_function" attribute; arguments as in
8241 struct attribute_spec.handler. */
8243 static tree
8248 {
8252 {
8256 }
8257 else
8261 }
8263 /* Handle a "malloc" attribute; arguments as in
8264 struct attribute_spec.handler. */
8266 static tree
8269 {
8273 else
8274 {
8277 }
8280 }
8282 /* Handle a "alloc_size" attribute; arguments as in
8283 struct attribute_spec.handler. */
8285 static tree
8288 {
8291 {
8298 || !arg_count
8300 {
8305 }
8306 }
8308 }
8310 /* Handle a "alloc_align" attribute; arguments as in
8311 struct attribute_spec.handler. */
8313 static tree
8316 {
8323 || !arg_count
8325 {
8330 }
8332 }
8334 /* Handle a "assume_aligned" attribute; arguments as in
8335 struct attribute_spec.handler. */
8337 static tree
8340 {
8342 {
8349 {
8354 }
8355 }
8357 }
8359 /* Handle a "fn spec" attribute; arguments as in
8360 struct attribute_spec.handler. */
8362 static tree
8366 {
8371 }
8373 /* Handle a "bnd_variable_size" attribute; arguments as in
8374 struct attribute_spec.handler. */
8376 static tree
8379 {
8381 {
8384 }
8387 }
8389 /* Handle a "bnd_legacy" attribute; arguments as in
8390 struct attribute_spec.handler. */
8392 static tree
8395 {
8397 {
8400 }
8403 }
8405 /* Handle a "bnd_instrument" attribute; arguments as in
8406 struct attribute_spec.handler. */
8408 static tree
8411 {
8413 {
8416 }
8419 }
8421 /* Handle a "warn_unused" attribute; arguments as in
8422 struct attribute_spec.handler. */
8424 static tree
8426 tree args ATTRIBUTE_UNUSED,
8428 {
8430 /* Do nothing else, just set the attribute. We'll get at
8431 it later with lookup_attribute. */
8432 ;
8433 else
8434 {
8437 }
8440 }
8442 /* Handle an "omp declare simd" attribute; arguments as in
8443 struct attribute_spec.handler. */
8445 static tree
8447 {
8449 }
8451 /* Handle an "omp declare target" attribute; arguments as in
8452 struct attribute_spec.handler. */
8454 static tree
8456 {
8458 }
8460 /* Handle a "returns_twice" attribute; arguments as in
8461 struct attribute_spec.handler. */
8463 static tree
8466 {
8469 else
8470 {
8473 }
8476 }
8478 /* Handle a "no_limit_stack" attribute; arguments as in
8479 struct attribute_spec.handler. */
8481 static tree
8486 {
8490 {
8494 }
8496 {
8500 }
8501 else
8505 }
8507 /* Handle a "pure" attribute; arguments as in
8508 struct attribute_spec.handler. */
8510 static tree
8513 {
8516 /* ??? TODO: Support types. */
8517 else
8518 {
8521 }
8524 }
8526 /* Digest an attribute list destined for a transactional memory statement.
8527 ALLOWED is the set of attributes that are allowed for this statement;
8528 return the attribute we parsed. Multiple attributes are never allowed. */
8530 int
8532 {
8537 {
8545 {
8548 }
8551 {
8554 }
8557 else
8559 }
8562 }
8564 /* Transform a TM attribute name into a maskable integer and back.
8565 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8566 to how the lack of an attribute is treated. */
8568 int
8570 {
8584 }
8586 tree
8588 {
8591 {
8609 }
8611 }
8613 /* Return the first TM attribute seen in LIST. */
8615 tree
8617 {
8619 {
8623 }
8625 }
8627 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8628 Here we accept only function types, and verify that none of the other
8629 function TM attributes are also applied. */
8630 /* ??? We need to accept class types for C++, but not C. This greatly
8631 complicates this function, since we can no longer rely on the extra
8632 processing given by function_type_required. */
8634 static tree
8637 {
8638 /* Only one path adds the attribute; others don't. */
8642 {
8645 /* Only tm_callable and tm_safe apply to classes. */
8648 /* FALLTHRU */
8652 {
8655 ;
8658 else
8660 }
8664 {
8667 {
8672 }
8673 }
8674 /* FALLTHRU */
8677 /* If a function is next, pass it on to be tried next. */
8681 ignored:
8684 }
8687 }
8689 /* Handle the TM_WRAP attribute; arguments as in
8690 struct attribute_spec.handler. */
8692 static tree
8695 {
8698 /* We don't need the attribute even on success, since we
8699 record the entry in an external table. */
8704 else
8705 {
8708 ;
8713 else
8714 {
8718 {
8722 else
8724 }
8725 else
8727 }
8728 }
8731 }
8733 /* Ignore the given attribute. Used when this attribute may be usefully
8734 overridden by the target, but is not used generically. */
8736 static tree
8740 {
8743 }
8745 /* Handle a "no vops" attribute; arguments as in
8746 struct attribute_spec.handler. */
8748 static tree
8752 {
8756 }
8758 /* Handle a "deprecated" attribute; arguments as in
8759 struct attribute_spec.handler. */
8761 static tree
8765 {
8773 {
8776 }
8779 {
8790 else
8792 }
8794 {
8799 }
8800 else
8804 {
8807 {
8813 }
8816 else
8818 }
8821 }
8823 /* Handle a "vector_size" attribute; arguments as in
8824 struct attribute_spec.handler. */
8826 static tree
8830 {
8832 machine_mode orig_mode;
8843 {
8846 }
8848 /* Get the vector size (in bytes). */
8851 /* We need to provide for vector pointers, vector arrays, and
8852 functions returning vectors. For example:
8854 __attribute__((vector_size(16))) short *foo;
8856 In this case, the mode is SI, but the type being modified is
8857 HI, so we need to look further. */
8866 /* Get the mode of the type being modified. */
8877 {
8880 }
8883 {
8886 }
8889 {
8892 }
8894 /* Calculate how many units fit in the vector. */
8897 {
8900 }
8904 /* Build back pointers if needed. */
8908 }
8910 /* Handle the "nonnull" attribute. */
8911 static tree
8915 {
8919 /* If no arguments are specified, all pointer arguments should be
8920 non-null. Verify a full prototype is given so that the arguments
8921 will have the correct types when we actually check them later. */
8923 {
8925 {
8928 }
8930 }
8932 /* Argument list specified. Verify that each argument number references
8933 a pointer argument. */
8935 {
8944 {
8949 }
8952 {
8953 function_args_iterator iter;
8954 tree argument;
8958 {
8962 }
8966 {
8971 }
8974 {
8979 }
8980 }
8981 }
8984 }
8986 /* Check the argument list of a function call for null in argument slots
8987 that are marked as requiring a non-null pointer argument. The NARGS
8988 arguments are passed in the array ARGARRAY.
8989 */
8991 static void
8993 {
8994 tree a;
9002 /* See if any of the nonnull attributes has no arguments. If so,
9003 then every pointer argument is checked (in which case the check
9004 for pointer type is done in check_nonnull_arg). */
9006 do
9014 else
9015 {
9016 /* Walk the argument list. If we encounter an argument number we
9017 should check for non-null, do it. */
9019 {
9021 {
9025 }
9030 }
9031 }
9032 }
9034 /* Check that the Nth argument of a function call (counting backwards
9035 from the end) is a (pointer)0. The NARGS arguments are passed in the
9036 array ARGARRAY. */
9038 static void
9040 {
9044 {
9047 tree sentinel;
9048 function_args_iterator iter;
9049 tree t;
9051 /* Skip over the named arguments. */
9053 {
9056 len++;
9057 }
9060 {
9063 }
9065 /* The sentinel must be one of the varargs, i.e.
9066 in position >= the number of fixed arguments. */
9068 {
9072 }
9074 /* Validate the sentinel. */
9078 /* Although __null (in C++) is only an integer we allow it
9079 nevertheless, as we are guaranteed that it's exactly
9080 as wide as a pointer, and we don't want to force
9081 users to cast the NULL they have written there.
9082 We warn with -Wstrict-null-sentinel, though. */
9085 }
9086 }
9088 /* Helper for check_function_nonnull; given a list of operands which
9089 must be non-null in ARGS, determine if operand PARAM_NUM should be
9090 checked. */
9092 static bool
9094 {
9098 {
9105 }
9107 }
9109 /* Check that the function argument PARAM (which is operand number
9110 PARAM_NUM) is non-null. This is called by check_function_nonnull
9111 via check_function_arguments_recurse. */
9113 static void
9116 {
9117 /* Just skip checking the argument if it's not a pointer. This can
9118 happen if the "nonnull" attribute was given without an operand
9119 list (which means to check every pointer argument). */
9127 }
9129 /* Helper for nonnull attribute handling; fetch the operand number
9130 from the attribute argument list. */
9132 static bool
9134 {
9135 /* Verify the arg number is a small constant. */
9137 {
9140 }
9141 else
9143 }
9145 /* Handle a "nothrow" attribute; arguments as in
9146 struct attribute_spec.handler. */
9148 static tree
9151 {
9154 /* ??? TODO: Support types. */
9155 else
9156 {
9159 }
9162 }
9164 /* Handle a "cleanup" attribute; arguments as in
9165 struct attribute_spec.handler. */
9167 static tree
9170 {
9174 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9175 for global destructors in C++. This requires infrastructure that
9176 we don't have generically at the moment. It's also not a feature
9177 we'd be missing too much, since we do have attribute constructor. */
9179 {
9183 }
9185 /* Verify that the argument is a function in scope. */
9186 /* ??? We could support pointers to functions here as well, if
9187 that was considered desirable. */
9190 {
9194 }
9197 {
9201 }
9203 /* That the function has proper type is checked with the
9204 eventual call to build_function_call. */
9207 }
9209 /* Handle a "warn_unused_result" attribute. No special handling. */
9211 static tree
9215 {
9216 /* Ignore the attribute for functions not returning any value. */
9218 {
9221 }
9224 }
9226 /* Handle a "sentinel" attribute. */
9228 static tree
9231 {
9233 {
9237 }
9238 else
9239 {
9241 {
9245 }
9246 }
9249 {
9257 {
9261 }
9262 else
9263 {
9265 {
9269 }
9270 }
9271 }
9274 }
9276 /* Handle a "type_generic" attribute. */
9278 static tree
9282 {
9283 /* Ensure we have a function type. */
9286 /* Ensure we have a variadic function. */
9290 }
9292 /* Handle a "target" attribute. */
9294 static tree
9297 {
9298 /* Ensure we have a function type. */
9300 {
9303 }
9305 flags))
9309 }
9311 /* Arguments being collected for optimization. */
9316 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9317 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9318 false for #pragma GCC optimize. */
9320 bool
9322 {
9330 tree ap;
9332 /* Build up argv vector. Just in case the string is stored away, use garbage
9333 collected strings. */
9338 {
9342 {
9346 }
9349 {
9350 /* Split string into multiple substrings. */
9358 {
9365 {
9369 }
9370 else
9371 {
9374 }
9378 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9379 options. */
9381 {
9386 else
9390 }
9393 {
9396 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9397 itself is -Os, and any other switch begins with a -f. */
9403 }
9408 }
9410 }
9411 }
9421 /* Now parse the options. */
9431 /* Don't allow changing -fstrict-aliasing. */
9436 }
9438 /* For handling "optimize" attribute. arguments as in
9439 struct attribute_spec.handler. */
9441 static tree
9444 {
9445 /* Ensure we have a function type. */
9447 {
9450 }
9451 else
9452 {
9456 /* Save current options. */
9459 /* If we previously had some optimization options, use them as the
9460 default. */
9465 /* Parse options, and update the vector. */
9470 /* Restore current options. */
9472 }
9475 }
9477 /* Handle a "no_split_stack" attribute. */
9479 static tree
9484 {
9488 {
9492 }
9494 {
9498 }
9501 }
9503 /* Handle a "returns_nonnull" attribute; arguments as in
9504 struct attribute_spec.handler. */
9506 static tree
9509 {
9510 // Even without a prototype we still have a return type we can check.
9512 {
9515 }
9517 }
9519 /* Handle a "designated_init" attribute; arguments as in
9520 struct attribute_spec.handler. */
9522 static tree
9525 {
9527 {
9530 }
9532 }
9534 \f
9535 /* Check for valid arguments being passed to a function with FNTYPE.
9536 There are NARGS arguments in the array ARGARRAY. */
9537 void
9539 {
9540 /* Check for null being passed in a pointer argument that must be
9541 non-null. We also need to do this if format checking is enabled. */
9546 /* Check for errors in format strings. */
9553 }
9555 /* Generic argument checking recursion routine. PARAM is the argument to
9556 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9557 once the argument is resolved. CTX is context for the callback. */
9558 void
9563 {
9567 {
9568 /* Strip coercion. */
9572 }
9575 {
9577 tree attrs;
9580 /* See if this is a call to a known internationalization function
9581 that modifies a format arg. Such a function may have multiple
9582 format_arg attributes (for example, ngettext). */
9585 attrs;
9588 {
9589 tree inner_arg;
9590 tree format_num_expr;
9593 call_expr_arg_iterator iter;
9595 /* Extract the argument number, which was previously checked
9596 to be valid. */
9605 {
9610 }
9611 }
9613 /* If we found a format_arg attribute and did a recursive check,
9614 we are done with checking this argument. Otherwise, we continue
9615 and this will be considered a non-literal. */
9618 }
9621 {
9622 /* Check both halves of the conditional expression. */
9628 }
9631 }
9633 /* Checks for a builtin function FNDECL that the number of arguments
9634 NARGS against the required number REQUIRED and issues an error if
9635 there is a mismatch. Returns true if the number of arguments is
9636 correct, otherwise false. */
9638 static bool
9640 {
9642 {
9646 }
9648 {
9652 }
9654 }
9656 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9657 Returns false if there was an error, otherwise true. */
9659 bool
9661 {
9667 {
9677 {
9679 {
9683 }
9685 }
9695 {
9702 {
9706 }
9708 }
9713 {
9718 {
9722 }
9725 {
9727 fndecl);
9729 }
9731 }
9736 {
9738 {
9741 }
9743 }
9750 {
9754 {
9758 }
9761 {
9765 }
9767 }
9772 }
9773 }
9775 /* Function to help qsort sort FIELD_DECLs by name order. */
9777 int
9779 {
9784 /* A nontype is "greater" than a type. */
9793 }
9796 gt_pointer_operator new_value;
9800 /* This routine compares two fields like field_decl_cmp but using the
9801 pointer operator in resort_data. */
9803 static int
9805 {
9810 /* A nontype is "greater" than a type. */
9816 {
9823 }
9825 }
9827 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9829 void
9832 gt_pointer_operator new_value,
9834 {
9839 resort_field_decl_cmp);
9840 }
9842 /* Subroutine of c_parse_error.
9843 Return the result of concatenating LHS and RHS. RHS is really
9844 a string literal, its first character is indicated by RHS_START and
9845 RHS_SIZE is its length (including the terminating NUL character).
9847 The caller is responsible for deleting the returned pointer. */
9851 {
9857 }
9859 /* Issue the error given by GMSGID, indicating that it occurred before
9860 TOKEN, which had the associated VALUE. */
9862 void
9865 {
9866 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9876 {
9881 {
9894 }
9898 else
9904 }
9926 {
9931 }
9939 {
9944 }
9945 else
9949 {
9952 }
9953 #undef catenate_messages
9954 }
9956 /* Return the gcc option code associated with the reason for a cpp
9957 message, or 0 if none. */
9959 static int
9961 {
9965 {
9968 }
9970 }
9972 /* Callback from cpp_error for PFILE to print diagnostics from the
9973 preprocessor. The diagnostic is of type LEVEL, with REASON set
9974 to the reason code if LEVEL is represents a warning, at location
9975 LOCATION unless this is after lexing and the compiler's location
9976 should be used instead, with column number possibly overridden by
9977 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9978 the arguments. Returns true if a diagnostic was emitted, false
9979 otherwise. */
9981 bool
9985 {
9986 diagnostic_info diagnostic;
9987 diagnostic_t dlevel;
9992 {
9997 /* Fall through. */
10022 }
10035 }
10037 /* Convert a character from the host to the target execution character
10038 set. cpplib handles this, mostly. */
10040 HOST_WIDE_INT
10042 {
10043 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10044 zero-extended under -fno-signed-char. cpplib insists that characters
10045 and character constants are always unsigned. Hence we must convert
10046 back and forth. */
10054 else
10056 }
10058 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10059 references with an INDIRECT_REF of a constant at the bottom; much like the
10060 traditional rendering of offsetof as a macro. Return the folded result. */
10062 tree
10064 {
10068 {
10084 {
10087 }
10097 {
10101 }
10114 /* Check if the offset goes beyond the upper bound of the array. */
10116 {
10122 {
10126 {
10127 tree v;
10134 {
10142 }
10143 /* Don't warn if the array might be considered a poor
10144 man's flexible array member with a very permissive
10145 definition thereof. */
10149 "index %E denotes an offset "
10152 }
10153 }
10154 }
10161 /* Handle static members of volatile structs. */
10168 }
10171 }
10173 /* Likewise, but convert it to the return type of offsetof. */
10175 tree
10177 {
10179 }
10181 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10182 expression, because B will always be true. */
10184 void
10186 {
10189 "the omitted middle operand in ?: will always be %<true%>, "
10191 }
10193 /* Give an error for storing into ARG, which is 'const'. USE indicates
10194 how ARG was being used. */
10196 void
10198 {
10201 /* Using this macro rather than (for example) arrays of messages
10202 ensures that all the format strings are checked at compile
10203 time. */
10204 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10205 : (use == lv_increment ? (I) \
10206 : (use == lv_decrement ? (D) : (AS))))
10208 {
10219 else
10225 }
10231 arg);
10237 arg);
10239 {
10249 arg);
10250 }
10256 arg);
10257 else
10262 arg);
10263 }
10265 /* Print an error message for an invalid lvalue. USE says
10266 how the lvalue is being used and so selects the error message. LOC
10267 is the location for the error. */
10269 void
10271 {
10273 {
10291 }
10292 }
10294 /* Print an error message for an invalid indirection of type TYPE.
10295 ERRSTRING is the name of the operator for the indirection. */
10297 void
10299 {
10301 {
10309 type);
10314 type);
10319 type);
10324 type);
10329 type);
10333 }
10334 }
10335 \f
10336 /* *PTYPE is an incomplete array. Complete it with a domain based on
10337 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10338 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10339 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10341 int
10343 {
10351 {
10353 {
10354 int eltsize
10357 }
10359 {
10363 {
10367 }
10368 else
10369 {
10370 tree curindex;
10381 {
10385 else
10386 {
10388 {
10389 /* Since we treat size types now as ordinary
10390 unsigned types, we need an explicit overflow
10391 check. */
10395 }
10397 size_one_node);
10398 }
10401 }
10403 {
10407 }
10408 }
10409 }
10410 else
10411 {
10412 /* Make an error message unless that happened already. */
10415 }
10416 }
10417 else
10418 {
10422 }
10429 else
10432 /* Using build_distinct_type_copy and modifying things afterward instead
10433 of using build_array_type to create a new type preserves all of the
10434 TYPE_LANG_FLAG_? bits that the front end may have set. */
10442 /* Make sure we have the canonical MAIN_TYPE. */
10445 hashcode);
10448 /* Fix the canonical type. */
10458 else
10463 else
10469 {
10471 /* If we proceed with the array type as it is, we'll eventually
10472 crash in tree_to_[su]hwi(). */
10474 }
10478 }
10480 /* Like c_mark_addressable but don't check register qualifier. */
10481 void
10483 {
10489 }
10492 \f
10493 /* Used to help initialize the builtin-types.def table. When a type of
10494 the correct size doesn't exist, use error_mark_node instead of NULL.
10495 The later results in segfaults even when a decl using the type doesn't
10496 get invoked. */
10498 tree
10500 {
10503 }
10505 /* A helper function for resolve_overloaded_builtin in resolving the
10506 overloaded __sync_ builtins. Returns a positive power of 2 if the
10507 first operand of PARAMS is a pointer to a supported data type.
10508 Returns 0 if an error is encountered. */
10510 static int
10512 {
10513 tree type;
10517 {
10520 }
10524 {
10525 /* Force array-to-pointer decay for C++. */
10529 }
10541 incompatible:
10544 }
10546 /* A helper function for resolve_overloaded_builtin. Adds casts to
10547 PARAMS to make arguments match up with those of FUNCTION. Drops
10548 the variadic arguments at the end. Returns false if some error
10549 was encountered; true on success. */
10551 static bool
10554 {
10555 function_args_iterator iter;
10556 tree ptype;
10560 /* We've declared the implementation functions to use "volatile void *"
10561 as the pointer parameter, so we shouldn't get any complaints from the
10562 call to check_function_arguments what ever type the user used. */
10567 /* For the rest of the values, we need to cast these to FTYPE, so that we
10568 don't get warnings for passing pointer types, etc. */
10571 {
10575 /* XXX void_type_node belies the abstraction. */
10581 {
10584 }
10586 /* Only convert parameters if arg_type is unsigned integer type with
10587 new format sync routines, i.e. don't attempt to convert pointer
10588 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10589 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10590 kinds). */
10592 {
10593 /* Ideally for the first conversion we'd use convert_for_assignment
10594 so that we get warnings for anything that doesn't match the pointer
10595 type. This isn't portable across the C and C++ front ends atm. */
10600 }
10603 }
10605 /* __atomic routines are not variadic. */
10607 {
10610 }
10612 /* The definition of these primitives is variadic, with the remaining
10613 being "an optional list of variables protected by the memory barrier".
10614 No clue what that's supposed to mean, precisely, but we consider all
10615 call-clobbered variables to be protected so we're safe. */
10619 }
10621 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10622 RESULT to make it match the type of the first pointer argument in
10623 PARAMS. */
10625 static tree
10627 {
10632 /* New format doesn't require casting unless the types are the same size. */
10635 else
10637 }
10639 /* This function verifies the PARAMS to generic atomic FUNCTION.
10640 It returns the size if all the parameters are the same size, otherwise
10641 0 is returned if the parameters are invalid. */
10643 static int
10646 {
10651 tree type_0;
10653 /* Determine the parameter makeup. */
10655 {
10671 }
10674 {
10677 }
10679 /* Get type of first parameter, and determine its size. */
10682 {
10683 /* Force array-to-pointer decay for C++. */
10687 }
10689 {
10691 function);
10693 }
10695 /* Types must be compile time constant sizes. */
10697 {
10700 function);
10702 }
10706 /* Zero size objects are not allowed. */
10708 {
10711 function);
10713 }
10715 /* Check each other parameter is a pointer and the same size. */
10717 {
10720 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10724 {
10726 function);
10728 }
10732 {
10734 function);
10736 }
10737 }
10739 /* Check memory model parameters for validity. */
10741 {
10744 {
10747 {
10750 function);
10751 }
10752 }
10753 else
10755 {
10757 function);
10759 }
10760 }
10763 }
10766 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10767 at the beginning of the parameter list PARAMS representing the size of the
10768 objects. This is to match the library ABI requirement. LOC is the location
10769 of the function call.
10770 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10771 returned to allow the external call to be constructed. */
10773 static tree
10776 {
10777 tree size_node;
10779 /* Insert a SIZE_T parameter as the first param. If there isn't
10780 enough space, allocate a new vector and recursively re-build with that. */
10782 {
10785 tree f;
10795 }
10797 /* Add the size parameter and leave as a function call for processing. */
10801 }
10804 /* Return whether atomic operations for naturally aligned N-byte
10805 arguments are supported, whether inline or through libatomic. */
10806 static bool
10808 {
10810 {
10822 }
10823 }
10825 /* This will process an __atomic_exchange function call, determine whether it
10826 needs to be mapped to the _N variation, or turned into a library call.
10827 LOC is the location of the builtin call.
10828 FUNCTION is the DECL that has been invoked;
10829 PARAMS is the argument list for the call. The return value is non-null
10830 TRUE is returned if it is translated into the proper format for a call to the
10831 external library, and NEW_RETURN is set the tree for that function.
10832 FALSE is returned if processing for the _N variation is required, and
10833 NEW_RETURN is set to the the return value the result is copied into. */
10834 static bool
10837 {
10842 /* Size of 0 is an error condition. */
10844 {
10847 }
10849 /* If not a lock-free size, change to the library generic format. */
10851 {
10854 }
10856 /* Otherwise there is a lockfree match, transform the call from:
10857 void fn(T* mem, T* desired, T* return, model)
10858 into
10859 *return = (T) (fn (In* mem, (In) *desired, model)) */
10866 /* Create pointer to appropriate size. */
10870 /* Convert object pointer to required type. */
10873 /* Convert new value to required type, and dereference it. */
10878 /* Move memory model to the 3rd position, and end param list. */
10882 /* Convert return pointer and dereference it for later assignment. */
10886 }
10889 /* This will process an __atomic_compare_exchange function call, determine
10890 whether it needs to be mapped to the _N variation, or turned into a lib call.
10891 LOC is the location of the builtin call.
10892 FUNCTION is the DECL that has been invoked;
10893 PARAMS is the argument list for the call. The return value is non-null
10894 TRUE is returned if it is translated into the proper format for a call to the
10895 external library, and NEW_RETURN is set the tree for that function.
10896 FALSE is returned if processing for the _N variation is required. */
10898 static bool
10902 {
10907 /* Size of 0 is an error condition. */
10909 {
10912 }
10914 /* If not a lock-free size, change to the library generic format. */
10916 {
10917 /* The library generic format does not have the weak parameter, so
10918 remove it from the param list. Since a parameter has been removed,
10919 we can be sure that there is room for the SIZE_T parameter, meaning
10920 there will not be a recursive rebuilding of the parameter list, so
10921 there is no danger this will be done twice. */
10923 {
10927 }
10930 }
10932 /* Otherwise, there is a match, so the call needs to be transformed from:
10933 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10934 into
10935 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10941 /* Create pointer to appropriate size. */
10945 /* Convert object pointer to required type. */
10949 /* Convert expected pointer to required type. */
10953 /* Convert desired value to required type, and dereference it. */
10958 /* The rest of the parameters are fine. NULL means no special return value
10959 processing.*/
10962 }
10965 /* This will process an __atomic_load function call, determine whether it
10966 needs to be mapped to the _N variation, or turned into a library call.
10967 LOC is the location of the builtin call.
10968 FUNCTION is the DECL that has been invoked;
10969 PARAMS is the argument list for the call. The return value is non-null
10970 TRUE is returned if it is translated into the proper format for a call to the
10971 external library, and NEW_RETURN is set the tree for that function.
10972 FALSE is returned if processing for the _N variation is required, and
10973 NEW_RETURN is set to the the return value the result is copied into. */
10975 static bool
10978 {
10983 /* Size of 0 is an error condition. */
10985 {
10988 }
10990 /* If not a lock-free size, change to the library generic format. */
10992 {
10995 }
10997 /* Otherwise, there is a match, so the call needs to be transformed from:
10998 void fn(T* mem, T* return, model)
10999 into
11000 *return = (T) (fn ((In *) mem, model)) */
11006 /* Create pointer to appropriate size. */
11010 /* Convert object pointer to required type. */
11014 /* Move memory model to the 2nd position, and end param list. */
11018 /* Convert return pointer and dereference it for later assignment. */
11022 }
11025 /* This will process an __atomic_store function call, determine whether it
11026 needs to be mapped to the _N variation, or turned into a library call.
11027 LOC is the location of the builtin call.
11028 FUNCTION is the DECL that has been invoked;
11029 PARAMS is the argument list for the call. The return value is non-null
11030 TRUE is returned if it is translated into the proper format for a call to the
11031 external library, and NEW_RETURN is set the tree for that function.
11032 FALSE is returned if processing for the _N variation is required, and
11033 NEW_RETURN is set to the the return value the result is copied into. */
11035 static bool
11038 {
11043 /* Size of 0 is an error condition. */
11045 {
11048 }
11050 /* If not a lock-free size, change to the library generic format. */
11052 {
11055 }
11057 /* Otherwise, there is a match, so the call needs to be transformed from:
11058 void fn(T* mem, T* value, model)
11059 into
11060 fn ((In *) mem, (In) *value, model) */
11065 /* Create pointer to appropriate size. */
11069 /* Convert object pointer to required type. */
11073 /* Convert new value to required type, and dereference it. */
11078 /* The memory model is in the right spot already. Return is void. */
11082 }
11085 /* Some builtin functions are placeholders for other expressions. This
11086 function should be called immediately after parsing the call expression
11087 before surrounding code has committed to the type of the expression.
11089 LOC is the location of the builtin call.
11091 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11092 PARAMS is the argument list for the call. The return value is non-null
11093 when expansion is complete, and null if normal processing should
11094 continue. */
11096 tree
11099 {
11105 {
11111 else
11115 }
11117 /* Handle BUILT_IN_NORMAL here. */
11119 {
11124 {
11125 /* Handle these 4 together so that they can fall through to the next
11126 case if the call is transformed to an _N variant. */
11128 {
11130 {
11134 /* Change to the _N variant. */
11137 }
11140 {
11142 params,
11145 /* Change to the _N variant. */
11148 }
11150 {
11154 /* Change to the _N variant. */
11157 }
11159 {
11163 /* Change to the _N variant. */
11166 }
11169 }
11170 /* Fallthrough to the normal processing. */
11171 }
11188 {
11190 /* Fallthru for parameter processing. */
11191 }
11208 {
11219 orig_format))
11224 NULL);
11232 /* If new_return is set, assign function to that expr and cast the
11233 result to void since the generic interface returned void. */
11235 {
11236 /* Cast function result from I{1,2,4,8,16} to the required type. */
11239 result);
11243 }
11245 }
11249 }
11250 }
11252 /* vector_types_compatible_elements_p is used in type checks of vectors
11253 values used as operands of binary operators. Where it returns true, and
11254 the other checks of the caller succeed (being vector types in he first
11255 place, and matching number of elements), we can just treat the types
11256 as essentially the same.
11257 Contrast with vector_targets_convertible_p, which is used for vector
11258 pointer types, and vector_types_convertible_p, which will allow
11259 language-specific matches under the control of flag_lax_vector_conversions,
11260 and might still require a conversion. */
11261 /* True if vector types T1 and T2 can be inputs to the same binary
11262 operator without conversion.
11263 We don't check the overall vector size here because some of our callers
11264 want to give different error messages when the vectors are compatible
11265 except for the element count. */
11267 bool
11269 {
11282 /* Equality works here because c_common_signed_type uses
11283 TYPE_MAIN_VARIANT. */
11291 }
11293 /* Check for missing format attributes on function pointers. LTYPE is
11294 the new type or left-hand side type. RTYPE is the old type or
11295 right-hand side type. Returns TRUE if LTYPE is missing the desired
11296 attribute. */
11298 bool
11300 {
11302 tree ra;
11308 {
11309 tree la;
11314 }
11315 else
11317 }
11319 /* Subscripting with type char is likely to lose on a machine where
11320 chars are signed. So warn on any machine, but optionally. Don't
11321 warn for unsigned char since that type is safe. Don't warn for
11322 signed char because anyone who uses that must have done so
11323 deliberately. Furthermore, we reduce the false positive load by
11324 warning only for non-constant value of type char. */
11326 void
11328 {
11333 }
11335 /* Implement -Wparentheses for the unexpected C precedence rules, to
11336 cover cases like x + y << z which readers are likely to
11337 misinterpret. We have seen an expression in which CODE is a binary
11338 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11339 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11340 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11341 expression was not formed using a binary or unary operator, or it
11342 was enclosed in parentheses. */
11344 void
11348 {
11352 /* This macro tests that the expression ARG with original tree code
11353 CODE appears to be a boolean expression. or the result of folding a
11354 boolean expression. */
11355 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11356 (truth_value_p (TREE_CODE (ARG)) \
11357 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11359 || ((CODE) != INTEGER_CST \
11360 && (integer_onep (ARG) || integer_zerop (ARG))))
11363 {
11412 /* Check cases like x|y==z */
11419 /* Check cases like !x | y */
11423 "suggest parentheses around operand of "
11436 /* Check cases like x^y==z */
11458 /* Check cases like x&y==z */
11465 /* Check cases like !x & y */
11469 "suggest parentheses around operand of "
11492 {
11497 "comparisons like %<X<=Y<=Z%> do not "
11503 "comparisons like %<X<=Y<=Z%> do not "
11505 }
11507 }
11508 #undef NOT_A_BOOLEAN_EXPR_P
11509 }
11511 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11513 void
11515 {
11517 {
11520 else
11522 }
11523 }
11525 /* Warn for division by zero according to the value of DIVISOR. LOC
11526 is the location of the division operator. */
11528 void
11530 {
11531 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11532 about division by zero. Do not issue a warning if DIVISOR has a
11533 floating-point type, since we consider 0.0/0.0 a valid way of
11534 generating a NaN. */
11538 }
11540 /* Subroutine of build_binary_op. Give warnings for comparisons
11541 between signed and unsigned quantities that may fail. Do the
11542 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11543 so that casts will be considered, but default promotions won't
11544 be.
11546 LOCATION is the location of the comparison operator.
11548 The arguments of this function map directly to local variables
11549 of build_binary_op. */
11551 void
11556 {
11561 /* In C++, check for comparison of different enum types. */
11567 {
11571 }
11573 /* Do not warn if the comparison is being done in a signed type,
11574 since the signed type will only be chosen if it can represent
11575 all the values of the unsigned type. */
11578 /* Do not warn if both operands are unsigned. */
11581 else
11582 {
11588 else
11596 /* Do not warn if the signed quantity is an unsuffixed integer
11597 literal (or some static constant expression involving such
11598 literals or a conditional expression involving such literals)
11599 and it is non-negative. */
11602 /* Do not warn if the comparison is an equality operation, the
11603 unsigned quantity is an integral constant, and it would fit
11604 in the result if the result were signed. */
11609 /* In C, do not warn if the unsigned quantity is an enumeration
11610 constant and its maximum value would fit in the result if the
11611 result were signed. */
11617 else
11619 OPT_Wsign_compare,
11621 }
11623 /* Warn if two unsigned values are being compared in a size larger
11624 than their original size, and one (and only one) is the result of
11625 a `~' operator. This comparison will always fail.
11627 Also warn if one operand is a constant, and the constant does not
11628 have all bits set that are set in the ~ operand when it is
11629 extended. */
11636 {
11643 {
11644 tree primop;
11650 {
11654 }
11655 else
11656 {
11660 }
11665 {
11668 {
11672 else
11675 }
11676 }
11677 }
11685 }
11686 }
11688 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11689 type via c_common_type. If -Wdouble-promotion is in use, and the
11690 conditions for warning have been met, issue a warning. GMSGID is
11691 the warning message. It must have two %T specifiers for the type
11692 that was converted (generally "float") and the type to which it was
11693 converted (generally "double), respectively. LOC is the location
11694 to which the awrning should refer. */
11696 void
11699 {
11700 tree source_type;
11704 /* If the conversion will not occur at run-time, there is no need to
11705 warn about it. */
11717 else
11720 }
11722 /* Setup a TYPE_DECL node as a typedef representation.
11724 X is a TYPE_DECL for a typedef statement. Create a brand new
11725 ..._TYPE node (which will be just a variant of the existing
11726 ..._TYPE node with identical properties) and then install X
11727 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11729 The whole point here is to end up with a situation where each
11730 and every ..._TYPE node the compiler creates will be uniquely
11731 associated with AT MOST one node representing a typedef name.
11732 This way, even though the compiler substitutes corresponding
11733 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11734 early on, later parts of the compiler can always do the reverse
11735 translation and get back the corresponding typedef name. For
11736 example, given:
11738 typedef struct S MY_TYPE;
11739 MY_TYPE object;
11741 Later parts of the compiler might only know that `object' was of
11742 type `struct S' if it were not for code just below. With this
11743 code however, later parts of the compiler see something like:
11745 struct S' == struct S
11746 typedef struct S' MY_TYPE;
11747 struct S' object;
11749 And they can then deduce (from the node for type struct S') that
11750 the original object declaration was:
11752 MY_TYPE object;
11754 Being able to do this is important for proper support of protoize,
11755 and also for generating precise symbolic debugging information
11756 which takes full account of the programmer's (typedef) vocabulary.
11758 Obviously, we don't want to generate a duplicate ..._TYPE node if
11759 the TYPE_DECL node that we are now processing really represents a
11760 standard built-in type. */
11762 void
11764 {
11768 {
11771 }
11774 {
11782 }
11783 }
11785 /* Record the types used by the current global variable declaration
11786 being parsed, so that we can decide later to emit their debug info.
11787 Those types are in types_used_by_cur_var_decl, and we are going to
11788 store them in the types_used_by_vars_hash hash table.
11789 DECL is the declaration of the global variable that has been parsed. */
11791 void
11793 {
11797 {
11800 }
11801 }
11803 /* If DECL is a typedef that is declared in the current function,
11804 record it for the purpose of -Wunused-local-typedefs. */
11806 void
11808 {
11813 /* if this is not a locally defined typedef then we are not
11814 interested. */
11821 }
11823 /* If T is a TYPE_DECL declared locally, mark it as used. */
11825 void
11827 {
11832 }
11834 /* Warn if there are some unused locally defined typedefs in the
11835 current function. */
11837 void
11839 {
11841 tree decl;
11842 /* The number of times we have emitted -Wunused-local-typedefs
11843 warnings. If this is different from errorcount, that means some
11844 unrelated errors have been issued. In which case, we'll avoid
11845 emitting "unused-local-typedefs" warnings. */
11857 {
11861 OPT_Wunused_local_typedefs,
11864 }
11867 }
11869 /* Warn about boolean expression compared with an integer value different
11870 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11871 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11872 are the operands of the comparison. The caller must ensure that
11873 either operand is a boolean expression. */
11875 void
11877 tree op1)
11878 {
11888 {
11896 else
11899 }
11900 }
11902 /* The C and C++ parsers both use vectors to hold function arguments.
11903 For efficiency, we keep a cache of unused vectors. This is the
11904 cache. */
11909 /* Return a new vector from the cache. If the cache is empty,
11910 allocate a new vector. These vectors are GC'ed, so it is OK if the
11911 pointer is not released.. */
11915 {
11918 else
11919 {
11920 /* Passing 0 to vec::alloc returns NULL, and our callers require
11921 that we always return a non-NULL value. The vector code uses
11922 4 when growing a NULL vector, so we do too. */
11926 }
11927 }
11929 /* Release a vector of trees back to the cache. */
11931 void
11933 {
11935 {
11938 }
11939 }
11941 /* Get a new tree vector holding a single tree. */
11945 {
11949 }
11951 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11955 {
11960 }
11962 /* Get a new tree vector which is a copy of an existing one. */
11966 {
11969 tree t;
11976 }
11978 /* Return true if KEYWORD starts a type specifier. */
11980 bool
11982 {
11984 {
12018 }
12019 }
12021 /* Return true if KEYWORD names a type qualifier. */
12023 bool
12025 {
12027 {
12035 }
12036 }
12038 /* Return true if KEYWORD names a storage class specifier.
12040 RID_TYPEDEF is not included in this list despite `typedef' being
12041 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12042 such for syntactic convenience only. */
12044 bool
12046 {
12048 {
12058 }
12059 }
12061 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12063 static bool
12065 {
12067 {
12075 }
12076 }
12078 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12079 declaration-specifier (C99 6.7). */
12081 bool
12083 {
12090 {
12097 }
12098 }
12100 /* Initialize language-specific-bits of tree_contains_struct. */
12102 void
12104 {
12108 }
12110 /* Build a user-defined numeric literal out of an integer constant type VALUE
12111 with identifier SUFFIX. */
12113 tree
12116 {
12123 }
12125 /* For vector[index], convert the vector to a
12126 pointer of the underlying type. Return true if the resulting
12127 ARRAY_REF should not be an lvalue. */
12129 bool
12132 {
12135 {
12137 tree type1;
12146 {
12151 {
12154 *vecp
12157 non_const);
12158 }
12159 else
12164 }
12165 else
12172 {
12173 /* If the original vector isn't declared may_alias and it
12174 isn't a bare vector look if the subscripting would
12175 alias the vector we subscript, and if not, force ref-all. */
12181 }
12185 }
12187 }
12189 /* Determine which of the operands, if any, is a scalar that needs to be
12190 converted to a vector, for the range of operations. */
12191 enum stv_conv
12194 {
12203 {
12204 /* Most GENERIC binary expressions require homogeneous arguments.
12205 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12206 argument that is a vector and a second one that is a scalar, so
12207 we never return stv_secondarg for them. */
12212 {
12214 {
12219 }
12220 else
12222 }
12229 /* ... fall through ... */
12250 /* What about UNLT_EXPR? */
12252 {
12253 tree tmp;
12255 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12258 }
12262 {
12264 {
12269 }
12271 }
12273 /* Allow integer --> real conversion if safe. */
12277 {
12279 {
12284 }
12286 }
12289 }
12292 }
12294 /* Return true iff ALIGN is an integral constant that is a fundamental
12295 alignment, as defined by [basic.align] in the c++-11
12296 specifications.
12298 That is:
12300 [A fundamental alignment is represented by an alignment less than or
12301 equal to the greatest alignment supported by the implementation
12302 in all contexts, which is equal to
12303 alignof(max_align_t)]. */
12305 bool
12307 {
12310 }
12312 /* Return true if T is a pointer to a zero-sized aggregate. */
12314 bool
12316 {
12321 }