| blob | 030ee5a643d365cb3fb4a9be76f81122e132a0a9 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 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/>. */
48 /* The following symbols are subsumed in the c_global_trees array, and
49 listed here individually for documentation purposes.
51 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
53 tree short_integer_type_node;
54 tree long_integer_type_node;
55 tree long_long_integer_type_node;
56 tree int128_integer_type_node;
58 tree short_unsigned_type_node;
59 tree long_unsigned_type_node;
60 tree long_long_unsigned_type_node;
61 tree int128_unsigned_type_node;
63 tree truthvalue_type_node;
64 tree truthvalue_false_node;
65 tree truthvalue_true_node;
67 tree ptrdiff_type_node;
69 tree unsigned_char_type_node;
70 tree signed_char_type_node;
71 tree wchar_type_node;
73 tree char16_type_node;
74 tree char32_type_node;
76 tree float_type_node;
77 tree double_type_node;
78 tree long_double_type_node;
80 tree complex_integer_type_node;
81 tree complex_float_type_node;
82 tree complex_double_type_node;
83 tree complex_long_double_type_node;
85 tree dfloat32_type_node;
86 tree dfloat64_type_node;
87 tree_dfloat128_type_node;
89 tree intQI_type_node;
90 tree intHI_type_node;
91 tree intSI_type_node;
92 tree intDI_type_node;
93 tree intTI_type_node;
95 tree unsigned_intQI_type_node;
96 tree unsigned_intHI_type_node;
97 tree unsigned_intSI_type_node;
98 tree unsigned_intDI_type_node;
99 tree unsigned_intTI_type_node;
101 tree widest_integer_literal_type_node;
102 tree widest_unsigned_literal_type_node;
104 Nodes for types `void *' and `const void *'.
106 tree ptr_type_node, const_ptr_type_node;
108 Nodes for types `char *' and `const char *'.
110 tree string_type_node, const_string_type_node;
112 Type `char[SOMENUMBER]'.
113 Used when an array of char is needed and the size is irrelevant.
115 tree char_array_type_node;
117 Type `int[SOMENUMBER]' or something like it.
118 Used when an array of int needed and the size is irrelevant.
120 tree int_array_type_node;
122 Type `wchar_t[SOMENUMBER]' or something like it.
123 Used when a wide string literal is created.
125 tree wchar_array_type_node;
127 Type `char16_t[SOMENUMBER]' or something like it.
128 Used when a UTF-16 string literal is created.
130 tree char16_array_type_node;
132 Type `char32_t[SOMENUMBER]' or something like it.
133 Used when a UTF-32 string literal is created.
135 tree char32_array_type_node;
137 Type `int ()' -- used for implicit declaration of functions.
139 tree default_function_type;
141 A VOID_TYPE node, packaged in a TREE_LIST.
143 tree void_list_node;
145 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
146 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
147 VAR_DECLS, but C++ does.)
149 tree function_name_decl_node;
150 tree pretty_function_name_decl_node;
151 tree c99_function_name_decl_node;
153 Stack of nested function name VAR_DECLs.
155 tree saved_function_name_decls;
157 */
160 \f
161 /* Switches common to the C front ends. */
163 /* Nonzero means don't output line number information. */
167 /* Nonzero causes -E output not to be done, but directives such as
168 #define that have side effects are still obeyed. */
172 /* Nonzero means dump macros in some fashion. */
176 /* Nonzero means pass #include lines through to the output. */
180 /* Nonzero means process PCH files while preprocessing. */
184 /* The file name to which we should write a precompiled header, or
185 NULL if no header will be written in this compile. */
189 /* Nonzero if an ISO standard was selected. It rejects macros in the
190 user's namespace. */
193 /* C/ObjC language option variables. */
196 /* Nonzero means allow type mismatches in conditional expressions;
197 just make their values `void'. */
201 /* Nonzero means enable C89 Amendment 1 features. */
205 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
209 /* Nonzero means use the ISO C11 dialect of C. */
213 /* Nonzero means that we have builtin functions, and main is an int. */
218 /* ObjC language option variables. */
221 /* Tells the compiler that this is a special run. Do not perform any
222 compiling, instead we are to test some platform dependent features
223 and output a C header file with appropriate definitions. */
227 /* Tells the compiler what is the constant string class for ObjC. */
232 /* C++ language option variables. */
235 /* Nonzero means generate separate instantiation control files and
236 juggle them at link time. */
240 /* The C++ dialect being used. C++98 is the default. */
244 /* Maximum template instantiation depth. This limit exists to limit the
245 time it takes to notice excessively recursive template instantiations.
247 The default is lower than the 1024 recommended by the C++0x standard
248 because G++ runs out of stack before 1024 with highly recursive template
249 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
253 /* The elements of `ridpointers' are identifier nodes for the reserved
254 type names and storage classes. It is indexed by a RID_... value. */
259 /* Nonzero means don't warn about problems that occur when the code is
260 executed. */
263 /* Whether we are building a boolean conversion inside
264 convert_for_assignment, or some other late binary operation. If
265 build_binary_op is called for C (from code shared by C and C++) in
266 this case, then the operands have already been folded and the
267 result will not be folded again, so C_MAYBE_CONST_EXPR should not
268 be generated. */
271 /* Whether lexing has been completed, so subsequent preprocessor
272 errors should use the compiler's input_location. */
275 /* Information about how a function name is generated. */
276 struct fname_var_t
277 {
281 };
283 /* The three ways of getting then name of the current function. */
286 {
287 /* C99 compliant __func__, must be first. */
289 /* GCC __FUNCTION__ compliant. */
291 /* GCC __PRETTY_FUNCTION__ compliant. */
294 };
296 /* Global visibility options. */
387 /* Reserved words. The third field is a mask: keywords are disabled
388 if they match the mask.
390 Masks for languages:
391 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
392 C --std=c99: D_CXXONLY | D_OBJC
393 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
394 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
395 C++ --std=c0x: D_CONLY | D_OBJC
396 ObjC++ is like C++ except that D_OBJC is not set
398 If -fno-asm is used, D_ASM is added to the mask. If
399 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
400 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
401 In C with -Wc++-compat, we warn if D_CXXWARN is set.
403 Note the complication of the D_CXX_OBJC keywords. These are
404 reserved words such as 'class'. In C++, 'class' is a reserved
405 word. In Objective-C++ it is too. In Objective-C, it is a
406 reserved word too, but only if it follows an '@' sign.
407 */
409 {
567 /* These Objective-C keywords are recognized only immediately after
568 an '@'. */
585 /* These are recognized only in protocol-qualifier context
586 (see above) */
593 /* These are recognized inside a property attribute list */
602 };
607 /* Table of machine-independent attributes common to all C-like languages. */
609 {
610 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
611 affects_type_identity } */
618 /* FIXME: logically, noreturn attributes should be listed as
619 "false, true, true" and apply to function types. But implementing this
620 would require all the places in the compiler that use TREE_THIS_VOLATILE
621 on a decl to identify non-returning functions to be located and fixed
622 to check the function type instead. */
647 /* The same comments as for noreturn attributes apply to const ones. */
671 handle_no_instrument_function_attribute,
689 /* ??? These two attributes didn't make the transition from the
690 Intel language document to the multi-vendor language document. */
695 /* For internal use (marking of builtins) only. The name contains space
696 to prevent its usage in source code. */
718 /* For internal use (marking of builtins) only. The name contains space
719 to prevent its usage in source code. */
730 handle_no_address_safety_analysis_attribute,
733 handle_no_sanitize_address_attribute,
736 handle_no_sanitize_undefined_attribute,
746 /* For internal use only. The leading '*' both prevents its usage in
747 source code and signals that it may be overridden by machine tables. */
752 /* For internal use (marking of builtins and runtime functions) only.
753 The name contains space to prevent its usage in source code. */
769 };
771 /* Give the specifications for the format attributes, used by C and all
772 descendants. */
775 {
776 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
777 affects_type_identity } */
783 };
785 /* Return identifier for address space AS. */
789 {
793 }
795 /* Push current bindings for the function name VAR_DECLS. */
797 void
799 {
804 {
808 {
810 saved);
812 }
813 }
815 /* Normally they'll have been NULL, so only push if we've got a
816 stack, or they are non-NULL. */
818 saved_function_name_decls);
819 }
821 /* Finish up the current bindings, adding them into the current function's
822 statement tree. This must be done _before_ finish_stmt_tree is called.
823 If there is no current function, we must be at file scope and no statements
824 are involved. Pop the previous bindings. */
826 void
828 {
837 {
845 }
851 {
852 /* We had saved values, restore them. */
853 tree saved;
856 {
861 }
863 }
865 }
867 /* Return the text name of the current function, suitably prettified
868 by PRETTY_P. Return string must be freed by caller. */
872 {
879 {
882 }
895 {
898 }
901 }
903 /* Return the VAR_DECL for a const char array naming the current
904 function. If the VAR_DECL has not yet been created, create it
905 now. RID indicates how it should be formatted and IDENTIFIER_NODE
906 ID is its name (unfortunately C and C++ hold the RID values of
907 keywords in different places, so we can't derive RID from ID in
908 this language independent code. LOC is the location of the
909 function. */
911 tree
913 {
923 {
924 /* If a tree is built here, it would normally have the lineno of
925 the current statement. Later this tree will be moved to the
926 beginning of the function and this line number will be wrong.
927 To avoid this problem set the lineno to 0 here; that prevents
928 it from appearing in the RTL. */
929 tree stmts;
937 saved_function_name_decls
941 }
946 }
948 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
950 tree
952 {
957 /* Compute the number of elements, for the array type. */
959 {
962 }
964 {
967 }
969 {
972 }
973 else
974 {
977 }
979 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
980 limit in C++98 Annex B is very large (65536) and is not normative,
981 so we do not diagnose it (warn_overlength_strings is forced off
982 in c_common_post_options). */
984 {
988 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
989 separate the %d from the 'C'. 'ISO' should not be
990 translated, but it may be moved after 'C%d' in languages
991 where modifiers follow nouns. */
993 "string length %qd is greater than the length %qd "
996 }
998 /* Create the array type for the string constant. The ISO C++
999 standard says that a string literal has type `const char[N]' or
1000 `const wchar_t[N]'. We use the same logic when invoked as a C
1001 front-end with -Wwrite-strings.
1002 ??? We should change the type of an expression depending on the
1003 state of a warning flag. We should just be warning -- see how
1004 this is handled in the C++ front-end for the deprecated implicit
1005 conversion from string literals to `char*' or `wchar_t*'.
1007 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1008 array type being the unqualified version of that type.
1009 Therefore, if we are constructing an array of const char, we must
1010 construct the matching unqualified array type first. The C front
1011 end does not require this, but it does no harm, so we do it
1012 unconditionally. */
1023 }
1024 \f
1025 /* If DISABLE is true, stop issuing warnings. This is used when
1026 parsing code that we know will not be executed. This function may
1027 be called multiple times, and works as a stack. */
1029 static void
1031 {
1033 {
1036 }
1037 }
1039 /* If ENABLE is true, reenable issuing warnings. */
1041 static void
1043 {
1045 {
1048 }
1049 }
1051 /* Fully fold EXPR, an expression that was not folded (beyond integer
1052 constant expressions and null pointer constants) when being built
1053 up. If IN_INIT, this is in a static initializer and certain
1054 changes are made to the folding done. Clear *MAYBE_CONST if
1055 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1056 expression because it contains an evaluated operator (in C99) or an
1057 operator outside of sizeof returning an integer constant (in C90)
1058 not permitted in constant expressions, or because it contains an
1059 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1060 set to true by callers before calling this function.) Return the
1061 folded expression. Function arguments have already been folded
1062 before calling this function, as have the contents of SAVE_EXPR,
1063 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1064 C_MAYBE_CONST_EXPR. */
1066 tree
1068 {
1069 tree ret;
1075 /* This function is not relevant to C++ because C++ folds while
1076 parsing, and may need changes to be correct for C++ when C++
1077 stops folding while parsing. */
1084 {
1087 }
1094 }
1096 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1097 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1098 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1099 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1100 both evaluated and unevaluated subexpressions while
1101 *MAYBE_CONST_ITSELF is carried from only evaluated
1102 subexpressions). */
1104 static tree
1107 {
1119 /* This function is not relevant to C++ because C++ folds while
1120 parsing, and may need changes to be correct for C++ when C++
1121 stops folding while parsing. */
1125 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1126 anything else not counted as an expression cannot usefully be
1127 folded further at this point. */
1133 /* Operands of variable-length expressions (function calls) have
1134 already been folded, as have __builtin_* function calls, and such
1135 expressions cannot occur in constant expressions. */
1137 {
1141 }
1144 {
1153 else
1156 }
1158 /* Assignment, increment, decrement, function call and comma
1159 operators, and statement expressions, cannot occur in constant
1160 expressions if evaluated / outside of sizeof. (Function calls
1161 were handled above, though VA_ARG_EXPR is treated like a function
1162 call here, and statement expressions are handled through
1163 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1165 {
1185 }
1187 /* Fold individual tree codes as appropriate. */
1189 {
1191 /* Any non-constancy will have been marked in a containing
1192 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1200 maybe_const_itself);
1205 {
1208 }
1217 maybe_const_itself);
1220 maybe_const_itself);
1226 {
1230 }
1272 /* Binary operations evaluating both arguments (increment and
1273 decrement are binary internally in GCC). */
1277 maybe_const_itself);
1285 /* The RHS of a MODIFY_EXPR was fully folded when building that
1286 expression for the sake of conversion warnings. */
1289 maybe_const_itself);
1293 ret = in_init
1296 else
1309 {
1320 }
1326 CASE_CONVERT:
1336 /* Unary operations. */
1339 maybe_const_itself);
1343 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1344 not prepared to deal with them if they occur in initializers. */
1352 ret = in_init
1355 else
1360 {
1364 }
1366 {
1369 CASE_CONVERT:
1370 /* Don't warn about explicit conversions. We will already
1371 have warned about suspect implicit conversions. */
1378 }
1383 /* Binary operations not necessarily evaluating both
1384 arguments. */
1391 ? truthvalue_false_node
1399 ret = in_init
1402 else
1407 && op0_const
1408 && op0_const_self
1414 && op0_const_self
1440 else
1445 && op0_const
1446 && op0_const_self
1450 && op0_const_self
1454 && op0_const
1455 && op0_const_self
1459 && op0_const_self
1465 /* Each case where an operand with excess precision may be
1466 encountered must remove the EXCESS_PRECISION_EXPR around
1467 inner operands and possibly put one around the whole
1468 expression or possibly convert to the semantic type (which
1469 c_fully_fold does); we cannot tell at this stage which is
1470 appropriate in any particular case. */
1474 /* Various codes may appear through folding built-in functions
1475 and their arguments. */
1477 }
1479 out:
1480 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1481 have been done by this point, so remove them again. */
1485 {
1489 }
1493 }
1495 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1496 return EXP. Otherwise, return either EXP or its known constant
1497 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1498 Is the BLKmode test appropriate? */
1500 tree
1502 {
1503 tree ret;
1505 /* This function is only used by C, for c_fully_fold and other
1506 optimization, and may not be correct for C++. */
1517 /* Avoid unwanted tree sharing between the initializer and current
1518 function's body where the tree can be modified e.g. by the
1519 gimplifier. */
1523 }
1525 /* Print a warning if a constant expression had overflow in folding.
1526 Invoke this function on every expression that the language
1527 requires to be a constant expression.
1528 Note the ANSI C standard says it is erroneous for a
1529 constant expression to overflow. */
1531 void
1533 {
1541 }
1543 /* The same as above but print an unconditional error. */
1544 void
1546 {
1553 }
1555 /* Print a warning if an expression had overflow in folding and its
1556 operands hadn't.
1558 Invoke this function on every expression that
1559 (1) appears in the source code, and
1560 (2) is a constant expression that overflowed, and
1561 (3) is not already checked by convert_and_check;
1562 however, do not invoke this function on operands of explicit casts
1563 or when the expression is the result of an operator and any operand
1564 already overflowed. */
1566 void
1568 {
1573 {
1602 }
1603 }
1605 /* Warn about uses of logical || / && operator in a context where it
1606 is likely that the bitwise equivalent was intended by the
1607 programmer. We have seen an expression in which CODE is a binary
1608 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1609 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1610 void
1614 {
1626 /* Warn if &&/|| are being used in a context where it is
1627 likely that the bitwise equivalent was intended by the
1628 programmer. That is, an expression such as op && MASK
1629 where op should not be any boolean expression, nor a
1630 constant, and mask seems to be a non-boolean integer constant. */
1638 {
1642 else
1647 }
1649 /* We do not warn for constants because they are typical of macro
1650 expansions that test for features. */
1654 /* This warning only makes sense with logical operands. */
1662 /* We first test whether either side separately is trivially true
1663 (with OR) or trivially false (with AND). If so, do not warn.
1664 This is a common idiom for testing ranges of data types in
1665 portable code. */
1672 /* If this is an OR operation, invert both sides; now, the result
1673 should be always false to get a warning. */
1687 /* If this is an OR operation, invert both sides; now, the result
1688 should be always false to get a warning. */
1696 /* If both expressions have the same operand, if we can merge the
1697 ranges, and if the range test is always false, then warn. */
1704 {
1707 "logical %<or%> "
1709 else
1711 "logical %<and%> "
1713 }
1714 }
1717 /* Warn if EXP contains any computations whose results are not used.
1718 Return true if a warning is printed; false otherwise. LOCUS is the
1719 (potential) location of the expression. */
1721 bool
1723 {
1724 restart:
1728 /* Don't warn about void constructs. This includes casting to void,
1729 void function calls, and statement expressions with a final cast
1730 to void. */
1738 {
1754 /* For a binding, warn if no side effect within it. */
1766 /* In && or ||, warn if 2nd operand has no side effect. */
1773 /* Let people do `(foo (), 0)' without a warning. */
1780 /* If this is an expression with side effects, don't warn; this
1781 case commonly appears in macro expansions. */
1787 /* Don't warn about automatic dereferencing of references, since
1788 the user cannot control it. */
1790 {
1793 }
1794 /* Fall through. */
1797 /* Referencing a volatile value is a side effect, so don't warn. */
1802 /* If this is an expression which has no operands, there is no value
1803 to be unused. There are no such language-independent codes,
1804 but front ends may define such. */
1808 warn:
1810 }
1811 }
1814 /* Print a warning about casts that might indicate violation
1815 of strict aliasing rules if -Wstrict-aliasing is used and
1816 strict aliasing mode is in effect. OTYPE is the original
1817 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1819 bool
1821 {
1822 /* Strip pointer conversion chains and get to the correct original type. */
1830 /* If the type we are casting to is a ref-all pointer
1831 dereferencing it is always valid. */
1838 {
1839 /* Casting the address of an object to non void pointer. Warn
1840 if the cast breaks type based aliasing. */
1842 {
1846 }
1847 else
1848 {
1849 /* warn_strict_aliasing >= 3. This includes the default (3).
1850 Only warn if the cast is dereferenced immediately. */
1851 alias_set_type set1 =
1857 {
1861 }
1864 {
1868 }
1869 }
1870 }
1871 else
1873 {
1874 /* At this level, warn for any conversions, even if an address is
1875 not taken in the same statement. This will likely produce many
1876 false positives, but could be useful to pinpoint problems that
1877 are not revealed at higher levels. */
1882 {
1886 }
1887 }
1890 }
1892 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1893 sizeof as last operand of certain builtins. */
1895 void
1899 {
1903 location_t loc;
1911 {
1915 /* FALLTHRU */
1923 /* FALLTHRU */
1982 }
2010 {
2014 {
2017 "argument to %<sizeof%> in %qD call is the same "
2018 "expression as the destination; did you mean to "
2024 "argument to %<sizeof%> in %qD call is the same "
2025 "expression as the destination; did you mean to "
2027 else
2029 "argument to %<sizeof%> in %qD call is the same "
2030 "expression as the destination; did you mean to "
2033 }
2036 && !strop
2039 {
2041 "argument to %<sizeof%> in %qD call is the same "
2042 "pointer type %qT as the destination; expected %qT "
2046 }
2047 }
2050 {
2054 {
2057 "argument to %<sizeof%> in %qD call is the same "
2058 "expression as the source; did you mean to "
2064 "argument to %<sizeof%> in %qD call is the same "
2065 "expression as the source; did you mean to "
2067 else
2069 "argument to %<sizeof%> in %qD call is the same "
2070 "expression as the source; did you mean to "
2073 }
2076 && !strop
2079 {
2081 "argument to %<sizeof%> in %qD call is the same "
2082 "pointer type %qT as the source; expected %qT "
2086 }
2087 }
2090 {
2094 {
2097 "argument to %<sizeof%> in %qD call is the same "
2098 "expression as the first source; did you mean to "
2104 "argument to %<sizeof%> in %qD call is the same "
2105 "expression as the first source; did you mean to "
2107 else
2109 "argument to %<sizeof%> in %qD call is the same "
2110 "expression as the first source; did you mean to "
2113 }
2116 && !strop
2119 {
2121 "argument to %<sizeof%> in %qD call is the same "
2122 "pointer type %qT as the first source; expected %qT "
2126 }
2127 }
2130 {
2134 {
2137 "argument to %<sizeof%> in %qD call is the same "
2138 "expression as the second source; did you mean to "
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "expression as the second source; did you mean to "
2147 else
2149 "argument to %<sizeof%> in %qD call is the same "
2150 "expression as the second source; did you mean to "
2153 }
2156 && !strop
2159 {
2161 "argument to %<sizeof%> in %qD call is the same "
2162 "pointer type %qT as the second source; expected %qT "
2166 }
2167 }
2169 }
2171 /* Warn for unlikely, improbable, or stupid DECL declarations
2172 of `main'. */
2174 void
2176 {
2177 function_args_iterator iter;
2178 tree type;
2182 {
2183 /* XXX void_type_node belies the abstraction. */
2189 {
2211 "third argument of %q+D should probably be "
2214 }
2215 }
2217 /* It is intentional that this message does not mention the third
2218 argument because it's only mentioned in an appendix of the
2219 standard. */
2223 }
2225 /* vector_targets_convertible_p is used for vector pointer types. The
2226 callers perform various checks that the qualifiers are satisfactory,
2227 while OTOH vector_targets_convertible_p ignores the number of elements
2228 in the vectors. That's fine with vector pointers as we can consider,
2229 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2230 and that does not require and conversion of the pointer values.
2231 In contrast, vector_types_convertible_p and
2232 vector_types_compatible_elements_p are used for vector value types. */
2233 /* True if pointers to distinct types T1 and T2 can be converted to
2234 each other without an explicit cast. Only returns true for opaque
2235 vector types. */
2236 bool
2238 {
2245 }
2247 /* vector_types_convertible_p is used for vector value types.
2248 It could in principle call vector_targets_convertible_p as a subroutine,
2249 but then the check for vector type would be duplicated with its callers,
2250 and also the purpose of vector_targets_convertible_p would become
2251 muddled.
2252 Where vector_types_convertible_p returns true, a conversion might still be
2253 needed to make the types match.
2254 In contrast, vector_targets_convertible_p is used for vector pointer
2255 values, and vector_types_compatible_elements_p is used specifically
2256 in the context for binary operators, as a check if use is possible without
2257 conversion. */
2258 /* True if vector types T1 and T2 can be converted to each other
2259 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2260 can only be converted with -flax-vector-conversions yet that is not
2261 in effect, emit a note telling the user about that option if such
2262 a note has not previously been emitted. */
2263 bool
2265 {
2273 convertible_lax =
2288 {
2291 "conversions between vectors with differing "
2293 }
2296 }
2298 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2299 and have vector types, V0 has the same type as V1, and the number of
2300 elements of V0, V1, MASK is the same.
2302 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2303 called with two arguments. In this case implementation passes the
2304 first argument twice in order to share the same tree code. This fact
2305 could enable the mask-values being twice the vector length. This is
2306 an implementation accident and this semantics is not guaranteed to
2307 the user. */
2308 tree
2311 {
2312 tree ret;
2318 {
2321 }
2329 {
2334 }
2338 {
2342 }
2345 {
2350 }
2356 {
2359 "argument vector(s) and the mask vector should "
2362 }
2366 {
2371 }
2374 {
2375 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2381 else
2382 {
2385 }
2389 }
2399 }
2401 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2402 to integral type. */
2404 static tree
2406 {
2411 {
2412 /* C++0x scoped enumerations don't implicitly convert to integral
2413 type; if we stripped an explicit conversion to a larger type we
2414 need to replace it so common_type will still work. */
2418 }
2420 }
2422 /* This is a helper function of build_binary_op.
2424 For certain operations if both args were extended from the same
2425 smaller type, do the arithmetic in that type and then extend.
2427 BITWISE indicates a bitwise operation.
2428 For them, this optimization is safe only if
2429 both args are zero-extended or both are sign-extended.
2430 Otherwise, we might change the result.
2431 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2432 but calculated in (unsigned short) it would be (unsigned short)-1.
2433 */
2434 tree
2436 {
2440 tree type;
2442 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2443 excessive narrowing when we call get_narrower below. For
2444 example, suppose that OP0 is of unsigned int extended
2445 from signed char and that RESULT_TYPE is long long int.
2446 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2447 like
2449 (long long int) (unsigned int) signed_char
2451 which get_narrower would narrow down to
2453 (unsigned int) signed char
2455 If we do not cast OP0 first, get_narrower would return
2456 signed_char, which is inconsistent with the case of the
2457 explicit cast. */
2464 /* UNS is 1 if the operation to be done is an unsigned one. */
2467 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2468 but it *requires* conversion to FINAL_TYPE. */
2479 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2481 /* For bitwise operations, signedness of nominal type
2482 does not matter. Consider only how operands were extended. */
2486 /* Note that in all three cases below we refrain from optimizing
2487 an unsigned operation on sign-extended args.
2488 That would not be valid. */
2490 /* Both args variable: if both extended in same way
2491 from same width, do it in that width.
2492 Do it unsigned if args were zero-extended. */
2499 return c_common_signed_or_unsigned_type
2506 && (type
2517 && (type
2525 }
2527 /* Checks if expression EXPR of real/integer type cannot be converted
2528 to the real/integer type TYPE. Function returns true when:
2529 * EXPR is a constant which cannot be exactly converted to TYPE
2530 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2531 for EXPR type and TYPE being both integers or both real.
2532 * EXPR is not a constant of real type and TYPE is an integer.
2533 * EXPR is not a constant of integer type which cannot be
2534 exactly converted to real type.
2535 Function allows conversions between types of different signedness and
2536 does not return true in that case. Function can produce signedness
2537 warnings if PRODUCE_WARNS is true. */
2538 bool
2540 {
2546 {
2547 /* Warn for real constant that is not an exact integer converted
2548 to integer type. */
2551 {
2554 }
2555 /* Warn for an integer constant that does not fit into integer type. */
2559 {
2562 {
2566 }
2568 {
2572 }
2573 else
2575 }
2577 {
2578 /* Warn for an integer constant that does not fit into real type. */
2580 {
2584 }
2585 /* Warn for a real constant that does not fit into a smaller
2586 real type. */
2589 {
2593 }
2594 }
2595 }
2596 else
2597 {
2598 /* Warn for real types converted to integer types. */
2605 {
2606 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2610 /* Don't warn for short y; short x = ((int)y & 0xff); */
2614 {
2615 /* If both args were extended from a shortest type,
2616 use that type if that is safe. */
2623 {
2629 /* If one of the operands is a non-negative constant
2630 that fits in the target type, then the type of the
2631 other operand does not matter. */
2640 /* If constant is unsigned and fits in the target
2641 type, then the result will also fit. */
2643 && unsigned0
2646 && unsigned1
2649 }
2650 }
2651 /* Warn for integer types converted to smaller integer types. */
2655 /* When they are the same width but different signedness,
2656 then the value may change. */
2659 /* Even when converted to a bigger type, if the type is
2660 unsigned but expr is signed, then negative values
2661 will be changed. */
2667 }
2669 /* Warn for integer types converted to real types if and only if
2670 all the range of values of the integer type cannot be
2671 represented by the real type. */
2674 {
2678 /* Don't warn about char y = 0xff; float x = (int) y; */
2690 }
2692 /* Warn for real types converted to smaller real types. */
2697 }
2700 }
2702 /* Warns if the conversion of EXPR to TYPE may alter a value.
2703 This is a helper function for warnings_for_convert_and_check. */
2705 static void
2707 {
2715 {
2728 /* Conversion from boolean to a signed:1 bit-field (which only
2729 can hold the values 0 and -1) doesn't lose information - but
2730 it does change the value. */
2745 {
2746 /* In case of COND_EXPR, we do not care about the type of
2747 COND_EXPR, only about the conversion of each operand. */
2754 }
2761 }
2762 }
2764 /* Produce warnings after a conversion. RESULT is the result of
2765 converting EXPR to TYPE. This is a helper function for
2766 convert_and_check and cp_convert_and_check. */
2768 void
2770 {
2777 {
2778 /* Do not diagnose overflow in a constant expression merely
2779 because a conversion overflowed. */
2784 {
2785 /* This detects cases like converting -129 or 256 to
2786 unsigned char. */
2790 else
2792 }
2796 /* No warning for converting 0x80000000 to int. */
2804 else
2806 }
2811 else
2813 }
2816 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2817 Invoke this function on every expression that is converted implicitly,
2818 i.e. because of language rules and not because of an explicit cast. */
2820 tree
2822 {
2823 tree result;
2824 tree expr_for_warning;
2826 /* Convert from a value with possible excess precision rather than
2827 via the semantic type, but do not warn about values not fitting
2828 exactly in the semantic type. */
2830 {
2836 }
2837 else
2851 }
2852 \f
2853 /* A node in a list that describes references to variables (EXPR), which are
2854 either read accesses if WRITER is zero, or write accesses, in which case
2855 WRITER is the parent of EXPR. */
2856 struct tlist
2857 {
2860 };
2862 /* Used to implement a cache the results of a call to verify_tree. We only
2863 use this for SAVE_EXPRs. */
2864 struct tlist_cache
2865 {
2869 tree expr;
2870 };
2872 /* Obstack to use when allocating tlist structures, and corresponding
2873 firstobj. */
2877 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2878 warnings. */
2880 /* SAVE_EXPRs need special treatment. We process them only once and then
2881 cache the results. */
2893 /* Create a new struct tlist and fill in its fields. */
2896 {
2903 }
2905 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2906 is nonnull, we ignore any node we find which has a writer equal to it. */
2908 static void
2910 {
2912 {
2919 }
2920 }
2922 /* Merge the nodes of ADD into TO. This merging process is done so that for
2923 each variable that already exists in TO, no new node is added; however if
2924 there is a write access recorded in ADD, and an occurrence on TO is only
2925 a read access, then the occurrence in TO will be modified to record the
2926 write. */
2928 static void
2930 {
2937 {
2944 {
2948 }
2950 {
2954 }
2956 }
2957 }
2959 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2960 references in list LIST conflict with it, excluding reads if ONLY writers
2961 is nonzero. */
2963 static void
2966 {
2969 /* Avoid duplicate warnings. */
2975 {
2979 {
2984 }
2986 }
2987 }
2989 /* Given a list LIST of references to variables, find whether any of these
2990 can cause conflicts due to missing sequence points. */
2992 static void
2994 {
2998 {
3001 }
3002 }
3004 /* Return nonzero if X is a tree that can be verified by the sequence point
3005 warnings. */
3006 static int
3008 {
3015 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3016 (lvalue_p) crash on TRY/CATCH. */
3023 /* No point to track non-const calls, they will never satisfy
3024 operand_equal_p. */
3032 }
3034 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3035 static bool
3037 {
3039 }
3041 /* Walk the tree X, and record accesses to variables. If X is written by the
3042 parent tree, WRITER is the parent.
3043 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3044 expression or its only operand forces a sequence point, then everything up
3045 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3046 in PNO_SP.
3047 Once we return, we will have emitted warnings if any subexpression before
3048 such a sequence point could be undefined. On a higher level, however, the
3049 sequence point may not be relevant, and we'll merge the two lists.
3051 Example: (b++, a) + b;
3052 The call that processes the COMPOUND_EXPR will store the increment of B
3053 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3054 processes the PLUS_EXPR will need to merge the two lists so that
3055 eventually, all accesses end up on the same list (and we'll warn about the
3056 unordered subexpressions b++ and b.
3058 A note on merging. If we modify the former example so that our expression
3059 becomes
3060 (b++, b) + a
3061 care must be taken not simply to add all three expressions into the final
3062 PNO_SP list. The function merge_tlist takes care of that by merging the
3063 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3064 way, so that no more than one access to B is recorded. */
3066 static void
3068 tree writer)
3069 {
3074 /* X may be NULL if it is the operand of an empty statement expression
3075 ({ }). */
3079 restart:
3087 {
3120 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3121 two first, to avoid warning for (a ? b++ : b++). */
3137 /* Expressions inside the LHS are not ordered wrt. the sequence points
3138 in the RHS. Example:
3139 *a = (a++, 2)
3140 Despite the fact that the modification of "a" is in the before_sp
3141 list (tmp_before), it conflicts with the use of "a" in the LHS.
3142 We can handle this by adding the contents of tmp_list3
3143 to those of tmp_before, and redoing the collision warnings for that
3144 list. */
3147 /* Exclude the LHS itself here; we first have to merge it into the
3148 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3149 didn't exclude the LHS, we'd get it twice, once as a read and once
3150 as a write. */
3161 /* We need to warn about conflicts among arguments and conflicts between
3162 args and the function address. Side effects of the function address,
3163 however, are not ordered by the sequence point of the call. */
3164 {
3165 call_expr_arg_iterator iter;
3166 tree arg;
3170 {
3175 }
3180 }
3183 /* Scan all the list, e.g. indices of multi dimensional array. */
3185 {
3191 }
3195 {
3202 {
3214 {
3218 }
3221 }
3225 }
3235 /* For other expressions, simply recurse on their operands.
3236 Manual tail recursion for unary expressions.
3237 Other non-expressions need not be processed. */
3239 {
3243 }
3245 {
3249 {
3254 }
3255 }
3257 }
3258 }
3260 /* Try to warn for undefined behavior in EXPR due to missing sequence
3261 points. */
3263 DEBUG_FUNCTION void
3265 {
3271 {
3274 }
3279 }
3280 \f
3281 /* Validate the expression after `case' and apply default promotions. */
3283 static tree
3285 {
3290 /* Promote char or short to int. */
3293 {
3296 }
3301 }
3302 \f
3303 /* See if the case values LOW and HIGH are in the range of the original
3304 type (i.e. before the default conversion to int) of the switch testing
3305 expression.
3306 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3307 the type before promoting it. CASE_LOW_P is a pointer to the lower
3308 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3309 if the case is not a case range.
3310 The caller has to make sure that we are not called with NULL for
3311 CASE_LOW_P (i.e. the default case).
3312 Returns true if the case label is in range of ORIG_TYPE (saturated or
3313 untouched) or false if the label is out of range. */
3315 static bool
3318 {
3323 /* If there was a problem with the original type, do nothing. */
3330 /* Case label is less than minimum for type. */
3333 {
3336 }
3338 /* Case value is greater than maximum for type. */
3341 {
3344 }
3346 /* Saturate lower case label value to minimum. */
3349 {
3353 }
3355 /* Saturate upper case label value to maximum. */
3358 {
3362 }
3370 }
3371 \f
3372 /* Return an integer type with BITS bits of precision,
3373 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3375 tree
3377 {
3416 }
3418 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3419 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3420 and saturating if SATP is nonzero, otherwise not saturating. */
3422 tree
3425 {
3429 else
3437 {
3439 "fixed-point types that have too many integral and "
3442 }
3445 }
3447 /* Used for communication between c_common_type_for_mode and
3448 c_register_builtin_type. */
3451 /* Return a data type that has machine mode MODE.
3452 If the mode is an integer,
3453 then UNSIGNEDP selects between signed and unsigned types.
3454 If the mode is a fixed-point mode,
3455 then UNSIGNEDP selects between saturating and nonsaturating types. */
3457 tree
3459 {
3460 tree t;
3497 #if HOST_BITS_PER_WIDE_INT >= 64
3500 #endif
3525 {
3527 tree inner_type;
3543 }
3545 {
3550 }
3560 {
3646 }
3654 }
3656 tree
3658 {
3660 }
3662 /* Return a signed type the same as TYPE in other respects. */
3664 tree
3666 {
3668 }
3670 /* Return a type the same as TYPE except unsigned or
3671 signed according to UNSIGNEDP. */
3673 tree
3675 {
3676 tree type1;
3678 /* This block of code emulates the behavior of the old
3679 c_common_unsigned_type. In particular, it returns
3680 long_unsigned_type_node if passed a long, even when a int would
3681 have the same size. This is necessary for warnings to work
3682 correctly in archs where sizeof(int) == sizeof(long) */
3685 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3701 #if HOST_BITS_PER_WIDE_INT >= 64
3704 #endif
3714 #define C_COMMON_FIXED_TYPES(NAME) \
3715 if (type1 == short_ ## NAME ## _type_node \
3716 || type1 == unsigned_short_ ## NAME ## _type_node) \
3717 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3718 : short_ ## NAME ## _type_node; \
3719 if (type1 == NAME ## _type_node \
3720 || type1 == unsigned_ ## NAME ## _type_node) \
3721 return unsignedp ? unsigned_ ## NAME ## _type_node \
3722 : NAME ## _type_node; \
3723 if (type1 == long_ ## NAME ## _type_node \
3724 || type1 == unsigned_long_ ## NAME ## _type_node) \
3725 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3726 : long_ ## NAME ## _type_node; \
3727 if (type1 == long_long_ ## NAME ## _type_node \
3728 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3729 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3730 : long_long_ ## NAME ## _type_node;
3732 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3733 if (type1 == NAME ## _type_node \
3734 || type1 == u ## NAME ## _type_node) \
3735 return unsignedp ? u ## NAME ## _type_node \
3736 : NAME ## _type_node;
3738 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3739 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3740 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3741 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3742 : sat_ ## short_ ## NAME ## _type_node; \
3743 if (type1 == sat_ ## NAME ## _type_node \
3744 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3745 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3746 : sat_ ## NAME ## _type_node; \
3747 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3748 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3749 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3750 : sat_ ## long_ ## NAME ## _type_node; \
3751 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3752 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3753 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3754 : sat_ ## long_long_ ## NAME ## _type_node;
3756 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3757 if (type1 == sat_ ## NAME ## _type_node \
3758 || type1 == sat_ ## u ## NAME ## _type_node) \
3759 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3760 : sat_ ## NAME ## _type_node;
3786 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3787 the precision; they have precision set to match their range, but
3788 may use a wider mode to match an ABI. If we change modes, we may
3789 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3790 the precision as well, so as to yield correct results for
3791 bit-field types. C++ does not have these separate bit-field
3792 types, and producing a signed or unsigned variant of an
3793 ENUMERAL_TYPE may cause other problems as well. */
3799 #define TYPE_OK(node) \
3800 (TYPE_MODE (type) == TYPE_MODE (node) \
3801 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3820 #if HOST_BITS_PER_WIDE_INT >= 64
3823 #endif
3832 #undef TYPE_OK
3835 }
3837 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3839 tree
3841 {
3842 /* Extended integer types of the same width as a standard type have
3843 lesser rank, so those of the same width as int promote to int or
3844 unsigned int and are valid for printf formats expecting int or
3845 unsigned int. To avoid such special cases, avoid creating
3846 extended integer types for bit-fields if a standard integer type
3847 is available. */
3864 }
3866 /* The C version of the register_builtin_type langhook. */
3868 void
3870 {
3871 tree decl;
3881 }
3882 \f
3883 /* Print an error message for invalid operands to arith operation
3884 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3885 LOCATION is the location of the message. */
3887 void
3890 {
3894 {
3939 }
3943 }
3944 \f
3945 /* Given an expression as a tree, return its original type. Do this
3946 by stripping any conversion that preserves the sign and precision. */
3947 static tree
3949 {
3952 }
3954 /* Subroutine of build_binary_op, used for comparison operations.
3955 See if the operands have both been converted from subword integer types
3956 and, if so, perhaps change them both back to their original type.
3957 This function is also responsible for converting the two operands
3958 to the proper common type for comparison.
3960 The arguments of this function are all pointers to local variables
3961 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3962 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3964 If this function returns nonzero, it means that the comparison has
3965 a constant value. What this function returns is an expression for
3966 that value. */
3968 tree
3971 {
3972 tree type;
3981 /* Throw away any conversions to wider types
3982 already present in the operands. */
3987 /* If primopN is first sign-extended from primopN's precision to opN's
3988 precision, then zero-extended from opN's precision to
3989 *restype_ptr precision, shortenings might be invalid. */
3992 && !unsignedp0
3997 && !unsignedp1
4001 /* Handle the case that OP0 does not *contain* a conversion
4002 but it *requires* conversion to FINAL_TYPE. */
4009 /* If one of the operands must be floated, we cannot optimize. */
4013 /* If first arg is constant, swap the args (changing operation
4014 so value is preserved), for canonicalization. Don't do this if
4015 the second arg is 0. */
4020 {
4037 {
4052 }
4054 }
4056 /* If comparing an integer against a constant more bits wide,
4057 maybe we can deduce a value of 1 or 0 independent of the data.
4058 Or else truncate the constant now
4059 rather than extend the variable at run time.
4061 This is only interesting if the constant is the wider arg.
4062 Also, it is not safe if the constant is unsigned and the
4063 variable arg is signed, since in this case the variable
4064 would be sign-extended and then regarded as unsigned.
4065 Our technique fails in this case because the lowest/highest
4066 possible unsigned results don't follow naturally from the
4067 lowest/highest possible values of the variable operand.
4068 For just EQ_EXPR and NE_EXPR there is another technique that
4069 could be used: see if the constant can be faithfully represented
4070 in the other operand's type, by truncating it and reextending it
4071 and see if that preserves the constant's value. */
4077 {
4080 /* 1 if comparison is nominally unsigned. */
4082 tree val;
4094 {
4095 /* Convert primop1 to target type, but do not introduce
4096 additional overflow. We know primop1 is an int_cst. */
4100 }
4102 {
4105 }
4108 {
4113 }
4114 else
4115 {
4120 }
4123 /* This used to be a switch, but Genix compiler can't handle that. */
4125 {
4128 }
4130 {
4133 }
4135 {
4140 }
4142 {
4147 }
4149 {
4154 }
4156 {
4161 }
4163 /* If primop0 was sign-extended and unsigned comparison specd,
4164 we did a signed comparison above using the signed type bounds.
4165 But the comparison we output must be unsigned.
4167 Also, for inequalities, VAL is no good; but if the signed
4168 comparison had *any* fixed result, it follows that the
4169 unsigned comparison just tests the sign in reverse
4170 (positive values are LE, negative ones GE).
4171 So we can generate an unsigned comparison
4172 against an extreme value of the signed type. */
4175 {
4178 {
4193 }
4195 }
4199 {
4206 }
4209 {
4210 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4214 }
4216 /* Value is not predetermined, but do the comparison
4217 in the type of the operand that is not constant.
4218 TYPE is already properly set. */
4219 }
4221 /* If either arg is decimal float and the other is float, find the
4222 proper common type to use for comparison. */
4233 /* If args' natural types are both narrower than nominal type
4234 and both extend in the same manner, compare them
4235 in the type of the wider arg.
4236 Otherwise must actually extend both to the nominal
4237 common type lest different ways of extending
4238 alter the result.
4239 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4244 {
4248 type);
4249 /* Make sure shorter operand is extended the right way
4250 to match the longer operand. */
4251 primop0
4254 primop0);
4255 primop1
4258 primop1);
4259 }
4260 else
4261 {
4262 /* Here we must do the comparison on the nominal type
4263 using the args exactly as we received them. */
4270 {
4272 /* All unsigned values are >= 0, so we warn. However,
4273 if OP0 is a constant that is >= 0, the signedness of
4274 the comparison isn't an issue, so suppress the
4275 warning. */
4277 warn_type_limits && !in_system_header
4281 primop0)))
4282 /* Do not warn for enumeration types. */
4286 {
4303 }
4306 {
4307 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4312 }
4313 }
4314 }
4322 }
4323 \f
4324 /* Return a tree for the sum or difference (RESULTCODE says which)
4325 of pointer PTROP and integer INTOP. */
4327 tree
4330 {
4333 /* The result is a pointer of the same type that is being added. */
4337 {
4344 }
4346 {
4353 }
4354 else
4357 /* We are manipulating pointer values, so we don't need to warn
4358 about relying on undefined signed overflow. We disable the
4359 warning here because we use integer types so fold won't know that
4360 they are really pointers. */
4363 /* If what we are about to multiply by the size of the elements
4364 contains a constant term, apply distributive law
4365 and multiply that constant term separately.
4366 This helps produce common subexpressions. */
4371 /* If the constant comes from pointer subtraction,
4372 skip this optimization--it would cause an error. */
4374 /* If the constant is unsigned, and smaller than the pointer size,
4375 then we must skip this optimization. This is because it could cause
4376 an overflow error if the constant is negative but INTOP is not. */
4380 {
4385 /* Convert both subexpression types to the type of intop,
4386 because weird cases involving pointer arithmetic
4387 can result in a sum or difference with different type args. */
4392 }
4394 /* Convert the integer argument to a type the same size as sizetype
4395 so the multiply won't overflow spuriously. */
4401 /* Replace the integer argument with a suitable product by the object size.
4402 Do this multiplication as signed, then convert to the appropriate type
4403 for the pointer operation and disregard an overflow that occurred only
4404 because of the sign-extension change in the latter conversion. */
4405 {
4413 }
4415 /* Create the sum or difference. */
4424 }
4425 \f
4426 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4427 and if NON_CONST is known not to be permitted in an evaluated part
4428 of a constant expression. */
4430 tree
4432 {
4436 /* This should never be called for C++. */
4440 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4449 }
4451 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4452 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4453 around the SAVE_EXPR if needed so that c_fully_fold does not need
4454 to look inside SAVE_EXPRs. */
4456 tree
4458 {
4467 }
4469 /* Return whether EXPR is a declaration whose address can never be
4470 NULL. */
4472 bool
4474 {
4479 }
4481 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4482 or for an `if' or `while' statement or ?..: exp. It should already
4483 have been validated to be of suitable type; otherwise, a bad
4484 diagnostic may result.
4486 The EXPR is located at LOCATION.
4488 This preparation consists of taking the ordinary
4489 representation of an expression expr and producing a valid tree
4490 boolean expression describing whether expr is nonzero. We could
4491 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4492 but we optimize comparisons, &&, ||, and !.
4494 The resulting type should always be `truthvalue_type_node'. */
4496 tree
4498 {
4500 {
4542 ? truthvalue_true_node
4548 ? truthvalue_true_node
4553 /* Fall through. */
4556 {
4559 {
4560 /* Common Ada/Pascal programmer's mistake. */
4562 OPT_Waddress,
4564 inner);
4566 }
4568 }
4585 /* These don't change whether an object is nonzero or zero. */
4590 /* These don't change whether an object is zero or nonzero, but
4591 we can't ignore them if their second arg has side-effects. */
4593 {
4596 c_common_truthvalue_conversion
4599 }
4600 else
4605 /* Distribute the conversion into the arms of a COND_EXPR. */
4607 {
4610 /* In C++ one of the arms might have void type if it is throw. */
4618 }
4619 else
4620 {
4621 /* Folding will happen later for C. */
4629 }
4631 CASE_CONVERT:
4632 {
4636 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4637 since that affects how `default_conversion' will behave. */
4641 /* Don't strip a conversion from C++0x scoped enum, since they
4642 don't implicitly convert to other types. */
4646 /* If this isn't narrowing the argument, we can ignore it. */
4650 }
4656 {
4660 }
4665 }
4668 {
4670 expr = (build_binary_op
4674 c_common_truthvalue_conversion
4677 c_common_truthvalue_conversion
4682 }
4685 {
4690 }
4691 else
4694 ret:
4697 }
4698 \f
4707 /* Apply the TYPE_QUALS to the new DECL. */
4709 void
4711 {
4719 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4720 constructor can produce constant init, so rely on cp_finish_decl to
4721 clear TREE_READONLY if the variable has non-constant init. */
4724 {
4727 }
4729 {
4731 /* Allow 'restrict' on arrays of pointers.
4732 FIXME currently we just ignore it. */
4738 }
4739 }
4741 /* Hash function for the problem of multiple type definitions in
4742 different files. This must hash all types that will compare
4743 equal via comptypes to the same value. In practice it hashes
4744 on some of the simple stuff and leaves the details to comptypes. */
4746 static hashval_t
4748 {
4752 tree t2;
4754 {
4755 /* For pointers, hash on pointee type plus some swizzling. */
4758 /* Hash on number of elements and total size. */
4777 }
4778 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4779 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4781 /* We might have a VLA here. */
4784 else
4787 }
4791 /* Return the typed-based alias set for T, which may be an expression
4792 or a type. Return -1 if we don't do anything special. */
4794 alias_set_type
4796 {
4797 tree u;
4800 /* For VLAs, use the alias set of the element type rather than the
4801 default of alias set 0 for types compared structurally. */
4803 {
4807 }
4809 /* Permit type-punning when accessing a union, provided the access
4810 is directly through the union. For example, this code does not
4811 permit taking the address of a union member and then storing
4812 through it. Even the type-punning allowed here is a GCC
4813 extension, albeit a common and useful one; the C standard says
4814 that such accesses have implementation-defined behavior. */
4822 /* That's all the expressions we handle specially. */
4826 /* The C standard guarantees that any object may be accessed via an
4827 lvalue that has character type. */
4833 /* The C standard specifically allows aliasing between signed and
4834 unsigned variants of the same type. We treat the signed
4835 variant as canonical. */
4837 {
4840 /* t1 == t can happen for boolean nodes which are always unsigned. */
4843 }
4845 /* Handle the case of multiple type nodes referring to "the same" type,
4846 which occurs with IMA. These share an alias set. FIXME: Currently only
4847 C90 is handled. (In C99 type compatibility is not transitive, which
4848 complicates things mightily. The alias set splay trees can theoretically
4849 represent this, but insertion is tricky when you consider all the
4850 different orders things might arrive in.) */
4855 /* Save time if there's only one input file. */
4859 /* Pointers need special handling if they point to any type that
4860 needs special handling (below). */
4862 {
4863 tree t2;
4864 /* Find bottom type under any nested POINTERs. */
4868 ;
4876 }
4877 /* These are the only cases that need special handling. */
4884 /* Undefined? */
4888 /* Look up t in hash table. Only one of the compatible types within each
4889 alias set is recorded in the table. */
4893 NULL);
4896 {
4899 }
4900 else
4901 /* Our caller will assign and record (in t) a new alias set; all we need
4902 to do is remember t in the hash table. */
4906 }
4907 \f
4908 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4909 the second parameter indicates which OPERATOR is being applied.
4910 The COMPLAIN flag controls whether we should diagnose possibly
4911 ill-formed constructs or not. LOC is the location of the SIZEOF or
4912 TYPEOF operator. */
4914 tree
4917 {
4925 {
4927 {
4934 }
4935 else
4936 {
4938 {
4942 else
4945 }
4947 }
4948 }
4950 {
4958 }
4961 {
4966 }
4969 {
4974 }
4975 else
4976 {
4978 /* Convert in case a char is more than one unit. */
4982 else
4984 }
4986 /* VALUE will have the middle-end integer type sizetype.
4987 However, we should really return a value of type `size_t',
4988 which is just a typedef for an ordinary integer type. */
4992 }
4994 /* Implement the __alignof keyword: Return the minimum required
4995 alignment of EXPR, measured in bytes. For VAR_DECLs,
4996 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4997 from an "aligned" __attribute__ specification). LOC is the
4998 location of the ALIGNOF operator. */
5000 tree
5002 {
5003 tree t;
5010 {
5013 }
5019 {
5026 {
5033 }
5035 }
5036 else
5040 }
5041 \f
5042 /* Handle C and C++ default attributes. */
5044 enum built_in_attribute
5045 {
5046 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5047 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5048 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5049 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5050 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5052 #undef DEF_ATTR_NULL_TREE
5053 #undef DEF_ATTR_INT
5054 #undef DEF_ATTR_STRING
5055 #undef DEF_ATTR_IDENT
5056 #undef DEF_ATTR_TREE_LIST
5057 ATTR_LAST
5058 };
5064 enum c_builtin_type
5065 {
5066 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5067 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5068 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5069 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5070 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5071 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5072 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5073 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5074 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5075 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5076 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5077 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5078 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5079 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5080 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5081 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5082 NAME,
5083 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5085 #undef DEF_PRIMITIVE_TYPE
5086 #undef DEF_FUNCTION_TYPE_0
5087 #undef DEF_FUNCTION_TYPE_1
5088 #undef DEF_FUNCTION_TYPE_2
5089 #undef DEF_FUNCTION_TYPE_3
5090 #undef DEF_FUNCTION_TYPE_4
5091 #undef DEF_FUNCTION_TYPE_5
5092 #undef DEF_FUNCTION_TYPE_6
5093 #undef DEF_FUNCTION_TYPE_7
5094 #undef DEF_FUNCTION_TYPE_8
5095 #undef DEF_FUNCTION_TYPE_VAR_0
5096 #undef DEF_FUNCTION_TYPE_VAR_1
5097 #undef DEF_FUNCTION_TYPE_VAR_2
5098 #undef DEF_FUNCTION_TYPE_VAR_3
5099 #undef DEF_FUNCTION_TYPE_VAR_4
5100 #undef DEF_FUNCTION_TYPE_VAR_5
5101 #undef DEF_POINTER_TYPE
5102 BT_LAST
5103 };
5107 /* A temporary array for c_common_nodes_and_builtins. Used in
5108 communication with def_fn_type. */
5111 /* A helper function for c_common_nodes_and_builtins. Build function type
5112 for DEF with return type RET and N arguments. If VAR is true, then the
5113 function should be variadic after those N arguments.
5115 Takes special care not to ICE if any of the types involved are
5116 error_mark_node, which indicates that said type is not in fact available
5117 (see builtin_type_for_size). In which case the function type as a whole
5118 should be error_mark_node. */
5120 static void
5122 {
5123 tree t;
5130 {
5136 }
5143 else
5146 egress:
5149 }
5151 /* Build builtin functions common to both C and C++ language
5152 frontends. */
5154 static void
5156 {
5157 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5158 builtin_types[ENUM] = VALUE;
5159 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5160 def_fn_type (ENUM, RETURN, 0, 0);
5161 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5162 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5163 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5164 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5165 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5166 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5167 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5168 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5169 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5170 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5171 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5172 ARG6) \
5173 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5174 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5175 ARG6, ARG7) \
5176 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5177 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5178 ARG6, ARG7, ARG8) \
5179 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5180 ARG7, ARG8);
5181 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5182 def_fn_type (ENUM, RETURN, 1, 0);
5183 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5184 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5185 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5186 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5187 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5188 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5189 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5190 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5191 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5192 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5193 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5194 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5198 #undef DEF_PRIMITIVE_TYPE
5199 #undef DEF_FUNCTION_TYPE_1
5200 #undef DEF_FUNCTION_TYPE_2
5201 #undef DEF_FUNCTION_TYPE_3
5202 #undef DEF_FUNCTION_TYPE_4
5203 #undef DEF_FUNCTION_TYPE_5
5204 #undef DEF_FUNCTION_TYPE_6
5205 #undef DEF_FUNCTION_TYPE_VAR_0
5206 #undef DEF_FUNCTION_TYPE_VAR_1
5207 #undef DEF_FUNCTION_TYPE_VAR_2
5208 #undef DEF_FUNCTION_TYPE_VAR_3
5209 #undef DEF_FUNCTION_TYPE_VAR_4
5210 #undef DEF_FUNCTION_TYPE_VAR_5
5211 #undef DEF_POINTER_TYPE
5216 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5217 NONANSI_P, ATTRS, IMPLICIT, COND) \
5218 if (NAME && COND) \
5219 def_builtin_1 (ENUM, NAME, CLASS, \
5220 builtin_types[(int) TYPE], \
5221 builtin_types[(int) LIBTYPE], \
5222 BOTH_P, FALLBACK_P, NONANSI_P, \
5223 built_in_attributes[(int) ATTRS], IMPLICIT);
5225 #undef DEF_BUILTIN
5233 }
5235 /* Like get_identifier, but avoid warnings about null arguments when
5236 the argument may be NULL for targets where GCC lacks stdint.h type
5237 information. */
5241 {
5243 }
5245 /* Build tree nodes and builtin functions common to both C and C++ language
5246 frontends. */
5248 void
5250 {
5254 tree array_domain_type;
5255 tree va_list_ref_type_node;
5256 tree va_list_arg_type_node;
5260 /* Define `int' and `char' first so that dbx will output them first. */
5264 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5265 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5266 but not C. Are the conditionals here needed? */
5272 long_unsigned_type_node);
5274 {
5276 int128_integer_type_node);
5278 int128_unsigned_type_node);
5279 }
5283 long_long_integer_type_node);
5285 long_long_unsigned_type_node);
5288 long_long_unsigned_type_node);
5291 short_unsigned_type_node);
5294 short_unsigned_type_node);
5296 /* Define both `signed char' and `unsigned char'. */
5300 /* These are types that c_common_type_for_size and
5301 c_common_type_for_mode use. */
5304 intQI_type_node));
5307 intHI_type_node));
5310 intSI_type_node));
5313 intDI_type_node));
5314 #if HOST_BITS_PER_WIDE_INT >= 64
5317 TYPE_DECL,
5319 intTI_type_node));
5320 #endif
5323 unsigned_intQI_type_node));
5326 unsigned_intHI_type_node));
5329 unsigned_intSI_type_node));
5332 unsigned_intDI_type_node));
5333 #if HOST_BITS_PER_WIDE_INT >= 64
5336 TYPE_DECL,
5338 unsigned_intTI_type_node));
5339 #endif
5341 /* Create the widest literal types. */
5342 widest_integer_literal_type_node
5346 widest_integer_literal_type_node));
5348 widest_unsigned_literal_type_node
5352 widest_unsigned_literal_type_node));
5356 pid_type_node =
5363 /* Only supported decimal floating point extension if the target
5364 actually supports underlying modes. */
5368 {
5372 }
5375 {
5380 long_long_fract_type_node);
5382 unsigned_short_fract_type_node);
5384 unsigned_fract_type_node);
5386 unsigned_long_fract_type_node);
5388 unsigned_long_long_fract_type_node);
5390 sat_short_fract_type_node);
5393 sat_long_fract_type_node);
5395 sat_long_long_fract_type_node);
5397 sat_unsigned_short_fract_type_node);
5399 sat_unsigned_fract_type_node);
5401 sat_unsigned_long_fract_type_node);
5403 sat_unsigned_long_long_fract_type_node);
5408 long_long_accum_type_node);
5410 unsigned_short_accum_type_node);
5412 unsigned_accum_type_node);
5414 unsigned_long_accum_type_node);
5416 unsigned_long_long_accum_type_node);
5418 sat_short_accum_type_node);
5421 sat_long_accum_type_node);
5423 sat_long_long_accum_type_node);
5425 sat_unsigned_short_accum_type_node);
5427 sat_unsigned_accum_type_node);
5429 sat_unsigned_long_accum_type_node);
5431 sat_unsigned_long_long_accum_type_node);
5433 }
5436 TYPE_DECL,
5438 complex_integer_type_node));
5440 TYPE_DECL,
5442 complex_float_type_node));
5444 TYPE_DECL,
5446 complex_double_type_node));
5450 complex_long_double_type_node));
5453 /* For C++, make fileptr_type_node a distinct void * type until
5454 FILE type is defined. */
5459 /* Set the TYPE_NAME for any variants that were built before
5460 record_builtin_type gave names to the built-in types. */
5461 {
5467 }
5469 /* This node must not be shared. */
5475 /* Make a type to be the domain of a few array types
5476 whose domains don't really matter.
5477 200 is small enough that it always fits in size_t
5478 and large enough that it can hold most function names for the
5479 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5482 /* Make a type for arrays of characters.
5483 With luck nothing will ever really depend on the length of this
5484 array type. */
5485 char_array_type_node
5488 /* Likewise for arrays of ints. */
5489 int_array_type_node
5493 const_string_type_node
5497 /* This is special for C++ so functions can be overloaded. */
5503 {
5506 else
5509 }
5511 /* This is for wide string constants. */
5512 wchar_array_type_node
5515 /* Define 'char16_t'. */
5520 {
5525 }
5527 /* This is for UTF-16 string constants. */
5528 char16_array_type_node
5531 /* Define 'char32_t'. */
5536 {
5541 }
5543 /* This is for UTF-32 string constants. */
5544 char32_array_type_node
5547 wint_type_node =
5550 intmax_type_node =
5552 uintmax_type_node =
5556 sig_atomic_type_node =
5559 int8_type_node =
5562 int16_type_node =
5565 int32_type_node =
5568 int64_type_node =
5571 uint8_type_node =
5574 c_uint16_type_node =
5577 c_uint32_type_node =
5580 c_uint64_type_node =
5583 int_least8_type_node =
5586 int_least16_type_node =
5589 int_least32_type_node =
5592 int_least64_type_node =
5595 uint_least8_type_node =
5598 uint_least16_type_node =
5601 uint_least32_type_node =
5604 uint_least64_type_node =
5607 int_fast8_type_node =
5610 int_fast16_type_node =
5613 int_fast32_type_node =
5616 int_fast64_type_node =
5619 uint_fast8_type_node =
5622 uint_fast16_type_node =
5625 uint_fast32_type_node =
5628 uint_fast64_type_node =
5631 intptr_type_node =
5634 uintptr_type_node =
5637 default_function_type
5639 ptrdiff_type_node
5646 va_list_type_node));
5648 {
5651 tree ptype;
5654 {
5658 ptype));
5660 }
5661 }
5664 {
5667 }
5668 else
5669 {
5672 }
5679 /* Create the built-in __null node. It is important that this is
5680 not shared. */
5684 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5686 }
5688 /* The number of named compound-literals generated thus far. */
5691 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5693 void
5695 {
5698 compound_literal_number);
5699 compound_literal_number++;
5701 }
5703 tree
5705 {
5709 }
5712 /* Linked list of disabled built-in functions. */
5715 {
5723 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5724 begins with "__builtin_", give an error. */
5726 void
5728 {
5731 else
5732 {
5737 }
5738 }
5741 /* Return true if the built-in function NAME has been disabled, false
5742 otherwise. */
5744 static bool
5746 {
5749 {
5752 }
5754 }
5757 /* Worker for DEF_BUILTIN.
5758 Possibly define a builtin function with one or two names.
5759 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5760 nonansi_p and flag_no_nonansi_builtin. */
5762 static void
5769 {
5770 tree decl;
5783 fnattrs);
5792 }
5793 \f
5794 /* Nonzero if the type T promotes to int. This is (nearly) the
5795 integral promotions defined in ISO C99 6.3.1.1/2. */
5797 bool
5799 {
5801 {
5811 /* ??? Technically all enumerations not larger than an int
5812 promote to an int. But this is used along code paths
5813 that only want to notice a size change. */
5821 }
5822 }
5824 /* Return 1 if PARMS specifies a fixed number of parameters
5825 and none of their types is affected by default promotions. */
5827 int
5829 {
5830 const_tree t;
5832 {
5849 }
5851 }
5853 /* Recursively remove any '*' or '&' operator from TYPE. */
5854 tree
5856 {
5860 }
5862 /* Recursively remove pointer or array type from TYPE. */
5863 tree
5865 {
5869 }
5871 /* Used to compare case labels. K1 and K2 are actually tree nodes
5872 representing case labels, or NULL_TREE for a `default' label.
5873 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5874 K2, and 0 if K1 and K2 are equal. */
5876 int
5878 {
5879 /* Consider a NULL key (such as arises with a `default' label) to be
5880 smaller than anything else. */
5887 }
5889 /* Process a case label, located at LOC, for the range LOW_VALUE
5890 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5891 then this case label is actually a `default' label. If only
5892 HIGH_VALUE is NULL_TREE, then case label was declared using the
5893 usual C/C++ syntax, rather than the GNU case range extension.
5894 CASES is a tree containing all the case ranges processed so far;
5895 COND is the condition for the switch-statement itself. Returns the
5896 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5897 is created. */
5899 tree
5902 {
5903 tree type;
5904 tree label;
5905 tree case_label;
5906 splay_tree_node node;
5908 /* Create the LABEL_DECL itself. */
5911 /* If there was an error processing the switch condition, bail now
5912 before we get more confused. */
5920 {
5923 }
5925 /* Case ranges are a GNU extension. */
5932 {
5937 }
5939 {
5944 }
5947 {
5948 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5949 really a case range, even though it was written that way.
5950 Remove the HIGH_VALUE to simplify later processing. */
5955 }
5957 /* See if the case is in range of the type of the original testing
5958 expression. If both low_value and high_value are out of range,
5959 don't insert the case label and return NULL_TREE. */
5965 /* Look up the LOW_VALUE in the table of case labels we already
5966 have. */
5968 /* If there was not an exact match, check for overlapping ranges.
5969 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5970 that's a `default' label and the only overlap is an exact match. */
5972 {
5973 splay_tree_node low_bound;
5974 splay_tree_node high_bound;
5976 /* Even though there wasn't an exact match, there might be an
5977 overlap between this case range and another case range.
5978 Since we've (inductively) not allowed any overlapping case
5979 ranges, we simply need to find the greatest low case label
5980 that is smaller that LOW_VALUE, and the smallest low case
5981 label that is greater than LOW_VALUE. If there is an overlap
5982 it will occur in one of these two ranges. */
5988 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5989 the LOW_VALUE, so there is no need to check unless the
5990 LOW_BOUND is in fact itself a case range. */
5996 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5997 range is bigger than the low end of the current range, so we
5998 are only interested if the current range is a real range, and
5999 not an ordinary case label. */
6001 && high_value
6003 high_value)
6006 }
6007 /* If there was an overlap, issue an error. */
6009 {
6013 {
6017 }
6019 {
6022 }
6023 else
6024 {
6028 }
6030 }
6032 /* Add a CASE_LABEL to the statement-tree. */
6034 /* Register this case label in the splay tree. */
6041 error_out:
6042 /* Add a label so that the back-end doesn't think that the beginning of
6043 the switch is unreachable. Note that we do not add a case label, as
6044 that just leads to duplicates and thence to failure later on. */
6046 {
6049 }
6051 }
6053 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6054 Used to verify that case values match up with enumerator values. */
6056 static void
6058 {
6061 /* ??? Not working too hard to print the double-word value.
6062 Should perhaps be done with %lwd in the diagnostic routines? */
6071 else
6080 buf);
6081 else
6086 }
6088 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6089 Used to verify that case values match up with enumerator values. */
6091 static int
6093 {
6097 /* Skip default case. */
6101 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6102 when we did our enum->case scan. Reset our scratch bit after. */
6105 else
6108 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6109 not set, that means that CASE_HIGH did not appear when we did our
6110 enum->case scan. Reset our scratch bit after. */
6112 {
6115 else
6117 }
6120 }
6122 /* Handle -Wswitch*. Called from the front end after parsing the
6123 switch construct. */
6124 /* ??? Should probably be somewhere generic, since other languages
6125 besides C and C++ would want this. At the moment, however, C/C++
6126 are the only tree-ssa languages that support enumerations at all,
6127 so the point is moot. */
6129 void
6132 {
6133 splay_tree_node default_node;
6134 splay_tree_node node;
6135 tree chain;
6145 /* From here on, we only care about about enumerated types. */
6149 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6153 /* Check the cases. Warn about case values which are not members of
6154 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6155 there is no default case, check that exactly all enumeration
6156 literals are covered by the cases. */
6158 /* Clearing COND if it is not an integer constant simplifies
6159 the tests inside the loop below. */
6163 /* The time complexity here is O(N*lg(N)) worst case, but for the
6164 common case of monotonically increasing enumerators, it is
6165 O(N), since the nature of the splay tree will keep the next
6166 element adjacent to the root at all times. */
6169 {
6175 {
6176 /* Mark the CASE_LOW part of the case entry as seen. */
6180 }
6182 /* Even though there wasn't an exact match, there might be a
6183 case range which includes the enumerator's value. */
6186 {
6190 {
6191 /* If we match the upper bound exactly, mark the CASE_HIGH
6192 part of the case entry as seen. */
6196 }
6197 }
6199 /* We've now determined that this enumerated literal isn't
6200 handled by the case labels of the switch statement. */
6202 /* If the switch expression is a constant, we only really care
6203 about whether that constant is handled by the switch. */
6207 /* If there is a default_node, the only relevant option is
6208 Wswitch-enum. Otherwise, if both are enabled then we prefer
6209 to warn using -Wswitch because -Wswitch is enabled by -Wall
6210 while -Wswitch-enum is explicit. */
6213 ? OPT_Wswitch_enum
6217 }
6219 /* Warn if there are case expressions that don't correspond to
6220 enumerators. This can occur since C and C++ don't enforce
6221 type-checking of assignments to enumeration variables.
6223 The time complexity here is now always O(N) worst case, since
6224 we should have marked both the lower bound and upper bound of
6225 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6226 above. This scan also resets those fields. */
6229 }
6231 /* Finish an expression taking the address of LABEL (an
6232 IDENTIFIER_NODE). Returns an expression for the address.
6234 LOC is the location for the expression returned. */
6236 tree
6238 {
6239 tree result;
6249 else
6250 {
6253 /* The current function is not necessarily uninlinable.
6254 Computed gotos are incompatible with inlining, but the value
6255 here could be used only in a diagnostic, for example. */
6257 }
6260 }
6261 \f
6263 /* Given a boolean expression ARG, return a tree representing an increment
6264 or decrement (as indicated by CODE) of ARG. The front end must check for
6265 invalid cases (e.g., decrement in C++). */
6266 tree
6268 {
6269 tree val;
6274 {
6297 }
6300 }
6301 \f
6302 /* Built-in macros for stddef.h and stdint.h, that require macros
6303 defined in this file. */
6304 void
6306 {
6369 }
6371 static void
6373 {
6374 /* Fill in the built_in_attributes array. */
6375 #define DEF_ATTR_NULL_TREE(ENUM) \
6376 built_in_attributes[(int) ENUM] = NULL_TREE;
6377 #define DEF_ATTR_INT(ENUM, VALUE) \
6378 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6379 #define DEF_ATTR_STRING(ENUM, VALUE) \
6380 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6381 #define DEF_ATTR_IDENT(ENUM, STRING) \
6382 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6383 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6384 built_in_attributes[(int) ENUM] \
6385 = tree_cons (built_in_attributes[(int) PURPOSE], \
6386 built_in_attributes[(int) VALUE], \
6387 built_in_attributes[(int) CHAIN]);
6389 #undef DEF_ATTR_NULL_TREE
6390 #undef DEF_ATTR_INT
6391 #undef DEF_ATTR_IDENT
6392 #undef DEF_ATTR_TREE_LIST
6393 }
6395 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6396 identifier as an argument, so the front end shouldn't look it up. */
6398 bool
6400 {
6403 /* Unknown attribute that we'll end up ignoring, return true so we
6404 don't complain about an identifier argument. */
6410 else
6412 }
6414 /* Attribute handlers common to C front ends. */
6416 /* Handle a "packed" attribute; arguments as in
6417 struct attribute_spec.handler. */
6419 static tree
6422 {
6424 {
6428 }
6430 {
6432 /* Still pack bitfields. */
6437 else
6439 }
6440 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6441 used for DECL_REGISTER. It wouldn't mean anything anyway.
6442 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6443 that changes what the typedef is typing. */
6444 else
6445 {
6448 }
6451 }
6453 /* Handle a "nocommon" attribute; arguments as in
6454 struct attribute_spec.handler. */
6456 static tree
6460 {
6463 else
6464 {
6467 }
6470 }
6472 /* Handle a "common" attribute; arguments as in
6473 struct attribute_spec.handler. */
6475 static tree
6478 {
6481 else
6482 {
6485 }
6488 }
6490 /* Handle a "noreturn" attribute; arguments as in
6491 struct attribute_spec.handler. */
6493 static tree
6496 {
6499 /* See FIXME comment in c_common_attribute_table. */
6506 = build_pointer_type
6509 else
6510 {
6513 }
6516 }
6518 /* Handle a "hot" and attribute; arguments as in
6519 struct attribute_spec.handler. */
6521 static tree
6524 {
6527 {
6529 {
6533 }
6534 /* Most of the rest of the hot processing is done later with
6535 lookup_attribute. */
6536 }
6537 else
6538 {
6541 }
6544 }
6546 /* Handle a "cold" and attribute; arguments as in
6547 struct attribute_spec.handler. */
6549 static tree
6552 {
6555 {
6557 {
6561 }
6562 /* Most of the rest of the cold processing is done later with
6563 lookup_attribute. */
6564 }
6565 else
6566 {
6569 }
6572 }
6574 /* Handle a "no_sanitize_address" attribute; arguments as in
6575 struct attribute_spec.handler. */
6577 static tree
6580 {
6582 {
6585 }
6588 }
6590 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6591 struct attribute_spec.handler. */
6593 static tree
6596 {
6605 }
6607 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6608 struct attribute_spec.handler. */
6610 static tree
6613 {
6615 {
6618 }
6621 }
6623 /* Handle a "noinline" attribute; arguments as in
6624 struct attribute_spec.handler. */
6626 static tree
6630 {
6633 else
6634 {
6637 }
6640 }
6642 /* Handle a "noclone" attribute; arguments as in
6643 struct attribute_spec.handler. */
6645 static tree
6649 {
6651 {
6654 }
6657 }
6659 /* Handle a "always_inline" attribute; arguments as in
6660 struct attribute_spec.handler. */
6662 static tree
6667 {
6669 {
6670 /* Set the attribute and mark it for disregarding inline
6671 limits. */
6673 }
6674 else
6675 {
6678 }
6681 }
6683 /* Handle a "gnu_inline" attribute; arguments as in
6684 struct attribute_spec.handler. */
6686 static tree
6691 {
6693 {
6694 /* Do nothing else, just set the attribute. We'll get at
6695 it later with lookup_attribute. */
6696 }
6697 else
6698 {
6701 }
6704 }
6706 /* Handle a "leaf" attribute; arguments as in
6707 struct attribute_spec.handler. */
6709 static tree
6713 {
6715 {
6718 }
6720 {
6723 }
6726 }
6728 /* Handle an "artificial" attribute; arguments as in
6729 struct attribute_spec.handler. */
6731 static tree
6736 {
6738 {
6739 /* Do nothing else, just set the attribute. We'll get at
6740 it later with lookup_attribute. */
6741 }
6742 else
6743 {
6746 }
6749 }
6751 /* Handle a "flatten" attribute; arguments as in
6752 struct attribute_spec.handler. */
6754 static tree
6756 tree args ATTRIBUTE_UNUSED,
6758 {
6760 /* Do nothing else, just set the attribute. We'll get at
6761 it later with lookup_attribute. */
6762 ;
6763 else
6764 {
6767 }
6770 }
6772 /* Handle a "warning" or "error" attribute; arguments as in
6773 struct attribute_spec.handler. */
6775 static tree
6778 {
6781 /* Do nothing else, just set the attribute. We'll get at
6782 it later with lookup_attribute. */
6783 ;
6784 else
6785 {
6788 }
6791 }
6793 /* Handle a "used" attribute; arguments as in
6794 struct attribute_spec.handler. */
6796 static tree
6799 {
6805 {
6810 }
6811 else
6812 {
6815 }
6818 }
6820 /* Handle a "unused" attribute; arguments as in
6821 struct attribute_spec.handler. */
6823 static tree
6826 {
6828 {
6836 {
6841 }
6842 else
6843 {
6846 }
6847 }
6848 else
6849 {
6853 }
6856 }
6858 /* Handle a "externally_visible" attribute; arguments as in
6859 struct attribute_spec.handler. */
6861 static tree
6866 {
6870 {
6873 {
6877 }
6878 }
6879 else
6880 {
6883 }
6886 }
6888 /* Handle a "const" attribute; arguments as in
6889 struct attribute_spec.handler. */
6891 static tree
6894 {
6897 /* See FIXME comment on noreturn in c_common_attribute_table. */
6903 = build_pointer_type
6906 else
6907 {
6910 }
6913 }
6915 /* Handle a "transparent_union" attribute; arguments as in
6916 struct attribute_spec.handler. */
6918 static tree
6922 {
6923 tree type;
6934 {
6935 /* Make sure that the first field will work for a transparent union.
6936 If the type isn't complete yet, leave the check to the code in
6937 finish_struct. */
6939 {
6945 }
6948 {
6949 /* If the type isn't complete yet, setting the flag
6950 on a variant wouldn't ever be checked. */
6954 /* build_duplicate_type doesn't work for C++. */
6958 /* A type variant isn't good enough, since we don't a cast
6959 to such a type removed as a no-op. */
6961 }
6965 }
6967 ignored:
6970 }
6972 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6973 get the requested priority for a constructor or destructor,
6974 possibly issuing diagnostics for invalid or reserved
6975 priorities. */
6977 static priority_type
6979 {
6980 HOST_WIDE_INT pri;
6981 tree arg;
6987 {
6990 else
6993 }
7006 {
7009 "destructor priorities from 0 to %d are reserved "
7011 MAX_RESERVED_INIT_PRIORITY);
7012 else
7014 "constructor priorities from 0 to %d are reserved "
7016 MAX_RESERVED_INIT_PRIORITY);
7017 }
7020 invalid:
7023 MAX_INIT_PRIORITY);
7024 else
7026 MAX_INIT_PRIORITY);
7028 }
7030 /* Handle a "constructor" attribute; arguments as in
7031 struct attribute_spec.handler. */
7033 static tree
7037 {
7044 {
7045 priority_type priority;
7050 }
7051 else
7052 {
7055 }
7058 }
7060 /* Handle a "destructor" attribute; arguments as in
7061 struct attribute_spec.handler. */
7063 static tree
7067 {
7074 {
7075 priority_type priority;
7080 }
7081 else
7082 {
7085 }
7088 }
7090 /* Nonzero if the mode is a valid vector mode for this architecture.
7091 This returns nonzero even if there is no hardware support for the
7092 vector mode, but we can emulate with narrower modes. */
7094 static int
7096 {
7100 /* Doh! What's going on? */
7109 /* Hardware support. Woo hoo! */
7115 /* We should probably return 1 if requesting V4DI and we have no DI,
7116 but we have V2DI, but this is probably very unlikely. */
7118 /* If we have support for the inner mode, we can safely emulate it.
7119 We may not have V2DI, but me can emulate with a pair of DIs. */
7121 }
7124 /* Handle a "mode" attribute; arguments as in
7125 struct attribute_spec.handler. */
7127 static tree
7130 {
7138 else
7139 {
7144 tree typefm;
7149 {
7155 }
7157 /* Change this type to have a type with the specified mode.
7158 First check for the special modes. */
7171 else
7174 {
7177 }
7180 {
7183 }
7187 {
7219 }
7221 {
7224 }
7227 {
7232 {
7235 }
7239 else
7242 }
7243 else
7244 {
7245 /* For fixed-point modes, we need to test if the signness of type
7246 and the machine mode are consistent. */
7249 {
7252 }
7253 /* For fixed-point modes, we need to pass saturating info. */
7257 }
7260 {
7263 }
7265 {
7266 /* For enumeral types, copy the precision from the integer
7267 type returned above. If not an INTEGER_TYPE, we can't use
7268 this mode for this type. */
7270 {
7273 }
7276 {
7279 }
7280 else
7281 {
7282 /* We cannot build a type variant, as there's code that assumes
7283 that TYPE_MAIN_VARIANT has the same mode. This includes the
7284 debug generators. Instead, create a subrange type. This
7285 results in all of the enumeral values being emitted only once
7286 in the original, and the subtype gets them by reference. */
7289 else
7292 }
7293 }
7297 {
7300 }
7303 }
7306 }
7308 /* Handle a "section" attribute; arguments as in
7309 struct attribute_spec.handler. */
7311 static tree
7314 {
7318 {
7324 {
7328 {
7330 "section attribute cannot be specified for "
7333 }
7335 /* The decl may have already been given a section attribute
7336 from a previous declaration. Ensure they match. */
7340 {
7344 }
7348 {
7351 }
7352 else
7354 }
7355 else
7356 {
7359 }
7360 }
7361 else
7362 {
7366 }
7369 }
7371 /* Check whether ALIGN is a valid user-specified alignment. If so,
7372 return its base-2 log; if not, output an error and return -1. If
7373 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7374 no error. */
7375 int
7377 {
7382 {
7385 }
7390 {
7393 }
7395 {
7398 }
7400 }
7402 /*
7403 If in c++-11, check if the c++-11 alignment constraint with respect
7404 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7405 c++-11 mode, does nothing.
7407 [dcl.align]2/ says:
7409 [* if the constant expression evaluates to a fundamental alignment,
7410 the alignment requirement of the declared entity shall be the
7411 specified fundamental alignment.
7413 * if the constant expression evaluates to an extended alignment
7414 and the implementation supports that alignment in the context
7415 of the declaration, the alignment of the declared entity shall
7416 be that alignment
7418 * if the constant expression evaluates to an extended alignment
7419 and the implementation does not support that alignment in the
7420 context of the declaration, the program is ill-formed]. */
7422 static bool
7426 {
7439 {
7441 {
7442 /* For file scope variables and static members, the target
7443 supports alignments that are at most
7444 MAX_OFILE_ALIGNMENT. */
7447 }
7448 else
7449 {
7450 #ifdef BIGGEST_FIELD_ALIGNMENT
7451 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7452 #else
7453 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7454 #endif
7455 /* For non-static members, the target supports either
7456 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7457 if it is defined or BIGGEST_ALIGNMENT. */
7462 #undef MAX_TARGET_FIELD_ALIGNMENT
7463 /* For stack variables, the target supports at most
7464 MAX_STACK_ALIGNMENT. */
7468 }
7469 }
7471 {
7472 /* Let's be liberal for types. */
7475 }
7483 }
7485 /* Handle a "aligned" attribute; arguments as in
7486 struct attribute_spec.handler. */
7488 static tree
7491 {
7500 {
7504 }
7512 {
7515 /* If we have a TYPE_DECL, then copy the type, so that we
7516 don't accidentally modify a builtin type. See pushdecl. */
7519 {
7526 }
7527 else
7532 }
7535 {
7538 }
7541 /* C++-11 [dcl.align/4]:
7543 When multiple alignment-specifiers are specified for an
7544 entity, the alignment requirement shall be set to the
7545 strictest specified alignment.
7547 This formally comes from the c++11 specification but we are
7548 doing it for the GNU attribute syntax as well. */
7552 {
7557 else
7561 }
7562 else
7563 {
7566 }
7569 }
7571 /* Handle a "weak" attribute; arguments as in
7572 struct attribute_spec.handler. */
7574 static tree
7579 {
7582 {
7585 }
7587 {
7591 }
7595 else
7599 }
7601 /* Handle an "alias" or "ifunc" attribute; arguments as in
7602 struct attribute_spec.handler, except that IS_ALIAS tells us
7603 whether this is an alias as opposed to ifunc attribute. */
7605 static tree
7608 {
7613 {
7616 }
7620 /* A static variable declaration is always a tentative definition,
7621 but the alias is a non-tentative definition which overrides. */
7624 {
7628 }
7632 {
7636 }
7638 /* Note that the very first time we process a nested declaration,
7639 decl_function_context will not be set. Indeed, *would* never
7640 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7641 we do below. After such frobbery, pushdecl would set the context.
7642 In any case, this is never what we want. */
7644 {
7645 tree id;
7649 {
7653 }
7655 /* This counts as a use of the object pointed to. */
7660 else
7664 /* ifuncs are also aliases, so set that attribute too. */
7667 }
7668 else
7669 {
7672 }
7675 }
7677 /* Handle an "alias" or "ifunc" attribute; arguments as in
7678 struct attribute_spec.handler. */
7680 static tree
7683 {
7685 }
7687 /* Handle an "alias" or "ifunc" attribute; arguments as in
7688 struct attribute_spec.handler. */
7690 static tree
7693 {
7695 }
7697 /* Handle a "weakref" attribute; arguments as in struct
7698 attribute_spec.handler. */
7700 static tree
7703 {
7706 /* We must ignore the attribute when it is associated with
7707 local-scoped decls, since attribute alias is ignored and many
7708 such symbols do not even have a DECL_WEAK field. */
7710 || current_function_decl
7712 {
7716 }
7719 {
7723 }
7725 /* The idea here is that `weakref("name")' mutates into `weakref,
7726 alias("name")', and weakref without arguments, in turn,
7727 implicitly adds weak. */
7730 {
7737 }
7738 else
7739 {
7744 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7745 and that isn't supported; and because it wants to add it to
7746 the list of weak decls, which isn't helpful. */
7748 }
7751 }
7753 /* Handle an "visibility" attribute; arguments as in
7754 struct attribute_spec.handler. */
7756 static tree
7760 {
7766 {
7770 {
7772 name);
7774 }
7776 {
7780 }
7781 }
7783 {
7786 }
7789 {
7792 }
7794 /* If this is a type, set the visibility on the type decl. */
7796 {
7801 {
7803 name);
7805 }
7806 }
7816 else
7817 {
7818 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7820 }
7824 {
7838 }
7843 /* Go ahead and attach the attribute to the node as well. This is needed
7844 so we can determine whether we have VISIBILITY_DEFAULT because the
7845 visibility was not specified, or because it was explicitly overridden
7846 from the containing scope. */
7849 }
7851 /* Determine the ELF symbol visibility for DECL, which is either a
7852 variable or a function. It is an error to use this function if a
7853 definition of DECL is not available in this translation unit.
7854 Returns true if the final visibility has been determined by this
7855 function; false if the caller is free to make additional
7856 modifications. */
7858 bool
7860 {
7864 /* If the user explicitly specified the visibility with an
7865 attribute, honor that. DECL_VISIBILITY will have been set during
7866 the processing of the attribute. We check for an explicit
7867 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7868 to distinguish the use of an attribute from the use of a "#pragma
7869 GCC visibility push(...)"; in the latter case we still want other
7870 considerations to be able to overrule the #pragma. */
7872 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7877 /* Set default visibility to whatever the user supplied with
7878 visibility_specified depending on #pragma GCC visibility. */
7880 {
7883 {
7886 /* If visibility changed and DECL already has DECL_RTL, ensure
7887 symbol flags are updated. */
7892 }
7893 }
7895 }
7897 /* Handle an "tls_model" attribute; arguments as in
7898 struct attribute_spec.handler. */
7900 static tree
7903 {
7904 tree id;
7911 {
7914 }
7919 {
7922 }
7932 else
7933 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7937 }
7939 /* Handle a "no_instrument_function" attribute; arguments as in
7940 struct attribute_spec.handler. */
7942 static tree
7947 {
7951 {
7955 }
7957 {
7961 }
7962 else
7966 }
7968 /* Handle a "malloc" attribute; arguments as in
7969 struct attribute_spec.handler. */
7971 static tree
7974 {
7978 else
7979 {
7982 }
7985 }
7987 /* Handle a "alloc_size" attribute; arguments as in
7988 struct attribute_spec.handler. */
7990 static tree
7993 {
7996 {
8003 {
8008 }
8009 }
8011 }
8013 /* Handle a "fn spec" attribute; arguments as in
8014 struct attribute_spec.handler. */
8016 static tree
8020 {
8025 }
8027 /* Handle a "bnd_variable_size" attribute; arguments as in
8028 struct attribute_spec.handler. */
8030 static tree
8033 {
8035 {
8038 }
8041 }
8043 /* Handle a "bnd_legacy" attribute; arguments as in
8044 struct attribute_spec.handler. */
8046 static tree
8049 {
8051 {
8054 }
8057 }
8059 /* Handle a "warn_unused" attribute; arguments as in
8060 struct attribute_spec.handler. */
8062 static tree
8064 tree args ATTRIBUTE_UNUSED,
8066 {
8068 /* Do nothing else, just set the attribute. We'll get at
8069 it later with lookup_attribute. */
8070 ;
8071 else
8072 {
8075 }
8078 }
8080 /* Handle an "omp declare simd" attribute; arguments as in
8081 struct attribute_spec.handler. */
8083 static tree
8085 {
8087 }
8089 /* Handle an "omp declare target" attribute; arguments as in
8090 struct attribute_spec.handler. */
8092 static tree
8094 {
8096 }
8098 /* Handle a "returns_twice" attribute; arguments as in
8099 struct attribute_spec.handler. */
8101 static tree
8104 {
8107 else
8108 {
8111 }
8114 }
8116 /* Handle a "no_limit_stack" attribute; arguments as in
8117 struct attribute_spec.handler. */
8119 static tree
8124 {
8128 {
8132 }
8134 {
8138 }
8139 else
8143 }
8145 /* Handle a "pure" attribute; arguments as in
8146 struct attribute_spec.handler. */
8148 static tree
8151 {
8154 /* ??? TODO: Support types. */
8155 else
8156 {
8159 }
8162 }
8164 /* Digest an attribute list destined for a transactional memory statement.
8165 ALLOWED is the set of attributes that are allowed for this statement;
8166 return the attribute we parsed. Multiple attributes are never allowed. */
8168 int
8170 {
8175 {
8183 {
8186 }
8189 {
8192 }
8195 else
8197 }
8200 }
8202 /* Transform a TM attribute name into a maskable integer and back.
8203 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8204 to how the lack of an attribute is treated. */
8206 int
8208 {
8222 }
8224 tree
8226 {
8229 {
8247 }
8249 }
8251 /* Return the first TM attribute seen in LIST. */
8253 tree
8255 {
8257 {
8261 }
8263 }
8265 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8266 Here we accept only function types, and verify that none of the other
8267 function TM attributes are also applied. */
8268 /* ??? We need to accept class types for C++, but not C. This greatly
8269 complicates this function, since we can no longer rely on the extra
8270 processing given by function_type_required. */
8272 static tree
8275 {
8276 /* Only one path adds the attribute; others don't. */
8280 {
8283 /* Only tm_callable and tm_safe apply to classes. */
8286 /* FALLTHRU */
8290 {
8293 ;
8296 else
8298 }
8302 {
8305 {
8310 }
8311 }
8312 /* FALLTHRU */
8315 /* If a function is next, pass it on to be tried next. */
8319 ignored:
8322 }
8325 }
8327 /* Handle the TM_WRAP attribute; arguments as in
8328 struct attribute_spec.handler. */
8330 static tree
8333 {
8336 /* We don't need the attribute even on success, since we
8337 record the entry in an external table. */
8342 else
8343 {
8349 else
8350 {
8354 {
8358 else
8360 }
8361 else
8363 }
8364 }
8367 }
8369 /* Ignore the given attribute. Used when this attribute may be usefully
8370 overridden by the target, but is not used generically. */
8372 static tree
8376 {
8379 }
8381 /* Handle a "no vops" attribute; arguments as in
8382 struct attribute_spec.handler. */
8384 static tree
8388 {
8392 }
8394 /* Handle a "deprecated" attribute; arguments as in
8395 struct attribute_spec.handler. */
8397 static tree
8401 {
8409 {
8412 }
8415 {
8426 else
8428 }
8430 {
8435 }
8436 else
8440 {
8443 {
8449 }
8452 else
8454 }
8457 }
8459 /* Handle a "vector_size" attribute; arguments as in
8460 struct attribute_spec.handler. */
8462 static tree
8466 {
8476 {
8479 }
8481 /* Get the vector size (in bytes). */
8484 /* We need to provide for vector pointers, vector arrays, and
8485 functions returning vectors. For example:
8487 __attribute__((vector_size(16))) short *foo;
8489 In this case, the mode is SI, but the type being modified is
8490 HI, so we need to look further. */
8499 /* Get the mode of the type being modified. */
8510 {
8513 }
8516 {
8519 }
8522 {
8525 }
8527 /* Calculate how many units fit in the vector. */
8530 {
8533 }
8537 /* Build back pointers if needed. */
8541 }
8543 /* Handle the "nonnull" attribute. */
8544 static tree
8548 {
8552 /* If no arguments are specified, all pointer arguments should be
8553 non-null. Verify a full prototype is given so that the arguments
8554 will have the correct types when we actually check them later. */
8556 {
8558 {
8561 }
8563 }
8565 /* Argument list specified. Verify that each argument number references
8566 a pointer argument. */
8568 {
8572 {
8577 }
8580 {
8581 function_args_iterator iter;
8582 tree argument;
8586 {
8590 }
8594 {
8599 }
8602 {
8607 }
8608 }
8609 }
8612 }
8614 /* Check the argument list of a function call for null in argument slots
8615 that are marked as requiring a non-null pointer argument. The NARGS
8616 arguments are passed in the array ARGARRAY.
8617 */
8619 static void
8621 {
8622 tree a;
8630 /* See if any of the nonnull attributes has no arguments. If so,
8631 then every pointer argument is checked (in which case the check
8632 for pointer type is done in check_nonnull_arg). */
8634 do
8642 else
8643 {
8644 /* Walk the argument list. If we encounter an argument number we
8645 should check for non-null, do it. */
8647 {
8649 {
8653 }
8658 }
8659 }
8660 }
8662 /* Check that the Nth argument of a function call (counting backwards
8663 from the end) is a (pointer)0. The NARGS arguments are passed in the
8664 array ARGARRAY. */
8666 static void
8668 {
8672 {
8675 tree sentinel;
8676 function_args_iterator iter;
8677 tree t;
8679 /* Skip over the named arguments. */
8681 {
8684 len++;
8685 }
8688 {
8691 }
8693 /* The sentinel must be one of the varargs, i.e.
8694 in position >= the number of fixed arguments. */
8696 {
8700 }
8702 /* Validate the sentinel. */
8706 /* Although __null (in C++) is only an integer we allow it
8707 nevertheless, as we are guaranteed that it's exactly
8708 as wide as a pointer, and we don't want to force
8709 users to cast the NULL they have written there.
8710 We warn with -Wstrict-null-sentinel, though. */
8713 }
8714 }
8716 /* Helper for check_function_nonnull; given a list of operands which
8717 must be non-null in ARGS, determine if operand PARAM_NUM should be
8718 checked. */
8720 static bool
8722 {
8726 {
8733 }
8735 }
8737 /* Check that the function argument PARAM (which is operand number
8738 PARAM_NUM) is non-null. This is called by check_function_nonnull
8739 via check_function_arguments_recurse. */
8741 static void
8744 {
8745 /* Just skip checking the argument if it's not a pointer. This can
8746 happen if the "nonnull" attribute was given without an operand
8747 list (which means to check every pointer argument). */
8755 }
8757 /* Helper for nonnull attribute handling; fetch the operand number
8758 from the attribute argument list. */
8760 static bool
8762 {
8763 /* Verify the arg number is a constant. */
8770 }
8772 /* Handle a "nothrow" attribute; arguments as in
8773 struct attribute_spec.handler. */
8775 static tree
8778 {
8781 /* ??? TODO: Support types. */
8782 else
8783 {
8786 }
8789 }
8791 /* Handle a "cleanup" attribute; arguments as in
8792 struct attribute_spec.handler. */
8794 static tree
8797 {
8801 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8802 for global destructors in C++. This requires infrastructure that
8803 we don't have generically at the moment. It's also not a feature
8804 we'd be missing too much, since we do have attribute constructor. */
8806 {
8810 }
8812 /* Verify that the argument is a function in scope. */
8813 /* ??? We could support pointers to functions here as well, if
8814 that was considered desirable. */
8817 {
8821 }
8824 {
8828 }
8830 /* That the function has proper type is checked with the
8831 eventual call to build_function_call. */
8834 }
8836 /* Handle a "warn_unused_result" attribute. No special handling. */
8838 static tree
8842 {
8843 /* Ignore the attribute for functions not returning any value. */
8845 {
8848 }
8851 }
8853 /* Handle a "sentinel" attribute. */
8855 static tree
8858 {
8860 {
8864 }
8865 else
8866 {
8868 {
8872 }
8873 }
8876 {
8880 {
8884 }
8885 else
8886 {
8888 {
8892 }
8893 }
8894 }
8897 }
8899 /* Handle a "type_generic" attribute. */
8901 static tree
8905 {
8906 /* Ensure we have a function type. */
8909 /* Ensure we have a variadic function. */
8913 }
8915 /* Handle a "target" attribute. */
8917 static tree
8920 {
8921 /* Ensure we have a function type. */
8923 {
8926 }
8928 flags))
8932 }
8934 /* Arguments being collected for optimization. */
8939 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8940 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8941 false for #pragma GCC optimize. */
8943 bool
8945 {
8953 tree ap;
8955 /* Build up argv vector. Just in case the string is stored away, use garbage
8956 collected strings. */
8961 {
8965 {
8969 }
8972 {
8973 /* Split string into multiple substrings. */
8981 {
8988 {
8992 }
8993 else
8994 {
8997 }
9001 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9002 options. */
9004 {
9009 else
9013 }
9016 {
9019 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9020 itself is -Os, and any other switch begins with a -f. */
9026 }
9031 }
9033 }
9034 }
9044 /* Now parse the options. */
9054 /* Don't allow changing -fstrict-aliasing. */
9059 }
9061 /* For handling "optimize" attribute. arguments as in
9062 struct attribute_spec.handler. */
9064 static tree
9067 {
9068 /* Ensure we have a function type. */
9070 {
9073 }
9074 else
9075 {
9079 /* Save current options. */
9082 /* If we previously had some optimization options, use them as the
9083 default. */
9088 /* Parse options, and update the vector. */
9093 /* Restore current options. */
9095 }
9098 }
9100 /* Handle a "no_split_stack" attribute. */
9102 static tree
9107 {
9111 {
9115 }
9117 {
9121 }
9124 }
9126 /* Handle a "returns_nonnull" attribute; arguments as in
9127 struct attribute_spec.handler. */
9129 static tree
9132 {
9133 // Even without a prototype we still have a return type we can check.
9135 {
9138 }
9140 }
9142 \f
9143 /* Check for valid arguments being passed to a function with FNTYPE.
9144 There are NARGS arguments in the array ARGARRAY. */
9145 void
9147 {
9148 /* Check for null being passed in a pointer argument that must be
9149 non-null. We also need to do this if format checking is enabled. */
9154 /* Check for errors in format strings. */
9161 }
9163 /* Generic argument checking recursion routine. PARAM is the argument to
9164 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9165 once the argument is resolved. CTX is context for the callback. */
9166 void
9171 {
9175 {
9176 /* Strip coercion. */
9180 }
9183 {
9185 tree attrs;
9188 /* See if this is a call to a known internationalization function
9189 that modifies a format arg. Such a function may have multiple
9190 format_arg attributes (for example, ngettext). */
9193 attrs;
9196 {
9197 tree inner_arg;
9198 tree format_num_expr;
9201 call_expr_arg_iterator iter;
9203 /* Extract the argument number, which was previously checked
9204 to be valid. */
9216 {
9221 }
9222 }
9224 /* If we found a format_arg attribute and did a recursive check,
9225 we are done with checking this argument. Otherwise, we continue
9226 and this will be considered a non-literal. */
9229 }
9232 {
9233 /* Check both halves of the conditional expression. */
9239 }
9242 }
9244 /* Checks for a builtin function FNDECL that the number of arguments
9245 NARGS against the required number REQUIRED and issues an error if
9246 there is a mismatch. Returns true if the number of arguments is
9247 correct, otherwise false. */
9249 static bool
9251 {
9253 {
9257 }
9259 {
9263 }
9265 }
9267 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9268 Returns false if there was an error, otherwise true. */
9270 bool
9272 {
9278 {
9288 {
9290 {
9294 }
9296 }
9306 {
9313 {
9317 }
9319 }
9324 {
9329 {
9333 }
9336 {
9338 fndecl);
9340 }
9342 }
9347 {
9349 {
9352 }
9354 }
9359 }
9360 }
9362 /* Function to help qsort sort FIELD_DECLs by name order. */
9364 int
9366 {
9371 /* A nontype is "greater" than a type. */
9380 }
9383 gt_pointer_operator new_value;
9387 /* This routine compares two fields like field_decl_cmp but using the
9388 pointer operator in resort_data. */
9390 static int
9392 {
9397 /* A nontype is "greater" than a type. */
9403 {
9410 }
9412 }
9414 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9416 void
9419 gt_pointer_operator new_value,
9421 {
9426 resort_field_decl_cmp);
9427 }
9429 /* Subroutine of c_parse_error.
9430 Return the result of concatenating LHS and RHS. RHS is really
9431 a string literal, its first character is indicated by RHS_START and
9432 RHS_SIZE is its length (including the terminating NUL character).
9434 The caller is responsible for deleting the returned pointer. */
9438 {
9444 }
9446 /* Issue the error given by GMSGID, indicating that it occurred before
9447 TOKEN, which had the associated VALUE. */
9449 void
9452 {
9453 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9463 {
9468 {
9481 }
9485 else
9491 }
9513 {
9518 }
9526 {
9531 }
9532 else
9536 {
9539 }
9540 #undef catenate_messages
9541 }
9543 /* Mapping for cpp message reasons to the options that enable them. */
9545 struct reason_option_codes_t
9546 {
9549 };
9569 };
9571 /* Return the gcc option code associated with the reason for a cpp
9572 message, or 0 if none. */
9574 static int
9576 {
9580 {
9583 }
9585 }
9587 /* Callback from cpp_error for PFILE to print diagnostics from the
9588 preprocessor. The diagnostic is of type LEVEL, with REASON set
9589 to the reason code if LEVEL is represents a warning, at location
9590 LOCATION unless this is after lexing and the compiler's location
9591 should be used instead, with column number possibly overridden by
9592 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9593 the arguments. Returns true if a diagnostic was emitted, false
9594 otherwise. */
9596 bool
9600 {
9601 diagnostic_info diagnostic;
9602 diagnostic_t dlevel;
9607 {
9612 /* Fall through. */
9637 }
9650 }
9652 /* Convert a character from the host to the target execution character
9653 set. cpplib handles this, mostly. */
9655 HOST_WIDE_INT
9657 {
9658 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9659 zero-extended under -fno-signed-char. cpplib insists that characters
9660 and character constants are always unsigned. Hence we must convert
9661 back and forth. */
9669 else
9671 }
9673 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9674 references with an INDIRECT_REF of a constant at the bottom; much like the
9675 traditional rendering of offsetof as a macro. Return the folded result. */
9677 tree
9679 {
9683 {
9699 {
9702 }
9712 {
9716 }
9730 /* Check if the offset goes beyond the upper bound of the array. */
9732 {
9738 {
9742 {
9743 tree v;
9750 {
9758 }
9759 /* Don't warn if the array might be considered a poor
9760 man's flexible array member with a very permissive
9761 definition thereof. */
9765 "index %E denotes an offset "
9768 }
9769 }
9770 }
9777 /* Handle static members of volatile structs. */
9784 }
9787 }
9789 /* Likewise, but convert it to the return type of offsetof. */
9791 tree
9793 {
9795 }
9797 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9798 expression, because B will always be true. */
9800 void
9802 {
9805 "the omitted middle operand in ?: will always be %<true%>, "
9807 }
9809 /* Give an error for storing into ARG, which is 'const'. USE indicates
9810 how ARG was being used. */
9812 void
9814 {
9817 /* Using this macro rather than (for example) arrays of messages
9818 ensures that all the format strings are checked at compile
9819 time. */
9820 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9821 : (use == lv_increment ? (I) \
9822 : (use == lv_decrement ? (D) : (AS))))
9824 {
9835 else
9841 }
9847 arg);
9853 arg);
9855 {
9865 arg);
9866 }
9872 arg);
9873 else
9878 arg);
9879 }
9881 /* Print an error message for an invalid lvalue. USE says
9882 how the lvalue is being used and so selects the error message. LOC
9883 is the location for the error. */
9885 void
9887 {
9889 {
9907 }
9908 }
9910 /* Print an error message for an invalid indirection of type TYPE.
9911 ERRSTRING is the name of the operator for the indirection. */
9913 void
9915 {
9917 {
9925 type);
9930 type);
9935 type);
9940 type);
9945 type);
9949 }
9950 }
9951 \f
9952 /* *PTYPE is an incomplete array. Complete it with a domain based on
9953 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9954 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9955 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9957 int
9959 {
9967 {
9969 {
9970 int eltsize
9973 }
9975 {
9979 {
9983 }
9984 else
9985 {
9986 tree curindex;
9997 {
10001 else
10002 {
10004 {
10005 /* Since we treat size types now as ordinary
10006 unsigned types, we need an explicit overflow
10007 check. */
10011 }
10013 size_one_node);
10014 }
10017 }
10019 {
10023 }
10024 }
10025 }
10026 else
10027 {
10028 /* Make an error message unless that happened already. */
10031 }
10032 }
10033 else
10034 {
10038 }
10045 else
10048 /* Using build_distinct_type_copy and modifying things afterward instead
10049 of using build_array_type to create a new type preserves all of the
10050 TYPE_LANG_FLAG_? bits that the front end may have set. */
10058 /* Make sure we have the canonical MAIN_TYPE. */
10061 hashcode);
10064 /* Fix the canonical type. */
10074 else
10079 else
10085 {
10087 /* If we proceed with the array type as it is, we'll eventually
10088 crash in tree_low_cst(). */
10090 }
10094 }
10096 /* Like c_mark_addressable but don't check register qualifier. */
10097 void
10099 {
10105 }
10108 \f
10109 /* Used to help initialize the builtin-types.def table. When a type of
10110 the correct size doesn't exist, use error_mark_node instead of NULL.
10111 The later results in segfaults even when a decl using the type doesn't
10112 get invoked. */
10114 tree
10116 {
10119 }
10121 /* A helper function for resolve_overloaded_builtin in resolving the
10122 overloaded __sync_ builtins. Returns a positive power of 2 if the
10123 first operand of PARAMS is a pointer to a supported data type.
10124 Returns 0 if an error is encountered. */
10126 static int
10128 {
10129 tree type;
10133 {
10136 }
10150 incompatible:
10153 }
10155 /* A helper function for resolve_overloaded_builtin. Adds casts to
10156 PARAMS to make arguments match up with those of FUNCTION. Drops
10157 the variadic arguments at the end. Returns false if some error
10158 was encountered; true on success. */
10160 static bool
10163 {
10164 function_args_iterator iter;
10165 tree ptype;
10169 /* We've declared the implementation functions to use "volatile void *"
10170 as the pointer parameter, so we shouldn't get any complaints from the
10171 call to check_function_arguments what ever type the user used. */
10175 /* For the rest of the values, we need to cast these to FTYPE, so that we
10176 don't get warnings for passing pointer types, etc. */
10179 {
10183 /* XXX void_type_node belies the abstraction. */
10189 {
10192 }
10194 /* Only convert parameters if arg_type is unsigned integer type with
10195 new format sync routines, i.e. don't attempt to convert pointer
10196 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10197 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10198 kinds). */
10200 {
10201 /* Ideally for the first conversion we'd use convert_for_assignment
10202 so that we get warnings for anything that doesn't match the pointer
10203 type. This isn't portable across the C and C++ front ends atm. */
10208 }
10211 }
10213 /* __atomic routines are not variadic. */
10215 {
10218 }
10220 /* The definition of these primitives is variadic, with the remaining
10221 being "an optional list of variables protected by the memory barrier".
10222 No clue what that's supposed to mean, precisely, but we consider all
10223 call-clobbered variables to be protected so we're safe. */
10227 }
10229 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10230 RESULT to make it match the type of the first pointer argument in
10231 PARAMS. */
10233 static tree
10235 {
10240 /* New format doesn't require casting unless the types are the same size. */
10243 else
10245 }
10247 /* This function verifies the PARAMS to generic atomic FUNCTION.
10248 It returns the size if all the parameters are the same size, otherwise
10249 0 is returned if the parameters are invalid. */
10251 static int
10254 {
10259 tree type_0;
10261 /* Determine the parameter makeup. */
10263 {
10279 }
10282 {
10285 }
10287 /* Get type of first parameter, and determine its size. */
10290 {
10292 function);
10294 }
10296 /* Types must be compile time constant sizes. */
10298 {
10301 function);
10303 }
10307 /* Zero size objects are not allowed. */
10309 {
10312 function);
10314 }
10316 /* Check each other parameter is a pointer and the same size. */
10318 {
10321 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10325 {
10327 function);
10329 }
10332 {
10334 function);
10336 }
10337 }
10339 /* Check memory model parameters for validity. */
10341 {
10344 {
10347 {
10350 function);
10351 }
10352 }
10353 else
10355 {
10357 function);
10359 }
10360 }
10363 }
10366 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10367 at the beginning of the parameter list PARAMS representing the size of the
10368 objects. This is to match the library ABI requirement. LOC is the location
10369 of the function call.
10370 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10371 returned to allow the external call to be constructed. */
10373 static tree
10376 {
10377 tree size_node;
10379 /* Insert a SIZE_T parameter as the first param. If there isn't
10380 enough space, allocate a new vector and recursively re-build with that. */
10382 {
10385 tree f;
10394 }
10396 /* Add the size parameter and leave as a function call for processing. */
10400 }
10403 /* This will process an __atomic_exchange function call, determine whether it
10404 needs to be mapped to the _N variation, or turned into a library call.
10405 LOC is the location of the builtin call.
10406 FUNCTION is the DECL that has been invoked;
10407 PARAMS is the argument list for the call. The return value is non-null
10408 TRUE is returned if it is translated into the proper format for a call to the
10409 external library, and NEW_RETURN is set the tree for that function.
10410 FALSE is returned if processing for the _N variation is required, and
10411 NEW_RETURN is set to the the return value the result is copied into. */
10412 static bool
10415 {
10420 /* Size of 0 is an error condition. */
10422 {
10425 }
10427 /* If not a lock-free size, change to the library generic format. */
10429 {
10432 }
10434 /* Otherwise there is a lockfree match, transform the call from:
10435 void fn(T* mem, T* desired, T* return, model)
10436 into
10437 *return = (T) (fn (In* mem, (In) *desired, model)) */
10444 /* Create pointer to appropriate size. */
10448 /* Convert object pointer to required type. */
10451 /* Convert new value to required type, and dereference it. */
10456 /* Move memory model to the 3rd position, and end param list. */
10460 /* Convert return pointer and dereference it for later assignment. */
10464 }
10467 /* This will process an __atomic_compare_exchange function call, determine
10468 whether it needs to be mapped to the _N variation, or turned into a lib call.
10469 LOC is the location of the builtin call.
10470 FUNCTION is the DECL that has been invoked;
10471 PARAMS is the argument list for the call. The return value is non-null
10472 TRUE is returned if it is translated into the proper format for a call to the
10473 external library, and NEW_RETURN is set the tree for that function.
10474 FALSE is returned if processing for the _N variation is required. */
10476 static bool
10480 {
10485 /* Size of 0 is an error condition. */
10487 {
10490 }
10492 /* If not a lock-free size, change to the library generic format. */
10494 {
10495 /* The library generic format does not have the weak parameter, so
10496 remove it from the param list. Since a parameter has been removed,
10497 we can be sure that there is room for the SIZE_T parameter, meaning
10498 there will not be a recursive rebuilding of the parameter list, so
10499 there is no danger this will be done twice. */
10501 {
10505 }
10508 }
10510 /* Otherwise, there is a match, so the call needs to be transformed from:
10511 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10512 into
10513 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10519 /* Create pointer to appropriate size. */
10523 /* Convert object pointer to required type. */
10527 /* Convert expected pointer to required type. */
10531 /* Convert desired value to required type, and dereference it. */
10536 /* The rest of the parameters are fine. NULL means no special return value
10537 processing.*/
10540 }
10543 /* This will process an __atomic_load function call, determine whether it
10544 needs to be mapped to the _N variation, or turned into a library call.
10545 LOC is the location of the builtin call.
10546 FUNCTION is the DECL that has been invoked;
10547 PARAMS is the argument list for the call. The return value is non-null
10548 TRUE is returned if it is translated into the proper format for a call to the
10549 external library, and NEW_RETURN is set the tree for that function.
10550 FALSE is returned if processing for the _N variation is required, and
10551 NEW_RETURN is set to the the return value the result is copied into. */
10553 static bool
10556 {
10561 /* Size of 0 is an error condition. */
10563 {
10566 }
10568 /* If not a lock-free size, change to the library generic format. */
10570 {
10573 }
10575 /* Otherwise, there is a match, so the call needs to be transformed from:
10576 void fn(T* mem, T* return, model)
10577 into
10578 *return = (T) (fn ((In *) mem, model)) */
10584 /* Create pointer to appropriate size. */
10588 /* Convert object pointer to required type. */
10592 /* Move memory model to the 2nd position, and end param list. */
10596 /* Convert return pointer and dereference it for later assignment. */
10600 }
10603 /* This will process an __atomic_store function call, determine whether it
10604 needs to be mapped to the _N variation, or turned into a library call.
10605 LOC is the location of the builtin call.
10606 FUNCTION is the DECL that has been invoked;
10607 PARAMS is the argument list for the call. The return value is non-null
10608 TRUE is returned if it is translated into the proper format for a call to the
10609 external library, and NEW_RETURN is set the tree for that function.
10610 FALSE is returned if processing for the _N variation is required, and
10611 NEW_RETURN is set to the the return value the result is copied into. */
10613 static bool
10616 {
10621 /* Size of 0 is an error condition. */
10623 {
10626 }
10628 /* If not a lock-free size, change to the library generic format. */
10630 {
10633 }
10635 /* Otherwise, there is a match, so the call needs to be transformed from:
10636 void fn(T* mem, T* value, model)
10637 into
10638 fn ((In *) mem, (In) *value, model) */
10643 /* Create pointer to appropriate size. */
10647 /* Convert object pointer to required type. */
10651 /* Convert new value to required type, and dereference it. */
10656 /* The memory model is in the right spot already. Return is void. */
10660 }
10663 /* Some builtin functions are placeholders for other expressions. This
10664 function should be called immediately after parsing the call expression
10665 before surrounding code has committed to the type of the expression.
10667 LOC is the location of the builtin call.
10669 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10670 PARAMS is the argument list for the call. The return value is non-null
10671 when expansion is complete, and null if normal processing should
10672 continue. */
10674 tree
10677 {
10683 {
10689 else
10693 }
10695 /* Handle BUILT_IN_NORMAL here. */
10697 {
10702 {
10703 /* Handle these 4 together so that they can fall through to the next
10704 case if the call is transformed to an _N variant. */
10706 {
10708 {
10712 /* Change to the _N variant. */
10715 }
10718 {
10720 params,
10723 /* Change to the _N variant. */
10726 }
10728 {
10732 /* Change to the _N variant. */
10735 }
10737 {
10741 /* Change to the _N variant. */
10744 }
10747 }
10748 /* Fallthrough to the normal processing. */
10749 }
10766 {
10768 /* Fallthru for parameter processing. */
10769 }
10786 {
10797 orig_format))
10809 /* If new_return is set, assign function to that expr and cast the
10810 result to void since the generic interface returned void. */
10812 {
10813 /* Cast function result from I{1,2,4,8,16} to the required type. */
10816 result);
10820 }
10822 }
10826 }
10827 }
10829 /* vector_types_compatible_elements_p is used in type checks of vectors
10830 values used as operands of binary operators. Where it returns true, and
10831 the other checks of the caller succeed (being vector types in he first
10832 place, and matching number of elements), we can just treat the types
10833 as essentially the same.
10834 Contrast with vector_targets_convertible_p, which is used for vector
10835 pointer types, and vector_types_convertible_p, which will allow
10836 language-specific matches under the control of flag_lax_vector_conversions,
10837 and might still require a conversion. */
10838 /* True if vector types T1 and T2 can be inputs to the same binary
10839 operator without conversion.
10840 We don't check the overall vector size here because some of our callers
10841 want to give different error messages when the vectors are compatible
10842 except for the element count. */
10844 bool
10846 {
10859 /* Equality works here because c_common_signed_type uses
10860 TYPE_MAIN_VARIANT. */
10868 }
10870 /* Check for missing format attributes on function pointers. LTYPE is
10871 the new type or left-hand side type. RTYPE is the old type or
10872 right-hand side type. Returns TRUE if LTYPE is missing the desired
10873 attribute. */
10875 bool
10877 {
10879 tree ra;
10885 {
10886 tree la;
10891 }
10892 else
10894 }
10896 /* Subscripting with type char is likely to lose on a machine where
10897 chars are signed. So warn on any machine, but optionally. Don't
10898 warn for unsigned char since that type is safe. Don't warn for
10899 signed char because anyone who uses that must have done so
10900 deliberately. Furthermore, we reduce the false positive load by
10901 warning only for non-constant value of type char. */
10903 void
10905 {
10909 }
10911 /* Implement -Wparentheses for the unexpected C precedence rules, to
10912 cover cases like x + y << z which readers are likely to
10913 misinterpret. We have seen an expression in which CODE is a binary
10914 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10915 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10916 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10917 expression was not formed using a binary or unary operator, or it
10918 was enclosed in parentheses. */
10920 void
10924 {
10928 /* This macro tests that the expression ARG with original tree code
10929 CODE appears to be a boolean expression. or the result of folding a
10930 boolean expression. */
10931 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10932 (truth_value_p (TREE_CODE (ARG)) \
10933 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10935 || ((CODE) != INTEGER_CST \
10936 && (integer_onep (ARG) || integer_zerop (ARG))))
10939 {
10988 /* Check cases like x|y==z */
10995 /* Check cases like !x | y */
10999 "suggest parentheses around operand of "
11012 /* Check cases like x^y==z */
11034 /* Check cases like x&y==z */
11041 /* Check cases like !x & y */
11045 "suggest parentheses around operand of "
11068 {
11073 "comparisons like %<X<=Y<=Z%> do not "
11079 "comparisons like %<X<=Y<=Z%> do not "
11081 }
11083 }
11084 #undef NOT_A_BOOLEAN_EXPR_P
11085 }
11087 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11089 void
11091 {
11093 {
11096 else
11098 }
11099 }
11101 /* Warn for division by zero according to the value of DIVISOR. LOC
11102 is the location of the division operator. */
11104 void
11106 {
11107 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11108 about division by zero. Do not issue a warning if DIVISOR has a
11109 floating-point type, since we consider 0.0/0.0 a valid way of
11110 generating a NaN. */
11114 }
11116 /* Subroutine of build_binary_op. Give warnings for comparisons
11117 between signed and unsigned quantities that may fail. Do the
11118 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11119 so that casts will be considered, but default promotions won't
11120 be.
11122 LOCATION is the location of the comparison operator.
11124 The arguments of this function map directly to local variables
11125 of build_binary_op. */
11127 void
11132 {
11137 /* In C++, check for comparison of different enum types. */
11143 {
11147 }
11149 /* Do not warn if the comparison is being done in a signed type,
11150 since the signed type will only be chosen if it can represent
11151 all the values of the unsigned type. */
11154 /* Do not warn if both operands are unsigned. */
11157 else
11158 {
11164 else
11172 /* Do not warn if the signed quantity is an unsuffixed integer
11173 literal (or some static constant expression involving such
11174 literals or a conditional expression involving such literals)
11175 and it is non-negative. */
11178 /* Do not warn if the comparison is an equality operation, the
11179 unsigned quantity is an integral constant, and it would fit
11180 in the result if the result were signed. */
11185 /* In C, do not warn if the unsigned quantity is an enumeration
11186 constant and its maximum value would fit in the result if the
11187 result were signed. */
11193 else
11195 OPT_Wsign_compare,
11197 }
11199 /* Warn if two unsigned values are being compared in a size larger
11200 than their original size, and one (and only one) is the result of
11201 a `~' operator. This comparison will always fail.
11203 Also warn if one operand is a constant, and the constant does not
11204 have all bits set that are set in the ~ operand when it is
11205 extended. */
11212 {
11219 {
11220 tree primop;
11226 {
11230 }
11231 else
11232 {
11236 }
11241 {
11244 {
11248 else
11251 }
11252 }
11253 }
11261 }
11262 }
11264 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11265 type via c_common_type. If -Wdouble-promotion is in use, and the
11266 conditions for warning have been met, issue a warning. GMSGID is
11267 the warning message. It must have two %T specifiers for the type
11268 that was converted (generally "float") and the type to which it was
11269 converted (generally "double), respectively. LOC is the location
11270 to which the awrning should refer. */
11272 void
11275 {
11276 tree source_type;
11280 /* If the conversion will not occur at run-time, there is no need to
11281 warn about it. */
11293 else
11296 }
11298 /* Setup a TYPE_DECL node as a typedef representation.
11300 X is a TYPE_DECL for a typedef statement. Create a brand new
11301 ..._TYPE node (which will be just a variant of the existing
11302 ..._TYPE node with identical properties) and then install X
11303 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11305 The whole point here is to end up with a situation where each
11306 and every ..._TYPE node the compiler creates will be uniquely
11307 associated with AT MOST one node representing a typedef name.
11308 This way, even though the compiler substitutes corresponding
11309 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11310 early on, later parts of the compiler can always do the reverse
11311 translation and get back the corresponding typedef name. For
11312 example, given:
11314 typedef struct S MY_TYPE;
11315 MY_TYPE object;
11317 Later parts of the compiler might only know that `object' was of
11318 type `struct S' if it were not for code just below. With this
11319 code however, later parts of the compiler see something like:
11321 struct S' == struct S
11322 typedef struct S' MY_TYPE;
11323 struct S' object;
11325 And they can then deduce (from the node for type struct S') that
11326 the original object declaration was:
11328 MY_TYPE object;
11330 Being able to do this is important for proper support of protoize,
11331 and also for generating precise symbolic debugging information
11332 which takes full account of the programmer's (typedef) vocabulary.
11334 Obviously, we don't want to generate a duplicate ..._TYPE node if
11335 the TYPE_DECL node that we are now processing really represents a
11336 standard built-in type. */
11338 void
11340 {
11344 {
11347 }
11350 {
11358 }
11359 }
11361 /* Record the types used by the current global variable declaration
11362 being parsed, so that we can decide later to emit their debug info.
11363 Those types are in types_used_by_cur_var_decl, and we are going to
11364 store them in the types_used_by_vars_hash hash table.
11365 DECL is the declaration of the global variable that has been parsed. */
11367 void
11369 {
11373 {
11376 }
11377 }
11379 /* If DECL is a typedef that is declared in the current function,
11380 record it for the purpose of -Wunused-local-typedefs. */
11382 void
11384 {
11389 /* if this is not a locally defined typedef then we are not
11390 interested. */
11397 }
11399 /* If T is a TYPE_DECL declared locally, mark it as used. */
11401 void
11403 {
11408 }
11410 /* Warn if there are some unused locally defined typedefs in the
11411 current function. */
11413 void
11415 {
11417 tree decl;
11418 /* The number of times we have emitted -Wunused-local-typedefs
11419 warnings. If this is different from errorcount, that means some
11420 unrelated errors have been issued. In which case, we'll avoid
11421 emitting "unused-local-typedefs" warnings. */
11433 {
11437 OPT_Wunused_local_typedefs,
11440 }
11443 }
11445 /* The C and C++ parsers both use vectors to hold function arguments.
11446 For efficiency, we keep a cache of unused vectors. This is the
11447 cache. */
11452 /* Return a new vector from the cache. If the cache is empty,
11453 allocate a new vector. These vectors are GC'ed, so it is OK if the
11454 pointer is not released.. */
11458 {
11461 else
11462 {
11463 /* Passing 0 to vec::alloc returns NULL, and our callers require
11464 that we always return a non-NULL value. The vector code uses
11465 4 when growing a NULL vector, so we do too. */
11469 }
11470 }
11472 /* Release a vector of trees back to the cache. */
11474 void
11476 {
11478 {
11481 }
11482 }
11484 /* Get a new tree vector holding a single tree. */
11488 {
11492 }
11494 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11498 {
11503 }
11505 /* Get a new tree vector which is a copy of an existing one. */
11509 {
11512 tree t;
11519 }
11521 /* Return true if KEYWORD starts a type specifier. */
11523 bool
11525 {
11527 {
11557 }
11558 }
11560 /* Return true if KEYWORD names a type qualifier. */
11562 bool
11564 {
11566 {
11573 }
11574 }
11576 /* Return true if KEYWORD names a storage class specifier.
11578 RID_TYPEDEF is not included in this list despite `typedef' being
11579 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11580 such for syntactic convenience only. */
11582 bool
11584 {
11586 {
11596 }
11597 }
11599 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11601 static bool
11603 {
11605 {
11613 }
11614 }
11616 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11617 declaration-specifier (C99 6.7). */
11619 bool
11621 {
11628 {
11635 }
11636 }
11638 /* Initialize language-specific-bits of tree_contains_struct. */
11640 void
11642 {
11646 }
11648 /* Build a user-defined numeric literal out of an integer constant type VALUE
11649 with identifier SUFFIX. */
11651 tree
11654 {
11661 }
11663 /* For vector[index], convert the vector to a
11664 pointer of the underlying type. */
11665 void
11668 {
11670 {
11672 tree type1;
11686 }
11687 }
11689 /* Determine which of the operands, if any, is a scalar that needs to be
11690 converted to a vector, for the range of operations. */
11691 enum stv_conv
11694 {
11703 {
11704 /* Most GENERIC binary expressions require homogeneous arguments.
11705 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11706 argument that is a vector and a second one that is a scalar, so
11707 we never return stv_secondarg for them. */
11712 {
11714 {
11719 }
11720 else
11722 }
11729 /* ... fall through ... */
11750 /* What about UNLT_EXPR? */
11752 {
11753 tree tmp;
11755 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11758 }
11762 {
11764 {
11769 }
11771 }
11773 /* Allow integer --> real conversion if safe. */
11777 {
11779 {
11784 }
11786 }
11789 }
11792 }
11794 /* Return true iff ALIGN is an integral constant that is a fundamental
11795 alignment, as defined by [basic.align] in the c++-11
11796 specifications.
11798 That is:
11800 [A fundamental alignment is represented by an alignment less than or
11801 equal to the greatest alignment supported by the implementation
11802 in all contexts, which is equal to
11803 alignof(max_align_t)]. */
11805 bool
11807 {
11810 }