| blob | d617f3eb2449d37eae2dab7a92b32f2f004b35ab |
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++11 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 {
574 /* Concepts-related keywords */
578 /* These Objective-C keywords are recognized only immediately after
579 an '@'. */
596 /* These are recognized only in protocol-qualifier context
597 (see above) */
604 /* These are recognized inside a property attribute list */
613 };
618 /* Table of machine-independent attributes common to all C-like languages. */
620 {
621 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
622 affects_type_identity } */
629 /* FIXME: logically, noreturn attributes should be listed as
630 "false, true, true" and apply to function types. But implementing this
631 would require all the places in the compiler that use TREE_THIS_VOLATILE
632 on a decl to identify non-returning functions to be located and fixed
633 to check the function type instead. */
658 /* The same comments as for noreturn attributes apply to const ones. */
682 handle_no_instrument_function_attribute,
700 /* ??? These two attributes didn't make the transition from the
701 Intel language document to the multi-vendor language document. */
706 /* For internal use (marking of builtins) only. The name contains space
707 to prevent its usage in source code. */
729 /* For internal use (marking of builtins) only. The name contains space
730 to prevent its usage in source code. */
741 handle_no_address_safety_analysis_attribute,
744 handle_no_sanitize_address_attribute,
747 handle_no_sanitize_undefined_attribute,
757 /* For internal use only. The leading '*' both prevents its usage in
758 source code and signals that it may be overridden by machine tables. */
763 /* For internal use (marking of builtins and runtime functions) only.
764 The name contains space to prevent its usage in source code. */
782 };
784 /* Give the specifications for the format attributes, used by C and all
785 descendants. */
788 {
789 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
790 affects_type_identity } */
796 };
798 /* Return identifier for address space AS. */
802 {
806 }
808 /* Push current bindings for the function name VAR_DECLS. */
810 void
812 {
817 {
821 {
823 saved);
825 }
826 }
828 /* Normally they'll have been NULL, so only push if we've got a
829 stack, or they are non-NULL. */
831 saved_function_name_decls);
832 }
834 /* Finish up the current bindings, adding them into the current function's
835 statement tree. This must be done _before_ finish_stmt_tree is called.
836 If there is no current function, we must be at file scope and no statements
837 are involved. Pop the previous bindings. */
839 void
841 {
850 {
858 }
864 {
865 /* We had saved values, restore them. */
866 tree saved;
869 {
874 }
876 }
878 }
880 /* Return the text name of the current function, suitably prettified
881 by PRETTY_P. Return string must be freed by caller. */
885 {
892 {
895 }
908 {
911 }
914 }
916 /* Return the VAR_DECL for a const char array naming the current
917 function. If the VAR_DECL has not yet been created, create it
918 now. RID indicates how it should be formatted and IDENTIFIER_NODE
919 ID is its name (unfortunately C and C++ hold the RID values of
920 keywords in different places, so we can't derive RID from ID in
921 this language independent code. LOC is the location of the
922 function. */
924 tree
926 {
936 {
937 /* If a tree is built here, it would normally have the lineno of
938 the current statement. Later this tree will be moved to the
939 beginning of the function and this line number will be wrong.
940 To avoid this problem set the lineno to 0 here; that prevents
941 it from appearing in the RTL. */
942 tree stmts;
950 saved_function_name_decls
954 }
959 }
961 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
963 tree
965 {
970 /* Compute the number of elements, for the array type. */
972 {
975 }
977 {
980 }
982 {
985 }
986 else
987 {
990 }
992 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
993 limit in C++98 Annex B is very large (65536) and is not normative,
994 so we do not diagnose it (warn_overlength_strings is forced off
995 in c_common_post_options). */
997 {
1001 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1002 separate the %d from the 'C'. 'ISO' should not be
1003 translated, but it may be moved after 'C%d' in languages
1004 where modifiers follow nouns. */
1006 "string length %qd is greater than the length %qd "
1009 }
1011 /* Create the array type for the string constant. The ISO C++
1012 standard says that a string literal has type `const char[N]' or
1013 `const wchar_t[N]'. We use the same logic when invoked as a C
1014 front-end with -Wwrite-strings.
1015 ??? We should change the type of an expression depending on the
1016 state of a warning flag. We should just be warning -- see how
1017 this is handled in the C++ front-end for the deprecated implicit
1018 conversion from string literals to `char*' or `wchar_t*'.
1020 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1021 array type being the unqualified version of that type.
1022 Therefore, if we are constructing an array of const char, we must
1023 construct the matching unqualified array type first. The C front
1024 end does not require this, but it does no harm, so we do it
1025 unconditionally. */
1036 }
1037 \f
1038 /* If DISABLE is true, stop issuing warnings. This is used when
1039 parsing code that we know will not be executed. This function may
1040 be called multiple times, and works as a stack. */
1042 static void
1044 {
1046 {
1049 }
1050 }
1052 /* If ENABLE is true, reenable issuing warnings. */
1054 static void
1056 {
1058 {
1061 }
1062 }
1064 /* Fully fold EXPR, an expression that was not folded (beyond integer
1065 constant expressions and null pointer constants) when being built
1066 up. If IN_INIT, this is in a static initializer and certain
1067 changes are made to the folding done. Clear *MAYBE_CONST if
1068 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1069 expression because it contains an evaluated operator (in C99) or an
1070 operator outside of sizeof returning an integer constant (in C90)
1071 not permitted in constant expressions, or because it contains an
1072 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1073 set to true by callers before calling this function.) Return the
1074 folded expression. Function arguments have already been folded
1075 before calling this function, as have the contents of SAVE_EXPR,
1076 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1077 C_MAYBE_CONST_EXPR. */
1079 tree
1081 {
1082 tree ret;
1088 /* This function is not relevant to C++ because C++ folds while
1089 parsing, and may need changes to be correct for C++ when C++
1090 stops folding while parsing. */
1097 {
1100 }
1107 }
1109 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1110 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1111 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1112 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1113 both evaluated and unevaluated subexpressions while
1114 *MAYBE_CONST_ITSELF is carried from only evaluated
1115 subexpressions). */
1117 static tree
1120 {
1132 /* This function is not relevant to C++ because C++ folds while
1133 parsing, and may need changes to be correct for C++ when C++
1134 stops folding while parsing. */
1138 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1139 anything else not counted as an expression cannot usefully be
1140 folded further at this point. */
1146 /* Operands of variable-length expressions (function calls) have
1147 already been folded, as have __builtin_* function calls, and such
1148 expressions cannot occur in constant expressions. */
1150 {
1154 }
1157 {
1166 else
1169 }
1171 /* Assignment, increment, decrement, function call and comma
1172 operators, and statement expressions, cannot occur in constant
1173 expressions if evaluated / outside of sizeof. (Function calls
1174 were handled above, though VA_ARG_EXPR is treated like a function
1175 call here, and statement expressions are handled through
1176 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1178 {
1198 }
1200 /* Fold individual tree codes as appropriate. */
1202 {
1204 /* Any non-constancy will have been marked in a containing
1205 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1213 maybe_const_itself);
1218 {
1221 }
1230 maybe_const_itself);
1233 maybe_const_itself);
1239 {
1243 }
1285 /* Binary operations evaluating both arguments (increment and
1286 decrement are binary internally in GCC). */
1290 maybe_const_itself);
1298 /* The RHS of a MODIFY_EXPR was fully folded when building that
1299 expression for the sake of conversion warnings. */
1302 maybe_const_itself);
1306 ret = in_init
1309 else
1322 {
1333 }
1339 CASE_CONVERT:
1350 /* Unary operations. */
1353 maybe_const_itself);
1357 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1358 not prepared to deal with them if they occur in initializers. */
1366 ret = in_init
1369 else
1374 {
1378 }
1380 {
1383 CASE_CONVERT:
1384 /* Don't warn about explicit conversions. We will already
1385 have warned about suspect implicit conversions. */
1392 }
1397 /* Binary operations not necessarily evaluating both
1398 arguments. */
1405 ? truthvalue_false_node
1413 ret = in_init
1416 else
1421 && op0_const
1422 && op0_const_self
1428 && op0_const_self
1454 else
1459 && op0_const
1460 && op0_const_self
1464 && op0_const_self
1468 && op0_const
1469 && op0_const_self
1473 && op0_const_self
1479 /* Each case where an operand with excess precision may be
1480 encountered must remove the EXCESS_PRECISION_EXPR around
1481 inner operands and possibly put one around the whole
1482 expression or possibly convert to the semantic type (which
1483 c_fully_fold does); we cannot tell at this stage which is
1484 appropriate in any particular case. */
1488 /* Various codes may appear through folding built-in functions
1489 and their arguments. */
1491 }
1493 out:
1494 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1495 have been done by this point, so remove them again. */
1499 {
1503 }
1507 }
1509 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1510 return EXP. Otherwise, return either EXP or its known constant
1511 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1512 Is the BLKmode test appropriate? */
1514 tree
1516 {
1517 tree ret;
1519 /* This function is only used by C, for c_fully_fold and other
1520 optimization, and may not be correct for C++. */
1531 /* Avoid unwanted tree sharing between the initializer and current
1532 function's body where the tree can be modified e.g. by the
1533 gimplifier. */
1537 }
1539 /* Print a warning if a constant expression had overflow in folding.
1540 Invoke this function on every expression that the language
1541 requires to be a constant expression.
1542 Note the ANSI C standard says it is erroneous for a
1543 constant expression to overflow. */
1545 void
1547 {
1555 }
1557 /* The same as above but print an unconditional error. */
1558 void
1560 {
1567 }
1569 /* Print a warning if an expression had overflow in folding and its
1570 operands hadn't.
1572 Invoke this function on every expression that
1573 (1) appears in the source code, and
1574 (2) is a constant expression that overflowed, and
1575 (3) is not already checked by convert_and_check;
1576 however, do not invoke this function on operands of explicit casts
1577 or when the expression is the result of an operator and any operand
1578 already overflowed. */
1580 void
1582 {
1587 {
1616 }
1617 }
1619 /* Warn about uses of logical || / && operator in a context where it
1620 is likely that the bitwise equivalent was intended by the
1621 programmer. We have seen an expression in which CODE is a binary
1622 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1623 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1624 void
1628 {
1640 /* Warn if &&/|| are being used in a context where it is
1641 likely that the bitwise equivalent was intended by the
1642 programmer. That is, an expression such as op && MASK
1643 where op should not be any boolean expression, nor a
1644 constant, and mask seems to be a non-boolean integer constant. */
1652 {
1656 else
1661 }
1663 /* We do not warn for constants because they are typical of macro
1664 expansions that test for features. */
1668 /* This warning only makes sense with logical operands. */
1676 /* We first test whether either side separately is trivially true
1677 (with OR) or trivially false (with AND). If so, do not warn.
1678 This is a common idiom for testing ranges of data types in
1679 portable code. */
1686 /* If this is an OR operation, invert both sides; now, the result
1687 should be always false to get a warning. */
1701 /* If this is an OR operation, invert both sides; now, the result
1702 should be always false to get a warning. */
1710 /* If both expressions have the same operand, if we can merge the
1711 ranges, and if the range test is always false, then warn. */
1718 {
1721 "logical %<or%> "
1723 else
1725 "logical %<and%> "
1727 }
1728 }
1731 /* Warn if EXP contains any computations whose results are not used.
1732 Return true if a warning is printed; false otherwise. LOCUS is the
1733 (potential) location of the expression. */
1735 bool
1737 {
1738 restart:
1742 /* Don't warn about void constructs. This includes casting to void,
1743 void function calls, and statement expressions with a final cast
1744 to void. */
1752 {
1768 /* For a binding, warn if no side effect within it. */
1780 /* In && or ||, warn if 2nd operand has no side effect. */
1787 /* Let people do `(foo (), 0)' without a warning. */
1794 /* If this is an expression with side effects, don't warn; this
1795 case commonly appears in macro expansions. */
1801 /* Don't warn about automatic dereferencing of references, since
1802 the user cannot control it. */
1804 {
1807 }
1808 /* Fall through. */
1811 /* Referencing a volatile value is a side effect, so don't warn. */
1816 /* If this is an expression which has no operands, there is no value
1817 to be unused. There are no such language-independent codes,
1818 but front ends may define such. */
1822 warn:
1824 }
1825 }
1828 /* Print a warning about casts that might indicate violation
1829 of strict aliasing rules if -Wstrict-aliasing is used and
1830 strict aliasing mode is in effect. OTYPE is the original
1831 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1833 bool
1835 {
1836 /* Strip pointer conversion chains and get to the correct original type. */
1844 /* If the type we are casting to is a ref-all pointer
1845 dereferencing it is always valid. */
1852 {
1853 /* Casting the address of an object to non void pointer. Warn
1854 if the cast breaks type based aliasing. */
1856 {
1860 }
1861 else
1862 {
1863 /* warn_strict_aliasing >= 3. This includes the default (3).
1864 Only warn if the cast is dereferenced immediately. */
1865 alias_set_type set1 =
1871 {
1875 }
1878 {
1882 }
1883 }
1884 }
1885 else
1887 {
1888 /* At this level, warn for any conversions, even if an address is
1889 not taken in the same statement. This will likely produce many
1890 false positives, but could be useful to pinpoint problems that
1891 are not revealed at higher levels. */
1896 {
1900 }
1901 }
1904 }
1906 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1907 sizeof as last operand of certain builtins. */
1909 void
1913 {
1917 location_t loc;
1925 {
1929 /* FALLTHRU */
1937 /* FALLTHRU */
1996 }
2024 {
2028 {
2031 "argument to %<sizeof%> in %qD call is the same "
2032 "expression as the destination; did you mean to "
2038 "argument to %<sizeof%> in %qD call is the same "
2039 "expression as the destination; did you mean to "
2041 else
2043 "argument to %<sizeof%> in %qD call is the same "
2044 "expression as the destination; did you mean to "
2047 }
2050 && !strop
2053 {
2055 "argument to %<sizeof%> in %qD call is the same "
2056 "pointer type %qT as the destination; expected %qT "
2060 }
2061 }
2064 {
2068 {
2071 "argument to %<sizeof%> in %qD call is the same "
2072 "expression as the source; did you mean to "
2078 "argument to %<sizeof%> in %qD call is the same "
2079 "expression as the source; did you mean to "
2081 else
2083 "argument to %<sizeof%> in %qD call is the same "
2084 "expression as the source; did you mean to "
2087 }
2090 && !strop
2093 {
2095 "argument to %<sizeof%> in %qD call is the same "
2096 "pointer type %qT as the source; expected %qT "
2100 }
2101 }
2104 {
2108 {
2111 "argument to %<sizeof%> in %qD call is the same "
2112 "expression as the first source; did you mean to "
2118 "argument to %<sizeof%> in %qD call is the same "
2119 "expression as the first source; did you mean to "
2121 else
2123 "argument to %<sizeof%> in %qD call is the same "
2124 "expression as the first source; did you mean to "
2127 }
2130 && !strop
2133 {
2135 "argument to %<sizeof%> in %qD call is the same "
2136 "pointer type %qT as the first source; expected %qT "
2140 }
2141 }
2144 {
2148 {
2151 "argument to %<sizeof%> in %qD call is the same "
2152 "expression as the second source; did you mean to "
2158 "argument to %<sizeof%> in %qD call is the same "
2159 "expression as the second source; did you mean to "
2161 else
2163 "argument to %<sizeof%> in %qD call is the same "
2164 "expression as the second source; did you mean to "
2167 }
2170 && !strop
2173 {
2175 "argument to %<sizeof%> in %qD call is the same "
2176 "pointer type %qT as the second source; expected %qT "
2180 }
2181 }
2183 }
2185 /* Warn for unlikely, improbable, or stupid DECL declarations
2186 of `main'. */
2188 void
2190 {
2191 function_args_iterator iter;
2192 tree type;
2196 {
2197 /* XXX void_type_node belies the abstraction. */
2203 {
2225 "third argument of %q+D should probably be "
2228 }
2229 }
2231 /* It is intentional that this message does not mention the third
2232 argument because it's only mentioned in an appendix of the
2233 standard. */
2237 }
2239 /* vector_targets_convertible_p is used for vector pointer types. The
2240 callers perform various checks that the qualifiers are satisfactory,
2241 while OTOH vector_targets_convertible_p ignores the number of elements
2242 in the vectors. That's fine with vector pointers as we can consider,
2243 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2244 and that does not require and conversion of the pointer values.
2245 In contrast, vector_types_convertible_p and
2246 vector_types_compatible_elements_p are used for vector value types. */
2247 /* True if pointers to distinct types T1 and T2 can be converted to
2248 each other without an explicit cast. Only returns true for opaque
2249 vector types. */
2250 bool
2252 {
2259 }
2261 /* vector_types_convertible_p is used for vector value types.
2262 It could in principle call vector_targets_convertible_p as a subroutine,
2263 but then the check for vector type would be duplicated with its callers,
2264 and also the purpose of vector_targets_convertible_p would become
2265 muddled.
2266 Where vector_types_convertible_p returns true, a conversion might still be
2267 needed to make the types match.
2268 In contrast, vector_targets_convertible_p is used for vector pointer
2269 values, and vector_types_compatible_elements_p is used specifically
2270 in the context for binary operators, as a check if use is possible without
2271 conversion. */
2272 /* True if vector types T1 and T2 can be converted to each other
2273 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2274 can only be converted with -flax-vector-conversions yet that is not
2275 in effect, emit a note telling the user about that option if such
2276 a note has not previously been emitted. */
2277 bool
2279 {
2287 convertible_lax =
2302 {
2305 "conversions between vectors with differing "
2307 }
2310 }
2312 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2313 and have vector types, V0 has the same type as V1, and the number of
2314 elements of V0, V1, MASK is the same.
2316 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2317 called with two arguments. In this case implementation passes the
2318 first argument twice in order to share the same tree code. This fact
2319 could enable the mask-values being twice the vector length. This is
2320 an implementation accident and this semantics is not guaranteed to
2321 the user. */
2322 tree
2325 {
2326 tree ret;
2332 {
2335 }
2343 {
2348 }
2352 {
2356 }
2359 {
2364 }
2370 {
2373 "argument vector(s) and the mask vector should "
2376 }
2380 {
2385 }
2388 {
2389 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2395 else
2396 {
2399 }
2403 }
2413 }
2415 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2416 to integral type. */
2418 static tree
2420 {
2425 {
2426 /* C++0x scoped enumerations don't implicitly convert to integral
2427 type; if we stripped an explicit conversion to a larger type we
2428 need to replace it so common_type will still work. */
2432 }
2434 }
2436 /* This is a helper function of build_binary_op.
2438 For certain operations if both args were extended from the same
2439 smaller type, do the arithmetic in that type and then extend.
2441 BITWISE indicates a bitwise operation.
2442 For them, this optimization is safe only if
2443 both args are zero-extended or both are sign-extended.
2444 Otherwise, we might change the result.
2445 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2446 but calculated in (unsigned short) it would be (unsigned short)-1.
2447 */
2448 tree
2450 {
2454 tree type;
2456 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2457 excessive narrowing when we call get_narrower below. For
2458 example, suppose that OP0 is of unsigned int extended
2459 from signed char and that RESULT_TYPE is long long int.
2460 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2461 like
2463 (long long int) (unsigned int) signed_char
2465 which get_narrower would narrow down to
2467 (unsigned int) signed char
2469 If we do not cast OP0 first, get_narrower would return
2470 signed_char, which is inconsistent with the case of the
2471 explicit cast. */
2478 /* UNS is 1 if the operation to be done is an unsigned one. */
2481 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2482 but it *requires* conversion to FINAL_TYPE. */
2493 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2495 /* For bitwise operations, signedness of nominal type
2496 does not matter. Consider only how operands were extended. */
2500 /* Note that in all three cases below we refrain from optimizing
2501 an unsigned operation on sign-extended args.
2502 That would not be valid. */
2504 /* Both args variable: if both extended in same way
2505 from same width, do it in that width.
2506 Do it unsigned if args were zero-extended. */
2513 return c_common_signed_or_unsigned_type
2520 && (type
2531 && (type
2539 }
2541 /* Checks if expression EXPR of real/integer type cannot be converted
2542 to the real/integer type TYPE. Function returns non-zero when:
2543 * EXPR is a constant which cannot be exactly converted to TYPE.
2544 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2545 for EXPR type and TYPE being both integers or both real.
2546 * EXPR is not a constant of real type and TYPE is an integer.
2547 * EXPR is not a constant of integer type which cannot be
2548 exactly converted to real type.
2549 Function allows conversions between types of different signedness and
2550 can return SAFE_CONVERSION (zero) in that case. Function can produce
2551 signedness warnings if PRODUCE_WARNS is true. */
2553 enum conversion_safety
2555 {
2561 {
2562 /* Warn for real constant that is not an exact integer converted
2563 to integer type. */
2566 {
2569 }
2570 /* Warn for an integer constant that does not fit into integer type. */
2574 {
2577 {
2581 }
2583 {
2587 }
2588 else
2590 }
2592 {
2593 /* Warn for an integer constant that does not fit into real type. */
2595 {
2599 }
2600 /* Warn for a real constant that does not fit into a smaller
2601 real type. */
2604 {
2608 }
2609 }
2610 }
2611 else
2612 {
2613 /* Warn for real types converted to integer types. */
2620 {
2621 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2625 /* Don't warn for short y; short x = ((int)y & 0xff); */
2629 {
2630 /* If both args were extended from a shortest type,
2631 use that type if that is safe. */
2638 {
2644 /* If one of the operands is a non-negative constant
2645 that fits in the target type, then the type of the
2646 other operand does not matter. */
2655 /* If constant is unsigned and fits in the target
2656 type, then the result will also fit. */
2658 && unsigned0
2661 && unsigned1
2664 }
2665 }
2666 /* Warn for integer types converted to smaller integer types. */
2670 /* When they are the same width but different signedness,
2671 then the value may change. */
2674 /* Even when converted to a bigger type, if the type is
2675 unsigned but expr is signed, then negative values
2676 will be changed. */
2682 }
2684 /* Warn for integer types converted to real types if and only if
2685 all the range of values of the integer type cannot be
2686 represented by the real type. */
2689 {
2693 /* Don't warn about char y = 0xff; float x = (int) y; */
2705 }
2707 /* Warn for real types converted to smaller real types. */
2712 }
2715 }
2717 /* Warns if the conversion of EXPR to TYPE may alter a value.
2718 This is a helper function for warnings_for_convert_and_check. */
2720 static void
2722 {
2729 /* This may happen, because for LHS op= RHS we preevaluate
2730 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2731 means we could no longer see the code of the EXPR. */
2738 {
2751 /* Conversion from boolean to a signed:1 bit-field (which only
2752 can hold the values 0 and -1) doesn't lose information - but
2753 it does change the value. */
2773 {
2774 /* In case of COND_EXPR, we do not care about the type of
2775 COND_EXPR, only about the conversion of each operand. */
2782 }
2794 }
2795 }
2797 /* Produce warnings after a conversion. RESULT is the result of
2798 converting EXPR to TYPE. This is a helper function for
2799 convert_and_check and cp_convert_and_check. */
2801 void
2803 tree result)
2804 {
2811 {
2812 /* Do not diagnose overflow in a constant expression merely
2813 because a conversion overflowed. */
2818 {
2819 /* This detects cases like converting -129 or 256 to
2820 unsigned char. */
2824 else
2826 }
2830 /* No warning for converting 0x80000000 to int. */
2838 else
2840 }
2845 else
2847 }
2850 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2851 Invoke this function on every expression that is converted implicitly,
2852 i.e. because of language rules and not because of an explicit cast. */
2854 tree
2856 {
2857 tree result;
2858 tree expr_for_warning;
2860 /* Convert from a value with possible excess precision rather than
2861 via the semantic type, but do not warn about values not fitting
2862 exactly in the semantic type. */
2864 {
2870 }
2871 else
2885 }
2886 \f
2887 /* A node in a list that describes references to variables (EXPR), which are
2888 either read accesses if WRITER is zero, or write accesses, in which case
2889 WRITER is the parent of EXPR. */
2890 struct tlist
2891 {
2894 };
2896 /* Used to implement a cache the results of a call to verify_tree. We only
2897 use this for SAVE_EXPRs. */
2898 struct tlist_cache
2899 {
2903 tree expr;
2904 };
2906 /* Obstack to use when allocating tlist structures, and corresponding
2907 firstobj. */
2911 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2912 warnings. */
2914 /* SAVE_EXPRs need special treatment. We process them only once and then
2915 cache the results. */
2927 /* Create a new struct tlist and fill in its fields. */
2930 {
2937 }
2939 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2940 is nonnull, we ignore any node we find which has a writer equal to it. */
2942 static void
2944 {
2946 {
2953 }
2954 }
2956 /* Merge the nodes of ADD into TO. This merging process is done so that for
2957 each variable that already exists in TO, no new node is added; however if
2958 there is a write access recorded in ADD, and an occurrence on TO is only
2959 a read access, then the occurrence in TO will be modified to record the
2960 write. */
2962 static void
2964 {
2971 {
2978 {
2982 }
2984 {
2988 }
2990 }
2991 }
2993 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2994 references in list LIST conflict with it, excluding reads if ONLY writers
2995 is nonzero. */
2997 static void
3000 {
3003 /* Avoid duplicate warnings. */
3009 {
3013 {
3018 }
3020 }
3021 }
3023 /* Given a list LIST of references to variables, find whether any of these
3024 can cause conflicts due to missing sequence points. */
3026 static void
3028 {
3032 {
3035 }
3036 }
3038 /* Return nonzero if X is a tree that can be verified by the sequence point
3039 warnings. */
3040 static int
3042 {
3049 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3050 (lvalue_p) crash on TRY/CATCH. */
3057 /* No point to track non-const calls, they will never satisfy
3058 operand_equal_p. */
3066 }
3068 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3069 static bool
3071 {
3073 }
3075 /* Walk the tree X, and record accesses to variables. If X is written by the
3076 parent tree, WRITER is the parent.
3077 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3078 expression or its only operand forces a sequence point, then everything up
3079 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3080 in PNO_SP.
3081 Once we return, we will have emitted warnings if any subexpression before
3082 such a sequence point could be undefined. On a higher level, however, the
3083 sequence point may not be relevant, and we'll merge the two lists.
3085 Example: (b++, a) + b;
3086 The call that processes the COMPOUND_EXPR will store the increment of B
3087 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3088 processes the PLUS_EXPR will need to merge the two lists so that
3089 eventually, all accesses end up on the same list (and we'll warn about the
3090 unordered subexpressions b++ and b.
3092 A note on merging. If we modify the former example so that our expression
3093 becomes
3094 (b++, b) + a
3095 care must be taken not simply to add all three expressions into the final
3096 PNO_SP list. The function merge_tlist takes care of that by merging the
3097 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3098 way, so that no more than one access to B is recorded. */
3100 static void
3102 tree writer)
3103 {
3108 /* X may be NULL if it is the operand of an empty statement expression
3109 ({ }). */
3113 restart:
3121 {
3154 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3155 two first, to avoid warning for (a ? b++ : b++). */
3171 /* Expressions inside the LHS are not ordered wrt. the sequence points
3172 in the RHS. Example:
3173 *a = (a++, 2)
3174 Despite the fact that the modification of "a" is in the before_sp
3175 list (tmp_before), it conflicts with the use of "a" in the LHS.
3176 We can handle this by adding the contents of tmp_list3
3177 to those of tmp_before, and redoing the collision warnings for that
3178 list. */
3181 /* Exclude the LHS itself here; we first have to merge it into the
3182 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3183 didn't exclude the LHS, we'd get it twice, once as a read and once
3184 as a write. */
3195 /* We need to warn about conflicts among arguments and conflicts between
3196 args and the function address. Side effects of the function address,
3197 however, are not ordered by the sequence point of the call. */
3198 {
3199 call_expr_arg_iterator iter;
3200 tree arg;
3204 {
3209 }
3214 }
3217 /* Scan all the list, e.g. indices of multi dimensional array. */
3219 {
3225 }
3229 {
3236 {
3250 }
3254 }
3264 /* For other expressions, simply recurse on their operands.
3265 Manual tail recursion for unary expressions.
3266 Other non-expressions need not be processed. */
3268 {
3272 }
3274 {
3278 {
3283 }
3284 }
3286 }
3287 }
3289 /* Try to warn for undefined behavior in EXPR due to missing sequence
3290 points. */
3292 DEBUG_FUNCTION void
3294 {
3300 {
3303 }
3308 }
3309 \f
3310 /* Validate the expression after `case' and apply default promotions. */
3312 static tree
3314 {
3319 /* Promote char or short to int. */
3322 {
3325 }
3330 }
3331 \f
3332 /* See if the case values LOW and HIGH are in the range of the original
3333 type (i.e. before the default conversion to int) of the switch testing
3334 expression.
3335 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3336 the type before promoting it. CASE_LOW_P is a pointer to the lower
3337 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3338 if the case is not a case range.
3339 The caller has to make sure that we are not called with NULL for
3340 CASE_LOW_P (i.e. the default case).
3341 Returns true if the case label is in range of ORIG_TYPE (saturated or
3342 untouched) or false if the label is out of range. */
3344 static bool
3347 {
3352 /* If there was a problem with the original type, do nothing. */
3359 /* Case label is less than minimum for type. */
3362 {
3365 }
3367 /* Case value is greater than maximum for type. */
3370 {
3373 }
3375 /* Saturate lower case label value to minimum. */
3378 {
3382 }
3384 /* Saturate upper case label value to maximum. */
3387 {
3391 }
3399 }
3400 \f
3401 /* Return an integer type with BITS bits of precision,
3402 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3404 tree
3406 {
3445 }
3447 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3448 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3449 and saturating if SATP is nonzero, otherwise not saturating. */
3451 tree
3454 {
3458 else
3466 {
3468 "fixed-point types that have too many integral and "
3471 }
3474 }
3476 /* Used for communication between c_common_type_for_mode and
3477 c_register_builtin_type. */
3480 /* Return a data type that has machine mode MODE.
3481 If the mode is an integer,
3482 then UNSIGNEDP selects between signed and unsigned types.
3483 If the mode is a fixed-point mode,
3484 then UNSIGNEDP selects between saturating and nonsaturating types. */
3486 tree
3488 {
3489 tree t;
3526 #if HOST_BITS_PER_WIDE_INT >= 64
3529 #endif
3554 {
3556 tree inner_type;
3572 }
3574 {
3579 }
3589 {
3675 }
3683 }
3685 tree
3687 {
3689 }
3691 /* Return a signed type the same as TYPE in other respects. */
3693 tree
3695 {
3697 }
3699 /* Return a type the same as TYPE except unsigned or
3700 signed according to UNSIGNEDP. */
3702 tree
3704 {
3705 tree type1;
3707 /* This block of code emulates the behavior of the old
3708 c_common_unsigned_type. In particular, it returns
3709 long_unsigned_type_node if passed a long, even when a int would
3710 have the same size. This is necessary for warnings to work
3711 correctly in archs where sizeof(int) == sizeof(long) */
3714 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3730 #if HOST_BITS_PER_WIDE_INT >= 64
3733 #endif
3743 #define C_COMMON_FIXED_TYPES(NAME) \
3744 if (type1 == short_ ## NAME ## _type_node \
3745 || type1 == unsigned_short_ ## NAME ## _type_node) \
3746 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3747 : short_ ## NAME ## _type_node; \
3748 if (type1 == NAME ## _type_node \
3749 || type1 == unsigned_ ## NAME ## _type_node) \
3750 return unsignedp ? unsigned_ ## NAME ## _type_node \
3751 : NAME ## _type_node; \
3752 if (type1 == long_ ## NAME ## _type_node \
3753 || type1 == unsigned_long_ ## NAME ## _type_node) \
3754 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3755 : long_ ## NAME ## _type_node; \
3756 if (type1 == long_long_ ## NAME ## _type_node \
3757 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3758 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3759 : long_long_ ## NAME ## _type_node;
3761 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3762 if (type1 == NAME ## _type_node \
3763 || type1 == u ## NAME ## _type_node) \
3764 return unsignedp ? u ## NAME ## _type_node \
3765 : NAME ## _type_node;
3767 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3768 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3769 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3770 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3771 : sat_ ## short_ ## NAME ## _type_node; \
3772 if (type1 == sat_ ## NAME ## _type_node \
3773 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3774 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3775 : sat_ ## NAME ## _type_node; \
3776 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3777 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3778 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3779 : sat_ ## long_ ## NAME ## _type_node; \
3780 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3781 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3782 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3783 : sat_ ## long_long_ ## NAME ## _type_node;
3785 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3786 if (type1 == sat_ ## NAME ## _type_node \
3787 || type1 == sat_ ## u ## NAME ## _type_node) \
3788 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3789 : sat_ ## NAME ## _type_node;
3815 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3816 the precision; they have precision set to match their range, but
3817 may use a wider mode to match an ABI. If we change modes, we may
3818 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3819 the precision as well, so as to yield correct results for
3820 bit-field types. C++ does not have these separate bit-field
3821 types, and producing a signed or unsigned variant of an
3822 ENUMERAL_TYPE may cause other problems as well. */
3828 #define TYPE_OK(node) \
3829 (TYPE_MODE (type) == TYPE_MODE (node) \
3830 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3849 #if HOST_BITS_PER_WIDE_INT >= 64
3852 #endif
3861 #undef TYPE_OK
3864 }
3866 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3868 tree
3870 {
3871 /* Extended integer types of the same width as a standard type have
3872 lesser rank, so those of the same width as int promote to int or
3873 unsigned int and are valid for printf formats expecting int or
3874 unsigned int. To avoid such special cases, avoid creating
3875 extended integer types for bit-fields if a standard integer type
3876 is available. */
3893 }
3895 /* The C version of the register_builtin_type langhook. */
3897 void
3899 {
3900 tree decl;
3910 }
3911 \f
3912 /* Print an error message for invalid operands to arith operation
3913 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3914 LOCATION is the location of the message. */
3916 void
3919 {
3923 {
3968 }
3972 }
3973 \f
3974 /* Given an expression as a tree, return its original type. Do this
3975 by stripping any conversion that preserves the sign and precision. */
3976 static tree
3978 {
3981 }
3983 /* Subroutine of build_binary_op, used for comparison operations.
3984 See if the operands have both been converted from subword integer types
3985 and, if so, perhaps change them both back to their original type.
3986 This function is also responsible for converting the two operands
3987 to the proper common type for comparison.
3989 The arguments of this function are all pointers to local variables
3990 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3991 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3993 LOC is the location of the comparison.
3995 If this function returns nonzero, it means that the comparison has
3996 a constant value. What this function returns is an expression for
3997 that value. */
3999 tree
4002 {
4003 tree type;
4011 /* Throw away any conversions to wider types
4012 already present in the operands. */
4017 /* If primopN is first sign-extended from primopN's precision to opN's
4018 precision, then zero-extended from opN's precision to
4019 *restype_ptr precision, shortenings might be invalid. */
4022 && !unsignedp0
4027 && !unsignedp1
4031 /* Handle the case that OP0 does not *contain* a conversion
4032 but it *requires* conversion to FINAL_TYPE. */
4039 /* If one of the operands must be floated, we cannot optimize. */
4043 /* If first arg is constant, swap the args (changing operation
4044 so value is preserved), for canonicalization. Don't do this if
4045 the second arg is 0. */
4050 {
4067 {
4082 }
4084 }
4086 /* If comparing an integer against a constant more bits wide,
4087 maybe we can deduce a value of 1 or 0 independent of the data.
4088 Or else truncate the constant now
4089 rather than extend the variable at run time.
4091 This is only interesting if the constant is the wider arg.
4092 Also, it is not safe if the constant is unsigned and the
4093 variable arg is signed, since in this case the variable
4094 would be sign-extended and then regarded as unsigned.
4095 Our technique fails in this case because the lowest/highest
4096 possible unsigned results don't follow naturally from the
4097 lowest/highest possible values of the variable operand.
4098 For just EQ_EXPR and NE_EXPR there is another technique that
4099 could be used: see if the constant can be faithfully represented
4100 in the other operand's type, by truncating it and reextending it
4101 and see if that preserves the constant's value. */
4107 {
4110 /* 1 if comparison is nominally unsigned. */
4112 tree val;
4124 {
4125 /* Convert primop1 to target type, but do not introduce
4126 additional overflow. We know primop1 is an int_cst. */
4130 }
4132 {
4135 }
4138 {
4143 }
4144 else
4145 {
4150 }
4153 /* This used to be a switch, but Genix compiler can't handle that. */
4155 {
4158 }
4160 {
4163 }
4165 {
4170 }
4172 {
4177 }
4179 {
4184 }
4186 {
4191 }
4193 /* If primop0 was sign-extended and unsigned comparison specd,
4194 we did a signed comparison above using the signed type bounds.
4195 But the comparison we output must be unsigned.
4197 Also, for inequalities, VAL is no good; but if the signed
4198 comparison had *any* fixed result, it follows that the
4199 unsigned comparison just tests the sign in reverse
4200 (positive values are LE, negative ones GE).
4201 So we can generate an unsigned comparison
4202 against an extreme value of the signed type. */
4205 {
4208 {
4223 }
4225 }
4228 {
4235 }
4238 {
4239 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4243 }
4245 /* Value is not predetermined, but do the comparison
4246 in the type of the operand that is not constant.
4247 TYPE is already properly set. */
4248 }
4250 /* If either arg is decimal float and the other is float, find the
4251 proper common type to use for comparison. */
4262 /* If args' natural types are both narrower than nominal type
4263 and both extend in the same manner, compare them
4264 in the type of the wider arg.
4265 Otherwise must actually extend both to the nominal
4266 common type lest different ways of extending
4267 alter the result.
4268 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4273 {
4277 type);
4278 /* Make sure shorter operand is extended the right way
4279 to match the longer operand. */
4280 primop0
4283 primop0);
4284 primop1
4287 primop1);
4288 }
4289 else
4290 {
4291 /* Here we must do the comparison on the nominal type
4292 using the args exactly as we received them. */
4299 {
4301 /* All unsigned values are >= 0, so we warn. However,
4302 if OP0 is a constant that is >= 0, the signedness of
4303 the comparison isn't an issue, so suppress the
4304 warning. */
4309 primop0)))
4310 /* Do not warn for enumeration types. */
4314 {
4331 }
4334 {
4335 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4340 }
4341 }
4342 }
4350 }
4351 \f
4352 /* Return a tree for the sum or difference (RESULTCODE says which)
4353 of pointer PTROP and integer INTOP. */
4355 tree
4358 {
4361 /* The result is a pointer of the same type that is being added. */
4365 {
4372 }
4374 {
4381 }
4382 else
4385 /* We are manipulating pointer values, so we don't need to warn
4386 about relying on undefined signed overflow. We disable the
4387 warning here because we use integer types so fold won't know that
4388 they are really pointers. */
4391 /* If what we are about to multiply by the size of the elements
4392 contains a constant term, apply distributive law
4393 and multiply that constant term separately.
4394 This helps produce common subexpressions. */
4399 /* If the constant comes from pointer subtraction,
4400 skip this optimization--it would cause an error. */
4402 /* If the constant is unsigned, and smaller than the pointer size,
4403 then we must skip this optimization. This is because it could cause
4404 an overflow error if the constant is negative but INTOP is not. */
4408 {
4413 /* Convert both subexpression types to the type of intop,
4414 because weird cases involving pointer arithmetic
4415 can result in a sum or difference with different type args. */
4420 }
4422 /* Convert the integer argument to a type the same size as sizetype
4423 so the multiply won't overflow spuriously. */
4429 /* Replace the integer argument with a suitable product by the object size.
4430 Do this multiplication as signed, then convert to the appropriate type
4431 for the pointer operation and disregard an overflow that occurred only
4432 because of the sign-extension change in the latter conversion. */
4433 {
4441 }
4443 /* Create the sum or difference. */
4452 }
4453 \f
4454 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4455 and if NON_CONST is known not to be permitted in an evaluated part
4456 of a constant expression. */
4458 tree
4460 {
4464 /* This should never be called for C++. */
4468 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4477 }
4479 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4480 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4481 around the SAVE_EXPR if needed so that c_fully_fold does not need
4482 to look inside SAVE_EXPRs. */
4484 tree
4486 {
4495 }
4497 /* Return whether EXPR is a declaration whose address can never be
4498 NULL. */
4500 bool
4502 {
4507 }
4509 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4510 or for an `if' or `while' statement or ?..: exp. It should already
4511 have been validated to be of suitable type; otherwise, a bad
4512 diagnostic may result.
4514 The EXPR is located at LOCATION.
4516 This preparation consists of taking the ordinary
4517 representation of an expression expr and producing a valid tree
4518 boolean expression describing whether expr is nonzero. We could
4519 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4520 but we optimize comparisons, &&, ||, and !.
4522 The resulting type should always be `truthvalue_type_node'. */
4524 tree
4526 {
4528 {
4570 ? truthvalue_true_node
4576 ? truthvalue_true_node
4581 /* Fall through. */
4584 {
4587 {
4588 /* Common Ada/Pascal programmer's mistake. */
4590 OPT_Waddress,
4592 inner);
4594 }
4596 }
4613 /* These don't change whether an object is nonzero or zero. */
4618 /* These don't change whether an object is zero or nonzero, but
4619 we can't ignore them if their second arg has side-effects. */
4621 {
4624 c_common_truthvalue_conversion
4627 }
4628 else
4633 /* Distribute the conversion into the arms of a COND_EXPR. */
4635 {
4638 /* In C++ one of the arms might have void type if it is throw. */
4646 }
4647 else
4648 {
4649 /* Folding will happen later for C. */
4657 }
4659 CASE_CONVERT:
4660 {
4664 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4665 since that affects how `default_conversion' will behave. */
4669 /* Don't strip a conversion from C++0x scoped enum, since they
4670 don't implicitly convert to other types. */
4674 /* If this isn't narrowing the argument, we can ignore it. */
4678 }
4684 {
4688 }
4693 }
4696 {
4698 expr = (build_binary_op
4702 c_common_truthvalue_conversion
4705 c_common_truthvalue_conversion
4710 }
4713 {
4718 }
4719 else
4722 ret:
4725 }
4726 \f
4735 /* Apply the TYPE_QUALS to the new DECL. */
4737 void
4739 {
4747 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4748 constructor can produce constant init, so rely on cp_finish_decl to
4749 clear TREE_READONLY if the variable has non-constant init. */
4752 {
4755 }
4757 {
4759 /* Allow 'restrict' on arrays of pointers.
4760 FIXME currently we just ignore it. */
4766 }
4767 }
4769 /* Hash function for the problem of multiple type definitions in
4770 different files. This must hash all types that will compare
4771 equal via comptypes to the same value. In practice it hashes
4772 on some of the simple stuff and leaves the details to comptypes. */
4774 static hashval_t
4776 {
4780 tree t2;
4782 {
4783 /* For pointers, hash on pointee type plus some swizzling. */
4786 /* Hash on number of elements and total size. */
4805 }
4806 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4807 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4809 /* We might have a VLA here. */
4812 else
4815 }
4819 /* Return the typed-based alias set for T, which may be an expression
4820 or a type. Return -1 if we don't do anything special. */
4822 alias_set_type
4824 {
4825 tree u;
4828 /* For VLAs, use the alias set of the element type rather than the
4829 default of alias set 0 for types compared structurally. */
4831 {
4835 }
4837 /* Permit type-punning when accessing a union, provided the access
4838 is directly through the union. For example, this code does not
4839 permit taking the address of a union member and then storing
4840 through it. Even the type-punning allowed here is a GCC
4841 extension, albeit a common and useful one; the C standard says
4842 that such accesses have implementation-defined behavior. */
4850 /* That's all the expressions we handle specially. */
4854 /* The C standard guarantees that any object may be accessed via an
4855 lvalue that has character type. */
4861 /* The C standard specifically allows aliasing between signed and
4862 unsigned variants of the same type. We treat the signed
4863 variant as canonical. */
4865 {
4868 /* t1 == t can happen for boolean nodes which are always unsigned. */
4871 }
4873 /* Handle the case of multiple type nodes referring to "the same" type,
4874 which occurs with IMA. These share an alias set. FIXME: Currently only
4875 C90 is handled. (In C99 type compatibility is not transitive, which
4876 complicates things mightily. The alias set splay trees can theoretically
4877 represent this, but insertion is tricky when you consider all the
4878 different orders things might arrive in.) */
4883 /* Save time if there's only one input file. */
4887 /* Pointers need special handling if they point to any type that
4888 needs special handling (below). */
4890 {
4891 tree t2;
4892 /* Find bottom type under any nested POINTERs. */
4896 ;
4904 }
4905 /* These are the only cases that need special handling. */
4912 /* Undefined? */
4916 /* Look up t in hash table. Only one of the compatible types within each
4917 alias set is recorded in the table. */
4921 NULL);
4924 {
4927 }
4928 else
4929 /* Our caller will assign and record (in t) a new alias set; all we need
4930 to do is remember t in the hash table. */
4934 }
4935 \f
4936 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4937 the IS_SIZEOF parameter indicates which operator is being applied.
4938 The COMPLAIN flag controls whether we should diagnose possibly
4939 ill-formed constructs or not. LOC is the location of the SIZEOF or
4940 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4941 a type in any context should be returned, rather than the normal
4942 alignment for that type. */
4944 tree
4948 {
4956 {
4958 {
4965 }
4966 else
4967 {
4969 {
4973 else
4976 }
4978 }
4979 }
4981 {
4989 }
4992 {
4997 }
5000 {
5005 }
5006 else
5007 {
5009 /* Convert in case a char is more than one unit. */
5014 {
5017 #ifdef BIGGEST_FIELD_ALIGNMENT
5019 #endif
5021 #ifdef ADJUST_FIELD_ALIGN
5023 type);
5025 #endif
5028 }
5029 else
5031 }
5033 /* VALUE will have the middle-end integer type sizetype.
5034 However, we should really return a value of type `size_t',
5035 which is just a typedef for an ordinary integer type. */
5039 }
5041 /* Implement the __alignof keyword: Return the minimum required
5042 alignment of EXPR, measured in bytes. For VAR_DECLs,
5043 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5044 from an "aligned" __attribute__ specification). LOC is the
5045 location of the ALIGNOF operator. */
5047 tree
5049 {
5050 tree t;
5057 {
5060 }
5066 {
5073 {
5080 }
5082 }
5083 else
5087 }
5088 \f
5089 /* Handle C and C++ default attributes. */
5091 enum built_in_attribute
5092 {
5093 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5094 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5095 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5096 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5097 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5099 #undef DEF_ATTR_NULL_TREE
5100 #undef DEF_ATTR_INT
5101 #undef DEF_ATTR_STRING
5102 #undef DEF_ATTR_IDENT
5103 #undef DEF_ATTR_TREE_LIST
5104 ATTR_LAST
5105 };
5111 enum c_builtin_type
5112 {
5113 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5114 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5115 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5116 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5117 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5118 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5119 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5120 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5121 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5122 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5123 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5124 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5125 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5126 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5127 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5128 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5129 NAME,
5130 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5132 #undef DEF_PRIMITIVE_TYPE
5133 #undef DEF_FUNCTION_TYPE_0
5134 #undef DEF_FUNCTION_TYPE_1
5135 #undef DEF_FUNCTION_TYPE_2
5136 #undef DEF_FUNCTION_TYPE_3
5137 #undef DEF_FUNCTION_TYPE_4
5138 #undef DEF_FUNCTION_TYPE_5
5139 #undef DEF_FUNCTION_TYPE_6
5140 #undef DEF_FUNCTION_TYPE_7
5141 #undef DEF_FUNCTION_TYPE_8
5142 #undef DEF_FUNCTION_TYPE_VAR_0
5143 #undef DEF_FUNCTION_TYPE_VAR_1
5144 #undef DEF_FUNCTION_TYPE_VAR_2
5145 #undef DEF_FUNCTION_TYPE_VAR_3
5146 #undef DEF_FUNCTION_TYPE_VAR_4
5147 #undef DEF_FUNCTION_TYPE_VAR_5
5148 #undef DEF_POINTER_TYPE
5149 BT_LAST
5150 };
5154 /* A temporary array for c_common_nodes_and_builtins. Used in
5155 communication with def_fn_type. */
5158 /* A helper function for c_common_nodes_and_builtins. Build function type
5159 for DEF with return type RET and N arguments. If VAR is true, then the
5160 function should be variadic after those N arguments.
5162 Takes special care not to ICE if any of the types involved are
5163 error_mark_node, which indicates that said type is not in fact available
5164 (see builtin_type_for_size). In which case the function type as a whole
5165 should be error_mark_node. */
5167 static void
5169 {
5170 tree t;
5177 {
5183 }
5190 else
5193 egress:
5196 }
5198 /* Build builtin functions common to both C and C++ language
5199 frontends. */
5201 static void
5203 {
5204 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5205 builtin_types[ENUM] = VALUE;
5206 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5207 def_fn_type (ENUM, RETURN, 0, 0);
5208 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5209 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5210 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5211 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5212 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5213 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5214 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5215 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5216 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5217 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5218 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5219 ARG6) \
5220 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5221 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5222 ARG6, ARG7) \
5223 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5224 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5225 ARG6, ARG7, ARG8) \
5226 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5227 ARG7, ARG8);
5228 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5229 def_fn_type (ENUM, RETURN, 1, 0);
5230 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5231 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5232 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5233 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5234 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5235 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5236 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5237 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5238 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5239 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5240 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5241 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5245 #undef DEF_PRIMITIVE_TYPE
5246 #undef DEF_FUNCTION_TYPE_1
5247 #undef DEF_FUNCTION_TYPE_2
5248 #undef DEF_FUNCTION_TYPE_3
5249 #undef DEF_FUNCTION_TYPE_4
5250 #undef DEF_FUNCTION_TYPE_5
5251 #undef DEF_FUNCTION_TYPE_6
5252 #undef DEF_FUNCTION_TYPE_VAR_0
5253 #undef DEF_FUNCTION_TYPE_VAR_1
5254 #undef DEF_FUNCTION_TYPE_VAR_2
5255 #undef DEF_FUNCTION_TYPE_VAR_3
5256 #undef DEF_FUNCTION_TYPE_VAR_4
5257 #undef DEF_FUNCTION_TYPE_VAR_5
5258 #undef DEF_POINTER_TYPE
5263 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5264 NONANSI_P, ATTRS, IMPLICIT, COND) \
5265 if (NAME && COND) \
5266 def_builtin_1 (ENUM, NAME, CLASS, \
5267 builtin_types[(int) TYPE], \
5268 builtin_types[(int) LIBTYPE], \
5269 BOTH_P, FALLBACK_P, NONANSI_P, \
5270 built_in_attributes[(int) ATTRS], IMPLICIT);
5272 #undef DEF_BUILTIN
5280 }
5282 /* Like get_identifier, but avoid warnings about null arguments when
5283 the argument may be NULL for targets where GCC lacks stdint.h type
5284 information. */
5288 {
5290 }
5292 /* Build tree nodes and builtin functions common to both C and C++ language
5293 frontends. */
5295 void
5297 {
5301 tree array_domain_type;
5302 tree va_list_ref_type_node;
5303 tree va_list_arg_type_node;
5307 /* Define `int' and `char' first so that dbx will output them first. */
5311 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5312 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5313 but not C. Are the conditionals here needed? */
5319 long_unsigned_type_node);
5321 {
5323 int128_integer_type_node);
5325 int128_unsigned_type_node);
5326 }
5330 long_long_integer_type_node);
5332 long_long_unsigned_type_node);
5335 long_long_unsigned_type_node);
5338 short_unsigned_type_node);
5341 short_unsigned_type_node);
5343 /* Define both `signed char' and `unsigned char'. */
5347 /* These are types that c_common_type_for_size and
5348 c_common_type_for_mode use. */
5351 intQI_type_node));
5354 intHI_type_node));
5357 intSI_type_node));
5360 intDI_type_node));
5361 #if HOST_BITS_PER_WIDE_INT >= 64
5364 TYPE_DECL,
5366 intTI_type_node));
5367 #endif
5370 unsigned_intQI_type_node));
5373 unsigned_intHI_type_node));
5376 unsigned_intSI_type_node));
5379 unsigned_intDI_type_node));
5380 #if HOST_BITS_PER_WIDE_INT >= 64
5383 TYPE_DECL,
5385 unsigned_intTI_type_node));
5386 #endif
5388 /* Create the widest literal types. */
5389 widest_integer_literal_type_node
5393 widest_integer_literal_type_node));
5395 widest_unsigned_literal_type_node
5399 widest_unsigned_literal_type_node));
5403 pid_type_node =
5410 /* Only supported decimal floating point extension if the target
5411 actually supports underlying modes. */
5415 {
5419 }
5422 {
5427 long_long_fract_type_node);
5429 unsigned_short_fract_type_node);
5431 unsigned_fract_type_node);
5433 unsigned_long_fract_type_node);
5435 unsigned_long_long_fract_type_node);
5437 sat_short_fract_type_node);
5440 sat_long_fract_type_node);
5442 sat_long_long_fract_type_node);
5444 sat_unsigned_short_fract_type_node);
5446 sat_unsigned_fract_type_node);
5448 sat_unsigned_long_fract_type_node);
5450 sat_unsigned_long_long_fract_type_node);
5455 long_long_accum_type_node);
5457 unsigned_short_accum_type_node);
5459 unsigned_accum_type_node);
5461 unsigned_long_accum_type_node);
5463 unsigned_long_long_accum_type_node);
5465 sat_short_accum_type_node);
5468 sat_long_accum_type_node);
5470 sat_long_long_accum_type_node);
5472 sat_unsigned_short_accum_type_node);
5474 sat_unsigned_accum_type_node);
5476 sat_unsigned_long_accum_type_node);
5478 sat_unsigned_long_long_accum_type_node);
5480 }
5483 TYPE_DECL,
5485 complex_integer_type_node));
5487 TYPE_DECL,
5489 complex_float_type_node));
5491 TYPE_DECL,
5493 complex_double_type_node));
5497 complex_long_double_type_node));
5500 /* For C++, make fileptr_type_node a distinct void * type until
5501 FILE type is defined. */
5506 /* Set the TYPE_NAME for any variants that were built before
5507 record_builtin_type gave names to the built-in types. */
5508 {
5514 }
5516 /* This node must not be shared. */
5522 /* Make a type to be the domain of a few array types
5523 whose domains don't really matter.
5524 200 is small enough that it always fits in size_t
5525 and large enough that it can hold most function names for the
5526 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5529 /* Make a type for arrays of characters.
5530 With luck nothing will ever really depend on the length of this
5531 array type. */
5532 char_array_type_node
5536 const_string_type_node
5540 /* This is special for C++ so functions can be overloaded. */
5546 {
5549 else
5552 }
5554 /* This is for wide string constants. */
5555 wchar_array_type_node
5558 /* Define 'char16_t'. */
5563 {
5568 }
5570 /* This is for UTF-16 string constants. */
5571 char16_array_type_node
5574 /* Define 'char32_t'. */
5579 {
5584 }
5586 /* This is for UTF-32 string constants. */
5587 char32_array_type_node
5590 wint_type_node =
5593 intmax_type_node =
5595 uintmax_type_node =
5599 sig_atomic_type_node =
5602 int8_type_node =
5605 int16_type_node =
5608 int32_type_node =
5611 int64_type_node =
5614 uint8_type_node =
5626 int_least8_type_node =
5629 int_least16_type_node =
5632 int_least32_type_node =
5635 int_least64_type_node =
5638 uint_least8_type_node =
5641 uint_least16_type_node =
5644 uint_least32_type_node =
5647 uint_least64_type_node =
5650 int_fast8_type_node =
5653 int_fast16_type_node =
5656 int_fast32_type_node =
5659 int_fast64_type_node =
5662 uint_fast8_type_node =
5665 uint_fast16_type_node =
5668 uint_fast32_type_node =
5671 uint_fast64_type_node =
5674 intptr_type_node =
5677 uintptr_type_node =
5680 default_function_type
5682 ptrdiff_type_node
5689 va_list_type_node));
5691 {
5694 tree ptype;
5697 {
5701 ptype));
5703 }
5704 }
5707 {
5710 }
5711 else
5712 {
5715 }
5722 /* Create the built-in __null node. It is important that this is
5723 not shared. */
5727 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5729 }
5731 /* The number of named compound-literals generated thus far. */
5734 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5736 void
5738 {
5741 compound_literal_number);
5742 compound_literal_number++;
5744 }
5746 tree
5748 {
5752 }
5755 /* Linked list of disabled built-in functions. */
5758 {
5766 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5767 begins with "__builtin_", give an error. */
5769 void
5771 {
5774 else
5775 {
5780 }
5781 }
5784 /* Return true if the built-in function NAME has been disabled, false
5785 otherwise. */
5787 static bool
5789 {
5792 {
5795 }
5797 }
5800 /* Worker for DEF_BUILTIN.
5801 Possibly define a builtin function with one or two names.
5802 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5803 nonansi_p and flag_no_nonansi_builtin. */
5805 static void
5812 {
5813 tree decl;
5826 fnattrs);
5835 }
5836 \f
5837 /* Nonzero if the type T promotes to int. This is (nearly) the
5838 integral promotions defined in ISO C99 6.3.1.1/2. */
5840 bool
5842 {
5844 {
5854 /* ??? Technically all enumerations not larger than an int
5855 promote to an int. But this is used along code paths
5856 that only want to notice a size change. */
5864 }
5865 }
5867 /* Return 1 if PARMS specifies a fixed number of parameters
5868 and none of their types is affected by default promotions. */
5870 int
5872 {
5873 const_tree t;
5875 {
5892 }
5894 }
5896 /* Recursively remove any '*' or '&' operator from TYPE. */
5897 tree
5899 {
5903 }
5905 /* Recursively remove pointer or array type from TYPE. */
5906 tree
5908 {
5912 }
5914 /* Used to compare case labels. K1 and K2 are actually tree nodes
5915 representing case labels, or NULL_TREE for a `default' label.
5916 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5917 K2, and 0 if K1 and K2 are equal. */
5919 int
5921 {
5922 /* Consider a NULL key (such as arises with a `default' label) to be
5923 smaller than anything else. */
5930 }
5932 /* Process a case label, located at LOC, for the range LOW_VALUE
5933 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5934 then this case label is actually a `default' label. If only
5935 HIGH_VALUE is NULL_TREE, then case label was declared using the
5936 usual C/C++ syntax, rather than the GNU case range extension.
5937 CASES is a tree containing all the case ranges processed so far;
5938 COND is the condition for the switch-statement itself. Returns the
5939 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5940 is created. */
5942 tree
5945 {
5946 tree type;
5947 tree label;
5948 tree case_label;
5949 splay_tree_node node;
5951 /* Create the LABEL_DECL itself. */
5954 /* If there was an error processing the switch condition, bail now
5955 before we get more confused. */
5963 {
5966 }
5968 /* Case ranges are a GNU extension. */
5975 {
5980 }
5982 {
5987 }
5990 {
5991 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5992 really a case range, even though it was written that way.
5993 Remove the HIGH_VALUE to simplify later processing. */
5998 }
6000 /* See if the case is in range of the type of the original testing
6001 expression. If both low_value and high_value are out of range,
6002 don't insert the case label and return NULL_TREE. */
6008 /* Look up the LOW_VALUE in the table of case labels we already
6009 have. */
6011 /* If there was not an exact match, check for overlapping ranges.
6012 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6013 that's a `default' label and the only overlap is an exact match. */
6015 {
6016 splay_tree_node low_bound;
6017 splay_tree_node high_bound;
6019 /* Even though there wasn't an exact match, there might be an
6020 overlap between this case range and another case range.
6021 Since we've (inductively) not allowed any overlapping case
6022 ranges, we simply need to find the greatest low case label
6023 that is smaller that LOW_VALUE, and the smallest low case
6024 label that is greater than LOW_VALUE. If there is an overlap
6025 it will occur in one of these two ranges. */
6031 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6032 the LOW_VALUE, so there is no need to check unless the
6033 LOW_BOUND is in fact itself a case range. */
6039 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6040 range is bigger than the low end of the current range, so we
6041 are only interested if the current range is a real range, and
6042 not an ordinary case label. */
6044 && high_value
6046 high_value)
6049 }
6050 /* If there was an overlap, issue an error. */
6052 {
6056 {
6060 }
6062 {
6065 }
6066 else
6067 {
6071 }
6073 }
6075 /* Add a CASE_LABEL to the statement-tree. */
6077 /* Register this case label in the splay tree. */
6084 error_out:
6085 /* Add a label so that the back-end doesn't think that the beginning of
6086 the switch is unreachable. Note that we do not add a case label, as
6087 that just leads to duplicates and thence to failure later on. */
6089 {
6092 }
6094 }
6096 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6097 Used to verify that case values match up with enumerator values. */
6099 static void
6101 {
6104 /* ??? Not working too hard to print the double-word value.
6105 Should perhaps be done with %lwd in the diagnostic routines? */
6114 else
6123 buf);
6124 else
6129 }
6131 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6132 Used to verify that case values match up with enumerator values. */
6134 static int
6136 {
6140 /* Skip default case. */
6144 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6145 when we did our enum->case scan. Reset our scratch bit after. */
6148 else
6151 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6152 not set, that means that CASE_HIGH did not appear when we did our
6153 enum->case scan. Reset our scratch bit after. */
6155 {
6158 else
6160 }
6163 }
6165 /* Handle -Wswitch*. Called from the front end after parsing the
6166 switch construct. */
6167 /* ??? Should probably be somewhere generic, since other languages
6168 besides C and C++ would want this. At the moment, however, C/C++
6169 are the only tree-ssa languages that support enumerations at all,
6170 so the point is moot. */
6172 void
6175 {
6176 splay_tree_node default_node;
6177 splay_tree_node node;
6178 tree chain;
6188 /* From here on, we only care about about enumerated types. */
6192 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6196 /* Check the cases. Warn about case values which are not members of
6197 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6198 there is no default case, check that exactly all enumeration
6199 literals are covered by the cases. */
6201 /* Clearing COND if it is not an integer constant simplifies
6202 the tests inside the loop below. */
6206 /* The time complexity here is O(N*lg(N)) worst case, but for the
6207 common case of monotonically increasing enumerators, it is
6208 O(N), since the nature of the splay tree will keep the next
6209 element adjacent to the root at all times. */
6212 {
6218 {
6219 /* Mark the CASE_LOW part of the case entry as seen. */
6223 }
6225 /* Even though there wasn't an exact match, there might be a
6226 case range which includes the enumerator's value. */
6229 {
6233 {
6234 /* If we match the upper bound exactly, mark the CASE_HIGH
6235 part of the case entry as seen. */
6239 }
6240 }
6242 /* We've now determined that this enumerated literal isn't
6243 handled by the case labels of the switch statement. */
6245 /* If the switch expression is a constant, we only really care
6246 about whether that constant is handled by the switch. */
6250 /* If there is a default_node, the only relevant option is
6251 Wswitch-enum. Otherwise, if both are enabled then we prefer
6252 to warn using -Wswitch because -Wswitch is enabled by -Wall
6253 while -Wswitch-enum is explicit. */
6256 ? OPT_Wswitch_enum
6260 }
6262 /* Warn if there are case expressions that don't correspond to
6263 enumerators. This can occur since C and C++ don't enforce
6264 type-checking of assignments to enumeration variables.
6266 The time complexity here is now always O(N) worst case, since
6267 we should have marked both the lower bound and upper bound of
6268 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6269 above. This scan also resets those fields. */
6272 }
6274 /* Finish an expression taking the address of LABEL (an
6275 IDENTIFIER_NODE). Returns an expression for the address.
6277 LOC is the location for the expression returned. */
6279 tree
6281 {
6282 tree result;
6292 else
6293 {
6296 /* The current function is not necessarily uninlinable.
6297 Computed gotos are incompatible with inlining, but the value
6298 here could be used only in a diagnostic, for example. */
6300 }
6303 }
6304 \f
6306 /* Given a boolean expression ARG, return a tree representing an increment
6307 or decrement (as indicated by CODE) of ARG. The front end must check for
6308 invalid cases (e.g., decrement in C++). */
6309 tree
6311 {
6312 tree val;
6317 {
6340 }
6343 }
6344 \f
6345 /* Built-in macros for stddef.h and stdint.h, that require macros
6346 defined in this file. */
6347 void
6349 {
6412 }
6414 static void
6416 {
6417 /* Fill in the built_in_attributes array. */
6418 #define DEF_ATTR_NULL_TREE(ENUM) \
6419 built_in_attributes[(int) ENUM] = NULL_TREE;
6420 #define DEF_ATTR_INT(ENUM, VALUE) \
6421 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6422 #define DEF_ATTR_STRING(ENUM, VALUE) \
6423 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6424 #define DEF_ATTR_IDENT(ENUM, STRING) \
6425 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6426 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6427 built_in_attributes[(int) ENUM] \
6428 = tree_cons (built_in_attributes[(int) PURPOSE], \
6429 built_in_attributes[(int) VALUE], \
6430 built_in_attributes[(int) CHAIN]);
6432 #undef DEF_ATTR_NULL_TREE
6433 #undef DEF_ATTR_INT
6434 #undef DEF_ATTR_IDENT
6435 #undef DEF_ATTR_TREE_LIST
6436 }
6438 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6439 identifier as an argument, so the front end shouldn't look it up. */
6441 bool
6443 {
6446 /* Unknown attribute that we'll end up ignoring, return true so we
6447 don't complain about an identifier argument. */
6453 else
6455 }
6457 /* Attribute handlers common to C front ends. */
6459 /* Handle a "packed" attribute; arguments as in
6460 struct attribute_spec.handler. */
6462 static tree
6465 {
6467 {
6471 }
6473 {
6475 /* Still pack bitfields. */
6480 else
6482 }
6483 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6484 used for DECL_REGISTER. It wouldn't mean anything anyway.
6485 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6486 that changes what the typedef is typing. */
6487 else
6488 {
6491 }
6494 }
6496 /* Handle a "nocommon" attribute; arguments as in
6497 struct attribute_spec.handler. */
6499 static tree
6503 {
6506 else
6507 {
6510 }
6513 }
6515 /* Handle a "common" attribute; arguments as in
6516 struct attribute_spec.handler. */
6518 static tree
6521 {
6524 else
6525 {
6528 }
6531 }
6533 /* Handle a "noreturn" attribute; arguments as in
6534 struct attribute_spec.handler. */
6536 static tree
6539 {
6542 /* See FIXME comment in c_common_attribute_table. */
6549 = build_pointer_type
6552 else
6553 {
6556 }
6559 }
6561 /* Handle a "hot" and attribute; arguments as in
6562 struct attribute_spec.handler. */
6564 static tree
6567 {
6570 {
6572 {
6576 }
6577 /* Most of the rest of the hot processing is done later with
6578 lookup_attribute. */
6579 }
6580 else
6581 {
6584 }
6587 }
6589 /* Handle a "cold" and attribute; arguments as in
6590 struct attribute_spec.handler. */
6592 static tree
6595 {
6598 {
6600 {
6604 }
6605 /* Most of the rest of the cold processing is done later with
6606 lookup_attribute. */
6607 }
6608 else
6609 {
6612 }
6615 }
6617 /* Handle a "no_sanitize_address" attribute; arguments as in
6618 struct attribute_spec.handler. */
6620 static tree
6623 {
6625 {
6628 }
6631 }
6633 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6634 struct attribute_spec.handler. */
6636 static tree
6639 {
6648 }
6650 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6651 struct attribute_spec.handler. */
6653 static tree
6656 {
6658 {
6661 }
6664 }
6666 /* Handle a "noinline" attribute; arguments as in
6667 struct attribute_spec.handler. */
6669 static tree
6673 {
6676 else
6677 {
6680 }
6683 }
6685 /* Handle a "noclone" attribute; arguments as in
6686 struct attribute_spec.handler. */
6688 static tree
6692 {
6694 {
6697 }
6700 }
6702 /* Handle a "always_inline" attribute; arguments as in
6703 struct attribute_spec.handler. */
6705 static tree
6710 {
6712 {
6713 /* Set the attribute and mark it for disregarding inline
6714 limits. */
6716 }
6717 else
6718 {
6721 }
6724 }
6726 /* Handle a "gnu_inline" attribute; arguments as in
6727 struct attribute_spec.handler. */
6729 static tree
6734 {
6736 {
6737 /* Do nothing else, just set the attribute. We'll get at
6738 it later with lookup_attribute. */
6739 }
6740 else
6741 {
6744 }
6747 }
6749 /* Handle a "leaf" attribute; arguments as in
6750 struct attribute_spec.handler. */
6752 static tree
6756 {
6758 {
6761 }
6763 {
6766 }
6769 }
6771 /* Handle an "artificial" attribute; arguments as in
6772 struct attribute_spec.handler. */
6774 static tree
6779 {
6781 {
6782 /* Do nothing else, just set the attribute. We'll get at
6783 it later with lookup_attribute. */
6784 }
6785 else
6786 {
6789 }
6792 }
6794 /* Handle a "flatten" attribute; arguments as in
6795 struct attribute_spec.handler. */
6797 static tree
6799 tree args ATTRIBUTE_UNUSED,
6801 {
6803 /* Do nothing else, just set the attribute. We'll get at
6804 it later with lookup_attribute. */
6805 ;
6806 else
6807 {
6810 }
6813 }
6815 /* Handle a "warning" or "error" attribute; arguments as in
6816 struct attribute_spec.handler. */
6818 static tree
6821 {
6824 /* Do nothing else, just set the attribute. We'll get at
6825 it later with lookup_attribute. */
6826 ;
6827 else
6828 {
6831 }
6834 }
6836 /* Handle a "used" attribute; arguments as in
6837 struct attribute_spec.handler. */
6839 static tree
6842 {
6848 {
6853 }
6854 else
6855 {
6858 }
6861 }
6863 /* Handle a "unused" attribute; arguments as in
6864 struct attribute_spec.handler. */
6866 static tree
6869 {
6871 {
6879 {
6884 }
6885 else
6886 {
6889 }
6890 }
6891 else
6892 {
6896 }
6899 }
6901 /* Handle a "externally_visible" attribute; arguments as in
6902 struct attribute_spec.handler. */
6904 static tree
6909 {
6913 {
6916 {
6920 }
6921 }
6922 else
6923 {
6926 }
6929 }
6931 /* Handle a "const" attribute; arguments as in
6932 struct attribute_spec.handler. */
6934 static tree
6937 {
6940 /* See FIXME comment on noreturn in c_common_attribute_table. */
6946 = build_pointer_type
6949 else
6950 {
6953 }
6956 }
6958 /* Handle a "transparent_union" attribute; arguments as in
6959 struct attribute_spec.handler. */
6961 static tree
6965 {
6966 tree type;
6977 {
6978 /* Make sure that the first field will work for a transparent union.
6979 If the type isn't complete yet, leave the check to the code in
6980 finish_struct. */
6982 {
6988 }
6991 {
6992 /* If the type isn't complete yet, setting the flag
6993 on a variant wouldn't ever be checked. */
6997 /* build_duplicate_type doesn't work for C++. */
7001 /* A type variant isn't good enough, since we don't a cast
7002 to such a type removed as a no-op. */
7004 }
7008 }
7010 ignored:
7013 }
7015 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7016 get the requested priority for a constructor or destructor,
7017 possibly issuing diagnostics for invalid or reserved
7018 priorities. */
7020 static priority_type
7022 {
7023 HOST_WIDE_INT pri;
7024 tree arg;
7030 {
7033 else
7036 }
7053 {
7056 "destructor priorities from 0 to %d are reserved "
7058 MAX_RESERVED_INIT_PRIORITY);
7059 else
7061 "constructor priorities from 0 to %d are reserved "
7063 MAX_RESERVED_INIT_PRIORITY);
7064 }
7067 invalid:
7070 MAX_INIT_PRIORITY);
7071 else
7073 MAX_INIT_PRIORITY);
7075 }
7077 /* Handle a "constructor" attribute; arguments as in
7078 struct attribute_spec.handler. */
7080 static tree
7084 {
7091 {
7092 priority_type priority;
7097 }
7098 else
7099 {
7102 }
7105 }
7107 /* Handle a "destructor" attribute; arguments as in
7108 struct attribute_spec.handler. */
7110 static tree
7114 {
7121 {
7122 priority_type priority;
7127 }
7128 else
7129 {
7132 }
7135 }
7137 /* Nonzero if the mode is a valid vector mode for this architecture.
7138 This returns nonzero even if there is no hardware support for the
7139 vector mode, but we can emulate with narrower modes. */
7141 static int
7143 {
7147 /* Doh! What's going on? */
7156 /* Hardware support. Woo hoo! */
7162 /* We should probably return 1 if requesting V4DI and we have no DI,
7163 but we have V2DI, but this is probably very unlikely. */
7165 /* If we have support for the inner mode, we can safely emulate it.
7166 We may not have V2DI, but me can emulate with a pair of DIs. */
7168 }
7171 /* Handle a "mode" attribute; arguments as in
7172 struct attribute_spec.handler. */
7174 static tree
7177 {
7185 else
7186 {
7191 tree typefm;
7196 {
7202 }
7204 /* Change this type to have a type with the specified mode.
7205 First check for the special modes. */
7218 else
7221 {
7224 }
7227 {
7230 }
7234 {
7266 }
7268 {
7271 }
7274 {
7279 {
7282 }
7286 else
7289 }
7290 else
7291 {
7292 /* For fixed-point modes, we need to test if the signness of type
7293 and the machine mode are consistent. */
7296 {
7299 }
7300 /* For fixed-point modes, we need to pass saturating info. */
7304 }
7307 {
7310 }
7312 {
7313 /* For enumeral types, copy the precision from the integer
7314 type returned above. If not an INTEGER_TYPE, we can't use
7315 this mode for this type. */
7317 {
7320 }
7323 {
7326 }
7327 else
7328 {
7329 /* We cannot build a type variant, as there's code that assumes
7330 that TYPE_MAIN_VARIANT has the same mode. This includes the
7331 debug generators. Instead, create a subrange type. This
7332 results in all of the enumeral values being emitted only once
7333 in the original, and the subtype gets them by reference. */
7336 else
7339 }
7340 }
7344 {
7347 }
7350 }
7353 }
7355 /* Handle a "section" attribute; arguments as in
7356 struct attribute_spec.handler. */
7358 static tree
7361 {
7365 {
7371 {
7375 {
7377 "section attribute cannot be specified for "
7380 }
7382 /* The decl may have already been given a section attribute
7383 from a previous declaration. Ensure they match. */
7387 {
7391 }
7395 {
7398 }
7399 else
7401 }
7402 else
7403 {
7406 }
7407 }
7408 else
7409 {
7413 }
7416 }
7418 /* Check whether ALIGN is a valid user-specified alignment. If so,
7419 return its base-2 log; if not, output an error and return -1. If
7420 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7421 no error. */
7422 int
7424 {
7429 {
7432 }
7437 {
7440 }
7442 {
7445 }
7447 }
7449 /*
7450 If in c++-11, check if the c++-11 alignment constraint with respect
7451 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7452 c++-11 mode, does nothing.
7454 [dcl.align]2/ says:
7456 [* if the constant expression evaluates to a fundamental alignment,
7457 the alignment requirement of the declared entity shall be the
7458 specified fundamental alignment.
7460 * if the constant expression evaluates to an extended alignment
7461 and the implementation supports that alignment in the context
7462 of the declaration, the alignment of the declared entity shall
7463 be that alignment
7465 * if the constant expression evaluates to an extended alignment
7466 and the implementation does not support that alignment in the
7467 context of the declaration, the program is ill-formed]. */
7469 static bool
7473 {
7486 {
7488 {
7489 /* For file scope variables and static members, the target
7490 supports alignments that are at most
7491 MAX_OFILE_ALIGNMENT. */
7494 }
7495 else
7496 {
7497 #ifdef BIGGEST_FIELD_ALIGNMENT
7498 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7499 #else
7500 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7501 #endif
7502 /* For non-static members, the target supports either
7503 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7504 if it is defined or BIGGEST_ALIGNMENT. */
7509 #undef MAX_TARGET_FIELD_ALIGNMENT
7510 /* For stack variables, the target supports at most
7511 MAX_STACK_ALIGNMENT. */
7515 }
7516 }
7518 {
7519 /* Let's be liberal for types. */
7522 }
7530 }
7532 /* Handle a "aligned" attribute; arguments as in
7533 struct attribute_spec.handler. */
7535 static tree
7538 {
7542 tree align_expr;
7546 {
7550 }
7551 else
7555 {
7559 }
7567 {
7570 /* If we have a TYPE_DECL, then copy the type, so that we
7571 don't accidentally modify a builtin type. See pushdecl. */
7574 {
7581 }
7582 else
7587 }
7590 {
7593 }
7596 /* C++-11 [dcl.align/4]:
7598 When multiple alignment-specifiers are specified for an
7599 entity, the alignment requirement shall be set to the
7600 strictest specified alignment.
7602 This formally comes from the c++11 specification but we are
7603 doing it for the GNU attribute syntax as well. */
7607 {
7612 else
7616 }
7617 else
7618 {
7621 }
7624 }
7626 /* Handle a "weak" attribute; arguments as in
7627 struct attribute_spec.handler. */
7629 static tree
7634 {
7637 {
7640 }
7642 {
7646 }
7650 else
7654 }
7656 /* Handle an "alias" or "ifunc" attribute; arguments as in
7657 struct attribute_spec.handler, except that IS_ALIAS tells us
7658 whether this is an alias as opposed to ifunc attribute. */
7660 static tree
7663 {
7668 {
7671 }
7675 /* A static variable declaration is always a tentative definition,
7676 but the alias is a non-tentative definition which overrides. */
7679 {
7683 }
7687 {
7691 }
7693 /* Note that the very first time we process a nested declaration,
7694 decl_function_context will not be set. Indeed, *would* never
7695 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7696 we do below. After such frobbery, pushdecl would set the context.
7697 In any case, this is never what we want. */
7699 {
7700 tree id;
7704 {
7708 }
7710 /* This counts as a use of the object pointed to. */
7715 else
7719 /* ifuncs are also aliases, so set that attribute too. */
7722 }
7723 else
7724 {
7727 }
7730 }
7732 /* Handle an "alias" or "ifunc" attribute; arguments as in
7733 struct attribute_spec.handler. */
7735 static tree
7738 {
7740 }
7742 /* Handle an "alias" or "ifunc" attribute; arguments as in
7743 struct attribute_spec.handler. */
7745 static tree
7748 {
7750 }
7752 /* Handle a "weakref" attribute; arguments as in struct
7753 attribute_spec.handler. */
7755 static tree
7758 {
7761 /* We must ignore the attribute when it is associated with
7762 local-scoped decls, since attribute alias is ignored and many
7763 such symbols do not even have a DECL_WEAK field. */
7765 || current_function_decl
7767 {
7771 }
7774 {
7778 }
7780 /* The idea here is that `weakref("name")' mutates into `weakref,
7781 alias("name")', and weakref without arguments, in turn,
7782 implicitly adds weak. */
7785 {
7792 }
7793 else
7794 {
7799 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7800 and that isn't supported; and because it wants to add it to
7801 the list of weak decls, which isn't helpful. */
7803 }
7806 }
7808 /* Handle an "visibility" attribute; arguments as in
7809 struct attribute_spec.handler. */
7811 static tree
7815 {
7821 {
7825 {
7827 name);
7829 }
7831 {
7835 }
7836 }
7838 {
7841 }
7844 {
7847 }
7849 /* If this is a type, set the visibility on the type decl. */
7851 {
7856 {
7858 name);
7860 }
7861 }
7871 else
7872 {
7873 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7875 }
7879 {
7893 }
7898 /* Go ahead and attach the attribute to the node as well. This is needed
7899 so we can determine whether we have VISIBILITY_DEFAULT because the
7900 visibility was not specified, or because it was explicitly overridden
7901 from the containing scope. */
7904 }
7906 /* Determine the ELF symbol visibility for DECL, which is either a
7907 variable or a function. It is an error to use this function if a
7908 definition of DECL is not available in this translation unit.
7909 Returns true if the final visibility has been determined by this
7910 function; false if the caller is free to make additional
7911 modifications. */
7913 bool
7915 {
7919 /* If the user explicitly specified the visibility with an
7920 attribute, honor that. DECL_VISIBILITY will have been set during
7921 the processing of the attribute. We check for an explicit
7922 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7923 to distinguish the use of an attribute from the use of a "#pragma
7924 GCC visibility push(...)"; in the latter case we still want other
7925 considerations to be able to overrule the #pragma. */
7927 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7932 /* Set default visibility to whatever the user supplied with
7933 visibility_specified depending on #pragma GCC visibility. */
7935 {
7938 {
7941 /* If visibility changed and DECL already has DECL_RTL, ensure
7942 symbol flags are updated. */
7947 }
7948 }
7950 }
7952 /* Handle an "tls_model" attribute; arguments as in
7953 struct attribute_spec.handler. */
7955 static tree
7958 {
7959 tree id;
7966 {
7969 }
7974 {
7977 }
7987 else
7988 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7992 }
7994 /* Handle a "no_instrument_function" attribute; arguments as in
7995 struct attribute_spec.handler. */
7997 static tree
8002 {
8006 {
8010 }
8011 else
8015 }
8017 /* Handle a "malloc" attribute; arguments as in
8018 struct attribute_spec.handler. */
8020 static tree
8023 {
8027 else
8028 {
8031 }
8034 }
8036 /* Handle a "alloc_size" attribute; arguments as in
8037 struct attribute_spec.handler. */
8039 static tree
8042 {
8045 {
8052 || !arg_count
8054 {
8059 }
8060 }
8062 }
8064 /* Handle a "alloc_align" attribute; arguments as in
8065 struct attribute_spec.handler. */
8067 static tree
8070 {
8077 || !arg_count
8079 {
8084 }
8086 }
8088 /* Handle a "assume_aligned" attribute; arguments as in
8089 struct attribute_spec.handler. */
8091 static tree
8094 {
8096 {
8103 {
8108 }
8109 }
8111 }
8113 /* Handle a "fn spec" attribute; arguments as in
8114 struct attribute_spec.handler. */
8116 static tree
8120 {
8125 }
8127 /* Handle a "warn_unused" attribute; arguments as in
8128 struct attribute_spec.handler. */
8130 static tree
8132 tree args ATTRIBUTE_UNUSED,
8134 {
8136 /* Do nothing else, just set the attribute. We'll get at
8137 it later with lookup_attribute. */
8138 ;
8139 else
8140 {
8143 }
8146 }
8148 /* Handle an "omp declare simd" attribute; arguments as in
8149 struct attribute_spec.handler. */
8151 static tree
8153 {
8155 }
8157 /* Handle an "omp declare target" attribute; arguments as in
8158 struct attribute_spec.handler. */
8160 static tree
8162 {
8164 }
8166 /* Handle a "returns_twice" attribute; arguments as in
8167 struct attribute_spec.handler. */
8169 static tree
8172 {
8175 else
8176 {
8179 }
8182 }
8184 /* Handle a "no_limit_stack" attribute; arguments as in
8185 struct attribute_spec.handler. */
8187 static tree
8192 {
8196 {
8200 }
8202 {
8206 }
8207 else
8211 }
8213 /* Handle a "pure" attribute; arguments as in
8214 struct attribute_spec.handler. */
8216 static tree
8219 {
8222 /* ??? TODO: Support types. */
8223 else
8224 {
8227 }
8230 }
8232 /* Digest an attribute list destined for a transactional memory statement.
8233 ALLOWED is the set of attributes that are allowed for this statement;
8234 return the attribute we parsed. Multiple attributes are never allowed. */
8236 int
8238 {
8243 {
8251 {
8254 }
8257 {
8260 }
8263 else
8265 }
8268 }
8270 /* Transform a TM attribute name into a maskable integer and back.
8271 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8272 to how the lack of an attribute is treated. */
8274 int
8276 {
8290 }
8292 tree
8294 {
8297 {
8315 }
8317 }
8319 /* Return the first TM attribute seen in LIST. */
8321 tree
8323 {
8325 {
8329 }
8331 }
8333 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8334 Here we accept only function types, and verify that none of the other
8335 function TM attributes are also applied. */
8336 /* ??? We need to accept class types for C++, but not C. This greatly
8337 complicates this function, since we can no longer rely on the extra
8338 processing given by function_type_required. */
8340 static tree
8343 {
8344 /* Only one path adds the attribute; others don't. */
8348 {
8351 /* Only tm_callable and tm_safe apply to classes. */
8354 /* FALLTHRU */
8358 {
8361 ;
8364 else
8366 }
8370 {
8373 {
8378 }
8379 }
8380 /* FALLTHRU */
8383 /* If a function is next, pass it on to be tried next. */
8387 ignored:
8390 }
8393 }
8395 /* Handle the TM_WRAP attribute; arguments as in
8396 struct attribute_spec.handler. */
8398 static tree
8401 {
8404 /* We don't need the attribute even on success, since we
8405 record the entry in an external table. */
8410 else
8411 {
8417 else
8418 {
8422 {
8426 else
8428 }
8429 else
8431 }
8432 }
8435 }
8437 /* Ignore the given attribute. Used when this attribute may be usefully
8438 overridden by the target, but is not used generically. */
8440 static tree
8444 {
8447 }
8449 /* Handle a "no vops" attribute; arguments as in
8450 struct attribute_spec.handler. */
8452 static tree
8456 {
8460 }
8462 /* Handle a "deprecated" attribute; arguments as in
8463 struct attribute_spec.handler. */
8465 static tree
8469 {
8477 {
8480 }
8483 {
8494 else
8496 }
8498 {
8503 }
8504 else
8508 {
8511 {
8517 }
8520 else
8522 }
8525 }
8527 /* Handle a "vector_size" attribute; arguments as in
8528 struct attribute_spec.handler. */
8530 static tree
8534 {
8546 {
8549 }
8551 /* Get the vector size (in bytes). */
8554 /* We need to provide for vector pointers, vector arrays, and
8555 functions returning vectors. For example:
8557 __attribute__((vector_size(16))) short *foo;
8559 In this case, the mode is SI, but the type being modified is
8560 HI, so we need to look further. */
8569 /* Get the mode of the type being modified. */
8580 {
8583 }
8586 {
8589 }
8592 {
8595 }
8597 /* Calculate how many units fit in the vector. */
8600 {
8603 }
8607 /* Build back pointers if needed. */
8611 }
8613 /* Handle the "nonnull" attribute. */
8614 static tree
8618 {
8622 /* If no arguments are specified, all pointer arguments should be
8623 non-null. Verify a full prototype is given so that the arguments
8624 will have the correct types when we actually check them later. */
8626 {
8628 {
8631 }
8633 }
8635 /* Argument list specified. Verify that each argument number references
8636 a pointer argument. */
8638 {
8647 {
8652 }
8655 {
8656 function_args_iterator iter;
8657 tree argument;
8661 {
8665 }
8669 {
8674 }
8677 {
8682 }
8683 }
8684 }
8687 }
8689 /* Check the argument list of a function call for null in argument slots
8690 that are marked as requiring a non-null pointer argument. The NARGS
8691 arguments are passed in the array ARGARRAY.
8692 */
8694 static void
8696 {
8697 tree a;
8705 /* See if any of the nonnull attributes has no arguments. If so,
8706 then every pointer argument is checked (in which case the check
8707 for pointer type is done in check_nonnull_arg). */
8709 do
8717 else
8718 {
8719 /* Walk the argument list. If we encounter an argument number we
8720 should check for non-null, do it. */
8722 {
8724 {
8728 }
8733 }
8734 }
8735 }
8737 /* Check that the Nth argument of a function call (counting backwards
8738 from the end) is a (pointer)0. The NARGS arguments are passed in the
8739 array ARGARRAY. */
8741 static void
8743 {
8747 {
8750 tree sentinel;
8751 function_args_iterator iter;
8752 tree t;
8754 /* Skip over the named arguments. */
8756 {
8759 len++;
8760 }
8763 {
8766 }
8768 /* The sentinel must be one of the varargs, i.e.
8769 in position >= the number of fixed arguments. */
8771 {
8775 }
8777 /* Validate the sentinel. */
8781 /* Although __null (in C++) is only an integer we allow it
8782 nevertheless, as we are guaranteed that it's exactly
8783 as wide as a pointer, and we don't want to force
8784 users to cast the NULL they have written there.
8785 We warn with -Wstrict-null-sentinel, though. */
8788 }
8789 }
8791 /* Helper for check_function_nonnull; given a list of operands which
8792 must be non-null in ARGS, determine if operand PARAM_NUM should be
8793 checked. */
8795 static bool
8797 {
8801 {
8808 }
8810 }
8812 /* Check that the function argument PARAM (which is operand number
8813 PARAM_NUM) is non-null. This is called by check_function_nonnull
8814 via check_function_arguments_recurse. */
8816 static void
8819 {
8820 /* Just skip checking the argument if it's not a pointer. This can
8821 happen if the "nonnull" attribute was given without an operand
8822 list (which means to check every pointer argument). */
8830 }
8832 /* Helper for nonnull attribute handling; fetch the operand number
8833 from the attribute argument list. */
8835 static bool
8837 {
8838 /* Verify the arg number is a constant. */
8845 }
8847 /* Handle a "nothrow" attribute; arguments as in
8848 struct attribute_spec.handler. */
8850 static tree
8853 {
8856 /* ??? TODO: Support types. */
8857 else
8858 {
8861 }
8864 }
8866 /* Handle a "cleanup" attribute; arguments as in
8867 struct attribute_spec.handler. */
8869 static tree
8872 {
8876 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8877 for global destructors in C++. This requires infrastructure that
8878 we don't have generically at the moment. It's also not a feature
8879 we'd be missing too much, since we do have attribute constructor. */
8881 {
8885 }
8887 /* Verify that the argument is a function in scope. */
8888 /* ??? We could support pointers to functions here as well, if
8889 that was considered desirable. */
8892 {
8896 }
8899 {
8903 }
8905 /* That the function has proper type is checked with the
8906 eventual call to build_function_call. */
8909 }
8911 /* Handle a "warn_unused_result" attribute. No special handling. */
8913 static tree
8917 {
8918 /* Ignore the attribute for functions not returning any value. */
8920 {
8923 }
8926 }
8928 /* Handle a "sentinel" attribute. */
8930 static tree
8933 {
8935 {
8939 }
8940 else
8941 {
8943 {
8947 }
8948 }
8951 {
8955 {
8959 }
8960 else
8961 {
8963 {
8967 }
8968 }
8969 }
8972 }
8974 /* Handle a "type_generic" attribute. */
8976 static tree
8980 {
8981 /* Ensure we have a function type. */
8984 /* Ensure we have a variadic function. */
8988 }
8990 /* Handle a "target" attribute. */
8992 static tree
8995 {
8996 /* Ensure we have a function type. */
8998 {
9001 }
9003 flags))
9007 }
9009 /* Arguments being collected for optimization. */
9014 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9015 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9016 false for #pragma GCC optimize. */
9018 bool
9020 {
9028 tree ap;
9030 /* Build up argv vector. Just in case the string is stored away, use garbage
9031 collected strings. */
9036 {
9040 {
9044 }
9047 {
9048 /* Split string into multiple substrings. */
9056 {
9063 {
9067 }
9068 else
9069 {
9072 }
9076 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9077 options. */
9079 {
9084 else
9088 }
9091 {
9094 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9095 itself is -Os, and any other switch begins with a -f. */
9101 }
9106 }
9108 }
9109 }
9119 /* Now parse the options. */
9129 /* Don't allow changing -fstrict-aliasing. */
9134 }
9136 /* For handling "optimize" attribute. arguments as in
9137 struct attribute_spec.handler. */
9139 static tree
9142 {
9143 /* Ensure we have a function type. */
9145 {
9148 }
9149 else
9150 {
9154 /* Save current options. */
9157 /* If we previously had some optimization options, use them as the
9158 default. */
9163 /* Parse options, and update the vector. */
9168 /* Restore current options. */
9170 }
9173 }
9175 /* Handle a "no_split_stack" attribute. */
9177 static tree
9182 {
9186 {
9190 }
9192 {
9196 }
9199 }
9201 /* Handle a "returns_nonnull" attribute; arguments as in
9202 struct attribute_spec.handler. */
9204 static tree
9207 {
9208 // Even without a prototype we still have a return type we can check.
9210 {
9213 }
9215 }
9217 \f
9218 /* Check for valid arguments being passed to a function with FNTYPE.
9219 There are NARGS arguments in the array ARGARRAY. */
9220 void
9222 {
9223 /* Check for null being passed in a pointer argument that must be
9224 non-null. We also need to do this if format checking is enabled. */
9229 /* Check for errors in format strings. */
9236 }
9238 /* Generic argument checking recursion routine. PARAM is the argument to
9239 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9240 once the argument is resolved. CTX is context for the callback. */
9241 void
9246 {
9250 {
9251 /* Strip coercion. */
9255 }
9258 {
9260 tree attrs;
9263 /* See if this is a call to a known internationalization function
9264 that modifies a format arg. Such a function may have multiple
9265 format_arg attributes (for example, ngettext). */
9268 attrs;
9271 {
9272 tree inner_arg;
9273 tree format_num_expr;
9276 call_expr_arg_iterator iter;
9278 /* Extract the argument number, which was previously checked
9279 to be valid. */
9288 {
9293 }
9294 }
9296 /* If we found a format_arg attribute and did a recursive check,
9297 we are done with checking this argument. Otherwise, we continue
9298 and this will be considered a non-literal. */
9301 }
9304 {
9305 /* Check both halves of the conditional expression. */
9311 }
9314 }
9316 /* Checks for a builtin function FNDECL that the number of arguments
9317 NARGS against the required number REQUIRED and issues an error if
9318 there is a mismatch. Returns true if the number of arguments is
9319 correct, otherwise false. */
9321 static bool
9323 {
9325 {
9329 }
9331 {
9335 }
9337 }
9339 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9340 Returns false if there was an error, otherwise true. */
9342 bool
9344 {
9350 {
9360 {
9362 {
9366 }
9368 }
9378 {
9385 {
9389 }
9391 }
9396 {
9401 {
9405 }
9408 {
9410 fndecl);
9412 }
9414 }
9419 {
9421 {
9424 }
9426 }
9431 }
9432 }
9434 /* Function to help qsort sort FIELD_DECLs by name order. */
9436 int
9438 {
9443 /* A nontype is "greater" than a type. */
9452 }
9455 gt_pointer_operator new_value;
9459 /* This routine compares two fields like field_decl_cmp but using the
9460 pointer operator in resort_data. */
9462 static int
9464 {
9469 /* A nontype is "greater" than a type. */
9475 {
9482 }
9484 }
9486 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9488 void
9491 gt_pointer_operator new_value,
9493 {
9498 resort_field_decl_cmp);
9499 }
9501 /* Subroutine of c_parse_error.
9502 Return the result of concatenating LHS and RHS. RHS is really
9503 a string literal, its first character is indicated by RHS_START and
9504 RHS_SIZE is its length (including the terminating NUL character).
9506 The caller is responsible for deleting the returned pointer. */
9510 {
9516 }
9518 /* Issue the error given by GMSGID, indicating that it occurred before
9519 TOKEN, which had the associated VALUE. */
9521 void
9524 {
9525 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9535 {
9540 {
9553 }
9557 else
9563 }
9585 {
9590 }
9598 {
9603 }
9604 else
9608 {
9611 }
9612 #undef catenate_messages
9613 }
9615 /* Mapping for cpp message reasons to the options that enable them. */
9617 struct reason_option_codes_t
9618 {
9621 };
9642 };
9644 /* Return the gcc option code associated with the reason for a cpp
9645 message, or 0 if none. */
9647 static int
9649 {
9653 {
9656 }
9658 }
9660 /* Callback from cpp_error for PFILE to print diagnostics from the
9661 preprocessor. The diagnostic is of type LEVEL, with REASON set
9662 to the reason code if LEVEL is represents a warning, at location
9663 LOCATION unless this is after lexing and the compiler's location
9664 should be used instead, with column number possibly overridden by
9665 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9666 the arguments. Returns true if a diagnostic was emitted, false
9667 otherwise. */
9669 bool
9673 {
9674 diagnostic_info diagnostic;
9675 diagnostic_t dlevel;
9680 {
9685 /* Fall through. */
9710 }
9723 }
9725 /* Convert a character from the host to the target execution character
9726 set. cpplib handles this, mostly. */
9728 HOST_WIDE_INT
9730 {
9731 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9732 zero-extended under -fno-signed-char. cpplib insists that characters
9733 and character constants are always unsigned. Hence we must convert
9734 back and forth. */
9742 else
9744 }
9746 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9747 references with an INDIRECT_REF of a constant at the bottom; much like the
9748 traditional rendering of offsetof as a macro. Return the folded result. */
9750 tree
9752 {
9756 {
9772 {
9775 }
9785 {
9789 }
9802 /* Check if the offset goes beyond the upper bound of the array. */
9804 {
9810 {
9814 {
9815 tree v;
9822 {
9830 }
9831 /* Don't warn if the array might be considered a poor
9832 man's flexible array member with a very permissive
9833 definition thereof. */
9837 "index %E denotes an offset "
9840 }
9841 }
9842 }
9849 /* Handle static members of volatile structs. */
9856 }
9859 }
9861 /* Likewise, but convert it to the return type of offsetof. */
9863 tree
9865 {
9867 }
9869 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9870 expression, because B will always be true. */
9872 void
9874 {
9877 "the omitted middle operand in ?: will always be %<true%>, "
9879 }
9881 /* Give an error for storing into ARG, which is 'const'. USE indicates
9882 how ARG was being used. */
9884 void
9886 {
9889 /* Using this macro rather than (for example) arrays of messages
9890 ensures that all the format strings are checked at compile
9891 time. */
9892 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9893 : (use == lv_increment ? (I) \
9894 : (use == lv_decrement ? (D) : (AS))))
9896 {
9907 else
9913 }
9919 arg);
9925 arg);
9927 {
9937 arg);
9938 }
9944 arg);
9945 else
9950 arg);
9951 }
9953 /* Print an error message for an invalid lvalue. USE says
9954 how the lvalue is being used and so selects the error message. LOC
9955 is the location for the error. */
9957 void
9959 {
9961 {
9979 }
9980 }
9982 /* Print an error message for an invalid indirection of type TYPE.
9983 ERRSTRING is the name of the operator for the indirection. */
9985 void
9987 {
9989 {
9997 type);
10002 type);
10007 type);
10012 type);
10017 type);
10021 }
10022 }
10023 \f
10024 /* *PTYPE is an incomplete array. Complete it with a domain based on
10025 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10026 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10027 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10029 int
10031 {
10039 {
10041 {
10042 int eltsize
10045 }
10047 {
10051 {
10055 }
10056 else
10057 {
10058 tree curindex;
10069 {
10073 else
10074 {
10076 {
10077 /* Since we treat size types now as ordinary
10078 unsigned types, we need an explicit overflow
10079 check. */
10083 }
10085 size_one_node);
10086 }
10089 }
10091 {
10095 }
10096 }
10097 }
10098 else
10099 {
10100 /* Make an error message unless that happened already. */
10103 }
10104 }
10105 else
10106 {
10110 }
10117 else
10120 /* Using build_distinct_type_copy and modifying things afterward instead
10121 of using build_array_type to create a new type preserves all of the
10122 TYPE_LANG_FLAG_? bits that the front end may have set. */
10130 /* Make sure we have the canonical MAIN_TYPE. */
10133 hashcode);
10136 /* Fix the canonical type. */
10146 else
10151 else
10157 {
10159 /* If we proceed with the array type as it is, we'll eventually
10160 crash in tree_to_[su]hwi(). */
10162 }
10166 }
10168 /* Like c_mark_addressable but don't check register qualifier. */
10169 void
10171 {
10177 }
10180 \f
10181 /* Used to help initialize the builtin-types.def table. When a type of
10182 the correct size doesn't exist, use error_mark_node instead of NULL.
10183 The later results in segfaults even when a decl using the type doesn't
10184 get invoked. */
10186 tree
10188 {
10191 }
10193 /* A helper function for resolve_overloaded_builtin in resolving the
10194 overloaded __sync_ builtins. Returns a positive power of 2 if the
10195 first operand of PARAMS is a pointer to a supported data type.
10196 Returns 0 if an error is encountered. */
10198 static int
10200 {
10201 tree type;
10205 {
10208 }
10222 incompatible:
10225 }
10227 /* A helper function for resolve_overloaded_builtin. Adds casts to
10228 PARAMS to make arguments match up with those of FUNCTION. Drops
10229 the variadic arguments at the end. Returns false if some error
10230 was encountered; true on success. */
10232 static bool
10235 {
10236 function_args_iterator iter;
10237 tree ptype;
10241 /* We've declared the implementation functions to use "volatile void *"
10242 as the pointer parameter, so we shouldn't get any complaints from the
10243 call to check_function_arguments what ever type the user used. */
10248 /* For the rest of the values, we need to cast these to FTYPE, so that we
10249 don't get warnings for passing pointer types, etc. */
10252 {
10256 /* XXX void_type_node belies the abstraction. */
10262 {
10265 }
10267 /* Only convert parameters if arg_type is unsigned integer type with
10268 new format sync routines, i.e. don't attempt to convert pointer
10269 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10270 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10271 kinds). */
10273 {
10274 /* Ideally for the first conversion we'd use convert_for_assignment
10275 so that we get warnings for anything that doesn't match the pointer
10276 type. This isn't portable across the C and C++ front ends atm. */
10281 }
10284 }
10286 /* __atomic routines are not variadic. */
10288 {
10291 }
10293 /* The definition of these primitives is variadic, with the remaining
10294 being "an optional list of variables protected by the memory barrier".
10295 No clue what that's supposed to mean, precisely, but we consider all
10296 call-clobbered variables to be protected so we're safe. */
10300 }
10302 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10303 RESULT to make it match the type of the first pointer argument in
10304 PARAMS. */
10306 static tree
10308 {
10313 /* New format doesn't require casting unless the types are the same size. */
10316 else
10318 }
10320 /* This function verifies the PARAMS to generic atomic FUNCTION.
10321 It returns the size if all the parameters are the same size, otherwise
10322 0 is returned if the parameters are invalid. */
10324 static int
10327 {
10332 tree type_0;
10334 /* Determine the parameter makeup. */
10336 {
10352 }
10355 {
10358 }
10360 /* Get type of first parameter, and determine its size. */
10363 {
10365 function);
10367 }
10369 /* Types must be compile time constant sizes. */
10371 {
10374 function);
10376 }
10380 /* Zero size objects are not allowed. */
10382 {
10385 function);
10387 }
10389 /* Check each other parameter is a pointer and the same size. */
10391 {
10394 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10398 {
10400 function);
10402 }
10405 {
10407 function);
10409 }
10410 }
10412 /* Check memory model parameters for validity. */
10414 {
10417 {
10420 {
10423 function);
10424 }
10425 }
10426 else
10428 {
10430 function);
10432 }
10433 }
10436 }
10439 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10440 at the beginning of the parameter list PARAMS representing the size of the
10441 objects. This is to match the library ABI requirement. LOC is the location
10442 of the function call.
10443 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10444 returned to allow the external call to be constructed. */
10446 static tree
10449 {
10450 tree size_node;
10452 /* Insert a SIZE_T parameter as the first param. If there isn't
10453 enough space, allocate a new vector and recursively re-build with that. */
10455 {
10458 tree f;
10467 }
10469 /* Add the size parameter and leave as a function call for processing. */
10473 }
10476 /* Return whether atomic operations for naturally aligned N-byte
10477 arguments are supported, whether inline or through libatomic. */
10478 static bool
10480 {
10482 {
10494 }
10495 }
10497 /* This will process an __atomic_exchange function call, determine whether it
10498 needs to be mapped to the _N variation, or turned into a library call.
10499 LOC is the location of the builtin call.
10500 FUNCTION is the DECL that has been invoked;
10501 PARAMS is the argument list for the call. The return value is non-null
10502 TRUE is returned if it is translated into the proper format for a call to the
10503 external library, and NEW_RETURN is set the tree for that function.
10504 FALSE is returned if processing for the _N variation is required, and
10505 NEW_RETURN is set to the the return value the result is copied into. */
10506 static bool
10509 {
10514 /* Size of 0 is an error condition. */
10516 {
10519 }
10521 /* If not a lock-free size, change to the library generic format. */
10523 {
10526 }
10528 /* Otherwise there is a lockfree match, transform the call from:
10529 void fn(T* mem, T* desired, T* return, model)
10530 into
10531 *return = (T) (fn (In* mem, (In) *desired, model)) */
10538 /* Create pointer to appropriate size. */
10542 /* Convert object pointer to required type. */
10545 /* Convert new value to required type, and dereference it. */
10550 /* Move memory model to the 3rd position, and end param list. */
10554 /* Convert return pointer and dereference it for later assignment. */
10558 }
10561 /* This will process an __atomic_compare_exchange function call, determine
10562 whether it needs to be mapped to the _N variation, or turned into a lib call.
10563 LOC is the location of the builtin call.
10564 FUNCTION is the DECL that has been invoked;
10565 PARAMS is the argument list for the call. The return value is non-null
10566 TRUE is returned if it is translated into the proper format for a call to the
10567 external library, and NEW_RETURN is set the tree for that function.
10568 FALSE is returned if processing for the _N variation is required. */
10570 static bool
10574 {
10579 /* Size of 0 is an error condition. */
10581 {
10584 }
10586 /* If not a lock-free size, change to the library generic format. */
10588 {
10589 /* The library generic format does not have the weak parameter, so
10590 remove it from the param list. Since a parameter has been removed,
10591 we can be sure that there is room for the SIZE_T parameter, meaning
10592 there will not be a recursive rebuilding of the parameter list, so
10593 there is no danger this will be done twice. */
10595 {
10599 }
10602 }
10604 /* Otherwise, there is a match, so the call needs to be transformed from:
10605 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10606 into
10607 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10613 /* Create pointer to appropriate size. */
10617 /* Convert object pointer to required type. */
10621 /* Convert expected pointer to required type. */
10625 /* Convert desired value to required type, and dereference it. */
10630 /* The rest of the parameters are fine. NULL means no special return value
10631 processing.*/
10634 }
10637 /* This will process an __atomic_load function call, determine whether it
10638 needs to be mapped to the _N variation, or turned into a library call.
10639 LOC is the location of the builtin call.
10640 FUNCTION is the DECL that has been invoked;
10641 PARAMS is the argument list for the call. The return value is non-null
10642 TRUE is returned if it is translated into the proper format for a call to the
10643 external library, and NEW_RETURN is set the tree for that function.
10644 FALSE is returned if processing for the _N variation is required, and
10645 NEW_RETURN is set to the the return value the result is copied into. */
10647 static bool
10650 {
10655 /* Size of 0 is an error condition. */
10657 {
10660 }
10662 /* If not a lock-free size, change to the library generic format. */
10664 {
10667 }
10669 /* Otherwise, there is a match, so the call needs to be transformed from:
10670 void fn(T* mem, T* return, model)
10671 into
10672 *return = (T) (fn ((In *) mem, model)) */
10678 /* Create pointer to appropriate size. */
10682 /* Convert object pointer to required type. */
10686 /* Move memory model to the 2nd position, and end param list. */
10690 /* Convert return pointer and dereference it for later assignment. */
10694 }
10697 /* This will process an __atomic_store function call, determine whether it
10698 needs to be mapped to the _N variation, or turned into a library call.
10699 LOC is the location of the builtin call.
10700 FUNCTION is the DECL that has been invoked;
10701 PARAMS is the argument list for the call. The return value is non-null
10702 TRUE is returned if it is translated into the proper format for a call to the
10703 external library, and NEW_RETURN is set the tree for that function.
10704 FALSE is returned if processing for the _N variation is required, and
10705 NEW_RETURN is set to the the return value the result is copied into. */
10707 static bool
10710 {
10715 /* Size of 0 is an error condition. */
10717 {
10720 }
10722 /* If not a lock-free size, change to the library generic format. */
10724 {
10727 }
10729 /* Otherwise, there is a match, so the call needs to be transformed from:
10730 void fn(T* mem, T* value, model)
10731 into
10732 fn ((In *) mem, (In) *value, model) */
10737 /* Create pointer to appropriate size. */
10741 /* Convert object pointer to required type. */
10745 /* Convert new value to required type, and dereference it. */
10750 /* The memory model is in the right spot already. Return is void. */
10754 }
10757 /* Some builtin functions are placeholders for other expressions. This
10758 function should be called immediately after parsing the call expression
10759 before surrounding code has committed to the type of the expression.
10761 LOC is the location of the builtin call.
10763 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10764 PARAMS is the argument list for the call. The return value is non-null
10765 when expansion is complete, and null if normal processing should
10766 continue. */
10768 tree
10771 {
10777 {
10783 else
10787 }
10789 /* Handle BUILT_IN_NORMAL here. */
10791 {
10796 {
10797 /* Handle these 4 together so that they can fall through to the next
10798 case if the call is transformed to an _N variant. */
10800 {
10802 {
10806 /* Change to the _N variant. */
10809 }
10812 {
10814 params,
10817 /* Change to the _N variant. */
10820 }
10822 {
10826 /* Change to the _N variant. */
10829 }
10831 {
10835 /* Change to the _N variant. */
10838 }
10841 }
10842 /* Fallthrough to the normal processing. */
10843 }
10860 {
10862 /* Fallthru for parameter processing. */
10863 }
10880 {
10891 orig_format))
10896 NULL);
10904 /* If new_return is set, assign function to that expr and cast the
10905 result to void since the generic interface returned void. */
10907 {
10908 /* Cast function result from I{1,2,4,8,16} to the required type. */
10911 result);
10915 }
10917 }
10921 }
10922 }
10924 /* vector_types_compatible_elements_p is used in type checks of vectors
10925 values used as operands of binary operators. Where it returns true, and
10926 the other checks of the caller succeed (being vector types in he first
10927 place, and matching number of elements), we can just treat the types
10928 as essentially the same.
10929 Contrast with vector_targets_convertible_p, which is used for vector
10930 pointer types, and vector_types_convertible_p, which will allow
10931 language-specific matches under the control of flag_lax_vector_conversions,
10932 and might still require a conversion. */
10933 /* True if vector types T1 and T2 can be inputs to the same binary
10934 operator without conversion.
10935 We don't check the overall vector size here because some of our callers
10936 want to give different error messages when the vectors are compatible
10937 except for the element count. */
10939 bool
10941 {
10954 /* Equality works here because c_common_signed_type uses
10955 TYPE_MAIN_VARIANT. */
10963 }
10965 /* Check for missing format attributes on function pointers. LTYPE is
10966 the new type or left-hand side type. RTYPE is the old type or
10967 right-hand side type. Returns TRUE if LTYPE is missing the desired
10968 attribute. */
10970 bool
10972 {
10974 tree ra;
10980 {
10981 tree la;
10986 }
10987 else
10989 }
10991 /* Subscripting with type char is likely to lose on a machine where
10992 chars are signed. So warn on any machine, but optionally. Don't
10993 warn for unsigned char since that type is safe. Don't warn for
10994 signed char because anyone who uses that must have done so
10995 deliberately. Furthermore, we reduce the false positive load by
10996 warning only for non-constant value of type char. */
10998 void
11000 {
11004 }
11006 /* Implement -Wparentheses for the unexpected C precedence rules, to
11007 cover cases like x + y << z which readers are likely to
11008 misinterpret. We have seen an expression in which CODE is a binary
11009 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11010 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11011 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11012 expression was not formed using a binary or unary operator, or it
11013 was enclosed in parentheses. */
11015 void
11019 {
11023 /* This macro tests that the expression ARG with original tree code
11024 CODE appears to be a boolean expression. or the result of folding a
11025 boolean expression. */
11026 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11027 (truth_value_p (TREE_CODE (ARG)) \
11028 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11030 || ((CODE) != INTEGER_CST \
11031 && (integer_onep (ARG) || integer_zerop (ARG))))
11034 {
11083 /* Check cases like x|y==z */
11090 /* Check cases like !x | y */
11094 "suggest parentheses around operand of "
11107 /* Check cases like x^y==z */
11129 /* Check cases like x&y==z */
11136 /* Check cases like !x & y */
11140 "suggest parentheses around operand of "
11163 {
11168 "comparisons like %<X<=Y<=Z%> do not "
11174 "comparisons like %<X<=Y<=Z%> do not "
11176 }
11178 }
11179 #undef NOT_A_BOOLEAN_EXPR_P
11180 }
11182 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11184 void
11186 {
11188 {
11191 else
11193 }
11194 }
11196 /* Warn for division by zero according to the value of DIVISOR. LOC
11197 is the location of the division operator. */
11199 void
11201 {
11202 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11203 about division by zero. Do not issue a warning if DIVISOR has a
11204 floating-point type, since we consider 0.0/0.0 a valid way of
11205 generating a NaN. */
11209 }
11211 /* Subroutine of build_binary_op. Give warnings for comparisons
11212 between signed and unsigned quantities that may fail. Do the
11213 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11214 so that casts will be considered, but default promotions won't
11215 be.
11217 LOCATION is the location of the comparison operator.
11219 The arguments of this function map directly to local variables
11220 of build_binary_op. */
11222 void
11227 {
11232 /* In C++, check for comparison of different enum types. */
11238 {
11242 }
11244 /* Do not warn if the comparison is being done in a signed type,
11245 since the signed type will only be chosen if it can represent
11246 all the values of the unsigned type. */
11249 /* Do not warn if both operands are unsigned. */
11252 else
11253 {
11259 else
11267 /* Do not warn if the signed quantity is an unsuffixed integer
11268 literal (or some static constant expression involving such
11269 literals or a conditional expression involving such literals)
11270 and it is non-negative. */
11273 /* Do not warn if the comparison is an equality operation, the
11274 unsigned quantity is an integral constant, and it would fit
11275 in the result if the result were signed. */
11280 /* In C, do not warn if the unsigned quantity is an enumeration
11281 constant and its maximum value would fit in the result if the
11282 result were signed. */
11288 else
11290 OPT_Wsign_compare,
11292 }
11294 /* Warn if two unsigned values are being compared in a size larger
11295 than their original size, and one (and only one) is the result of
11296 a `~' operator. This comparison will always fail.
11298 Also warn if one operand is a constant, and the constant does not
11299 have all bits set that are set in the ~ operand when it is
11300 extended. */
11307 {
11314 {
11315 tree primop;
11321 {
11325 }
11326 else
11327 {
11331 }
11336 {
11339 {
11343 else
11346 }
11347 }
11348 }
11356 }
11357 }
11359 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11360 type via c_common_type. If -Wdouble-promotion is in use, and the
11361 conditions for warning have been met, issue a warning. GMSGID is
11362 the warning message. It must have two %T specifiers for the type
11363 that was converted (generally "float") and the type to which it was
11364 converted (generally "double), respectively. LOC is the location
11365 to which the awrning should refer. */
11367 void
11370 {
11371 tree source_type;
11375 /* If the conversion will not occur at run-time, there is no need to
11376 warn about it. */
11388 else
11391 }
11393 /* Setup a TYPE_DECL node as a typedef representation.
11395 X is a TYPE_DECL for a typedef statement. Create a brand new
11396 ..._TYPE node (which will be just a variant of the existing
11397 ..._TYPE node with identical properties) and then install X
11398 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11400 The whole point here is to end up with a situation where each
11401 and every ..._TYPE node the compiler creates will be uniquely
11402 associated with AT MOST one node representing a typedef name.
11403 This way, even though the compiler substitutes corresponding
11404 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11405 early on, later parts of the compiler can always do the reverse
11406 translation and get back the corresponding typedef name. For
11407 example, given:
11409 typedef struct S MY_TYPE;
11410 MY_TYPE object;
11412 Later parts of the compiler might only know that `object' was of
11413 type `struct S' if it were not for code just below. With this
11414 code however, later parts of the compiler see something like:
11416 struct S' == struct S
11417 typedef struct S' MY_TYPE;
11418 struct S' object;
11420 And they can then deduce (from the node for type struct S') that
11421 the original object declaration was:
11423 MY_TYPE object;
11425 Being able to do this is important for proper support of protoize,
11426 and also for generating precise symbolic debugging information
11427 which takes full account of the programmer's (typedef) vocabulary.
11429 Obviously, we don't want to generate a duplicate ..._TYPE node if
11430 the TYPE_DECL node that we are now processing really represents a
11431 standard built-in type. */
11433 void
11435 {
11439 {
11442 }
11445 {
11453 }
11454 }
11456 /* Record the types used by the current global variable declaration
11457 being parsed, so that we can decide later to emit their debug info.
11458 Those types are in types_used_by_cur_var_decl, and we are going to
11459 store them in the types_used_by_vars_hash hash table.
11460 DECL is the declaration of the global variable that has been parsed. */
11462 void
11464 {
11468 {
11471 }
11472 }
11474 /* If DECL is a typedef that is declared in the current function,
11475 record it for the purpose of -Wunused-local-typedefs. */
11477 void
11479 {
11484 /* if this is not a locally defined typedef then we are not
11485 interested. */
11492 }
11494 /* If T is a TYPE_DECL declared locally, mark it as used. */
11496 void
11498 {
11503 }
11505 /* Warn if there are some unused locally defined typedefs in the
11506 current function. */
11508 void
11510 {
11512 tree decl;
11513 /* The number of times we have emitted -Wunused-local-typedefs
11514 warnings. If this is different from errorcount, that means some
11515 unrelated errors have been issued. In which case, we'll avoid
11516 emitting "unused-local-typedefs" warnings. */
11528 {
11532 OPT_Wunused_local_typedefs,
11535 }
11538 }
11540 /* The C and C++ parsers both use vectors to hold function arguments.
11541 For efficiency, we keep a cache of unused vectors. This is the
11542 cache. */
11547 /* Return a new vector from the cache. If the cache is empty,
11548 allocate a new vector. These vectors are GC'ed, so it is OK if the
11549 pointer is not released.. */
11553 {
11556 else
11557 {
11558 /* Passing 0 to vec::alloc returns NULL, and our callers require
11559 that we always return a non-NULL value. The vector code uses
11560 4 when growing a NULL vector, so we do too. */
11564 }
11565 }
11567 /* Release a vector of trees back to the cache. */
11569 void
11571 {
11573 {
11576 }
11577 }
11579 /* Get a new tree vector holding a single tree. */
11583 {
11587 }
11589 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11593 {
11598 }
11600 /* Get a new tree vector which is a copy of an existing one. */
11604 {
11607 tree t;
11614 }
11616 /* Return true if KEYWORD starts a type specifier. */
11618 bool
11620 {
11622 {
11653 }
11654 }
11656 /* Return true if KEYWORD names a type qualifier. */
11658 bool
11660 {
11662 {
11670 }
11671 }
11673 /* Return true if KEYWORD names a storage class specifier.
11675 RID_TYPEDEF is not included in this list despite `typedef' being
11676 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11677 such for syntactic convenience only. */
11679 bool
11681 {
11683 {
11693 }
11694 }
11696 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11698 static bool
11700 {
11702 {
11710 }
11711 }
11713 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11714 declaration-specifier (C99 6.7). */
11716 bool
11718 {
11725 {
11732 }
11733 }
11735 /* Initialize language-specific-bits of tree_contains_struct. */
11737 void
11739 {
11743 }
11745 /* Build a user-defined numeric literal out of an integer constant type VALUE
11746 with identifier SUFFIX. */
11748 tree
11751 {
11758 }
11760 /* For vector[index], convert the vector to a
11761 pointer of the underlying type. */
11762 void
11765 {
11767 {
11769 tree type1;
11782 }
11783 }
11785 /* Determine which of the operands, if any, is a scalar that needs to be
11786 converted to a vector, for the range of operations. */
11787 enum stv_conv
11790 {
11799 {
11800 /* Most GENERIC binary expressions require homogeneous arguments.
11801 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11802 argument that is a vector and a second one that is a scalar, so
11803 we never return stv_secondarg for them. */
11808 {
11810 {
11815 }
11816 else
11818 }
11825 /* ... fall through ... */
11846 /* What about UNLT_EXPR? */
11848 {
11849 tree tmp;
11851 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11854 }
11858 {
11860 {
11865 }
11867 }
11869 /* Allow integer --> real conversion if safe. */
11873 {
11875 {
11880 }
11882 }
11885 }
11888 }
11890 /* Return true iff ALIGN is an integral constant that is a fundamental
11891 alignment, as defined by [basic.align] in the c++-11
11892 specifications.
11894 That is:
11896 [A fundamental alignment is represented by an alignment less than or
11897 equal to the greatest alignment supported by the implementation
11898 in all contexts, which is equal to
11899 alignof(max_align_t)]. */
11901 bool
11903 {
11906 }
11908 /* Return true if T is a pointer to a zero-sized aggregate. */
11910 bool
11912 {
11917 }