| blob | 24d20cec45458f0e2b4f6dd52fc914329305a23a |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #define GCC_C_COMMON_C
71 /* The following symbols are subsumed in the c_global_trees array, and
72 listed here individually for documentation purposes.
74 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
76 tree short_integer_type_node;
77 tree long_integer_type_node;
78 tree long_long_integer_type_node;
80 tree short_unsigned_type_node;
81 tree long_unsigned_type_node;
82 tree long_long_unsigned_type_node;
84 tree truthvalue_type_node;
85 tree truthvalue_false_node;
86 tree truthvalue_true_node;
88 tree ptrdiff_type_node;
90 tree unsigned_char_type_node;
91 tree signed_char_type_node;
92 tree wchar_type_node;
94 tree char16_type_node;
95 tree char32_type_node;
97 tree float_type_node;
98 tree double_type_node;
99 tree long_double_type_node;
101 tree complex_integer_type_node;
102 tree complex_float_type_node;
103 tree complex_double_type_node;
104 tree complex_long_double_type_node;
106 tree dfloat32_type_node;
107 tree dfloat64_type_node;
108 tree_dfloat128_type_node;
110 tree intQI_type_node;
111 tree intHI_type_node;
112 tree intSI_type_node;
113 tree intDI_type_node;
114 tree intTI_type_node;
116 tree unsigned_intQI_type_node;
117 tree unsigned_intHI_type_node;
118 tree unsigned_intSI_type_node;
119 tree unsigned_intDI_type_node;
120 tree unsigned_intTI_type_node;
122 tree widest_integer_literal_type_node;
123 tree widest_unsigned_literal_type_node;
125 Nodes for types `void *' and `const void *'.
127 tree ptr_type_node, const_ptr_type_node;
129 Nodes for types `char *' and `const char *'.
131 tree string_type_node, const_string_type_node;
133 Type `char[SOMENUMBER]'.
134 Used when an array of char is needed and the size is irrelevant.
136 tree char_array_type_node;
138 Type `wchar_t[SOMENUMBER]' or something like it.
139 Used when a wide string literal is created.
141 tree wchar_array_type_node;
143 Type `char16_t[SOMENUMBER]' or something like it.
144 Used when a UTF-16 string literal is created.
146 tree char16_array_type_node;
148 Type `char32_t[SOMENUMBER]' or something like it.
149 Used when a UTF-32 string literal is created.
151 tree char32_array_type_node;
153 Type `int ()' -- used for implicit declaration of functions.
155 tree default_function_type;
157 A VOID_TYPE node, packaged in a TREE_LIST.
159 tree void_list_node;
161 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
162 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
163 VAR_DECLS, but C++ does.)
165 tree function_name_decl_node;
166 tree pretty_function_name_decl_node;
167 tree c99_function_name_decl_node;
169 Stack of nested function name VAR_DECLs.
171 tree saved_function_name_decls;
173 */
176 \f
177 /* Switches common to the C front ends. */
179 /* Nonzero means don't output line number information. */
183 /* Nonzero causes -E output not to be done, but directives such as
184 #define that have side effects are still obeyed. */
188 /* Nonzero means dump macros in some fashion. */
192 /* Nonzero means pass #include lines through to the output. */
196 /* Nonzero means process PCH files while preprocessing. */
200 /* The file name to which we should write a precompiled header, or
201 NULL if no header will be written in this compile. */
205 /* Nonzero if an ISO standard was selected. It rejects macros in the
206 user's namespace. */
210 /* C/ObjC language option variables. */
213 /* Nonzero means allow type mismatches in conditional expressions;
214 just make their values `void'. */
218 /* Nonzero means enable C89 Amendment 1 features. */
222 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
226 /* Nonzero means use the ISO C11 dialect of C. */
230 /* Nonzero means that we have builtin functions, and main is an int. */
235 /* ObjC language option variables. */
238 /* Tells the compiler that this is a special run. Do not perform any
239 compiling, instead we are to test some platform dependent features
240 and output a C header file with appropriate definitions. */
244 /* Tells the compiler what is the constant string class for ObjC. */
248 /* UPC language option variables. */
250 /* Nonzero whenever UPC -fupc-threads-N is asserted.
251 The value N gives the number of UPC threads to be
252 defined at compile-time. */
255 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
258 /* The implementation model for UPC threads that
259 are mapped to POSIX threads, specified at compilation
260 time by the -fupc-pthreads-model-* switch. */
261 upc_pthreads_model_kind upc_pthreads_model;
263 /* C++ language option variables. */
266 /* Nonzero means generate separate instantiation control files and
267 juggle them at link time. */
271 /* The C++ dialect being used. C++98 is the default. */
275 /* Maximum template instantiation depth. This limit exists to limit the
276 time it takes to notice excessively recursive template instantiations.
278 The default is lower than the 1024 recommended by the C++0x standard
279 because G++ runs out of stack before 1024 with highly recursive template
280 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
284 /* The elements of `ridpointers' are identifier nodes for the reserved
285 type names and storage classes. It is indexed by a RID_... value. */
290 /* Nonzero means don't warn about problems that occur when the code is
291 executed. */
294 /* Whether we are building a boolean conversion inside
295 convert_for_assignment, or some other late binary operation. If
296 build_binary_op is called for C (from code shared by C and C++) in
297 this case, then the operands have already been folded and the
298 result will not be folded again, so C_MAYBE_CONST_EXPR should not
299 be generated. */
302 /* Whether lexing has been completed, so subsequent preprocessor
303 errors should use the compiler's input_location. */
306 /* Information about how a function name is generated. */
307 struct fname_var_t
308 {
312 };
314 /* The three ways of getting then name of the current function. */
317 {
318 /* C99 compliant __func__, must be first. */
320 /* GCC __FUNCTION__ compliant. */
322 /* GCC __PRETTY_FUNCTION__ compliant. */
325 };
327 /* Global visibility options. */
426 /* Reserved words. The third field is a mask: keywords are disabled
427 if they match the mask.
429 Masks for languages:
430 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
431 C --std=c99: D_CXXONLY | D_OBJC
432 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
433 UPC is like C except that D_UPC is not set
434 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
435 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
436 ObjC++ is like C++ except that D_OBJC is not set
438 If -fno-asm is used, D_ASM is added to the mask. If
439 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
440 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
441 In C with -Wc++-compat, we warn if D_CXXWARN is set.
443 Note the complication of the D_CXX_OBJC keywords. These are
444 reserved words such as 'class'. In C++, 'class' is a reserved
445 word. In Objective-C++ it is too. In Objective-C, it is a
446 reserved word too, but only if it follows an '@' sign.
447 */
449 {
614 /* These Objective-C keywords are recognized only immediately after
615 an '@'. */
632 /* These are recognized only in protocol-qualifier context
633 (see above) */
641 /* UPC keywords */
653 /* These are recognized inside a property attribute list */
662 };
667 /* Table of machine-independent attributes common to all C-like languages.
669 All attributes referencing arguments should be additionally processed
670 in chkp_copy_function_type_adding_bounds for correct instrumentation
671 by Pointer Bounds Checker.
672 Current list of processed common attributes: nonnull. */
674 {
675 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
676 affects_type_identity } */
683 /* FIXME: logically, noreturn attributes should be listed as
684 "false, true, true" and apply to function types. But implementing this
685 would require all the places in the compiler that use TREE_THIS_VOLATILE
686 on a decl to identify non-returning functions to be located and fixed
687 to check the function type instead. */
718 /* The same comments as for noreturn attributes apply to const ones. */
742 handle_no_instrument_function_attribute,
760 /* ??? These two attributes didn't make the transition from the
761 Intel language document to the multi-vendor language document. */
766 /* For internal use (marking of builtins) only. The name contains space
767 to prevent its usage in source code. */
789 /* For internal use (marking of builtins) only. The name contains space
790 to prevent its usage in source code. */
801 handle_no_address_safety_analysis_attribute,
804 handle_no_sanitize_address_attribute,
807 handle_no_sanitize_address_attribute,
810 handle_no_sanitize_undefined_attribute,
820 /* For internal use only. The leading '*' both prevents its usage in
821 source code and signals that it may be overridden by machine tables. */
826 /* For internal use (marking of builtins and runtime functions) only.
827 The name contains space to prevent its usage in source code. */
853 };
855 /* Give the specifications for the format attributes, used by C and all
856 descendants.
858 All attributes referencing arguments should be additionally processed
859 in chkp_copy_function_type_adding_bounds for correct instrumentation
860 by Pointer Bounds Checker.
861 Current list of processed format attributes: format, format_arg. */
863 {
864 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
865 affects_type_identity } */
871 };
873 /* Return identifier for address space AS. */
877 {
881 }
883 /* Push current bindings for the function name VAR_DECLS. */
885 void
887 {
892 {
896 {
898 saved);
900 }
901 }
903 /* Normally they'll have been NULL, so only push if we've got a
904 stack, or they are non-NULL. */
906 saved_function_name_decls);
907 }
909 /* Finish up the current bindings, adding them into the current function's
910 statement tree. This must be done _before_ finish_stmt_tree is called.
911 If there is no current function, we must be at file scope and no statements
912 are involved. Pop the previous bindings. */
914 void
916 {
925 {
933 }
939 {
940 /* We had saved values, restore them. */
941 tree saved;
944 {
949 }
951 }
953 }
955 /* Return the text name of the current function, suitably prettified
956 by PRETTY_P. Return string must be freed by caller. */
960 {
967 {
970 }
983 {
986 }
989 }
991 /* Return the VAR_DECL for a const char array naming the current
992 function. If the VAR_DECL has not yet been created, create it
993 now. RID indicates how it should be formatted and IDENTIFIER_NODE
994 ID is its name (unfortunately C and C++ hold the RID values of
995 keywords in different places, so we can't derive RID from ID in
996 this language independent code. LOC is the location of the
997 function. */
999 tree
1001 {
1011 {
1012 /* If a tree is built here, it would normally have the lineno of
1013 the current statement. Later this tree will be moved to the
1014 beginning of the function and this line number will be wrong.
1015 To avoid this problem set the lineno to 0 here; that prevents
1016 it from appearing in the RTL. */
1017 tree stmts;
1025 saved_function_name_decls
1029 }
1034 }
1036 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1038 tree
1040 {
1045 /* Compute the number of elements, for the array type. */
1047 {
1050 }
1052 {
1055 }
1057 {
1060 }
1061 else
1062 {
1065 }
1067 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1068 limit in C++98 Annex B is very large (65536) and is not normative,
1069 so we do not diagnose it (warn_overlength_strings is forced off
1070 in c_common_post_options). */
1072 {
1076 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1077 separate the %d from the 'C'. 'ISO' should not be
1078 translated, but it may be moved after 'C%d' in languages
1079 where modifiers follow nouns. */
1081 "string length %qd is greater than the length %qd "
1084 }
1086 /* Create the array type for the string constant. The ISO C++
1087 standard says that a string literal has type `const char[N]' or
1088 `const wchar_t[N]'. We use the same logic when invoked as a C
1089 front-end with -Wwrite-strings.
1090 ??? We should change the type of an expression depending on the
1091 state of a warning flag. We should just be warning -- see how
1092 this is handled in the C++ front-end for the deprecated implicit
1093 conversion from string literals to `char*' or `wchar_t*'.
1095 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1096 array type being the unqualified version of that type.
1097 Therefore, if we are constructing an array of const char, we must
1098 construct the matching unqualified array type first. The C front
1099 end does not require this, but it does no harm, so we do it
1100 unconditionally. */
1111 }
1112 \f
1113 /* If DISABLE is true, stop issuing warnings. This is used when
1114 parsing code that we know will not be executed. This function may
1115 be called multiple times, and works as a stack. */
1117 static void
1119 {
1121 {
1124 }
1125 }
1127 /* If ENABLE is true, reenable issuing warnings. */
1129 static void
1131 {
1133 {
1136 }
1137 }
1139 /* Fully fold EXPR, an expression that was not folded (beyond integer
1140 constant expressions and null pointer constants) when being built
1141 up. If IN_INIT, this is in a static initializer and certain
1142 changes are made to the folding done. Clear *MAYBE_CONST if
1143 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1144 expression because it contains an evaluated operator (in C99) or an
1145 operator outside of sizeof returning an integer constant (in C90)
1146 not permitted in constant expressions, or because it contains an
1147 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1148 set to true by callers before calling this function.) Return the
1149 folded expression. Function arguments have already been folded
1150 before calling this function, as have the contents of SAVE_EXPR,
1151 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1152 C_MAYBE_CONST_EXPR. */
1154 tree
1156 {
1157 tree ret;
1163 /* This function is not relevant to C++ because C++ folds while
1164 parsing, and may need changes to be correct for C++ when C++
1165 stops folding while parsing. */
1172 {
1175 }
1182 }
1184 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1185 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1186 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1187 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1188 both evaluated and unevaluated subexpressions while
1189 *MAYBE_CONST_ITSELF is carried from only evaluated
1190 subexpressions). */
1192 static tree
1195 {
1207 /* This function is not relevant to C++ because C++ folds while
1208 parsing, and may need changes to be correct for C++ when C++
1209 stops folding while parsing. */
1213 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1214 anything else not counted as an expression cannot usefully be
1215 folded further at this point. */
1221 /* Operands of variable-length expressions (function calls) have
1222 already been folded, as have __builtin_* function calls, and such
1223 expressions cannot occur in constant expressions. */
1225 {
1229 }
1232 {
1241 else
1244 }
1246 /* Assignment, increment, decrement, function call and comma
1247 operators, and statement expressions, cannot occur in constant
1248 expressions if evaluated / outside of sizeof. (Function calls
1249 were handled above, though VA_ARG_EXPR is treated like a function
1250 call here, and statement expressions are handled through
1251 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1253 {
1273 }
1275 /* Fold individual tree codes as appropriate. */
1277 {
1279 /* Any non-constancy will have been marked in a containing
1280 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1288 maybe_const_itself);
1293 {
1296 }
1305 maybe_const_itself);
1308 maybe_const_itself);
1314 {
1318 }
1360 /* Binary operations evaluating both arguments (increment and
1361 decrement are binary internally in GCC). */
1365 maybe_const_itself);
1373 /* The RHS of a MODIFY_EXPR was fully folded when building that
1374 expression for the sake of conversion warnings. */
1377 maybe_const_itself);
1381 ret = in_init
1384 else
1397 {
1408 }
1425 CASE_CONVERT:
1436 /* Unary operations. */
1439 maybe_const_itself);
1443 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1444 not prepared to deal with them if they occur in initializers.
1445 Avoid attempts to fold references to UPC shared components
1446 due to the complexities of UPC pointer-to-shared arithmetic. */
1455 ret = in_init
1458 else
1463 {
1467 }
1469 {
1472 CASE_CONVERT:
1473 /* Don't warn about explicit conversions. We will already
1474 have warned about suspect implicit conversions. */
1481 }
1486 /* Binary operations not necessarily evaluating both
1487 arguments. */
1494 ? truthvalue_false_node
1502 ret = in_init
1505 else
1510 && op0_const
1511 && op0_const_self
1517 && op0_const_self
1543 else
1548 && op0_const
1549 && op0_const_self
1553 && op0_const_self
1557 && op0_const
1558 && op0_const_self
1562 && op0_const_self
1568 /* Each case where an operand with excess precision may be
1569 encountered must remove the EXCESS_PRECISION_EXPR around
1570 inner operands and possibly put one around the whole
1571 expression or possibly convert to the semantic type (which
1572 c_fully_fold does); we cannot tell at this stage which is
1573 appropriate in any particular case. */
1577 /* Various codes may appear through folding built-in functions
1578 and their arguments. */
1580 }
1582 out:
1583 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1584 have been done by this point, so remove them again. */
1588 {
1592 }
1596 }
1598 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1599 return EXP. Otherwise, return either EXP or its known constant
1600 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1601 Is the BLKmode test appropriate? */
1603 tree
1605 {
1606 tree ret;
1608 /* This function is only used by C, for c_fully_fold and other
1609 optimization, and may not be correct for C++. */
1620 /* Avoid unwanted tree sharing between the initializer and current
1621 function's body where the tree can be modified e.g. by the
1622 gimplifier. */
1626 }
1628 /* Print a warning if a constant expression had overflow in folding.
1629 Invoke this function on every expression that the language
1630 requires to be a constant expression.
1631 Note the ANSI C standard says it is erroneous for a
1632 constant expression to overflow. */
1634 void
1636 {
1644 }
1646 /* The same as above but print an unconditional error. */
1647 void
1649 {
1656 }
1658 /* Print a warning if an expression had overflow in folding and its
1659 operands hadn't.
1661 Invoke this function on every expression that
1662 (1) appears in the source code, and
1663 (2) is a constant expression that overflowed, and
1664 (3) is not already checked by convert_and_check;
1665 however, do not invoke this function on operands of explicit casts
1666 or when the expression is the result of an operator and any operand
1667 already overflowed. */
1669 void
1671 {
1676 {
1705 }
1706 }
1708 /* Warn about uses of logical || / && operator in a context where it
1709 is likely that the bitwise equivalent was intended by the
1710 programmer. We have seen an expression in which CODE is a binary
1711 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1712 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1713 void
1717 {
1729 /* Warn if &&/|| are being used in a context where it is
1730 likely that the bitwise equivalent was intended by the
1731 programmer. That is, an expression such as op && MASK
1732 where op should not be any boolean expression, nor a
1733 constant, and mask seems to be a non-boolean integer constant. */
1741 {
1745 else
1750 }
1752 /* We do not warn for constants because they are typical of macro
1753 expansions that test for features. */
1757 /* This warning only makes sense with logical operands. */
1764 /* The range computations only work with scalars. */
1769 /* We first test whether either side separately is trivially true
1770 (with OR) or trivially false (with AND). If so, do not warn.
1771 This is a common idiom for testing ranges of data types in
1772 portable code. */
1779 /* If this is an OR operation, invert both sides; now, the result
1780 should be always false to get a warning. */
1794 /* If this is an OR operation, invert both sides; now, the result
1795 should be always false to get a warning. */
1803 /* If both expressions have the same operand, if we can merge the
1804 ranges, and if the range test is always false, then warn. */
1811 {
1814 "logical %<or%> "
1816 else
1818 "logical %<and%> "
1820 }
1821 }
1823 /* Warn about logical not used on the left hand side operand of a comparison.
1824 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1825 Do not warn if RHS is of a boolean type. */
1827 void
1829 tree rhs)
1830 {
1837 "logical not is only applied to the left hand side of "
1839 }
1841 /* Warn if EXP contains any computations whose results are not used.
1842 Return true if a warning is printed; false otherwise. LOCUS is the
1843 (potential) location of the expression. */
1845 bool
1847 {
1848 restart:
1852 /* Don't warn about void constructs. This includes casting to void,
1853 void function calls, and statement expressions with a final cast
1854 to void. */
1862 {
1878 /* For a binding, warn if no side effect within it. */
1890 /* In && or ||, warn if 2nd operand has no side effect. */
1897 /* Let people do `(foo (), 0)' without a warning. */
1904 /* If this is an expression with side effects, don't warn; this
1905 case commonly appears in macro expansions. */
1911 /* Don't warn about automatic dereferencing of references, since
1912 the user cannot control it. */
1914 {
1917 }
1918 /* Fall through. */
1921 /* Referencing a volatile value is a side effect, so don't warn. */
1926 /* If this is an expression which has no operands, there is no value
1927 to be unused. There are no such language-independent codes,
1928 but front ends may define such. */
1932 warn:
1934 }
1935 }
1938 /* Print a warning about casts that might indicate violation
1939 of strict aliasing rules if -Wstrict-aliasing is used and
1940 strict aliasing mode is in effect. OTYPE is the original
1941 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1943 bool
1945 {
1946 /* Strip pointer conversion chains and get to the correct original type. */
1954 /* If the type we are casting to is a ref-all pointer
1955 dereferencing it is always valid. */
1962 {
1963 /* Casting the address of an object to non void pointer. Warn
1964 if the cast breaks type based aliasing. */
1966 {
1970 }
1971 else
1972 {
1973 /* warn_strict_aliasing >= 3. This includes the default (3).
1974 Only warn if the cast is dereferenced immediately. */
1975 alias_set_type set1 =
1981 {
1985 }
1988 {
1992 }
1993 }
1994 }
1995 else
1997 {
1998 /* At this level, warn for any conversions, even if an address is
1999 not taken in the same statement. This will likely produce many
2000 false positives, but could be useful to pinpoint problems that
2001 are not revealed at higher levels. */
2006 {
2010 }
2011 }
2014 }
2016 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
2017 sizeof as last operand of certain builtins. */
2019 void
2023 {
2027 location_t loc;
2035 {
2039 /* FALLTHRU */
2047 /* FALLTHRU */
2106 }
2134 {
2138 {
2141 "argument to %<sizeof%> in %qD call is the same "
2142 "expression as the destination; did you mean to "
2148 "argument to %<sizeof%> in %qD call is the same "
2149 "expression as the destination; did you mean to "
2151 else
2153 "argument to %<sizeof%> in %qD call is the same "
2154 "expression as the destination; did you mean to "
2157 }
2160 && !strop
2163 {
2165 "argument to %<sizeof%> in %qD call is the same "
2166 "pointer type %qT as the destination; expected %qT "
2170 }
2171 }
2174 {
2178 {
2181 "argument to %<sizeof%> in %qD call is the same "
2182 "expression as the source; did you mean to "
2188 "argument to %<sizeof%> in %qD call is the same "
2189 "expression as the source; did you mean to "
2191 else
2193 "argument to %<sizeof%> in %qD call is the same "
2194 "expression as the source; did you mean to "
2197 }
2200 && !strop
2203 {
2205 "argument to %<sizeof%> in %qD call is the same "
2206 "pointer type %qT as the source; expected %qT "
2210 }
2211 }
2214 {
2218 {
2221 "argument to %<sizeof%> in %qD call is the same "
2222 "expression as the first source; did you mean to "
2228 "argument to %<sizeof%> in %qD call is the same "
2229 "expression as the first source; did you mean to "
2231 else
2233 "argument to %<sizeof%> in %qD call is the same "
2234 "expression as the first source; did you mean to "
2237 }
2240 && !strop
2243 {
2245 "argument to %<sizeof%> in %qD call is the same "
2246 "pointer type %qT as the first source; expected %qT "
2250 }
2251 }
2254 {
2258 {
2261 "argument to %<sizeof%> in %qD call is the same "
2262 "expression as the second source; did you mean to "
2268 "argument to %<sizeof%> in %qD call is the same "
2269 "expression as the second source; did you mean to "
2271 else
2273 "argument to %<sizeof%> in %qD call is the same "
2274 "expression as the second source; did you mean to "
2277 }
2280 && !strop
2283 {
2285 "argument to %<sizeof%> in %qD call is the same "
2286 "pointer type %qT as the second source; expected %qT "
2290 }
2291 }
2293 }
2295 /* Warn for unlikely, improbable, or stupid DECL declarations
2296 of `main'. */
2298 void
2300 {
2301 function_args_iterator iter;
2302 tree type;
2306 {
2307 /* XXX void_type_node belies the abstraction. */
2317 {
2323 }
2327 {
2349 "third argument of %q+D should probably be "
2352 }
2353 }
2355 /* It is intentional that this message does not mention the third
2356 argument because it's only mentioned in an appendix of the
2357 standard. */
2365 }
2367 /* vector_targets_convertible_p is used for vector pointer types. The
2368 callers perform various checks that the qualifiers are satisfactory,
2369 while OTOH vector_targets_convertible_p ignores the number of elements
2370 in the vectors. That's fine with vector pointers as we can consider,
2371 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2372 and that does not require and conversion of the pointer values.
2373 In contrast, vector_types_convertible_p and
2374 vector_types_compatible_elements_p are used for vector value types. */
2375 /* True if pointers to distinct types T1 and T2 can be converted to
2376 each other without an explicit cast. Only returns true for opaque
2377 vector types. */
2378 bool
2380 {
2387 }
2389 /* vector_types_convertible_p is used for vector value types.
2390 It could in principle call vector_targets_convertible_p as a subroutine,
2391 but then the check for vector type would be duplicated with its callers,
2392 and also the purpose of vector_targets_convertible_p would become
2393 muddled.
2394 Where vector_types_convertible_p returns true, a conversion might still be
2395 needed to make the types match.
2396 In contrast, vector_targets_convertible_p is used for vector pointer
2397 values, and vector_types_compatible_elements_p is used specifically
2398 in the context for binary operators, as a check if use is possible without
2399 conversion. */
2400 /* True if vector types T1 and T2 can be converted to each other
2401 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2402 can only be converted with -flax-vector-conversions yet that is not
2403 in effect, emit a note telling the user about that option if such
2404 a note has not previously been emitted. */
2405 bool
2407 {
2415 convertible_lax =
2430 {
2433 "conversions between vectors with differing "
2435 }
2438 }
2440 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2441 and have vector types, V0 has the same type as V1, and the number of
2442 elements of V0, V1, MASK is the same.
2444 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2445 called with two arguments. In this case implementation passes the
2446 first argument twice in order to share the same tree code. This fact
2447 could enable the mask-values being twice the vector length. This is
2448 an implementation accident and this semantics is not guaranteed to
2449 the user. */
2450 tree
2453 {
2454 tree ret;
2460 {
2463 }
2471 {
2476 }
2480 {
2484 }
2487 {
2492 }
2498 {
2501 "argument vector(s) and the mask vector should "
2504 }
2508 {
2513 }
2516 {
2517 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2523 else
2524 {
2527 }
2531 }
2541 }
2543 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2544 to integral type. */
2546 static tree
2548 {
2553 {
2554 /* C++0x scoped enumerations don't implicitly convert to integral
2555 type; if we stripped an explicit conversion to a larger type we
2556 need to replace it so common_type will still work. */
2560 }
2562 }
2564 /* This is a helper function of build_binary_op.
2566 For certain operations if both args were extended from the same
2567 smaller type, do the arithmetic in that type and then extend.
2569 BITWISE indicates a bitwise operation.
2570 For them, this optimization is safe only if
2571 both args are zero-extended or both are sign-extended.
2572 Otherwise, we might change the result.
2573 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2574 but calculated in (unsigned short) it would be (unsigned short)-1.
2575 */
2576 tree
2578 {
2582 tree type;
2584 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2585 excessive narrowing when we call get_narrower below. For
2586 example, suppose that OP0 is of unsigned int extended
2587 from signed char and that RESULT_TYPE is long long int.
2588 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2589 like
2591 (long long int) (unsigned int) signed_char
2593 which get_narrower would narrow down to
2595 (unsigned int) signed char
2597 If we do not cast OP0 first, get_narrower would return
2598 signed_char, which is inconsistent with the case of the
2599 explicit cast. */
2606 /* UNS is 1 if the operation to be done is an unsigned one. */
2609 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2610 but it *requires* conversion to FINAL_TYPE. */
2621 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2623 /* For bitwise operations, signedness of nominal type
2624 does not matter. Consider only how operands were extended. */
2628 /* Note that in all three cases below we refrain from optimizing
2629 an unsigned operation on sign-extended args.
2630 That would not be valid. */
2632 /* Both args variable: if both extended in same way
2633 from same width, do it in that width.
2634 Do it unsigned if args were zero-extended. */
2641 return c_common_signed_or_unsigned_type
2648 && (type
2659 && (type
2667 }
2669 /* Checks if expression EXPR of real/integer type cannot be converted
2670 to the real/integer type TYPE. Function returns non-zero when:
2671 * EXPR is a constant which cannot be exactly converted to TYPE.
2672 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2673 for EXPR type and TYPE being both integers or both real.
2674 * EXPR is not a constant of real type and TYPE is an integer.
2675 * EXPR is not a constant of integer type which cannot be
2676 exactly converted to real type.
2677 Function allows conversions between types of different signedness and
2678 can return SAFE_CONVERSION (zero) in that case. Function can produce
2679 signedness warnings if PRODUCE_WARNS is true. */
2681 enum conversion_safety
2683 {
2689 {
2690 /* Warn for real constant that is not an exact integer converted
2691 to integer type. */
2694 {
2697 }
2698 /* Warn for an integer constant that does not fit into integer type. */
2702 {
2705 {
2709 }
2711 {
2715 }
2716 else
2718 }
2720 {
2721 /* Warn for an integer constant that does not fit into real type. */
2723 {
2727 }
2728 /* Warn for a real constant that does not fit into a smaller
2729 real type. */
2732 {
2736 }
2737 }
2738 }
2739 else
2740 {
2741 /* Warn for real types converted to integer types. */
2748 {
2749 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2753 /* Don't warn for short y; short x = ((int)y & 0xff); */
2757 {
2758 /* If both args were extended from a shortest type,
2759 use that type if that is safe. */
2766 {
2772 /* If one of the operands is a non-negative constant
2773 that fits in the target type, then the type of the
2774 other operand does not matter. */
2783 /* If constant is unsigned and fits in the target
2784 type, then the result will also fit. */
2786 && unsigned0
2789 && unsigned1
2792 }
2793 }
2794 /* Warn for integer types converted to smaller integer types. */
2798 /* When they are the same width but different signedness,
2799 then the value may change. */
2802 /* Even when converted to a bigger type, if the type is
2803 unsigned but expr is signed, then negative values
2804 will be changed. */
2810 }
2812 /* Warn for integer types converted to real types if and only if
2813 all the range of values of the integer type cannot be
2814 represented by the real type. */
2817 {
2821 /* Don't warn about char y = 0xff; float x = (int) y; */
2833 }
2835 /* Warn for real types converted to smaller real types. */
2840 }
2843 }
2845 /* Warns if the conversion of EXPR to TYPE may alter a value.
2846 This is a helper function for warnings_for_convert_and_check. */
2848 static void
2850 {
2857 /* This may happen, because for LHS op= RHS we preevaluate
2858 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2859 means we could no longer see the code of the EXPR. */
2866 {
2879 /* Conversion from boolean to a signed:1 bit-field (which only
2880 can hold the values 0 and -1) doesn't lose information - but
2881 it does change the value. */
2901 {
2902 /* In case of COND_EXPR, we do not care about the type of
2903 COND_EXPR, only about the conversion of each operand. */
2910 }
2922 }
2923 }
2925 /* Produce warnings after a conversion. RESULT is the result of
2926 converting EXPR to TYPE. This is a helper function for
2927 convert_and_check and cp_convert_and_check. */
2929 void
2931 tree result)
2932 {
2939 {
2940 /* Do not diagnose overflow in a constant expression merely
2941 because a conversion overflowed. */
2946 {
2947 /* This detects cases like converting -129 or 256 to
2948 unsigned char. */
2952 else
2954 }
2958 /* No warning for converting 0x80000000 to int. */
2966 else
2968 }
2973 else
2975 }
2978 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2979 Invoke this function on every expression that is converted implicitly,
2980 i.e. because of language rules and not because of an explicit cast. */
2982 tree
2984 {
2985 tree result;
2986 tree expr_for_warning;
2988 /* Convert from a value with possible excess precision rather than
2989 via the semantic type, but do not warn about values not fitting
2990 exactly in the semantic type. */
2992 {
2998 }
2999 else
3013 }
3014 \f
3015 /* A node in a list that describes references to variables (EXPR), which are
3016 either read accesses if WRITER is zero, or write accesses, in which case
3017 WRITER is the parent of EXPR. */
3018 struct tlist
3019 {
3022 };
3024 /* Used to implement a cache the results of a call to verify_tree. We only
3025 use this for SAVE_EXPRs. */
3026 struct tlist_cache
3027 {
3031 tree expr;
3032 };
3034 /* Obstack to use when allocating tlist structures, and corresponding
3035 firstobj. */
3039 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
3040 warnings. */
3042 /* SAVE_EXPRs need special treatment. We process them only once and then
3043 cache the results. */
3055 /* Create a new struct tlist and fill in its fields. */
3058 {
3065 }
3067 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
3068 is nonnull, we ignore any node we find which has a writer equal to it. */
3070 static void
3072 {
3074 {
3081 }
3082 }
3084 /* Merge the nodes of ADD into TO. This merging process is done so that for
3085 each variable that already exists in TO, no new node is added; however if
3086 there is a write access recorded in ADD, and an occurrence on TO is only
3087 a read access, then the occurrence in TO will be modified to record the
3088 write. */
3090 static void
3092 {
3099 {
3106 {
3110 }
3112 {
3116 }
3118 }
3119 }
3121 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3122 references in list LIST conflict with it, excluding reads if ONLY writers
3123 is nonzero. */
3125 static void
3128 {
3131 /* Avoid duplicate warnings. */
3137 {
3141 {
3146 }
3148 }
3149 }
3151 /* Given a list LIST of references to variables, find whether any of these
3152 can cause conflicts due to missing sequence points. */
3154 static void
3156 {
3160 {
3163 }
3164 }
3166 /* Return nonzero if X is a tree that can be verified by the sequence point
3167 warnings. */
3168 static int
3170 {
3177 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3178 (lvalue_p) crash on TRY/CATCH. */
3185 /* No point to track non-const calls, they will never satisfy
3186 operand_equal_p. */
3194 }
3196 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3197 static bool
3199 {
3201 }
3203 /* Walk the tree X, and record accesses to variables. If X is written by the
3204 parent tree, WRITER is the parent.
3205 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3206 expression or its only operand forces a sequence point, then everything up
3207 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3208 in PNO_SP.
3209 Once we return, we will have emitted warnings if any subexpression before
3210 such a sequence point could be undefined. On a higher level, however, the
3211 sequence point may not be relevant, and we'll merge the two lists.
3213 Example: (b++, a) + b;
3214 The call that processes the COMPOUND_EXPR will store the increment of B
3215 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3216 processes the PLUS_EXPR will need to merge the two lists so that
3217 eventually, all accesses end up on the same list (and we'll warn about the
3218 unordered subexpressions b++ and b.
3220 A note on merging. If we modify the former example so that our expression
3221 becomes
3222 (b++, b) + a
3223 care must be taken not simply to add all three expressions into the final
3224 PNO_SP list. The function merge_tlist takes care of that by merging the
3225 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3226 way, so that no more than one access to B is recorded. */
3228 static void
3230 tree writer)
3231 {
3236 /* X may be NULL if it is the operand of an empty statement expression
3237 ({ }). */
3241 restart:
3249 {
3282 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3283 two first, to avoid warning for (a ? b++ : b++). */
3299 /* Expressions inside the LHS are not ordered wrt. the sequence points
3300 in the RHS. Example:
3301 *a = (a++, 2)
3302 Despite the fact that the modification of "a" is in the before_sp
3303 list (tmp_before), it conflicts with the use of "a" in the LHS.
3304 We can handle this by adding the contents of tmp_list3
3305 to those of tmp_before, and redoing the collision warnings for that
3306 list. */
3309 /* Exclude the LHS itself here; we first have to merge it into the
3310 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3311 didn't exclude the LHS, we'd get it twice, once as a read and once
3312 as a write. */
3323 /* We need to warn about conflicts among arguments and conflicts between
3324 args and the function address. Side effects of the function address,
3325 however, are not ordered by the sequence point of the call. */
3326 {
3327 call_expr_arg_iterator iter;
3328 tree arg;
3332 {
3337 }
3342 }
3345 /* Scan all the list, e.g. indices of multi dimensional array. */
3347 {
3353 }
3357 {
3364 {
3378 }
3382 }
3392 /* For other expressions, simply recurse on their operands.
3393 Manual tail recursion for unary expressions.
3394 Other non-expressions need not be processed. */
3396 {
3400 }
3402 {
3406 {
3411 }
3412 }
3414 }
3415 }
3417 /* Try to warn for undefined behavior in EXPR due to missing sequence
3418 points. */
3420 DEBUG_FUNCTION void
3422 {
3428 {
3431 }
3436 }
3437 \f
3438 /* Validate the expression after `case' and apply default promotions. */
3440 static tree
3442 {
3447 /* Promote char or short to int. */
3450 {
3453 }
3458 }
3459 \f
3460 /* See if the case values LOW and HIGH are in the range of the original
3461 type (i.e. before the default conversion to int) of the switch testing
3462 expression.
3463 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3464 the type before promoting it. CASE_LOW_P is a pointer to the lower
3465 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3466 if the case is not a case range.
3467 The caller has to make sure that we are not called with NULL for
3468 CASE_LOW_P (i.e. the default case).
3469 Returns true if the case label is in range of ORIG_TYPE (saturated or
3470 untouched) or false if the label is out of range. */
3472 static bool
3475 {
3480 /* If there was a problem with the original type, do nothing. */
3487 /* Case label is less than minimum for type. */
3490 {
3494 }
3496 /* Case value is greater than maximum for type. */
3499 {
3502 }
3504 /* Saturate lower case label value to minimum. */
3507 {
3511 }
3513 /* Saturate upper case label value to maximum. */
3516 {
3520 }
3528 }
3529 \f
3530 /* Return an integer type with BITS bits of precision,
3531 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3533 tree
3535 {
3577 }
3579 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3580 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3581 and saturating if SATP is nonzero, otherwise not saturating. */
3583 tree
3586 {
3587 machine_mode mode;
3590 else
3598 {
3600 "fixed-point types that have too many integral and "
3603 }
3606 }
3608 /* Used for communication between c_common_type_for_mode and
3609 c_register_builtin_type. */
3610 tree registered_builtin_types;
3612 /* Return a data type that has machine mode MODE.
3613 If the mode is an integer,
3614 then UNSIGNEDP selects between signed and unsigned types.
3615 If the mode is a fixed-point mode,
3616 then UNSIGNEDP selects between saturating and nonsaturating types. */
3618 tree
3620 {
3621 tree t;
3661 #if HOST_BITS_PER_WIDE_INT >= 64
3664 #endif
3689 {
3690 machine_mode inner_mode;
3691 tree inner_type;
3707 }
3709 {
3714 }
3724 {
3810 }
3818 }
3820 tree
3822 {
3824 }
3826 /* Return a signed type the same as TYPE in other respects. */
3828 tree
3830 {
3832 }
3834 /* Return a type the same as TYPE except unsigned or
3835 signed according to UNSIGNEDP. */
3837 tree
3839 {
3840 tree type1;
3843 /* This block of code emulates the behavior of the old
3844 c_common_unsigned_type. In particular, it returns
3845 long_unsigned_type_node if passed a long, even when a int would
3846 have the same size. This is necessary for warnings to work
3847 correctly in archs where sizeof(int) == sizeof(long) */
3850 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3870 #if HOST_BITS_PER_WIDE_INT >= 64
3873 #endif
3883 #define C_COMMON_FIXED_TYPES(NAME) \
3884 if (type1 == short_ ## NAME ## _type_node \
3885 || type1 == unsigned_short_ ## NAME ## _type_node) \
3886 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3887 : short_ ## NAME ## _type_node; \
3888 if (type1 == NAME ## _type_node \
3889 || type1 == unsigned_ ## NAME ## _type_node) \
3890 return unsignedp ? unsigned_ ## NAME ## _type_node \
3891 : NAME ## _type_node; \
3892 if (type1 == long_ ## NAME ## _type_node \
3893 || type1 == unsigned_long_ ## NAME ## _type_node) \
3894 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3895 : long_ ## NAME ## _type_node; \
3896 if (type1 == long_long_ ## NAME ## _type_node \
3897 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3898 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3899 : long_long_ ## NAME ## _type_node;
3901 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3902 if (type1 == NAME ## _type_node \
3903 || type1 == u ## NAME ## _type_node) \
3904 return unsignedp ? u ## NAME ## _type_node \
3905 : NAME ## _type_node;
3907 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3908 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3909 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3910 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3911 : sat_ ## short_ ## NAME ## _type_node; \
3912 if (type1 == sat_ ## NAME ## _type_node \
3913 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3914 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3915 : sat_ ## NAME ## _type_node; \
3916 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3917 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3918 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3919 : sat_ ## long_ ## NAME ## _type_node; \
3920 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3921 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3922 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3923 : sat_ ## long_long_ ## NAME ## _type_node;
3925 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3926 if (type1 == sat_ ## NAME ## _type_node \
3927 || type1 == sat_ ## u ## NAME ## _type_node) \
3928 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3929 : sat_ ## NAME ## _type_node;
3955 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3956 the precision; they have precision set to match their range, but
3957 may use a wider mode to match an ABI. If we change modes, we may
3958 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3959 the precision as well, so as to yield correct results for
3960 bit-field types. C++ does not have these separate bit-field
3961 types, and producing a signed or unsigned variant of an
3962 ENUMERAL_TYPE may cause other problems as well. */
3968 #define TYPE_OK(node) \
3969 (TYPE_MODE (type) == TYPE_MODE (node) \
3970 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3994 #if HOST_BITS_PER_WIDE_INT >= 64
3997 #endif
4006 #undef TYPE_OK
4009 }
4011 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
4013 tree
4015 {
4018 /* Extended integer types of the same width as a standard type have
4019 lesser rank, so those of the same width as int promote to int or
4020 unsigned int and are valid for printf formats expecting int or
4021 unsigned int. To avoid such special cases, avoid creating
4022 extended integer types for bit-fields if a standard integer type
4023 is available. */
4041 }
4043 /* The C version of the register_builtin_type langhook. */
4045 void
4047 {
4048 tree decl;
4058 }
4059 \f
4060 /* Print an error message for invalid operands to arith operation
4061 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
4062 LOCATION is the location of the message. */
4064 void
4067 {
4071 {
4116 }
4120 }
4121 \f
4122 /* Given an expression as a tree, return its original type. Do this
4123 by stripping any conversion that preserves the sign and precision. */
4124 static tree
4126 {
4129 }
4131 /* Subroutine of build_binary_op, used for comparison operations.
4132 See if the operands have both been converted from subword integer types
4133 and, if so, perhaps change them both back to their original type.
4134 This function is also responsible for converting the two operands
4135 to the proper common type for comparison.
4137 The arguments of this function are all pointers to local variables
4138 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4139 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4141 LOC is the location of the comparison.
4143 If this function returns nonzero, it means that the comparison has
4144 a constant value. What this function returns is an expression for
4145 that value. */
4147 tree
4150 {
4151 tree type;
4159 /* Throw away any conversions to wider types
4160 already present in the operands. */
4165 /* If primopN is first sign-extended from primopN's precision to opN's
4166 precision, then zero-extended from opN's precision to
4167 *restype_ptr precision, shortenings might be invalid. */
4170 && !unsignedp0
4175 && !unsignedp1
4179 /* Handle the case that OP0 does not *contain* a conversion
4180 but it *requires* conversion to FINAL_TYPE. */
4187 /* If one of the operands must be floated, we cannot optimize. */
4191 /* If first arg is constant, swap the args (changing operation
4192 so value is preserved), for canonicalization. Don't do this if
4193 the second arg is 0. */
4198 {
4215 {
4230 }
4232 }
4234 /* If comparing an integer against a constant more bits wide,
4235 maybe we can deduce a value of 1 or 0 independent of the data.
4236 Or else truncate the constant now
4237 rather than extend the variable at run time.
4239 This is only interesting if the constant is the wider arg.
4240 Also, it is not safe if the constant is unsigned and the
4241 variable arg is signed, since in this case the variable
4242 would be sign-extended and then regarded as unsigned.
4243 Our technique fails in this case because the lowest/highest
4244 possible unsigned results don't follow naturally from the
4245 lowest/highest possible values of the variable operand.
4246 For just EQ_EXPR and NE_EXPR there is another technique that
4247 could be used: see if the constant can be faithfully represented
4248 in the other operand's type, by truncating it and reextending it
4249 and see if that preserves the constant's value. */
4255 {
4258 /* 1 if comparison is nominally unsigned. */
4260 tree val;
4272 {
4273 /* Convert primop1 to target type, but do not introduce
4274 additional overflow. We know primop1 is an int_cst. */
4281 }
4283 {
4286 }
4294 /* This used to be a switch, but Genix compiler can't handle that. */
4296 {
4299 }
4301 {
4304 }
4306 {
4311 }
4313 {
4318 }
4320 {
4325 }
4327 {
4332 }
4334 /* If primop0 was sign-extended and unsigned comparison specd,
4335 we did a signed comparison above using the signed type bounds.
4336 But the comparison we output must be unsigned.
4338 Also, for inequalities, VAL is no good; but if the signed
4339 comparison had *any* fixed result, it follows that the
4340 unsigned comparison just tests the sign in reverse
4341 (positive values are LE, negative ones GE).
4342 So we can generate an unsigned comparison
4343 against an extreme value of the signed type. */
4346 {
4349 {
4364 }
4366 }
4369 {
4376 }
4379 {
4380 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4384 }
4386 /* Value is not predetermined, but do the comparison
4387 in the type of the operand that is not constant.
4388 TYPE is already properly set. */
4389 }
4391 /* If either arg is decimal float and the other is float, find the
4392 proper common type to use for comparison. */
4398 /* If either arg is decimal float and the other is float, fail. */
4409 /* If args' natural types are both narrower than nominal type
4410 and both extend in the same manner, compare them
4411 in the type of the wider arg.
4412 Otherwise must actually extend both to the nominal
4413 common type lest different ways of extending
4414 alter the result.
4415 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4420 {
4424 type);
4425 /* Make sure shorter operand is extended the right way
4426 to match the longer operand. */
4427 primop0
4430 primop0);
4431 primop1
4434 primop1);
4435 }
4436 else
4437 {
4438 /* Here we must do the comparison on the nominal type
4439 using the args exactly as we received them. */
4446 {
4448 /* All unsigned values are >= 0, so we warn. However,
4449 if OP0 is a constant that is >= 0, the signedness of
4450 the comparison isn't an issue, so suppress the
4451 warning. */
4456 primop0)))
4457 /* Do not warn for enumeration types. */
4461 {
4478 }
4481 {
4482 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4487 }
4488 }
4489 }
4497 }
4498 \f
4499 /* Return a tree for the sum or difference (RESULTCODE says which)
4500 of pointer PTROP and integer INTOP. */
4502 tree
4505 {
4508 /* The result is a pointer of the same type that is being added. */
4511 /* If the pointer lives in UPC shared memory, then
4512 drop the 'shared' qualifier. */
4517 {
4524 }
4526 {
4533 }
4534 else
4537 /* We are manipulating pointer values, so we don't need to warn
4538 about relying on undefined signed overflow. We disable the
4539 warning here because we use integer types so fold won't know that
4540 they are really pointers. */
4543 /* If what we are about to multiply by the size of the elements
4544 contains a constant term, apply distributive law
4545 and multiply that constant term separately.
4546 This helps produce common subexpressions. */
4551 /* If the constant comes from pointer subtraction,
4552 skip this optimization--it would cause an error. */
4554 /* If the constant is unsigned, and smaller than the pointer size,
4555 then we must skip this optimization. This is because it could cause
4556 an overflow error if the constant is negative but INTOP is not. */
4560 {
4565 /* Convert both subexpression types to the type of intop,
4566 because weird cases involving pointer arithmetic
4567 can result in a sum or difference with different type args. */
4572 }
4574 /* Convert the integer argument to a type the same size as sizetype
4575 so the multiply won't overflow spuriously. */
4581 /* Replace the integer argument with a suitable product by the object size.
4582 Do this multiplication as signed, then convert to the appropriate type
4583 for the pointer operation and disregard an overflow that occurred only
4584 because of the sign-extension change in the latter conversion. */
4585 {
4592 }
4594 /* Create the sum or difference. */
4603 }
4604 \f
4605 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4606 and if NON_CONST is known not to be permitted in an evaluated part
4607 of a constant expression. */
4609 tree
4611 {
4615 /* This should never be called for C++. */
4619 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4628 }
4630 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4631 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4632 around the SAVE_EXPR if needed so that c_fully_fold does not need
4633 to look inside SAVE_EXPRs. */
4635 tree
4637 {
4646 }
4648 /* Return whether EXPR is a declaration whose address can never be
4649 NULL. */
4651 bool
4653 {
4658 }
4660 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4661 or for an `if' or `while' statement or ?..: exp. It should already
4662 have been validated to be of suitable type; otherwise, a bad
4663 diagnostic may result.
4665 The EXPR is located at LOCATION.
4667 This preparation consists of taking the ordinary
4668 representation of an expression expr and producing a valid tree
4669 boolean expression describing whether expr is nonzero. We could
4670 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4671 but we optimize comparisons, &&, ||, and !.
4673 The resulting type should always be `truthvalue_type_node'. */
4675 tree
4677 {
4679 {
4721 ? truthvalue_true_node
4727 ? truthvalue_true_node
4732 /* Fall through. */
4735 {
4738 {
4739 /* Common Ada/Pascal programmer's mistake. */
4741 OPT_Waddress,
4743 inner);
4745 }
4747 }
4764 /* These don't change whether an object is nonzero or zero. */
4769 /* These don't change whether an object is zero or nonzero, but
4770 we can't ignore them if their second arg has side-effects. */
4772 {
4775 c_common_truthvalue_conversion
4778 }
4779 else
4784 /* Distribute the conversion into the arms of a COND_EXPR. */
4786 {
4789 /* In C++ one of the arms might have void type if it is throw. */
4797 }
4798 else
4799 {
4800 /* Folding will happen later for C. */
4808 }
4810 CASE_CONVERT:
4811 {
4815 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4816 since that affects how `default_conversion' will behave. */
4820 /* Don't strip a conversion from C++0x scoped enum, since they
4821 don't implicitly convert to other types. */
4825 /* If this isn't narrowing the argument, we can ignore it. */
4829 }
4835 {
4839 }
4844 }
4847 {
4849 expr = (build_binary_op
4853 c_common_truthvalue_conversion
4856 c_common_truthvalue_conversion
4861 }
4864 {
4869 }
4870 else
4873 ret:
4876 }
4877 \f
4886 /* Apply the TYPE_QUALS to the new DECL. */
4888 void
4890 {
4898 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4899 constructor can produce constant init, so rely on cp_finish_decl to
4900 clear TREE_READONLY if the variable has non-constant init. */
4903 {
4906 }
4908 {
4910 /* Allow 'restrict' on arrays of pointers.
4911 FIXME currently we just ignore it. */
4917 }
4919 {
4925 /* The declaration's type should have been previously defined
4926 as a UPC shared type. */
4928 }
4929 }
4932 {
4935 };
4937 /* Hash function for the problem of multiple type definitions in
4938 different files. This must hash all types that will compare
4939 equal via comptypes to the same value. In practice it hashes
4940 on some of the simple stuff and leaves the details to comptypes. */
4942 hashval_t
4944 {
4947 tree t2;
4949 {
4950 /* For pointers, hash on pointee type plus some swizzling. */
4953 /* Hash on number of elements and total size. */
4972 }
4973 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4974 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4976 /* We might have a VLA here. */
4979 else
4982 }
4984 bool
4986 {
4988 }
4992 /* Return the typed-based alias set for T, which may be an expression
4993 or a type. Return -1 if we don't do anything special. */
4995 alias_set_type
4997 {
4998 tree u;
5000 /* For VLAs, use the alias set of the element type rather than the
5001 default of alias set 0 for types compared structurally. */
5003 {
5007 }
5009 /* Permit type-punning when accessing a union, provided the access
5010 is directly through the union. For example, this code does not
5011 permit taking the address of a union member and then storing
5012 through it. Even the type-punning allowed here is a GCC
5013 extension, albeit a common and useful one; the C standard says
5014 that such accesses have implementation-defined behavior. */
5022 /* That's all the expressions we handle specially. */
5026 /* The C standard guarantees that any object may be accessed via an
5027 lvalue that has character type. */
5033 /* The C standard specifically allows aliasing between signed and
5034 unsigned variants of the same type. We treat the signed
5035 variant as canonical. */
5037 {
5040 /* t1 == t can happen for boolean nodes which are always unsigned. */
5043 }
5045 /* For the time being, make UPC pointers-to-shared conflict
5046 with everything else. Ideally, UPC pointers-to-shared should
5047 only conflict with the internal type used to represent
5048 the UPC pointer-to-shared (i.e., upc_pts_rep_type_node). */
5057 /* Handle the case of multiple type nodes referring to "the same" type,
5058 which occurs with IMA. These share an alias set. FIXME: Currently only
5059 C90 is handled. (In C99 type compatibility is not transitive, which
5060 complicates things mightily. The alias set splay trees can theoretically
5061 represent this, but insertion is tricky when you consider all the
5062 different orders things might arrive in.) */
5067 /* Save time if there's only one input file. */
5071 /* Pointers need special handling if they point to any type that
5072 needs special handling (below). */
5074 {
5075 tree t2;
5076 /* Find bottom type under any nested POINTERs. */
5080 ;
5088 }
5089 /* These are the only cases that need special handling. */
5096 /* Undefined? */
5100 /* Look up t in hash table. Only one of the compatible types within each
5101 alias set is recorded in the table. */
5106 {
5109 }
5110 else
5111 /* Our caller will assign and record (in t) a new alias set; all we need
5112 to do is remember t in the hash table. */
5116 }
5117 \f
5118 /* Return the value of THREADS.
5120 UPC defines a reserved variable, THREADS, which returns the
5121 number of threads that will be created when the UPC program
5122 executes. The value of threads can be specified at runtime via
5123 the -fupc-threads=N switch, where N is an integer specifying
5124 the number of threads. When the value of THREADS is specified
5125 at compile-time, this is called the "static threads compilation
5126 environment".
5128 In the static threads compilation environment, THREADS is a
5129 pre-defined preprocessor macro with the value, N.
5131 If no value for threads is given at compile-time, then the value
5132 must be specified when the application program is executed.
5133 This method of establishing the value of THREADS is called
5134 the "dynamic threads compilation environment". */
5136 tree
5138 {
5139 tree n;
5144 {
5146 "when compiling pre-processed source, "
5147 "all -fupc-* switches must be passed on the command line, "
5148 "asserting the same values as supplied when the "
5151 }
5154 }
5156 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5157 the IS_SIZEOF parameter indicates which operator is being applied.
5158 The COMPLAIN flag controls whether we should diagnose possibly
5159 ill-formed constructs or not. LOC is the location of the SIZEOF or
5160 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5161 a type in any context should be returned, rather than the normal
5162 alignment for that type. */
5164 tree
5168 {
5176 {
5178 {
5185 }
5186 else
5187 {
5189 {
5193 else
5196 }
5198 }
5199 }
5201 {
5203 {
5210 }
5211 else
5214 }
5217 {
5222 }
5225 {
5230 }
5231 else
5232 {
5234 /* Convert in case a char is more than one unit. */
5240 else
5242 }
5247 {
5250 }
5252 /* VALUE will have the middle-end integer type sizetype.
5253 However, we should really return a value of type `size_t',
5254 which is just a typedef for an ordinary integer type. */
5258 }
5260 /* Implement the __alignof keyword: Return the minimum required
5261 alignment of EXPR, measured in bytes. For VAR_DECLs,
5262 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5263 from an "aligned" __attribute__ specification). LOC is the
5264 location of the ALIGNOF operator. */
5266 tree
5268 {
5269 tree t;
5276 {
5279 }
5285 {
5292 {
5299 }
5301 }
5302 else
5306 }
5307 \f
5308 /* Handle C and C++ default attributes. */
5310 enum built_in_attribute
5311 {
5312 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5313 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5314 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5315 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5316 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5318 #undef DEF_ATTR_NULL_TREE
5319 #undef DEF_ATTR_INT
5320 #undef DEF_ATTR_STRING
5321 #undef DEF_ATTR_IDENT
5322 #undef DEF_ATTR_TREE_LIST
5323 ATTR_LAST
5324 };
5330 enum c_builtin_type
5331 {
5332 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5333 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5334 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5335 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5336 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5337 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5338 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5339 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5340 ARG6) NAME,
5341 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5342 ARG6, ARG7) NAME,
5343 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5344 ARG6, ARG7, ARG8) NAME,
5345 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5346 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5347 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5348 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5349 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5350 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5351 NAME,
5352 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5353 ARG6, ARG7) NAME,
5354 #define DEF_FUNCTION_TYPE_VAR_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5355 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5356 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5358 #undef DEF_PRIMITIVE_TYPE
5359 #undef DEF_FUNCTION_TYPE_0
5360 #undef DEF_FUNCTION_TYPE_1
5361 #undef DEF_FUNCTION_TYPE_2
5362 #undef DEF_FUNCTION_TYPE_3
5363 #undef DEF_FUNCTION_TYPE_4
5364 #undef DEF_FUNCTION_TYPE_5
5365 #undef DEF_FUNCTION_TYPE_6
5366 #undef DEF_FUNCTION_TYPE_7
5367 #undef DEF_FUNCTION_TYPE_8
5368 #undef DEF_FUNCTION_TYPE_VAR_0
5369 #undef DEF_FUNCTION_TYPE_VAR_1
5370 #undef DEF_FUNCTION_TYPE_VAR_2
5371 #undef DEF_FUNCTION_TYPE_VAR_3
5372 #undef DEF_FUNCTION_TYPE_VAR_4
5373 #undef DEF_FUNCTION_TYPE_VAR_5
5374 #undef DEF_FUNCTION_TYPE_VAR_7
5375 #undef DEF_FUNCTION_TYPE_VAR_11
5376 #undef DEF_POINTER_TYPE
5377 BT_LAST
5378 };
5382 /* A temporary array for c_common_nodes_and_builtins. Used in
5383 communication with def_fn_type. */
5386 /* A helper function for c_common_nodes_and_builtins. Build function type
5387 for DEF with return type RET and N arguments. If VAR is true, then the
5388 function should be variadic after those N arguments.
5390 Takes special care not to ICE if any of the types involved are
5391 error_mark_node, which indicates that said type is not in fact available
5392 (see builtin_type_for_size). In which case the function type as a whole
5393 should be error_mark_node. */
5395 static void
5397 {
5398 tree t;
5405 {
5411 }
5418 else
5421 egress:
5424 }
5426 /* Build builtin functions common to both C and C++ language
5427 frontends. */
5429 static void
5431 {
5432 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5433 builtin_types[ENUM] = VALUE;
5434 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5435 def_fn_type (ENUM, RETURN, 0, 0);
5436 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5437 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5438 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5439 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5440 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5441 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5442 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5443 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5444 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5445 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5446 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5447 ARG6) \
5448 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5449 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5450 ARG6, ARG7) \
5451 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5452 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5453 ARG6, ARG7, ARG8) \
5454 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5455 ARG7, ARG8);
5456 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5457 def_fn_type (ENUM, RETURN, 1, 0);
5458 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5459 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5460 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5461 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5462 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5463 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5464 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5465 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5466 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5467 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5468 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5469 ARG6, ARG7) \
5470 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5471 #define DEF_FUNCTION_TYPE_VAR_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5472 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5473 def_fn_type (ENUM, RETURN, 1, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5474 ARG7, ARG8, ARG9, ARG10, ARG11);
5475 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5476 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5480 #undef DEF_PRIMITIVE_TYPE
5481 #undef DEF_FUNCTION_TYPE_0
5482 #undef DEF_FUNCTION_TYPE_1
5483 #undef DEF_FUNCTION_TYPE_2
5484 #undef DEF_FUNCTION_TYPE_3
5485 #undef DEF_FUNCTION_TYPE_4
5486 #undef DEF_FUNCTION_TYPE_5
5487 #undef DEF_FUNCTION_TYPE_6
5488 #undef DEF_FUNCTION_TYPE_7
5489 #undef DEF_FUNCTION_TYPE_8
5490 #undef DEF_FUNCTION_TYPE_VAR_0
5491 #undef DEF_FUNCTION_TYPE_VAR_1
5492 #undef DEF_FUNCTION_TYPE_VAR_2
5493 #undef DEF_FUNCTION_TYPE_VAR_3
5494 #undef DEF_FUNCTION_TYPE_VAR_4
5495 #undef DEF_FUNCTION_TYPE_VAR_5
5496 #undef DEF_FUNCTION_TYPE_VAR_7
5497 #undef DEF_FUNCTION_TYPE_VAR_11
5498 #undef DEF_POINTER_TYPE
5503 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5504 NONANSI_P, ATTRS, IMPLICIT, COND) \
5505 if (NAME && COND) \
5506 def_builtin_1 (ENUM, NAME, CLASS, \
5507 builtin_types[(int) TYPE], \
5508 builtin_types[(int) LIBTYPE], \
5509 BOTH_P, FALLBACK_P, NONANSI_P, \
5510 built_in_attributes[(int) ATTRS], IMPLICIT);
5512 #undef DEF_BUILTIN
5520 }
5522 /* Like get_identifier, but avoid warnings about null arguments when
5523 the argument may be NULL for targets where GCC lacks stdint.h type
5524 information. */
5528 {
5530 }
5532 /* Build tree nodes and builtin functions common to both C and C++ language
5533 frontends. */
5535 void
5537 {
5541 tree array_domain_type;
5542 tree va_list_ref_type_node;
5543 tree va_list_arg_type_node;
5548 /* Define `int' and `char' first so that dbx will output them first. */
5552 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5553 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5554 but not C. Are the conditionals here needed? */
5560 long_unsigned_type_node);
5563 {
5572 }
5577 long_long_integer_type_node);
5579 long_long_unsigned_type_node);
5582 long_long_unsigned_type_node);
5585 short_unsigned_type_node);
5588 short_unsigned_type_node);
5590 /* Define both `signed char' and `unsigned char'. */
5594 /* These are types that c_common_type_for_size and
5595 c_common_type_for_mode use. */
5598 intQI_type_node));
5601 intHI_type_node));
5604 intSI_type_node));
5607 intDI_type_node));
5608 #if HOST_BITS_PER_WIDE_INT >= 64
5609 /* Note that this is different than the __int128 type that's part of
5610 the generic __intN support. */
5613 TYPE_DECL,
5615 intTI_type_node));
5616 #endif
5619 unsigned_intQI_type_node));
5622 unsigned_intHI_type_node));
5625 unsigned_intSI_type_node));
5628 unsigned_intDI_type_node));
5629 #if HOST_BITS_PER_WIDE_INT >= 64
5632 TYPE_DECL,
5634 unsigned_intTI_type_node));
5635 #endif
5637 /* Create the widest literal types. */
5638 widest_integer_literal_type_node
5642 widest_integer_literal_type_node));
5644 widest_unsigned_literal_type_node
5648 widest_unsigned_literal_type_node));
5652 pid_type_node =
5659 /* Only supported decimal floating point extension if the target
5660 actually supports underlying modes. */
5664 {
5668 }
5671 {
5676 long_long_fract_type_node);
5678 unsigned_short_fract_type_node);
5680 unsigned_fract_type_node);
5682 unsigned_long_fract_type_node);
5684 unsigned_long_long_fract_type_node);
5686 sat_short_fract_type_node);
5689 sat_long_fract_type_node);
5691 sat_long_long_fract_type_node);
5693 sat_unsigned_short_fract_type_node);
5695 sat_unsigned_fract_type_node);
5697 sat_unsigned_long_fract_type_node);
5699 sat_unsigned_long_long_fract_type_node);
5704 long_long_accum_type_node);
5706 unsigned_short_accum_type_node);
5708 unsigned_accum_type_node);
5710 unsigned_long_accum_type_node);
5712 unsigned_long_long_accum_type_node);
5714 sat_short_accum_type_node);
5717 sat_long_accum_type_node);
5719 sat_long_long_accum_type_node);
5721 sat_unsigned_short_accum_type_node);
5723 sat_unsigned_accum_type_node);
5725 sat_unsigned_long_accum_type_node);
5727 sat_unsigned_long_long_accum_type_node);
5729 }
5732 TYPE_DECL,
5734 complex_integer_type_node));
5736 TYPE_DECL,
5738 complex_float_type_node));
5740 TYPE_DECL,
5742 complex_double_type_node));
5746 complex_long_double_type_node));
5749 /* For C++, make fileptr_type_node a distinct void * type until
5750 FILE type is defined. */
5755 /* Set the TYPE_NAME for any variants that were built before
5756 record_builtin_type gave names to the built-in types. */
5757 {
5763 }
5767 /* Make a type to be the domain of a few array types
5768 whose domains don't really matter.
5769 200 is small enough that it always fits in size_t
5770 and large enough that it can hold most function names for the
5771 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5774 /* Make a type for arrays of characters.
5775 With luck nothing will ever really depend on the length of this
5776 array type. */
5777 char_array_type_node
5781 const_string_type_node
5785 /* This is special for C++ so functions can be overloaded. */
5791 {
5794 else
5797 }
5799 /* This is for wide string constants. */
5800 wchar_array_type_node
5803 /* Define 'char16_t'. */
5808 {
5813 }
5815 /* This is for UTF-16 string constants. */
5816 char16_array_type_node
5819 /* Define 'char32_t'. */
5824 {
5829 }
5831 /* This is for UTF-32 string constants. */
5832 char32_array_type_node
5835 wint_type_node =
5838 intmax_type_node =
5840 uintmax_type_node =
5844 sig_atomic_type_node =
5847 int8_type_node =
5850 int16_type_node =
5853 int32_type_node =
5856 int64_type_node =
5859 uint8_type_node =
5871 int_least8_type_node =
5874 int_least16_type_node =
5877 int_least32_type_node =
5880 int_least64_type_node =
5883 uint_least8_type_node =
5886 uint_least16_type_node =
5889 uint_least32_type_node =
5892 uint_least64_type_node =
5895 int_fast8_type_node =
5898 int_fast16_type_node =
5901 int_fast32_type_node =
5904 int_fast64_type_node =
5907 uint_fast8_type_node =
5910 uint_fast16_type_node =
5913 uint_fast32_type_node =
5916 uint_fast64_type_node =
5919 intptr_type_node =
5922 uintptr_type_node =
5925 default_function_type
5927 ptrdiff_type_node
5934 va_list_type_node));
5936 {
5939 tree ptype;
5942 {
5946 ptype));
5948 }
5949 }
5952 {
5955 }
5956 else
5957 {
5960 }
5967 /* Create the built-in __null node. It is important that this is
5968 not shared. */
5972 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5974 }
5976 /* The number of named compound-literals generated thus far. */
5979 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5981 void
5983 {
5986 compound_literal_number);
5987 compound_literal_number++;
5989 }
5991 tree
5993 {
5997 }
6000 /* Linked list of disabled built-in functions. */
6003 {
6011 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
6012 begins with "__builtin_", give an error. */
6014 void
6016 {
6019 else
6020 {
6025 }
6026 }
6029 /* Return true if the built-in function NAME has been disabled, false
6030 otherwise. */
6032 static bool
6034 {
6037 {
6040 }
6042 }
6045 /* Worker for DEF_BUILTIN.
6046 Possibly define a builtin function with one or two names.
6047 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6048 nonansi_p and flag_no_nonansi_builtin. */
6050 static void
6057 {
6058 tree decl;
6071 fnattrs);
6080 }
6081 \f
6082 /* Nonzero if the type T promotes to int. This is (nearly) the
6083 integral promotions defined in ISO C99 6.3.1.1/2. */
6085 bool
6087 {
6089 {
6099 /* ??? Technically all enumerations not larger than an int
6100 promote to an int. But this is used along code paths
6101 that only want to notice a size change. */
6109 }
6110 }
6112 /* Return 1 if PARMS specifies a fixed number of parameters
6113 and none of their types is affected by default promotions. */
6115 int
6117 {
6118 const_tree t;
6120 {
6137 }
6139 }
6141 /* Recursively remove any '*' or '&' operator from TYPE. */
6142 tree
6144 {
6148 }
6150 /* Recursively remove pointer or array type from TYPE. */
6151 tree
6153 {
6157 }
6159 /* Used to compare case labels. K1 and K2 are actually tree nodes
6160 representing case labels, or NULL_TREE for a `default' label.
6161 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6162 K2, and 0 if K1 and K2 are equal. */
6164 int
6166 {
6167 /* Consider a NULL key (such as arises with a `default' label) to be
6168 smaller than anything else. */
6175 }
6177 /* Process a case label, located at LOC, for the range LOW_VALUE
6178 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6179 then this case label is actually a `default' label. If only
6180 HIGH_VALUE is NULL_TREE, then case label was declared using the
6181 usual C/C++ syntax, rather than the GNU case range extension.
6182 CASES is a tree containing all the case ranges processed so far;
6183 COND is the condition for the switch-statement itself. Returns the
6184 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6185 is created. */
6187 tree
6190 {
6191 tree type;
6192 tree label;
6193 tree case_label;
6194 splay_tree_node node;
6196 /* Create the LABEL_DECL itself. */
6199 /* If there was an error processing the switch condition, bail now
6200 before we get more confused. */
6208 {
6211 }
6213 /* Case ranges are a GNU extension. */
6220 {
6225 }
6227 {
6232 }
6235 {
6236 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6237 really a case range, even though it was written that way.
6238 Remove the HIGH_VALUE to simplify later processing. */
6243 }
6245 /* See if the case is in range of the type of the original testing
6246 expression. If both low_value and high_value are out of range,
6247 don't insert the case label and return NULL_TREE. */
6253 /* Look up the LOW_VALUE in the table of case labels we already
6254 have. */
6256 /* If there was not an exact match, check for overlapping ranges.
6257 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6258 that's a `default' label and the only overlap is an exact match. */
6260 {
6261 splay_tree_node low_bound;
6262 splay_tree_node high_bound;
6264 /* Even though there wasn't an exact match, there might be an
6265 overlap between this case range and another case range.
6266 Since we've (inductively) not allowed any overlapping case
6267 ranges, we simply need to find the greatest low case label
6268 that is smaller that LOW_VALUE, and the smallest low case
6269 label that is greater than LOW_VALUE. If there is an overlap
6270 it will occur in one of these two ranges. */
6276 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6277 the LOW_VALUE, so there is no need to check unless the
6278 LOW_BOUND is in fact itself a case range. */
6284 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6285 range is bigger than the low end of the current range, so we
6286 are only interested if the current range is a real range, and
6287 not an ordinary case label. */
6289 && high_value
6291 high_value)
6294 }
6295 /* If there was an overlap, issue an error. */
6297 {
6301 {
6305 }
6307 {
6310 }
6311 else
6312 {
6316 }
6318 }
6320 /* Add a CASE_LABEL to the statement-tree. */
6322 /* Register this case label in the splay tree. */
6329 error_out:
6330 /* Add a label so that the back-end doesn't think that the beginning of
6331 the switch is unreachable. Note that we do not add a case label, as
6332 that just leads to duplicates and thence to failure later on. */
6334 {
6337 }
6339 }
6341 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6342 Used to verify that case values match up with enumerator values. */
6344 static void
6346 {
6353 else
6360 buf);
6361 else
6366 }
6368 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6369 Used to verify that case values match up with enumerator values. */
6371 static int
6373 {
6377 /* Skip default case. */
6381 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6382 when we did our enum->case scan. Reset our scratch bit after. */
6385 else
6388 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6389 not set, that means that CASE_HIGH did not appear when we did our
6390 enum->case scan. Reset our scratch bit after. */
6392 {
6395 else
6397 }
6400 }
6402 /* Handle -Wswitch*. Called from the front end after parsing the
6403 switch construct. */
6404 /* ??? Should probably be somewhere generic, since other languages
6405 besides C and C++ would want this. At the moment, however, C/C++
6406 are the only tree-ssa languages that support enumerations at all,
6407 so the point is moot. */
6409 void
6412 {
6413 splay_tree_node default_node;
6414 splay_tree_node node;
6415 tree chain;
6425 /* From here on, we only care about about enumerated types. */
6429 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6433 /* Check the cases. Warn about case values which are not members of
6434 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6435 there is no default case, check that exactly all enumeration
6436 literals are covered by the cases. */
6438 /* Clearing COND if it is not an integer constant simplifies
6439 the tests inside the loop below. */
6443 /* The time complexity here is O(N*lg(N)) worst case, but for the
6444 common case of monotonically increasing enumerators, it is
6445 O(N), since the nature of the splay tree will keep the next
6446 element adjacent to the root at all times. */
6449 {
6455 {
6456 /* Mark the CASE_LOW part of the case entry as seen. */
6460 }
6462 /* Even though there wasn't an exact match, there might be a
6463 case range which includes the enumerator's value. */
6466 {
6470 {
6471 /* If we match the upper bound exactly, mark the CASE_HIGH
6472 part of the case entry as seen. */
6476 }
6477 }
6479 /* We've now determined that this enumerated literal isn't
6480 handled by the case labels of the switch statement. */
6482 /* If the switch expression is a constant, we only really care
6483 about whether that constant is handled by the switch. */
6487 /* If there is a default_node, the only relevant option is
6488 Wswitch-enum. Otherwise, if both are enabled then we prefer
6489 to warn using -Wswitch because -Wswitch is enabled by -Wall
6490 while -Wswitch-enum is explicit. */
6493 ? OPT_Wswitch_enum
6497 }
6499 /* Warn if there are case expressions that don't correspond to
6500 enumerators. This can occur since C and C++ don't enforce
6501 type-checking of assignments to enumeration variables.
6503 The time complexity here is now always O(N) worst case, since
6504 we should have marked both the lower bound and upper bound of
6505 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6506 above. This scan also resets those fields. */
6509 }
6511 /* Finish an expression taking the address of LABEL (an
6512 IDENTIFIER_NODE). Returns an expression for the address.
6514 LOC is the location for the expression returned. */
6516 tree
6518 {
6519 tree result;
6529 else
6530 {
6533 /* The current function is not necessarily uninlinable.
6534 Computed gotos are incompatible with inlining, but the value
6535 here could be used only in a diagnostic, for example. */
6537 }
6540 }
6541 \f
6543 /* Given a boolean expression ARG, return a tree representing an increment
6544 or decrement (as indicated by CODE) of ARG. The front end must check for
6545 invalid cases (e.g., decrement in C++). */
6546 tree
6548 {
6549 tree val;
6554 {
6577 }
6580 }
6581 \f
6582 /* Built-in macros for stddef.h and stdint.h, that require macros
6583 defined in this file. */
6584 void
6586 {
6649 }
6651 static void
6653 {
6654 /* Fill in the built_in_attributes array. */
6655 #define DEF_ATTR_NULL_TREE(ENUM) \
6656 built_in_attributes[(int) ENUM] = NULL_TREE;
6657 #define DEF_ATTR_INT(ENUM, VALUE) \
6658 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6659 #define DEF_ATTR_STRING(ENUM, VALUE) \
6660 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6661 #define DEF_ATTR_IDENT(ENUM, STRING) \
6662 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6663 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6664 built_in_attributes[(int) ENUM] \
6665 = tree_cons (built_in_attributes[(int) PURPOSE], \
6666 built_in_attributes[(int) VALUE], \
6667 built_in_attributes[(int) CHAIN]);
6669 #undef DEF_ATTR_NULL_TREE
6670 #undef DEF_ATTR_INT
6671 #undef DEF_ATTR_IDENT
6672 #undef DEF_ATTR_TREE_LIST
6673 }
6675 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6676 identifier as an argument, so the front end shouldn't look it up. */
6678 bool
6680 {
6683 /* Unknown attribute that we'll end up ignoring, return true so we
6684 don't complain about an identifier argument. */
6690 else
6692 }
6694 /* Attribute handlers common to C front ends. */
6696 /* Handle a "packed" attribute; arguments as in
6697 struct attribute_spec.handler. */
6699 static tree
6702 {
6704 {
6708 }
6710 {
6712 /* Still pack bitfields. */
6717 else
6719 }
6720 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6721 used for DECL_REGISTER. It wouldn't mean anything anyway.
6722 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6723 that changes what the typedef is typing. */
6724 else
6725 {
6728 }
6731 }
6733 /* Handle a "nocommon" attribute; arguments as in
6734 struct attribute_spec.handler. */
6736 static tree
6740 {
6743 else
6744 {
6747 }
6750 }
6752 /* Handle a "common" attribute; arguments as in
6753 struct attribute_spec.handler. */
6755 static tree
6758 {
6761 else
6762 {
6765 }
6768 }
6770 /* Handle a "noreturn" attribute; arguments as in
6771 struct attribute_spec.handler. */
6773 static tree
6776 {
6779 /* See FIXME comment in c_common_attribute_table. */
6786 = (build_qualified_type
6787 (build_pointer_type
6791 else
6792 {
6795 }
6798 }
6800 /* Handle a "hot" and attribute; arguments as in
6801 struct attribute_spec.handler. */
6803 static tree
6806 {
6809 {
6811 {
6815 }
6816 /* Most of the rest of the hot processing is done later with
6817 lookup_attribute. */
6818 }
6819 else
6820 {
6823 }
6826 }
6828 /* Handle a "cold" and attribute; arguments as in
6829 struct attribute_spec.handler. */
6831 static tree
6834 {
6837 {
6839 {
6843 }
6844 /* Most of the rest of the cold processing is done later with
6845 lookup_attribute. */
6846 }
6847 else
6848 {
6851 }
6854 }
6856 /* Handle a "no_sanitize_address" attribute; arguments as in
6857 struct attribute_spec.handler. */
6859 static tree
6862 {
6864 {
6867 }
6870 }
6872 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6873 struct attribute_spec.handler. */
6875 static tree
6878 {
6887 }
6889 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6890 struct attribute_spec.handler. */
6892 static tree
6895 {
6897 {
6900 }
6903 }
6905 /* Handle a "stack_protect" attribute; arguments as in
6906 struct attribute_spec.handler. */
6907 static tree
6910 {
6912 {
6915 }
6916 else
6922 }
6924 /* Handle a "noinline" attribute; arguments as in
6925 struct attribute_spec.handler. */
6927 static tree
6931 {
6933 {
6935 {
6939 }
6940 else
6942 }
6943 else
6944 {
6947 }
6950 }
6952 /* Handle a "noclone" attribute; arguments as in
6953 struct attribute_spec.handler. */
6955 static tree
6959 {
6961 {
6964 }
6967 }
6969 /* Handle a "no_icf" attribute; arguments as in
6970 struct attribute_spec.handler. */
6972 static tree
6976 {
6978 {
6981 }
6984 }
6987 /* Handle a "always_inline" attribute; arguments as in
6988 struct attribute_spec.handler. */
6990 static tree
6995 {
6997 {
6999 {
7003 }
7004 else
7005 /* Set the attribute and mark it for disregarding inline
7006 limits. */
7008 }
7009 else
7010 {
7013 }
7016 }
7018 /* Handle a "gnu_inline" attribute; arguments as in
7019 struct attribute_spec.handler. */
7021 static tree
7026 {
7028 {
7029 /* Do nothing else, just set the attribute. We'll get at
7030 it later with lookup_attribute. */
7031 }
7032 else
7033 {
7036 }
7039 }
7041 /* Handle a "leaf" attribute; arguments as in
7042 struct attribute_spec.handler. */
7044 static tree
7048 {
7050 {
7053 }
7055 {
7058 }
7061 }
7063 /* Handle an "artificial" attribute; arguments as in
7064 struct attribute_spec.handler. */
7066 static tree
7071 {
7073 {
7074 /* Do nothing else, just set the attribute. We'll get at
7075 it later with lookup_attribute. */
7076 }
7077 else
7078 {
7081 }
7084 }
7086 /* Handle a "flatten" attribute; arguments as in
7087 struct attribute_spec.handler. */
7089 static tree
7091 tree args ATTRIBUTE_UNUSED,
7093 {
7095 /* Do nothing else, just set the attribute. We'll get at
7096 it later with lookup_attribute. */
7097 ;
7098 else
7099 {
7102 }
7105 }
7107 /* Handle a "warning" or "error" attribute; arguments as in
7108 struct attribute_spec.handler. */
7110 static tree
7113 {
7116 /* Do nothing else, just set the attribute. We'll get at
7117 it later with lookup_attribute. */
7118 ;
7119 else
7120 {
7123 }
7126 }
7128 /* Handle a "used" attribute; arguments as in
7129 struct attribute_spec.handler. */
7131 static tree
7134 {
7140 {
7145 }
7146 else
7147 {
7150 }
7153 }
7155 /* Handle a "unused" attribute; arguments as in
7156 struct attribute_spec.handler. */
7158 static tree
7161 {
7163 {
7171 {
7176 }
7177 else
7178 {
7181 }
7182 }
7183 else
7184 {
7188 }
7191 }
7193 /* Handle a "externally_visible" attribute; arguments as in
7194 struct attribute_spec.handler. */
7196 static tree
7201 {
7205 {
7208 {
7212 }
7213 }
7214 else
7215 {
7218 }
7221 }
7223 /* Handle the "no_reorder" attribute. Arguments as in
7224 struct attribute_spec.handler. */
7226 static tree
7228 tree name,
7229 tree,
7232 {
7237 {
7240 name);
7242 }
7245 }
7247 /* Handle a "const" attribute; arguments as in
7248 struct attribute_spec.handler. */
7250 static tree
7253 {
7256 /* See FIXME comment on noreturn in c_common_attribute_table. */
7262 = (build_qualified_type
7263 (build_pointer_type
7267 else
7268 {
7271 }
7274 }
7276 /* Handle a "transparent_union" attribute; arguments as in
7277 struct attribute_spec.handler. */
7279 static tree
7283 {
7284 tree type;
7295 {
7296 /* Make sure that the first field will work for a transparent union.
7297 If the type isn't complete yet, leave the check to the code in
7298 finish_struct. */
7300 {
7306 }
7309 {
7310 /* If the type isn't complete yet, setting the flag
7311 on a variant wouldn't ever be checked. */
7315 /* build_duplicate_type doesn't work for C++. */
7319 /* A type variant isn't good enough, since we don't a cast
7320 to such a type removed as a no-op. */
7322 }
7326 }
7328 ignored:
7331 }
7333 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7334 get the requested priority for a constructor or destructor,
7335 possibly issuing diagnostics for invalid or reserved
7336 priorities. */
7338 static priority_type
7340 {
7341 HOST_WIDE_INT pri;
7342 tree arg;
7348 {
7351 else
7354 }
7371 {
7374 "destructor priorities from 0 to %d are reserved "
7376 MAX_RESERVED_INIT_PRIORITY);
7377 else
7379 "constructor priorities from 0 to %d are reserved "
7381 MAX_RESERVED_INIT_PRIORITY);
7382 }
7385 invalid:
7388 MAX_INIT_PRIORITY);
7389 else
7391 MAX_INIT_PRIORITY);
7393 }
7395 /* Handle a "constructor" attribute; arguments as in
7396 struct attribute_spec.handler. */
7398 static tree
7402 {
7409 {
7410 priority_type priority;
7415 }
7416 else
7417 {
7420 }
7423 }
7425 /* Handle a "destructor" attribute; arguments as in
7426 struct attribute_spec.handler. */
7428 static tree
7432 {
7439 {
7440 priority_type priority;
7445 }
7446 else
7447 {
7450 }
7453 }
7455 /* Nonzero if the mode is a valid vector mode for this architecture.
7456 This returns nonzero even if there is no hardware support for the
7457 vector mode, but we can emulate with narrower modes. */
7459 static int
7461 {
7463 machine_mode innermode;
7465 /* Doh! What's going on? */
7474 /* Hardware support. Woo hoo! */
7480 /* We should probably return 1 if requesting V4DI and we have no DI,
7481 but we have V2DI, but this is probably very unlikely. */
7483 /* If we have support for the inner mode, we can safely emulate it.
7484 We may not have V2DI, but me can emulate with a pair of DIs. */
7486 }
7489 /* Handle a "mode" attribute; arguments as in
7490 struct attribute_spec.handler. */
7492 static tree
7495 {
7503 else
7504 {
7509 tree typefm;
7514 {
7520 }
7522 /* Change this type to have a type with the specified mode.
7523 First check for the special modes. */
7536 else
7539 {
7542 }
7545 {
7548 }
7552 {
7584 }
7586 {
7589 }
7592 {
7597 {
7600 }
7604 else
7607 }
7608 else
7609 {
7610 /* For fixed-point modes, we need to test if the signness of type
7611 and the machine mode are consistent. */
7614 {
7617 }
7618 /* For fixed-point modes, we need to pass saturating info. */
7622 }
7625 {
7628 }
7630 {
7631 /* For enumeral types, copy the precision from the integer
7632 type returned above. If not an INTEGER_TYPE, we can't use
7633 this mode for this type. */
7635 {
7638 }
7641 {
7644 }
7645 else
7646 {
7647 /* We cannot build a type variant, as there's code that assumes
7648 that TYPE_MAIN_VARIANT has the same mode. This includes the
7649 debug generators. Instead, create a subrange type. This
7650 results in all of the enumeral values being emitted only once
7651 in the original, and the subtype gets them by reference. */
7654 else
7657 }
7658 }
7662 {
7665 }
7668 }
7671 }
7673 /* Handle a "section" attribute; arguments as in
7674 struct attribute_spec.handler. */
7676 static tree
7679 {
7683 {
7689 {
7693 {
7695 "section attribute cannot be specified for "
7698 }
7700 /* The decl may have already been given a section attribute
7701 from a previous declaration. Ensure they match. */
7705 {
7709 }
7713 {
7716 }
7717 else
7720 }
7721 else
7722 {
7725 }
7726 }
7727 else
7728 {
7732 }
7735 }
7737 /* Check whether ALIGN is a valid user-specified alignment. If so,
7738 return its base-2 log; if not, output an error and return -1. If
7739 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7740 no error. */
7741 int
7743 {
7750 {
7753 }
7758 {
7761 }
7763 {
7766 }
7768 }
7770 /*
7771 If in c++-11, check if the c++-11 alignment constraint with respect
7772 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7773 c++-11 mode, does nothing.
7775 [dcl.align]2/ says:
7777 [* if the constant expression evaluates to a fundamental alignment,
7778 the alignment requirement of the declared entity shall be the
7779 specified fundamental alignment.
7781 * if the constant expression evaluates to an extended alignment
7782 and the implementation supports that alignment in the context
7783 of the declaration, the alignment of the declared entity shall
7784 be that alignment
7786 * if the constant expression evaluates to an extended alignment
7787 and the implementation does not support that alignment in the
7788 context of the declaration, the program is ill-formed]. */
7790 static bool
7794 {
7807 {
7809 {
7810 /* For file scope variables and static members, the target
7811 supports alignments that are at most
7812 MAX_OFILE_ALIGNMENT. */
7815 }
7816 else
7817 {
7818 #ifdef BIGGEST_FIELD_ALIGNMENT
7819 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7820 #else
7821 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7822 #endif
7823 /* For non-static members, the target supports either
7824 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7825 if it is defined or BIGGEST_ALIGNMENT. */
7830 #undef MAX_TARGET_FIELD_ALIGNMENT
7831 /* For stack variables, the target supports at most
7832 MAX_STACK_ALIGNMENT. */
7836 }
7837 }
7839 {
7840 /* Let's be liberal for types. */
7843 }
7851 }
7853 /* Handle a "aligned" attribute; arguments as in
7854 struct attribute_spec.handler. */
7856 static tree
7859 {
7863 tree align_expr;
7867 {
7872 }
7873 else
7877 {
7881 }
7889 {
7892 /* If we have a TYPE_DECL, then copy the type, so that we
7893 don't accidentally modify a builtin type. See pushdecl. */
7896 {
7903 }
7904 else
7909 }
7912 {
7915 }
7918 /* C++-11 [dcl.align/4]:
7920 When multiple alignment-specifiers are specified for an
7921 entity, the alignment requirement shall be set to the
7922 strictest specified alignment.
7924 This formally comes from the c++11 specification but we are
7925 doing it for the GNU attribute syntax as well. */
7929 {
7934 else
7938 }
7939 else
7940 {
7943 }
7946 }
7948 /* Handle a "weak" attribute; arguments as in
7949 struct attribute_spec.handler. */
7951 static tree
7956 {
7959 {
7962 }
7964 {
7968 }
7971 {
7976 }
7977 else
7981 }
7983 /* Handle an "alias" or "ifunc" attribute; arguments as in
7984 struct attribute_spec.handler, except that IS_ALIAS tells us
7985 whether this is an alias as opposed to ifunc attribute. */
7987 static tree
7990 {
7995 {
7998 }
8002 /* A static variable declaration is always a tentative definition,
8003 but the alias is a non-tentative definition which overrides. */
8006 {
8010 }
8014 {
8018 }
8020 /* Note that the very first time we process a nested declaration,
8021 decl_function_context will not be set. Indeed, *would* never
8022 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8023 we do below. After such frobbery, pushdecl would set the context.
8024 In any case, this is never what we want. */
8026 {
8027 tree id;
8031 {
8035 }
8037 /* This counts as a use of the object pointed to. */
8042 else
8046 /* ifuncs are also aliases, so set that attribute too. */
8049 }
8050 else
8051 {
8054 }
8057 {
8060 {
8063 else
8065 }
8066 }
8070 }
8072 /* Handle an "alias" or "ifunc" attribute; arguments as in
8073 struct attribute_spec.handler. */
8075 static tree
8078 {
8080 }
8082 /* Handle an "alias" or "ifunc" attribute; arguments as in
8083 struct attribute_spec.handler. */
8085 static tree
8088 {
8090 }
8092 /* Handle a "weakref" attribute; arguments as in struct
8093 attribute_spec.handler. */
8095 static tree
8098 {
8101 /* We must ignore the attribute when it is associated with
8102 local-scoped decls, since attribute alias is ignored and many
8103 such symbols do not even have a DECL_WEAK field. */
8105 || current_function_decl
8107 {
8111 }
8114 {
8118 }
8120 /* The idea here is that `weakref("name")' mutates into `weakref,
8121 alias("name")', and weakref without arguments, in turn,
8122 implicitly adds weak. */
8125 {
8132 }
8133 else
8134 {
8139 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8140 and that isn't supported; and because it wants to add it to
8141 the list of weak decls, which isn't helpful. */
8143 }
8146 {
8150 }
8153 }
8155 /* Handle an "visibility" attribute; arguments as in
8156 struct attribute_spec.handler. */
8158 static tree
8162 {
8168 {
8172 {
8174 name);
8176 }
8178 {
8182 }
8183 }
8185 {
8188 }
8191 {
8194 }
8196 /* If this is a type, set the visibility on the type decl. */
8198 {
8203 {
8205 name);
8207 }
8208 }
8218 else
8219 {
8220 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8222 }
8226 {
8240 }
8245 /* Go ahead and attach the attribute to the node as well. This is needed
8246 so we can determine whether we have VISIBILITY_DEFAULT because the
8247 visibility was not specified, or because it was explicitly overridden
8248 from the containing scope. */
8251 }
8253 /* Determine the ELF symbol visibility for DECL, which is either a
8254 variable or a function. It is an error to use this function if a
8255 definition of DECL is not available in this translation unit.
8256 Returns true if the final visibility has been determined by this
8257 function; false if the caller is free to make additional
8258 modifications. */
8260 bool
8262 {
8266 /* If the user explicitly specified the visibility with an
8267 attribute, honor that. DECL_VISIBILITY will have been set during
8268 the processing of the attribute. We check for an explicit
8269 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8270 to distinguish the use of an attribute from the use of a "#pragma
8271 GCC visibility push(...)"; in the latter case we still want other
8272 considerations to be able to overrule the #pragma. */
8274 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8279 /* Set default visibility to whatever the user supplied with
8280 visibility_specified depending on #pragma GCC visibility. */
8282 {
8285 {
8288 /* If visibility changed and DECL already has DECL_RTL, ensure
8289 symbol flags are updated. */
8294 }
8295 }
8297 }
8299 /* Handle an "tls_model" attribute; arguments as in
8300 struct attribute_spec.handler. */
8302 static tree
8305 {
8306 tree id;
8313 {
8316 }
8321 {
8324 }
8334 else
8335 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8339 }
8341 /* Handle a "no_instrument_function" attribute; arguments as in
8342 struct attribute_spec.handler. */
8344 static tree
8349 {
8353 {
8357 }
8358 else
8362 }
8364 /* Handle a "malloc" attribute; arguments as in
8365 struct attribute_spec.handler. */
8367 static tree
8370 {
8374 else
8375 {
8378 }
8381 }
8383 /* Handle a "alloc_size" attribute; arguments as in
8384 struct attribute_spec.handler. */
8386 static tree
8389 {
8392 {
8399 || !arg_count
8401 {
8406 }
8407 }
8409 }
8411 /* Handle a "alloc_align" attribute; arguments as in
8412 struct attribute_spec.handler. */
8414 static tree
8417 {
8424 || !arg_count
8426 {
8431 }
8433 }
8435 /* Handle a "assume_aligned" attribute; arguments as in
8436 struct attribute_spec.handler. */
8438 static tree
8441 {
8443 {
8450 {
8455 }
8456 }
8458 }
8460 /* Handle a "fn spec" attribute; arguments as in
8461 struct attribute_spec.handler. */
8463 static tree
8467 {
8472 }
8474 /* Handle a "bnd_variable_size" attribute; arguments as in
8475 struct attribute_spec.handler. */
8477 static tree
8480 {
8482 {
8485 }
8488 }
8490 /* Handle a "bnd_legacy" attribute; arguments as in
8491 struct attribute_spec.handler. */
8493 static tree
8496 {
8498 {
8501 }
8504 }
8506 /* Handle a "bnd_instrument" attribute; arguments as in
8507 struct attribute_spec.handler. */
8509 static tree
8512 {
8514 {
8517 }
8520 }
8522 /* Handle a "warn_unused" attribute; arguments as in
8523 struct attribute_spec.handler. */
8525 static tree
8527 tree args ATTRIBUTE_UNUSED,
8529 {
8531 /* Do nothing else, just set the attribute. We'll get at
8532 it later with lookup_attribute. */
8533 ;
8534 else
8535 {
8538 }
8541 }
8543 /* Handle an "omp declare simd" attribute; arguments as in
8544 struct attribute_spec.handler. */
8546 static tree
8548 {
8550 }
8552 /* Handle an "omp declare target" attribute; arguments as in
8553 struct attribute_spec.handler. */
8555 static tree
8557 {
8559 }
8561 /* Handle a "returns_twice" attribute; arguments as in
8562 struct attribute_spec.handler. */
8564 static tree
8567 {
8570 else
8571 {
8574 }
8577 }
8579 /* Handle a "no_limit_stack" attribute; arguments as in
8580 struct attribute_spec.handler. */
8582 static tree
8587 {
8591 {
8595 }
8597 {
8601 }
8602 else
8606 }
8608 /* Handle a "pure" attribute; arguments as in
8609 struct attribute_spec.handler. */
8611 static tree
8614 {
8617 /* ??? TODO: Support types. */
8618 else
8619 {
8622 }
8625 }
8627 /* Digest an attribute list destined for a transactional memory statement.
8628 ALLOWED is the set of attributes that are allowed for this statement;
8629 return the attribute we parsed. Multiple attributes are never allowed. */
8631 int
8633 {
8638 {
8646 {
8649 }
8652 {
8655 }
8658 else
8660 }
8663 }
8665 /* Transform a TM attribute name into a maskable integer and back.
8666 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8667 to how the lack of an attribute is treated. */
8669 int
8671 {
8685 }
8687 tree
8689 {
8692 {
8710 }
8712 }
8714 /* Return the first TM attribute seen in LIST. */
8716 tree
8718 {
8720 {
8724 }
8726 }
8728 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8729 Here we accept only function types, and verify that none of the other
8730 function TM attributes are also applied. */
8731 /* ??? We need to accept class types for C++, but not C. This greatly
8732 complicates this function, since we can no longer rely on the extra
8733 processing given by function_type_required. */
8735 static tree
8738 {
8739 /* Only one path adds the attribute; others don't. */
8743 {
8746 /* Only tm_callable and tm_safe apply to classes. */
8749 /* FALLTHRU */
8753 {
8756 ;
8759 else
8761 }
8765 {
8768 {
8773 }
8774 }
8775 /* FALLTHRU */
8778 /* If a function is next, pass it on to be tried next. */
8782 ignored:
8785 }
8788 }
8790 /* Handle the TM_WRAP attribute; arguments as in
8791 struct attribute_spec.handler. */
8793 static tree
8796 {
8799 /* We don't need the attribute even on success, since we
8800 record the entry in an external table. */
8805 else
8806 {
8809 ;
8814 else
8815 {
8819 {
8823 else
8825 }
8826 else
8828 }
8829 }
8832 }
8834 /* Ignore the given attribute. Used when this attribute may be usefully
8835 overridden by the target, but is not used generically. */
8837 static tree
8841 {
8844 }
8846 /* Handle a "no vops" attribute; arguments as in
8847 struct attribute_spec.handler. */
8849 static tree
8853 {
8857 }
8859 /* Handle a "deprecated" attribute; arguments as in
8860 struct attribute_spec.handler. */
8862 static tree
8866 {
8874 {
8877 }
8880 {
8891 else
8893 }
8895 {
8900 }
8901 else
8905 {
8908 {
8914 }
8917 else
8919 }
8922 }
8924 /* Handle a "vector_size" attribute; arguments as in
8925 struct attribute_spec.handler. */
8927 static tree
8931 {
8933 machine_mode orig_mode;
8944 {
8947 }
8949 /* Get the vector size (in bytes). */
8952 /* We need to provide for vector pointers, vector arrays, and
8953 functions returning vectors. For example:
8955 __attribute__((vector_size(16))) short *foo;
8957 In this case, the mode is SI, but the type being modified is
8958 HI, so we need to look further. */
8967 /* Get the mode of the type being modified. */
8978 {
8981 }
8984 {
8987 }
8990 {
8993 }
8995 /* Calculate how many units fit in the vector. */
8998 {
9001 }
9005 /* Build back pointers if needed. */
9009 }
9011 /* Handle the "nonnull" attribute. */
9012 static tree
9016 {
9020 /* If no arguments are specified, all pointer arguments should be
9021 non-null. Verify a full prototype is given so that the arguments
9022 will have the correct types when we actually check them later. */
9024 {
9026 {
9029 }
9031 }
9033 /* Argument list specified. Verify that each argument number references
9034 a pointer argument. */
9036 {
9045 {
9050 }
9053 {
9054 function_args_iterator iter;
9055 tree argument;
9059 {
9063 }
9067 {
9072 }
9075 {
9080 }
9081 }
9082 }
9085 }
9087 /* Check the argument list of a function call for null in argument slots
9088 that are marked as requiring a non-null pointer argument. The NARGS
9089 arguments are passed in the array ARGARRAY.
9090 */
9092 static void
9094 {
9095 tree a;
9103 /* See if any of the nonnull attributes has no arguments. If so,
9104 then every pointer argument is checked (in which case the check
9105 for pointer type is done in check_nonnull_arg). */
9107 do
9115 else
9116 {
9117 /* Walk the argument list. If we encounter an argument number we
9118 should check for non-null, do it. */
9120 {
9122 {
9126 }
9131 }
9132 }
9133 }
9135 /* Check that the Nth argument of a function call (counting backwards
9136 from the end) is a (pointer)0. The NARGS arguments are passed in the
9137 array ARGARRAY. */
9139 static void
9141 {
9145 {
9148 tree sentinel;
9149 function_args_iterator iter;
9150 tree t;
9152 /* Skip over the named arguments. */
9154 {
9157 len++;
9158 }
9161 {
9164 }
9166 /* The sentinel must be one of the varargs, i.e.
9167 in position >= the number of fixed arguments. */
9169 {
9173 }
9175 /* Validate the sentinel. */
9179 /* Although __null (in C++) is only an integer we allow it
9180 nevertheless, as we are guaranteed that it's exactly
9181 as wide as a pointer, and we don't want to force
9182 users to cast the NULL they have written there.
9183 We warn with -Wstrict-null-sentinel, though. */
9186 }
9187 }
9189 /* Helper for check_function_nonnull; given a list of operands which
9190 must be non-null in ARGS, determine if operand PARAM_NUM should be
9191 checked. */
9193 static bool
9195 {
9199 {
9206 }
9208 }
9210 /* Check that the function argument PARAM (which is operand number
9211 PARAM_NUM) is non-null. This is called by check_function_nonnull
9212 via check_function_arguments_recurse. */
9214 static void
9217 {
9218 /* Just skip checking the argument if it's not a pointer. This can
9219 happen if the "nonnull" attribute was given without an operand
9220 list (which means to check every pointer argument). */
9228 }
9230 /* Helper for nonnull attribute handling; fetch the operand number
9231 from the attribute argument list. */
9233 static bool
9235 {
9236 /* Verify the arg number is a small constant. */
9238 {
9241 }
9242 else
9244 }
9246 /* Handle a "nothrow" attribute; arguments as in
9247 struct attribute_spec.handler. */
9249 static tree
9252 {
9255 /* ??? TODO: Support types. */
9256 else
9257 {
9260 }
9263 }
9265 /* Handle a "cleanup" attribute; arguments as in
9266 struct attribute_spec.handler. */
9268 static tree
9271 {
9275 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9276 for global destructors in C++. This requires infrastructure that
9277 we don't have generically at the moment. It's also not a feature
9278 we'd be missing too much, since we do have attribute constructor. */
9280 {
9284 }
9286 /* Verify that the argument is a function in scope. */
9287 /* ??? We could support pointers to functions here as well, if
9288 that was considered desirable. */
9291 {
9295 }
9298 {
9302 }
9304 /* That the function has proper type is checked with the
9305 eventual call to build_function_call. */
9308 }
9310 /* Handle a "warn_unused_result" attribute. No special handling. */
9312 static tree
9316 {
9317 /* Ignore the attribute for functions not returning any value. */
9319 {
9322 }
9325 }
9327 /* Handle a "sentinel" attribute. */
9329 static tree
9332 {
9334 {
9338 }
9339 else
9340 {
9342 {
9346 }
9347 }
9350 {
9358 {
9362 }
9363 else
9364 {
9366 {
9370 }
9371 }
9372 }
9375 }
9377 /* Handle a "type_generic" attribute. */
9379 static tree
9383 {
9384 /* Ensure we have a function type. */
9387 /* Ensure we have a variadic function. */
9391 }
9393 /* Handle a "target" attribute. */
9395 static tree
9398 {
9399 /* Ensure we have a function type. */
9401 {
9404 }
9406 flags))
9410 }
9412 /* Arguments being collected for optimization. */
9417 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9418 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9419 false for #pragma GCC optimize. */
9421 bool
9423 {
9431 tree ap;
9433 /* Build up argv vector. Just in case the string is stored away, use garbage
9434 collected strings. */
9439 {
9443 {
9447 }
9450 {
9451 /* Split string into multiple substrings. */
9459 {
9466 {
9470 }
9471 else
9472 {
9475 }
9479 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9480 options. */
9482 {
9487 else
9491 }
9494 {
9497 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9498 itself is -Os, and any other switch begins with a -f. */
9504 }
9509 }
9511 }
9512 }
9522 /* Now parse the options. */
9532 /* Don't allow changing -fstrict-aliasing. */
9537 }
9539 /* For handling "optimize" attribute. arguments as in
9540 struct attribute_spec.handler. */
9542 static tree
9545 {
9546 /* Ensure we have a function type. */
9548 {
9551 }
9552 else
9553 {
9557 /* Save current options. */
9560 /* If we previously had some optimization options, use them as the
9561 default. */
9566 /* Parse options, and update the vector. */
9571 /* Restore current options. */
9573 }
9576 }
9578 /* Handle a "no_split_stack" attribute. */
9580 static tree
9585 {
9589 {
9593 }
9595 {
9599 }
9602 }
9604 /* Handle a "returns_nonnull" attribute; arguments as in
9605 struct attribute_spec.handler. */
9607 static tree
9610 {
9611 // Even without a prototype we still have a return type we can check.
9613 {
9616 }
9618 }
9620 /* Handle a "designated_init" attribute; arguments as in
9621 struct attribute_spec.handler. */
9623 static tree
9626 {
9628 {
9631 }
9633 }
9635 \f
9636 /* Check for valid arguments being passed to a function with FNTYPE.
9637 There are NARGS arguments in the array ARGARRAY. */
9638 void
9640 {
9641 /* Check for null being passed in a pointer argument that must be
9642 non-null. We also need to do this if format checking is enabled. */
9647 /* Check for errors in format strings. */
9654 }
9656 /* Generic argument checking recursion routine. PARAM is the argument to
9657 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9658 once the argument is resolved. CTX is context for the callback. */
9659 void
9664 {
9668 {
9669 /* Strip coercion. */
9673 }
9676 {
9678 tree attrs;
9681 /* See if this is a call to a known internationalization function
9682 that modifies a format arg. Such a function may have multiple
9683 format_arg attributes (for example, ngettext). */
9686 attrs;
9689 {
9690 tree inner_arg;
9691 tree format_num_expr;
9694 call_expr_arg_iterator iter;
9696 /* Extract the argument number, which was previously checked
9697 to be valid. */
9706 {
9711 }
9712 }
9714 /* If we found a format_arg attribute and did a recursive check,
9715 we are done with checking this argument. Otherwise, we continue
9716 and this will be considered a non-literal. */
9719 }
9722 {
9723 /* Check both halves of the conditional expression. */
9729 }
9732 }
9734 /* Checks for a builtin function FNDECL that the number of arguments
9735 NARGS against the required number REQUIRED and issues an error if
9736 there is a mismatch. Returns true if the number of arguments is
9737 correct, otherwise false. */
9739 static bool
9741 {
9743 {
9747 }
9749 {
9753 }
9755 }
9757 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9758 Returns false if there was an error, otherwise true. */
9760 bool
9762 {
9768 {
9778 {
9780 {
9784 }
9786 }
9796 {
9803 {
9807 }
9809 }
9814 {
9819 {
9823 }
9826 {
9828 fndecl);
9830 }
9832 }
9837 {
9839 {
9842 }
9844 }
9851 {
9855 {
9859 }
9862 {
9866 }
9868 }
9873 }
9874 }
9876 /* Function to help qsort sort FIELD_DECLs by name order. */
9878 int
9880 {
9885 /* A nontype is "greater" than a type. */
9894 }
9897 gt_pointer_operator new_value;
9901 /* This routine compares two fields like field_decl_cmp but using the
9902 pointer operator in resort_data. */
9904 static int
9906 {
9911 /* A nontype is "greater" than a type. */
9917 {
9924 }
9926 }
9928 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9930 void
9933 gt_pointer_operator new_value,
9935 {
9940 resort_field_decl_cmp);
9941 }
9943 /* Subroutine of c_parse_error.
9944 Return the result of concatenating LHS and RHS. RHS is really
9945 a string literal, its first character is indicated by RHS_START and
9946 RHS_SIZE is its length (including the terminating NUL character).
9948 The caller is responsible for deleting the returned pointer. */
9952 {
9958 }
9960 /* Issue the error given by GMSGID, indicating that it occurred before
9961 TOKEN, which had the associated VALUE. */
9963 void
9966 {
9967 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9977 {
9982 {
9995 }
9999 else
10005 }
10027 {
10032 }
10040 {
10045 }
10046 else
10050 {
10053 }
10054 #undef catenate_messages
10055 }
10057 /* Return the gcc option code associated with the reason for a cpp
10058 message, or 0 if none. */
10060 static int
10062 {
10066 {
10069 }
10071 }
10073 /* Callback from cpp_error for PFILE to print diagnostics from the
10074 preprocessor. The diagnostic is of type LEVEL, with REASON set
10075 to the reason code if LEVEL is represents a warning, at location
10076 LOCATION unless this is after lexing and the compiler's location
10077 should be used instead, with column number possibly overridden by
10078 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
10079 the arguments. Returns true if a diagnostic was emitted, false
10080 otherwise. */
10082 bool
10086 {
10087 diagnostic_info diagnostic;
10088 diagnostic_t dlevel;
10093 {
10098 /* Fall through. */
10123 }
10136 }
10138 /* Convert a character from the host to the target execution character
10139 set. cpplib handles this, mostly. */
10141 HOST_WIDE_INT
10143 {
10144 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10145 zero-extended under -fno-signed-char. cpplib insists that characters
10146 and character constants are always unsigned. Hence we must convert
10147 back and forth. */
10155 else
10157 }
10159 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10160 references with an INDIRECT_REF of a constant at the bottom; much like the
10161 traditional rendering of offsetof as a macro. Return the folded result. */
10163 tree
10165 {
10169 {
10185 {
10188 }
10198 {
10202 }
10215 /* Check if the offset goes beyond the upper bound of the array. */
10217 {
10223 {
10227 {
10228 tree v;
10235 {
10243 }
10244 /* Don't warn if the array might be considered a poor
10245 man's flexible array member with a very permissive
10246 definition thereof. */
10250 "index %E denotes an offset "
10253 }
10254 }
10255 }
10262 /* Handle static members of volatile structs. */
10269 }
10272 }
10274 /* Likewise, but convert it to the return type of offsetof. */
10276 tree
10278 {
10280 }
10282 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10283 expression, because B will always be true. */
10285 void
10287 {
10290 "the omitted middle operand in ?: will always be %<true%>, "
10292 }
10294 /* Give an error for storing into ARG, which is 'const'. USE indicates
10295 how ARG was being used. */
10297 void
10299 {
10302 /* Using this macro rather than (for example) arrays of messages
10303 ensures that all the format strings are checked at compile
10304 time. */
10305 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10306 : (use == lv_increment ? (I) \
10307 : (use == lv_decrement ? (D) : (AS))))
10309 {
10320 else
10326 }
10332 arg);
10338 arg);
10340 {
10350 arg);
10351 }
10357 arg);
10358 else
10363 arg);
10364 }
10366 /* Print an error message for an invalid lvalue. USE says
10367 how the lvalue is being used and so selects the error message. LOC
10368 is the location for the error. */
10370 void
10372 {
10374 {
10392 }
10393 }
10395 /* Print an error message for an invalid indirection of type TYPE.
10396 ERRSTRING is the name of the operator for the indirection. */
10398 void
10400 {
10402 {
10410 type);
10415 type);
10420 type);
10425 type);
10430 type);
10434 }
10435 }
10436 \f
10437 /* *PTYPE is an incomplete array. Complete it with a domain based on
10438 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10439 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10440 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10442 int
10444 {
10452 {
10454 {
10455 int eltsize
10458 }
10460 {
10464 {
10468 }
10469 else
10470 {
10471 tree curindex;
10482 {
10486 else
10487 {
10489 {
10490 /* Since we treat size types now as ordinary
10491 unsigned types, we need an explicit overflow
10492 check. */
10496 }
10498 size_one_node);
10499 }
10502 }
10504 {
10508 }
10509 }
10510 }
10511 else
10512 {
10513 /* Make an error message unless that happened already. */
10516 }
10517 }
10518 else
10519 {
10523 }
10526 /* Force an indefinite layout factor. */
10529 size_zero_node);
10534 else
10537 /* Using build_distinct_type_copy and modifying things afterward instead
10538 of using build_array_type to create a new type preserves all of the
10539 TYPE_LANG_FLAG_? bits that the front end may have set. */
10547 /* Make sure we have the canonical MAIN_TYPE. */
10550 hashcode);
10553 /* Fix the canonical type. */
10563 else
10568 else
10574 {
10576 /* If we proceed with the array type as it is, we'll eventually
10577 crash in tree_to_[su]hwi(). */
10579 }
10583 }
10585 /* Like c_mark_addressable but don't check register qualifier. */
10586 void
10588 {
10594 }
10597 \f
10598 /* Used to help initialize the builtin-types.def table. When a type of
10599 the correct size doesn't exist, use error_mark_node instead of NULL.
10600 The later results in segfaults even when a decl using the type doesn't
10601 get invoked. */
10603 tree
10605 {
10608 }
10610 /* A helper function for resolve_overloaded_builtin in resolving the
10611 overloaded __sync_ builtins. Returns a positive power of 2 if the
10612 first operand of PARAMS is a pointer to a supported data type.
10613 Returns 0 if an error is encountered. */
10615 static int
10617 {
10618 tree type;
10622 {
10625 }
10629 {
10630 /* Force array-to-pointer decay for C++. */
10634 }
10646 incompatible:
10649 }
10651 /* A helper function for resolve_overloaded_builtin. Adds casts to
10652 PARAMS to make arguments match up with those of FUNCTION. Drops
10653 the variadic arguments at the end. Returns false if some error
10654 was encountered; true on success. */
10656 static bool
10659 {
10660 function_args_iterator iter;
10661 tree ptype;
10665 /* We've declared the implementation functions to use "volatile void *"
10666 as the pointer parameter, so we shouldn't get any complaints from the
10667 call to check_function_arguments what ever type the user used. */
10672 /* For the rest of the values, we need to cast these to FTYPE, so that we
10673 don't get warnings for passing pointer types, etc. */
10676 {
10680 /* XXX void_type_node belies the abstraction. */
10686 {
10689 }
10691 /* Only convert parameters if arg_type is unsigned integer type with
10692 new format sync routines, i.e. don't attempt to convert pointer
10693 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10694 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10695 kinds). */
10697 {
10698 /* Ideally for the first conversion we'd use convert_for_assignment
10699 so that we get warnings for anything that doesn't match the pointer
10700 type. This isn't portable across the C and C++ front ends atm. */
10705 }
10708 }
10710 /* __atomic routines are not variadic. */
10712 {
10715 }
10717 /* The definition of these primitives is variadic, with the remaining
10718 being "an optional list of variables protected by the memory barrier".
10719 No clue what that's supposed to mean, precisely, but we consider all
10720 call-clobbered variables to be protected so we're safe. */
10724 }
10726 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10727 RESULT to make it match the type of the first pointer argument in
10728 PARAMS. */
10730 static tree
10732 {
10737 /* New format doesn't require casting unless the types are the same size. */
10740 else
10742 }
10744 /* This function verifies the PARAMS to generic atomic FUNCTION.
10745 It returns the size if all the parameters are the same size, otherwise
10746 0 is returned if the parameters are invalid. */
10748 static int
10751 {
10756 tree type_0;
10758 /* Determine the parameter makeup. */
10760 {
10776 }
10779 {
10782 }
10784 /* Get type of first parameter, and determine its size. */
10787 {
10788 /* Force array-to-pointer decay for C++. */
10792 }
10794 {
10796 function);
10798 }
10800 /* Types must be compile time constant sizes. */
10802 {
10805 function);
10807 }
10811 /* Zero size objects are not allowed. */
10813 {
10816 function);
10818 }
10820 /* Check each other parameter is a pointer and the same size. */
10822 {
10825 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10829 {
10831 function);
10833 }
10837 {
10839 function);
10841 }
10842 }
10844 /* Check memory model parameters for validity. */
10846 {
10849 {
10852 {
10855 function);
10856 }
10857 }
10858 else
10860 {
10862 function);
10864 }
10865 }
10868 }
10871 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10872 at the beginning of the parameter list PARAMS representing the size of the
10873 objects. This is to match the library ABI requirement. LOC is the location
10874 of the function call.
10875 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10876 returned to allow the external call to be constructed. */
10878 static tree
10881 {
10882 tree size_node;
10884 /* Insert a SIZE_T parameter as the first param. If there isn't
10885 enough space, allocate a new vector and recursively re-build with that. */
10887 {
10890 tree f;
10900 }
10902 /* Add the size parameter and leave as a function call for processing. */
10906 }
10909 /* Return whether atomic operations for naturally aligned N-byte
10910 arguments are supported, whether inline or through libatomic. */
10911 static bool
10913 {
10915 {
10927 }
10928 }
10930 /* This will process an __atomic_exchange function call, determine whether it
10931 needs to be mapped to the _N variation, or turned into a library call.
10932 LOC is the location of the builtin call.
10933 FUNCTION is the DECL that has been invoked;
10934 PARAMS is the argument list for the call. The return value is non-null
10935 TRUE is returned if it is translated into the proper format for a call to the
10936 external library, and NEW_RETURN is set the tree for that function.
10937 FALSE is returned if processing for the _N variation is required, and
10938 NEW_RETURN is set to the the return value the result is copied into. */
10939 static bool
10942 {
10947 /* Size of 0 is an error condition. */
10949 {
10952 }
10954 /* If not a lock-free size, change to the library generic format. */
10956 {
10959 }
10961 /* Otherwise there is a lockfree match, transform the call from:
10962 void fn(T* mem, T* desired, T* return, model)
10963 into
10964 *return = (T) (fn (In* mem, (In) *desired, model)) */
10971 /* Create pointer to appropriate size. */
10975 /* Convert object pointer to required type. */
10978 /* Convert new value to required type, and dereference it. */
10983 /* Move memory model to the 3rd position, and end param list. */
10987 /* Convert return pointer and dereference it for later assignment. */
10991 }
10994 /* This will process an __atomic_compare_exchange function call, determine
10995 whether it needs to be mapped to the _N variation, or turned into a lib call.
10996 LOC is the location of the builtin call.
10997 FUNCTION is the DECL that has been invoked;
10998 PARAMS is the argument list for the call. The return value is non-null
10999 TRUE is returned if it is translated into the proper format for a call to the
11000 external library, and NEW_RETURN is set the tree for that function.
11001 FALSE is returned if processing for the _N variation is required. */
11003 static bool
11007 {
11012 /* Size of 0 is an error condition. */
11014 {
11017 }
11019 /* If not a lock-free size, change to the library generic format. */
11021 {
11022 /* The library generic format does not have the weak parameter, so
11023 remove it from the param list. Since a parameter has been removed,
11024 we can be sure that there is room for the SIZE_T parameter, meaning
11025 there will not be a recursive rebuilding of the parameter list, so
11026 there is no danger this will be done twice. */
11028 {
11032 }
11035 }
11037 /* Otherwise, there is a match, so the call needs to be transformed from:
11038 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11039 into
11040 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11046 /* Create pointer to appropriate size. */
11050 /* Convert object pointer to required type. */
11054 /* Convert expected pointer to required type. */
11058 /* Convert desired value to required type, and dereference it. */
11063 /* The rest of the parameters are fine. NULL means no special return value
11064 processing.*/
11067 }
11070 /* This will process an __atomic_load function call, determine whether it
11071 needs to be mapped to the _N variation, or turned into a library call.
11072 LOC is the location of the builtin call.
11073 FUNCTION is the DECL that has been invoked;
11074 PARAMS is the argument list for the call. The return value is non-null
11075 TRUE is returned if it is translated into the proper format for a call to the
11076 external library, and NEW_RETURN is set the tree for that function.
11077 FALSE is returned if processing for the _N variation is required, and
11078 NEW_RETURN is set to the the return value the result is copied into. */
11080 static bool
11083 {
11088 /* Size of 0 is an error condition. */
11090 {
11093 }
11095 /* If not a lock-free size, change to the library generic format. */
11097 {
11100 }
11102 /* Otherwise, there is a match, so the call needs to be transformed from:
11103 void fn(T* mem, T* return, model)
11104 into
11105 *return = (T) (fn ((In *) mem, model)) */
11111 /* Create pointer to appropriate size. */
11115 /* Convert object pointer to required type. */
11119 /* Move memory model to the 2nd position, and end param list. */
11123 /* Convert return pointer and dereference it for later assignment. */
11127 }
11130 /* This will process an __atomic_store function call, determine whether it
11131 needs to be mapped to the _N variation, or turned into a library call.
11132 LOC is the location of the builtin call.
11133 FUNCTION is the DECL that has been invoked;
11134 PARAMS is the argument list for the call. The return value is non-null
11135 TRUE is returned if it is translated into the proper format for a call to the
11136 external library, and NEW_RETURN is set the tree for that function.
11137 FALSE is returned if processing for the _N variation is required, and
11138 NEW_RETURN is set to the the return value the result is copied into. */
11140 static bool
11143 {
11148 /* Size of 0 is an error condition. */
11150 {
11153 }
11155 /* If not a lock-free size, change to the library generic format. */
11157 {
11160 }
11162 /* Otherwise, there is a match, so the call needs to be transformed from:
11163 void fn(T* mem, T* value, model)
11164 into
11165 fn ((In *) mem, (In) *value, model) */
11170 /* Create pointer to appropriate size. */
11174 /* Convert object pointer to required type. */
11178 /* Convert new value to required type, and dereference it. */
11183 /* The memory model is in the right spot already. Return is void. */
11187 }
11190 /* Some builtin functions are placeholders for other expressions. This
11191 function should be called immediately after parsing the call expression
11192 before surrounding code has committed to the type of the expression.
11194 LOC is the location of the builtin call.
11196 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11197 PARAMS is the argument list for the call. The return value is non-null
11198 when expansion is complete, and null if normal processing should
11199 continue. */
11201 tree
11204 {
11210 {
11216 else
11220 }
11222 /* Handle BUILT_IN_NORMAL here. */
11224 {
11229 {
11230 /* Handle these 4 together so that they can fall through to the next
11231 case if the call is transformed to an _N variant. */
11233 {
11235 {
11239 /* Change to the _N variant. */
11242 }
11245 {
11247 params,
11250 /* Change to the _N variant. */
11253 }
11255 {
11259 /* Change to the _N variant. */
11262 }
11264 {
11268 /* Change to the _N variant. */
11271 }
11274 }
11275 /* Fallthrough to the normal processing. */
11276 }
11293 {
11295 /* Fallthru for parameter processing. */
11296 }
11313 {
11324 orig_format))
11329 NULL);
11337 /* If new_return is set, assign function to that expr and cast the
11338 result to void since the generic interface returned void. */
11340 {
11341 /* Cast function result from I{1,2,4,8,16} to the required type. */
11344 result);
11348 }
11350 }
11354 }
11355 }
11357 /* vector_types_compatible_elements_p is used in type checks of vectors
11358 values used as operands of binary operators. Where it returns true, and
11359 the other checks of the caller succeed (being vector types in he first
11360 place, and matching number of elements), we can just treat the types
11361 as essentially the same.
11362 Contrast with vector_targets_convertible_p, which is used for vector
11363 pointer types, and vector_types_convertible_p, which will allow
11364 language-specific matches under the control of flag_lax_vector_conversions,
11365 and might still require a conversion. */
11366 /* True if vector types T1 and T2 can be inputs to the same binary
11367 operator without conversion.
11368 We don't check the overall vector size here because some of our callers
11369 want to give different error messages when the vectors are compatible
11370 except for the element count. */
11372 bool
11374 {
11387 /* Equality works here because c_common_signed_type uses
11388 TYPE_MAIN_VARIANT. */
11396 }
11398 /* Check for missing format attributes on function pointers. LTYPE is
11399 the new type or left-hand side type. RTYPE is the old type or
11400 right-hand side type. Returns TRUE if LTYPE is missing the desired
11401 attribute. */
11403 bool
11405 {
11407 tree ra;
11413 {
11414 tree la;
11419 }
11420 else
11422 }
11424 /* Subscripting with type char is likely to lose on a machine where
11425 chars are signed. So warn on any machine, but optionally. Don't
11426 warn for unsigned char since that type is safe. Don't warn for
11427 signed char because anyone who uses that must have done so
11428 deliberately. Furthermore, we reduce the false positive load by
11429 warning only for non-constant value of type char. */
11431 void
11433 {
11438 }
11440 /* Implement -Wparentheses for the unexpected C precedence rules, to
11441 cover cases like x + y << z which readers are likely to
11442 misinterpret. We have seen an expression in which CODE is a binary
11443 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11444 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11445 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11446 expression was not formed using a binary or unary operator, or it
11447 was enclosed in parentheses. */
11449 void
11453 {
11457 /* This macro tests that the expression ARG with original tree code
11458 CODE appears to be a boolean expression. or the result of folding a
11459 boolean expression. */
11460 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11461 (truth_value_p (TREE_CODE (ARG)) \
11462 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11464 || ((CODE) != INTEGER_CST \
11465 && (integer_onep (ARG) || integer_zerop (ARG))))
11468 {
11517 /* Check cases like x|y==z */
11524 /* Check cases like !x | y */
11528 "suggest parentheses around operand of "
11541 /* Check cases like x^y==z */
11563 /* Check cases like x&y==z */
11570 /* Check cases like !x & y */
11574 "suggest parentheses around operand of "
11597 {
11602 "comparisons like %<X<=Y<=Z%> do not "
11608 "comparisons like %<X<=Y<=Z%> do not "
11610 }
11612 }
11613 #undef NOT_A_BOOLEAN_EXPR_P
11614 }
11616 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11618 void
11620 {
11622 {
11625 else
11627 }
11628 }
11630 /* Warn for division by zero according to the value of DIVISOR. LOC
11631 is the location of the division operator. */
11633 void
11635 {
11636 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11637 about division by zero. Do not issue a warning if DIVISOR has a
11638 floating-point type, since we consider 0.0/0.0 a valid way of
11639 generating a NaN. */
11643 }
11645 /* Subroutine of build_binary_op. Give warnings for comparisons
11646 between signed and unsigned quantities that may fail. Do the
11647 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11648 so that casts will be considered, but default promotions won't
11649 be.
11651 LOCATION is the location of the comparison operator.
11653 The arguments of this function map directly to local variables
11654 of build_binary_op. */
11656 void
11661 {
11666 /* In C++, check for comparison of different enum types. */
11672 {
11676 }
11678 /* Do not warn if the comparison is being done in a signed type,
11679 since the signed type will only be chosen if it can represent
11680 all the values of the unsigned type. */
11683 /* Do not warn if both operands are unsigned. */
11686 else
11687 {
11693 else
11701 /* Do not warn if the signed quantity is an unsuffixed integer
11702 literal (or some static constant expression involving such
11703 literals or a conditional expression involving such literals)
11704 and it is non-negative. */
11707 /* Do not warn if the comparison is an equality operation, the
11708 unsigned quantity is an integral constant, and it would fit
11709 in the result if the result were signed. */
11714 /* In C, do not warn if the unsigned quantity is an enumeration
11715 constant and its maximum value would fit in the result if the
11716 result were signed. */
11722 else
11724 OPT_Wsign_compare,
11726 }
11728 /* Warn if two unsigned values are being compared in a size larger
11729 than their original size, and one (and only one) is the result of
11730 a `~' operator. This comparison will always fail.
11732 Also warn if one operand is a constant, and the constant does not
11733 have all bits set that are set in the ~ operand when it is
11734 extended. */
11741 {
11748 {
11749 tree primop;
11755 {
11759 }
11760 else
11761 {
11765 }
11770 {
11773 {
11777 else
11780 }
11781 }
11782 }
11790 }
11791 }
11793 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11794 type via c_common_type. If -Wdouble-promotion is in use, and the
11795 conditions for warning have been met, issue a warning. GMSGID is
11796 the warning message. It must have two %T specifiers for the type
11797 that was converted (generally "float") and the type to which it was
11798 converted (generally "double), respectively. LOC is the location
11799 to which the awrning should refer. */
11801 void
11804 {
11805 tree source_type;
11809 /* If the conversion will not occur at run-time, there is no need to
11810 warn about it. */
11822 else
11825 }
11827 /* Setup a TYPE_DECL node as a typedef representation.
11829 X is a TYPE_DECL for a typedef statement. Create a brand new
11830 ..._TYPE node (which will be just a variant of the existing
11831 ..._TYPE node with identical properties) and then install X
11832 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11834 The whole point here is to end up with a situation where each
11835 and every ..._TYPE node the compiler creates will be uniquely
11836 associated with AT MOST one node representing a typedef name.
11837 This way, even though the compiler substitutes corresponding
11838 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11839 early on, later parts of the compiler can always do the reverse
11840 translation and get back the corresponding typedef name. For
11841 example, given:
11843 typedef struct S MY_TYPE;
11844 MY_TYPE object;
11846 Later parts of the compiler might only know that `object' was of
11847 type `struct S' if it were not for code just below. With this
11848 code however, later parts of the compiler see something like:
11850 struct S' == struct S
11851 typedef struct S' MY_TYPE;
11852 struct S' object;
11854 And they can then deduce (from the node for type struct S') that
11855 the original object declaration was:
11857 MY_TYPE object;
11859 Being able to do this is important for proper support of protoize,
11860 and also for generating precise symbolic debugging information
11861 which takes full account of the programmer's (typedef) vocabulary.
11863 Obviously, we don't want to generate a duplicate ..._TYPE node if
11864 the TYPE_DECL node that we are now processing really represents a
11865 standard built-in type. */
11867 void
11869 {
11873 {
11876 }
11879 {
11887 }
11888 }
11890 /* Record the types used by the current global variable declaration
11891 being parsed, so that we can decide later to emit their debug info.
11892 Those types are in types_used_by_cur_var_decl, and we are going to
11893 store them in the types_used_by_vars_hash hash table.
11894 DECL is the declaration of the global variable that has been parsed. */
11896 void
11898 {
11902 {
11905 }
11906 }
11908 /* If DECL is a typedef that is declared in the current function,
11909 record it for the purpose of -Wunused-local-typedefs. */
11911 void
11913 {
11918 /* if this is not a locally defined typedef then we are not
11919 interested. */
11926 }
11928 /* If T is a TYPE_DECL declared locally, mark it as used. */
11930 void
11932 {
11937 }
11939 /* Warn if there are some unused locally defined typedefs in the
11940 current function. */
11942 void
11944 {
11946 tree decl;
11947 /* The number of times we have emitted -Wunused-local-typedefs
11948 warnings. If this is different from errorcount, that means some
11949 unrelated errors have been issued. In which case, we'll avoid
11950 emitting "unused-local-typedefs" warnings. */
11962 {
11966 OPT_Wunused_local_typedefs,
11969 }
11972 }
11974 /* Warn about boolean expression compared with an integer value different
11975 from true/false. Warns also e.g. about "(i1 == i2) == 2".
11976 LOC is the location of the comparison, CODE is its code, OP0 and OP1
11977 are the operands of the comparison. The caller must ensure that
11978 either operand is a boolean expression. */
11980 void
11982 tree op1)
11983 {
11993 {
12001 else
12004 }
12005 }
12007 /* The C and C++ parsers both use vectors to hold function arguments.
12008 For efficiency, we keep a cache of unused vectors. This is the
12009 cache. */
12014 /* Return a new vector from the cache. If the cache is empty,
12015 allocate a new vector. These vectors are GC'ed, so it is OK if the
12016 pointer is not released.. */
12020 {
12023 else
12024 {
12025 /* Passing 0 to vec::alloc returns NULL, and our callers require
12026 that we always return a non-NULL value. The vector code uses
12027 4 when growing a NULL vector, so we do too. */
12031 }
12032 }
12034 /* Release a vector of trees back to the cache. */
12036 void
12038 {
12040 {
12043 }
12044 }
12046 /* Get a new tree vector holding a single tree. */
12050 {
12054 }
12056 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12060 {
12065 }
12067 /* Get a new tree vector which is a copy of an existing one. */
12071 {
12074 tree t;
12081 }
12083 /* Return true if KEYWORD starts a type specifier. */
12085 bool
12087 {
12089 {
12123 }
12124 }
12126 /* Return true if KEYWORD names a type qualifier. */
12128 bool
12130 {
12132 {
12140 }
12141 }
12143 /* Return true if KEYWORD names a storage class specifier.
12145 RID_TYPEDEF is not included in this list despite `typedef' being
12146 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12147 such for syntactic convenience only. */
12149 bool
12151 {
12153 {
12163 }
12164 }
12166 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12168 static bool
12170 {
12172 {
12180 }
12181 }
12183 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12184 declaration-specifier (C99 6.7). */
12186 bool
12188 {
12195 {
12202 }
12203 }
12205 /* Initialize language-specific-bits of tree_contains_struct. */
12207 void
12209 {
12215 }
12217 /* Build a user-defined numeric literal out of an integer constant type VALUE
12218 with identifier SUFFIX. */
12220 tree
12223 {
12230 }
12232 /* For vector[index], convert the vector to a
12233 pointer of the underlying type. Return true if the resulting
12234 ARRAY_REF should not be an lvalue. */
12236 bool
12239 {
12242 {
12244 tree type1;
12253 {
12258 {
12261 *vecp
12264 non_const);
12265 }
12266 else
12271 }
12272 else
12279 {
12280 /* If the original vector isn't declared may_alias and it
12281 isn't a bare vector look if the subscripting would
12282 alias the vector we subscript, and if not, force ref-all. */
12288 }
12292 }
12294 }
12296 /* Determine which of the operands, if any, is a scalar that needs to be
12297 converted to a vector, for the range of operations. */
12298 enum stv_conv
12301 {
12310 {
12311 /* Most GENERIC binary expressions require homogeneous arguments.
12312 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12313 argument that is a vector and a second one that is a scalar, so
12314 we never return stv_secondarg for them. */
12319 {
12321 {
12326 }
12327 else
12329 }
12336 /* ... fall through ... */
12357 /* What about UNLT_EXPR? */
12359 {
12360 tree tmp;
12362 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
12365 }
12369 {
12371 {
12376 }
12378 }
12380 /* Allow integer --> real conversion if safe. */
12384 {
12386 {
12391 }
12393 }
12396 }
12399 }
12401 /* Return true iff ALIGN is an integral constant that is a fundamental
12402 alignment, as defined by [basic.align] in the c++-11
12403 specifications.
12405 That is:
12407 [A fundamental alignment is represented by an alignment less than or
12408 equal to the greatest alignment supported by the implementation
12409 in all contexts, which is equal to
12410 alignof(max_align_t)]. */
12412 bool
12414 {
12417 }
12419 /* Return true if T is a pointer to a zero-sized aggregate. */
12421 bool
12423 {
12428 }