| blob | d7c85fcaf7f33742e83715171e3e0ae573fe8ea1 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2014 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/>. */
56 /* The following symbols are subsumed in the c_global_trees array, and
57 listed here individually for documentation purposes.
59 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
61 tree short_integer_type_node;
62 tree long_integer_type_node;
63 tree long_long_integer_type_node;
64 tree int128_integer_type_node;
66 tree short_unsigned_type_node;
67 tree long_unsigned_type_node;
68 tree long_long_unsigned_type_node;
69 tree int128_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
79 tree wchar_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
84 tree float_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
97 tree intQI_type_node;
98 tree intHI_type_node;
99 tree intSI_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
146 tree void_list_node;
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
160 */
163 \f
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
179 /* Nonzero means pass #include lines through to the output. */
183 /* Nonzero means process PCH files while preprocessing. */
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 user's namespace. */
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
230 /* Tells the compiler what is the constant string class for ObjC. */
235 /* C++ language option variables. */
238 /* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
243 /* The C++ dialect being used. C++98 is the default. */
247 /* Maximum template instantiation depth. This limit exists to limit the
248 time it takes to notice excessively recursive template instantiations.
250 The default is lower than the 1024 recommended by the C++0x standard
251 because G++ runs out of stack before 1024 with highly recursive template
252 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
256 /* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
262 /* Nonzero means don't warn about problems that occur when the code is
263 executed. */
266 /* Whether we are building a boolean conversion inside
267 convert_for_assignment, or some other late binary operation. If
268 build_binary_op is called for C (from code shared by C and C++) in
269 this case, then the operands have already been folded and the
270 result will not be folded again, so C_MAYBE_CONST_EXPR should not
271 be generated. */
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
278 /* Information about how a function name is generated. */
279 struct fname_var_t
280 {
284 };
286 /* The three ways of getting then name of the current function. */
289 {
290 /* C99 compliant __func__, must be first. */
292 /* GCC __FUNCTION__ compliant. */
294 /* GCC __PRETTY_FUNCTION__ compliant. */
297 };
299 /* Global visibility options. */
390 /* Reserved words. The third field is a mask: keywords are disabled
391 if they match the mask.
393 Masks for languages:
394 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
395 C --std=c99: D_CXXONLY | D_OBJC
396 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
397 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
398 C++ --std=c0x: D_CONLY | D_OBJC
399 ObjC++ is like C++ except that D_OBJC is not set
401 If -fno-asm is used, D_ASM is added to the mask. If
402 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
403 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
404 In C with -Wc++-compat, we warn if D_CXXWARN is set.
406 Note the complication of the D_CXX_OBJC keywords. These are
407 reserved words such as 'class'. In C++, 'class' is a reserved
408 word. In Objective-C++ it is too. In Objective-C, it is a
409 reserved word too, but only if it follows an '@' sign.
410 */
412 {
573 /* These Objective-C keywords are recognized only immediately after
574 an '@'. */
591 /* These are recognized only in protocol-qualifier context
592 (see above) */
599 /* These are recognized inside a property attribute list */
608 };
613 /* Table of machine-independent attributes common to all C-like languages. */
615 {
616 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
617 affects_type_identity } */
624 /* FIXME: logically, noreturn attributes should be listed as
625 "false, true, true" and apply to function types. But implementing this
626 would require all the places in the compiler that use TREE_THIS_VOLATILE
627 on a decl to identify non-returning functions to be located and fixed
628 to check the function type instead. */
653 /* The same comments as for noreturn attributes apply to const ones. */
677 handle_no_instrument_function_attribute,
695 /* ??? These two attributes didn't make the transition from the
696 Intel language document to the multi-vendor language document. */
701 /* For internal use (marking of builtins) only. The name contains space
702 to prevent its usage in source code. */
724 /* For internal use (marking of builtins) only. The name contains space
725 to prevent its usage in source code. */
736 handle_no_address_safety_analysis_attribute,
739 handle_no_sanitize_address_attribute,
742 handle_no_sanitize_undefined_attribute,
752 /* For internal use only. The leading '*' both prevents its usage in
753 source code and signals that it may be overridden by machine tables. */
758 /* For internal use (marking of builtins and runtime functions) only.
759 The name contains space to prevent its usage in source code. */
777 };
779 /* Give the specifications for the format attributes, used by C and all
780 descendants. */
783 {
784 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
785 affects_type_identity } */
791 };
793 /* Return identifier for address space AS. */
797 {
801 }
803 /* Push current bindings for the function name VAR_DECLS. */
805 void
807 {
812 {
816 {
818 saved);
820 }
821 }
823 /* Normally they'll have been NULL, so only push if we've got a
824 stack, or they are non-NULL. */
826 saved_function_name_decls);
827 }
829 /* Finish up the current bindings, adding them into the current function's
830 statement tree. This must be done _before_ finish_stmt_tree is called.
831 If there is no current function, we must be at file scope and no statements
832 are involved. Pop the previous bindings. */
834 void
836 {
845 {
853 }
859 {
860 /* We had saved values, restore them. */
861 tree saved;
864 {
869 }
871 }
873 }
875 /* Return the text name of the current function, suitably prettified
876 by PRETTY_P. Return string must be freed by caller. */
880 {
887 {
890 }
903 {
906 }
909 }
911 /* Return the VAR_DECL for a const char array naming the current
912 function. If the VAR_DECL has not yet been created, create it
913 now. RID indicates how it should be formatted and IDENTIFIER_NODE
914 ID is its name (unfortunately C and C++ hold the RID values of
915 keywords in different places, so we can't derive RID from ID in
916 this language independent code. LOC is the location of the
917 function. */
919 tree
921 {
931 {
932 /* If a tree is built here, it would normally have the lineno of
933 the current statement. Later this tree will be moved to the
934 beginning of the function and this line number will be wrong.
935 To avoid this problem set the lineno to 0 here; that prevents
936 it from appearing in the RTL. */
937 tree stmts;
945 saved_function_name_decls
949 }
954 }
956 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
958 tree
960 {
965 /* Compute the number of elements, for the array type. */
967 {
970 }
972 {
975 }
977 {
980 }
981 else
982 {
985 }
987 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
988 limit in C++98 Annex B is very large (65536) and is not normative,
989 so we do not diagnose it (warn_overlength_strings is forced off
990 in c_common_post_options). */
992 {
996 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
997 separate the %d from the 'C'. 'ISO' should not be
998 translated, but it may be moved after 'C%d' in languages
999 where modifiers follow nouns. */
1001 "string length %qd is greater than the length %qd "
1004 }
1006 /* Create the array type for the string constant. The ISO C++
1007 standard says that a string literal has type `const char[N]' or
1008 `const wchar_t[N]'. We use the same logic when invoked as a C
1009 front-end with -Wwrite-strings.
1010 ??? We should change the type of an expression depending on the
1011 state of a warning flag. We should just be warning -- see how
1012 this is handled in the C++ front-end for the deprecated implicit
1013 conversion from string literals to `char*' or `wchar_t*'.
1015 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1016 array type being the unqualified version of that type.
1017 Therefore, if we are constructing an array of const char, we must
1018 construct the matching unqualified array type first. The C front
1019 end does not require this, but it does no harm, so we do it
1020 unconditionally. */
1031 }
1032 \f
1033 /* If DISABLE is true, stop issuing warnings. This is used when
1034 parsing code that we know will not be executed. This function may
1035 be called multiple times, and works as a stack. */
1037 static void
1039 {
1041 {
1044 }
1045 }
1047 /* If ENABLE is true, reenable issuing warnings. */
1049 static void
1051 {
1053 {
1056 }
1057 }
1059 /* Fully fold EXPR, an expression that was not folded (beyond integer
1060 constant expressions and null pointer constants) when being built
1061 up. If IN_INIT, this is in a static initializer and certain
1062 changes are made to the folding done. Clear *MAYBE_CONST if
1063 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1064 expression because it contains an evaluated operator (in C99) or an
1065 operator outside of sizeof returning an integer constant (in C90)
1066 not permitted in constant expressions, or because it contains an
1067 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1068 set to true by callers before calling this function.) Return the
1069 folded expression. Function arguments have already been folded
1070 before calling this function, as have the contents of SAVE_EXPR,
1071 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1072 C_MAYBE_CONST_EXPR. */
1074 tree
1076 {
1077 tree ret;
1083 /* This function is not relevant to C++ because C++ folds while
1084 parsing, and may need changes to be correct for C++ when C++
1085 stops folding while parsing. */
1092 {
1095 }
1102 }
1104 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1105 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1106 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1107 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1108 both evaluated and unevaluated subexpressions while
1109 *MAYBE_CONST_ITSELF is carried from only evaluated
1110 subexpressions). */
1112 static tree
1115 {
1127 /* This function is not relevant to C++ because C++ folds while
1128 parsing, and may need changes to be correct for C++ when C++
1129 stops folding while parsing. */
1133 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1134 anything else not counted as an expression cannot usefully be
1135 folded further at this point. */
1141 /* Operands of variable-length expressions (function calls) have
1142 already been folded, as have __builtin_* function calls, and such
1143 expressions cannot occur in constant expressions. */
1145 {
1149 }
1152 {
1161 else
1164 }
1166 /* Assignment, increment, decrement, function call and comma
1167 operators, and statement expressions, cannot occur in constant
1168 expressions if evaluated / outside of sizeof. (Function calls
1169 were handled above, though VA_ARG_EXPR is treated like a function
1170 call here, and statement expressions are handled through
1171 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1173 {
1193 }
1195 /* Fold individual tree codes as appropriate. */
1197 {
1199 /* Any non-constancy will have been marked in a containing
1200 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1208 maybe_const_itself);
1213 {
1216 }
1225 maybe_const_itself);
1228 maybe_const_itself);
1234 {
1238 }
1280 /* Binary operations evaluating both arguments (increment and
1281 decrement are binary internally in GCC). */
1285 maybe_const_itself);
1293 /* The RHS of a MODIFY_EXPR was fully folded when building that
1294 expression for the sake of conversion warnings. */
1297 maybe_const_itself);
1301 ret = in_init
1304 else
1317 {
1328 }
1334 CASE_CONVERT:
1345 /* Unary operations. */
1348 maybe_const_itself);
1352 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1353 not prepared to deal with them if they occur in initializers. */
1361 ret = in_init
1364 else
1369 {
1373 }
1375 {
1378 CASE_CONVERT:
1379 /* Don't warn about explicit conversions. We will already
1380 have warned about suspect implicit conversions. */
1387 }
1392 /* Binary operations not necessarily evaluating both
1393 arguments. */
1400 ? truthvalue_false_node
1408 ret = in_init
1411 else
1416 && op0_const
1417 && op0_const_self
1423 && op0_const_self
1449 else
1454 && op0_const
1455 && op0_const_self
1459 && op0_const_self
1463 && op0_const
1464 && op0_const_self
1468 && op0_const_self
1474 /* Each case where an operand with excess precision may be
1475 encountered must remove the EXCESS_PRECISION_EXPR around
1476 inner operands and possibly put one around the whole
1477 expression or possibly convert to the semantic type (which
1478 c_fully_fold does); we cannot tell at this stage which is
1479 appropriate in any particular case. */
1483 /* Various codes may appear through folding built-in functions
1484 and their arguments. */
1486 }
1488 out:
1489 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1490 have been done by this point, so remove them again. */
1494 {
1498 }
1502 }
1504 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1505 return EXP. Otherwise, return either EXP or its known constant
1506 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1507 Is the BLKmode test appropriate? */
1509 tree
1511 {
1512 tree ret;
1514 /* This function is only used by C, for c_fully_fold and other
1515 optimization, and may not be correct for C++. */
1526 /* Avoid unwanted tree sharing between the initializer and current
1527 function's body where the tree can be modified e.g. by the
1528 gimplifier. */
1532 }
1534 /* Print a warning if a constant expression had overflow in folding.
1535 Invoke this function on every expression that the language
1536 requires to be a constant expression.
1537 Note the ANSI C standard says it is erroneous for a
1538 constant expression to overflow. */
1540 void
1542 {
1550 }
1552 /* The same as above but print an unconditional error. */
1553 void
1555 {
1562 }
1564 /* Print a warning if an expression had overflow in folding and its
1565 operands hadn't.
1567 Invoke this function on every expression that
1568 (1) appears in the source code, and
1569 (2) is a constant expression that overflowed, and
1570 (3) is not already checked by convert_and_check;
1571 however, do not invoke this function on operands of explicit casts
1572 or when the expression is the result of an operator and any operand
1573 already overflowed. */
1575 void
1577 {
1582 {
1611 }
1612 }
1614 /* Warn about uses of logical || / && operator in a context where it
1615 is likely that the bitwise equivalent was intended by the
1616 programmer. We have seen an expression in which CODE is a binary
1617 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1618 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1619 void
1623 {
1635 /* Warn if &&/|| are being used in a context where it is
1636 likely that the bitwise equivalent was intended by the
1637 programmer. That is, an expression such as op && MASK
1638 where op should not be any boolean expression, nor a
1639 constant, and mask seems to be a non-boolean integer constant. */
1647 {
1651 else
1656 }
1658 /* We do not warn for constants because they are typical of macro
1659 expansions that test for features. */
1663 /* This warning only makes sense with logical operands. */
1671 /* We first test whether either side separately is trivially true
1672 (with OR) or trivially false (with AND). If so, do not warn.
1673 This is a common idiom for testing ranges of data types in
1674 portable code. */
1681 /* If this is an OR operation, invert both sides; now, the result
1682 should be always false to get a warning. */
1696 /* If this is an OR operation, invert both sides; now, the result
1697 should be always false to get a warning. */
1705 /* If both expressions have the same operand, if we can merge the
1706 ranges, and if the range test is always false, then warn. */
1713 {
1716 "logical %<or%> "
1718 else
1720 "logical %<and%> "
1722 }
1723 }
1726 /* Warn if EXP contains any computations whose results are not used.
1727 Return true if a warning is printed; false otherwise. LOCUS is the
1728 (potential) location of the expression. */
1730 bool
1732 {
1733 restart:
1737 /* Don't warn about void constructs. This includes casting to void,
1738 void function calls, and statement expressions with a final cast
1739 to void. */
1747 {
1763 /* For a binding, warn if no side effect within it. */
1775 /* In && or ||, warn if 2nd operand has no side effect. */
1782 /* Let people do `(foo (), 0)' without a warning. */
1789 /* If this is an expression with side effects, don't warn; this
1790 case commonly appears in macro expansions. */
1796 /* Don't warn about automatic dereferencing of references, since
1797 the user cannot control it. */
1799 {
1802 }
1803 /* Fall through. */
1806 /* Referencing a volatile value is a side effect, so don't warn. */
1811 /* If this is an expression which has no operands, there is no value
1812 to be unused. There are no such language-independent codes,
1813 but front ends may define such. */
1817 warn:
1819 }
1820 }
1823 /* Print a warning about casts that might indicate violation
1824 of strict aliasing rules if -Wstrict-aliasing is used and
1825 strict aliasing mode is in effect. OTYPE is the original
1826 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1828 bool
1830 {
1831 /* Strip pointer conversion chains and get to the correct original type. */
1839 /* If the type we are casting to is a ref-all pointer
1840 dereferencing it is always valid. */
1847 {
1848 /* Casting the address of an object to non void pointer. Warn
1849 if the cast breaks type based aliasing. */
1851 {
1855 }
1856 else
1857 {
1858 /* warn_strict_aliasing >= 3. This includes the default (3).
1859 Only warn if the cast is dereferenced immediately. */
1860 alias_set_type set1 =
1866 {
1870 }
1873 {
1877 }
1878 }
1879 }
1880 else
1882 {
1883 /* At this level, warn for any conversions, even if an address is
1884 not taken in the same statement. This will likely produce many
1885 false positives, but could be useful to pinpoint problems that
1886 are not revealed at higher levels. */
1891 {
1895 }
1896 }
1899 }
1901 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1902 sizeof as last operand of certain builtins. */
1904 void
1908 {
1912 location_t loc;
1920 {
1924 /* FALLTHRU */
1932 /* FALLTHRU */
1991 }
2019 {
2023 {
2026 "argument to %<sizeof%> in %qD call is the same "
2027 "expression as the destination; did you mean to "
2033 "argument to %<sizeof%> in %qD call is the same "
2034 "expression as the destination; did you mean to "
2036 else
2038 "argument to %<sizeof%> in %qD call is the same "
2039 "expression as the destination; did you mean to "
2042 }
2045 && !strop
2048 {
2050 "argument to %<sizeof%> in %qD call is the same "
2051 "pointer type %qT as the destination; expected %qT "
2055 }
2056 }
2059 {
2063 {
2066 "argument to %<sizeof%> in %qD call is the same "
2067 "expression as the source; did you mean to "
2073 "argument to %<sizeof%> in %qD call is the same "
2074 "expression as the source; did you mean to "
2076 else
2078 "argument to %<sizeof%> in %qD call is the same "
2079 "expression as the source; did you mean to "
2082 }
2085 && !strop
2088 {
2090 "argument to %<sizeof%> in %qD call is the same "
2091 "pointer type %qT as the source; expected %qT "
2095 }
2096 }
2099 {
2103 {
2106 "argument to %<sizeof%> in %qD call is the same "
2107 "expression as the first source; did you mean to "
2113 "argument to %<sizeof%> in %qD call is the same "
2114 "expression as the first source; did you mean to "
2116 else
2118 "argument to %<sizeof%> in %qD call is the same "
2119 "expression as the first source; did you mean to "
2122 }
2125 && !strop
2128 {
2130 "argument to %<sizeof%> in %qD call is the same "
2131 "pointer type %qT as the first source; expected %qT "
2135 }
2136 }
2139 {
2143 {
2146 "argument to %<sizeof%> in %qD call is the same "
2147 "expression as the second source; did you mean to "
2153 "argument to %<sizeof%> in %qD call is the same "
2154 "expression as the second source; did you mean to "
2156 else
2158 "argument to %<sizeof%> in %qD call is the same "
2159 "expression as the second source; did you mean to "
2162 }
2165 && !strop
2168 {
2170 "argument to %<sizeof%> in %qD call is the same "
2171 "pointer type %qT as the second source; expected %qT "
2175 }
2176 }
2178 }
2180 /* Warn for unlikely, improbable, or stupid DECL declarations
2181 of `main'. */
2183 void
2185 {
2186 function_args_iterator iter;
2187 tree type;
2191 {
2192 /* XXX void_type_node belies the abstraction. */
2202 {
2208 }
2212 {
2234 "third argument of %q+D should probably be "
2237 }
2238 }
2240 /* It is intentional that this message does not mention the third
2241 argument because it's only mentioned in an appendix of the
2242 standard. */
2250 }
2252 /* vector_targets_convertible_p is used for vector pointer types. The
2253 callers perform various checks that the qualifiers are satisfactory,
2254 while OTOH vector_targets_convertible_p ignores the number of elements
2255 in the vectors. That's fine with vector pointers as we can consider,
2256 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2257 and that does not require and conversion of the pointer values.
2258 In contrast, vector_types_convertible_p and
2259 vector_types_compatible_elements_p are used for vector value types. */
2260 /* True if pointers to distinct types T1 and T2 can be converted to
2261 each other without an explicit cast. Only returns true for opaque
2262 vector types. */
2263 bool
2265 {
2272 }
2274 /* vector_types_convertible_p is used for vector value types.
2275 It could in principle call vector_targets_convertible_p as a subroutine,
2276 but then the check for vector type would be duplicated with its callers,
2277 and also the purpose of vector_targets_convertible_p would become
2278 muddled.
2279 Where vector_types_convertible_p returns true, a conversion might still be
2280 needed to make the types match.
2281 In contrast, vector_targets_convertible_p is used for vector pointer
2282 values, and vector_types_compatible_elements_p is used specifically
2283 in the context for binary operators, as a check if use is possible without
2284 conversion. */
2285 /* True if vector types T1 and T2 can be converted to each other
2286 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2287 can only be converted with -flax-vector-conversions yet that is not
2288 in effect, emit a note telling the user about that option if such
2289 a note has not previously been emitted. */
2290 bool
2292 {
2300 convertible_lax =
2315 {
2318 "conversions between vectors with differing "
2320 }
2323 }
2325 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2326 and have vector types, V0 has the same type as V1, and the number of
2327 elements of V0, V1, MASK is the same.
2329 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2330 called with two arguments. In this case implementation passes the
2331 first argument twice in order to share the same tree code. This fact
2332 could enable the mask-values being twice the vector length. This is
2333 an implementation accident and this semantics is not guaranteed to
2334 the user. */
2335 tree
2338 {
2339 tree ret;
2345 {
2348 }
2356 {
2361 }
2365 {
2369 }
2372 {
2377 }
2383 {
2386 "argument vector(s) and the mask vector should "
2389 }
2393 {
2398 }
2401 {
2402 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2408 else
2409 {
2412 }
2416 }
2426 }
2428 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2429 to integral type. */
2431 static tree
2433 {
2438 {
2439 /* C++0x scoped enumerations don't implicitly convert to integral
2440 type; if we stripped an explicit conversion to a larger type we
2441 need to replace it so common_type will still work. */
2445 }
2447 }
2449 /* This is a helper function of build_binary_op.
2451 For certain operations if both args were extended from the same
2452 smaller type, do the arithmetic in that type and then extend.
2454 BITWISE indicates a bitwise operation.
2455 For them, this optimization is safe only if
2456 both args are zero-extended or both are sign-extended.
2457 Otherwise, we might change the result.
2458 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2459 but calculated in (unsigned short) it would be (unsigned short)-1.
2460 */
2461 tree
2463 {
2467 tree type;
2469 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2470 excessive narrowing when we call get_narrower below. For
2471 example, suppose that OP0 is of unsigned int extended
2472 from signed char and that RESULT_TYPE is long long int.
2473 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2474 like
2476 (long long int) (unsigned int) signed_char
2478 which get_narrower would narrow down to
2480 (unsigned int) signed char
2482 If we do not cast OP0 first, get_narrower would return
2483 signed_char, which is inconsistent with the case of the
2484 explicit cast. */
2491 /* UNS is 1 if the operation to be done is an unsigned one. */
2494 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2495 but it *requires* conversion to FINAL_TYPE. */
2506 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2508 /* For bitwise operations, signedness of nominal type
2509 does not matter. Consider only how operands were extended. */
2513 /* Note that in all three cases below we refrain from optimizing
2514 an unsigned operation on sign-extended args.
2515 That would not be valid. */
2517 /* Both args variable: if both extended in same way
2518 from same width, do it in that width.
2519 Do it unsigned if args were zero-extended. */
2526 return c_common_signed_or_unsigned_type
2533 && (type
2544 && (type
2552 }
2554 /* Checks if expression EXPR of real/integer type cannot be converted
2555 to the real/integer type TYPE. Function returns non-zero when:
2556 * EXPR is a constant which cannot be exactly converted to TYPE.
2557 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2558 for EXPR type and TYPE being both integers or both real.
2559 * EXPR is not a constant of real type and TYPE is an integer.
2560 * EXPR is not a constant of integer type which cannot be
2561 exactly converted to real type.
2562 Function allows conversions between types of different signedness and
2563 can return SAFE_CONVERSION (zero) in that case. Function can produce
2564 signedness warnings if PRODUCE_WARNS is true. */
2566 enum conversion_safety
2568 {
2574 {
2575 /* Warn for real constant that is not an exact integer converted
2576 to integer type. */
2579 {
2582 }
2583 /* Warn for an integer constant that does not fit into integer type. */
2587 {
2590 {
2594 }
2596 {
2600 }
2601 else
2603 }
2605 {
2606 /* Warn for an integer constant that does not fit into real type. */
2608 {
2612 }
2613 /* Warn for a real constant that does not fit into a smaller
2614 real type. */
2617 {
2621 }
2622 }
2623 }
2624 else
2625 {
2626 /* Warn for real types converted to integer types. */
2633 {
2634 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2638 /* Don't warn for short y; short x = ((int)y & 0xff); */
2642 {
2643 /* If both args were extended from a shortest type,
2644 use that type if that is safe. */
2651 {
2657 /* If one of the operands is a non-negative constant
2658 that fits in the target type, then the type of the
2659 other operand does not matter. */
2668 /* If constant is unsigned and fits in the target
2669 type, then the result will also fit. */
2671 && unsigned0
2674 && unsigned1
2677 }
2678 }
2679 /* Warn for integer types converted to smaller integer types. */
2683 /* When they are the same width but different signedness,
2684 then the value may change. */
2687 /* Even when converted to a bigger type, if the type is
2688 unsigned but expr is signed, then negative values
2689 will be changed. */
2695 }
2697 /* Warn for integer types converted to real types if and only if
2698 all the range of values of the integer type cannot be
2699 represented by the real type. */
2702 {
2706 /* Don't warn about char y = 0xff; float x = (int) y; */
2718 }
2720 /* Warn for real types converted to smaller real types. */
2725 }
2728 }
2730 /* Warns if the conversion of EXPR to TYPE may alter a value.
2731 This is a helper function for warnings_for_convert_and_check. */
2733 static void
2735 {
2742 /* This may happen, because for LHS op= RHS we preevaluate
2743 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2744 means we could no longer see the code of the EXPR. */
2751 {
2764 /* Conversion from boolean to a signed:1 bit-field (which only
2765 can hold the values 0 and -1) doesn't lose information - but
2766 it does change the value. */
2786 {
2787 /* In case of COND_EXPR, we do not care about the type of
2788 COND_EXPR, only about the conversion of each operand. */
2795 }
2807 }
2808 }
2810 /* Produce warnings after a conversion. RESULT is the result of
2811 converting EXPR to TYPE. This is a helper function for
2812 convert_and_check and cp_convert_and_check. */
2814 void
2816 tree result)
2817 {
2824 {
2825 /* Do not diagnose overflow in a constant expression merely
2826 because a conversion overflowed. */
2831 {
2832 /* This detects cases like converting -129 or 256 to
2833 unsigned char. */
2837 else
2839 }
2843 /* No warning for converting 0x80000000 to int. */
2851 else
2853 }
2858 else
2860 }
2863 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2864 Invoke this function on every expression that is converted implicitly,
2865 i.e. because of language rules and not because of an explicit cast. */
2867 tree
2869 {
2870 tree result;
2871 tree expr_for_warning;
2873 /* Convert from a value with possible excess precision rather than
2874 via the semantic type, but do not warn about values not fitting
2875 exactly in the semantic type. */
2877 {
2883 }
2884 else
2898 }
2899 \f
2900 /* A node in a list that describes references to variables (EXPR), which are
2901 either read accesses if WRITER is zero, or write accesses, in which case
2902 WRITER is the parent of EXPR. */
2903 struct tlist
2904 {
2907 };
2909 /* Used to implement a cache the results of a call to verify_tree. We only
2910 use this for SAVE_EXPRs. */
2911 struct tlist_cache
2912 {
2916 tree expr;
2917 };
2919 /* Obstack to use when allocating tlist structures, and corresponding
2920 firstobj. */
2924 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2925 warnings. */
2927 /* SAVE_EXPRs need special treatment. We process them only once and then
2928 cache the results. */
2940 /* Create a new struct tlist and fill in its fields. */
2943 {
2950 }
2952 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2953 is nonnull, we ignore any node we find which has a writer equal to it. */
2955 static void
2957 {
2959 {
2966 }
2967 }
2969 /* Merge the nodes of ADD into TO. This merging process is done so that for
2970 each variable that already exists in TO, no new node is added; however if
2971 there is a write access recorded in ADD, and an occurrence on TO is only
2972 a read access, then the occurrence in TO will be modified to record the
2973 write. */
2975 static void
2977 {
2984 {
2991 {
2995 }
2997 {
3001 }
3003 }
3004 }
3006 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3007 references in list LIST conflict with it, excluding reads if ONLY writers
3008 is nonzero. */
3010 static void
3013 {
3016 /* Avoid duplicate warnings. */
3022 {
3026 {
3031 }
3033 }
3034 }
3036 /* Given a list LIST of references to variables, find whether any of these
3037 can cause conflicts due to missing sequence points. */
3039 static void
3041 {
3045 {
3048 }
3049 }
3051 /* Return nonzero if X is a tree that can be verified by the sequence point
3052 warnings. */
3053 static int
3055 {
3062 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3063 (lvalue_p) crash on TRY/CATCH. */
3070 /* No point to track non-const calls, they will never satisfy
3071 operand_equal_p. */
3079 }
3081 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3082 static bool
3084 {
3086 }
3088 /* Walk the tree X, and record accesses to variables. If X is written by the
3089 parent tree, WRITER is the parent.
3090 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3091 expression or its only operand forces a sequence point, then everything up
3092 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3093 in PNO_SP.
3094 Once we return, we will have emitted warnings if any subexpression before
3095 such a sequence point could be undefined. On a higher level, however, the
3096 sequence point may not be relevant, and we'll merge the two lists.
3098 Example: (b++, a) + b;
3099 The call that processes the COMPOUND_EXPR will store the increment of B
3100 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3101 processes the PLUS_EXPR will need to merge the two lists so that
3102 eventually, all accesses end up on the same list (and we'll warn about the
3103 unordered subexpressions b++ and b.
3105 A note on merging. If we modify the former example so that our expression
3106 becomes
3107 (b++, b) + a
3108 care must be taken not simply to add all three expressions into the final
3109 PNO_SP list. The function merge_tlist takes care of that by merging the
3110 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3111 way, so that no more than one access to B is recorded. */
3113 static void
3115 tree writer)
3116 {
3121 /* X may be NULL if it is the operand of an empty statement expression
3122 ({ }). */
3126 restart:
3134 {
3167 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3168 two first, to avoid warning for (a ? b++ : b++). */
3184 /* Expressions inside the LHS are not ordered wrt. the sequence points
3185 in the RHS. Example:
3186 *a = (a++, 2)
3187 Despite the fact that the modification of "a" is in the before_sp
3188 list (tmp_before), it conflicts with the use of "a" in the LHS.
3189 We can handle this by adding the contents of tmp_list3
3190 to those of tmp_before, and redoing the collision warnings for that
3191 list. */
3194 /* Exclude the LHS itself here; we first have to merge it into the
3195 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3196 didn't exclude the LHS, we'd get it twice, once as a read and once
3197 as a write. */
3208 /* We need to warn about conflicts among arguments and conflicts between
3209 args and the function address. Side effects of the function address,
3210 however, are not ordered by the sequence point of the call. */
3211 {
3212 call_expr_arg_iterator iter;
3213 tree arg;
3217 {
3222 }
3227 }
3230 /* Scan all the list, e.g. indices of multi dimensional array. */
3232 {
3238 }
3242 {
3249 {
3263 }
3267 }
3277 /* For other expressions, simply recurse on their operands.
3278 Manual tail recursion for unary expressions.
3279 Other non-expressions need not be processed. */
3281 {
3285 }
3287 {
3291 {
3296 }
3297 }
3299 }
3300 }
3302 /* Try to warn for undefined behavior in EXPR due to missing sequence
3303 points. */
3305 DEBUG_FUNCTION void
3307 {
3313 {
3316 }
3321 }
3322 \f
3323 /* Validate the expression after `case' and apply default promotions. */
3325 static tree
3327 {
3332 /* Promote char or short to int. */
3335 {
3338 }
3343 }
3344 \f
3345 /* See if the case values LOW and HIGH are in the range of the original
3346 type (i.e. before the default conversion to int) of the switch testing
3347 expression.
3348 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3349 the type before promoting it. CASE_LOW_P is a pointer to the lower
3350 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3351 if the case is not a case range.
3352 The caller has to make sure that we are not called with NULL for
3353 CASE_LOW_P (i.e. the default case).
3354 Returns true if the case label is in range of ORIG_TYPE (saturated or
3355 untouched) or false if the label is out of range. */
3357 static bool
3360 {
3365 /* If there was a problem with the original type, do nothing. */
3372 /* Case label is less than minimum for type. */
3375 {
3378 }
3380 /* Case value is greater than maximum for type. */
3383 {
3386 }
3388 /* Saturate lower case label value to minimum. */
3391 {
3395 }
3397 /* Saturate upper case label value to maximum. */
3400 {
3404 }
3412 }
3413 \f
3414 /* Return an integer type with BITS bits of precision,
3415 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3417 tree
3419 {
3458 }
3460 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3461 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3462 and saturating if SATP is nonzero, otherwise not saturating. */
3464 tree
3467 {
3471 else
3479 {
3481 "fixed-point types that have too many integral and "
3484 }
3487 }
3489 /* Used for communication between c_common_type_for_mode and
3490 c_register_builtin_type. */
3491 tree registered_builtin_types;
3493 /* Return a data type that has machine mode MODE.
3494 If the mode is an integer,
3495 then UNSIGNEDP selects between signed and unsigned types.
3496 If the mode is a fixed-point mode,
3497 then UNSIGNEDP selects between saturating and nonsaturating types. */
3499 tree
3501 {
3502 tree t;
3539 #if HOST_BITS_PER_WIDE_INT >= 64
3542 #endif
3567 {
3569 tree inner_type;
3585 }
3587 {
3592 }
3602 {
3688 }
3696 }
3698 tree
3700 {
3702 }
3704 /* Return a signed type the same as TYPE in other respects. */
3706 tree
3708 {
3710 }
3712 /* Return a type the same as TYPE except unsigned or
3713 signed according to UNSIGNEDP. */
3715 tree
3717 {
3718 tree type1;
3720 /* This block of code emulates the behavior of the old
3721 c_common_unsigned_type. In particular, it returns
3722 long_unsigned_type_node if passed a long, even when a int would
3723 have the same size. This is necessary for warnings to work
3724 correctly in archs where sizeof(int) == sizeof(long) */
3727 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3743 #if HOST_BITS_PER_WIDE_INT >= 64
3746 #endif
3756 #define C_COMMON_FIXED_TYPES(NAME) \
3757 if (type1 == short_ ## NAME ## _type_node \
3758 || type1 == unsigned_short_ ## NAME ## _type_node) \
3759 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3760 : short_ ## NAME ## _type_node; \
3761 if (type1 == NAME ## _type_node \
3762 || type1 == unsigned_ ## NAME ## _type_node) \
3763 return unsignedp ? unsigned_ ## NAME ## _type_node \
3764 : NAME ## _type_node; \
3765 if (type1 == long_ ## NAME ## _type_node \
3766 || type1 == unsigned_long_ ## NAME ## _type_node) \
3767 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3768 : long_ ## NAME ## _type_node; \
3769 if (type1 == long_long_ ## NAME ## _type_node \
3770 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3771 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3772 : long_long_ ## NAME ## _type_node;
3774 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3775 if (type1 == NAME ## _type_node \
3776 || type1 == u ## NAME ## _type_node) \
3777 return unsignedp ? u ## NAME ## _type_node \
3778 : NAME ## _type_node;
3780 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3781 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3782 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3783 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3784 : sat_ ## short_ ## NAME ## _type_node; \
3785 if (type1 == sat_ ## NAME ## _type_node \
3786 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3787 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3788 : sat_ ## NAME ## _type_node; \
3789 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3790 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3791 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3792 : sat_ ## long_ ## NAME ## _type_node; \
3793 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3794 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3795 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3796 : sat_ ## long_long_ ## NAME ## _type_node;
3798 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3799 if (type1 == sat_ ## NAME ## _type_node \
3800 || type1 == sat_ ## u ## NAME ## _type_node) \
3801 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3802 : sat_ ## NAME ## _type_node;
3828 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3829 the precision; they have precision set to match their range, but
3830 may use a wider mode to match an ABI. If we change modes, we may
3831 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3832 the precision as well, so as to yield correct results for
3833 bit-field types. C++ does not have these separate bit-field
3834 types, and producing a signed or unsigned variant of an
3835 ENUMERAL_TYPE may cause other problems as well. */
3841 #define TYPE_OK(node) \
3842 (TYPE_MODE (type) == TYPE_MODE (node) \
3843 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3862 #if HOST_BITS_PER_WIDE_INT >= 64
3865 #endif
3874 #undef TYPE_OK
3877 }
3879 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3881 tree
3883 {
3884 /* Extended integer types of the same width as a standard type have
3885 lesser rank, so those of the same width as int promote to int or
3886 unsigned int and are valid for printf formats expecting int or
3887 unsigned int. To avoid such special cases, avoid creating
3888 extended integer types for bit-fields if a standard integer type
3889 is available. */
3906 }
3908 /* The C version of the register_builtin_type langhook. */
3910 void
3912 {
3913 tree decl;
3923 }
3924 \f
3925 /* Print an error message for invalid operands to arith operation
3926 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3927 LOCATION is the location of the message. */
3929 void
3932 {
3936 {
3981 }
3985 }
3986 \f
3987 /* Given an expression as a tree, return its original type. Do this
3988 by stripping any conversion that preserves the sign and precision. */
3989 static tree
3991 {
3994 }
3996 /* Subroutine of build_binary_op, used for comparison operations.
3997 See if the operands have both been converted from subword integer types
3998 and, if so, perhaps change them both back to their original type.
3999 This function is also responsible for converting the two operands
4000 to the proper common type for comparison.
4002 The arguments of this function are all pointers to local variables
4003 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4004 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4006 LOC is the location of the comparison.
4008 If this function returns nonzero, it means that the comparison has
4009 a constant value. What this function returns is an expression for
4010 that value. */
4012 tree
4015 {
4016 tree type;
4024 /* Throw away any conversions to wider types
4025 already present in the operands. */
4030 /* If primopN is first sign-extended from primopN's precision to opN's
4031 precision, then zero-extended from opN's precision to
4032 *restype_ptr precision, shortenings might be invalid. */
4035 && !unsignedp0
4040 && !unsignedp1
4044 /* Handle the case that OP0 does not *contain* a conversion
4045 but it *requires* conversion to FINAL_TYPE. */
4052 /* If one of the operands must be floated, we cannot optimize. */
4056 /* If first arg is constant, swap the args (changing operation
4057 so value is preserved), for canonicalization. Don't do this if
4058 the second arg is 0. */
4063 {
4080 {
4095 }
4097 }
4099 /* If comparing an integer against a constant more bits wide,
4100 maybe we can deduce a value of 1 or 0 independent of the data.
4101 Or else truncate the constant now
4102 rather than extend the variable at run time.
4104 This is only interesting if the constant is the wider arg.
4105 Also, it is not safe if the constant is unsigned and the
4106 variable arg is signed, since in this case the variable
4107 would be sign-extended and then regarded as unsigned.
4108 Our technique fails in this case because the lowest/highest
4109 possible unsigned results don't follow naturally from the
4110 lowest/highest possible values of the variable operand.
4111 For just EQ_EXPR and NE_EXPR there is another technique that
4112 could be used: see if the constant can be faithfully represented
4113 in the other operand's type, by truncating it and reextending it
4114 and see if that preserves the constant's value. */
4120 {
4123 /* 1 if comparison is nominally unsigned. */
4125 tree val;
4137 {
4138 /* Convert primop1 to target type, but do not introduce
4139 additional overflow. We know primop1 is an int_cst. */
4146 }
4148 {
4151 }
4159 /* This used to be a switch, but Genix compiler can't handle that. */
4161 {
4164 }
4166 {
4169 }
4171 {
4176 }
4178 {
4183 }
4185 {
4190 }
4192 {
4197 }
4199 /* If primop0 was sign-extended and unsigned comparison specd,
4200 we did a signed comparison above using the signed type bounds.
4201 But the comparison we output must be unsigned.
4203 Also, for inequalities, VAL is no good; but if the signed
4204 comparison had *any* fixed result, it follows that the
4205 unsigned comparison just tests the sign in reverse
4206 (positive values are LE, negative ones GE).
4207 So we can generate an unsigned comparison
4208 against an extreme value of the signed type. */
4211 {
4214 {
4229 }
4231 }
4234 {
4241 }
4244 {
4245 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4249 }
4251 /* Value is not predetermined, but do the comparison
4252 in the type of the operand that is not constant.
4253 TYPE is already properly set. */
4254 }
4256 /* If either arg is decimal float and the other is float, find the
4257 proper common type to use for comparison. */
4268 /* If args' natural types are both narrower than nominal type
4269 and both extend in the same manner, compare them
4270 in the type of the wider arg.
4271 Otherwise must actually extend both to the nominal
4272 common type lest different ways of extending
4273 alter the result.
4274 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4279 {
4283 type);
4284 /* Make sure shorter operand is extended the right way
4285 to match the longer operand. */
4286 primop0
4289 primop0);
4290 primop1
4293 primop1);
4294 }
4295 else
4296 {
4297 /* Here we must do the comparison on the nominal type
4298 using the args exactly as we received them. */
4305 {
4307 /* All unsigned values are >= 0, so we warn. However,
4308 if OP0 is a constant that is >= 0, the signedness of
4309 the comparison isn't an issue, so suppress the
4310 warning. */
4315 primop0)))
4316 /* Do not warn for enumeration types. */
4320 {
4337 }
4340 {
4341 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4346 }
4347 }
4348 }
4356 }
4357 \f
4358 /* Return a tree for the sum or difference (RESULTCODE says which)
4359 of pointer PTROP and integer INTOP. */
4361 tree
4364 {
4367 /* The result is a pointer of the same type that is being added. */
4371 {
4378 }
4380 {
4387 }
4388 else
4391 /* We are manipulating pointer values, so we don't need to warn
4392 about relying on undefined signed overflow. We disable the
4393 warning here because we use integer types so fold won't know that
4394 they are really pointers. */
4397 /* If what we are about to multiply by the size of the elements
4398 contains a constant term, apply distributive law
4399 and multiply that constant term separately.
4400 This helps produce common subexpressions. */
4405 /* If the constant comes from pointer subtraction,
4406 skip this optimization--it would cause an error. */
4408 /* If the constant is unsigned, and smaller than the pointer size,
4409 then we must skip this optimization. This is because it could cause
4410 an overflow error if the constant is negative but INTOP is not. */
4414 {
4419 /* Convert both subexpression types to the type of intop,
4420 because weird cases involving pointer arithmetic
4421 can result in a sum or difference with different type args. */
4426 }
4428 /* Convert the integer argument to a type the same size as sizetype
4429 so the multiply won't overflow spuriously. */
4435 /* Replace the integer argument with a suitable product by the object size.
4436 Do this multiplication as signed, then convert to the appropriate type
4437 for the pointer operation and disregard an overflow that occurred only
4438 because of the sign-extension change in the latter conversion. */
4439 {
4446 }
4448 /* Create the sum or difference. */
4457 }
4458 \f
4459 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4460 and if NON_CONST is known not to be permitted in an evaluated part
4461 of a constant expression. */
4463 tree
4465 {
4469 /* This should never be called for C++. */
4473 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4482 }
4484 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4485 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4486 around the SAVE_EXPR if needed so that c_fully_fold does not need
4487 to look inside SAVE_EXPRs. */
4489 tree
4491 {
4500 }
4502 /* Return whether EXPR is a declaration whose address can never be
4503 NULL. */
4505 bool
4507 {
4512 }
4514 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4515 or for an `if' or `while' statement or ?..: exp. It should already
4516 have been validated to be of suitable type; otherwise, a bad
4517 diagnostic may result.
4519 The EXPR is located at LOCATION.
4521 This preparation consists of taking the ordinary
4522 representation of an expression expr and producing a valid tree
4523 boolean expression describing whether expr is nonzero. We could
4524 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4525 but we optimize comparisons, &&, ||, and !.
4527 The resulting type should always be `truthvalue_type_node'. */
4529 tree
4531 {
4533 {
4575 ? truthvalue_true_node
4581 ? truthvalue_true_node
4586 /* Fall through. */
4589 {
4592 {
4593 /* Common Ada/Pascal programmer's mistake. */
4595 OPT_Waddress,
4597 inner);
4599 }
4601 }
4618 /* These don't change whether an object is nonzero or zero. */
4623 /* These don't change whether an object is zero or nonzero, but
4624 we can't ignore them if their second arg has side-effects. */
4626 {
4629 c_common_truthvalue_conversion
4632 }
4633 else
4638 /* Distribute the conversion into the arms of a COND_EXPR. */
4640 {
4643 /* In C++ one of the arms might have void type if it is throw. */
4651 }
4652 else
4653 {
4654 /* Folding will happen later for C. */
4662 }
4664 CASE_CONVERT:
4665 {
4669 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4670 since that affects how `default_conversion' will behave. */
4674 /* Don't strip a conversion from C++0x scoped enum, since they
4675 don't implicitly convert to other types. */
4679 /* If this isn't narrowing the argument, we can ignore it. */
4683 }
4689 {
4693 }
4698 }
4701 {
4703 expr = (build_binary_op
4707 c_common_truthvalue_conversion
4710 c_common_truthvalue_conversion
4715 }
4718 {
4723 }
4724 else
4727 ret:
4730 }
4731 \f
4740 /* Apply the TYPE_QUALS to the new DECL. */
4742 void
4744 {
4752 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4753 constructor can produce constant init, so rely on cp_finish_decl to
4754 clear TREE_READONLY if the variable has non-constant init. */
4757 {
4760 }
4762 {
4764 /* Allow 'restrict' on arrays of pointers.
4765 FIXME currently we just ignore it. */
4771 }
4772 }
4774 /* Hash function for the problem of multiple type definitions in
4775 different files. This must hash all types that will compare
4776 equal via comptypes to the same value. In practice it hashes
4777 on some of the simple stuff and leaves the details to comptypes. */
4779 static hashval_t
4781 {
4785 tree t2;
4787 {
4788 /* For pointers, hash on pointee type plus some swizzling. */
4791 /* Hash on number of elements and total size. */
4810 }
4811 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4812 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4814 /* We might have a VLA here. */
4817 else
4820 }
4824 /* Return the typed-based alias set for T, which may be an expression
4825 or a type. Return -1 if we don't do anything special. */
4827 alias_set_type
4829 {
4830 tree u;
4833 /* For VLAs, use the alias set of the element type rather than the
4834 default of alias set 0 for types compared structurally. */
4836 {
4840 }
4842 /* Permit type-punning when accessing a union, provided the access
4843 is directly through the union. For example, this code does not
4844 permit taking the address of a union member and then storing
4845 through it. Even the type-punning allowed here is a GCC
4846 extension, albeit a common and useful one; the C standard says
4847 that such accesses have implementation-defined behavior. */
4855 /* That's all the expressions we handle specially. */
4859 /* The C standard guarantees that any object may be accessed via an
4860 lvalue that has character type. */
4866 /* The C standard specifically allows aliasing between signed and
4867 unsigned variants of the same type. We treat the signed
4868 variant as canonical. */
4870 {
4873 /* t1 == t can happen for boolean nodes which are always unsigned. */
4876 }
4878 /* Handle the case of multiple type nodes referring to "the same" type,
4879 which occurs with IMA. These share an alias set. FIXME: Currently only
4880 C90 is handled. (In C99 type compatibility is not transitive, which
4881 complicates things mightily. The alias set splay trees can theoretically
4882 represent this, but insertion is tricky when you consider all the
4883 different orders things might arrive in.) */
4888 /* Save time if there's only one input file. */
4892 /* Pointers need special handling if they point to any type that
4893 needs special handling (below). */
4895 {
4896 tree t2;
4897 /* Find bottom type under any nested POINTERs. */
4901 ;
4909 }
4910 /* These are the only cases that need special handling. */
4917 /* Undefined? */
4921 /* Look up t in hash table. Only one of the compatible types within each
4922 alias set is recorded in the table. */
4926 NULL);
4929 {
4932 }
4933 else
4934 /* Our caller will assign and record (in t) a new alias set; all we need
4935 to do is remember t in the hash table. */
4939 }
4940 \f
4941 /* Return the least alignment required for type TYPE. */
4943 unsigned int
4945 {
4948 #ifdef BIGGEST_FIELD_ALIGNMENT
4950 #endif
4952 #ifdef ADJUST_FIELD_ALIGN
4954 type);
4956 #endif
4959 }
4961 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4962 the IS_SIZEOF parameter indicates which operator is being applied.
4963 The COMPLAIN flag controls whether we should diagnose possibly
4964 ill-formed constructs or not. LOC is the location of the SIZEOF or
4965 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4966 a type in any context should be returned, rather than the normal
4967 alignment for that type. */
4969 tree
4973 {
4981 {
4983 {
4990 }
4991 else
4992 {
4994 {
4998 else
5001 }
5003 }
5004 }
5006 {
5014 }
5017 {
5022 }
5025 {
5030 }
5031 else
5032 {
5034 /* Convert in case a char is more than one unit. */
5040 else
5042 }
5044 /* VALUE will have the middle-end integer type sizetype.
5045 However, we should really return a value of type `size_t',
5046 which is just a typedef for an ordinary integer type. */
5050 }
5052 /* Implement the __alignof keyword: Return the minimum required
5053 alignment of EXPR, measured in bytes. For VAR_DECLs,
5054 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5055 from an "aligned" __attribute__ specification). LOC is the
5056 location of the ALIGNOF operator. */
5058 tree
5060 {
5061 tree t;
5068 {
5071 }
5077 {
5084 {
5091 }
5093 }
5094 else
5098 }
5099 \f
5100 /* Handle C and C++ default attributes. */
5102 enum built_in_attribute
5103 {
5104 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5105 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5106 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5107 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5108 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5110 #undef DEF_ATTR_NULL_TREE
5111 #undef DEF_ATTR_INT
5112 #undef DEF_ATTR_STRING
5113 #undef DEF_ATTR_IDENT
5114 #undef DEF_ATTR_TREE_LIST
5115 ATTR_LAST
5116 };
5122 enum c_builtin_type
5123 {
5124 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5125 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5126 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5127 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5128 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5129 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5130 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5131 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5132 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5133 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5134 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5135 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5136 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5137 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5138 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5139 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5140 NAME,
5141 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5143 #undef DEF_PRIMITIVE_TYPE
5144 #undef DEF_FUNCTION_TYPE_0
5145 #undef DEF_FUNCTION_TYPE_1
5146 #undef DEF_FUNCTION_TYPE_2
5147 #undef DEF_FUNCTION_TYPE_3
5148 #undef DEF_FUNCTION_TYPE_4
5149 #undef DEF_FUNCTION_TYPE_5
5150 #undef DEF_FUNCTION_TYPE_6
5151 #undef DEF_FUNCTION_TYPE_7
5152 #undef DEF_FUNCTION_TYPE_8
5153 #undef DEF_FUNCTION_TYPE_VAR_0
5154 #undef DEF_FUNCTION_TYPE_VAR_1
5155 #undef DEF_FUNCTION_TYPE_VAR_2
5156 #undef DEF_FUNCTION_TYPE_VAR_3
5157 #undef DEF_FUNCTION_TYPE_VAR_4
5158 #undef DEF_FUNCTION_TYPE_VAR_5
5159 #undef DEF_POINTER_TYPE
5160 BT_LAST
5161 };
5165 /* A temporary array for c_common_nodes_and_builtins. Used in
5166 communication with def_fn_type. */
5169 /* A helper function for c_common_nodes_and_builtins. Build function type
5170 for DEF with return type RET and N arguments. If VAR is true, then the
5171 function should be variadic after those N arguments.
5173 Takes special care not to ICE if any of the types involved are
5174 error_mark_node, which indicates that said type is not in fact available
5175 (see builtin_type_for_size). In which case the function type as a whole
5176 should be error_mark_node. */
5178 static void
5180 {
5181 tree t;
5188 {
5194 }
5201 else
5204 egress:
5207 }
5209 /* Build builtin functions common to both C and C++ language
5210 frontends. */
5212 static void
5214 {
5215 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5216 builtin_types[ENUM] = VALUE;
5217 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5218 def_fn_type (ENUM, RETURN, 0, 0);
5219 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5220 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5221 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5222 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5223 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5224 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5225 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5226 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5227 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5228 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5229 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5230 ARG6) \
5231 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5232 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5233 ARG6, ARG7) \
5234 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5235 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5236 ARG6, ARG7, ARG8) \
5237 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5238 ARG7, ARG8);
5239 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5240 def_fn_type (ENUM, RETURN, 1, 0);
5241 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5242 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5243 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5244 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5245 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5246 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5247 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5248 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5249 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5250 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5251 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5252 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5256 #undef DEF_PRIMITIVE_TYPE
5257 #undef DEF_FUNCTION_TYPE_1
5258 #undef DEF_FUNCTION_TYPE_2
5259 #undef DEF_FUNCTION_TYPE_3
5260 #undef DEF_FUNCTION_TYPE_4
5261 #undef DEF_FUNCTION_TYPE_5
5262 #undef DEF_FUNCTION_TYPE_6
5263 #undef DEF_FUNCTION_TYPE_VAR_0
5264 #undef DEF_FUNCTION_TYPE_VAR_1
5265 #undef DEF_FUNCTION_TYPE_VAR_2
5266 #undef DEF_FUNCTION_TYPE_VAR_3
5267 #undef DEF_FUNCTION_TYPE_VAR_4
5268 #undef DEF_FUNCTION_TYPE_VAR_5
5269 #undef DEF_POINTER_TYPE
5274 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5275 NONANSI_P, ATTRS, IMPLICIT, COND) \
5276 if (NAME && COND) \
5277 def_builtin_1 (ENUM, NAME, CLASS, \
5278 builtin_types[(int) TYPE], \
5279 builtin_types[(int) LIBTYPE], \
5280 BOTH_P, FALLBACK_P, NONANSI_P, \
5281 built_in_attributes[(int) ATTRS], IMPLICIT);
5283 #undef DEF_BUILTIN
5291 }
5293 /* Like get_identifier, but avoid warnings about null arguments when
5294 the argument may be NULL for targets where GCC lacks stdint.h type
5295 information. */
5299 {
5301 }
5303 /* Build tree nodes and builtin functions common to both C and C++ language
5304 frontends. */
5306 void
5308 {
5312 tree array_domain_type;
5313 tree va_list_ref_type_node;
5314 tree va_list_arg_type_node;
5318 /* Define `int' and `char' first so that dbx will output them first. */
5322 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5323 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5324 but not C. Are the conditionals here needed? */
5330 long_unsigned_type_node);
5332 {
5334 int128_integer_type_node);
5336 int128_unsigned_type_node);
5337 }
5341 long_long_integer_type_node);
5343 long_long_unsigned_type_node);
5346 long_long_unsigned_type_node);
5349 short_unsigned_type_node);
5352 short_unsigned_type_node);
5354 /* Define both `signed char' and `unsigned char'. */
5358 /* These are types that c_common_type_for_size and
5359 c_common_type_for_mode use. */
5362 intQI_type_node));
5365 intHI_type_node));
5368 intSI_type_node));
5371 intDI_type_node));
5372 #if HOST_BITS_PER_WIDE_INT >= 64
5375 TYPE_DECL,
5377 intTI_type_node));
5378 #endif
5381 unsigned_intQI_type_node));
5384 unsigned_intHI_type_node));
5387 unsigned_intSI_type_node));
5390 unsigned_intDI_type_node));
5391 #if HOST_BITS_PER_WIDE_INT >= 64
5394 TYPE_DECL,
5396 unsigned_intTI_type_node));
5397 #endif
5399 /* Create the widest literal types. */
5400 widest_integer_literal_type_node
5404 widest_integer_literal_type_node));
5406 widest_unsigned_literal_type_node
5410 widest_unsigned_literal_type_node));
5414 pid_type_node =
5421 /* Only supported decimal floating point extension if the target
5422 actually supports underlying modes. */
5426 {
5430 }
5433 {
5438 long_long_fract_type_node);
5440 unsigned_short_fract_type_node);
5442 unsigned_fract_type_node);
5444 unsigned_long_fract_type_node);
5446 unsigned_long_long_fract_type_node);
5448 sat_short_fract_type_node);
5451 sat_long_fract_type_node);
5453 sat_long_long_fract_type_node);
5455 sat_unsigned_short_fract_type_node);
5457 sat_unsigned_fract_type_node);
5459 sat_unsigned_long_fract_type_node);
5461 sat_unsigned_long_long_fract_type_node);
5466 long_long_accum_type_node);
5468 unsigned_short_accum_type_node);
5470 unsigned_accum_type_node);
5472 unsigned_long_accum_type_node);
5474 unsigned_long_long_accum_type_node);
5476 sat_short_accum_type_node);
5479 sat_long_accum_type_node);
5481 sat_long_long_accum_type_node);
5483 sat_unsigned_short_accum_type_node);
5485 sat_unsigned_accum_type_node);
5487 sat_unsigned_long_accum_type_node);
5489 sat_unsigned_long_long_accum_type_node);
5491 }
5494 TYPE_DECL,
5496 complex_integer_type_node));
5498 TYPE_DECL,
5500 complex_float_type_node));
5502 TYPE_DECL,
5504 complex_double_type_node));
5508 complex_long_double_type_node));
5511 /* For C++, make fileptr_type_node a distinct void * type until
5512 FILE type is defined. */
5517 /* Set the TYPE_NAME for any variants that were built before
5518 record_builtin_type gave names to the built-in types. */
5519 {
5525 }
5527 /* This node must not be shared. */
5533 /* Make a type to be the domain of a few array types
5534 whose domains don't really matter.
5535 200 is small enough that it always fits in size_t
5536 and large enough that it can hold most function names for the
5537 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5540 /* Make a type for arrays of characters.
5541 With luck nothing will ever really depend on the length of this
5542 array type. */
5543 char_array_type_node
5547 const_string_type_node
5551 /* This is special for C++ so functions can be overloaded. */
5557 {
5560 else
5563 }
5565 /* This is for wide string constants. */
5566 wchar_array_type_node
5569 /* Define 'char16_t'. */
5574 {
5579 }
5581 /* This is for UTF-16 string constants. */
5582 char16_array_type_node
5585 /* Define 'char32_t'. */
5590 {
5595 }
5597 /* This is for UTF-32 string constants. */
5598 char32_array_type_node
5601 wint_type_node =
5604 intmax_type_node =
5606 uintmax_type_node =
5610 sig_atomic_type_node =
5613 int8_type_node =
5616 int16_type_node =
5619 int32_type_node =
5622 int64_type_node =
5625 uint8_type_node =
5637 int_least8_type_node =
5640 int_least16_type_node =
5643 int_least32_type_node =
5646 int_least64_type_node =
5649 uint_least8_type_node =
5652 uint_least16_type_node =
5655 uint_least32_type_node =
5658 uint_least64_type_node =
5661 int_fast8_type_node =
5664 int_fast16_type_node =
5667 int_fast32_type_node =
5670 int_fast64_type_node =
5673 uint_fast8_type_node =
5676 uint_fast16_type_node =
5679 uint_fast32_type_node =
5682 uint_fast64_type_node =
5685 intptr_type_node =
5688 uintptr_type_node =
5691 default_function_type
5693 ptrdiff_type_node
5700 va_list_type_node));
5702 {
5705 tree ptype;
5708 {
5712 ptype));
5714 }
5715 }
5718 {
5721 }
5722 else
5723 {
5726 }
5733 /* Create the built-in __null node. It is important that this is
5734 not shared. */
5738 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5740 }
5742 /* The number of named compound-literals generated thus far. */
5745 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5747 void
5749 {
5752 compound_literal_number);
5753 compound_literal_number++;
5755 }
5757 tree
5759 {
5763 }
5766 /* Linked list of disabled built-in functions. */
5769 {
5777 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5778 begins with "__builtin_", give an error. */
5780 void
5782 {
5785 else
5786 {
5791 }
5792 }
5795 /* Return true if the built-in function NAME has been disabled, false
5796 otherwise. */
5798 static bool
5800 {
5803 {
5806 }
5808 }
5811 /* Worker for DEF_BUILTIN.
5812 Possibly define a builtin function with one or two names.
5813 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5814 nonansi_p and flag_no_nonansi_builtin. */
5816 static void
5823 {
5824 tree decl;
5837 fnattrs);
5846 }
5847 \f
5848 /* Nonzero if the type T promotes to int. This is (nearly) the
5849 integral promotions defined in ISO C99 6.3.1.1/2. */
5851 bool
5853 {
5855 {
5865 /* ??? Technically all enumerations not larger than an int
5866 promote to an int. But this is used along code paths
5867 that only want to notice a size change. */
5875 }
5876 }
5878 /* Return 1 if PARMS specifies a fixed number of parameters
5879 and none of their types is affected by default promotions. */
5881 int
5883 {
5884 const_tree t;
5886 {
5903 }
5905 }
5907 /* Recursively remove any '*' or '&' operator from TYPE. */
5908 tree
5910 {
5914 }
5916 /* Recursively remove pointer or array type from TYPE. */
5917 tree
5919 {
5923 }
5925 /* Used to compare case labels. K1 and K2 are actually tree nodes
5926 representing case labels, or NULL_TREE for a `default' label.
5927 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5928 K2, and 0 if K1 and K2 are equal. */
5930 int
5932 {
5933 /* Consider a NULL key (such as arises with a `default' label) to be
5934 smaller than anything else. */
5941 }
5943 /* Process a case label, located at LOC, for the range LOW_VALUE
5944 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5945 then this case label is actually a `default' label. If only
5946 HIGH_VALUE is NULL_TREE, then case label was declared using the
5947 usual C/C++ syntax, rather than the GNU case range extension.
5948 CASES is a tree containing all the case ranges processed so far;
5949 COND is the condition for the switch-statement itself. Returns the
5950 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5951 is created. */
5953 tree
5956 {
5957 tree type;
5958 tree label;
5959 tree case_label;
5960 splay_tree_node node;
5962 /* Create the LABEL_DECL itself. */
5965 /* If there was an error processing the switch condition, bail now
5966 before we get more confused. */
5974 {
5977 }
5979 /* Case ranges are a GNU extension. */
5986 {
5991 }
5993 {
5998 }
6001 {
6002 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6003 really a case range, even though it was written that way.
6004 Remove the HIGH_VALUE to simplify later processing. */
6009 }
6011 /* See if the case is in range of the type of the original testing
6012 expression. If both low_value and high_value are out of range,
6013 don't insert the case label and return NULL_TREE. */
6019 /* Look up the LOW_VALUE in the table of case labels we already
6020 have. */
6022 /* If there was not an exact match, check for overlapping ranges.
6023 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6024 that's a `default' label and the only overlap is an exact match. */
6026 {
6027 splay_tree_node low_bound;
6028 splay_tree_node high_bound;
6030 /* Even though there wasn't an exact match, there might be an
6031 overlap between this case range and another case range.
6032 Since we've (inductively) not allowed any overlapping case
6033 ranges, we simply need to find the greatest low case label
6034 that is smaller that LOW_VALUE, and the smallest low case
6035 label that is greater than LOW_VALUE. If there is an overlap
6036 it will occur in one of these two ranges. */
6042 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6043 the LOW_VALUE, so there is no need to check unless the
6044 LOW_BOUND is in fact itself a case range. */
6050 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6051 range is bigger than the low end of the current range, so we
6052 are only interested if the current range is a real range, and
6053 not an ordinary case label. */
6055 && high_value
6057 high_value)
6060 }
6061 /* If there was an overlap, issue an error. */
6063 {
6067 {
6071 }
6073 {
6076 }
6077 else
6078 {
6082 }
6084 }
6086 /* Add a CASE_LABEL to the statement-tree. */
6088 /* Register this case label in the splay tree. */
6095 error_out:
6096 /* Add a label so that the back-end doesn't think that the beginning of
6097 the switch is unreachable. Note that we do not add a case label, as
6098 that just leads to duplicates and thence to failure later on. */
6100 {
6103 }
6105 }
6107 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6108 Used to verify that case values match up with enumerator values. */
6110 static void
6112 {
6119 else
6126 buf);
6127 else
6132 }
6134 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6135 Used to verify that case values match up with enumerator values. */
6137 static int
6139 {
6143 /* Skip default case. */
6147 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6148 when we did our enum->case scan. Reset our scratch bit after. */
6151 else
6154 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6155 not set, that means that CASE_HIGH did not appear when we did our
6156 enum->case scan. Reset our scratch bit after. */
6158 {
6161 else
6163 }
6166 }
6168 /* Handle -Wswitch*. Called from the front end after parsing the
6169 switch construct. */
6170 /* ??? Should probably be somewhere generic, since other languages
6171 besides C and C++ would want this. At the moment, however, C/C++
6172 are the only tree-ssa languages that support enumerations at all,
6173 so the point is moot. */
6175 void
6178 {
6179 splay_tree_node default_node;
6180 splay_tree_node node;
6181 tree chain;
6191 /* From here on, we only care about about enumerated types. */
6195 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6199 /* Check the cases. Warn about case values which are not members of
6200 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6201 there is no default case, check that exactly all enumeration
6202 literals are covered by the cases. */
6204 /* Clearing COND if it is not an integer constant simplifies
6205 the tests inside the loop below. */
6209 /* The time complexity here is O(N*lg(N)) worst case, but for the
6210 common case of monotonically increasing enumerators, it is
6211 O(N), since the nature of the splay tree will keep the next
6212 element adjacent to the root at all times. */
6215 {
6221 {
6222 /* Mark the CASE_LOW part of the case entry as seen. */
6226 }
6228 /* Even though there wasn't an exact match, there might be a
6229 case range which includes the enumerator's value. */
6232 {
6236 {
6237 /* If we match the upper bound exactly, mark the CASE_HIGH
6238 part of the case entry as seen. */
6242 }
6243 }
6245 /* We've now determined that this enumerated literal isn't
6246 handled by the case labels of the switch statement. */
6248 /* If the switch expression is a constant, we only really care
6249 about whether that constant is handled by the switch. */
6253 /* If there is a default_node, the only relevant option is
6254 Wswitch-enum. Otherwise, if both are enabled then we prefer
6255 to warn using -Wswitch because -Wswitch is enabled by -Wall
6256 while -Wswitch-enum is explicit. */
6259 ? OPT_Wswitch_enum
6263 }
6265 /* Warn if there are case expressions that don't correspond to
6266 enumerators. This can occur since C and C++ don't enforce
6267 type-checking of assignments to enumeration variables.
6269 The time complexity here is now always O(N) worst case, since
6270 we should have marked both the lower bound and upper bound of
6271 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6272 above. This scan also resets those fields. */
6275 }
6277 /* Finish an expression taking the address of LABEL (an
6278 IDENTIFIER_NODE). Returns an expression for the address.
6280 LOC is the location for the expression returned. */
6282 tree
6284 {
6285 tree result;
6295 else
6296 {
6299 /* The current function is not necessarily uninlinable.
6300 Computed gotos are incompatible with inlining, but the value
6301 here could be used only in a diagnostic, for example. */
6303 }
6306 }
6307 \f
6309 /* Given a boolean expression ARG, return a tree representing an increment
6310 or decrement (as indicated by CODE) of ARG. The front end must check for
6311 invalid cases (e.g., decrement in C++). */
6312 tree
6314 {
6315 tree val;
6320 {
6343 }
6346 }
6347 \f
6348 /* Built-in macros for stddef.h and stdint.h, that require macros
6349 defined in this file. */
6350 void
6352 {
6415 }
6417 static void
6419 {
6420 /* Fill in the built_in_attributes array. */
6421 #define DEF_ATTR_NULL_TREE(ENUM) \
6422 built_in_attributes[(int) ENUM] = NULL_TREE;
6423 #define DEF_ATTR_INT(ENUM, VALUE) \
6424 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6425 #define DEF_ATTR_STRING(ENUM, VALUE) \
6426 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6427 #define DEF_ATTR_IDENT(ENUM, STRING) \
6428 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6429 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6430 built_in_attributes[(int) ENUM] \
6431 = tree_cons (built_in_attributes[(int) PURPOSE], \
6432 built_in_attributes[(int) VALUE], \
6433 built_in_attributes[(int) CHAIN]);
6435 #undef DEF_ATTR_NULL_TREE
6436 #undef DEF_ATTR_INT
6437 #undef DEF_ATTR_IDENT
6438 #undef DEF_ATTR_TREE_LIST
6439 }
6441 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6442 identifier as an argument, so the front end shouldn't look it up. */
6444 bool
6446 {
6449 /* Unknown attribute that we'll end up ignoring, return true so we
6450 don't complain about an identifier argument. */
6456 else
6458 }
6460 /* Attribute handlers common to C front ends. */
6462 /* Handle a "packed" attribute; arguments as in
6463 struct attribute_spec.handler. */
6465 static tree
6468 {
6470 {
6474 }
6476 {
6478 /* Still pack bitfields. */
6483 else
6485 }
6486 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6487 used for DECL_REGISTER. It wouldn't mean anything anyway.
6488 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6489 that changes what the typedef is typing. */
6490 else
6491 {
6494 }
6497 }
6499 /* Handle a "nocommon" attribute; arguments as in
6500 struct attribute_spec.handler. */
6502 static tree
6506 {
6509 else
6510 {
6513 }
6516 }
6518 /* Handle a "common" attribute; arguments as in
6519 struct attribute_spec.handler. */
6521 static tree
6524 {
6527 else
6528 {
6531 }
6534 }
6536 /* Handle a "noreturn" attribute; arguments as in
6537 struct attribute_spec.handler. */
6539 static tree
6542 {
6545 /* See FIXME comment in c_common_attribute_table. */
6552 = build_pointer_type
6555 else
6556 {
6559 }
6562 }
6564 /* Handle a "hot" and attribute; arguments as in
6565 struct attribute_spec.handler. */
6567 static tree
6570 {
6573 {
6575 {
6579 }
6580 /* Most of the rest of the hot processing is done later with
6581 lookup_attribute. */
6582 }
6583 else
6584 {
6587 }
6590 }
6592 /* Handle a "cold" and attribute; arguments as in
6593 struct attribute_spec.handler. */
6595 static tree
6598 {
6601 {
6603 {
6607 }
6608 /* Most of the rest of the cold processing is done later with
6609 lookup_attribute. */
6610 }
6611 else
6612 {
6615 }
6618 }
6620 /* Handle a "no_sanitize_address" attribute; arguments as in
6621 struct attribute_spec.handler. */
6623 static tree
6626 {
6628 {
6631 }
6634 }
6636 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6637 struct attribute_spec.handler. */
6639 static tree
6642 {
6651 }
6653 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6654 struct attribute_spec.handler. */
6656 static tree
6659 {
6661 {
6664 }
6667 }
6669 /* Handle a "noinline" attribute; arguments as in
6670 struct attribute_spec.handler. */
6672 static tree
6676 {
6678 {
6680 {
6684 }
6685 else
6687 }
6688 else
6689 {
6692 }
6695 }
6697 /* Handle a "noclone" attribute; arguments as in
6698 struct attribute_spec.handler. */
6700 static tree
6704 {
6706 {
6709 }
6712 }
6714 /* Handle a "always_inline" attribute; arguments as in
6715 struct attribute_spec.handler. */
6717 static tree
6722 {
6724 {
6726 {
6730 }
6731 else
6732 /* Set the attribute and mark it for disregarding inline
6733 limits. */
6735 }
6736 else
6737 {
6740 }
6743 }
6745 /* Handle a "gnu_inline" attribute; arguments as in
6746 struct attribute_spec.handler. */
6748 static tree
6753 {
6755 {
6756 /* Do nothing else, just set the attribute. We'll get at
6757 it later with lookup_attribute. */
6758 }
6759 else
6760 {
6763 }
6766 }
6768 /* Handle a "leaf" attribute; arguments as in
6769 struct attribute_spec.handler. */
6771 static tree
6775 {
6777 {
6780 }
6782 {
6785 }
6788 }
6790 /* Handle an "artificial" attribute; arguments as in
6791 struct attribute_spec.handler. */
6793 static tree
6798 {
6800 {
6801 /* Do nothing else, just set the attribute. We'll get at
6802 it later with lookup_attribute. */
6803 }
6804 else
6805 {
6808 }
6811 }
6813 /* Handle a "flatten" attribute; arguments as in
6814 struct attribute_spec.handler. */
6816 static tree
6818 tree args ATTRIBUTE_UNUSED,
6820 {
6822 /* Do nothing else, just set the attribute. We'll get at
6823 it later with lookup_attribute. */
6824 ;
6825 else
6826 {
6829 }
6832 }
6834 /* Handle a "warning" or "error" attribute; arguments as in
6835 struct attribute_spec.handler. */
6837 static tree
6840 {
6843 /* Do nothing else, just set the attribute. We'll get at
6844 it later with lookup_attribute. */
6845 ;
6846 else
6847 {
6850 }
6853 }
6855 /* Handle a "used" attribute; arguments as in
6856 struct attribute_spec.handler. */
6858 static tree
6861 {
6867 {
6872 }
6873 else
6874 {
6877 }
6880 }
6882 /* Handle a "unused" attribute; arguments as in
6883 struct attribute_spec.handler. */
6885 static tree
6888 {
6890 {
6898 {
6903 }
6904 else
6905 {
6908 }
6909 }
6910 else
6911 {
6915 }
6918 }
6920 /* Handle a "externally_visible" attribute; arguments as in
6921 struct attribute_spec.handler. */
6923 static tree
6928 {
6932 {
6935 {
6939 }
6940 }
6941 else
6942 {
6945 }
6948 }
6950 /* Handle a "const" attribute; arguments as in
6951 struct attribute_spec.handler. */
6953 static tree
6956 {
6959 /* See FIXME comment on noreturn in c_common_attribute_table. */
6965 = build_pointer_type
6968 else
6969 {
6972 }
6975 }
6977 /* Handle a "transparent_union" attribute; arguments as in
6978 struct attribute_spec.handler. */
6980 static tree
6984 {
6985 tree type;
6996 {
6997 /* Make sure that the first field will work for a transparent union.
6998 If the type isn't complete yet, leave the check to the code in
6999 finish_struct. */
7001 {
7007 }
7010 {
7011 /* If the type isn't complete yet, setting the flag
7012 on a variant wouldn't ever be checked. */
7016 /* build_duplicate_type doesn't work for C++. */
7020 /* A type variant isn't good enough, since we don't a cast
7021 to such a type removed as a no-op. */
7023 }
7027 }
7029 ignored:
7032 }
7034 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7035 get the requested priority for a constructor or destructor,
7036 possibly issuing diagnostics for invalid or reserved
7037 priorities. */
7039 static priority_type
7041 {
7042 HOST_WIDE_INT pri;
7043 tree arg;
7049 {
7052 else
7055 }
7072 {
7075 "destructor priorities from 0 to %d are reserved "
7077 MAX_RESERVED_INIT_PRIORITY);
7078 else
7080 "constructor priorities from 0 to %d are reserved "
7082 MAX_RESERVED_INIT_PRIORITY);
7083 }
7086 invalid:
7089 MAX_INIT_PRIORITY);
7090 else
7092 MAX_INIT_PRIORITY);
7094 }
7096 /* Handle a "constructor" attribute; arguments as in
7097 struct attribute_spec.handler. */
7099 static tree
7103 {
7110 {
7111 priority_type priority;
7116 }
7117 else
7118 {
7121 }
7124 }
7126 /* Handle a "destructor" attribute; arguments as in
7127 struct attribute_spec.handler. */
7129 static tree
7133 {
7140 {
7141 priority_type priority;
7146 }
7147 else
7148 {
7151 }
7154 }
7156 /* Nonzero if the mode is a valid vector mode for this architecture.
7157 This returns nonzero even if there is no hardware support for the
7158 vector mode, but we can emulate with narrower modes. */
7160 static int
7162 {
7166 /* Doh! What's going on? */
7175 /* Hardware support. Woo hoo! */
7181 /* We should probably return 1 if requesting V4DI and we have no DI,
7182 but we have V2DI, but this is probably very unlikely. */
7184 /* If we have support for the inner mode, we can safely emulate it.
7185 We may not have V2DI, but me can emulate with a pair of DIs. */
7187 }
7190 /* Handle a "mode" attribute; arguments as in
7191 struct attribute_spec.handler. */
7193 static tree
7196 {
7204 else
7205 {
7210 tree typefm;
7215 {
7221 }
7223 /* Change this type to have a type with the specified mode.
7224 First check for the special modes. */
7237 else
7240 {
7243 }
7246 {
7249 }
7253 {
7285 }
7287 {
7290 }
7293 {
7298 {
7301 }
7305 else
7308 }
7309 else
7310 {
7311 /* For fixed-point modes, we need to test if the signness of type
7312 and the machine mode are consistent. */
7315 {
7318 }
7319 /* For fixed-point modes, we need to pass saturating info. */
7323 }
7326 {
7329 }
7331 {
7332 /* For enumeral types, copy the precision from the integer
7333 type returned above. If not an INTEGER_TYPE, we can't use
7334 this mode for this type. */
7336 {
7339 }
7342 {
7345 }
7346 else
7347 {
7348 /* We cannot build a type variant, as there's code that assumes
7349 that TYPE_MAIN_VARIANT has the same mode. This includes the
7350 debug generators. Instead, create a subrange type. This
7351 results in all of the enumeral values being emitted only once
7352 in the original, and the subtype gets them by reference. */
7355 else
7358 }
7359 }
7363 {
7366 }
7369 }
7372 }
7374 /* Handle a "section" attribute; arguments as in
7375 struct attribute_spec.handler. */
7377 static tree
7380 {
7384 {
7390 {
7394 {
7396 "section attribute cannot be specified for "
7399 }
7401 /* The decl may have already been given a section attribute
7402 from a previous declaration. Ensure they match. */
7406 {
7410 }
7414 {
7417 }
7418 else
7420 }
7421 else
7422 {
7425 }
7426 }
7427 else
7428 {
7432 }
7435 }
7437 /* Check whether ALIGN is a valid user-specified alignment. If so,
7438 return its base-2 log; if not, output an error and return -1. If
7439 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7440 no error. */
7441 int
7443 {
7448 {
7451 }
7456 {
7459 }
7461 {
7464 }
7466 }
7468 /*
7469 If in c++-11, check if the c++-11 alignment constraint with respect
7470 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7471 c++-11 mode, does nothing.
7473 [dcl.align]2/ says:
7475 [* if the constant expression evaluates to a fundamental alignment,
7476 the alignment requirement of the declared entity shall be the
7477 specified fundamental alignment.
7479 * if the constant expression evaluates to an extended alignment
7480 and the implementation supports that alignment in the context
7481 of the declaration, the alignment of the declared entity shall
7482 be that alignment
7484 * if the constant expression evaluates to an extended alignment
7485 and the implementation does not support that alignment in the
7486 context of the declaration, the program is ill-formed]. */
7488 static bool
7492 {
7505 {
7507 {
7508 /* For file scope variables and static members, the target
7509 supports alignments that are at most
7510 MAX_OFILE_ALIGNMENT. */
7513 }
7514 else
7515 {
7516 #ifdef BIGGEST_FIELD_ALIGNMENT
7517 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7518 #else
7519 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7520 #endif
7521 /* For non-static members, the target supports either
7522 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7523 if it is defined or BIGGEST_ALIGNMENT. */
7528 #undef MAX_TARGET_FIELD_ALIGNMENT
7529 /* For stack variables, the target supports at most
7530 MAX_STACK_ALIGNMENT. */
7534 }
7535 }
7537 {
7538 /* Let's be liberal for types. */
7541 }
7549 }
7551 /* Handle a "aligned" attribute; arguments as in
7552 struct attribute_spec.handler. */
7554 static tree
7557 {
7561 tree align_expr;
7565 {
7569 }
7570 else
7574 {
7578 }
7586 {
7589 /* If we have a TYPE_DECL, then copy the type, so that we
7590 don't accidentally modify a builtin type. See pushdecl. */
7593 {
7600 }
7601 else
7606 }
7609 {
7612 }
7615 /* C++-11 [dcl.align/4]:
7617 When multiple alignment-specifiers are specified for an
7618 entity, the alignment requirement shall be set to the
7619 strictest specified alignment.
7621 This formally comes from the c++11 specification but we are
7622 doing it for the GNU attribute syntax as well. */
7626 {
7631 else
7635 }
7636 else
7637 {
7640 }
7643 }
7645 /* Handle a "weak" attribute; arguments as in
7646 struct attribute_spec.handler. */
7648 static tree
7653 {
7656 {
7659 }
7661 {
7665 }
7669 else
7673 }
7675 /* Handle an "alias" or "ifunc" attribute; arguments as in
7676 struct attribute_spec.handler, except that IS_ALIAS tells us
7677 whether this is an alias as opposed to ifunc attribute. */
7679 static tree
7682 {
7687 {
7690 }
7694 /* A static variable declaration is always a tentative definition,
7695 but the alias is a non-tentative definition which overrides. */
7698 {
7702 }
7706 {
7710 }
7712 /* Note that the very first time we process a nested declaration,
7713 decl_function_context will not be set. Indeed, *would* never
7714 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7715 we do below. After such frobbery, pushdecl would set the context.
7716 In any case, this is never what we want. */
7718 {
7719 tree id;
7723 {
7727 }
7729 /* This counts as a use of the object pointed to. */
7734 else
7738 /* ifuncs are also aliases, so set that attribute too. */
7741 }
7742 else
7743 {
7746 }
7749 }
7751 /* Handle an "alias" or "ifunc" attribute; arguments as in
7752 struct attribute_spec.handler. */
7754 static tree
7757 {
7759 }
7761 /* Handle an "alias" or "ifunc" attribute; arguments as in
7762 struct attribute_spec.handler. */
7764 static tree
7767 {
7769 }
7771 /* Handle a "weakref" attribute; arguments as in struct
7772 attribute_spec.handler. */
7774 static tree
7777 {
7780 /* We must ignore the attribute when it is associated with
7781 local-scoped decls, since attribute alias is ignored and many
7782 such symbols do not even have a DECL_WEAK field. */
7784 || current_function_decl
7786 {
7790 }
7793 {
7797 }
7799 /* The idea here is that `weakref("name")' mutates into `weakref,
7800 alias("name")', and weakref without arguments, in turn,
7801 implicitly adds weak. */
7804 {
7811 }
7812 else
7813 {
7818 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7819 and that isn't supported; and because it wants to add it to
7820 the list of weak decls, which isn't helpful. */
7822 }
7825 }
7827 /* Handle an "visibility" attribute; arguments as in
7828 struct attribute_spec.handler. */
7830 static tree
7834 {
7840 {
7844 {
7846 name);
7848 }
7850 {
7854 }
7855 }
7857 {
7860 }
7863 {
7866 }
7868 /* If this is a type, set the visibility on the type decl. */
7870 {
7875 {
7877 name);
7879 }
7880 }
7890 else
7891 {
7892 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7894 }
7898 {
7912 }
7917 /* Go ahead and attach the attribute to the node as well. This is needed
7918 so we can determine whether we have VISIBILITY_DEFAULT because the
7919 visibility was not specified, or because it was explicitly overridden
7920 from the containing scope. */
7923 }
7925 /* Determine the ELF symbol visibility for DECL, which is either a
7926 variable or a function. It is an error to use this function if a
7927 definition of DECL is not available in this translation unit.
7928 Returns true if the final visibility has been determined by this
7929 function; false if the caller is free to make additional
7930 modifications. */
7932 bool
7934 {
7938 /* If the user explicitly specified the visibility with an
7939 attribute, honor that. DECL_VISIBILITY will have been set during
7940 the processing of the attribute. We check for an explicit
7941 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7942 to distinguish the use of an attribute from the use of a "#pragma
7943 GCC visibility push(...)"; in the latter case we still want other
7944 considerations to be able to overrule the #pragma. */
7946 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7951 /* Set default visibility to whatever the user supplied with
7952 visibility_specified depending on #pragma GCC visibility. */
7954 {
7957 {
7960 /* If visibility changed and DECL already has DECL_RTL, ensure
7961 symbol flags are updated. */
7966 }
7967 }
7969 }
7971 /* Handle an "tls_model" attribute; arguments as in
7972 struct attribute_spec.handler. */
7974 static tree
7977 {
7978 tree id;
7985 {
7988 }
7993 {
7996 }
8006 else
8007 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8011 }
8013 /* Handle a "no_instrument_function" attribute; arguments as in
8014 struct attribute_spec.handler. */
8016 static tree
8021 {
8025 {
8029 }
8030 else
8034 }
8036 /* Handle a "malloc" attribute; arguments as in
8037 struct attribute_spec.handler. */
8039 static tree
8042 {
8046 else
8047 {
8050 }
8053 }
8055 /* Handle a "alloc_size" attribute; arguments as in
8056 struct attribute_spec.handler. */
8058 static tree
8061 {
8064 {
8071 || !arg_count
8073 {
8078 }
8079 }
8081 }
8083 /* Handle a "alloc_align" attribute; arguments as in
8084 struct attribute_spec.handler. */
8086 static tree
8089 {
8096 || !arg_count
8098 {
8103 }
8105 }
8107 /* Handle a "assume_aligned" attribute; arguments as in
8108 struct attribute_spec.handler. */
8110 static tree
8113 {
8115 {
8122 {
8127 }
8128 }
8130 }
8132 /* Handle a "fn spec" attribute; arguments as in
8133 struct attribute_spec.handler. */
8135 static tree
8139 {
8144 }
8146 /* Handle a "warn_unused" attribute; arguments as in
8147 struct attribute_spec.handler. */
8149 static tree
8151 tree args ATTRIBUTE_UNUSED,
8153 {
8155 /* Do nothing else, just set the attribute. We'll get at
8156 it later with lookup_attribute. */
8157 ;
8158 else
8159 {
8162 }
8165 }
8167 /* Handle an "omp declare simd" attribute; arguments as in
8168 struct attribute_spec.handler. */
8170 static tree
8172 {
8174 }
8176 /* Handle an "omp declare target" attribute; arguments as in
8177 struct attribute_spec.handler. */
8179 static tree
8181 {
8183 }
8185 /* Handle a "returns_twice" attribute; arguments as in
8186 struct attribute_spec.handler. */
8188 static tree
8191 {
8194 else
8195 {
8198 }
8201 }
8203 /* Handle a "no_limit_stack" attribute; arguments as in
8204 struct attribute_spec.handler. */
8206 static tree
8211 {
8215 {
8219 }
8221 {
8225 }
8226 else
8230 }
8232 /* Handle a "pure" attribute; arguments as in
8233 struct attribute_spec.handler. */
8235 static tree
8238 {
8241 /* ??? TODO: Support types. */
8242 else
8243 {
8246 }
8249 }
8251 /* Digest an attribute list destined for a transactional memory statement.
8252 ALLOWED is the set of attributes that are allowed for this statement;
8253 return the attribute we parsed. Multiple attributes are never allowed. */
8255 int
8257 {
8262 {
8270 {
8273 }
8276 {
8279 }
8282 else
8284 }
8287 }
8289 /* Transform a TM attribute name into a maskable integer and back.
8290 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8291 to how the lack of an attribute is treated. */
8293 int
8295 {
8309 }
8311 tree
8313 {
8316 {
8334 }
8336 }
8338 /* Return the first TM attribute seen in LIST. */
8340 tree
8342 {
8344 {
8348 }
8350 }
8352 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8353 Here we accept only function types, and verify that none of the other
8354 function TM attributes are also applied. */
8355 /* ??? We need to accept class types for C++, but not C. This greatly
8356 complicates this function, since we can no longer rely on the extra
8357 processing given by function_type_required. */
8359 static tree
8362 {
8363 /* Only one path adds the attribute; others don't. */
8367 {
8370 /* Only tm_callable and tm_safe apply to classes. */
8373 /* FALLTHRU */
8377 {
8380 ;
8383 else
8385 }
8389 {
8392 {
8397 }
8398 }
8399 /* FALLTHRU */
8402 /* If a function is next, pass it on to be tried next. */
8406 ignored:
8409 }
8412 }
8414 /* Handle the TM_WRAP attribute; arguments as in
8415 struct attribute_spec.handler. */
8417 static tree
8420 {
8423 /* We don't need the attribute even on success, since we
8424 record the entry in an external table. */
8429 else
8430 {
8436 else
8437 {
8441 {
8445 else
8447 }
8448 else
8450 }
8451 }
8454 }
8456 /* Ignore the given attribute. Used when this attribute may be usefully
8457 overridden by the target, but is not used generically. */
8459 static tree
8463 {
8466 }
8468 /* Handle a "no vops" attribute; arguments as in
8469 struct attribute_spec.handler. */
8471 static tree
8475 {
8479 }
8481 /* Handle a "deprecated" attribute; arguments as in
8482 struct attribute_spec.handler. */
8484 static tree
8488 {
8496 {
8499 }
8502 {
8513 else
8515 }
8517 {
8522 }
8523 else
8527 {
8530 {
8536 }
8539 else
8541 }
8544 }
8546 /* Handle a "vector_size" attribute; arguments as in
8547 struct attribute_spec.handler. */
8549 static tree
8553 {
8565 {
8568 }
8570 /* Get the vector size (in bytes). */
8573 /* We need to provide for vector pointers, vector arrays, and
8574 functions returning vectors. For example:
8576 __attribute__((vector_size(16))) short *foo;
8578 In this case, the mode is SI, but the type being modified is
8579 HI, so we need to look further. */
8588 /* Get the mode of the type being modified. */
8599 {
8602 }
8605 {
8608 }
8611 {
8614 }
8616 /* Calculate how many units fit in the vector. */
8619 {
8622 }
8626 /* Build back pointers if needed. */
8630 }
8632 /* Handle the "nonnull" attribute. */
8633 static tree
8637 {
8641 /* If no arguments are specified, all pointer arguments should be
8642 non-null. Verify a full prototype is given so that the arguments
8643 will have the correct types when we actually check them later. */
8645 {
8647 {
8650 }
8652 }
8654 /* Argument list specified. Verify that each argument number references
8655 a pointer argument. */
8657 {
8666 {
8671 }
8674 {
8675 function_args_iterator iter;
8676 tree argument;
8680 {
8684 }
8688 {
8693 }
8696 {
8701 }
8702 }
8703 }
8706 }
8708 /* Check the argument list of a function call for null in argument slots
8709 that are marked as requiring a non-null pointer argument. The NARGS
8710 arguments are passed in the array ARGARRAY.
8711 */
8713 static void
8715 {
8716 tree a;
8724 /* See if any of the nonnull attributes has no arguments. If so,
8725 then every pointer argument is checked (in which case the check
8726 for pointer type is done in check_nonnull_arg). */
8728 do
8736 else
8737 {
8738 /* Walk the argument list. If we encounter an argument number we
8739 should check for non-null, do it. */
8741 {
8743 {
8747 }
8752 }
8753 }
8754 }
8756 /* Check that the Nth argument of a function call (counting backwards
8757 from the end) is a (pointer)0. The NARGS arguments are passed in the
8758 array ARGARRAY. */
8760 static void
8762 {
8766 {
8769 tree sentinel;
8770 function_args_iterator iter;
8771 tree t;
8773 /* Skip over the named arguments. */
8775 {
8778 len++;
8779 }
8782 {
8785 }
8787 /* The sentinel must be one of the varargs, i.e.
8788 in position >= the number of fixed arguments. */
8790 {
8794 }
8796 /* Validate the sentinel. */
8800 /* Although __null (in C++) is only an integer we allow it
8801 nevertheless, as we are guaranteed that it's exactly
8802 as wide as a pointer, and we don't want to force
8803 users to cast the NULL they have written there.
8804 We warn with -Wstrict-null-sentinel, though. */
8807 }
8808 }
8810 /* Helper for check_function_nonnull; given a list of operands which
8811 must be non-null in ARGS, determine if operand PARAM_NUM should be
8812 checked. */
8814 static bool
8816 {
8820 {
8827 }
8829 }
8831 /* Check that the function argument PARAM (which is operand number
8832 PARAM_NUM) is non-null. This is called by check_function_nonnull
8833 via check_function_arguments_recurse. */
8835 static void
8838 {
8839 /* Just skip checking the argument if it's not a pointer. This can
8840 happen if the "nonnull" attribute was given without an operand
8841 list (which means to check every pointer argument). */
8849 }
8851 /* Helper for nonnull attribute handling; fetch the operand number
8852 from the attribute argument list. */
8854 static bool
8856 {
8857 /* Verify the arg number is a small constant. */
8859 {
8862 }
8863 else
8865 }
8867 /* Handle a "nothrow" attribute; arguments as in
8868 struct attribute_spec.handler. */
8870 static tree
8873 {
8876 /* ??? TODO: Support types. */
8877 else
8878 {
8881 }
8884 }
8886 /* Handle a "cleanup" attribute; arguments as in
8887 struct attribute_spec.handler. */
8889 static tree
8892 {
8896 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8897 for global destructors in C++. This requires infrastructure that
8898 we don't have generically at the moment. It's also not a feature
8899 we'd be missing too much, since we do have attribute constructor. */
8901 {
8905 }
8907 /* Verify that the argument is a function in scope. */
8908 /* ??? We could support pointers to functions here as well, if
8909 that was considered desirable. */
8912 {
8916 }
8919 {
8923 }
8925 /* That the function has proper type is checked with the
8926 eventual call to build_function_call. */
8929 }
8931 /* Handle a "warn_unused_result" attribute. No special handling. */
8933 static tree
8937 {
8938 /* Ignore the attribute for functions not returning any value. */
8940 {
8943 }
8946 }
8948 /* Handle a "sentinel" attribute. */
8950 static tree
8953 {
8955 {
8959 }
8960 else
8961 {
8963 {
8967 }
8968 }
8971 {
8975 {
8979 }
8980 else
8981 {
8983 {
8987 }
8988 }
8989 }
8992 }
8994 /* Handle a "type_generic" attribute. */
8996 static tree
9000 {
9001 /* Ensure we have a function type. */
9004 /* Ensure we have a variadic function. */
9008 }
9010 /* Handle a "target" attribute. */
9012 static tree
9015 {
9016 /* Ensure we have a function type. */
9018 {
9021 }
9023 flags))
9027 }
9029 /* Arguments being collected for optimization. */
9034 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9035 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9036 false for #pragma GCC optimize. */
9038 bool
9040 {
9048 tree ap;
9050 /* Build up argv vector. Just in case the string is stored away, use garbage
9051 collected strings. */
9056 {
9060 {
9064 }
9067 {
9068 /* Split string into multiple substrings. */
9076 {
9083 {
9087 }
9088 else
9089 {
9092 }
9096 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9097 options. */
9099 {
9104 else
9108 }
9111 {
9114 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9115 itself is -Os, and any other switch begins with a -f. */
9121 }
9126 }
9128 }
9129 }
9139 /* Now parse the options. */
9149 /* Don't allow changing -fstrict-aliasing. */
9154 }
9156 /* For handling "optimize" attribute. arguments as in
9157 struct attribute_spec.handler. */
9159 static tree
9162 {
9163 /* Ensure we have a function type. */
9165 {
9168 }
9169 else
9170 {
9174 /* Save current options. */
9177 /* If we previously had some optimization options, use them as the
9178 default. */
9183 /* Parse options, and update the vector. */
9188 /* Restore current options. */
9190 }
9193 }
9195 /* Handle a "no_split_stack" attribute. */
9197 static tree
9202 {
9206 {
9210 }
9212 {
9216 }
9219 }
9221 /* Handle a "returns_nonnull" attribute; arguments as in
9222 struct attribute_spec.handler. */
9224 static tree
9227 {
9228 // Even without a prototype we still have a return type we can check.
9230 {
9233 }
9235 }
9237 \f
9238 /* Check for valid arguments being passed to a function with FNTYPE.
9239 There are NARGS arguments in the array ARGARRAY. */
9240 void
9242 {
9243 /* Check for null being passed in a pointer argument that must be
9244 non-null. We also need to do this if format checking is enabled. */
9249 /* Check for errors in format strings. */
9256 }
9258 /* Generic argument checking recursion routine. PARAM is the argument to
9259 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9260 once the argument is resolved. CTX is context for the callback. */
9261 void
9266 {
9270 {
9271 /* Strip coercion. */
9275 }
9278 {
9280 tree attrs;
9283 /* See if this is a call to a known internationalization function
9284 that modifies a format arg. Such a function may have multiple
9285 format_arg attributes (for example, ngettext). */
9288 attrs;
9291 {
9292 tree inner_arg;
9293 tree format_num_expr;
9296 call_expr_arg_iterator iter;
9298 /* Extract the argument number, which was previously checked
9299 to be valid. */
9308 {
9313 }
9314 }
9316 /* If we found a format_arg attribute and did a recursive check,
9317 we are done with checking this argument. Otherwise, we continue
9318 and this will be considered a non-literal. */
9321 }
9324 {
9325 /* Check both halves of the conditional expression. */
9331 }
9334 }
9336 /* Checks for a builtin function FNDECL that the number of arguments
9337 NARGS against the required number REQUIRED and issues an error if
9338 there is a mismatch. Returns true if the number of arguments is
9339 correct, otherwise false. */
9341 static bool
9343 {
9345 {
9349 }
9351 {
9355 }
9357 }
9359 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9360 Returns false if there was an error, otherwise true. */
9362 bool
9364 {
9370 {
9380 {
9382 {
9386 }
9388 }
9398 {
9405 {
9409 }
9411 }
9416 {
9421 {
9425 }
9428 {
9430 fndecl);
9432 }
9434 }
9439 {
9441 {
9444 }
9446 }
9451 }
9452 }
9454 /* Function to help qsort sort FIELD_DECLs by name order. */
9456 int
9458 {
9463 /* A nontype is "greater" than a type. */
9472 }
9475 gt_pointer_operator new_value;
9479 /* This routine compares two fields like field_decl_cmp but using the
9480 pointer operator in resort_data. */
9482 static int
9484 {
9489 /* A nontype is "greater" than a type. */
9495 {
9502 }
9504 }
9506 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9508 void
9511 gt_pointer_operator new_value,
9513 {
9518 resort_field_decl_cmp);
9519 }
9521 /* Subroutine of c_parse_error.
9522 Return the result of concatenating LHS and RHS. RHS is really
9523 a string literal, its first character is indicated by RHS_START and
9524 RHS_SIZE is its length (including the terminating NUL character).
9526 The caller is responsible for deleting the returned pointer. */
9530 {
9536 }
9538 /* Issue the error given by GMSGID, indicating that it occurred before
9539 TOKEN, which had the associated VALUE. */
9541 void
9544 {
9545 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9555 {
9560 {
9573 }
9577 else
9583 }
9605 {
9610 }
9618 {
9623 }
9624 else
9628 {
9631 }
9632 #undef catenate_messages
9633 }
9635 /* Mapping for cpp message reasons to the options that enable them. */
9637 struct reason_option_codes_t
9638 {
9641 };
9662 };
9664 /* Return the gcc option code associated with the reason for a cpp
9665 message, or 0 if none. */
9667 static int
9669 {
9673 {
9676 }
9678 }
9680 /* Callback from cpp_error for PFILE to print diagnostics from the
9681 preprocessor. The diagnostic is of type LEVEL, with REASON set
9682 to the reason code if LEVEL is represents a warning, at location
9683 LOCATION unless this is after lexing and the compiler's location
9684 should be used instead, with column number possibly overridden by
9685 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9686 the arguments. Returns true if a diagnostic was emitted, false
9687 otherwise. */
9689 bool
9693 {
9694 diagnostic_info diagnostic;
9695 diagnostic_t dlevel;
9700 {
9705 /* Fall through. */
9730 }
9743 }
9745 /* Convert a character from the host to the target execution character
9746 set. cpplib handles this, mostly. */
9748 HOST_WIDE_INT
9750 {
9751 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9752 zero-extended under -fno-signed-char. cpplib insists that characters
9753 and character constants are always unsigned. Hence we must convert
9754 back and forth. */
9762 else
9764 }
9766 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9767 references with an INDIRECT_REF of a constant at the bottom; much like the
9768 traditional rendering of offsetof as a macro. Return the folded result. */
9770 tree
9772 {
9776 {
9792 {
9795 }
9805 {
9809 }
9822 /* Check if the offset goes beyond the upper bound of the array. */
9824 {
9830 {
9834 {
9835 tree v;
9842 {
9850 }
9851 /* Don't warn if the array might be considered a poor
9852 man's flexible array member with a very permissive
9853 definition thereof. */
9857 "index %E denotes an offset "
9860 }
9861 }
9862 }
9869 /* Handle static members of volatile structs. */
9876 }
9879 }
9881 /* Likewise, but convert it to the return type of offsetof. */
9883 tree
9885 {
9887 }
9889 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9890 expression, because B will always be true. */
9892 void
9894 {
9897 "the omitted middle operand in ?: will always be %<true%>, "
9899 }
9901 /* Give an error for storing into ARG, which is 'const'. USE indicates
9902 how ARG was being used. */
9904 void
9906 {
9909 /* Using this macro rather than (for example) arrays of messages
9910 ensures that all the format strings are checked at compile
9911 time. */
9912 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9913 : (use == lv_increment ? (I) \
9914 : (use == lv_decrement ? (D) : (AS))))
9916 {
9927 else
9933 }
9939 arg);
9945 arg);
9947 {
9957 arg);
9958 }
9964 arg);
9965 else
9970 arg);
9971 }
9973 /* Print an error message for an invalid lvalue. USE says
9974 how the lvalue is being used and so selects the error message. LOC
9975 is the location for the error. */
9977 void
9979 {
9981 {
9999 }
10000 }
10002 /* Print an error message for an invalid indirection of type TYPE.
10003 ERRSTRING is the name of the operator for the indirection. */
10005 void
10007 {
10009 {
10017 type);
10022 type);
10027 type);
10032 type);
10037 type);
10041 }
10042 }
10043 \f
10044 /* *PTYPE is an incomplete array. Complete it with a domain based on
10045 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10046 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10047 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10049 int
10051 {
10059 {
10061 {
10062 int eltsize
10065 }
10067 {
10071 {
10075 }
10076 else
10077 {
10078 tree curindex;
10089 {
10093 else
10094 {
10096 {
10097 /* Since we treat size types now as ordinary
10098 unsigned types, we need an explicit overflow
10099 check. */
10103 }
10105 size_one_node);
10106 }
10109 }
10111 {
10115 }
10116 }
10117 }
10118 else
10119 {
10120 /* Make an error message unless that happened already. */
10123 }
10124 }
10125 else
10126 {
10130 }
10137 else
10140 /* Using build_distinct_type_copy and modifying things afterward instead
10141 of using build_array_type to create a new type preserves all of the
10142 TYPE_LANG_FLAG_? bits that the front end may have set. */
10150 /* Make sure we have the canonical MAIN_TYPE. */
10153 hashcode);
10156 /* Fix the canonical type. */
10166 else
10171 else
10177 {
10179 /* If we proceed with the array type as it is, we'll eventually
10180 crash in tree_to_[su]hwi(). */
10182 }
10186 }
10188 /* Like c_mark_addressable but don't check register qualifier. */
10189 void
10191 {
10197 }
10200 \f
10201 /* Used to help initialize the builtin-types.def table. When a type of
10202 the correct size doesn't exist, use error_mark_node instead of NULL.
10203 The later results in segfaults even when a decl using the type doesn't
10204 get invoked. */
10206 tree
10208 {
10211 }
10213 /* A helper function for resolve_overloaded_builtin in resolving the
10214 overloaded __sync_ builtins. Returns a positive power of 2 if the
10215 first operand of PARAMS is a pointer to a supported data type.
10216 Returns 0 if an error is encountered. */
10218 static int
10220 {
10221 tree type;
10225 {
10228 }
10232 {
10233 /* Force array-to-pointer decay for C++. */
10237 }
10249 incompatible:
10252 }
10254 /* A helper function for resolve_overloaded_builtin. Adds casts to
10255 PARAMS to make arguments match up with those of FUNCTION. Drops
10256 the variadic arguments at the end. Returns false if some error
10257 was encountered; true on success. */
10259 static bool
10262 {
10263 function_args_iterator iter;
10264 tree ptype;
10268 /* We've declared the implementation functions to use "volatile void *"
10269 as the pointer parameter, so we shouldn't get any complaints from the
10270 call to check_function_arguments what ever type the user used. */
10275 /* For the rest of the values, we need to cast these to FTYPE, so that we
10276 don't get warnings for passing pointer types, etc. */
10279 {
10283 /* XXX void_type_node belies the abstraction. */
10289 {
10292 }
10294 /* Only convert parameters if arg_type is unsigned integer type with
10295 new format sync routines, i.e. don't attempt to convert pointer
10296 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10297 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10298 kinds). */
10300 {
10301 /* Ideally for the first conversion we'd use convert_for_assignment
10302 so that we get warnings for anything that doesn't match the pointer
10303 type. This isn't portable across the C and C++ front ends atm. */
10308 }
10311 }
10313 /* __atomic routines are not variadic. */
10315 {
10318 }
10320 /* The definition of these primitives is variadic, with the remaining
10321 being "an optional list of variables protected by the memory barrier".
10322 No clue what that's supposed to mean, precisely, but we consider all
10323 call-clobbered variables to be protected so we're safe. */
10327 }
10329 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10330 RESULT to make it match the type of the first pointer argument in
10331 PARAMS. */
10333 static tree
10335 {
10340 /* New format doesn't require casting unless the types are the same size. */
10343 else
10345 }
10347 /* This function verifies the PARAMS to generic atomic FUNCTION.
10348 It returns the size if all the parameters are the same size, otherwise
10349 0 is returned if the parameters are invalid. */
10351 static int
10354 {
10359 tree type_0;
10361 /* Determine the parameter makeup. */
10363 {
10379 }
10382 {
10385 }
10387 /* Get type of first parameter, and determine its size. */
10390 {
10391 /* Force array-to-pointer decay for C++. */
10395 }
10397 {
10399 function);
10401 }
10403 /* Types must be compile time constant sizes. */
10405 {
10408 function);
10410 }
10414 /* Zero size objects are not allowed. */
10416 {
10419 function);
10421 }
10423 /* Check each other parameter is a pointer and the same size. */
10425 {
10428 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10432 {
10434 function);
10436 }
10439 {
10441 function);
10443 }
10444 }
10446 /* Check memory model parameters for validity. */
10448 {
10451 {
10454 {
10457 function);
10458 }
10459 }
10460 else
10462 {
10464 function);
10466 }
10467 }
10470 }
10473 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10474 at the beginning of the parameter list PARAMS representing the size of the
10475 objects. This is to match the library ABI requirement. LOC is the location
10476 of the function call.
10477 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10478 returned to allow the external call to be constructed. */
10480 static tree
10483 {
10484 tree size_node;
10486 /* Insert a SIZE_T parameter as the first param. If there isn't
10487 enough space, allocate a new vector and recursively re-build with that. */
10489 {
10492 tree f;
10502 }
10504 /* Add the size parameter and leave as a function call for processing. */
10508 }
10511 /* Return whether atomic operations for naturally aligned N-byte
10512 arguments are supported, whether inline or through libatomic. */
10513 static bool
10515 {
10517 {
10529 }
10530 }
10532 /* This will process an __atomic_exchange function call, determine whether it
10533 needs to be mapped to the _N variation, or turned into a library call.
10534 LOC is the location of the builtin call.
10535 FUNCTION is the DECL that has been invoked;
10536 PARAMS is the argument list for the call. The return value is non-null
10537 TRUE is returned if it is translated into the proper format for a call to the
10538 external library, and NEW_RETURN is set the tree for that function.
10539 FALSE is returned if processing for the _N variation is required, and
10540 NEW_RETURN is set to the the return value the result is copied into. */
10541 static bool
10544 {
10549 /* Size of 0 is an error condition. */
10551 {
10554 }
10556 /* If not a lock-free size, change to the library generic format. */
10558 {
10561 }
10563 /* Otherwise there is a lockfree match, transform the call from:
10564 void fn(T* mem, T* desired, T* return, model)
10565 into
10566 *return = (T) (fn (In* mem, (In) *desired, model)) */
10573 /* Create pointer to appropriate size. */
10577 /* Convert object pointer to required type. */
10580 /* Convert new value to required type, and dereference it. */
10585 /* Move memory model to the 3rd position, and end param list. */
10589 /* Convert return pointer and dereference it for later assignment. */
10593 }
10596 /* This will process an __atomic_compare_exchange function call, determine
10597 whether it needs to be mapped to the _N variation, or turned into a lib call.
10598 LOC is the location of the builtin call.
10599 FUNCTION is the DECL that has been invoked;
10600 PARAMS is the argument list for the call. The return value is non-null
10601 TRUE is returned if it is translated into the proper format for a call to the
10602 external library, and NEW_RETURN is set the tree for that function.
10603 FALSE is returned if processing for the _N variation is required. */
10605 static bool
10609 {
10614 /* Size of 0 is an error condition. */
10616 {
10619 }
10621 /* If not a lock-free size, change to the library generic format. */
10623 {
10624 /* The library generic format does not have the weak parameter, so
10625 remove it from the param list. Since a parameter has been removed,
10626 we can be sure that there is room for the SIZE_T parameter, meaning
10627 there will not be a recursive rebuilding of the parameter list, so
10628 there is no danger this will be done twice. */
10630 {
10634 }
10637 }
10639 /* Otherwise, there is a match, so the call needs to be transformed from:
10640 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10641 into
10642 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10648 /* Create pointer to appropriate size. */
10652 /* Convert object pointer to required type. */
10656 /* Convert expected pointer to required type. */
10660 /* Convert desired value to required type, and dereference it. */
10665 /* The rest of the parameters are fine. NULL means no special return value
10666 processing.*/
10669 }
10672 /* This will process an __atomic_load function call, determine whether it
10673 needs to be mapped to the _N variation, or turned into a library call.
10674 LOC is the location of the builtin call.
10675 FUNCTION is the DECL that has been invoked;
10676 PARAMS is the argument list for the call. The return value is non-null
10677 TRUE is returned if it is translated into the proper format for a call to the
10678 external library, and NEW_RETURN is set the tree for that function.
10679 FALSE is returned if processing for the _N variation is required, and
10680 NEW_RETURN is set to the the return value the result is copied into. */
10682 static bool
10685 {
10690 /* Size of 0 is an error condition. */
10692 {
10695 }
10697 /* If not a lock-free size, change to the library generic format. */
10699 {
10702 }
10704 /* Otherwise, there is a match, so the call needs to be transformed from:
10705 void fn(T* mem, T* return, model)
10706 into
10707 *return = (T) (fn ((In *) mem, model)) */
10713 /* Create pointer to appropriate size. */
10717 /* Convert object pointer to required type. */
10721 /* Move memory model to the 2nd position, and end param list. */
10725 /* Convert return pointer and dereference it for later assignment. */
10729 }
10732 /* This will process an __atomic_store function call, determine whether it
10733 needs to be mapped to the _N variation, or turned into a library call.
10734 LOC is the location of the builtin call.
10735 FUNCTION is the DECL that has been invoked;
10736 PARAMS is the argument list for the call. The return value is non-null
10737 TRUE is returned if it is translated into the proper format for a call to the
10738 external library, and NEW_RETURN is set the tree for that function.
10739 FALSE is returned if processing for the _N variation is required, and
10740 NEW_RETURN is set to the the return value the result is copied into. */
10742 static bool
10745 {
10750 /* Size of 0 is an error condition. */
10752 {
10755 }
10757 /* If not a lock-free size, change to the library generic format. */
10759 {
10762 }
10764 /* Otherwise, there is a match, so the call needs to be transformed from:
10765 void fn(T* mem, T* value, model)
10766 into
10767 fn ((In *) mem, (In) *value, model) */
10772 /* Create pointer to appropriate size. */
10776 /* Convert object pointer to required type. */
10780 /* Convert new value to required type, and dereference it. */
10785 /* The memory model is in the right spot already. Return is void. */
10789 }
10792 /* Some builtin functions are placeholders for other expressions. This
10793 function should be called immediately after parsing the call expression
10794 before surrounding code has committed to the type of the expression.
10796 LOC is the location of the builtin call.
10798 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10799 PARAMS is the argument list for the call. The return value is non-null
10800 when expansion is complete, and null if normal processing should
10801 continue. */
10803 tree
10806 {
10812 {
10818 else
10822 }
10824 /* Handle BUILT_IN_NORMAL here. */
10826 {
10831 {
10832 /* Handle these 4 together so that they can fall through to the next
10833 case if the call is transformed to an _N variant. */
10835 {
10837 {
10841 /* Change to the _N variant. */
10844 }
10847 {
10849 params,
10852 /* Change to the _N variant. */
10855 }
10857 {
10861 /* Change to the _N variant. */
10864 }
10866 {
10870 /* Change to the _N variant. */
10873 }
10876 }
10877 /* Fallthrough to the normal processing. */
10878 }
10895 {
10897 /* Fallthru for parameter processing. */
10898 }
10915 {
10926 orig_format))
10931 NULL);
10939 /* If new_return is set, assign function to that expr and cast the
10940 result to void since the generic interface returned void. */
10942 {
10943 /* Cast function result from I{1,2,4,8,16} to the required type. */
10946 result);
10950 }
10952 }
10956 }
10957 }
10959 /* vector_types_compatible_elements_p is used in type checks of vectors
10960 values used as operands of binary operators. Where it returns true, and
10961 the other checks of the caller succeed (being vector types in he first
10962 place, and matching number of elements), we can just treat the types
10963 as essentially the same.
10964 Contrast with vector_targets_convertible_p, which is used for vector
10965 pointer types, and vector_types_convertible_p, which will allow
10966 language-specific matches under the control of flag_lax_vector_conversions,
10967 and might still require a conversion. */
10968 /* True if vector types T1 and T2 can be inputs to the same binary
10969 operator without conversion.
10970 We don't check the overall vector size here because some of our callers
10971 want to give different error messages when the vectors are compatible
10972 except for the element count. */
10974 bool
10976 {
10989 /* Equality works here because c_common_signed_type uses
10990 TYPE_MAIN_VARIANT. */
10998 }
11000 /* Check for missing format attributes on function pointers. LTYPE is
11001 the new type or left-hand side type. RTYPE is the old type or
11002 right-hand side type. Returns TRUE if LTYPE is missing the desired
11003 attribute. */
11005 bool
11007 {
11009 tree ra;
11015 {
11016 tree la;
11021 }
11022 else
11024 }
11026 /* Subscripting with type char is likely to lose on a machine where
11027 chars are signed. So warn on any machine, but optionally. Don't
11028 warn for unsigned char since that type is safe. Don't warn for
11029 signed char because anyone who uses that must have done so
11030 deliberately. Furthermore, we reduce the false positive load by
11031 warning only for non-constant value of type char. */
11033 void
11035 {
11039 }
11041 /* Implement -Wparentheses for the unexpected C precedence rules, to
11042 cover cases like x + y << z which readers are likely to
11043 misinterpret. We have seen an expression in which CODE is a binary
11044 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11045 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11046 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11047 expression was not formed using a binary or unary operator, or it
11048 was enclosed in parentheses. */
11050 void
11054 {
11058 /* This macro tests that the expression ARG with original tree code
11059 CODE appears to be a boolean expression. or the result of folding a
11060 boolean expression. */
11061 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11062 (truth_value_p (TREE_CODE (ARG)) \
11063 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11065 || ((CODE) != INTEGER_CST \
11066 && (integer_onep (ARG) || integer_zerop (ARG))))
11069 {
11118 /* Check cases like x|y==z */
11125 /* Check cases like !x | y */
11129 "suggest parentheses around operand of "
11142 /* Check cases like x^y==z */
11164 /* Check cases like x&y==z */
11171 /* Check cases like !x & y */
11175 "suggest parentheses around operand of "
11198 {
11203 "comparisons like %<X<=Y<=Z%> do not "
11209 "comparisons like %<X<=Y<=Z%> do not "
11211 }
11213 }
11214 #undef NOT_A_BOOLEAN_EXPR_P
11215 }
11217 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11219 void
11221 {
11223 {
11226 else
11228 }
11229 }
11231 /* Warn for division by zero according to the value of DIVISOR. LOC
11232 is the location of the division operator. */
11234 void
11236 {
11237 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11238 about division by zero. Do not issue a warning if DIVISOR has a
11239 floating-point type, since we consider 0.0/0.0 a valid way of
11240 generating a NaN. */
11244 }
11246 /* Subroutine of build_binary_op. Give warnings for comparisons
11247 between signed and unsigned quantities that may fail. Do the
11248 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11249 so that casts will be considered, but default promotions won't
11250 be.
11252 LOCATION is the location of the comparison operator.
11254 The arguments of this function map directly to local variables
11255 of build_binary_op. */
11257 void
11262 {
11267 /* In C++, check for comparison of different enum types. */
11273 {
11277 }
11279 /* Do not warn if the comparison is being done in a signed type,
11280 since the signed type will only be chosen if it can represent
11281 all the values of the unsigned type. */
11284 /* Do not warn if both operands are unsigned. */
11287 else
11288 {
11294 else
11302 /* Do not warn if the signed quantity is an unsuffixed integer
11303 literal (or some static constant expression involving such
11304 literals or a conditional expression involving such literals)
11305 and it is non-negative. */
11308 /* Do not warn if the comparison is an equality operation, the
11309 unsigned quantity is an integral constant, and it would fit
11310 in the result if the result were signed. */
11315 /* In C, do not warn if the unsigned quantity is an enumeration
11316 constant and its maximum value would fit in the result if the
11317 result were signed. */
11323 else
11325 OPT_Wsign_compare,
11327 }
11329 /* Warn if two unsigned values are being compared in a size larger
11330 than their original size, and one (and only one) is the result of
11331 a `~' operator. This comparison will always fail.
11333 Also warn if one operand is a constant, and the constant does not
11334 have all bits set that are set in the ~ operand when it is
11335 extended. */
11342 {
11349 {
11350 tree primop;
11356 {
11360 }
11361 else
11362 {
11366 }
11371 {
11374 {
11378 else
11381 }
11382 }
11383 }
11391 }
11392 }
11394 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11395 type via c_common_type. If -Wdouble-promotion is in use, and the
11396 conditions for warning have been met, issue a warning. GMSGID is
11397 the warning message. It must have two %T specifiers for the type
11398 that was converted (generally "float") and the type to which it was
11399 converted (generally "double), respectively. LOC is the location
11400 to which the awrning should refer. */
11402 void
11405 {
11406 tree source_type;
11410 /* If the conversion will not occur at run-time, there is no need to
11411 warn about it. */
11423 else
11426 }
11428 /* Setup a TYPE_DECL node as a typedef representation.
11430 X is a TYPE_DECL for a typedef statement. Create a brand new
11431 ..._TYPE node (which will be just a variant of the existing
11432 ..._TYPE node with identical properties) and then install X
11433 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11435 The whole point here is to end up with a situation where each
11436 and every ..._TYPE node the compiler creates will be uniquely
11437 associated with AT MOST one node representing a typedef name.
11438 This way, even though the compiler substitutes corresponding
11439 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11440 early on, later parts of the compiler can always do the reverse
11441 translation and get back the corresponding typedef name. For
11442 example, given:
11444 typedef struct S MY_TYPE;
11445 MY_TYPE object;
11447 Later parts of the compiler might only know that `object' was of
11448 type `struct S' if it were not for code just below. With this
11449 code however, later parts of the compiler see something like:
11451 struct S' == struct S
11452 typedef struct S' MY_TYPE;
11453 struct S' object;
11455 And they can then deduce (from the node for type struct S') that
11456 the original object declaration was:
11458 MY_TYPE object;
11460 Being able to do this is important for proper support of protoize,
11461 and also for generating precise symbolic debugging information
11462 which takes full account of the programmer's (typedef) vocabulary.
11464 Obviously, we don't want to generate a duplicate ..._TYPE node if
11465 the TYPE_DECL node that we are now processing really represents a
11466 standard built-in type. */
11468 void
11470 {
11474 {
11477 }
11480 {
11488 }
11489 }
11491 /* Record the types used by the current global variable declaration
11492 being parsed, so that we can decide later to emit their debug info.
11493 Those types are in types_used_by_cur_var_decl, and we are going to
11494 store them in the types_used_by_vars_hash hash table.
11495 DECL is the declaration of the global variable that has been parsed. */
11497 void
11499 {
11503 {
11506 }
11507 }
11509 /* If DECL is a typedef that is declared in the current function,
11510 record it for the purpose of -Wunused-local-typedefs. */
11512 void
11514 {
11519 /* if this is not a locally defined typedef then we are not
11520 interested. */
11527 }
11529 /* If T is a TYPE_DECL declared locally, mark it as used. */
11531 void
11533 {
11538 }
11540 /* Warn if there are some unused locally defined typedefs in the
11541 current function. */
11543 void
11545 {
11547 tree decl;
11548 /* The number of times we have emitted -Wunused-local-typedefs
11549 warnings. If this is different from errorcount, that means some
11550 unrelated errors have been issued. In which case, we'll avoid
11551 emitting "unused-local-typedefs" warnings. */
11563 {
11567 OPT_Wunused_local_typedefs,
11570 }
11573 }
11575 /* The C and C++ parsers both use vectors to hold function arguments.
11576 For efficiency, we keep a cache of unused vectors. This is the
11577 cache. */
11582 /* Return a new vector from the cache. If the cache is empty,
11583 allocate a new vector. These vectors are GC'ed, so it is OK if the
11584 pointer is not released.. */
11588 {
11591 else
11592 {
11593 /* Passing 0 to vec::alloc returns NULL, and our callers require
11594 that we always return a non-NULL value. The vector code uses
11595 4 when growing a NULL vector, so we do too. */
11599 }
11600 }
11602 /* Release a vector of trees back to the cache. */
11604 void
11606 {
11608 {
11611 }
11612 }
11614 /* Get a new tree vector holding a single tree. */
11618 {
11622 }
11624 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11628 {
11633 }
11635 /* Get a new tree vector which is a copy of an existing one. */
11639 {
11642 tree t;
11649 }
11651 /* Return true if KEYWORD starts a type specifier. */
11653 bool
11655 {
11657 {
11688 }
11689 }
11691 /* Return true if KEYWORD names a type qualifier. */
11693 bool
11695 {
11697 {
11705 }
11706 }
11708 /* Return true if KEYWORD names a storage class specifier.
11710 RID_TYPEDEF is not included in this list despite `typedef' being
11711 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11712 such for syntactic convenience only. */
11714 bool
11716 {
11718 {
11728 }
11729 }
11731 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11733 static bool
11735 {
11737 {
11745 }
11746 }
11748 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11749 declaration-specifier (C99 6.7). */
11751 bool
11753 {
11760 {
11767 }
11768 }
11770 /* Initialize language-specific-bits of tree_contains_struct. */
11772 void
11774 {
11778 }
11780 /* Build a user-defined numeric literal out of an integer constant type VALUE
11781 with identifier SUFFIX. */
11783 tree
11786 {
11793 }
11795 /* For vector[index], convert the vector to a
11796 pointer of the underlying type. */
11797 void
11800 {
11802 {
11804 tree type1;
11817 {
11818 /* If the original vector isn't declared may_alias and it
11819 isn't a bare vector look if the subscripting would
11820 alias the vector we subscript, and if not, force ref-all. */
11826 }
11830 }
11831 }
11833 /* Determine which of the operands, if any, is a scalar that needs to be
11834 converted to a vector, for the range of operations. */
11835 enum stv_conv
11838 {
11847 {
11848 /* Most GENERIC binary expressions require homogeneous arguments.
11849 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11850 argument that is a vector and a second one that is a scalar, so
11851 we never return stv_secondarg for them. */
11856 {
11858 {
11863 }
11864 else
11866 }
11873 /* ... fall through ... */
11894 /* What about UNLT_EXPR? */
11896 {
11897 tree tmp;
11899 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11902 }
11906 {
11908 {
11913 }
11915 }
11917 /* Allow integer --> real conversion if safe. */
11921 {
11923 {
11928 }
11930 }
11933 }
11936 }
11938 /* Return true iff ALIGN is an integral constant that is a fundamental
11939 alignment, as defined by [basic.align] in the c++-11
11940 specifications.
11942 That is:
11944 [A fundamental alignment is represented by an alignment less than or
11945 equal to the greatest alignment supported by the implementation
11946 in all contexts, which is equal to
11947 alignof(max_align_t)]. */
11949 bool
11951 {
11954 }
11956 /* Return true if T is a pointer to a zero-sized aggregate. */
11958 bool
11960 {
11965 }