| blob | 9f3293318e031c6dd8bdea63c83d16e2e5ded7f2 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
50 /* The following symbols are subsumed in the c_global_trees array, and
51 listed here individually for documentation purposes.
53 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
55 tree short_integer_type_node;
56 tree long_integer_type_node;
57 tree long_long_integer_type_node;
58 tree int128_integer_type_node;
60 tree short_unsigned_type_node;
61 tree long_unsigned_type_node;
62 tree long_long_unsigned_type_node;
63 tree int128_unsigned_type_node;
65 tree truthvalue_type_node;
66 tree truthvalue_false_node;
67 tree truthvalue_true_node;
69 tree ptrdiff_type_node;
71 tree unsigned_char_type_node;
72 tree signed_char_type_node;
73 tree wchar_type_node;
75 tree char16_type_node;
76 tree char32_type_node;
78 tree float_type_node;
79 tree double_type_node;
80 tree long_double_type_node;
82 tree complex_integer_type_node;
83 tree complex_float_type_node;
84 tree complex_double_type_node;
85 tree complex_long_double_type_node;
87 tree dfloat32_type_node;
88 tree dfloat64_type_node;
89 tree_dfloat128_type_node;
91 tree intQI_type_node;
92 tree intHI_type_node;
93 tree intSI_type_node;
94 tree intDI_type_node;
95 tree intTI_type_node;
97 tree unsigned_intQI_type_node;
98 tree unsigned_intHI_type_node;
99 tree unsigned_intSI_type_node;
100 tree unsigned_intDI_type_node;
101 tree unsigned_intTI_type_node;
103 tree widest_integer_literal_type_node;
104 tree widest_unsigned_literal_type_node;
106 Nodes for types `void *' and `const void *'.
108 tree ptr_type_node, const_ptr_type_node;
110 Nodes for types `char *' and `const char *'.
112 tree string_type_node, const_string_type_node;
114 Type `char[SOMENUMBER]'.
115 Used when an array of char is needed and the size is irrelevant.
117 tree char_array_type_node;
119 Type `int[SOMENUMBER]' or something like it.
120 Used when an array of int needed and the size is irrelevant.
122 tree int_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 /* Nonzero whenever UPC -fupc-threads-N is asserted.
196 The value N gives the number of UPC threads to be
197 defined at compile-time. */
200 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
203 /* The implementation model for UPC threads that
204 are mapped to POSIX threads, specified at compilation
205 time by the -fupc-pthreads-model-* switch. */
206 upc_pthreads_model_kind upc_pthreads_model;
208 /* C/ObjC language option variables. */
211 /* Nonzero means allow type mismatches in conditional expressions;
212 just make their values `void'. */
216 /* Nonzero means enable C89 Amendment 1 features. */
220 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
224 /* Nonzero means use the ISO C11 dialect of C. */
228 /* Nonzero means that we have builtin functions, and main is an int. */
233 /* ObjC language option variables. */
236 /* Tells the compiler that this is a special run. Do not perform any
237 compiling, instead we are to test some platform dependent features
238 and output a C header file with appropriate definitions. */
242 /* Tells the compiler what is the constant string class for ObjC. */
247 /* C++ language option variables. */
250 /* Nonzero means generate separate instantiation control files and
251 juggle them at link time. */
255 /* The C++ dialect being used. C++98 is the default. */
259 /* Maximum template instantiation depth. This limit exists to limit the
260 time it takes to notice excessively recursive template instantiations.
262 The default is lower than the 1024 recommended by the C++0x standard
263 because G++ runs out of stack before 1024 with highly recursive template
264 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
268 /* The elements of `ridpointers' are identifier nodes for the reserved
269 type names and storage classes. It is indexed by a RID_... value. */
274 /* Nonzero means don't warn about problems that occur when the code is
275 executed. */
278 /* Whether we are building a boolean conversion inside
279 convert_for_assignment, or some other late binary operation. If
280 build_binary_op is called for C (from code shared by C and C++) in
281 this case, then the operands have already been folded and the
282 result will not be folded again, so C_MAYBE_CONST_EXPR should not
283 be generated. */
286 /* Whether lexing has been completed, so subsequent preprocessor
287 errors should use the compiler's input_location. */
290 /* Information about how a function name is generated. */
291 struct fname_var_t
292 {
296 };
298 /* The three ways of getting then name of the current function. */
301 {
302 /* C99 compliant __func__, must be first. */
304 /* GCC __FUNCTION__ compliant. */
306 /* GCC __PRETTY_FUNCTION__ compliant. */
309 };
311 /* Global visibility options. */
390 /* Reserved words. The third field is a mask: keywords are disabled
391 if they match the mask.
393 Masks for languages:
394 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
395 C --std=c99: D_CXXONLY | D_OBJC
396 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
397 UPC is like C except that D_UPC is not set
398 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
399 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
400 ObjC++ is like C++ except that D_OBJC is not set
402 If -fno-asm is used, D_ASM is added to the mask. If
403 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
404 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
405 In C with -Wc++-compat, we warn if D_CXXWARN is set.
407 Note the complication of the D_CXX_OBJC keywords. These are
408 reserved words such as 'class'. In C++, 'class' is a reserved
409 word. In Objective-C++ it is too. In Objective-C, it is a
410 reserved word too, but only if it follows an '@' sign.
411 */
413 {
568 /* These Objective-C keywords are recognized only immediately after
569 an '@'. */
586 /* These are recognized only in protocol-qualifier context
587 (see above) */
595 /* UPC keywords */
607 /* These are recognized inside a property attribute list */
616 };
621 /* Table of machine-independent attributes common to all C-like languages. */
623 {
624 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
625 affects_type_identity } */
632 /* FIXME: logically, noreturn attributes should be listed as
633 "false, true, true" and apply to function types. But implementing this
634 would require all the places in the compiler that use TREE_THIS_VOLATILE
635 on a decl to identify non-returning functions to be located and fixed
636 to check the function type instead. */
661 /* The same comments as for noreturn attributes apply to const ones. */
685 handle_no_instrument_function_attribute,
703 /* ??? These two attributes didn't make the transition from the
704 Intel language document to the multi-vendor language document. */
709 /* For internal use (marking of builtins) only. The name contains space
710 to prevent its usage in source code. */
732 /* For internal use (marking of builtins) only. The name contains space
733 to prevent its usage in source code. */
744 handle_no_address_safety_analysis_attribute,
754 /* For internal use only. The leading '*' both prevents its usage in
755 source code and signals that it may be overridden by machine tables. */
760 /* For internal use (marking of builtins and runtime functions) only.
761 The name contains space to prevent its usage in source code. */
765 };
767 /* Give the specifications for the format attributes, used by C and all
768 descendants. */
771 {
772 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
773 affects_type_identity } */
779 };
781 /* Return identifier for address space AS. */
785 {
789 }
791 /* Push current bindings for the function name VAR_DECLS. */
793 void
795 {
800 {
804 {
806 saved);
808 }
809 }
811 /* Normally they'll have been NULL, so only push if we've got a
812 stack, or they are non-NULL. */
814 saved_function_name_decls);
815 }
817 /* Finish up the current bindings, adding them into the current function's
818 statement tree. This must be done _before_ finish_stmt_tree is called.
819 If there is no current function, we must be at file scope and no statements
820 are involved. Pop the previous bindings. */
822 void
824 {
833 {
841 }
847 {
848 /* We had saved values, restore them. */
849 tree saved;
852 {
857 }
859 }
861 }
863 /* Return the text name of the current function, suitably prettified
864 by PRETTY_P. Return string must be freed by caller. */
868 {
875 {
878 }
891 {
894 }
897 }
899 /* Return the VAR_DECL for a const char array naming the current
900 function. If the VAR_DECL has not yet been created, create it
901 now. RID indicates how it should be formatted and IDENTIFIER_NODE
902 ID is its name (unfortunately C and C++ hold the RID values of
903 keywords in different places, so we can't derive RID from ID in
904 this language independent code. LOC is the location of the
905 function. */
907 tree
909 {
919 {
920 /* If a tree is built here, it would normally have the lineno of
921 the current statement. Later this tree will be moved to the
922 beginning of the function and this line number will be wrong.
923 To avoid this problem set the lineno to 0 here; that prevents
924 it from appearing in the RTL. */
925 tree stmts;
933 saved_function_name_decls
937 }
942 }
944 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
946 tree
948 {
953 /* Compute the number of elements, for the array type. */
955 {
958 }
960 {
963 }
965 {
968 }
969 else
970 {
973 }
975 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
976 limit in C++98 Annex B is very large (65536) and is not normative,
977 so we do not diagnose it (warn_overlength_strings is forced off
978 in c_common_post_options). */
980 {
984 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
985 separate the %d from the 'C'. 'ISO' should not be
986 translated, but it may be moved after 'C%d' in languages
987 where modifiers follow nouns. */
989 "string length %qd is greater than the length %qd "
992 }
994 /* Create the array type for the string constant. The ISO C++
995 standard says that a string literal has type `const char[N]' or
996 `const wchar_t[N]'. We use the same logic when invoked as a C
997 front-end with -Wwrite-strings.
998 ??? We should change the type of an expression depending on the
999 state of a warning flag. We should just be warning -- see how
1000 this is handled in the C++ front-end for the deprecated implicit
1001 conversion from string literals to `char*' or `wchar_t*'.
1003 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1004 array type being the unqualified version of that type.
1005 Therefore, if we are constructing an array of const char, we must
1006 construct the matching unqualified array type first. The C front
1007 end does not require this, but it does no harm, so we do it
1008 unconditionally. */
1019 }
1020 \f
1021 /* If DISABLE is true, stop issuing warnings. This is used when
1022 parsing code that we know will not be executed. This function may
1023 be called multiple times, and works as a stack. */
1025 static void
1027 {
1029 {
1032 }
1033 }
1035 /* If ENABLE is true, reenable issuing warnings. */
1037 static void
1039 {
1041 {
1044 }
1045 }
1047 /* Fully fold EXPR, an expression that was not folded (beyond integer
1048 constant expressions and null pointer constants) when being built
1049 up. If IN_INIT, this is in a static initializer and certain
1050 changes are made to the folding done. Clear *MAYBE_CONST if
1051 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1052 expression because it contains an evaluated operator (in C99) or an
1053 operator outside of sizeof returning an integer constant (in C90)
1054 not permitted in constant expressions, or because it contains an
1055 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1056 set to true by callers before calling this function.) Return the
1057 folded expression. Function arguments have already been folded
1058 before calling this function, as have the contents of SAVE_EXPR,
1059 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1060 C_MAYBE_CONST_EXPR. */
1062 tree
1064 {
1065 tree ret;
1071 /* This function is not relevant to C++ because C++ folds while
1072 parsing, and may need changes to be correct for C++ when C++
1073 stops folding while parsing. */
1080 {
1083 }
1090 }
1092 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1093 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1094 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1095 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1096 both evaluated and unevaluated subexpressions while
1097 *MAYBE_CONST_ITSELF is carried from only evaluated
1098 subexpressions). */
1100 static tree
1103 {
1115 /* This function is not relevant to C++ because C++ folds while
1116 parsing, and may need changes to be correct for C++ when C++
1117 stops folding while parsing. */
1121 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1122 anything else not counted as an expression cannot usefully be
1123 folded further at this point. */
1129 /* Operands of variable-length expressions (function calls) have
1130 already been folded, as have __builtin_* function calls, and such
1131 expressions cannot occur in constant expressions. */
1133 {
1137 }
1140 {
1149 else
1152 }
1154 /* Assignment, increment, decrement, function call and comma
1155 operators, and statement expressions, cannot occur in constant
1156 expressions if evaluated / outside of sizeof. (Function calls
1157 were handled above, though VA_ARG_EXPR is treated like a function
1158 call here, and statement expressions are handled through
1159 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1161 {
1181 }
1183 /* Fold individual tree codes as appropriate. */
1185 {
1187 /* Any non-constancy will have been marked in a containing
1188 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1196 maybe_const_itself);
1201 {
1204 }
1213 maybe_const_itself);
1216 maybe_const_itself);
1222 {
1226 }
1268 /* Binary operations evaluating both arguments (increment and
1269 decrement are binary internally in GCC). */
1273 maybe_const_itself);
1281 /* The RHS of a MODIFY_EXPR was fully folded when building that
1282 expression for the sake of conversion warnings. */
1285 maybe_const_itself);
1289 ret = in_init
1292 else
1305 {
1316 }
1322 CASE_CONVERT:
1332 /* Unary operations. */
1335 maybe_const_itself);
1339 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1340 not prepared to deal with them if they occur in initializers.
1341 Avoid attempts to fold references to UPC shared components
1342 due to the complexities of UPC pointer-to-shared arithmetic. */
1351 ret = in_init
1354 else
1359 {
1363 }
1365 {
1368 CASE_CONVERT:
1369 /* Don't warn about explicit conversions. We will already
1370 have warned about suspect implicit conversions. */
1377 }
1382 /* Binary operations not necessarily evaluating both
1383 arguments. */
1390 ? truthvalue_false_node
1398 ret = in_init
1401 else
1406 && op0_const
1407 && op0_const_self
1413 && op0_const_self
1439 else
1444 && op0_const
1445 && op0_const_self
1449 && op0_const_self
1453 && op0_const
1454 && op0_const_self
1458 && op0_const_self
1464 /* Each case where an operand with excess precision may be
1465 encountered must remove the EXCESS_PRECISION_EXPR around
1466 inner operands and possibly put one around the whole
1467 expression or possibly convert to the semantic type (which
1468 c_fully_fold does); we cannot tell at this stage which is
1469 appropriate in any particular case. */
1473 /* Various codes may appear through folding built-in functions
1474 and their arguments. */
1476 }
1478 out:
1479 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1480 have been done by this point, so remove them again. */
1484 {
1488 }
1492 }
1494 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1495 return EXP. Otherwise, return either EXP or its known constant
1496 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1497 Is the BLKmode test appropriate? */
1499 tree
1501 {
1502 tree ret;
1504 /* This function is only used by C, for c_fully_fold and other
1505 optimization, and may not be correct for C++. */
1516 /* Avoid unwanted tree sharing between the initializer and current
1517 function's body where the tree can be modified e.g. by the
1518 gimplifier. */
1522 }
1524 /* Print a warning if a constant expression had overflow in folding.
1525 Invoke this function on every expression that the language
1526 requires to be a constant expression.
1527 Note the ANSI C standard says it is erroneous for a
1528 constant expression to overflow. */
1530 void
1532 {
1540 }
1542 /* The same as above but print an unconditional error. */
1543 void
1545 {
1552 }
1554 /* Print a warning if an expression had overflow in folding and its
1555 operands hadn't.
1557 Invoke this function on every expression that
1558 (1) appears in the source code, and
1559 (2) is a constant expression that overflowed, and
1560 (3) is not already checked by convert_and_check;
1561 however, do not invoke this function on operands of explicit casts
1562 or when the expression is the result of an operator and any operand
1563 already overflowed. */
1565 void
1567 {
1572 {
1601 }
1602 }
1604 /* Warn about uses of logical || / && operator in a context where it
1605 is likely that the bitwise equivalent was intended by the
1606 programmer. We have seen an expression in which CODE is a binary
1607 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1608 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1609 void
1613 {
1625 /* Warn if &&/|| are being used in a context where it is
1626 likely that the bitwise equivalent was intended by the
1627 programmer. That is, an expression such as op && MASK
1628 where op should not be any boolean expression, nor a
1629 constant, and mask seems to be a non-boolean integer constant. */
1637 {
1641 else
1646 }
1648 /* We do not warn for constants because they are typical of macro
1649 expansions that test for features. */
1653 /* This warning only makes sense with logical operands. */
1661 /* We first test whether either side separately is trivially true
1662 (with OR) or trivially false (with AND). If so, do not warn.
1663 This is a common idiom for testing ranges of data types in
1664 portable code. */
1671 /* If this is an OR operation, invert both sides; now, the result
1672 should be always false to get a warning. */
1686 /* If this is an OR operation, invert both sides; now, the result
1687 should be always false to get a warning. */
1695 /* If both expressions have the same operand, if we can merge the
1696 ranges, and if the range test is always false, then warn. */
1703 {
1706 "logical %<or%> "
1708 else
1710 "logical %<and%> "
1712 }
1713 }
1716 /* Warn if EXP contains any computations whose results are not used.
1717 Return true if a warning is printed; false otherwise. LOCUS is the
1718 (potential) location of the expression. */
1720 bool
1722 {
1723 restart:
1727 /* Don't warn about void constructs. This includes casting to void,
1728 void function calls, and statement expressions with a final cast
1729 to void. */
1737 {
1753 /* For a binding, warn if no side effect within it. */
1765 /* In && or ||, warn if 2nd operand has no side effect. */
1772 /* Let people do `(foo (), 0)' without a warning. */
1779 /* If this is an expression with side effects, don't warn; this
1780 case commonly appears in macro expansions. */
1786 /* Don't warn about automatic dereferencing of references, since
1787 the user cannot control it. */
1789 {
1792 }
1793 /* Fall through. */
1796 /* Referencing a volatile value is a side effect, so don't warn. */
1801 /* If this is an expression which has no operands, there is no value
1802 to be unused. There are no such language-independent codes,
1803 but front ends may define such. */
1807 warn:
1809 }
1810 }
1813 /* Print a warning about casts that might indicate violation
1814 of strict aliasing rules if -Wstrict-aliasing is used and
1815 strict aliasing mode is in effect. OTYPE is the original
1816 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1818 bool
1820 {
1821 /* Strip pointer conversion chains and get to the correct original type. */
1829 /* If the type we are casting to is a ref-all pointer
1830 dereferencing it is always valid. */
1837 {
1838 /* Casting the address of an object to non void pointer. Warn
1839 if the cast breaks type based aliasing. */
1841 {
1845 }
1846 else
1847 {
1848 /* warn_strict_aliasing >= 3. This includes the default (3).
1849 Only warn if the cast is dereferenced immediately. */
1850 alias_set_type set1 =
1856 {
1860 }
1863 {
1867 }
1868 }
1869 }
1870 else
1872 {
1873 /* At this level, warn for any conversions, even if an address is
1874 not taken in the same statement. This will likely produce many
1875 false positives, but could be useful to pinpoint problems that
1876 are not revealed at higher levels. */
1881 {
1885 }
1886 }
1889 }
1891 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1892 sizeof as last operand of certain builtins. */
1894 void
1898 {
1902 location_t loc;
1910 {
1914 /* FALLTHRU */
1922 /* FALLTHRU */
1981 }
2009 {
2013 {
2016 "argument to %<sizeof%> in %qD call is the same "
2017 "expression as the destination; did you mean to "
2023 "argument to %<sizeof%> in %qD call is the same "
2024 "expression as the destination; did you mean to "
2026 else
2028 "argument to %<sizeof%> in %qD call is the same "
2029 "expression as the destination; did you mean to "
2032 }
2035 && !strop
2038 {
2040 "argument to %<sizeof%> in %qD call is the same "
2041 "pointer type %qT as the destination; expected %qT "
2045 }
2046 }
2049 {
2053 {
2056 "argument to %<sizeof%> in %qD call is the same "
2057 "expression as the source; did you mean to "
2063 "argument to %<sizeof%> in %qD call is the same "
2064 "expression as the source; did you mean to "
2066 else
2068 "argument to %<sizeof%> in %qD call is the same "
2069 "expression as the source; did you mean to "
2072 }
2075 && !strop
2078 {
2080 "argument to %<sizeof%> in %qD call is the same "
2081 "pointer type %qT as the source; expected %qT "
2085 }
2086 }
2089 {
2093 {
2096 "argument to %<sizeof%> in %qD call is the same "
2097 "expression as the first source; did you mean to "
2103 "argument to %<sizeof%> in %qD call is the same "
2104 "expression as the first source; did you mean to "
2106 else
2108 "argument to %<sizeof%> in %qD call is the same "
2109 "expression as the first source; did you mean to "
2112 }
2115 && !strop
2118 {
2120 "argument to %<sizeof%> in %qD call is the same "
2121 "pointer type %qT as the first source; expected %qT "
2125 }
2126 }
2129 {
2133 {
2136 "argument to %<sizeof%> in %qD call is the same "
2137 "expression as the second source; did you mean to "
2143 "argument to %<sizeof%> in %qD call is the same "
2144 "expression as the second source; did you mean to "
2146 else
2148 "argument to %<sizeof%> in %qD call is the same "
2149 "expression as the second source; did you mean to "
2152 }
2155 && !strop
2158 {
2160 "argument to %<sizeof%> in %qD call is the same "
2161 "pointer type %qT as the second source; expected %qT "
2165 }
2166 }
2168 }
2170 /* Warn for unlikely, improbable, or stupid DECL declarations
2171 of `main'. */
2173 void
2175 {
2176 function_args_iterator iter;
2177 tree type;
2181 {
2182 /* XXX void_type_node belies the abstraction. */
2188 {
2210 "third argument of %q+D should probably be "
2213 }
2214 }
2216 /* It is intentional that this message does not mention the third
2217 argument because it's only mentioned in an appendix of the
2218 standard. */
2222 }
2224 /* True if pointers to distinct types T1 and T2 can be converted to
2225 each other without an explicit cast. Only returns true for opaque
2226 vector types. */
2227 bool
2229 {
2236 }
2238 /* True if vector types T1 and T2 can be converted to each other
2239 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2240 can only be converted with -flax-vector-conversions yet that is not
2241 in effect, emit a note telling the user about that option if such
2242 a note has not previously been emitted. */
2243 bool
2245 {
2253 convertible_lax =
2268 {
2271 "conversions between vectors with differing "
2273 }
2276 }
2278 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2279 and have vector types, V0 has the same type as V1, and the number of
2280 elements of V0, V1, MASK is the same.
2282 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2283 called with two arguments. In this case implementation passes the
2284 first argument twice in order to share the same tree code. This fact
2285 could enable the mask-values being twice the vector length. This is
2286 an implementation accident and this semantics is not guaranteed to
2287 the user. */
2288 tree
2290 {
2291 tree ret;
2297 {
2300 }
2308 {
2312 }
2316 {
2319 }
2322 {
2326 }
2332 {
2334 "argument vector(s) and the mask vector should "
2337 }
2341 {
2345 }
2348 {
2349 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2355 else
2356 {
2359 }
2363 }
2371 }
2373 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2374 to integral type. */
2376 static tree
2378 {
2383 {
2384 /* C++0x scoped enumerations don't implicitly convert to integral
2385 type; if we stripped an explicit conversion to a larger type we
2386 need to replace it so common_type will still work. */
2390 }
2392 }
2394 /* This is a helper function of build_binary_op.
2396 For certain operations if both args were extended from the same
2397 smaller type, do the arithmetic in that type and then extend.
2399 BITWISE indicates a bitwise operation.
2400 For them, this optimization is safe only if
2401 both args are zero-extended or both are sign-extended.
2402 Otherwise, we might change the result.
2403 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2404 but calculated in (unsigned short) it would be (unsigned short)-1.
2405 */
2406 tree
2408 {
2412 tree type;
2414 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2415 excessive narrowing when we call get_narrower below. For
2416 example, suppose that OP0 is of unsigned int extended
2417 from signed char and that RESULT_TYPE is long long int.
2418 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2419 like
2421 (long long int) (unsigned int) signed_char
2423 which get_narrower would narrow down to
2425 (unsigned int) signed char
2427 If we do not cast OP0 first, get_narrower would return
2428 signed_char, which is inconsistent with the case of the
2429 explicit cast. */
2436 /* UNS is 1 if the operation to be done is an unsigned one. */
2439 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2440 but it *requires* conversion to FINAL_TYPE. */
2451 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2453 /* For bitwise operations, signedness of nominal type
2454 does not matter. Consider only how operands were extended. */
2458 /* Note that in all three cases below we refrain from optimizing
2459 an unsigned operation on sign-extended args.
2460 That would not be valid. */
2462 /* Both args variable: if both extended in same way
2463 from same width, do it in that width.
2464 Do it unsigned if args were zero-extended. */
2471 return c_common_signed_or_unsigned_type
2478 && (type
2489 && (type
2497 }
2499 /* Checks if expression EXPR of real/integer type cannot be converted
2500 to the real/integer type TYPE. Function returns true when:
2501 * EXPR is a constant which cannot be exactly converted to TYPE
2502 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2503 for EXPR type and TYPE being both integers or both real.
2504 * EXPR is not a constant of real type and TYPE is an integer.
2505 * EXPR is not a constant of integer type which cannot be
2506 exactly converted to real type.
2507 Function allows conversions between types of different signedness and
2508 does not return true in that case. Function can produce signedness
2509 warnings if PRODUCE_WARNS is true. */
2510 bool
2512 {
2518 {
2519 /* Warn for real constant that is not an exact integer converted
2520 to integer type. */
2523 {
2526 }
2527 /* Warn for an integer constant that does not fit into integer type. */
2531 {
2534 {
2538 }
2540 {
2544 }
2545 else
2547 }
2549 {
2550 /* Warn for an integer constant that does not fit into real type. */
2552 {
2556 }
2557 /* Warn for a real constant that does not fit into a smaller
2558 real type. */
2561 {
2565 }
2566 }
2567 }
2568 else
2569 {
2570 /* Warn for real types converted to integer types. */
2577 {
2578 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2582 /* Don't warn for short y; short x = ((int)y & 0xff); */
2586 {
2587 /* If both args were extended from a shortest type,
2588 use that type if that is safe. */
2595 {
2601 /* If one of the operands is a non-negative constant
2602 that fits in the target type, then the type of the
2603 other operand does not matter. */
2612 /* If constant is unsigned and fits in the target
2613 type, then the result will also fit. */
2615 && unsigned0
2618 && unsigned1
2621 }
2622 }
2623 /* Warn for integer types converted to smaller integer types. */
2627 /* When they are the same width but different signedness,
2628 then the value may change. */
2631 /* Even when converted to a bigger type, if the type is
2632 unsigned but expr is signed, then negative values
2633 will be changed. */
2639 }
2641 /* Warn for integer types converted to real types if and only if
2642 all the range of values of the integer type cannot be
2643 represented by the real type. */
2646 {
2650 /* Don't warn about char y = 0xff; float x = (int) y; */
2662 }
2664 /* Warn for real types converted to smaller real types. */
2669 }
2672 }
2674 /* Warns if the conversion of EXPR to TYPE may alter a value.
2675 This is a helper function for warnings_for_convert_and_check. */
2677 static void
2679 {
2687 {
2700 /* Conversion from boolean to a signed:1 bit-field (which only
2701 can hold the values 0 and -1) doesn't lose information - but
2702 it does change the value. */
2717 {
2718 /* In case of COND_EXPR, we do not care about the type of
2719 COND_EXPR, only about the conversion of each operand. */
2726 }
2733 }
2734 }
2736 /* Produce warnings after a conversion. RESULT is the result of
2737 converting EXPR to TYPE. This is a helper function for
2738 convert_and_check and cp_convert_and_check. */
2740 void
2742 {
2749 {
2750 /* Do not diagnose overflow in a constant expression merely
2751 because a conversion overflowed. */
2756 {
2757 /* This detects cases like converting -129 or 256 to
2758 unsigned char. */
2762 else
2764 }
2768 /* No warning for converting 0x80000000 to int. */
2776 else
2778 }
2783 else
2785 }
2788 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2789 Invoke this function on every expression that is converted implicitly,
2790 i.e. because of language rules and not because of an explicit cast. */
2792 tree
2794 {
2795 tree result;
2796 tree expr_for_warning;
2798 /* Convert from a value with possible excess precision rather than
2799 via the semantic type, but do not warn about values not fitting
2800 exactly in the semantic type. */
2802 {
2808 }
2809 else
2823 }
2824 \f
2825 /* A node in a list that describes references to variables (EXPR), which are
2826 either read accesses if WRITER is zero, or write accesses, in which case
2827 WRITER is the parent of EXPR. */
2828 struct tlist
2829 {
2832 };
2834 /* Used to implement a cache the results of a call to verify_tree. We only
2835 use this for SAVE_EXPRs. */
2836 struct tlist_cache
2837 {
2841 tree expr;
2842 };
2844 /* Obstack to use when allocating tlist structures, and corresponding
2845 firstobj. */
2849 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2850 warnings. */
2852 /* SAVE_EXPRs need special treatment. We process them only once and then
2853 cache the results. */
2865 /* Create a new struct tlist and fill in its fields. */
2868 {
2875 }
2877 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2878 is nonnull, we ignore any node we find which has a writer equal to it. */
2880 static void
2882 {
2884 {
2891 }
2892 }
2894 /* Merge the nodes of ADD into TO. This merging process is done so that for
2895 each variable that already exists in TO, no new node is added; however if
2896 there is a write access recorded in ADD, and an occurrence on TO is only
2897 a read access, then the occurrence in TO will be modified to record the
2898 write. */
2900 static void
2902 {
2909 {
2916 {
2920 }
2922 {
2926 }
2928 }
2929 }
2931 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2932 references in list LIST conflict with it, excluding reads if ONLY writers
2933 is nonzero. */
2935 static void
2938 {
2941 /* Avoid duplicate warnings. */
2947 {
2951 {
2956 }
2958 }
2959 }
2961 /* Given a list LIST of references to variables, find whether any of these
2962 can cause conflicts due to missing sequence points. */
2964 static void
2966 {
2970 {
2973 }
2974 }
2976 /* Return nonzero if X is a tree that can be verified by the sequence point
2977 warnings. */
2978 static int
2980 {
2987 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2988 (lvalue_p) crash on TRY/CATCH. */
2995 /* No point to track non-const calls, they will never satisfy
2996 operand_equal_p. */
3004 }
3006 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3007 static bool
3009 {
3011 }
3013 /* Walk the tree X, and record accesses to variables. If X is written by the
3014 parent tree, WRITER is the parent.
3015 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3016 expression or its only operand forces a sequence point, then everything up
3017 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3018 in PNO_SP.
3019 Once we return, we will have emitted warnings if any subexpression before
3020 such a sequence point could be undefined. On a higher level, however, the
3021 sequence point may not be relevant, and we'll merge the two lists.
3023 Example: (b++, a) + b;
3024 The call that processes the COMPOUND_EXPR will store the increment of B
3025 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3026 processes the PLUS_EXPR will need to merge the two lists so that
3027 eventually, all accesses end up on the same list (and we'll warn about the
3028 unordered subexpressions b++ and b.
3030 A note on merging. If we modify the former example so that our expression
3031 becomes
3032 (b++, b) + a
3033 care must be taken not simply to add all three expressions into the final
3034 PNO_SP list. The function merge_tlist takes care of that by merging the
3035 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3036 way, so that no more than one access to B is recorded. */
3038 static void
3040 tree writer)
3041 {
3046 /* X may be NULL if it is the operand of an empty statement expression
3047 ({ }). */
3051 restart:
3059 {
3091 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3092 two first, to avoid warning for (a ? b++ : b++). */
3108 /* Expressions inside the LHS are not ordered wrt. the sequence points
3109 in the RHS. Example:
3110 *a = (a++, 2)
3111 Despite the fact that the modification of "a" is in the before_sp
3112 list (tmp_before), it conflicts with the use of "a" in the LHS.
3113 We can handle this by adding the contents of tmp_list3
3114 to those of tmp_before, and redoing the collision warnings for that
3115 list. */
3118 /* Exclude the LHS itself here; we first have to merge it into the
3119 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3120 didn't exclude the LHS, we'd get it twice, once as a read and once
3121 as a write. */
3132 /* We need to warn about conflicts among arguments and conflicts between
3133 args and the function address. Side effects of the function address,
3134 however, are not ordered by the sequence point of the call. */
3135 {
3136 call_expr_arg_iterator iter;
3137 tree arg;
3141 {
3146 }
3151 }
3154 /* Scan all the list, e.g. indices of multi dimensional array. */
3156 {
3162 }
3166 {
3173 {
3185 {
3189 }
3192 }
3196 }
3206 /* For other expressions, simply recurse on their operands.
3207 Manual tail recursion for unary expressions.
3208 Other non-expressions need not be processed. */
3210 {
3214 }
3216 {
3220 {
3225 }
3226 }
3228 }
3229 }
3231 /* Try to warn for undefined behavior in EXPR due to missing sequence
3232 points. */
3234 DEBUG_FUNCTION void
3236 {
3242 {
3245 }
3250 }
3251 \f
3252 /* Validate the expression after `case' and apply default promotions. */
3254 static tree
3256 {
3261 /* Promote char or short to int. */
3264 {
3267 }
3272 }
3273 \f
3274 /* See if the case values LOW and HIGH are in the range of the original
3275 type (i.e. before the default conversion to int) of the switch testing
3276 expression.
3277 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3278 the type before promoting it. CASE_LOW_P is a pointer to the lower
3279 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3280 if the case is not a case range.
3281 The caller has to make sure that we are not called with NULL for
3282 CASE_LOW_P (i.e. the default case).
3283 Returns true if the case label is in range of ORIG_TYPE (saturated or
3284 untouched) or false if the label is out of range. */
3286 static bool
3289 {
3294 /* If there was a problem with the original type, do nothing. */
3301 /* Case label is less than minimum for type. */
3304 {
3307 }
3309 /* Case value is greater than maximum for type. */
3312 {
3315 }
3317 /* Saturate lower case label value to minimum. */
3320 {
3324 }
3326 /* Saturate upper case label value to maximum. */
3329 {
3333 }
3341 }
3342 \f
3343 /* Return an integer type with BITS bits of precision,
3344 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3346 tree
3348 {
3387 }
3389 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3390 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3391 and saturating if SATP is nonzero, otherwise not saturating. */
3393 tree
3396 {
3400 else
3408 {
3410 "fixed-point types that have too many integral and "
3413 }
3416 }
3418 /* Used for communication between c_common_type_for_mode and
3419 c_register_builtin_type. */
3422 /* Return a data type that has machine mode MODE.
3423 If the mode is an integer,
3424 then UNSIGNEDP selects between signed and unsigned types.
3425 If the mode is a fixed-point mode,
3426 then UNSIGNEDP selects between saturating and nonsaturating types. */
3428 tree
3430 {
3431 tree t;
3468 #if HOST_BITS_PER_WIDE_INT >= 64
3471 #endif
3496 {
3498 tree inner_type;
3514 }
3516 {
3521 }
3531 {
3617 }
3625 }
3627 tree
3629 {
3631 }
3633 /* Return a signed type the same as TYPE in other respects. */
3635 tree
3637 {
3639 }
3641 /* Return a type the same as TYPE except unsigned or
3642 signed according to UNSIGNEDP. */
3644 tree
3646 {
3647 tree type1;
3649 /* This block of code emulates the behavior of the old
3650 c_common_unsigned_type. In particular, it returns
3651 long_unsigned_type_node if passed a long, even when a int would
3652 have the same size. This is necessary for warnings to work
3653 correctly in archs where sizeof(int) == sizeof(long) */
3656 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3672 #if HOST_BITS_PER_WIDE_INT >= 64
3675 #endif
3685 #define C_COMMON_FIXED_TYPES(NAME) \
3686 if (type1 == short_ ## NAME ## _type_node \
3687 || type1 == unsigned_short_ ## NAME ## _type_node) \
3688 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3689 : short_ ## NAME ## _type_node; \
3690 if (type1 == NAME ## _type_node \
3691 || type1 == unsigned_ ## NAME ## _type_node) \
3692 return unsignedp ? unsigned_ ## NAME ## _type_node \
3693 : NAME ## _type_node; \
3694 if (type1 == long_ ## NAME ## _type_node \
3695 || type1 == unsigned_long_ ## NAME ## _type_node) \
3696 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3697 : long_ ## NAME ## _type_node; \
3698 if (type1 == long_long_ ## NAME ## _type_node \
3699 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3700 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3701 : long_long_ ## NAME ## _type_node;
3703 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3704 if (type1 == NAME ## _type_node \
3705 || type1 == u ## NAME ## _type_node) \
3706 return unsignedp ? u ## NAME ## _type_node \
3707 : NAME ## _type_node;
3709 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3710 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3711 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3712 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3713 : sat_ ## short_ ## NAME ## _type_node; \
3714 if (type1 == sat_ ## NAME ## _type_node \
3715 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3716 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3717 : sat_ ## NAME ## _type_node; \
3718 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3719 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3720 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3721 : sat_ ## long_ ## NAME ## _type_node; \
3722 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3723 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3724 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3725 : sat_ ## long_long_ ## NAME ## _type_node;
3727 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3728 if (type1 == sat_ ## NAME ## _type_node \
3729 || type1 == sat_ ## u ## NAME ## _type_node) \
3730 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3731 : sat_ ## NAME ## _type_node;
3757 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3758 the precision; they have precision set to match their range, but
3759 may use a wider mode to match an ABI. If we change modes, we may
3760 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3761 the precision as well, so as to yield correct results for
3762 bit-field types. C++ does not have these separate bit-field
3763 types, and producing a signed or unsigned variant of an
3764 ENUMERAL_TYPE may cause other problems as well. */
3770 #define TYPE_OK(node) \
3771 (TYPE_MODE (type) == TYPE_MODE (node) \
3772 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3791 #if HOST_BITS_PER_WIDE_INT >= 64
3794 #endif
3803 #undef TYPE_OK
3806 }
3808 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3810 tree
3812 {
3813 /* Extended integer types of the same width as a standard type have
3814 lesser rank, so those of the same width as int promote to int or
3815 unsigned int and are valid for printf formats expecting int or
3816 unsigned int. To avoid such special cases, avoid creating
3817 extended integer types for bit-fields if a standard integer type
3818 is available. */
3835 }
3837 /* The C version of the register_builtin_type langhook. */
3839 void
3841 {
3842 tree decl;
3852 }
3853 \f
3854 /* Print an error message for invalid operands to arith operation
3855 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3856 LOCATION is the location of the message. */
3858 void
3861 {
3865 {
3910 }
3914 }
3915 \f
3916 /* Given an expression as a tree, return its original type. Do this
3917 by stripping any conversion that preserves the sign and precision. */
3918 static tree
3920 {
3923 }
3925 /* Subroutine of build_binary_op, used for comparison operations.
3926 See if the operands have both been converted from subword integer types
3927 and, if so, perhaps change them both back to their original type.
3928 This function is also responsible for converting the two operands
3929 to the proper common type for comparison.
3931 The arguments of this function are all pointers to local variables
3932 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3933 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3935 If this function returns nonzero, it means that the comparison has
3936 a constant value. What this function returns is an expression for
3937 that value. */
3939 tree
3942 {
3943 tree type;
3952 /* Throw away any conversions to wider types
3953 already present in the operands. */
3958 /* If primopN is first sign-extended from primopN's precision to opN's
3959 precision, then zero-extended from opN's precision to
3960 *restype_ptr precision, shortenings might be invalid. */
3963 && !unsignedp0
3968 && !unsignedp1
3972 /* Handle the case that OP0 does not *contain* a conversion
3973 but it *requires* conversion to FINAL_TYPE. */
3980 /* If one of the operands must be floated, we cannot optimize. */
3984 /* If first arg is constant, swap the args (changing operation
3985 so value is preserved), for canonicalization. Don't do this if
3986 the second arg is 0. */
3991 {
4008 {
4023 }
4025 }
4027 /* If comparing an integer against a constant more bits wide,
4028 maybe we can deduce a value of 1 or 0 independent of the data.
4029 Or else truncate the constant now
4030 rather than extend the variable at run time.
4032 This is only interesting if the constant is the wider arg.
4033 Also, it is not safe if the constant is unsigned and the
4034 variable arg is signed, since in this case the variable
4035 would be sign-extended and then regarded as unsigned.
4036 Our technique fails in this case because the lowest/highest
4037 possible unsigned results don't follow naturally from the
4038 lowest/highest possible values of the variable operand.
4039 For just EQ_EXPR and NE_EXPR there is another technique that
4040 could be used: see if the constant can be faithfully represented
4041 in the other operand's type, by truncating it and reextending it
4042 and see if that preserves the constant's value. */
4048 {
4051 /* 1 if comparison is nominally unsigned. */
4053 tree val;
4065 {
4066 /* Convert primop1 to target type, but do not introduce
4067 additional overflow. We know primop1 is an int_cst. */
4071 }
4073 {
4076 }
4079 {
4084 }
4085 else
4086 {
4091 }
4094 /* This used to be a switch, but Genix compiler can't handle that. */
4096 {
4099 }
4101 {
4104 }
4106 {
4111 }
4113 {
4118 }
4120 {
4125 }
4127 {
4132 }
4134 /* If primop0 was sign-extended and unsigned comparison specd,
4135 we did a signed comparison above using the signed type bounds.
4136 But the comparison we output must be unsigned.
4138 Also, for inequalities, VAL is no good; but if the signed
4139 comparison had *any* fixed result, it follows that the
4140 unsigned comparison just tests the sign in reverse
4141 (positive values are LE, negative ones GE).
4142 So we can generate an unsigned comparison
4143 against an extreme value of the signed type. */
4146 {
4149 {
4164 }
4166 }
4170 {
4177 }
4180 {
4181 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4185 }
4187 /* Value is not predetermined, but do the comparison
4188 in the type of the operand that is not constant.
4189 TYPE is already properly set. */
4190 }
4192 /* If either arg is decimal float and the other is float, find the
4193 proper common type to use for comparison. */
4204 /* If args' natural types are both narrower than nominal type
4205 and both extend in the same manner, compare them
4206 in the type of the wider arg.
4207 Otherwise must actually extend both to the nominal
4208 common type lest different ways of extending
4209 alter the result.
4210 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4215 {
4219 type);
4220 /* Make sure shorter operand is extended the right way
4221 to match the longer operand. */
4222 primop0
4225 primop0);
4226 primop1
4229 primop1);
4230 }
4231 else
4232 {
4233 /* Here we must do the comparison on the nominal type
4234 using the args exactly as we received them. */
4241 {
4243 /* All unsigned values are >= 0, so we warn. However,
4244 if OP0 is a constant that is >= 0, the signedness of
4245 the comparison isn't an issue, so suppress the
4246 warning. */
4248 warn_type_limits && !in_system_header
4252 primop0)))
4253 /* Do not warn for enumeration types. */
4257 {
4274 }
4277 {
4278 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4283 }
4284 }
4285 }
4293 }
4294 \f
4295 /* Return a tree for the sum or difference (RESULTCODE says which)
4296 of pointer PTROP and integer INTOP. */
4298 tree
4301 {
4304 /* The result is a pointer of the same type that is being added. */
4307 /* If the pointer lives in UPC shared memory, then
4308 drop the 'shared' qualifier. */
4313 {
4317 }
4319 {
4323 }
4325 {
4329 }
4330 else
4333 /* We are manipulating pointer values, so we don't need to warn
4334 about relying on undefined signed overflow. We disable the
4335 warning here because we use integer types so fold won't know that
4336 they are really pointers. */
4339 /* If what we are about to multiply by the size of the elements
4340 contains a constant term, apply distributive law
4341 and multiply that constant term separately.
4342 This helps produce common subexpressions. */
4347 /* If the constant comes from pointer subtraction,
4348 skip this optimization--it would cause an error. */
4350 /* If the constant is unsigned, and smaller than the pointer size,
4351 then we must skip this optimization. This is because it could cause
4352 an overflow error if the constant is negative but INTOP is not. */
4356 {
4361 /* Convert both subexpression types to the type of intop,
4362 because weird cases involving pointer arithmetic
4363 can result in a sum or difference with different type args. */
4368 }
4370 /* Convert the integer argument to a type the same size as sizetype
4371 so the multiply won't overflow spuriously. */
4377 /* Replace the integer argument with a suitable product by the object size.
4378 Do this multiplication as signed, then convert to the appropriate type
4379 for the pointer operation and disregard an overflow that occurred only
4380 because of the sign-extension change in the latter conversion. */
4381 {
4389 }
4391 /* Create the sum or difference. */
4400 }
4401 \f
4402 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4403 and if NON_CONST is known not to be permitted in an evaluated part
4404 of a constant expression. */
4406 tree
4408 {
4412 /* This should never be called for C++. */
4416 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4425 }
4427 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4428 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4429 around the SAVE_EXPR if needed so that c_fully_fold does not need
4430 to look inside SAVE_EXPRs. */
4432 tree
4434 {
4443 }
4445 /* Return whether EXPR is a declaration whose address can never be
4446 NULL. */
4448 bool
4450 {
4455 }
4457 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4458 or for an `if' or `while' statement or ?..: exp. It should already
4459 have been validated to be of suitable type; otherwise, a bad
4460 diagnostic may result.
4462 The EXPR is located at LOCATION.
4464 This preparation consists of taking the ordinary
4465 representation of an expression expr and producing a valid tree
4466 boolean expression describing whether expr is nonzero. We could
4467 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4468 but we optimize comparisons, &&, ||, and !.
4470 The resulting type should always be `truthvalue_type_node'. */
4472 tree
4474 {
4476 {
4518 ? truthvalue_true_node
4524 ? truthvalue_true_node
4529 /* Fall through. */
4532 {
4535 {
4536 /* Common Ada/Pascal programmer's mistake. */
4538 OPT_Waddress,
4540 inner);
4542 }
4544 }
4561 /* These don't change whether an object is nonzero or zero. */
4566 /* These don't change whether an object is zero or nonzero, but
4567 we can't ignore them if their second arg has side-effects. */
4569 {
4572 c_common_truthvalue_conversion
4575 }
4576 else
4581 /* Distribute the conversion into the arms of a COND_EXPR. */
4583 {
4586 /* In C++ one of the arms might have void type if it is throw. */
4594 }
4595 else
4596 {
4597 /* Folding will happen later for C. */
4605 }
4607 CASE_CONVERT:
4608 {
4612 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4613 since that affects how `default_conversion' will behave. */
4617 /* Don't strip a conversion from C++0x scoped enum, since they
4618 don't implicitly convert to other types. */
4622 /* If this isn't narrowing the argument, we can ignore it. */
4626 }
4632 {
4636 }
4641 }
4644 {
4646 expr = (build_binary_op
4650 c_common_truthvalue_conversion
4653 c_common_truthvalue_conversion
4658 }
4661 {
4666 }
4667 else
4670 ret:
4673 }
4674 \f
4683 /* Apply the TYPE_QUALS to the new DECL. */
4685 void
4687 {
4695 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4696 constructor can produce constant init, so rely on cp_finish_decl to
4697 clear TREE_READONLY if the variable has non-constant init. */
4700 {
4703 }
4705 {
4707 /* Allow 'restrict' on arrays of pointers.
4708 FIXME currently we just ignore it. */
4714 }
4716 {
4722 /* The declaration's type should have been previously defined
4723 as a UPC shared type. */
4725 }
4726 }
4728 /* Hash function for the problem of multiple type definitions in
4729 different files. This must hash all types that will compare
4730 equal via comptypes to the same value. In practice it hashes
4731 on some of the simple stuff and leaves the details to comptypes. */
4733 static hashval_t
4735 {
4739 tree t2;
4741 {
4742 /* For pointers, hash on pointee type plus some swizzling. */
4745 /* Hash on number of elements and total size. */
4764 }
4765 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4766 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4768 /* We might have a VLA here. */
4771 else
4774 }
4778 /* Return the typed-based alias set for T, which may be an expression
4779 or a type. Return -1 if we don't do anything special. */
4781 alias_set_type
4783 {
4784 tree u;
4787 /* For VLAs, use the alias set of the element type rather than the
4788 default of alias set 0 for types compared structurally. */
4790 {
4794 }
4796 /* Permit type-punning when accessing a union, provided the access
4797 is directly through the union. For example, this code does not
4798 permit taking the address of a union member and then storing
4799 through it. Even the type-punning allowed here is a GCC
4800 extension, albeit a common and useful one; the C standard says
4801 that such accesses have implementation-defined behavior. */
4809 /* That's all the expressions we handle specially. */
4813 /* The C standard guarantees that any object may be accessed via an
4814 lvalue that has character type. */
4820 /* The C standard specifically allows aliasing between signed and
4821 unsigned variants of the same type. We treat the signed
4822 variant as canonical. */
4824 {
4827 /* t1 == t can happen for boolean nodes which are always unsigned. */
4830 }
4832 /* Handle the case of multiple type nodes referring to "the same" type,
4833 which occurs with IMA. These share an alias set. FIXME: Currently only
4834 C90 is handled. (In C99 type compatibility is not transitive, which
4835 complicates things mightily. The alias set splay trees can theoretically
4836 represent this, but insertion is tricky when you consider all the
4837 different orders things might arrive in.) */
4842 /* Save time if there's only one input file. */
4846 /* Pointers need special handling if they point to any type that
4847 needs special handling (below). */
4849 {
4850 tree t2;
4851 /* Find bottom type under any nested POINTERs. */
4855 ;
4863 }
4864 /* These are the only cases that need special handling. */
4871 /* Undefined? */
4875 /* Look up t in hash table. Only one of the compatible types within each
4876 alias set is recorded in the table. */
4880 NULL);
4883 {
4886 }
4887 else
4888 /* Our caller will assign and record (in t) a new alias set; all we need
4889 to do is remember t in the hash table. */
4893 }
4894 \f
4895 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4896 the second parameter indicates which OPERATOR is being applied.
4897 The COMPLAIN flag controls whether we should diagnose possibly
4898 ill-formed constructs or not. LOC is the location of the SIZEOF or
4899 TYPEOF operator. */
4901 tree
4904 {
4912 {
4914 {
4921 }
4922 else
4923 {
4925 {
4929 else
4932 }
4934 }
4935 }
4937 {
4939 {
4947 }
4948 else
4951 }
4954 {
4959 }
4962 {
4967 }
4968 else
4969 {
4971 /* Convert in case a char is more than one unit. */
4975 else
4977 }
4982 {
4985 }
4987 /* VALUE will have the middle-end integer type sizetype.
4988 However, we should really return a value of type `size_t',
4989 which is just a typedef for an ordinary integer type. */
4993 }
4995 /* Implement the __alignof keyword: Return the minimum required
4996 alignment of EXPR, measured in bytes. For VAR_DECLs,
4997 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4998 from an "aligned" __attribute__ specification). LOC is the
4999 location of the ALIGNOF operator. */
5001 tree
5003 {
5004 tree t;
5011 {
5014 }
5020 {
5027 {
5034 }
5036 }
5037 else
5041 }
5042 \f
5043 /* Handle C and C++ default attributes. */
5045 enum built_in_attribute
5046 {
5047 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5048 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5049 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5050 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5051 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5053 #undef DEF_ATTR_NULL_TREE
5054 #undef DEF_ATTR_INT
5055 #undef DEF_ATTR_STRING
5056 #undef DEF_ATTR_IDENT
5057 #undef DEF_ATTR_TREE_LIST
5058 ATTR_LAST
5059 };
5065 enum c_builtin_type
5066 {
5067 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5068 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5069 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5070 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5071 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5072 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5073 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5074 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5075 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5076 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5077 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5078 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5079 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5080 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5081 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5082 NAME,
5083 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5085 #undef DEF_PRIMITIVE_TYPE
5086 #undef DEF_FUNCTION_TYPE_0
5087 #undef DEF_FUNCTION_TYPE_1
5088 #undef DEF_FUNCTION_TYPE_2
5089 #undef DEF_FUNCTION_TYPE_3
5090 #undef DEF_FUNCTION_TYPE_4
5091 #undef DEF_FUNCTION_TYPE_5
5092 #undef DEF_FUNCTION_TYPE_6
5093 #undef DEF_FUNCTION_TYPE_7
5094 #undef DEF_FUNCTION_TYPE_VAR_0
5095 #undef DEF_FUNCTION_TYPE_VAR_1
5096 #undef DEF_FUNCTION_TYPE_VAR_2
5097 #undef DEF_FUNCTION_TYPE_VAR_3
5098 #undef DEF_FUNCTION_TYPE_VAR_4
5099 #undef DEF_FUNCTION_TYPE_VAR_5
5100 #undef DEF_POINTER_TYPE
5101 BT_LAST
5102 };
5106 /* A temporary array for c_common_nodes_and_builtins. Used in
5107 communication with def_fn_type. */
5110 /* A helper function for c_common_nodes_and_builtins. Build function type
5111 for DEF with return type RET and N arguments. If VAR is true, then the
5112 function should be variadic after those N arguments.
5114 Takes special care not to ICE if any of the types involved are
5115 error_mark_node, which indicates that said type is not in fact available
5116 (see builtin_type_for_size). In which case the function type as a whole
5117 should be error_mark_node. */
5119 static void
5121 {
5122 tree t;
5129 {
5135 }
5142 else
5145 egress:
5148 }
5150 /* Build builtin functions common to both C and C++ language
5151 frontends. */
5153 static void
5155 {
5156 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5157 builtin_types[ENUM] = VALUE;
5158 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5159 def_fn_type (ENUM, RETURN, 0, 0);
5160 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5161 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5162 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5163 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5164 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5165 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5166 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5167 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5168 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5169 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5170 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5171 ARG6) \
5172 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5173 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5174 ARG6, ARG7) \
5175 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5176 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5177 def_fn_type (ENUM, RETURN, 1, 0);
5178 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5179 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5180 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5181 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5182 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5183 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5184 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5185 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5186 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5187 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5188 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5189 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5193 #undef DEF_PRIMITIVE_TYPE
5194 #undef DEF_FUNCTION_TYPE_1
5195 #undef DEF_FUNCTION_TYPE_2
5196 #undef DEF_FUNCTION_TYPE_3
5197 #undef DEF_FUNCTION_TYPE_4
5198 #undef DEF_FUNCTION_TYPE_5
5199 #undef DEF_FUNCTION_TYPE_6
5200 #undef DEF_FUNCTION_TYPE_VAR_0
5201 #undef DEF_FUNCTION_TYPE_VAR_1
5202 #undef DEF_FUNCTION_TYPE_VAR_2
5203 #undef DEF_FUNCTION_TYPE_VAR_3
5204 #undef DEF_FUNCTION_TYPE_VAR_4
5205 #undef DEF_FUNCTION_TYPE_VAR_5
5206 #undef DEF_POINTER_TYPE
5211 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5212 NONANSI_P, ATTRS, IMPLICIT, COND) \
5213 if (NAME && COND) \
5214 def_builtin_1 (ENUM, NAME, CLASS, \
5215 builtin_types[(int) TYPE], \
5216 builtin_types[(int) LIBTYPE], \
5217 BOTH_P, FALLBACK_P, NONANSI_P, \
5218 built_in_attributes[(int) ATTRS], IMPLICIT);
5220 #undef DEF_BUILTIN
5228 }
5230 /* Like get_identifier, but avoid warnings about null arguments when
5231 the argument may be NULL for targets where GCC lacks stdint.h type
5232 information. */
5236 {
5238 }
5240 /* Build tree nodes and builtin functions common to both C and C++ language
5241 frontends. */
5243 void
5245 {
5249 tree array_domain_type;
5250 tree va_list_ref_type_node;
5251 tree va_list_arg_type_node;
5255 /* Define `int' and `char' first so that dbx will output them first. */
5259 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5260 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5261 but not C. Are the conditionals here needed? */
5267 long_unsigned_type_node);
5269 {
5271 int128_integer_type_node);
5273 int128_unsigned_type_node);
5274 }
5278 long_long_integer_type_node);
5280 long_long_unsigned_type_node);
5283 long_long_unsigned_type_node);
5286 short_unsigned_type_node);
5289 short_unsigned_type_node);
5291 /* Define both `signed char' and `unsigned char'. */
5295 /* These are types that c_common_type_for_size and
5296 c_common_type_for_mode use. */
5299 intQI_type_node));
5302 intHI_type_node));
5305 intSI_type_node));
5308 intDI_type_node));
5309 #if HOST_BITS_PER_WIDE_INT >= 64
5312 TYPE_DECL,
5314 intTI_type_node));
5315 #endif
5318 unsigned_intQI_type_node));
5321 unsigned_intHI_type_node));
5324 unsigned_intSI_type_node));
5327 unsigned_intDI_type_node));
5328 #if HOST_BITS_PER_WIDE_INT >= 64
5331 TYPE_DECL,
5333 unsigned_intTI_type_node));
5334 #endif
5336 /* Create the widest literal types. */
5337 widest_integer_literal_type_node
5341 widest_integer_literal_type_node));
5343 widest_unsigned_literal_type_node
5347 widest_unsigned_literal_type_node));
5351 pid_type_node =
5358 /* Only supported decimal floating point extension if the target
5359 actually supports underlying modes. */
5363 {
5367 }
5370 {
5375 long_long_fract_type_node);
5377 unsigned_short_fract_type_node);
5379 unsigned_fract_type_node);
5381 unsigned_long_fract_type_node);
5383 unsigned_long_long_fract_type_node);
5385 sat_short_fract_type_node);
5388 sat_long_fract_type_node);
5390 sat_long_long_fract_type_node);
5392 sat_unsigned_short_fract_type_node);
5394 sat_unsigned_fract_type_node);
5396 sat_unsigned_long_fract_type_node);
5398 sat_unsigned_long_long_fract_type_node);
5403 long_long_accum_type_node);
5405 unsigned_short_accum_type_node);
5407 unsigned_accum_type_node);
5409 unsigned_long_accum_type_node);
5411 unsigned_long_long_accum_type_node);
5413 sat_short_accum_type_node);
5416 sat_long_accum_type_node);
5418 sat_long_long_accum_type_node);
5420 sat_unsigned_short_accum_type_node);
5422 sat_unsigned_accum_type_node);
5424 sat_unsigned_long_accum_type_node);
5426 sat_unsigned_long_long_accum_type_node);
5428 }
5431 TYPE_DECL,
5433 complex_integer_type_node));
5435 TYPE_DECL,
5437 complex_float_type_node));
5439 TYPE_DECL,
5441 complex_double_type_node));
5445 complex_long_double_type_node));
5448 /* For C++, make fileptr_type_node a distinct void * type until
5449 FILE type is defined. */
5454 /* Set the TYPE_NAME for any variants that were built before
5455 record_builtin_type gave names to the built-in types. */
5456 {
5462 }
5464 /* This node must not be shared. */
5470 /* Make a type to be the domain of a few array types
5471 whose domains don't really matter.
5472 200 is small enough that it always fits in size_t
5473 and large enough that it can hold most function names for the
5474 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5477 /* Make a type for arrays of characters.
5478 With luck nothing will ever really depend on the length of this
5479 array type. */
5480 char_array_type_node
5483 /* Likewise for arrays of ints. */
5484 int_array_type_node
5488 const_string_type_node
5492 /* This is special for C++ so functions can be overloaded. */
5498 {
5501 else
5504 }
5506 /* This is for wide string constants. */
5507 wchar_array_type_node
5510 /* Define 'char16_t'. */
5515 {
5520 }
5522 /* This is for UTF-16 string constants. */
5523 char16_array_type_node
5526 /* Define 'char32_t'. */
5531 {
5536 }
5538 /* This is for UTF-32 string constants. */
5539 char32_array_type_node
5542 wint_type_node =
5545 intmax_type_node =
5547 uintmax_type_node =
5551 sig_atomic_type_node =
5554 int8_type_node =
5557 int16_type_node =
5560 int32_type_node =
5563 int64_type_node =
5566 uint8_type_node =
5569 c_uint16_type_node =
5572 c_uint32_type_node =
5575 c_uint64_type_node =
5578 int_least8_type_node =
5581 int_least16_type_node =
5584 int_least32_type_node =
5587 int_least64_type_node =
5590 uint_least8_type_node =
5593 uint_least16_type_node =
5596 uint_least32_type_node =
5599 uint_least64_type_node =
5602 int_fast8_type_node =
5605 int_fast16_type_node =
5608 int_fast32_type_node =
5611 int_fast64_type_node =
5614 uint_fast8_type_node =
5617 uint_fast16_type_node =
5620 uint_fast32_type_node =
5623 uint_fast64_type_node =
5626 intptr_type_node =
5629 uintptr_type_node =
5632 default_function_type
5634 ptrdiff_type_node
5641 va_list_type_node));
5643 {
5646 tree ptype;
5649 {
5653 ptype));
5655 }
5656 }
5659 {
5662 }
5663 else
5664 {
5667 }
5674 /* Create the built-in __null node. It is important that this is
5675 not shared. */
5679 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5681 }
5683 /* The number of named compound-literals generated thus far. */
5686 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5688 void
5690 {
5693 compound_literal_number);
5694 compound_literal_number++;
5696 }
5698 tree
5700 {
5704 }
5707 /* Linked list of disabled built-in functions. */
5710 {
5718 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5719 begins with "__builtin_", give an error. */
5721 void
5723 {
5726 else
5727 {
5732 }
5733 }
5736 /* Return true if the built-in function NAME has been disabled, false
5737 otherwise. */
5739 static bool
5741 {
5744 {
5747 }
5749 }
5752 /* Worker for DEF_BUILTIN.
5753 Possibly define a builtin function with one or two names.
5754 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5755 nonansi_p and flag_no_nonansi_builtin. */
5757 static void
5764 {
5765 tree decl;
5778 fnattrs);
5787 }
5788 \f
5789 /* Nonzero if the type T promotes to int. This is (nearly) the
5790 integral promotions defined in ISO C99 6.3.1.1/2. */
5792 bool
5794 {
5796 {
5806 /* ??? Technically all enumerations not larger than an int
5807 promote to an int. But this is used along code paths
5808 that only want to notice a size change. */
5816 }
5817 }
5819 /* Return 1 if PARMS specifies a fixed number of parameters
5820 and none of their types is affected by default promotions. */
5822 int
5824 {
5825 const_tree t;
5827 {
5844 }
5846 }
5848 /* Recursively remove any '*' or '&' operator from TYPE. */
5849 tree
5851 {
5855 }
5857 /* Recursively remove pointer or array type from TYPE. */
5858 tree
5860 {
5864 }
5866 /* Used to compare case labels. K1 and K2 are actually tree nodes
5867 representing case labels, or NULL_TREE for a `default' label.
5868 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5869 K2, and 0 if K1 and K2 are equal. */
5871 int
5873 {
5874 /* Consider a NULL key (such as arises with a `default' label) to be
5875 smaller than anything else. */
5882 }
5884 /* Process a case label, located at LOC, for the range LOW_VALUE
5885 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5886 then this case label is actually a `default' label. If only
5887 HIGH_VALUE is NULL_TREE, then case label was declared using the
5888 usual C/C++ syntax, rather than the GNU case range extension.
5889 CASES is a tree containing all the case ranges processed so far;
5890 COND is the condition for the switch-statement itself. Returns the
5891 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5892 is created. */
5894 tree
5897 {
5898 tree type;
5899 tree label;
5900 tree case_label;
5901 splay_tree_node node;
5903 /* Create the LABEL_DECL itself. */
5906 /* If there was an error processing the switch condition, bail now
5907 before we get more confused. */
5915 {
5918 }
5920 /* Case ranges are a GNU extension. */
5927 {
5932 }
5934 {
5939 }
5942 {
5943 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5944 really a case range, even though it was written that way.
5945 Remove the HIGH_VALUE to simplify later processing. */
5950 }
5952 /* See if the case is in range of the type of the original testing
5953 expression. If both low_value and high_value are out of range,
5954 don't insert the case label and return NULL_TREE. */
5960 /* Look up the LOW_VALUE in the table of case labels we already
5961 have. */
5963 /* If there was not an exact match, check for overlapping ranges.
5964 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5965 that's a `default' label and the only overlap is an exact match. */
5967 {
5968 splay_tree_node low_bound;
5969 splay_tree_node high_bound;
5971 /* Even though there wasn't an exact match, there might be an
5972 overlap between this case range and another case range.
5973 Since we've (inductively) not allowed any overlapping case
5974 ranges, we simply need to find the greatest low case label
5975 that is smaller that LOW_VALUE, and the smallest low case
5976 label that is greater than LOW_VALUE. If there is an overlap
5977 it will occur in one of these two ranges. */
5983 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5984 the LOW_VALUE, so there is no need to check unless the
5985 LOW_BOUND is in fact itself a case range. */
5991 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5992 range is bigger than the low end of the current range, so we
5993 are only interested if the current range is a real range, and
5994 not an ordinary case label. */
5996 && high_value
5998 high_value)
6001 }
6002 /* If there was an overlap, issue an error. */
6004 {
6008 {
6012 }
6014 {
6017 }
6018 else
6019 {
6023 }
6025 }
6027 /* Add a CASE_LABEL to the statement-tree. */
6029 /* Register this case label in the splay tree. */
6036 error_out:
6037 /* Add a label so that the back-end doesn't think that the beginning of
6038 the switch is unreachable. Note that we do not add a case label, as
6039 that just leads to duplicates and thence to failure later on. */
6041 {
6044 }
6046 }
6048 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6049 Used to verify that case values match up with enumerator values. */
6051 static void
6053 {
6056 /* ??? Not working too hard to print the double-word value.
6057 Should perhaps be done with %lwd in the diagnostic routines? */
6066 else
6075 buf);
6076 else
6081 }
6083 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6084 Used to verify that case values match up with enumerator values. */
6086 static int
6088 {
6092 /* Skip default case. */
6096 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6097 when we did our enum->case scan. Reset our scratch bit after. */
6100 else
6103 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6104 not set, that means that CASE_HIGH did not appear when we did our
6105 enum->case scan. Reset our scratch bit after. */
6107 {
6110 else
6112 }
6115 }
6117 /* Handle -Wswitch*. Called from the front end after parsing the
6118 switch construct. */
6119 /* ??? Should probably be somewhere generic, since other languages
6120 besides C and C++ would want this. At the moment, however, C/C++
6121 are the only tree-ssa languages that support enumerations at all,
6122 so the point is moot. */
6124 void
6127 {
6128 splay_tree_node default_node;
6129 splay_tree_node node;
6130 tree chain;
6140 /* From here on, we only care about about enumerated types. */
6144 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6148 /* Check the cases. Warn about case values which are not members of
6149 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6150 there is no default case, check that exactly all enumeration
6151 literals are covered by the cases. */
6153 /* Clearing COND if it is not an integer constant simplifies
6154 the tests inside the loop below. */
6158 /* The time complexity here is O(N*lg(N)) worst case, but for the
6159 common case of monotonically increasing enumerators, it is
6160 O(N), since the nature of the splay tree will keep the next
6161 element adjacent to the root at all times. */
6164 {
6170 {
6171 /* Mark the CASE_LOW part of the case entry as seen. */
6175 }
6177 /* Even though there wasn't an exact match, there might be a
6178 case range which includes the enumerator's value. */
6181 {
6185 {
6186 /* If we match the upper bound exactly, mark the CASE_HIGH
6187 part of the case entry as seen. */
6191 }
6192 }
6194 /* We've now determined that this enumerated literal isn't
6195 handled by the case labels of the switch statement. */
6197 /* If the switch expression is a constant, we only really care
6198 about whether that constant is handled by the switch. */
6202 /* If there is a default_node, the only relevant option is
6203 Wswitch-enum. Otherwise, if both are enabled then we prefer
6204 to warn using -Wswitch because -Wswitch is enabled by -Wall
6205 while -Wswitch-enum is explicit. */
6208 ? OPT_Wswitch_enum
6212 }
6214 /* Warn if there are case expressions that don't correspond to
6215 enumerators. This can occur since C and C++ don't enforce
6216 type-checking of assignments to enumeration variables.
6218 The time complexity here is now always O(N) worst case, since
6219 we should have marked both the lower bound and upper bound of
6220 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6221 above. This scan also resets those fields. */
6224 }
6226 /* Finish an expression taking the address of LABEL (an
6227 IDENTIFIER_NODE). Returns an expression for the address.
6229 LOC is the location for the expression returned. */
6231 tree
6233 {
6234 tree result;
6244 else
6245 {
6248 /* The current function is not necessarily uninlinable.
6249 Computed gotos are incompatible with inlining, but the value
6250 here could be used only in a diagnostic, for example. */
6252 }
6255 }
6256 \f
6258 /* Given a boolean expression ARG, return a tree representing an increment
6259 or decrement (as indicated by CODE) of ARG. The front end must check for
6260 invalid cases (e.g., decrement in C++). */
6261 tree
6263 {
6264 tree val;
6269 {
6292 }
6295 }
6296 \f
6297 /* Built-in macros for stddef.h and stdint.h, that require macros
6298 defined in this file. */
6299 void
6301 {
6364 }
6366 static void
6368 {
6369 /* Fill in the built_in_attributes array. */
6370 #define DEF_ATTR_NULL_TREE(ENUM) \
6371 built_in_attributes[(int) ENUM] = NULL_TREE;
6372 #define DEF_ATTR_INT(ENUM, VALUE) \
6373 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6374 #define DEF_ATTR_STRING(ENUM, VALUE) \
6375 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6376 #define DEF_ATTR_IDENT(ENUM, STRING) \
6377 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6378 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6379 built_in_attributes[(int) ENUM] \
6380 = tree_cons (built_in_attributes[(int) PURPOSE], \
6381 built_in_attributes[(int) VALUE], \
6382 built_in_attributes[(int) CHAIN]);
6384 #undef DEF_ATTR_NULL_TREE
6385 #undef DEF_ATTR_INT
6386 #undef DEF_ATTR_IDENT
6387 #undef DEF_ATTR_TREE_LIST
6388 }
6390 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6391 identifier as an argument, so the front end shouldn't look it up. */
6393 bool
6395 {
6398 /* Unknown attribute that we'll end up ignoring, return true so we
6399 don't complain about an identifier argument. */
6405 else
6407 }
6409 /* Attribute handlers common to C front ends. */
6411 /* Handle a "packed" attribute; arguments as in
6412 struct attribute_spec.handler. */
6414 static tree
6417 {
6419 {
6423 }
6425 {
6427 /* Still pack bitfields. */
6432 else
6434 }
6435 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6436 used for DECL_REGISTER. It wouldn't mean anything anyway.
6437 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6438 that changes what the typedef is typing. */
6439 else
6440 {
6443 }
6446 }
6448 /* Handle a "nocommon" attribute; arguments as in
6449 struct attribute_spec.handler. */
6451 static tree
6455 {
6458 else
6459 {
6462 }
6465 }
6467 /* Handle a "common" attribute; arguments as in
6468 struct attribute_spec.handler. */
6470 static tree
6473 {
6476 else
6477 {
6480 }
6483 }
6485 /* Handle a "noreturn" attribute; arguments as in
6486 struct attribute_spec.handler. */
6488 static tree
6491 {
6494 /* See FIXME comment in c_common_attribute_table. */
6501 = build_pointer_type
6504 else
6505 {
6508 }
6511 }
6513 /* Handle a "hot" and attribute; arguments as in
6514 struct attribute_spec.handler. */
6516 static tree
6519 {
6522 {
6524 {
6528 }
6529 /* Most of the rest of the hot processing is done later with
6530 lookup_attribute. */
6531 }
6532 else
6533 {
6536 }
6539 }
6541 /* Handle a "cold" and attribute; arguments as in
6542 struct attribute_spec.handler. */
6544 static tree
6547 {
6550 {
6552 {
6556 }
6557 /* Most of the rest of the cold processing is done later with
6558 lookup_attribute. */
6559 }
6560 else
6561 {
6564 }
6567 }
6569 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6570 struct attribute_spec.handler. */
6572 static tree
6575 {
6577 {
6580 }
6583 }
6585 /* Handle a "noinline" attribute; arguments as in
6586 struct attribute_spec.handler. */
6588 static tree
6592 {
6595 else
6596 {
6599 }
6602 }
6604 /* Handle a "noclone" attribute; arguments as in
6605 struct attribute_spec.handler. */
6607 static tree
6611 {
6613 {
6616 }
6619 }
6621 /* Handle a "always_inline" attribute; arguments as in
6622 struct attribute_spec.handler. */
6624 static tree
6629 {
6631 {
6632 /* Set the attribute and mark it for disregarding inline
6633 limits. */
6635 }
6636 else
6637 {
6640 }
6643 }
6645 /* Handle a "gnu_inline" attribute; arguments as in
6646 struct attribute_spec.handler. */
6648 static tree
6653 {
6655 {
6656 /* Do nothing else, just set the attribute. We'll get at
6657 it later with lookup_attribute. */
6658 }
6659 else
6660 {
6663 }
6666 }
6668 /* Handle a "leaf" attribute; arguments as in
6669 struct attribute_spec.handler. */
6671 static tree
6675 {
6677 {
6680 }
6682 {
6685 }
6688 }
6690 /* Handle an "artificial" attribute; arguments as in
6691 struct attribute_spec.handler. */
6693 static tree
6698 {
6700 {
6701 /* Do nothing else, just set the attribute. We'll get at
6702 it later with lookup_attribute. */
6703 }
6704 else
6705 {
6708 }
6711 }
6713 /* Handle a "flatten" attribute; arguments as in
6714 struct attribute_spec.handler. */
6716 static tree
6718 tree args ATTRIBUTE_UNUSED,
6720 {
6722 /* Do nothing else, just set the attribute. We'll get at
6723 it later with lookup_attribute. */
6724 ;
6725 else
6726 {
6729 }
6732 }
6734 /* Handle a "warning" or "error" attribute; arguments as in
6735 struct attribute_spec.handler. */
6737 static tree
6740 {
6743 /* Do nothing else, just set the attribute. We'll get at
6744 it later with lookup_attribute. */
6745 ;
6746 else
6747 {
6750 }
6753 }
6755 /* Handle a "used" attribute; arguments as in
6756 struct attribute_spec.handler. */
6758 static tree
6761 {
6767 {
6772 }
6773 else
6774 {
6777 }
6780 }
6782 /* Handle a "unused" attribute; arguments as in
6783 struct attribute_spec.handler. */
6785 static tree
6788 {
6790 {
6798 {
6803 }
6804 else
6805 {
6808 }
6809 }
6810 else
6811 {
6815 }
6818 }
6820 /* Handle a "externally_visible" attribute; arguments as in
6821 struct attribute_spec.handler. */
6823 static tree
6828 {
6832 {
6835 {
6839 }
6840 }
6841 else
6842 {
6845 }
6848 }
6850 /* Handle a "const" attribute; arguments as in
6851 struct attribute_spec.handler. */
6853 static tree
6856 {
6859 /* See FIXME comment on noreturn in c_common_attribute_table. */
6865 = build_pointer_type
6868 else
6869 {
6872 }
6875 }
6877 /* Handle a "transparent_union" attribute; arguments as in
6878 struct attribute_spec.handler. */
6880 static tree
6884 {
6885 tree type;
6896 {
6897 /* Make sure that the first field will work for a transparent union.
6898 If the type isn't complete yet, leave the check to the code in
6899 finish_struct. */
6901 {
6907 }
6910 {
6911 /* If the type isn't complete yet, setting the flag
6912 on a variant wouldn't ever be checked. */
6916 /* build_duplicate_type doesn't work for C++. */
6920 /* A type variant isn't good enough, since we don't a cast
6921 to such a type removed as a no-op. */
6923 }
6927 }
6929 ignored:
6932 }
6934 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6935 get the requested priority for a constructor or destructor,
6936 possibly issuing diagnostics for invalid or reserved
6937 priorities. */
6939 static priority_type
6941 {
6942 HOST_WIDE_INT pri;
6943 tree arg;
6949 {
6952 else
6955 }
6968 {
6971 "destructor priorities from 0 to %d are reserved "
6973 MAX_RESERVED_INIT_PRIORITY);
6974 else
6976 "constructor priorities from 0 to %d are reserved "
6978 MAX_RESERVED_INIT_PRIORITY);
6979 }
6982 invalid:
6985 MAX_INIT_PRIORITY);
6986 else
6988 MAX_INIT_PRIORITY);
6990 }
6992 /* Handle a "constructor" attribute; arguments as in
6993 struct attribute_spec.handler. */
6995 static tree
6999 {
7006 {
7007 priority_type priority;
7012 }
7013 else
7014 {
7017 }
7020 }
7022 /* Handle a "destructor" attribute; arguments as in
7023 struct attribute_spec.handler. */
7025 static tree
7029 {
7036 {
7037 priority_type priority;
7042 }
7043 else
7044 {
7047 }
7050 }
7052 /* Nonzero if the mode is a valid vector mode for this architecture.
7053 This returns nonzero even if there is no hardware support for the
7054 vector mode, but we can emulate with narrower modes. */
7056 static int
7058 {
7062 /* Doh! What's going on? */
7071 /* Hardware support. Woo hoo! */
7077 /* We should probably return 1 if requesting V4DI and we have no DI,
7078 but we have V2DI, but this is probably very unlikely. */
7080 /* If we have support for the inner mode, we can safely emulate it.
7081 We may not have V2DI, but me can emulate with a pair of DIs. */
7083 }
7086 /* Handle a "mode" attribute; arguments as in
7087 struct attribute_spec.handler. */
7089 static tree
7092 {
7100 else
7101 {
7106 tree typefm;
7111 {
7117 }
7119 /* Change this type to have a type with the specified mode.
7120 First check for the special modes. */
7133 else
7136 {
7139 }
7142 {
7145 }
7149 {
7181 }
7183 {
7186 }
7189 {
7194 {
7197 }
7201 else
7204 }
7205 else
7206 {
7207 /* For fixed-point modes, we need to test if the signness of type
7208 and the machine mode are consistent. */
7211 {
7214 }
7215 /* For fixed-point modes, we need to pass saturating info. */
7219 }
7222 {
7225 }
7227 {
7228 /* For enumeral types, copy the precision from the integer
7229 type returned above. If not an INTEGER_TYPE, we can't use
7230 this mode for this type. */
7232 {
7235 }
7238 {
7241 }
7242 else
7243 {
7244 /* We cannot build a type variant, as there's code that assumes
7245 that TYPE_MAIN_VARIANT has the same mode. This includes the
7246 debug generators. Instead, create a subrange type. This
7247 results in all of the enumeral values being emitted only once
7248 in the original, and the subtype gets them by reference. */
7251 else
7254 }
7255 }
7259 {
7262 }
7265 }
7268 }
7270 /* Handle a "section" attribute; arguments as in
7271 struct attribute_spec.handler. */
7273 static tree
7276 {
7280 {
7286 {
7290 {
7292 "section attribute cannot be specified for "
7295 }
7297 /* The decl may have already been given a section attribute
7298 from a previous declaration. Ensure they match. */
7302 {
7306 }
7310 {
7313 }
7314 else
7316 }
7317 else
7318 {
7321 }
7322 }
7323 else
7324 {
7328 }
7331 }
7333 /* Check whether ALIGN is a valid user-specified alignment. If so,
7334 return its base-2 log; if not, output an error and return -1. If
7335 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7336 no error. */
7337 int
7339 {
7344 {
7347 }
7351 {
7354 }
7356 {
7359 }
7361 }
7363 /*
7364 If in c++-11, check if the c++-11 alignment constraint with respect
7365 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7366 c++-11 mode, does nothing.
7368 [dcl.align]2/ says:
7370 [* if the constant expression evaluates to a fundamental alignment,
7371 the alignment requirement of the declared entity shall be the
7372 specified fundamental alignment.
7374 * if the constant expression evaluates to an extended alignment
7375 and the implementation supports that alignment in the context
7376 of the declaration, the alignment of the declared entity shall
7377 be that alignment
7379 * if the constant expression evaluates to an extended alignment
7380 and the implementation does not support that alignment in the
7381 context of the declaration, the program is ill-formed]. */
7383 static bool
7387 {
7400 {
7402 {
7403 /* For file scope variables and static members, the target
7404 supports alignments that are at most
7405 MAX_OFILE_ALIGNMENT. */
7408 }
7409 else
7410 {
7411 #ifdef BIGGEST_FIELD_ALIGNMENT
7412 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7413 #else
7414 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7415 #endif
7416 /* For non-static members, the target supports either
7417 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7418 if it is defined or BIGGEST_ALIGNMENT. */
7423 #undef MAX_TARGET_FIELD_ALIGNMENT
7424 /* For stack variables, the target supports at most
7425 MAX_STACK_ALIGNMENT. */
7429 }
7430 }
7432 {
7433 /* Let's be liberal for types. */
7436 }
7444 }
7446 /* Handle a "aligned" attribute; arguments as in
7447 struct attribute_spec.handler. */
7449 static tree
7452 {
7461 {
7465 }
7473 {
7476 /* If we have a TYPE_DECL, then copy the type, so that we
7477 don't accidentally modify a builtin type. See pushdecl. */
7480 {
7487 }
7488 else
7493 }
7496 {
7499 }
7502 /* C++-11 [dcl.align/4]:
7504 When multiple alignment-specifiers are specified for an
7505 entity, the alignment requirement shall be set to the
7506 strictest specified alignment.
7508 This formally comes from the c++11 specification but we are
7509 doing it for the GNU attribute syntax as well. */
7513 {
7518 else
7522 }
7523 else
7524 {
7527 }
7530 }
7532 /* Handle a "weak" attribute; arguments as in
7533 struct attribute_spec.handler. */
7535 static tree
7540 {
7543 {
7546 }
7548 {
7552 }
7556 else
7560 }
7562 /* Handle an "alias" or "ifunc" attribute; arguments as in
7563 struct attribute_spec.handler, except that IS_ALIAS tells us
7564 whether this is an alias as opposed to ifunc attribute. */
7566 static tree
7569 {
7574 {
7577 }
7581 /* A static variable declaration is always a tentative definition,
7582 but the alias is a non-tentative definition which overrides. */
7585 {
7589 }
7593 {
7597 }
7599 /* Note that the very first time we process a nested declaration,
7600 decl_function_context will not be set. Indeed, *would* never
7601 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7602 we do below. After such frobbery, pushdecl would set the context.
7603 In any case, this is never what we want. */
7605 {
7606 tree id;
7610 {
7614 }
7616 /* This counts as a use of the object pointed to. */
7621 else
7622 {
7625 else
7628 }
7631 /* ifuncs are also aliases, so set that attribute too. */
7634 }
7635 else
7636 {
7639 }
7642 }
7644 /* Handle an "alias" or "ifunc" attribute; arguments as in
7645 struct attribute_spec.handler. */
7647 static tree
7650 {
7652 }
7654 /* Handle an "alias" or "ifunc" attribute; arguments as in
7655 struct attribute_spec.handler. */
7657 static tree
7660 {
7662 }
7664 /* Handle a "weakref" attribute; arguments as in struct
7665 attribute_spec.handler. */
7667 static tree
7670 {
7673 /* We must ignore the attribute when it is associated with
7674 local-scoped decls, since attribute alias is ignored and many
7675 such symbols do not even have a DECL_WEAK field. */
7677 || current_function_decl
7679 {
7683 }
7686 {
7690 }
7692 /* The idea here is that `weakref("name")' mutates into `weakref,
7693 alias("name")', and weakref without arguments, in turn,
7694 implicitly adds weak. */
7697 {
7704 }
7705 else
7706 {
7711 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7712 and that isn't supported; and because it wants to add it to
7713 the list of weak decls, which isn't helpful. */
7715 }
7718 }
7720 /* Handle an "visibility" attribute; arguments as in
7721 struct attribute_spec.handler. */
7723 static tree
7727 {
7733 {
7737 {
7739 name);
7741 }
7743 {
7747 }
7748 }
7750 {
7753 }
7756 {
7759 }
7761 /* If this is a type, set the visibility on the type decl. */
7763 {
7768 {
7770 name);
7772 }
7773 }
7783 else
7784 {
7785 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7787 }
7791 {
7805 }
7810 /* Go ahead and attach the attribute to the node as well. This is needed
7811 so we can determine whether we have VISIBILITY_DEFAULT because the
7812 visibility was not specified, or because it was explicitly overridden
7813 from the containing scope. */
7816 }
7818 /* Determine the ELF symbol visibility for DECL, which is either a
7819 variable or a function. It is an error to use this function if a
7820 definition of DECL is not available in this translation unit.
7821 Returns true if the final visibility has been determined by this
7822 function; false if the caller is free to make additional
7823 modifications. */
7825 bool
7827 {
7831 /* If the user explicitly specified the visibility with an
7832 attribute, honor that. DECL_VISIBILITY will have been set during
7833 the processing of the attribute. We check for an explicit
7834 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7835 to distinguish the use of an attribute from the use of a "#pragma
7836 GCC visibility push(...)"; in the latter case we still want other
7837 considerations to be able to overrule the #pragma. */
7839 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7844 /* Set default visibility to whatever the user supplied with
7845 visibility_specified depending on #pragma GCC visibility. */
7847 {
7850 {
7853 /* If visibility changed and DECL already has DECL_RTL, ensure
7854 symbol flags are updated. */
7859 }
7860 }
7862 }
7864 /* Handle an "tls_model" attribute; arguments as in
7865 struct attribute_spec.handler. */
7867 static tree
7870 {
7871 tree id;
7878 {
7881 }
7886 {
7889 }
7899 else
7900 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7904 }
7906 /* Handle a "no_instrument_function" attribute; arguments as in
7907 struct attribute_spec.handler. */
7909 static tree
7914 {
7918 {
7922 }
7924 {
7928 }
7929 else
7933 }
7935 /* Handle a "malloc" attribute; arguments as in
7936 struct attribute_spec.handler. */
7938 static tree
7941 {
7945 else
7946 {
7949 }
7952 }
7954 /* Handle a "alloc_size" attribute; arguments as in
7955 struct attribute_spec.handler. */
7957 static tree
7960 {
7963 {
7970 {
7975 }
7976 }
7978 }
7980 /* Handle a "fn spec" attribute; arguments as in
7981 struct attribute_spec.handler. */
7983 static tree
7987 {
7992 }
7994 /* Handle a "returns_twice" attribute; arguments as in
7995 struct attribute_spec.handler. */
7997 static tree
8000 {
8003 else
8004 {
8007 }
8010 }
8012 /* Handle a "no_limit_stack" attribute; arguments as in
8013 struct attribute_spec.handler. */
8015 static tree
8020 {
8024 {
8028 }
8030 {
8034 }
8035 else
8039 }
8041 /* Handle a "pure" attribute; arguments as in
8042 struct attribute_spec.handler. */
8044 static tree
8047 {
8050 /* ??? TODO: Support types. */
8051 else
8052 {
8055 }
8058 }
8060 /* Digest an attribute list destined for a transactional memory statement.
8061 ALLOWED is the set of attributes that are allowed for this statement;
8062 return the attribute we parsed. Multiple attributes are never allowed. */
8064 int
8066 {
8071 {
8079 {
8082 }
8085 {
8088 }
8091 else
8093 }
8096 }
8098 /* Transform a TM attribute name into a maskable integer and back.
8099 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8100 to how the lack of an attribute is treated. */
8102 int
8104 {
8118 }
8120 tree
8122 {
8125 {
8143 }
8145 }
8147 /* Return the first TM attribute seen in LIST. */
8149 tree
8151 {
8153 {
8157 }
8159 }
8161 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8162 Here we accept only function types, and verify that none of the other
8163 function TM attributes are also applied. */
8164 /* ??? We need to accept class types for C++, but not C. This greatly
8165 complicates this function, since we can no longer rely on the extra
8166 processing given by function_type_required. */
8168 static tree
8171 {
8172 /* Only one path adds the attribute; others don't. */
8176 {
8179 /* Only tm_callable and tm_safe apply to classes. */
8182 /* FALLTHRU */
8186 {
8189 ;
8192 else
8194 }
8198 {
8201 {
8206 }
8207 }
8208 /* FALLTHRU */
8211 /* If a function is next, pass it on to be tried next. */
8215 ignored:
8218 }
8221 }
8223 /* Handle the TM_WRAP attribute; arguments as in
8224 struct attribute_spec.handler. */
8226 static tree
8229 {
8232 /* We don't need the attribute even on success, since we
8233 record the entry in an external table. */
8238 else
8239 {
8245 else
8246 {
8250 {
8254 else
8256 }
8257 else
8259 }
8260 }
8263 }
8265 /* Ignore the given attribute. Used when this attribute may be usefully
8266 overridden by the target, but is not used generically. */
8268 static tree
8272 {
8275 }
8277 /* Handle a "no vops" attribute; arguments as in
8278 struct attribute_spec.handler. */
8280 static tree
8284 {
8288 }
8290 /* Handle a "deprecated" attribute; arguments as in
8291 struct attribute_spec.handler. */
8293 static tree
8297 {
8305 {
8308 }
8311 {
8322 else
8324 }
8326 {
8331 }
8332 else
8336 {
8339 {
8345 }
8348 else
8350 }
8353 }
8355 /* Handle a "vector_size" attribute; arguments as in
8356 struct attribute_spec.handler. */
8358 static tree
8362 {
8372 {
8375 }
8377 /* Get the vector size (in bytes). */
8380 /* We need to provide for vector pointers, vector arrays, and
8381 functions returning vectors. For example:
8383 __attribute__((vector_size(16))) short *foo;
8385 In this case, the mode is SI, but the type being modified is
8386 HI, so we need to look further. */
8395 /* Get the mode of the type being modified. */
8406 {
8409 }
8412 {
8415 }
8418 {
8421 }
8423 /* Calculate how many units fit in the vector. */
8426 {
8429 }
8433 /* Build back pointers if needed. */
8437 }
8439 /* Handle the "nonnull" attribute. */
8440 static tree
8444 {
8448 /* If no arguments are specified, all pointer arguments should be
8449 non-null. Verify a full prototype is given so that the arguments
8450 will have the correct types when we actually check them later. */
8452 {
8454 {
8457 }
8459 }
8461 /* Argument list specified. Verify that each argument number references
8462 a pointer argument. */
8464 {
8468 {
8473 }
8476 {
8477 function_args_iterator iter;
8478 tree argument;
8482 {
8486 }
8490 {
8495 }
8498 {
8503 }
8504 }
8505 }
8508 }
8510 /* Check the argument list of a function call for null in argument slots
8511 that are marked as requiring a non-null pointer argument. The NARGS
8512 arguments are passed in the array ARGARRAY.
8513 */
8515 static void
8517 {
8518 tree a;
8526 /* See if any of the nonnull attributes has no arguments. If so,
8527 then every pointer argument is checked (in which case the check
8528 for pointer type is done in check_nonnull_arg). */
8530 do
8538 else
8539 {
8540 /* Walk the argument list. If we encounter an argument number we
8541 should check for non-null, do it. */
8543 {
8545 {
8549 }
8554 }
8555 }
8556 }
8558 /* Check that the Nth argument of a function call (counting backwards
8559 from the end) is a (pointer)0. The NARGS arguments are passed in the
8560 array ARGARRAY. */
8562 static void
8564 {
8568 {
8571 tree sentinel;
8572 function_args_iterator iter;
8573 tree t;
8575 /* Skip over the named arguments. */
8577 {
8580 len++;
8581 }
8584 {
8587 }
8589 /* The sentinel must be one of the varargs, i.e.
8590 in position >= the number of fixed arguments. */
8592 {
8596 }
8598 /* Validate the sentinel. */
8602 /* Although __null (in C++) is only an integer we allow it
8603 nevertheless, as we are guaranteed that it's exactly
8604 as wide as a pointer, and we don't want to force
8605 users to cast the NULL they have written there.
8606 We warn with -Wstrict-null-sentinel, though. */
8609 }
8610 }
8612 /* Helper for check_function_nonnull; given a list of operands which
8613 must be non-null in ARGS, determine if operand PARAM_NUM should be
8614 checked. */
8616 static bool
8618 {
8622 {
8629 }
8631 }
8633 /* Check that the function argument PARAM (which is operand number
8634 PARAM_NUM) is non-null. This is called by check_function_nonnull
8635 via check_function_arguments_recurse. */
8637 static void
8640 {
8641 /* Just skip checking the argument if it's not a pointer. This can
8642 happen if the "nonnull" attribute was given without an operand
8643 list (which means to check every pointer argument). */
8651 }
8653 /* Helper for nonnull attribute handling; fetch the operand number
8654 from the attribute argument list. */
8656 static bool
8658 {
8659 /* Verify the arg number is a constant. */
8666 }
8668 /* Handle a "nothrow" attribute; arguments as in
8669 struct attribute_spec.handler. */
8671 static tree
8674 {
8677 /* ??? TODO: Support types. */
8678 else
8679 {
8682 }
8685 }
8687 /* Handle a "cleanup" attribute; arguments as in
8688 struct attribute_spec.handler. */
8690 static tree
8693 {
8697 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8698 for global destructors in C++. This requires infrastructure that
8699 we don't have generically at the moment. It's also not a feature
8700 we'd be missing too much, since we do have attribute constructor. */
8702 {
8706 }
8708 /* Verify that the argument is a function in scope. */
8709 /* ??? We could support pointers to functions here as well, if
8710 that was considered desirable. */
8713 {
8717 }
8720 {
8724 }
8726 /* That the function has proper type is checked with the
8727 eventual call to build_function_call. */
8730 }
8732 /* Handle a "warn_unused_result" attribute. No special handling. */
8734 static tree
8738 {
8739 /* Ignore the attribute for functions not returning any value. */
8741 {
8744 }
8747 }
8749 /* Handle a "sentinel" attribute. */
8751 static tree
8754 {
8756 {
8760 }
8761 else
8762 {
8764 {
8768 }
8769 }
8772 {
8776 {
8780 }
8781 else
8782 {
8784 {
8788 }
8789 }
8790 }
8793 }
8795 /* Handle a "type_generic" attribute. */
8797 static tree
8801 {
8802 /* Ensure we have a function type. */
8805 /* Ensure we have a variadic function. */
8809 }
8811 /* Handle a "target" attribute. */
8813 static tree
8816 {
8817 /* Ensure we have a function type. */
8819 {
8822 }
8824 flags))
8828 }
8830 /* Arguments being collected for optimization. */
8835 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8836 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8837 false for #pragma GCC optimize. */
8839 bool
8841 {
8849 tree ap;
8851 /* Build up argv vector. Just in case the string is stored away, use garbage
8852 collected strings. */
8857 {
8861 {
8865 }
8868 {
8869 /* Split string into multiple substrings. */
8877 {
8884 {
8888 }
8889 else
8890 {
8893 }
8897 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8898 options. */
8900 {
8905 else
8909 }
8912 {
8915 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8916 itself is -Os, and any other switch begins with a -f. */
8922 }
8927 }
8929 }
8930 }
8940 /* Now parse the options. */
8950 /* Don't allow changing -fstrict-aliasing. */
8955 }
8957 /* For handling "optimize" attribute. arguments as in
8958 struct attribute_spec.handler. */
8960 static tree
8963 {
8964 /* Ensure we have a function type. */
8966 {
8969 }
8970 else
8971 {
8975 /* Save current options. */
8978 /* If we previously had some optimization options, use them as the
8979 default. */
8984 /* Parse options, and update the vector. */
8991 /* Restore current options. */
8993 }
8996 }
8998 /* Handle a "no_split_stack" attribute. */
9000 static tree
9005 {
9009 {
9013 }
9015 {
9019 }
9022 }
9023 \f
9024 /* Check for valid arguments being passed to a function with FNTYPE.
9025 There are NARGS arguments in the array ARGARRAY. */
9026 void
9028 {
9029 /* Check for null being passed in a pointer argument that must be
9030 non-null. We also need to do this if format checking is enabled. */
9035 /* Check for errors in format strings. */
9042 }
9044 /* Generic argument checking recursion routine. PARAM is the argument to
9045 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9046 once the argument is resolved. CTX is context for the callback. */
9047 void
9052 {
9056 {
9057 /* Strip coercion. */
9061 }
9064 {
9066 tree attrs;
9069 /* See if this is a call to a known internationalization function
9070 that modifies a format arg. Such a function may have multiple
9071 format_arg attributes (for example, ngettext). */
9074 attrs;
9077 {
9078 tree inner_arg;
9079 tree format_num_expr;
9082 call_expr_arg_iterator iter;
9084 /* Extract the argument number, which was previously checked
9085 to be valid. */
9097 {
9102 }
9103 }
9105 /* If we found a format_arg attribute and did a recursive check,
9106 we are done with checking this argument. Otherwise, we continue
9107 and this will be considered a non-literal. */
9110 }
9113 {
9114 /* Check both halves of the conditional expression. */
9120 }
9123 }
9125 /* Checks for a builtin function FNDECL that the number of arguments
9126 NARGS against the required number REQUIRED and issues an error if
9127 there is a mismatch. Returns true if the number of arguments is
9128 correct, otherwise false. */
9130 static bool
9132 {
9134 {
9138 }
9140 {
9144 }
9146 }
9148 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9149 Returns false if there was an error, otherwise true. */
9151 bool
9153 {
9159 {
9169 {
9171 {
9175 }
9177 }
9187 {
9194 {
9198 }
9200 }
9205 {
9210 {
9214 }
9217 {
9219 fndecl);
9221 }
9223 }
9228 {
9230 {
9233 }
9235 }
9240 }
9241 }
9243 /* Function to help qsort sort FIELD_DECLs by name order. */
9245 int
9247 {
9252 /* A nontype is "greater" than a type. */
9261 }
9264 gt_pointer_operator new_value;
9268 /* This routine compares two fields like field_decl_cmp but using the
9269 pointer operator in resort_data. */
9271 static int
9273 {
9278 /* A nontype is "greater" than a type. */
9284 {
9291 }
9293 }
9295 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9297 void
9300 gt_pointer_operator new_value,
9302 {
9307 resort_field_decl_cmp);
9308 }
9310 /* Subroutine of c_parse_error.
9311 Return the result of concatenating LHS and RHS. RHS is really
9312 a string literal, its first character is indicated by RHS_START and
9313 RHS_SIZE is its length (including the terminating NUL character).
9315 The caller is responsible for deleting the returned pointer. */
9319 {
9325 }
9327 /* Issue the error given by GMSGID, indicating that it occurred before
9328 TOKEN, which had the associated VALUE. */
9330 void
9333 {
9334 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9344 {
9349 {
9362 }
9366 else
9372 }
9382 {
9387 }
9395 {
9400 }
9401 else
9405 {
9408 }
9409 #undef catenate_messages
9410 }
9412 /* Mapping for cpp message reasons to the options that enable them. */
9414 struct reason_option_codes_t
9415 {
9418 };
9438 };
9440 /* Return the gcc option code associated with the reason for a cpp
9441 message, or 0 if none. */
9443 static int
9445 {
9449 {
9452 }
9454 }
9456 /* Callback from cpp_error for PFILE to print diagnostics from the
9457 preprocessor. The diagnostic is of type LEVEL, with REASON set
9458 to the reason code if LEVEL is represents a warning, at location
9459 LOCATION unless this is after lexing and the compiler's location
9460 should be used instead, with column number possibly overridden by
9461 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9462 the arguments. Returns true if a diagnostic was emitted, false
9463 otherwise. */
9465 bool
9469 {
9470 diagnostic_info diagnostic;
9471 diagnostic_t dlevel;
9476 {
9481 /* Fall through. */
9506 }
9519 }
9521 /* Convert a character from the host to the target execution character
9522 set. cpplib handles this, mostly. */
9524 HOST_WIDE_INT
9526 {
9527 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9528 zero-extended under -fno-signed-char. cpplib insists that characters
9529 and character constants are always unsigned. Hence we must convert
9530 back and forth. */
9538 else
9540 }
9542 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9543 references with an INDIRECT_REF of a constant at the bottom; much like the
9544 traditional rendering of offsetof as a macro. Return the folded result. */
9546 tree
9548 {
9552 {
9568 {
9571 }
9581 {
9585 }
9599 /* Check if the offset goes beyond the upper bound of the array. */
9601 {
9607 {
9611 {
9612 tree v;
9619 {
9627 }
9628 /* Don't warn if the array might be considered a poor
9629 man's flexible array member with a very permissive
9630 definition thereof. */
9634 "index %E denotes an offset "
9637 }
9638 }
9639 }
9646 /* Handle static members of volatile structs. */
9653 }
9656 }
9658 /* Likewise, but convert it to the return type of offsetof. */
9660 tree
9662 {
9664 }
9666 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9667 expression, because B will always be true. */
9669 void
9671 {
9674 "the omitted middle operand in ?: will always be %<true%>, "
9676 }
9678 /* Give an error for storing into ARG, which is 'const'. USE indicates
9679 how ARG was being used. */
9681 void
9683 {
9686 /* Using this macro rather than (for example) arrays of messages
9687 ensures that all the format strings are checked at compile
9688 time. */
9689 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9690 : (use == lv_increment ? (I) \
9691 : (use == lv_decrement ? (D) : (AS))))
9693 {
9704 else
9710 }
9716 arg);
9722 arg);
9724 {
9734 arg);
9735 }
9741 arg);
9742 else
9747 arg);
9748 }
9750 /* Print an error message for an invalid lvalue. USE says
9751 how the lvalue is being used and so selects the error message. LOC
9752 is the location for the error. */
9754 void
9756 {
9758 {
9776 }
9777 }
9779 /* Print an error message for an invalid indirection of type TYPE.
9780 ERRSTRING is the name of the operator for the indirection. */
9782 void
9784 {
9786 {
9794 type);
9799 type);
9804 type);
9809 type);
9813 }
9814 }
9815 \f
9816 /* *PTYPE is an incomplete array. Complete it with a domain based on
9817 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9818 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9819 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9821 int
9823 {
9830 {
9832 {
9833 int eltsize
9836 }
9838 {
9842 {
9846 }
9847 else
9848 {
9849 tree curindex;
9860 {
9864 else
9865 {
9869 size_one_node);
9870 }
9873 }
9876 }
9877 }
9878 else
9879 {
9880 /* Make an error message unless that happened already. */
9883 }
9884 }
9885 else
9886 {
9890 }
9893 /* Force an indefinite layout factor. */
9900 else
9903 /* Using build_distinct_type_copy and modifying things afterward instead
9904 of using build_array_type to create a new type preserves all of the
9905 TYPE_LANG_FLAG_? bits that the front end may have set. */
9913 /* Make sure we have the canonical MAIN_TYPE. */
9916 hashcode);
9919 /* Fix the canonical type. */
9929 else
9934 else
9940 {
9942 /* If we proceed with the array type as it is, we'll eventually
9943 crash in tree_low_cst(). */
9945 }
9949 }
9951 /* Like c_mark_addressable but don't check register qualifier. */
9952 void
9954 {
9960 }
9963 \f
9964 /* Used to help initialize the builtin-types.def table. When a type of
9965 the correct size doesn't exist, use error_mark_node instead of NULL.
9966 The later results in segfaults even when a decl using the type doesn't
9967 get invoked. */
9969 tree
9971 {
9974 }
9976 /* A helper function for resolve_overloaded_builtin in resolving the
9977 overloaded __sync_ builtins. Returns a positive power of 2 if the
9978 first operand of PARAMS is a pointer to a supported data type.
9979 Returns 0 if an error is encountered. */
9981 static int
9983 {
9984 tree type;
9988 {
9991 }
10005 incompatible:
10008 }
10010 /* A helper function for resolve_overloaded_builtin. Adds casts to
10011 PARAMS to make arguments match up with those of FUNCTION. Drops
10012 the variadic arguments at the end. Returns false if some error
10013 was encountered; true on success. */
10015 static bool
10018 {
10019 function_args_iterator iter;
10020 tree ptype;
10024 /* We've declared the implementation functions to use "volatile void *"
10025 as the pointer parameter, so we shouldn't get any complaints from the
10026 call to check_function_arguments what ever type the user used. */
10030 /* For the rest of the values, we need to cast these to FTYPE, so that we
10031 don't get warnings for passing pointer types, etc. */
10034 {
10038 /* XXX void_type_node belies the abstraction. */
10044 {
10047 }
10049 /* Only convert parameters if arg_type is unsigned integer type with
10050 new format sync routines, i.e. don't attempt to convert pointer
10051 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10052 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10053 kinds). */
10055 {
10056 /* Ideally for the first conversion we'd use convert_for_assignment
10057 so that we get warnings for anything that doesn't match the pointer
10058 type. This isn't portable across the C and C++ front ends atm. */
10063 }
10066 }
10068 /* __atomic routines are not variadic. */
10070 {
10073 }
10075 /* The definition of these primitives is variadic, with the remaining
10076 being "an optional list of variables protected by the memory barrier".
10077 No clue what that's supposed to mean, precisely, but we consider all
10078 call-clobbered variables to be protected so we're safe. */
10082 }
10084 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10085 RESULT to make it match the type of the first pointer argument in
10086 PARAMS. */
10088 static tree
10090 {
10095 /* New format doesn't require casting unless the types are the same size. */
10098 else
10100 }
10102 /* This function verifies the PARAMS to generic atomic FUNCTION.
10103 It returns the size if all the parameters are the same size, otherwise
10104 0 is returned if the parameters are invalid. */
10106 static int
10109 {
10114 tree type_0;
10116 /* Determine the parameter makeup. */
10118 {
10134 }
10137 {
10140 }
10142 /* Get type of first parameter, and determine its size. */
10145 {
10147 function);
10149 }
10151 /* Types must be compile time constant sizes. */
10153 {
10156 function);
10158 }
10162 /* Zero size objects are not allowed. */
10164 {
10167 function);
10169 }
10171 /* Check each other parameter is a pointer and the same size. */
10173 {
10176 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
10180 {
10182 function);
10184 }
10187 {
10189 function);
10191 }
10192 }
10194 /* Check memory model parameters for validity. */
10196 {
10199 {
10202 {
10205 function);
10206 }
10207 }
10208 else
10210 {
10212 function);
10214 }
10215 }
10218 }
10221 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10222 at the beginning of the parameter list PARAMS representing the size of the
10223 objects. This is to match the library ABI requirement. LOC is the location
10224 of the function call.
10225 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10226 returned to allow the external call to be constructed. */
10228 static tree
10231 {
10232 tree size_node;
10234 /* Insert a SIZE_T parameter as the first param. If there isn't
10235 enough space, allocate a new vector and recursively re-build with that. */
10237 {
10240 tree f;
10249 }
10251 /* Add the size parameter and leave as a function call for processing. */
10255 }
10258 /* This will process an __atomic_exchange function call, determine whether it
10259 needs to be mapped to the _N variation, or turned into a library call.
10260 LOC is the location of the builtin call.
10261 FUNCTION is the DECL that has been invoked;
10262 PARAMS is the argument list for the call. The return value is non-null
10263 TRUE is returned if it is translated into the proper format for a call to the
10264 external library, and NEW_RETURN is set the tree for that function.
10265 FALSE is returned if processing for the _N variation is required, and
10266 NEW_RETURN is set to the the return value the result is copied into. */
10267 static bool
10270 {
10275 /* Size of 0 is an error condition. */
10277 {
10280 }
10282 /* If not a lock-free size, change to the library generic format. */
10284 {
10287 }
10289 /* Otherwise there is a lockfree match, transform the call from:
10290 void fn(T* mem, T* desired, T* return, model)
10291 into
10292 *return = (T) (fn (In* mem, (In) *desired, model)) */
10299 /* Create pointer to appropriate size. */
10303 /* Convert object pointer to required type. */
10306 /* Convert new value to required type, and dereference it. */
10311 /* Move memory model to the 3rd position, and end param list. */
10315 /* Convert return pointer and dereference it for later assignment. */
10319 }
10322 /* This will process an __atomic_compare_exchange function call, determine
10323 whether it needs to be mapped to the _N variation, or turned into a lib call.
10324 LOC is the location of the builtin call.
10325 FUNCTION is the DECL that has been invoked;
10326 PARAMS is the argument list for the call. The return value is non-null
10327 TRUE is returned if it is translated into the proper format for a call to the
10328 external library, and NEW_RETURN is set the tree for that function.
10329 FALSE is returned if processing for the _N variation is required. */
10331 static bool
10335 {
10340 /* Size of 0 is an error condition. */
10342 {
10345 }
10347 /* If not a lock-free size, change to the library generic format. */
10349 {
10350 /* The library generic format does not have the weak parameter, so
10351 remove it from the param list. Since a parameter has been removed,
10352 we can be sure that there is room for the SIZE_T parameter, meaning
10353 there will not be a recursive rebuilding of the parameter list, so
10354 there is no danger this will be done twice. */
10356 {
10360 }
10363 }
10365 /* Otherwise, there is a match, so the call needs to be transformed from:
10366 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10367 into
10368 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10374 /* Create pointer to appropriate size. */
10378 /* Convert object pointer to required type. */
10382 /* Convert expected pointer to required type. */
10386 /* Convert desired value to required type, and dereference it. */
10391 /* The rest of the parameters are fine. NULL means no special return value
10392 processing.*/
10395 }
10398 /* This will process an __atomic_load function call, determine whether it
10399 needs to be mapped to the _N variation, or turned into a library call.
10400 LOC is the location of the builtin call.
10401 FUNCTION is the DECL that has been invoked;
10402 PARAMS is the argument list for the call. The return value is non-null
10403 TRUE is returned if it is translated into the proper format for a call to the
10404 external library, and NEW_RETURN is set the tree for that function.
10405 FALSE is returned if processing for the _N variation is required, and
10406 NEW_RETURN is set to the the return value the result is copied into. */
10408 static bool
10411 {
10416 /* Size of 0 is an error condition. */
10418 {
10421 }
10423 /* If not a lock-free size, change to the library generic format. */
10425 {
10428 }
10430 /* Otherwise, there is a match, so the call needs to be transformed from:
10431 void fn(T* mem, T* return, model)
10432 into
10433 *return = (T) (fn ((In *) mem, model)) */
10439 /* Create pointer to appropriate size. */
10443 /* Convert object pointer to required type. */
10447 /* Move memory model to the 2nd position, and end param list. */
10451 /* Convert return pointer and dereference it for later assignment. */
10455 }
10458 /* This will process an __atomic_store function call, determine whether it
10459 needs to be mapped to the _N variation, or turned into a library call.
10460 LOC is the location of the builtin call.
10461 FUNCTION is the DECL that has been invoked;
10462 PARAMS is the argument list for the call. The return value is non-null
10463 TRUE is returned if it is translated into the proper format for a call to the
10464 external library, and NEW_RETURN is set the tree for that function.
10465 FALSE is returned if processing for the _N variation is required, and
10466 NEW_RETURN is set to the the return value the result is copied into. */
10468 static bool
10471 {
10476 /* Size of 0 is an error condition. */
10478 {
10481 }
10483 /* If not a lock-free size, change to the library generic format. */
10485 {
10488 }
10490 /* Otherwise, there is a match, so the call needs to be transformed from:
10491 void fn(T* mem, T* value, model)
10492 into
10493 fn ((In *) mem, (In) *value, model) */
10498 /* Create pointer to appropriate size. */
10502 /* Convert object pointer to required type. */
10506 /* Convert new value to required type, and dereference it. */
10511 /* The memory model is in the right spot already. Return is void. */
10515 }
10518 /* Some builtin functions are placeholders for other expressions. This
10519 function should be called immediately after parsing the call expression
10520 before surrounding code has committed to the type of the expression.
10522 LOC is the location of the builtin call.
10524 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10525 PARAMS is the argument list for the call. The return value is non-null
10526 when expansion is complete, and null if normal processing should
10527 continue. */
10529 tree
10532 {
10538 {
10544 else
10548 }
10550 /* Handle BUILT_IN_NORMAL here. */
10552 {
10557 {
10558 /* Handle these 4 together so that they can fall through to the next
10559 case if the call is transformed to an _N variant. */
10561 {
10563 {
10567 /* Change to the _N variant. */
10570 }
10573 {
10575 params,
10578 /* Change to the _N variant. */
10581 }
10583 {
10587 /* Change to the _N variant. */
10590 }
10592 {
10596 /* Change to the _N variant. */
10599 }
10602 }
10603 /* Fallthrough to the normal processing. */
10604 }
10621 {
10623 /* Fallthru for parameter processing. */
10624 }
10641 {
10652 orig_format))
10664 /* If new_return is set, assign function to that expr and cast the
10665 result to void since the generic interface returned void. */
10667 {
10668 /* Cast function result from I{1,2,4,8,16} to the required type. */
10671 result);
10675 }
10677 }
10681 }
10682 }
10684 /* Ignoring their sign, return true if two scalar types are the same. */
10685 bool
10687 {
10694 /* Equality works here because c_common_signed_type uses
10695 TYPE_MAIN_VARIANT. */
10698 }
10700 /* Check for missing format attributes on function pointers. LTYPE is
10701 the new type or left-hand side type. RTYPE is the old type or
10702 right-hand side type. Returns TRUE if LTYPE is missing the desired
10703 attribute. */
10705 bool
10707 {
10709 tree ra;
10715 {
10716 tree la;
10721 }
10722 else
10724 }
10726 /* Subscripting with type char is likely to lose on a machine where
10727 chars are signed. So warn on any machine, but optionally. Don't
10728 warn for unsigned char since that type is safe. Don't warn for
10729 signed char because anyone who uses that must have done so
10730 deliberately. Furthermore, we reduce the false positive load by
10731 warning only for non-constant value of type char. */
10733 void
10735 {
10739 }
10741 /* Implement -Wparentheses for the unexpected C precedence rules, to
10742 cover cases like x + y << z which readers are likely to
10743 misinterpret. We have seen an expression in which CODE is a binary
10744 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10745 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10746 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10747 expression was not formed using a binary or unary operator, or it
10748 was enclosed in parentheses. */
10750 void
10754 {
10758 /* This macro tests that the expression ARG with original tree code
10759 CODE appears to be a boolean expression. or the result of folding a
10760 boolean expression. */
10761 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10762 (truth_value_p (TREE_CODE (ARG)) \
10763 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10765 || ((CODE) != INTEGER_CST \
10766 && (integer_onep (ARG) || integer_zerop (ARG))))
10769 {
10818 /* Check cases like x|y==z */
10825 /* Check cases like !x | y */
10829 "suggest parentheses around operand of "
10842 /* Check cases like x^y==z */
10864 /* Check cases like x&y==z */
10871 /* Check cases like !x & y */
10875 "suggest parentheses around operand of "
10898 {
10903 "comparisons like %<X<=Y<=Z%> do not "
10909 "comparisons like %<X<=Y<=Z%> do not "
10911 }
10913 }
10914 #undef NOT_A_BOOLEAN_EXPR_P
10915 }
10917 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10919 void
10921 {
10923 {
10926 else
10928 }
10929 }
10931 /* Warn for division by zero according to the value of DIVISOR. LOC
10932 is the location of the division operator. */
10934 void
10936 {
10937 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10938 about division by zero. Do not issue a warning if DIVISOR has a
10939 floating-point type, since we consider 0.0/0.0 a valid way of
10940 generating a NaN. */
10944 }
10946 /* Subroutine of build_binary_op. Give warnings for comparisons
10947 between signed and unsigned quantities that may fail. Do the
10948 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10949 so that casts will be considered, but default promotions won't
10950 be.
10952 LOCATION is the location of the comparison operator.
10954 The arguments of this function map directly to local variables
10955 of build_binary_op. */
10957 void
10962 {
10967 /* In C++, check for comparison of different enum types. */
10973 {
10977 }
10979 /* Do not warn if the comparison is being done in a signed type,
10980 since the signed type will only be chosen if it can represent
10981 all the values of the unsigned type. */
10984 /* Do not warn if both operands are unsigned. */
10987 else
10988 {
10994 else
11002 /* Do not warn if the signed quantity is an unsuffixed integer
11003 literal (or some static constant expression involving such
11004 literals or a conditional expression involving such literals)
11005 and it is non-negative. */
11008 /* Do not warn if the comparison is an equality operation, the
11009 unsigned quantity is an integral constant, and it would fit
11010 in the result if the result were signed. */
11015 /* In C, do not warn if the unsigned quantity is an enumeration
11016 constant and its maximum value would fit in the result if the
11017 result were signed. */
11023 else
11025 OPT_Wsign_compare,
11027 }
11029 /* Warn if two unsigned values are being compared in a size larger
11030 than their original size, and one (and only one) is the result of
11031 a `~' operator. This comparison will always fail.
11033 Also warn if one operand is a constant, and the constant does not
11034 have all bits set that are set in the ~ operand when it is
11035 extended. */
11042 {
11049 {
11050 tree primop;
11056 {
11060 }
11061 else
11062 {
11066 }
11071 {
11074 {
11078 else
11081 }
11082 }
11083 }
11091 }
11092 }
11094 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11095 type via c_common_type. If -Wdouble-promotion is in use, and the
11096 conditions for warning have been met, issue a warning. GMSGID is
11097 the warning message. It must have two %T specifiers for the type
11098 that was converted (generally "float") and the type to which it was
11099 converted (generally "double), respectively. LOC is the location
11100 to which the awrning should refer. */
11102 void
11105 {
11106 tree source_type;
11110 /* If the conversion will not occur at run-time, there is no need to
11111 warn about it. */
11123 else
11126 }
11128 /* Setup a TYPE_DECL node as a typedef representation.
11130 X is a TYPE_DECL for a typedef statement. Create a brand new
11131 ..._TYPE node (which will be just a variant of the existing
11132 ..._TYPE node with identical properties) and then install X
11133 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11135 The whole point here is to end up with a situation where each
11136 and every ..._TYPE node the compiler creates will be uniquely
11137 associated with AT MOST one node representing a typedef name.
11138 This way, even though the compiler substitutes corresponding
11139 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11140 early on, later parts of the compiler can always do the reverse
11141 translation and get back the corresponding typedef name. For
11142 example, given:
11144 typedef struct S MY_TYPE;
11145 MY_TYPE object;
11147 Later parts of the compiler might only know that `object' was of
11148 type `struct S' if it were not for code just below. With this
11149 code however, later parts of the compiler see something like:
11151 struct S' == struct S
11152 typedef struct S' MY_TYPE;
11153 struct S' object;
11155 And they can then deduce (from the node for type struct S') that
11156 the original object declaration was:
11158 MY_TYPE object;
11160 Being able to do this is important for proper support of protoize,
11161 and also for generating precise symbolic debugging information
11162 which takes full account of the programmer's (typedef) vocabulary.
11164 Obviously, we don't want to generate a duplicate ..._TYPE node if
11165 the TYPE_DECL node that we are now processing really represents a
11166 standard built-in type. */
11168 void
11170 {
11174 {
11177 }
11180 {
11188 }
11189 }
11191 /* Record the types used by the current global variable declaration
11192 being parsed, so that we can decide later to emit their debug info.
11193 Those types are in types_used_by_cur_var_decl, and we are going to
11194 store them in the types_used_by_vars_hash hash table.
11195 DECL is the declaration of the global variable that has been parsed. */
11197 void
11199 {
11203 {
11206 }
11207 }
11209 /* If DECL is a typedef that is declared in the current function,
11210 record it for the purpose of -Wunused-local-typedefs. */
11212 void
11214 {
11219 /* if this is not a locally defined typedef then we are not
11220 interested. */
11227 }
11229 /* If T is a TYPE_DECL declared locally, mark it as used. */
11231 void
11233 {
11238 }
11240 /* Warn if there are some unused locally defined typedefs in the
11241 current function. */
11243 void
11245 {
11247 tree decl;
11248 /* The number of times we have emitted -Wunused-local-typedefs
11249 warnings. If this is different from errorcount, that means some
11250 unrelated errors have been issued. In which case, we'll avoid
11251 emitting "unused-local-typedefs" warnings. */
11263 {
11267 OPT_Wunused_local_typedefs,
11270 }
11273 }
11275 /* The C and C++ parsers both use vectors to hold function arguments.
11276 For efficiency, we keep a cache of unused vectors. This is the
11277 cache. */
11282 /* Return a new vector from the cache. If the cache is empty,
11283 allocate a new vector. These vectors are GC'ed, so it is OK if the
11284 pointer is not released.. */
11288 {
11291 else
11292 {
11293 /* Passing 0 to vec::alloc returns NULL, and our callers require
11294 that we always return a non-NULL value. The vector code uses
11295 4 when growing a NULL vector, so we do too. */
11299 }
11300 }
11302 /* Release a vector of trees back to the cache. */
11304 void
11306 {
11308 {
11311 }
11312 }
11314 /* Get a new tree vector holding a single tree. */
11318 {
11322 }
11324 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11328 {
11333 }
11335 /* Get a new tree vector which is a copy of an existing one. */
11339 {
11342 tree t;
11349 }
11351 /* Return true if KEYWORD starts a type specifier. */
11353 bool
11355 {
11357 {
11387 }
11388 }
11390 /* Return true if KEYWORD names a type qualifier. */
11392 bool
11394 {
11396 {
11403 }
11404 }
11406 /* Return true if KEYWORD names a storage class specifier.
11408 RID_TYPEDEF is not included in this list despite `typedef' being
11409 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11410 such for syntactic convenience only. */
11412 bool
11414 {
11416 {
11426 }
11427 }
11429 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11431 static bool
11433 {
11435 {
11443 }
11444 }
11446 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11447 declaration-specifier (C99 6.7). */
11449 bool
11451 {
11458 {
11465 }
11466 }
11468 /* Initialize language-specific-bits of tree_contains_struct. */
11470 void
11472 {
11475 }
11477 /* Build a user-defined numeric literal out of an integer constant type VALUE
11478 with identifier SUFFIX. */
11480 tree
11483 {
11490 }
11492 /* For vector[index], convert the vector to a
11493 pointer of the underlying type. */
11494 void
11497 {
11499 {
11501 tree type1;
11515 }
11516 }
11518 /* Determine which of the operands, if any, is a scalar that needs to be
11519 converted to a vector, for the range of operations. */
11520 enum stv_conv
11523 {
11532 {
11533 /* Most GENERIC binary expressions require homogeneous arguments.
11534 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11535 argument that is a vector and a second one that is a scalar, so
11536 we never return stv_secondarg for them. */
11541 {
11543 {
11548 }
11549 else
11551 }
11558 /* ... fall through ... */
11579 /* What about UNLT_EXPR? */
11581 {
11582 tree tmp;
11584 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11587 }
11591 {
11593 {
11598 }
11600 }
11602 /* Allow integer --> real conversion if safe. */
11606 {
11608 {
11613 }
11615 }
11618 }
11621 }
11623 /* Return true iff ALIGN is an integral constant that is a fundamental
11624 alignment, as defined by [basic.align] in the c++-11
11625 specifications.
11627 That is:
11629 [A fundamental alignment is represented by an alignment less than or
11630 equal to the greatest alignment supported by the implementation
11631 in all contexts, which is equal to
11632 alignof(max_align_t)]. */
11634 bool
11636 {
11639 }