| blob | 1d56bc02ec82aff259100c7ba261c00802700312 |
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/>. */
55 /* The following symbols are subsumed in the c_global_trees array, and
56 listed here individually for documentation purposes.
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
63 tree int128_integer_type_node;
65 tree short_unsigned_type_node;
66 tree long_unsigned_type_node;
67 tree long_long_unsigned_type_node;
68 tree int128_unsigned_type_node;
70 tree truthvalue_type_node;
71 tree truthvalue_false_node;
72 tree truthvalue_true_node;
74 tree ptrdiff_type_node;
76 tree unsigned_char_type_node;
77 tree signed_char_type_node;
78 tree wchar_type_node;
80 tree char16_type_node;
81 tree char32_type_node;
83 tree float_type_node;
84 tree double_type_node;
85 tree long_double_type_node;
87 tree complex_integer_type_node;
88 tree complex_float_type_node;
89 tree complex_double_type_node;
90 tree complex_long_double_type_node;
92 tree dfloat32_type_node;
93 tree dfloat64_type_node;
94 tree_dfloat128_type_node;
96 tree intQI_type_node;
97 tree intHI_type_node;
98 tree intSI_type_node;
99 tree intDI_type_node;
100 tree intTI_type_node;
102 tree unsigned_intQI_type_node;
103 tree unsigned_intHI_type_node;
104 tree unsigned_intSI_type_node;
105 tree unsigned_intDI_type_node;
106 tree unsigned_intTI_type_node;
108 tree widest_integer_literal_type_node;
109 tree widest_unsigned_literal_type_node;
111 Nodes for types `void *' and `const void *'.
113 tree ptr_type_node, const_ptr_type_node;
115 Nodes for types `char *' and `const char *'.
117 tree string_type_node, const_string_type_node;
119 Type `char[SOMENUMBER]'.
120 Used when an array of char is needed and the size is irrelevant.
122 tree char_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
195 /* C/ObjC language option variables. */
198 /* Nonzero means allow type mismatches in conditional expressions;
199 just make their values `void'. */
203 /* Nonzero means enable C89 Amendment 1 features. */
207 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
211 /* Nonzero means use the ISO C11 dialect of C. */
215 /* Nonzero means that we have builtin functions, and main is an int. */
220 /* ObjC language option variables. */
223 /* Tells the compiler that this is a special run. Do not perform any
224 compiling, instead we are to test some platform dependent features
225 and output a C header file with appropriate definitions. */
229 /* Tells the compiler what is the constant string class for ObjC. */
234 /* C++ language option variables. */
237 /* Nonzero means generate separate instantiation control files and
238 juggle them at link time. */
242 /* The C++ dialect being used. C++98 is the default. */
246 /* Maximum template instantiation depth. This limit exists to limit the
247 time it takes to notice excessively recursive template instantiations.
249 The default is lower than the 1024 recommended by the C++0x standard
250 because G++ runs out of stack before 1024 with highly recursive template
251 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
255 /* The elements of `ridpointers' are identifier nodes for the reserved
256 type names and storage classes. It is indexed by a RID_... value. */
261 /* Nonzero means don't warn about problems that occur when the code is
262 executed. */
265 /* Whether we are building a boolean conversion inside
266 convert_for_assignment, or some other late binary operation. If
267 build_binary_op is called for C (from code shared by C and C++) in
268 this case, then the operands have already been folded and the
269 result will not be folded again, so C_MAYBE_CONST_EXPR should not
270 be generated. */
273 /* Whether lexing has been completed, so subsequent preprocessor
274 errors should use the compiler's input_location. */
277 /* Information about how a function name is generated. */
278 struct fname_var_t
279 {
283 };
285 /* The three ways of getting then name of the current function. */
288 {
289 /* C99 compliant __func__, must be first. */
291 /* GCC __FUNCTION__ compliant. */
293 /* GCC __PRETTY_FUNCTION__ compliant. */
296 };
298 /* Global visibility options. */
389 /* Reserved words. The third field is a mask: keywords are disabled
390 if they match the mask.
392 Masks for languages:
393 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
394 C --std=c99: D_CXXONLY | D_OBJC
395 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
396 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
397 C++ --std=c0x: D_CONLY | D_OBJC
398 ObjC++ is like C++ except that D_OBJC is not set
400 If -fno-asm is used, D_ASM is added to the mask. If
401 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
402 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
403 In C with -Wc++-compat, we warn if D_CXXWARN is set.
405 Note the complication of the D_CXX_OBJC keywords. These are
406 reserved words such as 'class'. In C++, 'class' is a reserved
407 word. In Objective-C++ it is too. In Objective-C, it is a
408 reserved word too, but only if it follows an '@' sign.
409 */
411 {
572 /* These Objective-C keywords are recognized only immediately after
573 an '@'. */
590 /* These are recognized only in protocol-qualifier context
591 (see above) */
598 /* These are recognized inside a property attribute list */
607 };
612 /* Table of machine-independent attributes common to all C-like languages. */
614 {
615 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
616 affects_type_identity } */
623 /* FIXME: logically, noreturn attributes should be listed as
624 "false, true, true" and apply to function types. But implementing this
625 would require all the places in the compiler that use TREE_THIS_VOLATILE
626 on a decl to identify non-returning functions to be located and fixed
627 to check the function type instead. */
652 /* The same comments as for noreturn attributes apply to const ones. */
676 handle_no_instrument_function_attribute,
694 /* ??? These two attributes didn't make the transition from the
695 Intel language document to the multi-vendor language document. */
700 /* For internal use (marking of builtins) only. The name contains space
701 to prevent its usage in source code. */
723 /* For internal use (marking of builtins) only. The name contains space
724 to prevent its usage in source code. */
735 handle_no_address_safety_analysis_attribute,
738 handle_no_sanitize_address_attribute,
741 handle_no_sanitize_undefined_attribute,
751 /* For internal use only. The leading '*' both prevents its usage in
752 source code and signals that it may be overridden by machine tables. */
757 /* For internal use (marking of builtins and runtime functions) only.
758 The name contains space to prevent its usage in source code. */
776 };
778 /* Give the specifications for the format attributes, used by C and all
779 descendants. */
782 {
783 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
784 affects_type_identity } */
790 };
792 /* Return identifier for address space AS. */
796 {
800 }
802 /* Push current bindings for the function name VAR_DECLS. */
804 void
806 {
811 {
815 {
817 saved);
819 }
820 }
822 /* Normally they'll have been NULL, so only push if we've got a
823 stack, or they are non-NULL. */
825 saved_function_name_decls);
826 }
828 /* Finish up the current bindings, adding them into the current function's
829 statement tree. This must be done _before_ finish_stmt_tree is called.
830 If there is no current function, we must be at file scope and no statements
831 are involved. Pop the previous bindings. */
833 void
835 {
844 {
852 }
858 {
859 /* We had saved values, restore them. */
860 tree saved;
863 {
868 }
870 }
872 }
874 /* Return the text name of the current function, suitably prettified
875 by PRETTY_P. Return string must be freed by caller. */
879 {
886 {
889 }
902 {
905 }
908 }
910 /* Return the VAR_DECL for a const char array naming the current
911 function. If the VAR_DECL has not yet been created, create it
912 now. RID indicates how it should be formatted and IDENTIFIER_NODE
913 ID is its name (unfortunately C and C++ hold the RID values of
914 keywords in different places, so we can't derive RID from ID in
915 this language independent code. LOC is the location of the
916 function. */
918 tree
920 {
930 {
931 /* If a tree is built here, it would normally have the lineno of
932 the current statement. Later this tree will be moved to the
933 beginning of the function and this line number will be wrong.
934 To avoid this problem set the lineno to 0 here; that prevents
935 it from appearing in the RTL. */
936 tree stmts;
944 saved_function_name_decls
948 }
953 }
955 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
957 tree
959 {
964 /* Compute the number of elements, for the array type. */
966 {
969 }
971 {
974 }
976 {
979 }
980 else
981 {
984 }
986 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
987 limit in C++98 Annex B is very large (65536) and is not normative,
988 so we do not diagnose it (warn_overlength_strings is forced off
989 in c_common_post_options). */
991 {
995 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
996 separate the %d from the 'C'. 'ISO' should not be
997 translated, but it may be moved after 'C%d' in languages
998 where modifiers follow nouns. */
1000 "string length %qd is greater than the length %qd "
1003 }
1005 /* Create the array type for the string constant. The ISO C++
1006 standard says that a string literal has type `const char[N]' or
1007 `const wchar_t[N]'. We use the same logic when invoked as a C
1008 front-end with -Wwrite-strings.
1009 ??? We should change the type of an expression depending on the
1010 state of a warning flag. We should just be warning -- see how
1011 this is handled in the C++ front-end for the deprecated implicit
1012 conversion from string literals to `char*' or `wchar_t*'.
1014 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1015 array type being the unqualified version of that type.
1016 Therefore, if we are constructing an array of const char, we must
1017 construct the matching unqualified array type first. The C front
1018 end does not require this, but it does no harm, so we do it
1019 unconditionally. */
1030 }
1031 \f
1032 /* If DISABLE is true, stop issuing warnings. This is used when
1033 parsing code that we know will not be executed. This function may
1034 be called multiple times, and works as a stack. */
1036 static void
1038 {
1040 {
1043 }
1044 }
1046 /* If ENABLE is true, reenable issuing warnings. */
1048 static void
1050 {
1052 {
1055 }
1056 }
1058 /* Fully fold EXPR, an expression that was not folded (beyond integer
1059 constant expressions and null pointer constants) when being built
1060 up. If IN_INIT, this is in a static initializer and certain
1061 changes are made to the folding done. Clear *MAYBE_CONST if
1062 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1063 expression because it contains an evaluated operator (in C99) or an
1064 operator outside of sizeof returning an integer constant (in C90)
1065 not permitted in constant expressions, or because it contains an
1066 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1067 set to true by callers before calling this function.) Return the
1068 folded expression. Function arguments have already been folded
1069 before calling this function, as have the contents of SAVE_EXPR,
1070 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1071 C_MAYBE_CONST_EXPR. */
1073 tree
1075 {
1076 tree ret;
1082 /* This function is not relevant to C++ because C++ folds while
1083 parsing, and may need changes to be correct for C++ when C++
1084 stops folding while parsing. */
1091 {
1094 }
1101 }
1103 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1104 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1105 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1106 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1107 both evaluated and unevaluated subexpressions while
1108 *MAYBE_CONST_ITSELF is carried from only evaluated
1109 subexpressions). */
1111 static tree
1114 {
1126 /* This function is not relevant to C++ because C++ folds while
1127 parsing, and may need changes to be correct for C++ when C++
1128 stops folding while parsing. */
1132 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1133 anything else not counted as an expression cannot usefully be
1134 folded further at this point. */
1140 /* Operands of variable-length expressions (function calls) have
1141 already been folded, as have __builtin_* function calls, and such
1142 expressions cannot occur in constant expressions. */
1144 {
1148 }
1151 {
1160 else
1163 }
1165 /* Assignment, increment, decrement, function call and comma
1166 operators, and statement expressions, cannot occur in constant
1167 expressions if evaluated / outside of sizeof. (Function calls
1168 were handled above, though VA_ARG_EXPR is treated like a function
1169 call here, and statement expressions are handled through
1170 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1172 {
1192 }
1194 /* Fold individual tree codes as appropriate. */
1196 {
1198 /* Any non-constancy will have been marked in a containing
1199 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1207 maybe_const_itself);
1212 {
1215 }
1224 maybe_const_itself);
1227 maybe_const_itself);
1233 {
1237 }
1279 /* Binary operations evaluating both arguments (increment and
1280 decrement are binary internally in GCC). */
1284 maybe_const_itself);
1292 /* The RHS of a MODIFY_EXPR was fully folded when building that
1293 expression for the sake of conversion warnings. */
1296 maybe_const_itself);
1300 ret = in_init
1303 else
1316 {
1327 }
1333 CASE_CONVERT:
1344 /* Unary operations. */
1347 maybe_const_itself);
1351 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1352 not prepared to deal with them if they occur in initializers. */
1360 ret = in_init
1363 else
1368 {
1372 }
1374 {
1377 CASE_CONVERT:
1378 /* Don't warn about explicit conversions. We will already
1379 have warned about suspect implicit conversions. */
1386 }
1391 /* Binary operations not necessarily evaluating both
1392 arguments. */
1399 ? truthvalue_false_node
1407 ret = in_init
1410 else
1415 && op0_const
1416 && op0_const_self
1422 && op0_const_self
1448 else
1453 && op0_const
1454 && op0_const_self
1458 && op0_const_self
1462 && op0_const
1463 && op0_const_self
1467 && op0_const_self
1473 /* Each case where an operand with excess precision may be
1474 encountered must remove the EXCESS_PRECISION_EXPR around
1475 inner operands and possibly put one around the whole
1476 expression or possibly convert to the semantic type (which
1477 c_fully_fold does); we cannot tell at this stage which is
1478 appropriate in any particular case. */
1482 /* Various codes may appear through folding built-in functions
1483 and their arguments. */
1485 }
1487 out:
1488 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1489 have been done by this point, so remove them again. */
1493 {
1497 }
1501 }
1503 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1504 return EXP. Otherwise, return either EXP or its known constant
1505 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1506 Is the BLKmode test appropriate? */
1508 tree
1510 {
1511 tree ret;
1513 /* This function is only used by C, for c_fully_fold and other
1514 optimization, and may not be correct for C++. */
1525 /* Avoid unwanted tree sharing between the initializer and current
1526 function's body where the tree can be modified e.g. by the
1527 gimplifier. */
1531 }
1533 /* Print a warning if a constant expression had overflow in folding.
1534 Invoke this function on every expression that the language
1535 requires to be a constant expression.
1536 Note the ANSI C standard says it is erroneous for a
1537 constant expression to overflow. */
1539 void
1541 {
1549 }
1551 /* The same as above but print an unconditional error. */
1552 void
1554 {
1561 }
1563 /* Print a warning if an expression had overflow in folding and its
1564 operands hadn't.
1566 Invoke this function on every expression that
1567 (1) appears in the source code, and
1568 (2) is a constant expression that overflowed, and
1569 (3) is not already checked by convert_and_check;
1570 however, do not invoke this function on operands of explicit casts
1571 or when the expression is the result of an operator and any operand
1572 already overflowed. */
1574 void
1576 {
1581 {
1610 }
1611 }
1613 /* Warn about uses of logical || / && operator in a context where it
1614 is likely that the bitwise equivalent was intended by the
1615 programmer. We have seen an expression in which CODE is a binary
1616 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1617 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1618 void
1622 {
1634 /* Warn if &&/|| are being used in a context where it is
1635 likely that the bitwise equivalent was intended by the
1636 programmer. That is, an expression such as op && MASK
1637 where op should not be any boolean expression, nor a
1638 constant, and mask seems to be a non-boolean integer constant. */
1646 {
1650 else
1655 }
1657 /* We do not warn for constants because they are typical of macro
1658 expansions that test for features. */
1662 /* This warning only makes sense with logical operands. */
1670 /* We first test whether either side separately is trivially true
1671 (with OR) or trivially false (with AND). If so, do not warn.
1672 This is a common idiom for testing ranges of data types in
1673 portable code. */
1680 /* If this is an OR operation, invert both sides; now, the result
1681 should be always false to get a warning. */
1695 /* If this is an OR operation, invert both sides; now, the result
1696 should be always false to get a warning. */
1704 /* If both expressions have the same operand, if we can merge the
1705 ranges, and if the range test is always false, then warn. */
1712 {
1715 "logical %<or%> "
1717 else
1719 "logical %<and%> "
1721 }
1722 }
1725 /* Warn if EXP contains any computations whose results are not used.
1726 Return true if a warning is printed; false otherwise. LOCUS is the
1727 (potential) location of the expression. */
1729 bool
1731 {
1732 restart:
1736 /* Don't warn about void constructs. This includes casting to void,
1737 void function calls, and statement expressions with a final cast
1738 to void. */
1746 {
1762 /* For a binding, warn if no side effect within it. */
1774 /* In && or ||, warn if 2nd operand has no side effect. */
1781 /* Let people do `(foo (), 0)' without a warning. */
1788 /* If this is an expression with side effects, don't warn; this
1789 case commonly appears in macro expansions. */
1795 /* Don't warn about automatic dereferencing of references, since
1796 the user cannot control it. */
1798 {
1801 }
1802 /* Fall through. */
1805 /* Referencing a volatile value is a side effect, so don't warn. */
1810 /* If this is an expression which has no operands, there is no value
1811 to be unused. There are no such language-independent codes,
1812 but front ends may define such. */
1816 warn:
1818 }
1819 }
1822 /* Print a warning about casts that might indicate violation
1823 of strict aliasing rules if -Wstrict-aliasing is used and
1824 strict aliasing mode is in effect. OTYPE is the original
1825 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1827 bool
1829 {
1830 /* Strip pointer conversion chains and get to the correct original type. */
1838 /* If the type we are casting to is a ref-all pointer
1839 dereferencing it is always valid. */
1846 {
1847 /* Casting the address of an object to non void pointer. Warn
1848 if the cast breaks type based aliasing. */
1850 {
1854 }
1855 else
1856 {
1857 /* warn_strict_aliasing >= 3. This includes the default (3).
1858 Only warn if the cast is dereferenced immediately. */
1859 alias_set_type set1 =
1865 {
1869 }
1872 {
1876 }
1877 }
1878 }
1879 else
1881 {
1882 /* At this level, warn for any conversions, even if an address is
1883 not taken in the same statement. This will likely produce many
1884 false positives, but could be useful to pinpoint problems that
1885 are not revealed at higher levels. */
1890 {
1894 }
1895 }
1898 }
1900 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1901 sizeof as last operand of certain builtins. */
1903 void
1907 {
1911 location_t loc;
1919 {
1923 /* FALLTHRU */
1931 /* FALLTHRU */
1990 }
2018 {
2022 {
2025 "argument to %<sizeof%> in %qD call is the same "
2026 "expression as the destination; did you mean to "
2032 "argument to %<sizeof%> in %qD call is the same "
2033 "expression as the destination; did you mean to "
2035 else
2037 "argument to %<sizeof%> in %qD call is the same "
2038 "expression as the destination; did you mean to "
2041 }
2044 && !strop
2047 {
2049 "argument to %<sizeof%> in %qD call is the same "
2050 "pointer type %qT as the destination; expected %qT "
2054 }
2055 }
2058 {
2062 {
2065 "argument to %<sizeof%> in %qD call is the same "
2066 "expression as the source; did you mean to "
2072 "argument to %<sizeof%> in %qD call is the same "
2073 "expression as the source; did you mean to "
2075 else
2077 "argument to %<sizeof%> in %qD call is the same "
2078 "expression as the source; did you mean to "
2081 }
2084 && !strop
2087 {
2089 "argument to %<sizeof%> in %qD call is the same "
2090 "pointer type %qT as the source; expected %qT "
2094 }
2095 }
2098 {
2102 {
2105 "argument to %<sizeof%> in %qD call is the same "
2106 "expression as the first source; did you mean to "
2112 "argument to %<sizeof%> in %qD call is the same "
2113 "expression as the first source; did you mean to "
2115 else
2117 "argument to %<sizeof%> in %qD call is the same "
2118 "expression as the first source; did you mean to "
2121 }
2124 && !strop
2127 {
2129 "argument to %<sizeof%> in %qD call is the same "
2130 "pointer type %qT as the first source; expected %qT "
2134 }
2135 }
2138 {
2142 {
2145 "argument to %<sizeof%> in %qD call is the same "
2146 "expression as the second source; did you mean to "
2152 "argument to %<sizeof%> in %qD call is the same "
2153 "expression as the second source; did you mean to "
2155 else
2157 "argument to %<sizeof%> in %qD call is the same "
2158 "expression as the second source; did you mean to "
2161 }
2164 && !strop
2167 {
2169 "argument to %<sizeof%> in %qD call is the same "
2170 "pointer type %qT as the second source; expected %qT "
2174 }
2175 }
2177 }
2179 /* Warn for unlikely, improbable, or stupid DECL declarations
2180 of `main'. */
2182 void
2184 {
2185 function_args_iterator iter;
2186 tree type;
2190 {
2191 /* XXX void_type_node belies the abstraction. */
2197 {
2219 "third argument of %q+D should probably be "
2222 }
2223 }
2225 /* It is intentional that this message does not mention the third
2226 argument because it's only mentioned in an appendix of the
2227 standard. */
2231 }
2233 /* vector_targets_convertible_p is used for vector pointer types. The
2234 callers perform various checks that the qualifiers are satisfactory,
2235 while OTOH vector_targets_convertible_p ignores the number of elements
2236 in the vectors. That's fine with vector pointers as we can consider,
2237 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2238 and that does not require and conversion of the pointer values.
2239 In contrast, vector_types_convertible_p and
2240 vector_types_compatible_elements_p are used for vector value types. */
2241 /* True if pointers to distinct types T1 and T2 can be converted to
2242 each other without an explicit cast. Only returns true for opaque
2243 vector types. */
2244 bool
2246 {
2253 }
2255 /* vector_types_convertible_p is used for vector value types.
2256 It could in principle call vector_targets_convertible_p as a subroutine,
2257 but then the check for vector type would be duplicated with its callers,
2258 and also the purpose of vector_targets_convertible_p would become
2259 muddled.
2260 Where vector_types_convertible_p returns true, a conversion might still be
2261 needed to make the types match.
2262 In contrast, vector_targets_convertible_p is used for vector pointer
2263 values, and vector_types_compatible_elements_p is used specifically
2264 in the context for binary operators, as a check if use is possible without
2265 conversion. */
2266 /* True if vector types T1 and T2 can be converted to each other
2267 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2268 can only be converted with -flax-vector-conversions yet that is not
2269 in effect, emit a note telling the user about that option if such
2270 a note has not previously been emitted. */
2271 bool
2273 {
2281 convertible_lax =
2296 {
2299 "conversions between vectors with differing "
2301 }
2304 }
2306 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2307 and have vector types, V0 has the same type as V1, and the number of
2308 elements of V0, V1, MASK is the same.
2310 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2311 called with two arguments. In this case implementation passes the
2312 first argument twice in order to share the same tree code. This fact
2313 could enable the mask-values being twice the vector length. This is
2314 an implementation accident and this semantics is not guaranteed to
2315 the user. */
2316 tree
2319 {
2320 tree ret;
2326 {
2329 }
2337 {
2342 }
2346 {
2350 }
2353 {
2358 }
2364 {
2367 "argument vector(s) and the mask vector should "
2370 }
2374 {
2379 }
2382 {
2383 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2389 else
2390 {
2393 }
2397 }
2407 }
2409 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2410 to integral type. */
2412 static tree
2414 {
2419 {
2420 /* C++0x scoped enumerations don't implicitly convert to integral
2421 type; if we stripped an explicit conversion to a larger type we
2422 need to replace it so common_type will still work. */
2426 }
2428 }
2430 /* This is a helper function of build_binary_op.
2432 For certain operations if both args were extended from the same
2433 smaller type, do the arithmetic in that type and then extend.
2435 BITWISE indicates a bitwise operation.
2436 For them, this optimization is safe only if
2437 both args are zero-extended or both are sign-extended.
2438 Otherwise, we might change the result.
2439 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2440 but calculated in (unsigned short) it would be (unsigned short)-1.
2441 */
2442 tree
2444 {
2448 tree type;
2450 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2451 excessive narrowing when we call get_narrower below. For
2452 example, suppose that OP0 is of unsigned int extended
2453 from signed char and that RESULT_TYPE is long long int.
2454 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2455 like
2457 (long long int) (unsigned int) signed_char
2459 which get_narrower would narrow down to
2461 (unsigned int) signed char
2463 If we do not cast OP0 first, get_narrower would return
2464 signed_char, which is inconsistent with the case of the
2465 explicit cast. */
2472 /* UNS is 1 if the operation to be done is an unsigned one. */
2475 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2476 but it *requires* conversion to FINAL_TYPE. */
2487 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2489 /* For bitwise operations, signedness of nominal type
2490 does not matter. Consider only how operands were extended. */
2494 /* Note that in all three cases below we refrain from optimizing
2495 an unsigned operation on sign-extended args.
2496 That would not be valid. */
2498 /* Both args variable: if both extended in same way
2499 from same width, do it in that width.
2500 Do it unsigned if args were zero-extended. */
2507 return c_common_signed_or_unsigned_type
2514 && (type
2525 && (type
2533 }
2535 /* Checks if expression EXPR of real/integer type cannot be converted
2536 to the real/integer type TYPE. Function returns non-zero when:
2537 * EXPR is a constant which cannot be exactly converted to TYPE.
2538 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2539 for EXPR type and TYPE being both integers or both real.
2540 * EXPR is not a constant of real type and TYPE is an integer.
2541 * EXPR is not a constant of integer type which cannot be
2542 exactly converted to real type.
2543 Function allows conversions between types of different signedness and
2544 can return SAFE_CONVERSION (zero) in that case. Function can produce
2545 signedness warnings if PRODUCE_WARNS is true. */
2547 enum conversion_safety
2549 {
2555 {
2556 /* Warn for real constant that is not an exact integer converted
2557 to integer type. */
2560 {
2563 }
2564 /* Warn for an integer constant that does not fit into integer type. */
2568 {
2571 {
2575 }
2577 {
2581 }
2582 else
2584 }
2586 {
2587 /* Warn for an integer constant that does not fit into real type. */
2589 {
2593 }
2594 /* Warn for a real constant that does not fit into a smaller
2595 real type. */
2598 {
2602 }
2603 }
2604 }
2605 else
2606 {
2607 /* Warn for real types converted to integer types. */
2614 {
2615 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2619 /* Don't warn for short y; short x = ((int)y & 0xff); */
2623 {
2624 /* If both args were extended from a shortest type,
2625 use that type if that is safe. */
2632 {
2638 /* If one of the operands is a non-negative constant
2639 that fits in the target type, then the type of the
2640 other operand does not matter. */
2649 /* If constant is unsigned and fits in the target
2650 type, then the result will also fit. */
2652 && unsigned0
2655 && unsigned1
2658 }
2659 }
2660 /* Warn for integer types converted to smaller integer types. */
2664 /* When they are the same width but different signedness,
2665 then the value may change. */
2668 /* Even when converted to a bigger type, if the type is
2669 unsigned but expr is signed, then negative values
2670 will be changed. */
2676 }
2678 /* Warn for integer types converted to real types if and only if
2679 all the range of values of the integer type cannot be
2680 represented by the real type. */
2683 {
2687 /* Don't warn about char y = 0xff; float x = (int) y; */
2699 }
2701 /* Warn for real types converted to smaller real types. */
2706 }
2709 }
2711 /* Warns if the conversion of EXPR to TYPE may alter a value.
2712 This is a helper function for warnings_for_convert_and_check. */
2714 static void
2716 {
2723 /* This may happen, because for LHS op= RHS we preevaluate
2724 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2725 means we could no longer see the code of the EXPR. */
2732 {
2745 /* Conversion from boolean to a signed:1 bit-field (which only
2746 can hold the values 0 and -1) doesn't lose information - but
2747 it does change the value. */
2767 {
2768 /* In case of COND_EXPR, we do not care about the type of
2769 COND_EXPR, only about the conversion of each operand. */
2776 }
2788 }
2789 }
2791 /* Produce warnings after a conversion. RESULT is the result of
2792 converting EXPR to TYPE. This is a helper function for
2793 convert_and_check and cp_convert_and_check. */
2795 void
2797 tree result)
2798 {
2805 {
2806 /* Do not diagnose overflow in a constant expression merely
2807 because a conversion overflowed. */
2812 {
2813 /* This detects cases like converting -129 or 256 to
2814 unsigned char. */
2818 else
2820 }
2824 /* No warning for converting 0x80000000 to int. */
2832 else
2834 }
2839 else
2841 }
2844 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2845 Invoke this function on every expression that is converted implicitly,
2846 i.e. because of language rules and not because of an explicit cast. */
2848 tree
2850 {
2851 tree result;
2852 tree expr_for_warning;
2854 /* Convert from a value with possible excess precision rather than
2855 via the semantic type, but do not warn about values not fitting
2856 exactly in the semantic type. */
2858 {
2864 }
2865 else
2879 }
2880 \f
2881 /* A node in a list that describes references to variables (EXPR), which are
2882 either read accesses if WRITER is zero, or write accesses, in which case
2883 WRITER is the parent of EXPR. */
2884 struct tlist
2885 {
2888 };
2890 /* Used to implement a cache the results of a call to verify_tree. We only
2891 use this for SAVE_EXPRs. */
2892 struct tlist_cache
2893 {
2897 tree expr;
2898 };
2900 /* Obstack to use when allocating tlist structures, and corresponding
2901 firstobj. */
2905 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2906 warnings. */
2908 /* SAVE_EXPRs need special treatment. We process them only once and then
2909 cache the results. */
2921 /* Create a new struct tlist and fill in its fields. */
2924 {
2931 }
2933 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2934 is nonnull, we ignore any node we find which has a writer equal to it. */
2936 static void
2938 {
2940 {
2947 }
2948 }
2950 /* Merge the nodes of ADD into TO. This merging process is done so that for
2951 each variable that already exists in TO, no new node is added; however if
2952 there is a write access recorded in ADD, and an occurrence on TO is only
2953 a read access, then the occurrence in TO will be modified to record the
2954 write. */
2956 static void
2958 {
2965 {
2972 {
2976 }
2978 {
2982 }
2984 }
2985 }
2987 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2988 references in list LIST conflict with it, excluding reads if ONLY writers
2989 is nonzero. */
2991 static void
2994 {
2997 /* Avoid duplicate warnings. */
3003 {
3007 {
3012 }
3014 }
3015 }
3017 /* Given a list LIST of references to variables, find whether any of these
3018 can cause conflicts due to missing sequence points. */
3020 static void
3022 {
3026 {
3029 }
3030 }
3032 /* Return nonzero if X is a tree that can be verified by the sequence point
3033 warnings. */
3034 static int
3036 {
3043 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3044 (lvalue_p) crash on TRY/CATCH. */
3051 /* No point to track non-const calls, they will never satisfy
3052 operand_equal_p. */
3060 }
3062 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3063 static bool
3065 {
3067 }
3069 /* Walk the tree X, and record accesses to variables. If X is written by the
3070 parent tree, WRITER is the parent.
3071 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3072 expression or its only operand forces a sequence point, then everything up
3073 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3074 in PNO_SP.
3075 Once we return, we will have emitted warnings if any subexpression before
3076 such a sequence point could be undefined. On a higher level, however, the
3077 sequence point may not be relevant, and we'll merge the two lists.
3079 Example: (b++, a) + b;
3080 The call that processes the COMPOUND_EXPR will store the increment of B
3081 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3082 processes the PLUS_EXPR will need to merge the two lists so that
3083 eventually, all accesses end up on the same list (and we'll warn about the
3084 unordered subexpressions b++ and b.
3086 A note on merging. If we modify the former example so that our expression
3087 becomes
3088 (b++, b) + a
3089 care must be taken not simply to add all three expressions into the final
3090 PNO_SP list. The function merge_tlist takes care of that by merging the
3091 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3092 way, so that no more than one access to B is recorded. */
3094 static void
3096 tree writer)
3097 {
3102 /* X may be NULL if it is the operand of an empty statement expression
3103 ({ }). */
3107 restart:
3115 {
3148 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3149 two first, to avoid warning for (a ? b++ : b++). */
3165 /* Expressions inside the LHS are not ordered wrt. the sequence points
3166 in the RHS. Example:
3167 *a = (a++, 2)
3168 Despite the fact that the modification of "a" is in the before_sp
3169 list (tmp_before), it conflicts with the use of "a" in the LHS.
3170 We can handle this by adding the contents of tmp_list3
3171 to those of tmp_before, and redoing the collision warnings for that
3172 list. */
3175 /* Exclude the LHS itself here; we first have to merge it into the
3176 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3177 didn't exclude the LHS, we'd get it twice, once as a read and once
3178 as a write. */
3189 /* We need to warn about conflicts among arguments and conflicts between
3190 args and the function address. Side effects of the function address,
3191 however, are not ordered by the sequence point of the call. */
3192 {
3193 call_expr_arg_iterator iter;
3194 tree arg;
3198 {
3203 }
3208 }
3211 /* Scan all the list, e.g. indices of multi dimensional array. */
3213 {
3219 }
3223 {
3230 {
3244 }
3248 }
3258 /* For other expressions, simply recurse on their operands.
3259 Manual tail recursion for unary expressions.
3260 Other non-expressions need not be processed. */
3262 {
3266 }
3268 {
3272 {
3277 }
3278 }
3280 }
3281 }
3283 /* Try to warn for undefined behavior in EXPR due to missing sequence
3284 points. */
3286 DEBUG_FUNCTION void
3288 {
3294 {
3297 }
3302 }
3303 \f
3304 /* Validate the expression after `case' and apply default promotions. */
3306 static tree
3308 {
3313 /* Promote char or short to int. */
3316 {
3319 }
3324 }
3325 \f
3326 /* See if the case values LOW and HIGH are in the range of the original
3327 type (i.e. before the default conversion to int) of the switch testing
3328 expression.
3329 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3330 the type before promoting it. CASE_LOW_P is a pointer to the lower
3331 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3332 if the case is not a case range.
3333 The caller has to make sure that we are not called with NULL for
3334 CASE_LOW_P (i.e. the default case).
3335 Returns true if the case label is in range of ORIG_TYPE (saturated or
3336 untouched) or false if the label is out of range. */
3338 static bool
3341 {
3346 /* If there was a problem with the original type, do nothing. */
3353 /* Case label is less than minimum for type. */
3356 {
3359 }
3361 /* Case value is greater than maximum for type. */
3364 {
3367 }
3369 /* Saturate lower case label value to minimum. */
3372 {
3376 }
3378 /* Saturate upper case label value to maximum. */
3381 {
3385 }
3393 }
3394 \f
3395 /* Return an integer type with BITS bits of precision,
3396 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3398 tree
3400 {
3439 }
3441 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3442 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3443 and saturating if SATP is nonzero, otherwise not saturating. */
3445 tree
3448 {
3452 else
3460 {
3462 "fixed-point types that have too many integral and "
3465 }
3468 }
3470 /* Used for communication between c_common_type_for_mode and
3471 c_register_builtin_type. */
3474 /* Return a data type that has machine mode MODE.
3475 If the mode is an integer,
3476 then UNSIGNEDP selects between signed and unsigned types.
3477 If the mode is a fixed-point mode,
3478 then UNSIGNEDP selects between saturating and nonsaturating types. */
3480 tree
3482 {
3483 tree t;
3520 #if HOST_BITS_PER_WIDE_INT >= 64
3523 #endif
3548 {
3550 tree inner_type;
3566 }
3568 {
3573 }
3583 {
3669 }
3677 }
3679 tree
3681 {
3683 }
3685 /* Return a signed type the same as TYPE in other respects. */
3687 tree
3689 {
3691 }
3693 /* Return a type the same as TYPE except unsigned or
3694 signed according to UNSIGNEDP. */
3696 tree
3698 {
3699 tree type1;
3701 /* This block of code emulates the behavior of the old
3702 c_common_unsigned_type. In particular, it returns
3703 long_unsigned_type_node if passed a long, even when a int would
3704 have the same size. This is necessary for warnings to work
3705 correctly in archs where sizeof(int) == sizeof(long) */
3708 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3724 #if HOST_BITS_PER_WIDE_INT >= 64
3727 #endif
3737 #define C_COMMON_FIXED_TYPES(NAME) \
3738 if (type1 == short_ ## NAME ## _type_node \
3739 || type1 == unsigned_short_ ## NAME ## _type_node) \
3740 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3741 : short_ ## NAME ## _type_node; \
3742 if (type1 == NAME ## _type_node \
3743 || type1 == unsigned_ ## NAME ## _type_node) \
3744 return unsignedp ? unsigned_ ## NAME ## _type_node \
3745 : NAME ## _type_node; \
3746 if (type1 == long_ ## NAME ## _type_node \
3747 || type1 == unsigned_long_ ## NAME ## _type_node) \
3748 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3749 : long_ ## NAME ## _type_node; \
3750 if (type1 == long_long_ ## NAME ## _type_node \
3751 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3752 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3753 : long_long_ ## NAME ## _type_node;
3755 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3756 if (type1 == NAME ## _type_node \
3757 || type1 == u ## NAME ## _type_node) \
3758 return unsignedp ? u ## NAME ## _type_node \
3759 : NAME ## _type_node;
3761 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3762 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3763 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3764 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3765 : sat_ ## short_ ## NAME ## _type_node; \
3766 if (type1 == sat_ ## NAME ## _type_node \
3767 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3768 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3769 : sat_ ## NAME ## _type_node; \
3770 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3771 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3772 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3773 : sat_ ## long_ ## NAME ## _type_node; \
3774 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3775 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3776 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3777 : sat_ ## long_long_ ## NAME ## _type_node;
3779 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3780 if (type1 == sat_ ## NAME ## _type_node \
3781 || type1 == sat_ ## u ## NAME ## _type_node) \
3782 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3783 : sat_ ## NAME ## _type_node;
3809 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3810 the precision; they have precision set to match their range, but
3811 may use a wider mode to match an ABI. If we change modes, we may
3812 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3813 the precision as well, so as to yield correct results for
3814 bit-field types. C++ does not have these separate bit-field
3815 types, and producing a signed or unsigned variant of an
3816 ENUMERAL_TYPE may cause other problems as well. */
3822 #define TYPE_OK(node) \
3823 (TYPE_MODE (type) == TYPE_MODE (node) \
3824 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3843 #if HOST_BITS_PER_WIDE_INT >= 64
3846 #endif
3855 #undef TYPE_OK
3858 }
3860 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3862 tree
3864 {
3865 /* Extended integer types of the same width as a standard type have
3866 lesser rank, so those of the same width as int promote to int or
3867 unsigned int and are valid for printf formats expecting int or
3868 unsigned int. To avoid such special cases, avoid creating
3869 extended integer types for bit-fields if a standard integer type
3870 is available. */
3887 }
3889 /* The C version of the register_builtin_type langhook. */
3891 void
3893 {
3894 tree decl;
3904 }
3905 \f
3906 /* Print an error message for invalid operands to arith operation
3907 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3908 LOCATION is the location of the message. */
3910 void
3913 {
3917 {
3962 }
3966 }
3967 \f
3968 /* Given an expression as a tree, return its original type. Do this
3969 by stripping any conversion that preserves the sign and precision. */
3970 static tree
3972 {
3975 }
3977 /* Subroutine of build_binary_op, used for comparison operations.
3978 See if the operands have both been converted from subword integer types
3979 and, if so, perhaps change them both back to their original type.
3980 This function is also responsible for converting the two operands
3981 to the proper common type for comparison.
3983 The arguments of this function are all pointers to local variables
3984 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3985 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3987 LOC is the location of the comparison.
3989 If this function returns nonzero, it means that the comparison has
3990 a constant value. What this function returns is an expression for
3991 that value. */
3993 tree
3996 {
3997 tree type;
4005 /* Throw away any conversions to wider types
4006 already present in the operands. */
4011 /* If primopN is first sign-extended from primopN's precision to opN's
4012 precision, then zero-extended from opN's precision to
4013 *restype_ptr precision, shortenings might be invalid. */
4016 && !unsignedp0
4021 && !unsignedp1
4025 /* Handle the case that OP0 does not *contain* a conversion
4026 but it *requires* conversion to FINAL_TYPE. */
4033 /* If one of the operands must be floated, we cannot optimize. */
4037 /* If first arg is constant, swap the args (changing operation
4038 so value is preserved), for canonicalization. Don't do this if
4039 the second arg is 0. */
4044 {
4061 {
4076 }
4078 }
4080 /* If comparing an integer against a constant more bits wide,
4081 maybe we can deduce a value of 1 or 0 independent of the data.
4082 Or else truncate the constant now
4083 rather than extend the variable at run time.
4085 This is only interesting if the constant is the wider arg.
4086 Also, it is not safe if the constant is unsigned and the
4087 variable arg is signed, since in this case the variable
4088 would be sign-extended and then regarded as unsigned.
4089 Our technique fails in this case because the lowest/highest
4090 possible unsigned results don't follow naturally from the
4091 lowest/highest possible values of the variable operand.
4092 For just EQ_EXPR and NE_EXPR there is another technique that
4093 could be used: see if the constant can be faithfully represented
4094 in the other operand's type, by truncating it and reextending it
4095 and see if that preserves the constant's value. */
4101 {
4104 /* 1 if comparison is nominally unsigned. */
4106 tree val;
4118 {
4119 /* Convert primop1 to target type, but do not introduce
4120 additional overflow. We know primop1 is an int_cst. */
4124 }
4126 {
4129 }
4132 {
4137 }
4138 else
4139 {
4144 }
4147 /* This used to be a switch, but Genix compiler can't handle that. */
4149 {
4152 }
4154 {
4157 }
4159 {
4164 }
4166 {
4171 }
4173 {
4178 }
4180 {
4185 }
4187 /* If primop0 was sign-extended and unsigned comparison specd,
4188 we did a signed comparison above using the signed type bounds.
4189 But the comparison we output must be unsigned.
4191 Also, for inequalities, VAL is no good; but if the signed
4192 comparison had *any* fixed result, it follows that the
4193 unsigned comparison just tests the sign in reverse
4194 (positive values are LE, negative ones GE).
4195 So we can generate an unsigned comparison
4196 against an extreme value of the signed type. */
4199 {
4202 {
4217 }
4219 }
4222 {
4229 }
4232 {
4233 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4237 }
4239 /* Value is not predetermined, but do the comparison
4240 in the type of the operand that is not constant.
4241 TYPE is already properly set. */
4242 }
4244 /* If either arg is decimal float and the other is float, find the
4245 proper common type to use for comparison. */
4256 /* If args' natural types are both narrower than nominal type
4257 and both extend in the same manner, compare them
4258 in the type of the wider arg.
4259 Otherwise must actually extend both to the nominal
4260 common type lest different ways of extending
4261 alter the result.
4262 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4267 {
4271 type);
4272 /* Make sure shorter operand is extended the right way
4273 to match the longer operand. */
4274 primop0
4277 primop0);
4278 primop1
4281 primop1);
4282 }
4283 else
4284 {
4285 /* Here we must do the comparison on the nominal type
4286 using the args exactly as we received them. */
4293 {
4295 /* All unsigned values are >= 0, so we warn. However,
4296 if OP0 is a constant that is >= 0, the signedness of
4297 the comparison isn't an issue, so suppress the
4298 warning. */
4303 primop0)))
4304 /* Do not warn for enumeration types. */
4308 {
4325 }
4328 {
4329 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4334 }
4335 }
4336 }
4344 }
4345 \f
4346 /* Return a tree for the sum or difference (RESULTCODE says which)
4347 of pointer PTROP and integer INTOP. */
4349 tree
4352 {
4355 /* The result is a pointer of the same type that is being added. */
4359 {
4366 }
4368 {
4375 }
4376 else
4379 /* We are manipulating pointer values, so we don't need to warn
4380 about relying on undefined signed overflow. We disable the
4381 warning here because we use integer types so fold won't know that
4382 they are really pointers. */
4385 /* If what we are about to multiply by the size of the elements
4386 contains a constant term, apply distributive law
4387 and multiply that constant term separately.
4388 This helps produce common subexpressions. */
4393 /* If the constant comes from pointer subtraction,
4394 skip this optimization--it would cause an error. */
4396 /* If the constant is unsigned, and smaller than the pointer size,
4397 then we must skip this optimization. This is because it could cause
4398 an overflow error if the constant is negative but INTOP is not. */
4402 {
4407 /* Convert both subexpression types to the type of intop,
4408 because weird cases involving pointer arithmetic
4409 can result in a sum or difference with different type args. */
4414 }
4416 /* Convert the integer argument to a type the same size as sizetype
4417 so the multiply won't overflow spuriously. */
4423 /* Replace the integer argument with a suitable product by the object size.
4424 Do this multiplication as signed, then convert to the appropriate type
4425 for the pointer operation and disregard an overflow that occurred only
4426 because of the sign-extension change in the latter conversion. */
4427 {
4435 }
4437 /* Create the sum or difference. */
4446 }
4447 \f
4448 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4449 and if NON_CONST is known not to be permitted in an evaluated part
4450 of a constant expression. */
4452 tree
4454 {
4458 /* This should never be called for C++. */
4462 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4471 }
4473 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4474 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4475 around the SAVE_EXPR if needed so that c_fully_fold does not need
4476 to look inside SAVE_EXPRs. */
4478 tree
4480 {
4489 }
4491 /* Return whether EXPR is a declaration whose address can never be
4492 NULL. */
4494 bool
4496 {
4501 }
4503 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4504 or for an `if' or `while' statement or ?..: exp. It should already
4505 have been validated to be of suitable type; otherwise, a bad
4506 diagnostic may result.
4508 The EXPR is located at LOCATION.
4510 This preparation consists of taking the ordinary
4511 representation of an expression expr and producing a valid tree
4512 boolean expression describing whether expr is nonzero. We could
4513 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4514 but we optimize comparisons, &&, ||, and !.
4516 The resulting type should always be `truthvalue_type_node'. */
4518 tree
4520 {
4522 {
4564 ? truthvalue_true_node
4570 ? truthvalue_true_node
4575 /* Fall through. */
4578 {
4581 {
4582 /* Common Ada/Pascal programmer's mistake. */
4584 OPT_Waddress,
4586 inner);
4588 }
4590 }
4607 /* These don't change whether an object is nonzero or zero. */
4612 /* These don't change whether an object is zero or nonzero, but
4613 we can't ignore them if their second arg has side-effects. */
4615 {
4618 c_common_truthvalue_conversion
4621 }
4622 else
4627 /* Distribute the conversion into the arms of a COND_EXPR. */
4629 {
4632 /* In C++ one of the arms might have void type if it is throw. */
4640 }
4641 else
4642 {
4643 /* Folding will happen later for C. */
4651 }
4653 CASE_CONVERT:
4654 {
4658 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4659 since that affects how `default_conversion' will behave. */
4663 /* Don't strip a conversion from C++0x scoped enum, since they
4664 don't implicitly convert to other types. */
4668 /* If this isn't narrowing the argument, we can ignore it. */
4672 }
4678 {
4682 }
4687 }
4690 {
4692 expr = (build_binary_op
4696 c_common_truthvalue_conversion
4699 c_common_truthvalue_conversion
4704 }
4707 {
4712 }
4713 else
4716 ret:
4719 }
4720 \f
4729 /* Apply the TYPE_QUALS to the new DECL. */
4731 void
4733 {
4741 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4742 constructor can produce constant init, so rely on cp_finish_decl to
4743 clear TREE_READONLY if the variable has non-constant init. */
4746 {
4749 }
4751 {
4753 /* Allow 'restrict' on arrays of pointers.
4754 FIXME currently we just ignore it. */
4760 }
4761 }
4763 /* Hash function for the problem of multiple type definitions in
4764 different files. This must hash all types that will compare
4765 equal via comptypes to the same value. In practice it hashes
4766 on some of the simple stuff and leaves the details to comptypes. */
4768 static hashval_t
4770 {
4774 tree t2;
4776 {
4777 /* For pointers, hash on pointee type plus some swizzling. */
4780 /* Hash on number of elements and total size. */
4799 }
4800 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4801 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4803 /* We might have a VLA here. */
4806 else
4809 }
4813 /* Return the typed-based alias set for T, which may be an expression
4814 or a type. Return -1 if we don't do anything special. */
4816 alias_set_type
4818 {
4819 tree u;
4822 /* For VLAs, use the alias set of the element type rather than the
4823 default of alias set 0 for types compared structurally. */
4825 {
4829 }
4831 /* Permit type-punning when accessing a union, provided the access
4832 is directly through the union. For example, this code does not
4833 permit taking the address of a union member and then storing
4834 through it. Even the type-punning allowed here is a GCC
4835 extension, albeit a common and useful one; the C standard says
4836 that such accesses have implementation-defined behavior. */
4844 /* That's all the expressions we handle specially. */
4848 /* The C standard guarantees that any object may be accessed via an
4849 lvalue that has character type. */
4855 /* The C standard specifically allows aliasing between signed and
4856 unsigned variants of the same type. We treat the signed
4857 variant as canonical. */
4859 {
4862 /* t1 == t can happen for boolean nodes which are always unsigned. */
4865 }
4867 /* Handle the case of multiple type nodes referring to "the same" type,
4868 which occurs with IMA. These share an alias set. FIXME: Currently only
4869 C90 is handled. (In C99 type compatibility is not transitive, which
4870 complicates things mightily. The alias set splay trees can theoretically
4871 represent this, but insertion is tricky when you consider all the
4872 different orders things might arrive in.) */
4877 /* Save time if there's only one input file. */
4881 /* Pointers need special handling if they point to any type that
4882 needs special handling (below). */
4884 {
4885 tree t2;
4886 /* Find bottom type under any nested POINTERs. */
4890 ;
4898 }
4899 /* These are the only cases that need special handling. */
4906 /* Undefined? */
4910 /* Look up t in hash table. Only one of the compatible types within each
4911 alias set is recorded in the table. */
4915 NULL);
4918 {
4921 }
4922 else
4923 /* Our caller will assign and record (in t) a new alias set; all we need
4924 to do is remember t in the hash table. */
4928 }
4929 \f
4930 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4931 the IS_SIZEOF parameter indicates which operator is being applied.
4932 The COMPLAIN flag controls whether we should diagnose possibly
4933 ill-formed constructs or not. LOC is the location of the SIZEOF or
4934 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4935 a type in any context should be returned, rather than the normal
4936 alignment for that type. */
4938 tree
4942 {
4950 {
4952 {
4959 }
4960 else
4961 {
4963 {
4967 else
4970 }
4972 }
4973 }
4975 {
4983 }
4986 {
4991 }
4994 {
4999 }
5000 else
5001 {
5003 /* Convert in case a char is more than one unit. */
5008 {
5011 #ifdef BIGGEST_FIELD_ALIGNMENT
5013 #endif
5015 #ifdef ADJUST_FIELD_ALIGN
5017 type);
5019 #endif
5022 }
5023 else
5025 }
5027 /* VALUE will have the middle-end integer type sizetype.
5028 However, we should really return a value of type `size_t',
5029 which is just a typedef for an ordinary integer type. */
5033 }
5035 /* Implement the __alignof keyword: Return the minimum required
5036 alignment of EXPR, measured in bytes. For VAR_DECLs,
5037 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5038 from an "aligned" __attribute__ specification). LOC is the
5039 location of the ALIGNOF operator. */
5041 tree
5043 {
5044 tree t;
5051 {
5054 }
5060 {
5067 {
5074 }
5076 }
5077 else
5081 }
5082 \f
5083 /* Handle C and C++ default attributes. */
5085 enum built_in_attribute
5086 {
5087 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5088 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5089 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5090 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5091 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5093 #undef DEF_ATTR_NULL_TREE
5094 #undef DEF_ATTR_INT
5095 #undef DEF_ATTR_STRING
5096 #undef DEF_ATTR_IDENT
5097 #undef DEF_ATTR_TREE_LIST
5098 ATTR_LAST
5099 };
5105 enum c_builtin_type
5106 {
5107 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5108 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5109 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5110 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5111 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5112 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5113 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5114 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5115 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5116 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5117 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5118 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5119 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5120 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5121 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5122 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5123 NAME,
5124 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5126 #undef DEF_PRIMITIVE_TYPE
5127 #undef DEF_FUNCTION_TYPE_0
5128 #undef DEF_FUNCTION_TYPE_1
5129 #undef DEF_FUNCTION_TYPE_2
5130 #undef DEF_FUNCTION_TYPE_3
5131 #undef DEF_FUNCTION_TYPE_4
5132 #undef DEF_FUNCTION_TYPE_5
5133 #undef DEF_FUNCTION_TYPE_6
5134 #undef DEF_FUNCTION_TYPE_7
5135 #undef DEF_FUNCTION_TYPE_8
5136 #undef DEF_FUNCTION_TYPE_VAR_0
5137 #undef DEF_FUNCTION_TYPE_VAR_1
5138 #undef DEF_FUNCTION_TYPE_VAR_2
5139 #undef DEF_FUNCTION_TYPE_VAR_3
5140 #undef DEF_FUNCTION_TYPE_VAR_4
5141 #undef DEF_FUNCTION_TYPE_VAR_5
5142 #undef DEF_POINTER_TYPE
5143 BT_LAST
5144 };
5148 /* A temporary array for c_common_nodes_and_builtins. Used in
5149 communication with def_fn_type. */
5152 /* A helper function for c_common_nodes_and_builtins. Build function type
5153 for DEF with return type RET and N arguments. If VAR is true, then the
5154 function should be variadic after those N arguments.
5156 Takes special care not to ICE if any of the types involved are
5157 error_mark_node, which indicates that said type is not in fact available
5158 (see builtin_type_for_size). In which case the function type as a whole
5159 should be error_mark_node. */
5161 static void
5163 {
5164 tree t;
5171 {
5177 }
5184 else
5187 egress:
5190 }
5192 /* Build builtin functions common to both C and C++ language
5193 frontends. */
5195 static void
5197 {
5198 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5199 builtin_types[ENUM] = VALUE;
5200 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5201 def_fn_type (ENUM, RETURN, 0, 0);
5202 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5203 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5204 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5205 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5206 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5207 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5208 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5209 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5210 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5211 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5212 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5213 ARG6) \
5214 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5215 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5216 ARG6, ARG7) \
5217 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5218 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5219 ARG6, ARG7, ARG8) \
5220 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5221 ARG7, ARG8);
5222 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5223 def_fn_type (ENUM, RETURN, 1, 0);
5224 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5225 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5226 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5227 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5228 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5229 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5230 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5231 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5232 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5233 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5234 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5235 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5239 #undef DEF_PRIMITIVE_TYPE
5240 #undef DEF_FUNCTION_TYPE_1
5241 #undef DEF_FUNCTION_TYPE_2
5242 #undef DEF_FUNCTION_TYPE_3
5243 #undef DEF_FUNCTION_TYPE_4
5244 #undef DEF_FUNCTION_TYPE_5
5245 #undef DEF_FUNCTION_TYPE_6
5246 #undef DEF_FUNCTION_TYPE_VAR_0
5247 #undef DEF_FUNCTION_TYPE_VAR_1
5248 #undef DEF_FUNCTION_TYPE_VAR_2
5249 #undef DEF_FUNCTION_TYPE_VAR_3
5250 #undef DEF_FUNCTION_TYPE_VAR_4
5251 #undef DEF_FUNCTION_TYPE_VAR_5
5252 #undef DEF_POINTER_TYPE
5257 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5258 NONANSI_P, ATTRS, IMPLICIT, COND) \
5259 if (NAME && COND) \
5260 def_builtin_1 (ENUM, NAME, CLASS, \
5261 builtin_types[(int) TYPE], \
5262 builtin_types[(int) LIBTYPE], \
5263 BOTH_P, FALLBACK_P, NONANSI_P, \
5264 built_in_attributes[(int) ATTRS], IMPLICIT);
5266 #undef DEF_BUILTIN
5274 }
5276 /* Like get_identifier, but avoid warnings about null arguments when
5277 the argument may be NULL for targets where GCC lacks stdint.h type
5278 information. */
5282 {
5284 }
5286 /* Build tree nodes and builtin functions common to both C and C++ language
5287 frontends. */
5289 void
5291 {
5295 tree array_domain_type;
5296 tree va_list_ref_type_node;
5297 tree va_list_arg_type_node;
5301 /* Define `int' and `char' first so that dbx will output them first. */
5305 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5306 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5307 but not C. Are the conditionals here needed? */
5313 long_unsigned_type_node);
5315 {
5317 int128_integer_type_node);
5319 int128_unsigned_type_node);
5320 }
5324 long_long_integer_type_node);
5326 long_long_unsigned_type_node);
5329 long_long_unsigned_type_node);
5332 short_unsigned_type_node);
5335 short_unsigned_type_node);
5337 /* Define both `signed char' and `unsigned char'. */
5341 /* These are types that c_common_type_for_size and
5342 c_common_type_for_mode use. */
5345 intQI_type_node));
5348 intHI_type_node));
5351 intSI_type_node));
5354 intDI_type_node));
5355 #if HOST_BITS_PER_WIDE_INT >= 64
5358 TYPE_DECL,
5360 intTI_type_node));
5361 #endif
5364 unsigned_intQI_type_node));
5367 unsigned_intHI_type_node));
5370 unsigned_intSI_type_node));
5373 unsigned_intDI_type_node));
5374 #if HOST_BITS_PER_WIDE_INT >= 64
5377 TYPE_DECL,
5379 unsigned_intTI_type_node));
5380 #endif
5382 /* Create the widest literal types. */
5383 widest_integer_literal_type_node
5387 widest_integer_literal_type_node));
5389 widest_unsigned_literal_type_node
5393 widest_unsigned_literal_type_node));
5397 pid_type_node =
5404 /* Only supported decimal floating point extension if the target
5405 actually supports underlying modes. */
5409 {
5413 }
5416 {
5421 long_long_fract_type_node);
5423 unsigned_short_fract_type_node);
5425 unsigned_fract_type_node);
5427 unsigned_long_fract_type_node);
5429 unsigned_long_long_fract_type_node);
5431 sat_short_fract_type_node);
5434 sat_long_fract_type_node);
5436 sat_long_long_fract_type_node);
5438 sat_unsigned_short_fract_type_node);
5440 sat_unsigned_fract_type_node);
5442 sat_unsigned_long_fract_type_node);
5444 sat_unsigned_long_long_fract_type_node);
5449 long_long_accum_type_node);
5451 unsigned_short_accum_type_node);
5453 unsigned_accum_type_node);
5455 unsigned_long_accum_type_node);
5457 unsigned_long_long_accum_type_node);
5459 sat_short_accum_type_node);
5462 sat_long_accum_type_node);
5464 sat_long_long_accum_type_node);
5466 sat_unsigned_short_accum_type_node);
5468 sat_unsigned_accum_type_node);
5470 sat_unsigned_long_accum_type_node);
5472 sat_unsigned_long_long_accum_type_node);
5474 }
5477 TYPE_DECL,
5479 complex_integer_type_node));
5481 TYPE_DECL,
5483 complex_float_type_node));
5485 TYPE_DECL,
5487 complex_double_type_node));
5491 complex_long_double_type_node));
5494 /* For C++, make fileptr_type_node a distinct void * type until
5495 FILE type is defined. */
5500 /* Set the TYPE_NAME for any variants that were built before
5501 record_builtin_type gave names to the built-in types. */
5502 {
5508 }
5510 /* This node must not be shared. */
5516 /* Make a type to be the domain of a few array types
5517 whose domains don't really matter.
5518 200 is small enough that it always fits in size_t
5519 and large enough that it can hold most function names for the
5520 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5523 /* Make a type for arrays of characters.
5524 With luck nothing will ever really depend on the length of this
5525 array type. */
5526 char_array_type_node
5530 const_string_type_node
5534 /* This is special for C++ so functions can be overloaded. */
5540 {
5543 else
5546 }
5548 /* This is for wide string constants. */
5549 wchar_array_type_node
5552 /* Define 'char16_t'. */
5557 {
5562 }
5564 /* This is for UTF-16 string constants. */
5565 char16_array_type_node
5568 /* Define 'char32_t'. */
5573 {
5578 }
5580 /* This is for UTF-32 string constants. */
5581 char32_array_type_node
5584 wint_type_node =
5587 intmax_type_node =
5589 uintmax_type_node =
5593 sig_atomic_type_node =
5596 int8_type_node =
5599 int16_type_node =
5602 int32_type_node =
5605 int64_type_node =
5608 uint8_type_node =
5620 int_least8_type_node =
5623 int_least16_type_node =
5626 int_least32_type_node =
5629 int_least64_type_node =
5632 uint_least8_type_node =
5635 uint_least16_type_node =
5638 uint_least32_type_node =
5641 uint_least64_type_node =
5644 int_fast8_type_node =
5647 int_fast16_type_node =
5650 int_fast32_type_node =
5653 int_fast64_type_node =
5656 uint_fast8_type_node =
5659 uint_fast16_type_node =
5662 uint_fast32_type_node =
5665 uint_fast64_type_node =
5668 intptr_type_node =
5671 uintptr_type_node =
5674 default_function_type
5676 ptrdiff_type_node
5683 va_list_type_node));
5685 {
5688 tree ptype;
5691 {
5695 ptype));
5697 }
5698 }
5701 {
5704 }
5705 else
5706 {
5709 }
5716 /* Create the built-in __null node. It is important that this is
5717 not shared. */
5721 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5723 }
5725 /* The number of named compound-literals generated thus far. */
5728 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5730 void
5732 {
5735 compound_literal_number);
5736 compound_literal_number++;
5738 }
5740 tree
5742 {
5746 }
5749 /* Linked list of disabled built-in functions. */
5752 {
5760 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5761 begins with "__builtin_", give an error. */
5763 void
5765 {
5768 else
5769 {
5774 }
5775 }
5778 /* Return true if the built-in function NAME has been disabled, false
5779 otherwise. */
5781 static bool
5783 {
5786 {
5789 }
5791 }
5794 /* Worker for DEF_BUILTIN.
5795 Possibly define a builtin function with one or two names.
5796 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5797 nonansi_p and flag_no_nonansi_builtin. */
5799 static void
5806 {
5807 tree decl;
5820 fnattrs);
5829 }
5830 \f
5831 /* Nonzero if the type T promotes to int. This is (nearly) the
5832 integral promotions defined in ISO C99 6.3.1.1/2. */
5834 bool
5836 {
5838 {
5848 /* ??? Technically all enumerations not larger than an int
5849 promote to an int. But this is used along code paths
5850 that only want to notice a size change. */
5858 }
5859 }
5861 /* Return 1 if PARMS specifies a fixed number of parameters
5862 and none of their types is affected by default promotions. */
5864 int
5866 {
5867 const_tree t;
5869 {
5886 }
5888 }
5890 /* Recursively remove any '*' or '&' operator from TYPE. */
5891 tree
5893 {
5897 }
5899 /* Recursively remove pointer or array type from TYPE. */
5900 tree
5902 {
5906 }
5908 /* Used to compare case labels. K1 and K2 are actually tree nodes
5909 representing case labels, or NULL_TREE for a `default' label.
5910 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5911 K2, and 0 if K1 and K2 are equal. */
5913 int
5915 {
5916 /* Consider a NULL key (such as arises with a `default' label) to be
5917 smaller than anything else. */
5924 }
5926 /* Process a case label, located at LOC, for the range LOW_VALUE
5927 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5928 then this case label is actually a `default' label. If only
5929 HIGH_VALUE is NULL_TREE, then case label was declared using the
5930 usual C/C++ syntax, rather than the GNU case range extension.
5931 CASES is a tree containing all the case ranges processed so far;
5932 COND is the condition for the switch-statement itself. Returns the
5933 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5934 is created. */
5936 tree
5939 {
5940 tree type;
5941 tree label;
5942 tree case_label;
5943 splay_tree_node node;
5945 /* Create the LABEL_DECL itself. */
5948 /* If there was an error processing the switch condition, bail now
5949 before we get more confused. */
5957 {
5960 }
5962 /* Case ranges are a GNU extension. */
5969 {
5974 }
5976 {
5981 }
5984 {
5985 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5986 really a case range, even though it was written that way.
5987 Remove the HIGH_VALUE to simplify later processing. */
5992 }
5994 /* See if the case is in range of the type of the original testing
5995 expression. If both low_value and high_value are out of range,
5996 don't insert the case label and return NULL_TREE. */
6002 /* Look up the LOW_VALUE in the table of case labels we already
6003 have. */
6005 /* If there was not an exact match, check for overlapping ranges.
6006 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6007 that's a `default' label and the only overlap is an exact match. */
6009 {
6010 splay_tree_node low_bound;
6011 splay_tree_node high_bound;
6013 /* Even though there wasn't an exact match, there might be an
6014 overlap between this case range and another case range.
6015 Since we've (inductively) not allowed any overlapping case
6016 ranges, we simply need to find the greatest low case label
6017 that is smaller that LOW_VALUE, and the smallest low case
6018 label that is greater than LOW_VALUE. If there is an overlap
6019 it will occur in one of these two ranges. */
6025 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6026 the LOW_VALUE, so there is no need to check unless the
6027 LOW_BOUND is in fact itself a case range. */
6033 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6034 range is bigger than the low end of the current range, so we
6035 are only interested if the current range is a real range, and
6036 not an ordinary case label. */
6038 && high_value
6040 high_value)
6043 }
6044 /* If there was an overlap, issue an error. */
6046 {
6050 {
6054 }
6056 {
6059 }
6060 else
6061 {
6065 }
6067 }
6069 /* Add a CASE_LABEL to the statement-tree. */
6071 /* Register this case label in the splay tree. */
6078 error_out:
6079 /* Add a label so that the back-end doesn't think that the beginning of
6080 the switch is unreachable. Note that we do not add a case label, as
6081 that just leads to duplicates and thence to failure later on. */
6083 {
6086 }
6088 }
6090 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6091 Used to verify that case values match up with enumerator values. */
6093 static void
6095 {
6098 /* ??? Not working too hard to print the double-word value.
6099 Should perhaps be done with %lwd in the diagnostic routines? */
6108 else
6117 buf);
6118 else
6123 }
6125 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6126 Used to verify that case values match up with enumerator values. */
6128 static int
6130 {
6134 /* Skip default case. */
6138 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6139 when we did our enum->case scan. Reset our scratch bit after. */
6142 else
6145 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6146 not set, that means that CASE_HIGH did not appear when we did our
6147 enum->case scan. Reset our scratch bit after. */
6149 {
6152 else
6154 }
6157 }
6159 /* Handle -Wswitch*. Called from the front end after parsing the
6160 switch construct. */
6161 /* ??? Should probably be somewhere generic, since other languages
6162 besides C and C++ would want this. At the moment, however, C/C++
6163 are the only tree-ssa languages that support enumerations at all,
6164 so the point is moot. */
6166 void
6169 {
6170 splay_tree_node default_node;
6171 splay_tree_node node;
6172 tree chain;
6182 /* From here on, we only care about about enumerated types. */
6186 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6190 /* Check the cases. Warn about case values which are not members of
6191 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6192 there is no default case, check that exactly all enumeration
6193 literals are covered by the cases. */
6195 /* Clearing COND if it is not an integer constant simplifies
6196 the tests inside the loop below. */
6200 /* The time complexity here is O(N*lg(N)) worst case, but for the
6201 common case of monotonically increasing enumerators, it is
6202 O(N), since the nature of the splay tree will keep the next
6203 element adjacent to the root at all times. */
6206 {
6212 {
6213 /* Mark the CASE_LOW part of the case entry as seen. */
6217 }
6219 /* Even though there wasn't an exact match, there might be a
6220 case range which includes the enumerator's value. */
6223 {
6227 {
6228 /* If we match the upper bound exactly, mark the CASE_HIGH
6229 part of the case entry as seen. */
6233 }
6234 }
6236 /* We've now determined that this enumerated literal isn't
6237 handled by the case labels of the switch statement. */
6239 /* If the switch expression is a constant, we only really care
6240 about whether that constant is handled by the switch. */
6244 /* If there is a default_node, the only relevant option is
6245 Wswitch-enum. Otherwise, if both are enabled then we prefer
6246 to warn using -Wswitch because -Wswitch is enabled by -Wall
6247 while -Wswitch-enum is explicit. */
6250 ? OPT_Wswitch_enum
6254 }
6256 /* Warn if there are case expressions that don't correspond to
6257 enumerators. This can occur since C and C++ don't enforce
6258 type-checking of assignments to enumeration variables.
6260 The time complexity here is now always O(N) worst case, since
6261 we should have marked both the lower bound and upper bound of
6262 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6263 above. This scan also resets those fields. */
6266 }
6268 /* Finish an expression taking the address of LABEL (an
6269 IDENTIFIER_NODE). Returns an expression for the address.
6271 LOC is the location for the expression returned. */
6273 tree
6275 {
6276 tree result;
6286 else
6287 {
6290 /* The current function is not necessarily uninlinable.
6291 Computed gotos are incompatible with inlining, but the value
6292 here could be used only in a diagnostic, for example. */
6294 }
6297 }
6298 \f
6300 /* Given a boolean expression ARG, return a tree representing an increment
6301 or decrement (as indicated by CODE) of ARG. The front end must check for
6302 invalid cases (e.g., decrement in C++). */
6303 tree
6305 {
6306 tree val;
6311 {
6334 }
6337 }
6338 \f
6339 /* Built-in macros for stddef.h and stdint.h, that require macros
6340 defined in this file. */
6341 void
6343 {
6406 }
6408 static void
6410 {
6411 /* Fill in the built_in_attributes array. */
6412 #define DEF_ATTR_NULL_TREE(ENUM) \
6413 built_in_attributes[(int) ENUM] = NULL_TREE;
6414 #define DEF_ATTR_INT(ENUM, VALUE) \
6415 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6416 #define DEF_ATTR_STRING(ENUM, VALUE) \
6417 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6418 #define DEF_ATTR_IDENT(ENUM, STRING) \
6419 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6420 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6421 built_in_attributes[(int) ENUM] \
6422 = tree_cons (built_in_attributes[(int) PURPOSE], \
6423 built_in_attributes[(int) VALUE], \
6424 built_in_attributes[(int) CHAIN]);
6426 #undef DEF_ATTR_NULL_TREE
6427 #undef DEF_ATTR_INT
6428 #undef DEF_ATTR_IDENT
6429 #undef DEF_ATTR_TREE_LIST
6430 }
6432 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6433 identifier as an argument, so the front end shouldn't look it up. */
6435 bool
6437 {
6440 /* Unknown attribute that we'll end up ignoring, return true so we
6441 don't complain about an identifier argument. */
6447 else
6449 }
6451 /* Attribute handlers common to C front ends. */
6453 /* Handle a "packed" attribute; arguments as in
6454 struct attribute_spec.handler. */
6456 static tree
6459 {
6461 {
6465 }
6467 {
6469 /* Still pack bitfields. */
6474 else
6476 }
6477 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6478 used for DECL_REGISTER. It wouldn't mean anything anyway.
6479 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6480 that changes what the typedef is typing. */
6481 else
6482 {
6485 }
6488 }
6490 /* Handle a "nocommon" attribute; arguments as in
6491 struct attribute_spec.handler. */
6493 static tree
6497 {
6500 else
6501 {
6504 }
6507 }
6509 /* Handle a "common" attribute; arguments as in
6510 struct attribute_spec.handler. */
6512 static tree
6515 {
6518 else
6519 {
6522 }
6525 }
6527 /* Handle a "noreturn" attribute; arguments as in
6528 struct attribute_spec.handler. */
6530 static tree
6533 {
6536 /* See FIXME comment in c_common_attribute_table. */
6543 = build_pointer_type
6546 else
6547 {
6550 }
6553 }
6555 /* Handle a "hot" and attribute; arguments as in
6556 struct attribute_spec.handler. */
6558 static tree
6561 {
6564 {
6566 {
6570 }
6571 /* Most of the rest of the hot processing is done later with
6572 lookup_attribute. */
6573 }
6574 else
6575 {
6578 }
6581 }
6583 /* Handle a "cold" and attribute; arguments as in
6584 struct attribute_spec.handler. */
6586 static tree
6589 {
6592 {
6594 {
6598 }
6599 /* Most of the rest of the cold processing is done later with
6600 lookup_attribute. */
6601 }
6602 else
6603 {
6606 }
6609 }
6611 /* Handle a "no_sanitize_address" attribute; arguments as in
6612 struct attribute_spec.handler. */
6614 static tree
6617 {
6619 {
6622 }
6625 }
6627 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6628 struct attribute_spec.handler. */
6630 static tree
6633 {
6642 }
6644 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6645 struct attribute_spec.handler. */
6647 static tree
6650 {
6652 {
6655 }
6658 }
6660 /* Handle a "noinline" attribute; arguments as in
6661 struct attribute_spec.handler. */
6663 static tree
6667 {
6670 else
6671 {
6674 }
6677 }
6679 /* Handle a "noclone" attribute; arguments as in
6680 struct attribute_spec.handler. */
6682 static tree
6686 {
6688 {
6691 }
6694 }
6696 /* Handle a "always_inline" attribute; arguments as in
6697 struct attribute_spec.handler. */
6699 static tree
6704 {
6706 {
6707 /* Set the attribute and mark it for disregarding inline
6708 limits. */
6710 }
6711 else
6712 {
6715 }
6718 }
6720 /* Handle a "gnu_inline" attribute; arguments as in
6721 struct attribute_spec.handler. */
6723 static tree
6728 {
6730 {
6731 /* Do nothing else, just set the attribute. We'll get at
6732 it later with lookup_attribute. */
6733 }
6734 else
6735 {
6738 }
6741 }
6743 /* Handle a "leaf" attribute; arguments as in
6744 struct attribute_spec.handler. */
6746 static tree
6750 {
6752 {
6755 }
6757 {
6760 }
6763 }
6765 /* Handle an "artificial" attribute; arguments as in
6766 struct attribute_spec.handler. */
6768 static tree
6773 {
6775 {
6776 /* Do nothing else, just set the attribute. We'll get at
6777 it later with lookup_attribute. */
6778 }
6779 else
6780 {
6783 }
6786 }
6788 /* Handle a "flatten" attribute; arguments as in
6789 struct attribute_spec.handler. */
6791 static tree
6793 tree args ATTRIBUTE_UNUSED,
6795 {
6797 /* Do nothing else, just set the attribute. We'll get at
6798 it later with lookup_attribute. */
6799 ;
6800 else
6801 {
6804 }
6807 }
6809 /* Handle a "warning" or "error" attribute; arguments as in
6810 struct attribute_spec.handler. */
6812 static tree
6815 {
6818 /* Do nothing else, just set the attribute. We'll get at
6819 it later with lookup_attribute. */
6820 ;
6821 else
6822 {
6825 }
6828 }
6830 /* Handle a "used" attribute; arguments as in
6831 struct attribute_spec.handler. */
6833 static tree
6836 {
6842 {
6847 }
6848 else
6849 {
6852 }
6855 }
6857 /* Handle a "unused" attribute; arguments as in
6858 struct attribute_spec.handler. */
6860 static tree
6863 {
6865 {
6873 {
6878 }
6879 else
6880 {
6883 }
6884 }
6885 else
6886 {
6890 }
6893 }
6895 /* Handle a "externally_visible" attribute; arguments as in
6896 struct attribute_spec.handler. */
6898 static tree
6903 {
6907 {
6910 {
6914 }
6915 }
6916 else
6917 {
6920 }
6923 }
6925 /* Handle a "const" attribute; arguments as in
6926 struct attribute_spec.handler. */
6928 static tree
6931 {
6934 /* See FIXME comment on noreturn in c_common_attribute_table. */
6940 = build_pointer_type
6943 else
6944 {
6947 }
6950 }
6952 /* Handle a "transparent_union" attribute; arguments as in
6953 struct attribute_spec.handler. */
6955 static tree
6959 {
6960 tree type;
6971 {
6972 /* Make sure that the first field will work for a transparent union.
6973 If the type isn't complete yet, leave the check to the code in
6974 finish_struct. */
6976 {
6982 }
6985 {
6986 /* If the type isn't complete yet, setting the flag
6987 on a variant wouldn't ever be checked. */
6991 /* build_duplicate_type doesn't work for C++. */
6995 /* A type variant isn't good enough, since we don't a cast
6996 to such a type removed as a no-op. */
6998 }
7002 }
7004 ignored:
7007 }
7009 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7010 get the requested priority for a constructor or destructor,
7011 possibly issuing diagnostics for invalid or reserved
7012 priorities. */
7014 static priority_type
7016 {
7017 HOST_WIDE_INT pri;
7018 tree arg;
7024 {
7027 else
7030 }
7047 {
7050 "destructor priorities from 0 to %d are reserved "
7052 MAX_RESERVED_INIT_PRIORITY);
7053 else
7055 "constructor priorities from 0 to %d are reserved "
7057 MAX_RESERVED_INIT_PRIORITY);
7058 }
7061 invalid:
7064 MAX_INIT_PRIORITY);
7065 else
7067 MAX_INIT_PRIORITY);
7069 }
7071 /* Handle a "constructor" attribute; arguments as in
7072 struct attribute_spec.handler. */
7074 static tree
7078 {
7085 {
7086 priority_type priority;
7091 }
7092 else
7093 {
7096 }
7099 }
7101 /* Handle a "destructor" attribute; arguments as in
7102 struct attribute_spec.handler. */
7104 static tree
7108 {
7115 {
7116 priority_type priority;
7121 }
7122 else
7123 {
7126 }
7129 }
7131 /* Nonzero if the mode is a valid vector mode for this architecture.
7132 This returns nonzero even if there is no hardware support for the
7133 vector mode, but we can emulate with narrower modes. */
7135 static int
7137 {
7141 /* Doh! What's going on? */
7150 /* Hardware support. Woo hoo! */
7156 /* We should probably return 1 if requesting V4DI and we have no DI,
7157 but we have V2DI, but this is probably very unlikely. */
7159 /* If we have support for the inner mode, we can safely emulate it.
7160 We may not have V2DI, but me can emulate with a pair of DIs. */
7162 }
7165 /* Handle a "mode" attribute; arguments as in
7166 struct attribute_spec.handler. */
7168 static tree
7171 {
7179 else
7180 {
7185 tree typefm;
7190 {
7196 }
7198 /* Change this type to have a type with the specified mode.
7199 First check for the special modes. */
7212 else
7215 {
7218 }
7221 {
7224 }
7228 {
7260 }
7262 {
7265 }
7268 {
7273 {
7276 }
7280 else
7283 }
7284 else
7285 {
7286 /* For fixed-point modes, we need to test if the signness of type
7287 and the machine mode are consistent. */
7290 {
7293 }
7294 /* For fixed-point modes, we need to pass saturating info. */
7298 }
7301 {
7304 }
7306 {
7307 /* For enumeral types, copy the precision from the integer
7308 type returned above. If not an INTEGER_TYPE, we can't use
7309 this mode for this type. */
7311 {
7314 }
7317 {
7320 }
7321 else
7322 {
7323 /* We cannot build a type variant, as there's code that assumes
7324 that TYPE_MAIN_VARIANT has the same mode. This includes the
7325 debug generators. Instead, create a subrange type. This
7326 results in all of the enumeral values being emitted only once
7327 in the original, and the subtype gets them by reference. */
7330 else
7333 }
7334 }
7338 {
7341 }
7344 }
7347 }
7349 /* Handle a "section" attribute; arguments as in
7350 struct attribute_spec.handler. */
7352 static tree
7355 {
7359 {
7365 {
7369 {
7371 "section attribute cannot be specified for "
7374 }
7376 /* The decl may have already been given a section attribute
7377 from a previous declaration. Ensure they match. */
7381 {
7385 }
7389 {
7392 }
7393 else
7395 }
7396 else
7397 {
7400 }
7401 }
7402 else
7403 {
7407 }
7410 }
7412 /* Check whether ALIGN is a valid user-specified alignment. If so,
7413 return its base-2 log; if not, output an error and return -1. If
7414 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7415 no error. */
7416 int
7418 {
7423 {
7426 }
7431 {
7434 }
7436 {
7439 }
7441 }
7443 /*
7444 If in c++-11, check if the c++-11 alignment constraint with respect
7445 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7446 c++-11 mode, does nothing.
7448 [dcl.align]2/ says:
7450 [* if the constant expression evaluates to a fundamental alignment,
7451 the alignment requirement of the declared entity shall be the
7452 specified fundamental alignment.
7454 * if the constant expression evaluates to an extended alignment
7455 and the implementation supports that alignment in the context
7456 of the declaration, the alignment of the declared entity shall
7457 be that alignment
7459 * if the constant expression evaluates to an extended alignment
7460 and the implementation does not support that alignment in the
7461 context of the declaration, the program is ill-formed]. */
7463 static bool
7467 {
7480 {
7482 {
7483 /* For file scope variables and static members, the target
7484 supports alignments that are at most
7485 MAX_OFILE_ALIGNMENT. */
7488 }
7489 else
7490 {
7491 #ifdef BIGGEST_FIELD_ALIGNMENT
7492 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7493 #else
7494 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7495 #endif
7496 /* For non-static members, the target supports either
7497 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7498 if it is defined or BIGGEST_ALIGNMENT. */
7503 #undef MAX_TARGET_FIELD_ALIGNMENT
7504 /* For stack variables, the target supports at most
7505 MAX_STACK_ALIGNMENT. */
7509 }
7510 }
7512 {
7513 /* Let's be liberal for types. */
7516 }
7524 }
7526 /* Handle a "aligned" attribute; arguments as in
7527 struct attribute_spec.handler. */
7529 static tree
7532 {
7536 tree align_expr;
7540 {
7544 }
7545 else
7549 {
7553 }
7561 {
7564 /* If we have a TYPE_DECL, then copy the type, so that we
7565 don't accidentally modify a builtin type. See pushdecl. */
7568 {
7575 }
7576 else
7581 }
7584 {
7587 }
7590 /* C++-11 [dcl.align/4]:
7592 When multiple alignment-specifiers are specified for an
7593 entity, the alignment requirement shall be set to the
7594 strictest specified alignment.
7596 This formally comes from the c++11 specification but we are
7597 doing it for the GNU attribute syntax as well. */
7601 {
7606 else
7610 }
7611 else
7612 {
7615 }
7618 }
7620 /* Handle a "weak" attribute; arguments as in
7621 struct attribute_spec.handler. */
7623 static tree
7628 {
7631 {
7634 }
7636 {
7640 }
7644 else
7648 }
7650 /* Handle an "alias" or "ifunc" attribute; arguments as in
7651 struct attribute_spec.handler, except that IS_ALIAS tells us
7652 whether this is an alias as opposed to ifunc attribute. */
7654 static tree
7657 {
7662 {
7665 }
7669 /* A static variable declaration is always a tentative definition,
7670 but the alias is a non-tentative definition which overrides. */
7673 {
7677 }
7681 {
7685 }
7687 /* Note that the very first time we process a nested declaration,
7688 decl_function_context will not be set. Indeed, *would* never
7689 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7690 we do below. After such frobbery, pushdecl would set the context.
7691 In any case, this is never what we want. */
7693 {
7694 tree id;
7698 {
7702 }
7704 /* This counts as a use of the object pointed to. */
7709 else
7713 /* ifuncs are also aliases, so set that attribute too. */
7716 }
7717 else
7718 {
7721 }
7724 }
7726 /* Handle an "alias" or "ifunc" attribute; arguments as in
7727 struct attribute_spec.handler. */
7729 static tree
7732 {
7734 }
7736 /* Handle an "alias" or "ifunc" attribute; arguments as in
7737 struct attribute_spec.handler. */
7739 static tree
7742 {
7744 }
7746 /* Handle a "weakref" attribute; arguments as in struct
7747 attribute_spec.handler. */
7749 static tree
7752 {
7755 /* We must ignore the attribute when it is associated with
7756 local-scoped decls, since attribute alias is ignored and many
7757 such symbols do not even have a DECL_WEAK field. */
7759 || current_function_decl
7761 {
7765 }
7768 {
7772 }
7774 /* The idea here is that `weakref("name")' mutates into `weakref,
7775 alias("name")', and weakref without arguments, in turn,
7776 implicitly adds weak. */
7779 {
7786 }
7787 else
7788 {
7793 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7794 and that isn't supported; and because it wants to add it to
7795 the list of weak decls, which isn't helpful. */
7797 }
7800 }
7802 /* Handle an "visibility" attribute; arguments as in
7803 struct attribute_spec.handler. */
7805 static tree
7809 {
7815 {
7819 {
7821 name);
7823 }
7825 {
7829 }
7830 }
7832 {
7835 }
7838 {
7841 }
7843 /* If this is a type, set the visibility on the type decl. */
7845 {
7850 {
7852 name);
7854 }
7855 }
7865 else
7866 {
7867 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7869 }
7873 {
7887 }
7892 /* Go ahead and attach the attribute to the node as well. This is needed
7893 so we can determine whether we have VISIBILITY_DEFAULT because the
7894 visibility was not specified, or because it was explicitly overridden
7895 from the containing scope. */
7898 }
7900 /* Determine the ELF symbol visibility for DECL, which is either a
7901 variable or a function. It is an error to use this function if a
7902 definition of DECL is not available in this translation unit.
7903 Returns true if the final visibility has been determined by this
7904 function; false if the caller is free to make additional
7905 modifications. */
7907 bool
7909 {
7913 /* If the user explicitly specified the visibility with an
7914 attribute, honor that. DECL_VISIBILITY will have been set during
7915 the processing of the attribute. We check for an explicit
7916 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7917 to distinguish the use of an attribute from the use of a "#pragma
7918 GCC visibility push(...)"; in the latter case we still want other
7919 considerations to be able to overrule the #pragma. */
7921 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7926 /* Set default visibility to whatever the user supplied with
7927 visibility_specified depending on #pragma GCC visibility. */
7929 {
7932 {
7935 /* If visibility changed and DECL already has DECL_RTL, ensure
7936 symbol flags are updated. */
7941 }
7942 }
7944 }
7946 /* Handle an "tls_model" attribute; arguments as in
7947 struct attribute_spec.handler. */
7949 static tree
7952 {
7953 tree id;
7960 {
7963 }
7968 {
7971 }
7981 else
7982 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7986 }
7988 /* Handle a "no_instrument_function" attribute; arguments as in
7989 struct attribute_spec.handler. */
7991 static tree
7996 {
8000 {
8004 }
8005 else
8009 }
8011 /* Handle a "malloc" attribute; arguments as in
8012 struct attribute_spec.handler. */
8014 static tree
8017 {
8021 else
8022 {
8025 }
8028 }
8030 /* Handle a "alloc_size" attribute; arguments as in
8031 struct attribute_spec.handler. */
8033 static tree
8036 {
8039 {
8046 || !arg_count
8048 {
8053 }
8054 }
8056 }
8058 /* Handle a "alloc_align" attribute; arguments as in
8059 struct attribute_spec.handler. */
8061 static tree
8064 {
8071 || !arg_count
8073 {
8078 }
8080 }
8082 /* Handle a "assume_aligned" attribute; arguments as in
8083 struct attribute_spec.handler. */
8085 static tree
8088 {
8090 {
8097 {
8102 }
8103 }
8105 }
8107 /* Handle a "fn spec" attribute; arguments as in
8108 struct attribute_spec.handler. */
8110 static tree
8114 {
8119 }
8121 /* Handle a "warn_unused" attribute; arguments as in
8122 struct attribute_spec.handler. */
8124 static tree
8126 tree args ATTRIBUTE_UNUSED,
8128 {
8130 /* Do nothing else, just set the attribute. We'll get at
8131 it later with lookup_attribute. */
8132 ;
8133 else
8134 {
8137 }
8140 }
8142 /* Handle an "omp declare simd" attribute; arguments as in
8143 struct attribute_spec.handler. */
8145 static tree
8147 {
8149 }
8151 /* Handle an "omp declare target" attribute; arguments as in
8152 struct attribute_spec.handler. */
8154 static tree
8156 {
8158 }
8160 /* Handle a "returns_twice" attribute; arguments as in
8161 struct attribute_spec.handler. */
8163 static tree
8166 {
8169 else
8170 {
8173 }
8176 }
8178 /* Handle a "no_limit_stack" attribute; arguments as in
8179 struct attribute_spec.handler. */
8181 static tree
8186 {
8190 {
8194 }
8196 {
8200 }
8201 else
8205 }
8207 /* Handle a "pure" attribute; arguments as in
8208 struct attribute_spec.handler. */
8210 static tree
8213 {
8216 /* ??? TODO: Support types. */
8217 else
8218 {
8221 }
8224 }
8226 /* Digest an attribute list destined for a transactional memory statement.
8227 ALLOWED is the set of attributes that are allowed for this statement;
8228 return the attribute we parsed. Multiple attributes are never allowed. */
8230 int
8232 {
8237 {
8245 {
8248 }
8251 {
8254 }
8257 else
8259 }
8262 }
8264 /* Transform a TM attribute name into a maskable integer and back.
8265 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8266 to how the lack of an attribute is treated. */
8268 int
8270 {
8284 }
8286 tree
8288 {
8291 {
8309 }
8311 }
8313 /* Return the first TM attribute seen in LIST. */
8315 tree
8317 {
8319 {
8323 }
8325 }
8327 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8328 Here we accept only function types, and verify that none of the other
8329 function TM attributes are also applied. */
8330 /* ??? We need to accept class types for C++, but not C. This greatly
8331 complicates this function, since we can no longer rely on the extra
8332 processing given by function_type_required. */
8334 static tree
8337 {
8338 /* Only one path adds the attribute; others don't. */
8342 {
8345 /* Only tm_callable and tm_safe apply to classes. */
8348 /* FALLTHRU */
8352 {
8355 ;
8358 else
8360 }
8364 {
8367 {
8372 }
8373 }
8374 /* FALLTHRU */
8377 /* If a function is next, pass it on to be tried next. */
8381 ignored:
8384 }
8387 }
8389 /* Handle the TM_WRAP attribute; arguments as in
8390 struct attribute_spec.handler. */
8392 static tree
8395 {
8398 /* We don't need the attribute even on success, since we
8399 record the entry in an external table. */
8404 else
8405 {
8411 else
8412 {
8416 {
8420 else
8422 }
8423 else
8425 }
8426 }
8429 }
8431 /* Ignore the given attribute. Used when this attribute may be usefully
8432 overridden by the target, but is not used generically. */
8434 static tree
8438 {
8441 }
8443 /* Handle a "no vops" attribute; arguments as in
8444 struct attribute_spec.handler. */
8446 static tree
8450 {
8454 }
8456 /* Handle a "deprecated" attribute; arguments as in
8457 struct attribute_spec.handler. */
8459 static tree
8463 {
8471 {
8474 }
8477 {
8488 else
8490 }
8492 {
8497 }
8498 else
8502 {
8505 {
8511 }
8514 else
8516 }
8519 }
8521 /* Handle a "vector_size" attribute; arguments as in
8522 struct attribute_spec.handler. */
8524 static tree
8528 {
8540 {
8543 }
8545 /* Get the vector size (in bytes). */
8548 /* We need to provide for vector pointers, vector arrays, and
8549 functions returning vectors. For example:
8551 __attribute__((vector_size(16))) short *foo;
8553 In this case, the mode is SI, but the type being modified is
8554 HI, so we need to look further. */
8563 /* Get the mode of the type being modified. */
8574 {
8577 }
8580 {
8583 }
8586 {
8589 }
8591 /* Calculate how many units fit in the vector. */
8594 {
8597 }
8601 /* Build back pointers if needed. */
8605 }
8607 /* Handle the "nonnull" attribute. */
8608 static tree
8612 {
8616 /* If no arguments are specified, all pointer arguments should be
8617 non-null. Verify a full prototype is given so that the arguments
8618 will have the correct types when we actually check them later. */
8620 {
8622 {
8625 }
8627 }
8629 /* Argument list specified. Verify that each argument number references
8630 a pointer argument. */
8632 {
8641 {
8646 }
8649 {
8650 function_args_iterator iter;
8651 tree argument;
8655 {
8659 }
8663 {
8668 }
8671 {
8676 }
8677 }
8678 }
8681 }
8683 /* Check the argument list of a function call for null in argument slots
8684 that are marked as requiring a non-null pointer argument. The NARGS
8685 arguments are passed in the array ARGARRAY.
8686 */
8688 static void
8690 {
8691 tree a;
8699 /* See if any of the nonnull attributes has no arguments. If so,
8700 then every pointer argument is checked (in which case the check
8701 for pointer type is done in check_nonnull_arg). */
8703 do
8711 else
8712 {
8713 /* Walk the argument list. If we encounter an argument number we
8714 should check for non-null, do it. */
8716 {
8718 {
8722 }
8727 }
8728 }
8729 }
8731 /* Check that the Nth argument of a function call (counting backwards
8732 from the end) is a (pointer)0. The NARGS arguments are passed in the
8733 array ARGARRAY. */
8735 static void
8737 {
8741 {
8744 tree sentinel;
8745 function_args_iterator iter;
8746 tree t;
8748 /* Skip over the named arguments. */
8750 {
8753 len++;
8754 }
8757 {
8760 }
8762 /* The sentinel must be one of the varargs, i.e.
8763 in position >= the number of fixed arguments. */
8765 {
8769 }
8771 /* Validate the sentinel. */
8775 /* Although __null (in C++) is only an integer we allow it
8776 nevertheless, as we are guaranteed that it's exactly
8777 as wide as a pointer, and we don't want to force
8778 users to cast the NULL they have written there.
8779 We warn with -Wstrict-null-sentinel, though. */
8782 }
8783 }
8785 /* Helper for check_function_nonnull; given a list of operands which
8786 must be non-null in ARGS, determine if operand PARAM_NUM should be
8787 checked. */
8789 static bool
8791 {
8795 {
8802 }
8804 }
8806 /* Check that the function argument PARAM (which is operand number
8807 PARAM_NUM) is non-null. This is called by check_function_nonnull
8808 via check_function_arguments_recurse. */
8810 static void
8813 {
8814 /* Just skip checking the argument if it's not a pointer. This can
8815 happen if the "nonnull" attribute was given without an operand
8816 list (which means to check every pointer argument). */
8824 }
8826 /* Helper for nonnull attribute handling; fetch the operand number
8827 from the attribute argument list. */
8829 static bool
8831 {
8832 /* Verify the arg number is a constant. */
8839 }
8841 /* Handle a "nothrow" attribute; arguments as in
8842 struct attribute_spec.handler. */
8844 static tree
8847 {
8850 /* ??? TODO: Support types. */
8851 else
8852 {
8855 }
8858 }
8860 /* Handle a "cleanup" attribute; arguments as in
8861 struct attribute_spec.handler. */
8863 static tree
8866 {
8870 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8871 for global destructors in C++. This requires infrastructure that
8872 we don't have generically at the moment. It's also not a feature
8873 we'd be missing too much, since we do have attribute constructor. */
8875 {
8879 }
8881 /* Verify that the argument is a function in scope. */
8882 /* ??? We could support pointers to functions here as well, if
8883 that was considered desirable. */
8886 {
8890 }
8893 {
8897 }
8899 /* That the function has proper type is checked with the
8900 eventual call to build_function_call. */
8903 }
8905 /* Handle a "warn_unused_result" attribute. No special handling. */
8907 static tree
8911 {
8912 /* Ignore the attribute for functions not returning any value. */
8914 {
8917 }
8920 }
8922 /* Handle a "sentinel" attribute. */
8924 static tree
8927 {
8929 {
8933 }
8934 else
8935 {
8937 {
8941 }
8942 }
8945 {
8949 {
8953 }
8954 else
8955 {
8957 {
8961 }
8962 }
8963 }
8966 }
8968 /* Handle a "type_generic" attribute. */
8970 static tree
8974 {
8975 /* Ensure we have a function type. */
8978 /* Ensure we have a variadic function. */
8982 }
8984 /* Handle a "target" attribute. */
8986 static tree
8989 {
8990 /* Ensure we have a function type. */
8992 {
8995 }
8997 flags))
9001 }
9003 /* Arguments being collected for optimization. */
9008 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9009 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9010 false for #pragma GCC optimize. */
9012 bool
9014 {
9022 tree ap;
9024 /* Build up argv vector. Just in case the string is stored away, use garbage
9025 collected strings. */
9030 {
9034 {
9038 }
9041 {
9042 /* Split string into multiple substrings. */
9050 {
9057 {
9061 }
9062 else
9063 {
9066 }
9070 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9071 options. */
9073 {
9078 else
9082 }
9085 {
9088 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9089 itself is -Os, and any other switch begins with a -f. */
9095 }
9100 }
9102 }
9103 }
9113 /* Now parse the options. */
9123 /* Don't allow changing -fstrict-aliasing. */
9128 }
9130 /* For handling "optimize" attribute. arguments as in
9131 struct attribute_spec.handler. */
9133 static tree
9136 {
9137 /* Ensure we have a function type. */
9139 {
9142 }
9143 else
9144 {
9148 /* Save current options. */
9151 /* If we previously had some optimization options, use them as the
9152 default. */
9157 /* Parse options, and update the vector. */
9162 /* Restore current options. */
9164 }
9167 }
9169 /* Handle a "no_split_stack" attribute. */
9171 static tree
9176 {
9180 {
9184 }
9186 {
9190 }
9193 }
9195 /* Handle a "returns_nonnull" attribute; arguments as in
9196 struct attribute_spec.handler. */
9198 static tree
9201 {
9202 // Even without a prototype we still have a return type we can check.
9204 {
9207 }
9209 }
9211 \f
9212 /* Check for valid arguments being passed to a function with FNTYPE.
9213 There are NARGS arguments in the array ARGARRAY. */
9214 void
9216 {
9217 /* Check for null being passed in a pointer argument that must be
9218 non-null. We also need to do this if format checking is enabled. */
9223 /* Check for errors in format strings. */
9230 }
9232 /* Generic argument checking recursion routine. PARAM is the argument to
9233 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9234 once the argument is resolved. CTX is context for the callback. */
9235 void
9240 {
9244 {
9245 /* Strip coercion. */
9249 }
9252 {
9254 tree attrs;
9257 /* See if this is a call to a known internationalization function
9258 that modifies a format arg. Such a function may have multiple
9259 format_arg attributes (for example, ngettext). */
9262 attrs;
9265 {
9266 tree inner_arg;
9267 tree format_num_expr;
9270 call_expr_arg_iterator iter;
9272 /* Extract the argument number, which was previously checked
9273 to be valid. */
9282 {
9287 }
9288 }
9290 /* If we found a format_arg attribute and did a recursive check,
9291 we are done with checking this argument. Otherwise, we continue
9292 and this will be considered a non-literal. */
9295 }
9298 {
9299 /* Check both halves of the conditional expression. */
9305 }
9308 }
9310 /* Checks for a builtin function FNDECL that the number of arguments
9311 NARGS against the required number REQUIRED and issues an error if
9312 there is a mismatch. Returns true if the number of arguments is
9313 correct, otherwise false. */
9315 static bool
9317 {
9319 {
9323 }
9325 {
9329 }
9331 }
9333 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9334 Returns false if there was an error, otherwise true. */
9336 bool
9338 {
9344 {
9354 {
9356 {
9360 }
9362 }
9372 {
9379 {
9383 }
9385 }
9390 {
9395 {
9399 }
9402 {
9404 fndecl);
9406 }
9408 }
9413 {
9415 {
9418 }
9420 }
9425 }
9426 }
9428 /* Function to help qsort sort FIELD_DECLs by name order. */
9430 int
9432 {
9437 /* A nontype is "greater" than a type. */
9446 }
9449 gt_pointer_operator new_value;
9453 /* This routine compares two fields like field_decl_cmp but using the
9454 pointer operator in resort_data. */
9456 static int
9458 {
9463 /* A nontype is "greater" than a type. */
9469 {
9476 }
9478 }
9480 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9482 void
9485 gt_pointer_operator new_value,
9487 {
9492 resort_field_decl_cmp);
9493 }
9495 /* Subroutine of c_parse_error.
9496 Return the result of concatenating LHS and RHS. RHS is really
9497 a string literal, its first character is indicated by RHS_START and
9498 RHS_SIZE is its length (including the terminating NUL character).
9500 The caller is responsible for deleting the returned pointer. */
9504 {
9510 }
9512 /* Issue the error given by GMSGID, indicating that it occurred before
9513 TOKEN, which had the associated VALUE. */
9515 void
9518 {
9519 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9529 {
9534 {
9547 }
9551 else
9557 }
9579 {
9584 }
9592 {
9597 }
9598 else
9602 {
9605 }
9606 #undef catenate_messages
9607 }
9609 /* Mapping for cpp message reasons to the options that enable them. */
9611 struct reason_option_codes_t
9612 {
9615 };
9636 };
9638 /* Return the gcc option code associated with the reason for a cpp
9639 message, or 0 if none. */
9641 static int
9643 {
9647 {
9650 }
9652 }
9654 /* Callback from cpp_error for PFILE to print diagnostics from the
9655 preprocessor. The diagnostic is of type LEVEL, with REASON set
9656 to the reason code if LEVEL is represents a warning, at location
9657 LOCATION unless this is after lexing and the compiler's location
9658 should be used instead, with column number possibly overridden by
9659 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9660 the arguments. Returns true if a diagnostic was emitted, false
9661 otherwise. */
9663 bool
9667 {
9668 diagnostic_info diagnostic;
9669 diagnostic_t dlevel;
9674 {
9679 /* Fall through. */
9704 }
9717 }
9719 /* Convert a character from the host to the target execution character
9720 set. cpplib handles this, mostly. */
9722 HOST_WIDE_INT
9724 {
9725 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9726 zero-extended under -fno-signed-char. cpplib insists that characters
9727 and character constants are always unsigned. Hence we must convert
9728 back and forth. */
9736 else
9738 }
9740 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9741 references with an INDIRECT_REF of a constant at the bottom; much like the
9742 traditional rendering of offsetof as a macro. Return the folded result. */
9744 tree
9746 {
9750 {
9766 {
9769 }
9779 {
9783 }
9796 /* Check if the offset goes beyond the upper bound of the array. */
9798 {
9804 {
9808 {
9809 tree v;
9816 {
9824 }
9825 /* Don't warn if the array might be considered a poor
9826 man's flexible array member with a very permissive
9827 definition thereof. */
9831 "index %E denotes an offset "
9834 }
9835 }
9836 }
9843 /* Handle static members of volatile structs. */
9850 }
9853 }
9855 /* Likewise, but convert it to the return type of offsetof. */
9857 tree
9859 {
9861 }
9863 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9864 expression, because B will always be true. */
9866 void
9868 {
9871 "the omitted middle operand in ?: will always be %<true%>, "
9873 }
9875 /* Give an error for storing into ARG, which is 'const'. USE indicates
9876 how ARG was being used. */
9878 void
9880 {
9883 /* Using this macro rather than (for example) arrays of messages
9884 ensures that all the format strings are checked at compile
9885 time. */
9886 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9887 : (use == lv_increment ? (I) \
9888 : (use == lv_decrement ? (D) : (AS))))
9890 {
9901 else
9907 }
9913 arg);
9919 arg);
9921 {
9931 arg);
9932 }
9938 arg);
9939 else
9944 arg);
9945 }
9947 /* Print an error message for an invalid lvalue. USE says
9948 how the lvalue is being used and so selects the error message. LOC
9949 is the location for the error. */
9951 void
9953 {
9955 {
9973 }
9974 }
9976 /* Print an error message for an invalid indirection of type TYPE.
9977 ERRSTRING is the name of the operator for the indirection. */
9979 void
9981 {
9983 {
9991 type);
9996 type);
10001 type);
10006 type);
10011 type);
10015 }
10016 }
10017 \f
10018 /* *PTYPE is an incomplete array. Complete it with a domain based on
10019 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10020 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10021 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10023 int
10025 {
10033 {
10035 {
10036 int eltsize
10039 }
10041 {
10045 {
10049 }
10050 else
10051 {
10052 tree curindex;
10063 {
10067 else
10068 {
10070 {
10071 /* Since we treat size types now as ordinary
10072 unsigned types, we need an explicit overflow
10073 check. */
10077 }
10079 size_one_node);
10080 }
10083 }
10085 {
10089 }
10090 }
10091 }
10092 else
10093 {
10094 /* Make an error message unless that happened already. */
10097 }
10098 }
10099 else
10100 {
10104 }
10111 else
10114 /* Using build_distinct_type_copy and modifying things afterward instead
10115 of using build_array_type to create a new type preserves all of the
10116 TYPE_LANG_FLAG_? bits that the front end may have set. */
10124 /* Make sure we have the canonical MAIN_TYPE. */
10127 hashcode);
10130 /* Fix the canonical type. */
10140 else
10145 else
10151 {
10153 /* If we proceed with the array type as it is, we'll eventually
10154 crash in tree_to_[su]hwi(). */
10156 }
10160 }
10162 /* Like c_mark_addressable but don't check register qualifier. */
10163 void
10165 {
10171 }
10174 \f
10175 /* Used to help initialize the builtin-types.def table. When a type of
10176 the correct size doesn't exist, use error_mark_node instead of NULL.
10177 The later results in segfaults even when a decl using the type doesn't
10178 get invoked. */
10180 tree
10182 {
10185 }
10187 /* A helper function for resolve_overloaded_builtin in resolving the
10188 overloaded __sync_ builtins. Returns a positive power of 2 if the
10189 first operand of PARAMS is a pointer to a supported data type.
10190 Returns 0 if an error is encountered. */
10192 static int
10194 {
10195 tree type;
10199 {
10202 }
10206 {
10207 /* Force array-to-pointer decay for C++. */
10211 }
10223 incompatible:
10226 }
10228 /* A helper function for resolve_overloaded_builtin. Adds casts to
10229 PARAMS to make arguments match up with those of FUNCTION. Drops
10230 the variadic arguments at the end. Returns false if some error
10231 was encountered; true on success. */
10233 static bool
10236 {
10237 function_args_iterator iter;
10238 tree ptype;
10242 /* We've declared the implementation functions to use "volatile void *"
10243 as the pointer parameter, so we shouldn't get any complaints from the
10244 call to check_function_arguments what ever type the user used. */
10249 /* For the rest of the values, we need to cast these to FTYPE, so that we
10250 don't get warnings for passing pointer types, etc. */
10253 {
10257 /* XXX void_type_node belies the abstraction. */
10263 {
10266 }
10268 /* Only convert parameters if arg_type is unsigned integer type with
10269 new format sync routines, i.e. don't attempt to convert pointer
10270 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10271 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10272 kinds). */
10274 {
10275 /* Ideally for the first conversion we'd use convert_for_assignment
10276 so that we get warnings for anything that doesn't match the pointer
10277 type. This isn't portable across the C and C++ front ends atm. */
10282 }
10285 }
10287 /* __atomic routines are not variadic. */
10289 {
10292 }
10294 /* The definition of these primitives is variadic, with the remaining
10295 being "an optional list of variables protected by the memory barrier".
10296 No clue what that's supposed to mean, precisely, but we consider all
10297 call-clobbered variables to be protected so we're safe. */
10301 }
10303 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10304 RESULT to make it match the type of the first pointer argument in
10305 PARAMS. */
10307 static tree
10309 {
10314 /* New format doesn't require casting unless the types are the same size. */
10317 else
10319 }
10321 /* This function verifies the PARAMS to generic atomic FUNCTION.
10322 It returns the size if all the parameters are the same size, otherwise
10323 0 is returned if the parameters are invalid. */
10325 static int
10328 {
10333 tree type_0;
10335 /* Determine the parameter makeup. */
10337 {
10353 }
10356 {
10359 }
10361 /* Get type of first parameter, and determine its size. */
10364 {
10365 /* Force array-to-pointer decay for C++. */
10369 }
10371 {
10373 function);
10375 }
10377 /* Types must be compile time constant sizes. */
10379 {
10382 function);
10384 }
10388 /* Zero size objects are not allowed. */
10390 {
10393 function);
10395 }
10397 /* Check each other parameter is a pointer and the same size. */
10399 {
10402 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10406 {
10408 function);
10410 }
10413 {
10415 function);
10417 }
10418 }
10420 /* Check memory model parameters for validity. */
10422 {
10425 {
10428 {
10431 function);
10432 }
10433 }
10434 else
10436 {
10438 function);
10440 }
10441 }
10444 }
10447 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10448 at the beginning of the parameter list PARAMS representing the size of the
10449 objects. This is to match the library ABI requirement. LOC is the location
10450 of the function call.
10451 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10452 returned to allow the external call to be constructed. */
10454 static tree
10457 {
10458 tree size_node;
10460 /* Insert a SIZE_T parameter as the first param. If there isn't
10461 enough space, allocate a new vector and recursively re-build with that. */
10463 {
10466 tree f;
10476 }
10478 /* Add the size parameter and leave as a function call for processing. */
10482 }
10485 /* Return whether atomic operations for naturally aligned N-byte
10486 arguments are supported, whether inline or through libatomic. */
10487 static bool
10489 {
10491 {
10503 }
10504 }
10506 /* This will process an __atomic_exchange function call, determine whether it
10507 needs to be mapped to the _N variation, or turned into a library call.
10508 LOC is the location of the builtin call.
10509 FUNCTION is the DECL that has been invoked;
10510 PARAMS is the argument list for the call. The return value is non-null
10511 TRUE is returned if it is translated into the proper format for a call to the
10512 external library, and NEW_RETURN is set the tree for that function.
10513 FALSE is returned if processing for the _N variation is required, and
10514 NEW_RETURN is set to the the return value the result is copied into. */
10515 static bool
10518 {
10523 /* Size of 0 is an error condition. */
10525 {
10528 }
10530 /* If not a lock-free size, change to the library generic format. */
10532 {
10535 }
10537 /* Otherwise there is a lockfree match, transform the call from:
10538 void fn(T* mem, T* desired, T* return, model)
10539 into
10540 *return = (T) (fn (In* mem, (In) *desired, model)) */
10547 /* Create pointer to appropriate size. */
10551 /* Convert object pointer to required type. */
10554 /* Convert new value to required type, and dereference it. */
10559 /* Move memory model to the 3rd position, and end param list. */
10563 /* Convert return pointer and dereference it for later assignment. */
10567 }
10570 /* This will process an __atomic_compare_exchange function call, determine
10571 whether it needs to be mapped to the _N variation, or turned into a lib call.
10572 LOC is the location of the builtin call.
10573 FUNCTION is the DECL that has been invoked;
10574 PARAMS is the argument list for the call. The return value is non-null
10575 TRUE is returned if it is translated into the proper format for a call to the
10576 external library, and NEW_RETURN is set the tree for that function.
10577 FALSE is returned if processing for the _N variation is required. */
10579 static bool
10583 {
10588 /* Size of 0 is an error condition. */
10590 {
10593 }
10595 /* If not a lock-free size, change to the library generic format. */
10597 {
10598 /* The library generic format does not have the weak parameter, so
10599 remove it from the param list. Since a parameter has been removed,
10600 we can be sure that there is room for the SIZE_T parameter, meaning
10601 there will not be a recursive rebuilding of the parameter list, so
10602 there is no danger this will be done twice. */
10604 {
10608 }
10611 }
10613 /* Otherwise, there is a match, so the call needs to be transformed from:
10614 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10615 into
10616 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10622 /* Create pointer to appropriate size. */
10626 /* Convert object pointer to required type. */
10630 /* Convert expected pointer to required type. */
10634 /* Convert desired value to required type, and dereference it. */
10639 /* The rest of the parameters are fine. NULL means no special return value
10640 processing.*/
10643 }
10646 /* This will process an __atomic_load function call, determine whether it
10647 needs to be mapped to the _N variation, or turned into a library call.
10648 LOC is the location of the builtin call.
10649 FUNCTION is the DECL that has been invoked;
10650 PARAMS is the argument list for the call. The return value is non-null
10651 TRUE is returned if it is translated into the proper format for a call to the
10652 external library, and NEW_RETURN is set the tree for that function.
10653 FALSE is returned if processing for the _N variation is required, and
10654 NEW_RETURN is set to the the return value the result is copied into. */
10656 static bool
10659 {
10664 /* Size of 0 is an error condition. */
10666 {
10669 }
10671 /* If not a lock-free size, change to the library generic format. */
10673 {
10676 }
10678 /* Otherwise, there is a match, so the call needs to be transformed from:
10679 void fn(T* mem, T* return, model)
10680 into
10681 *return = (T) (fn ((In *) mem, model)) */
10687 /* Create pointer to appropriate size. */
10691 /* Convert object pointer to required type. */
10695 /* Move memory model to the 2nd position, and end param list. */
10699 /* Convert return pointer and dereference it for later assignment. */
10703 }
10706 /* This will process an __atomic_store function call, determine whether it
10707 needs to be mapped to the _N variation, or turned into a library call.
10708 LOC is the location of the builtin call.
10709 FUNCTION is the DECL that has been invoked;
10710 PARAMS is the argument list for the call. The return value is non-null
10711 TRUE is returned if it is translated into the proper format for a call to the
10712 external library, and NEW_RETURN is set the tree for that function.
10713 FALSE is returned if processing for the _N variation is required, and
10714 NEW_RETURN is set to the the return value the result is copied into. */
10716 static bool
10719 {
10724 /* Size of 0 is an error condition. */
10726 {
10729 }
10731 /* If not a lock-free size, change to the library generic format. */
10733 {
10736 }
10738 /* Otherwise, there is a match, so the call needs to be transformed from:
10739 void fn(T* mem, T* value, model)
10740 into
10741 fn ((In *) mem, (In) *value, model) */
10746 /* Create pointer to appropriate size. */
10750 /* Convert object pointer to required type. */
10754 /* Convert new value to required type, and dereference it. */
10759 /* The memory model is in the right spot already. Return is void. */
10763 }
10766 /* Some builtin functions are placeholders for other expressions. This
10767 function should be called immediately after parsing the call expression
10768 before surrounding code has committed to the type of the expression.
10770 LOC is the location of the builtin call.
10772 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10773 PARAMS is the argument list for the call. The return value is non-null
10774 when expansion is complete, and null if normal processing should
10775 continue. */
10777 tree
10780 {
10786 {
10792 else
10796 }
10798 /* Handle BUILT_IN_NORMAL here. */
10800 {
10805 {
10806 /* Handle these 4 together so that they can fall through to the next
10807 case if the call is transformed to an _N variant. */
10809 {
10811 {
10815 /* Change to the _N variant. */
10818 }
10821 {
10823 params,
10826 /* Change to the _N variant. */
10829 }
10831 {
10835 /* Change to the _N variant. */
10838 }
10840 {
10844 /* Change to the _N variant. */
10847 }
10850 }
10851 /* Fallthrough to the normal processing. */
10852 }
10869 {
10871 /* Fallthru for parameter processing. */
10872 }
10889 {
10900 orig_format))
10905 NULL);
10913 /* If new_return is set, assign function to that expr and cast the
10914 result to void since the generic interface returned void. */
10916 {
10917 /* Cast function result from I{1,2,4,8,16} to the required type. */
10920 result);
10924 }
10926 }
10930 }
10931 }
10933 /* vector_types_compatible_elements_p is used in type checks of vectors
10934 values used as operands of binary operators. Where it returns true, and
10935 the other checks of the caller succeed (being vector types in he first
10936 place, and matching number of elements), we can just treat the types
10937 as essentially the same.
10938 Contrast with vector_targets_convertible_p, which is used for vector
10939 pointer types, and vector_types_convertible_p, which will allow
10940 language-specific matches under the control of flag_lax_vector_conversions,
10941 and might still require a conversion. */
10942 /* True if vector types T1 and T2 can be inputs to the same binary
10943 operator without conversion.
10944 We don't check the overall vector size here because some of our callers
10945 want to give different error messages when the vectors are compatible
10946 except for the element count. */
10948 bool
10950 {
10963 /* Equality works here because c_common_signed_type uses
10964 TYPE_MAIN_VARIANT. */
10972 }
10974 /* Check for missing format attributes on function pointers. LTYPE is
10975 the new type or left-hand side type. RTYPE is the old type or
10976 right-hand side type. Returns TRUE if LTYPE is missing the desired
10977 attribute. */
10979 bool
10981 {
10983 tree ra;
10989 {
10990 tree la;
10995 }
10996 else
10998 }
11000 /* Subscripting with type char is likely to lose on a machine where
11001 chars are signed. So warn on any machine, but optionally. Don't
11002 warn for unsigned char since that type is safe. Don't warn for
11003 signed char because anyone who uses that must have done so
11004 deliberately. Furthermore, we reduce the false positive load by
11005 warning only for non-constant value of type char. */
11007 void
11009 {
11013 }
11015 /* Implement -Wparentheses for the unexpected C precedence rules, to
11016 cover cases like x + y << z which readers are likely to
11017 misinterpret. We have seen an expression in which CODE is a binary
11018 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11019 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11020 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11021 expression was not formed using a binary or unary operator, or it
11022 was enclosed in parentheses. */
11024 void
11028 {
11032 /* This macro tests that the expression ARG with original tree code
11033 CODE appears to be a boolean expression. or the result of folding a
11034 boolean expression. */
11035 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11036 (truth_value_p (TREE_CODE (ARG)) \
11037 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11039 || ((CODE) != INTEGER_CST \
11040 && (integer_onep (ARG) || integer_zerop (ARG))))
11043 {
11092 /* Check cases like x|y==z */
11099 /* Check cases like !x | y */
11103 "suggest parentheses around operand of "
11116 /* Check cases like x^y==z */
11138 /* Check cases like x&y==z */
11145 /* Check cases like !x & y */
11149 "suggest parentheses around operand of "
11172 {
11177 "comparisons like %<X<=Y<=Z%> do not "
11183 "comparisons like %<X<=Y<=Z%> do not "
11185 }
11187 }
11188 #undef NOT_A_BOOLEAN_EXPR_P
11189 }
11191 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11193 void
11195 {
11197 {
11200 else
11202 }
11203 }
11205 /* Warn for division by zero according to the value of DIVISOR. LOC
11206 is the location of the division operator. */
11208 void
11210 {
11211 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11212 about division by zero. Do not issue a warning if DIVISOR has a
11213 floating-point type, since we consider 0.0/0.0 a valid way of
11214 generating a NaN. */
11218 }
11220 /* Subroutine of build_binary_op. Give warnings for comparisons
11221 between signed and unsigned quantities that may fail. Do the
11222 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11223 so that casts will be considered, but default promotions won't
11224 be.
11226 LOCATION is the location of the comparison operator.
11228 The arguments of this function map directly to local variables
11229 of build_binary_op. */
11231 void
11236 {
11241 /* In C++, check for comparison of different enum types. */
11247 {
11251 }
11253 /* Do not warn if the comparison is being done in a signed type,
11254 since the signed type will only be chosen if it can represent
11255 all the values of the unsigned type. */
11258 /* Do not warn if both operands are unsigned. */
11261 else
11262 {
11268 else
11276 /* Do not warn if the signed quantity is an unsuffixed integer
11277 literal (or some static constant expression involving such
11278 literals or a conditional expression involving such literals)
11279 and it is non-negative. */
11282 /* Do not warn if the comparison is an equality operation, the
11283 unsigned quantity is an integral constant, and it would fit
11284 in the result if the result were signed. */
11289 /* In C, do not warn if the unsigned quantity is an enumeration
11290 constant and its maximum value would fit in the result if the
11291 result were signed. */
11297 else
11299 OPT_Wsign_compare,
11301 }
11303 /* Warn if two unsigned values are being compared in a size larger
11304 than their original size, and one (and only one) is the result of
11305 a `~' operator. This comparison will always fail.
11307 Also warn if one operand is a constant, and the constant does not
11308 have all bits set that are set in the ~ operand when it is
11309 extended. */
11316 {
11323 {
11324 tree primop;
11330 {
11334 }
11335 else
11336 {
11340 }
11345 {
11348 {
11352 else
11355 }
11356 }
11357 }
11365 }
11366 }
11368 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11369 type via c_common_type. If -Wdouble-promotion is in use, and the
11370 conditions for warning have been met, issue a warning. GMSGID is
11371 the warning message. It must have two %T specifiers for the type
11372 that was converted (generally "float") and the type to which it was
11373 converted (generally "double), respectively. LOC is the location
11374 to which the awrning should refer. */
11376 void
11379 {
11380 tree source_type;
11384 /* If the conversion will not occur at run-time, there is no need to
11385 warn about it. */
11397 else
11400 }
11402 /* Setup a TYPE_DECL node as a typedef representation.
11404 X is a TYPE_DECL for a typedef statement. Create a brand new
11405 ..._TYPE node (which will be just a variant of the existing
11406 ..._TYPE node with identical properties) and then install X
11407 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11409 The whole point here is to end up with a situation where each
11410 and every ..._TYPE node the compiler creates will be uniquely
11411 associated with AT MOST one node representing a typedef name.
11412 This way, even though the compiler substitutes corresponding
11413 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11414 early on, later parts of the compiler can always do the reverse
11415 translation and get back the corresponding typedef name. For
11416 example, given:
11418 typedef struct S MY_TYPE;
11419 MY_TYPE object;
11421 Later parts of the compiler might only know that `object' was of
11422 type `struct S' if it were not for code just below. With this
11423 code however, later parts of the compiler see something like:
11425 struct S' == struct S
11426 typedef struct S' MY_TYPE;
11427 struct S' object;
11429 And they can then deduce (from the node for type struct S') that
11430 the original object declaration was:
11432 MY_TYPE object;
11434 Being able to do this is important for proper support of protoize,
11435 and also for generating precise symbolic debugging information
11436 which takes full account of the programmer's (typedef) vocabulary.
11438 Obviously, we don't want to generate a duplicate ..._TYPE node if
11439 the TYPE_DECL node that we are now processing really represents a
11440 standard built-in type. */
11442 void
11444 {
11448 {
11451 }
11454 {
11462 }
11463 }
11465 /* Record the types used by the current global variable declaration
11466 being parsed, so that we can decide later to emit their debug info.
11467 Those types are in types_used_by_cur_var_decl, and we are going to
11468 store them in the types_used_by_vars_hash hash table.
11469 DECL is the declaration of the global variable that has been parsed. */
11471 void
11473 {
11477 {
11480 }
11481 }
11483 /* If DECL is a typedef that is declared in the current function,
11484 record it for the purpose of -Wunused-local-typedefs. */
11486 void
11488 {
11493 /* if this is not a locally defined typedef then we are not
11494 interested. */
11501 }
11503 /* If T is a TYPE_DECL declared locally, mark it as used. */
11505 void
11507 {
11512 }
11514 /* Warn if there are some unused locally defined typedefs in the
11515 current function. */
11517 void
11519 {
11521 tree decl;
11522 /* The number of times we have emitted -Wunused-local-typedefs
11523 warnings. If this is different from errorcount, that means some
11524 unrelated errors have been issued. In which case, we'll avoid
11525 emitting "unused-local-typedefs" warnings. */
11537 {
11541 OPT_Wunused_local_typedefs,
11544 }
11547 }
11549 /* The C and C++ parsers both use vectors to hold function arguments.
11550 For efficiency, we keep a cache of unused vectors. This is the
11551 cache. */
11556 /* Return a new vector from the cache. If the cache is empty,
11557 allocate a new vector. These vectors are GC'ed, so it is OK if the
11558 pointer is not released.. */
11562 {
11565 else
11566 {
11567 /* Passing 0 to vec::alloc returns NULL, and our callers require
11568 that we always return a non-NULL value. The vector code uses
11569 4 when growing a NULL vector, so we do too. */
11573 }
11574 }
11576 /* Release a vector of trees back to the cache. */
11578 void
11580 {
11582 {
11585 }
11586 }
11588 /* Get a new tree vector holding a single tree. */
11592 {
11596 }
11598 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11602 {
11607 }
11609 /* Get a new tree vector which is a copy of an existing one. */
11613 {
11616 tree t;
11623 }
11625 /* Return true if KEYWORD starts a type specifier. */
11627 bool
11629 {
11631 {
11662 }
11663 }
11665 /* Return true if KEYWORD names a type qualifier. */
11667 bool
11669 {
11671 {
11679 }
11680 }
11682 /* Return true if KEYWORD names a storage class specifier.
11684 RID_TYPEDEF is not included in this list despite `typedef' being
11685 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11686 such for syntactic convenience only. */
11688 bool
11690 {
11692 {
11702 }
11703 }
11705 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11707 static bool
11709 {
11711 {
11719 }
11720 }
11722 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11723 declaration-specifier (C99 6.7). */
11725 bool
11727 {
11734 {
11741 }
11742 }
11744 /* Initialize language-specific-bits of tree_contains_struct. */
11746 void
11748 {
11752 }
11754 /* Build a user-defined numeric literal out of an integer constant type VALUE
11755 with identifier SUFFIX. */
11757 tree
11760 {
11767 }
11769 /* For vector[index], convert the vector to a
11770 pointer of the underlying type. */
11771 void
11774 {
11776 {
11778 tree type1;
11791 }
11792 }
11794 /* Determine which of the operands, if any, is a scalar that needs to be
11795 converted to a vector, for the range of operations. */
11796 enum stv_conv
11799 {
11808 {
11809 /* Most GENERIC binary expressions require homogeneous arguments.
11810 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11811 argument that is a vector and a second one that is a scalar, so
11812 we never return stv_secondarg for them. */
11817 {
11819 {
11824 }
11825 else
11827 }
11834 /* ... fall through ... */
11855 /* What about UNLT_EXPR? */
11857 {
11858 tree tmp;
11860 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11863 }
11867 {
11869 {
11874 }
11876 }
11878 /* Allow integer --> real conversion if safe. */
11882 {
11884 {
11889 }
11891 }
11894 }
11897 }
11899 /* Return true iff ALIGN is an integral constant that is a fundamental
11900 alignment, as defined by [basic.align] in the c++-11
11901 specifications.
11903 That is:
11905 [A fundamental alignment is represented by an alignment less than or
11906 equal to the greatest alignment supported by the implementation
11907 in all contexts, which is equal to
11908 alignof(max_align_t)]. */
11910 bool
11912 {
11915 }
11917 /* Return true if T is a pointer to a zero-sized aggregate. */
11919 bool
11921 {
11926 }