| blob | 5fe7cab0f8bf0fc9bf02c3c196bf4d0a3eaf0453 |
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/>. */
49 /* The following symbols are subsumed in the c_global_trees array, and
50 listed here individually for documentation purposes.
52 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
54 tree short_integer_type_node;
55 tree long_integer_type_node;
56 tree long_long_integer_type_node;
57 tree int128_integer_type_node;
59 tree short_unsigned_type_node;
60 tree long_unsigned_type_node;
61 tree long_long_unsigned_type_node;
62 tree int128_unsigned_type_node;
64 tree truthvalue_type_node;
65 tree truthvalue_false_node;
66 tree truthvalue_true_node;
68 tree ptrdiff_type_node;
70 tree unsigned_char_type_node;
71 tree signed_char_type_node;
72 tree wchar_type_node;
74 tree char16_type_node;
75 tree char32_type_node;
77 tree float_type_node;
78 tree double_type_node;
79 tree long_double_type_node;
81 tree complex_integer_type_node;
82 tree complex_float_type_node;
83 tree complex_double_type_node;
84 tree complex_long_double_type_node;
86 tree dfloat32_type_node;
87 tree dfloat64_type_node;
88 tree_dfloat128_type_node;
90 tree intQI_type_node;
91 tree intHI_type_node;
92 tree intSI_type_node;
93 tree intDI_type_node;
94 tree intTI_type_node;
96 tree unsigned_intQI_type_node;
97 tree unsigned_intHI_type_node;
98 tree unsigned_intSI_type_node;
99 tree unsigned_intDI_type_node;
100 tree unsigned_intTI_type_node;
102 tree widest_integer_literal_type_node;
103 tree widest_unsigned_literal_type_node;
105 Nodes for types `void *' and `const void *'.
107 tree ptr_type_node, const_ptr_type_node;
109 Nodes for types `char *' and `const char *'.
111 tree string_type_node, const_string_type_node;
113 Type `char[SOMENUMBER]'.
114 Used when an array of char is needed and the size is irrelevant.
116 tree char_array_type_node;
118 Type `int[SOMENUMBER]' or something like it.
119 Used when an array of int needed and the size is irrelevant.
121 tree int_array_type_node;
123 Type `wchar_t[SOMENUMBER]' or something like it.
124 Used when a wide string literal is created.
126 tree wchar_array_type_node;
128 Type `char16_t[SOMENUMBER]' or something like it.
129 Used when a UTF-16 string literal is created.
131 tree char16_array_type_node;
133 Type `char32_t[SOMENUMBER]' or something like it.
134 Used when a UTF-32 string literal is created.
136 tree char32_array_type_node;
138 Type `int ()' -- used for implicit declaration of functions.
140 tree default_function_type;
142 A VOID_TYPE node, packaged in a TREE_LIST.
144 tree void_list_node;
146 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
147 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
148 VAR_DECLS, but C++ does.)
150 tree function_name_decl_node;
151 tree pretty_function_name_decl_node;
152 tree c99_function_name_decl_node;
154 Stack of nested function name VAR_DECLs.
156 tree saved_function_name_decls;
158 */
161 \f
162 /* Switches common to the C front ends. */
164 /* Nonzero means don't output line number information. */
168 /* Nonzero causes -E output not to be done, but directives such as
169 #define that have side effects are still obeyed. */
173 /* Nonzero means dump macros in some fashion. */
177 /* Nonzero means pass #include lines through to the output. */
181 /* Nonzero means process PCH files while preprocessing. */
185 /* The file name to which we should write a precompiled header, or
186 NULL if no header will be written in this compile. */
190 /* Nonzero if an ISO standard was selected. It rejects macros in the
191 user's namespace. */
194 /* C/ObjC language option variables. */
197 /* Nonzero means allow type mismatches in conditional expressions;
198 just make their values `void'. */
202 /* Nonzero means enable C89 Amendment 1 features. */
206 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
210 /* Nonzero means use the ISO C11 dialect of C. */
214 /* Nonzero means that we have builtin functions, and main is an int. */
219 /* ObjC language option variables. */
222 /* Tells the compiler that this is a special run. Do not perform any
223 compiling, instead we are to test some platform dependent features
224 and output a C header file with appropriate definitions. */
228 /* Tells the compiler what is the constant string class for ObjC. */
233 /* C++ language option variables. */
236 /* Nonzero means generate separate instantiation control files and
237 juggle them at link time. */
241 /* The C++ dialect being used. C++98 is the default. */
245 /* Maximum template instantiation depth. This limit exists to limit the
246 time it takes to notice excessively recursive template instantiations.
248 The default is lower than the 1024 recommended by the C++0x standard
249 because G++ runs out of stack before 1024 with highly recursive template
250 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
254 /* The elements of `ridpointers' are identifier nodes for the reserved
255 type names and storage classes. It is indexed by a RID_... value. */
260 /* Nonzero means don't warn about problems that occur when the code is
261 executed. */
264 /* Whether we are building a boolean conversion inside
265 convert_for_assignment, or some other late binary operation. If
266 build_binary_op is called for C (from code shared by C and C++) in
267 this case, then the operands have already been folded and the
268 result will not be folded again, so C_MAYBE_CONST_EXPR should not
269 be generated. */
272 /* Whether lexing has been completed, so subsequent preprocessor
273 errors should use the compiler's input_location. */
276 /* Information about how a function name is generated. */
277 struct fname_var_t
278 {
282 };
284 /* The three ways of getting then name of the current function. */
287 {
288 /* C99 compliant __func__, must be first. */
290 /* GCC __FUNCTION__ compliant. */
292 /* GCC __PRETTY_FUNCTION__ compliant. */
295 };
297 /* Global visibility options. */
382 /* Reserved words. The third field is a mask: keywords are disabled
383 if they match the mask.
385 Masks for languages:
386 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
387 C --std=c99: D_CXXONLY | D_OBJC
388 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
389 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
390 C++ --std=c0x: D_CONLY | D_OBJC
391 ObjC++ is like C++ except that D_OBJC is not set
393 If -fno-asm is used, D_ASM is added to the mask. If
394 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
395 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
396 In C with -Wc++-compat, we warn if D_CXXWARN is set.
398 Note the complication of the D_CXX_OBJC keywords. These are
399 reserved words such as 'class'. In C++, 'class' is a reserved
400 word. In Objective-C++ it is too. In Objective-C, it is a
401 reserved word too, but only if it follows an '@' sign.
402 */
404 {
560 /* These Objective-C keywords are recognized only immediately after
561 an '@'. */
578 /* These are recognized only in protocol-qualifier context
579 (see above) */
586 /* These are recognized inside a property attribute list */
595 };
600 /* Table of machine-independent attributes common to all C-like languages. */
602 {
603 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
604 affects_type_identity } */
611 /* FIXME: logically, noreturn attributes should be listed as
612 "false, true, true" and apply to function types. But implementing this
613 would require all the places in the compiler that use TREE_THIS_VOLATILE
614 on a decl to identify non-returning functions to be located and fixed
615 to check the function type instead. */
640 /* The same comments as for noreturn attributes apply to const ones. */
664 handle_no_instrument_function_attribute,
682 /* ??? These two attributes didn't make the transition from the
683 Intel language document to the multi-vendor language document. */
688 /* For internal use (marking of builtins) only. The name contains space
689 to prevent its usage in source code. */
711 /* For internal use (marking of builtins) only. The name contains space
712 to prevent its usage in source code. */
723 handle_no_address_safety_analysis_attribute,
726 handle_no_sanitize_address_attribute,
729 handle_no_sanitize_undefined_attribute,
739 /* For internal use only. The leading '*' both prevents its usage in
740 source code and signals that it may be overridden by machine tables. */
745 /* For internal use (marking of builtins and runtime functions) only.
746 The name contains space to prevent its usage in source code. */
754 };
756 /* Give the specifications for the format attributes, used by C and all
757 descendants. */
760 {
761 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
762 affects_type_identity } */
768 };
770 /* Return identifier for address space AS. */
774 {
778 }
780 /* Push current bindings for the function name VAR_DECLS. */
782 void
784 {
789 {
793 {
795 saved);
797 }
798 }
800 /* Normally they'll have been NULL, so only push if we've got a
801 stack, or they are non-NULL. */
803 saved_function_name_decls);
804 }
806 /* Finish up the current bindings, adding them into the current function's
807 statement tree. This must be done _before_ finish_stmt_tree is called.
808 If there is no current function, we must be at file scope and no statements
809 are involved. Pop the previous bindings. */
811 void
813 {
822 {
830 }
836 {
837 /* We had saved values, restore them. */
838 tree saved;
841 {
846 }
848 }
850 }
852 /* Return the text name of the current function, suitably prettified
853 by PRETTY_P. Return string must be freed by caller. */
857 {
864 {
867 }
880 {
883 }
886 }
888 /* Return the VAR_DECL for a const char array naming the current
889 function. If the VAR_DECL has not yet been created, create it
890 now. RID indicates how it should be formatted and IDENTIFIER_NODE
891 ID is its name (unfortunately C and C++ hold the RID values of
892 keywords in different places, so we can't derive RID from ID in
893 this language independent code. LOC is the location of the
894 function. */
896 tree
898 {
908 {
909 /* If a tree is built here, it would normally have the lineno of
910 the current statement. Later this tree will be moved to the
911 beginning of the function and this line number will be wrong.
912 To avoid this problem set the lineno to 0 here; that prevents
913 it from appearing in the RTL. */
914 tree stmts;
922 saved_function_name_decls
926 }
931 }
933 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
935 tree
937 {
942 /* Compute the number of elements, for the array type. */
944 {
947 }
949 {
952 }
954 {
957 }
958 else
959 {
962 }
964 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
965 limit in C++98 Annex B is very large (65536) and is not normative,
966 so we do not diagnose it (warn_overlength_strings is forced off
967 in c_common_post_options). */
969 {
973 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
974 separate the %d from the 'C'. 'ISO' should not be
975 translated, but it may be moved after 'C%d' in languages
976 where modifiers follow nouns. */
978 "string length %qd is greater than the length %qd "
981 }
983 /* Create the array type for the string constant. The ISO C++
984 standard says that a string literal has type `const char[N]' or
985 `const wchar_t[N]'. We use the same logic when invoked as a C
986 front-end with -Wwrite-strings.
987 ??? We should change the type of an expression depending on the
988 state of a warning flag. We should just be warning -- see how
989 this is handled in the C++ front-end for the deprecated implicit
990 conversion from string literals to `char*' or `wchar_t*'.
992 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
993 array type being the unqualified version of that type.
994 Therefore, if we are constructing an array of const char, we must
995 construct the matching unqualified array type first. The C front
996 end does not require this, but it does no harm, so we do it
997 unconditionally. */
1008 }
1009 \f
1010 /* If DISABLE is true, stop issuing warnings. This is used when
1011 parsing code that we know will not be executed. This function may
1012 be called multiple times, and works as a stack. */
1014 static void
1016 {
1018 {
1021 }
1022 }
1024 /* If ENABLE is true, reenable issuing warnings. */
1026 static void
1028 {
1030 {
1033 }
1034 }
1036 /* Fully fold EXPR, an expression that was not folded (beyond integer
1037 constant expressions and null pointer constants) when being built
1038 up. If IN_INIT, this is in a static initializer and certain
1039 changes are made to the folding done. Clear *MAYBE_CONST if
1040 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1041 expression because it contains an evaluated operator (in C99) or an
1042 operator outside of sizeof returning an integer constant (in C90)
1043 not permitted in constant expressions, or because it contains an
1044 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1045 set to true by callers before calling this function.) Return the
1046 folded expression. Function arguments have already been folded
1047 before calling this function, as have the contents of SAVE_EXPR,
1048 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1049 C_MAYBE_CONST_EXPR. */
1051 tree
1053 {
1054 tree ret;
1060 /* This function is not relevant to C++ because C++ folds while
1061 parsing, and may need changes to be correct for C++ when C++
1062 stops folding while parsing. */
1069 {
1072 }
1079 }
1081 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1082 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1083 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1084 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1085 both evaluated and unevaluated subexpressions while
1086 *MAYBE_CONST_ITSELF is carried from only evaluated
1087 subexpressions). */
1089 static tree
1092 {
1104 /* This function is not relevant to C++ because C++ folds while
1105 parsing, and may need changes to be correct for C++ when C++
1106 stops folding while parsing. */
1110 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1111 anything else not counted as an expression cannot usefully be
1112 folded further at this point. */
1118 /* Operands of variable-length expressions (function calls) have
1119 already been folded, as have __builtin_* function calls, and such
1120 expressions cannot occur in constant expressions. */
1122 {
1126 }
1129 {
1138 else
1141 }
1143 /* Assignment, increment, decrement, function call and comma
1144 operators, and statement expressions, cannot occur in constant
1145 expressions if evaluated / outside of sizeof. (Function calls
1146 were handled above, though VA_ARG_EXPR is treated like a function
1147 call here, and statement expressions are handled through
1148 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1150 {
1170 }
1172 /* Fold individual tree codes as appropriate. */
1174 {
1176 /* Any non-constancy will have been marked in a containing
1177 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1185 maybe_const_itself);
1190 {
1193 }
1202 maybe_const_itself);
1205 maybe_const_itself);
1211 {
1215 }
1257 /* Binary operations evaluating both arguments (increment and
1258 decrement are binary internally in GCC). */
1262 maybe_const_itself);
1270 /* The RHS of a MODIFY_EXPR was fully folded when building that
1271 expression for the sake of conversion warnings. */
1274 maybe_const_itself);
1278 ret = in_init
1281 else
1294 {
1305 }
1311 CASE_CONVERT:
1321 /* Unary operations. */
1324 maybe_const_itself);
1328 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1329 not prepared to deal with them if they occur in initializers. */
1337 ret = in_init
1340 else
1345 {
1349 }
1351 {
1354 CASE_CONVERT:
1355 /* Don't warn about explicit conversions. We will already
1356 have warned about suspect implicit conversions. */
1363 }
1368 /* Binary operations not necessarily evaluating both
1369 arguments. */
1376 ? truthvalue_false_node
1384 ret = in_init
1387 else
1392 && op0_const
1393 && op0_const_self
1399 && op0_const_self
1425 else
1430 && op0_const
1431 && op0_const_self
1435 && op0_const_self
1439 && op0_const
1440 && op0_const_self
1444 && op0_const_self
1450 /* Each case where an operand with excess precision may be
1451 encountered must remove the EXCESS_PRECISION_EXPR around
1452 inner operands and possibly put one around the whole
1453 expression or possibly convert to the semantic type (which
1454 c_fully_fold does); we cannot tell at this stage which is
1455 appropriate in any particular case. */
1459 /* Various codes may appear through folding built-in functions
1460 and their arguments. */
1462 }
1464 out:
1465 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1466 have been done by this point, so remove them again. */
1470 {
1474 }
1478 }
1480 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1481 return EXP. Otherwise, return either EXP or its known constant
1482 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1483 Is the BLKmode test appropriate? */
1485 tree
1487 {
1488 tree ret;
1490 /* This function is only used by C, for c_fully_fold and other
1491 optimization, and may not be correct for C++. */
1502 /* Avoid unwanted tree sharing between the initializer and current
1503 function's body where the tree can be modified e.g. by the
1504 gimplifier. */
1508 }
1510 /* Print a warning if a constant expression had overflow in folding.
1511 Invoke this function on every expression that the language
1512 requires to be a constant expression.
1513 Note the ANSI C standard says it is erroneous for a
1514 constant expression to overflow. */
1516 void
1518 {
1526 }
1528 /* The same as above but print an unconditional error. */
1529 void
1531 {
1538 }
1540 /* Print a warning if an expression had overflow in folding and its
1541 operands hadn't.
1543 Invoke this function on every expression that
1544 (1) appears in the source code, and
1545 (2) is a constant expression that overflowed, and
1546 (3) is not already checked by convert_and_check;
1547 however, do not invoke this function on operands of explicit casts
1548 or when the expression is the result of an operator and any operand
1549 already overflowed. */
1551 void
1553 {
1558 {
1587 }
1588 }
1590 /* Warn about uses of logical || / && operator in a context where it
1591 is likely that the bitwise equivalent was intended by the
1592 programmer. We have seen an expression in which CODE is a binary
1593 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1594 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1595 void
1599 {
1611 /* Warn if &&/|| are being used in a context where it is
1612 likely that the bitwise equivalent was intended by the
1613 programmer. That is, an expression such as op && MASK
1614 where op should not be any boolean expression, nor a
1615 constant, and mask seems to be a non-boolean integer constant. */
1623 {
1627 else
1632 }
1634 /* We do not warn for constants because they are typical of macro
1635 expansions that test for features. */
1639 /* This warning only makes sense with logical operands. */
1647 /* We first test whether either side separately is trivially true
1648 (with OR) or trivially false (with AND). If so, do not warn.
1649 This is a common idiom for testing ranges of data types in
1650 portable code. */
1657 /* If this is an OR operation, invert both sides; now, the result
1658 should be always false to get a warning. */
1672 /* If this is an OR operation, invert both sides; now, the result
1673 should be always false to get a warning. */
1681 /* If both expressions have the same operand, if we can merge the
1682 ranges, and if the range test is always false, then warn. */
1689 {
1692 "logical %<or%> "
1694 else
1696 "logical %<and%> "
1698 }
1699 }
1702 /* Warn if EXP contains any computations whose results are not used.
1703 Return true if a warning is printed; false otherwise. LOCUS is the
1704 (potential) location of the expression. */
1706 bool
1708 {
1709 restart:
1713 /* Don't warn about void constructs. This includes casting to void,
1714 void function calls, and statement expressions with a final cast
1715 to void. */
1723 {
1739 /* For a binding, warn if no side effect within it. */
1751 /* In && or ||, warn if 2nd operand has no side effect. */
1758 /* Let people do `(foo (), 0)' without a warning. */
1765 /* If this is an expression with side effects, don't warn; this
1766 case commonly appears in macro expansions. */
1772 /* Don't warn about automatic dereferencing of references, since
1773 the user cannot control it. */
1775 {
1778 }
1779 /* Fall through. */
1782 /* Referencing a volatile value is a side effect, so don't warn. */
1787 /* If this is an expression which has no operands, there is no value
1788 to be unused. There are no such language-independent codes,
1789 but front ends may define such. */
1793 warn:
1795 }
1796 }
1799 /* Print a warning about casts that might indicate violation
1800 of strict aliasing rules if -Wstrict-aliasing is used and
1801 strict aliasing mode is in effect. OTYPE is the original
1802 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1804 bool
1806 {
1807 /* Strip pointer conversion chains and get to the correct original type. */
1815 /* If the type we are casting to is a ref-all pointer
1816 dereferencing it is always valid. */
1823 {
1824 /* Casting the address of an object to non void pointer. Warn
1825 if the cast breaks type based aliasing. */
1827 {
1831 }
1832 else
1833 {
1834 /* warn_strict_aliasing >= 3. This includes the default (3).
1835 Only warn if the cast is dereferenced immediately. */
1836 alias_set_type set1 =
1842 {
1846 }
1849 {
1853 }
1854 }
1855 }
1856 else
1858 {
1859 /* At this level, warn for any conversions, even if an address is
1860 not taken in the same statement. This will likely produce many
1861 false positives, but could be useful to pinpoint problems that
1862 are not revealed at higher levels. */
1867 {
1871 }
1872 }
1875 }
1877 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1878 sizeof as last operand of certain builtins. */
1880 void
1884 {
1888 location_t loc;
1896 {
1900 /* FALLTHRU */
1908 /* FALLTHRU */
1967 }
1995 {
1999 {
2002 "argument to %<sizeof%> in %qD call is the same "
2003 "expression as the destination; did you mean to "
2009 "argument to %<sizeof%> in %qD call is the same "
2010 "expression as the destination; did you mean to "
2012 else
2014 "argument to %<sizeof%> in %qD call is the same "
2015 "expression as the destination; did you mean to "
2018 }
2021 && !strop
2024 {
2026 "argument to %<sizeof%> in %qD call is the same "
2027 "pointer type %qT as the destination; expected %qT "
2031 }
2032 }
2035 {
2039 {
2042 "argument to %<sizeof%> in %qD call is the same "
2043 "expression as the source; did you mean to "
2049 "argument to %<sizeof%> in %qD call is the same "
2050 "expression as the source; did you mean to "
2052 else
2054 "argument to %<sizeof%> in %qD call is the same "
2055 "expression as the source; did you mean to "
2058 }
2061 && !strop
2064 {
2066 "argument to %<sizeof%> in %qD call is the same "
2067 "pointer type %qT as the source; expected %qT "
2071 }
2072 }
2075 {
2079 {
2082 "argument to %<sizeof%> in %qD call is the same "
2083 "expression as the first source; did you mean to "
2089 "argument to %<sizeof%> in %qD call is the same "
2090 "expression as the first source; did you mean to "
2092 else
2094 "argument to %<sizeof%> in %qD call is the same "
2095 "expression as the first source; did you mean to "
2098 }
2101 && !strop
2104 {
2106 "argument to %<sizeof%> in %qD call is the same "
2107 "pointer type %qT as the first source; expected %qT "
2111 }
2112 }
2115 {
2119 {
2122 "argument to %<sizeof%> in %qD call is the same "
2123 "expression as the second source; did you mean to "
2129 "argument to %<sizeof%> in %qD call is the same "
2130 "expression as the second source; did you mean to "
2132 else
2134 "argument to %<sizeof%> in %qD call is the same "
2135 "expression as the second source; did you mean to "
2138 }
2141 && !strop
2144 {
2146 "argument to %<sizeof%> in %qD call is the same "
2147 "pointer type %qT as the second source; expected %qT "
2151 }
2152 }
2154 }
2156 /* Warn for unlikely, improbable, or stupid DECL declarations
2157 of `main'. */
2159 void
2161 {
2162 function_args_iterator iter;
2163 tree type;
2167 {
2168 /* XXX void_type_node belies the abstraction. */
2174 {
2196 "third argument of %q+D should probably be "
2199 }
2200 }
2202 /* It is intentional that this message does not mention the third
2203 argument because it's only mentioned in an appendix of the
2204 standard. */
2208 }
2210 /* vector_targets_convertible_p is used for vector pointer types. The
2211 callers perform various checks that the qualifiers are satisfactory,
2212 while OTOH vector_targets_convertible_p ignores the number of elements
2213 in the vectors. That's fine with vector pointers as we can consider,
2214 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2215 and that does not require and conversion of the pointer values.
2216 In contrast, vector_types_convertible_p and
2217 vector_types_compatible_elements_p are used for vector value types. */
2218 /* True if pointers to distinct types T1 and T2 can be converted to
2219 each other without an explicit cast. Only returns true for opaque
2220 vector types. */
2221 bool
2223 {
2230 }
2232 /* vector_types_convertible_p is used for vector value types.
2233 It could in principle call vector_targets_convertible_p as a subroutine,
2234 but then the check for vector type would be duplicated with its callers,
2235 and also the purpose of vector_targets_convertible_p would become
2236 muddled.
2237 Where vector_types_convertible_p returns true, a conversion might still be
2238 needed to make the types match.
2239 In contrast, vector_targets_convertible_p is used for vector pointer
2240 values, and vector_types_compatible_elements_p is used specifically
2241 in the context for binary operators, as a check if use is possible without
2242 conversion. */
2243 /* True if vector types T1 and T2 can be converted to each other
2244 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2245 can only be converted with -flax-vector-conversions yet that is not
2246 in effect, emit a note telling the user about that option if such
2247 a note has not previously been emitted. */
2248 bool
2250 {
2258 convertible_lax =
2273 {
2276 "conversions between vectors with differing "
2278 }
2281 }
2283 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2284 and have vector types, V0 has the same type as V1, and the number of
2285 elements of V0, V1, MASK is the same.
2287 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2288 called with two arguments. In this case implementation passes the
2289 first argument twice in order to share the same tree code. This fact
2290 could enable the mask-values being twice the vector length. This is
2291 an implementation accident and this semantics is not guaranteed to
2292 the user. */
2293 tree
2296 {
2297 tree ret;
2303 {
2306 }
2314 {
2319 }
2323 {
2327 }
2330 {
2335 }
2341 {
2344 "argument vector(s) and the mask vector should "
2347 }
2351 {
2356 }
2359 {
2360 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2366 else
2367 {
2370 }
2374 }
2384 }
2386 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2387 to integral type. */
2389 static tree
2391 {
2396 {
2397 /* C++0x scoped enumerations don't implicitly convert to integral
2398 type; if we stripped an explicit conversion to a larger type we
2399 need to replace it so common_type will still work. */
2403 }
2405 }
2407 /* This is a helper function of build_binary_op.
2409 For certain operations if both args were extended from the same
2410 smaller type, do the arithmetic in that type and then extend.
2412 BITWISE indicates a bitwise operation.
2413 For them, this optimization is safe only if
2414 both args are zero-extended or both are sign-extended.
2415 Otherwise, we might change the result.
2416 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2417 but calculated in (unsigned short) it would be (unsigned short)-1.
2418 */
2419 tree
2421 {
2425 tree type;
2427 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2428 excessive narrowing when we call get_narrower below. For
2429 example, suppose that OP0 is of unsigned int extended
2430 from signed char and that RESULT_TYPE is long long int.
2431 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2432 like
2434 (long long int) (unsigned int) signed_char
2436 which get_narrower would narrow down to
2438 (unsigned int) signed char
2440 If we do not cast OP0 first, get_narrower would return
2441 signed_char, which is inconsistent with the case of the
2442 explicit cast. */
2449 /* UNS is 1 if the operation to be done is an unsigned one. */
2452 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2453 but it *requires* conversion to FINAL_TYPE. */
2464 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2466 /* For bitwise operations, signedness of nominal type
2467 does not matter. Consider only how operands were extended. */
2471 /* Note that in all three cases below we refrain from optimizing
2472 an unsigned operation on sign-extended args.
2473 That would not be valid. */
2475 /* Both args variable: if both extended in same way
2476 from same width, do it in that width.
2477 Do it unsigned if args were zero-extended. */
2484 return c_common_signed_or_unsigned_type
2491 && (type
2502 && (type
2510 }
2512 /* Checks if expression EXPR of real/integer type cannot be converted
2513 to the real/integer type TYPE. Function returns true when:
2514 * EXPR is a constant which cannot be exactly converted to TYPE
2515 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2516 for EXPR type and TYPE being both integers or both real.
2517 * EXPR is not a constant of real type and TYPE is an integer.
2518 * EXPR is not a constant of integer type which cannot be
2519 exactly converted to real type.
2520 Function allows conversions between types of different signedness and
2521 does not return true in that case. Function can produce signedness
2522 warnings if PRODUCE_WARNS is true. */
2523 bool
2525 {
2531 {
2532 /* Warn for real constant that is not an exact integer converted
2533 to integer type. */
2536 {
2539 }
2540 /* Warn for an integer constant that does not fit into integer type. */
2544 {
2547 {
2551 }
2553 {
2557 }
2558 else
2560 }
2562 {
2563 /* Warn for an integer constant that does not fit into real type. */
2565 {
2569 }
2570 /* Warn for a real constant that does not fit into a smaller
2571 real type. */
2574 {
2578 }
2579 }
2580 }
2581 else
2582 {
2583 /* Warn for real types converted to integer types. */
2590 {
2591 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2595 /* Don't warn for short y; short x = ((int)y & 0xff); */
2599 {
2600 /* If both args were extended from a shortest type,
2601 use that type if that is safe. */
2608 {
2614 /* If one of the operands is a non-negative constant
2615 that fits in the target type, then the type of the
2616 other operand does not matter. */
2625 /* If constant is unsigned and fits in the target
2626 type, then the result will also fit. */
2628 && unsigned0
2631 && unsigned1
2634 }
2635 }
2636 /* Warn for integer types converted to smaller integer types. */
2640 /* When they are the same width but different signedness,
2641 then the value may change. */
2644 /* Even when converted to a bigger type, if the type is
2645 unsigned but expr is signed, then negative values
2646 will be changed. */
2652 }
2654 /* Warn for integer types converted to real types if and only if
2655 all the range of values of the integer type cannot be
2656 represented by the real type. */
2659 {
2663 /* Don't warn about char y = 0xff; float x = (int) y; */
2675 }
2677 /* Warn for real types converted to smaller real types. */
2682 }
2685 }
2687 /* Warns if the conversion of EXPR to TYPE may alter a value.
2688 This is a helper function for warnings_for_convert_and_check. */
2690 static void
2692 {
2700 {
2713 /* Conversion from boolean to a signed:1 bit-field (which only
2714 can hold the values 0 and -1) doesn't lose information - but
2715 it does change the value. */
2730 {
2731 /* In case of COND_EXPR, we do not care about the type of
2732 COND_EXPR, only about the conversion of each operand. */
2739 }
2746 }
2747 }
2749 /* Produce warnings after a conversion. RESULT is the result of
2750 converting EXPR to TYPE. This is a helper function for
2751 convert_and_check and cp_convert_and_check. */
2753 void
2755 {
2762 {
2763 /* Do not diagnose overflow in a constant expression merely
2764 because a conversion overflowed. */
2769 {
2770 /* This detects cases like converting -129 or 256 to
2771 unsigned char. */
2775 else
2777 }
2781 /* No warning for converting 0x80000000 to int. */
2789 else
2791 }
2796 else
2798 }
2801 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2802 Invoke this function on every expression that is converted implicitly,
2803 i.e. because of language rules and not because of an explicit cast. */
2805 tree
2807 {
2808 tree result;
2809 tree expr_for_warning;
2811 /* Convert from a value with possible excess precision rather than
2812 via the semantic type, but do not warn about values not fitting
2813 exactly in the semantic type. */
2815 {
2821 }
2822 else
2836 }
2837 \f
2838 /* A node in a list that describes references to variables (EXPR), which are
2839 either read accesses if WRITER is zero, or write accesses, in which case
2840 WRITER is the parent of EXPR. */
2841 struct tlist
2842 {
2845 };
2847 /* Used to implement a cache the results of a call to verify_tree. We only
2848 use this for SAVE_EXPRs. */
2849 struct tlist_cache
2850 {
2854 tree expr;
2855 };
2857 /* Obstack to use when allocating tlist structures, and corresponding
2858 firstobj. */
2862 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2863 warnings. */
2865 /* SAVE_EXPRs need special treatment. We process them only once and then
2866 cache the results. */
2878 /* Create a new struct tlist and fill in its fields. */
2881 {
2888 }
2890 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2891 is nonnull, we ignore any node we find which has a writer equal to it. */
2893 static void
2895 {
2897 {
2904 }
2905 }
2907 /* Merge the nodes of ADD into TO. This merging process is done so that for
2908 each variable that already exists in TO, no new node is added; however if
2909 there is a write access recorded in ADD, and an occurrence on TO is only
2910 a read access, then the occurrence in TO will be modified to record the
2911 write. */
2913 static void
2915 {
2922 {
2929 {
2933 }
2935 {
2939 }
2941 }
2942 }
2944 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2945 references in list LIST conflict with it, excluding reads if ONLY writers
2946 is nonzero. */
2948 static void
2951 {
2954 /* Avoid duplicate warnings. */
2960 {
2964 {
2969 }
2971 }
2972 }
2974 /* Given a list LIST of references to variables, find whether any of these
2975 can cause conflicts due to missing sequence points. */
2977 static void
2979 {
2983 {
2986 }
2987 }
2989 /* Return nonzero if X is a tree that can be verified by the sequence point
2990 warnings. */
2991 static int
2993 {
3000 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3001 (lvalue_p) crash on TRY/CATCH. */
3008 /* No point to track non-const calls, they will never satisfy
3009 operand_equal_p. */
3017 }
3019 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3020 static bool
3022 {
3024 }
3026 /* Walk the tree X, and record accesses to variables. If X is written by the
3027 parent tree, WRITER is the parent.
3028 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3029 expression or its only operand forces a sequence point, then everything up
3030 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3031 in PNO_SP.
3032 Once we return, we will have emitted warnings if any subexpression before
3033 such a sequence point could be undefined. On a higher level, however, the
3034 sequence point may not be relevant, and we'll merge the two lists.
3036 Example: (b++, a) + b;
3037 The call that processes the COMPOUND_EXPR will store the increment of B
3038 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3039 processes the PLUS_EXPR will need to merge the two lists so that
3040 eventually, all accesses end up on the same list (and we'll warn about the
3041 unordered subexpressions b++ and b.
3043 A note on merging. If we modify the former example so that our expression
3044 becomes
3045 (b++, b) + a
3046 care must be taken not simply to add all three expressions into the final
3047 PNO_SP list. The function merge_tlist takes care of that by merging the
3048 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3049 way, so that no more than one access to B is recorded. */
3051 static void
3053 tree writer)
3054 {
3059 /* X may be NULL if it is the operand of an empty statement expression
3060 ({ }). */
3064 restart:
3072 {
3105 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3106 two first, to avoid warning for (a ? b++ : b++). */
3122 /* Expressions inside the LHS are not ordered wrt. the sequence points
3123 in the RHS. Example:
3124 *a = (a++, 2)
3125 Despite the fact that the modification of "a" is in the before_sp
3126 list (tmp_before), it conflicts with the use of "a" in the LHS.
3127 We can handle this by adding the contents of tmp_list3
3128 to those of tmp_before, and redoing the collision warnings for that
3129 list. */
3132 /* Exclude the LHS itself here; we first have to merge it into the
3133 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3134 didn't exclude the LHS, we'd get it twice, once as a read and once
3135 as a write. */
3146 /* We need to warn about conflicts among arguments and conflicts between
3147 args and the function address. Side effects of the function address,
3148 however, are not ordered by the sequence point of the call. */
3149 {
3150 call_expr_arg_iterator iter;
3151 tree arg;
3155 {
3160 }
3165 }
3168 /* Scan all the list, e.g. indices of multi dimensional array. */
3170 {
3176 }
3180 {
3187 {
3199 {
3203 }
3206 }
3210 }
3220 /* For other expressions, simply recurse on their operands.
3221 Manual tail recursion for unary expressions.
3222 Other non-expressions need not be processed. */
3224 {
3228 }
3230 {
3234 {
3239 }
3240 }
3242 }
3243 }
3245 /* Try to warn for undefined behavior in EXPR due to missing sequence
3246 points. */
3248 DEBUG_FUNCTION void
3250 {
3256 {
3259 }
3264 }
3265 \f
3266 /* Validate the expression after `case' and apply default promotions. */
3268 static tree
3270 {
3275 /* Promote char or short to int. */
3278 {
3281 }
3286 }
3287 \f
3288 /* See if the case values LOW and HIGH are in the range of the original
3289 type (i.e. before the default conversion to int) of the switch testing
3290 expression.
3291 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3292 the type before promoting it. CASE_LOW_P is a pointer to the lower
3293 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3294 if the case is not a case range.
3295 The caller has to make sure that we are not called with NULL for
3296 CASE_LOW_P (i.e. the default case).
3297 Returns true if the case label is in range of ORIG_TYPE (saturated or
3298 untouched) or false if the label is out of range. */
3300 static bool
3303 {
3308 /* If there was a problem with the original type, do nothing. */
3315 /* Case label is less than minimum for type. */
3318 {
3321 }
3323 /* Case value is greater than maximum for type. */
3326 {
3329 }
3331 /* Saturate lower case label value to minimum. */
3334 {
3338 }
3340 /* Saturate upper case label value to maximum. */
3343 {
3347 }
3355 }
3356 \f
3357 /* Return an integer type with BITS bits of precision,
3358 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3360 tree
3362 {
3401 }
3403 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3404 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3405 and saturating if SATP is nonzero, otherwise not saturating. */
3407 tree
3410 {
3414 else
3422 {
3424 "fixed-point types that have too many integral and "
3427 }
3430 }
3432 /* Used for communication between c_common_type_for_mode and
3433 c_register_builtin_type. */
3436 /* Return a data type that has machine mode MODE.
3437 If the mode is an integer,
3438 then UNSIGNEDP selects between signed and unsigned types.
3439 If the mode is a fixed-point mode,
3440 then UNSIGNEDP selects between saturating and nonsaturating types. */
3442 tree
3444 {
3445 tree t;
3482 #if HOST_BITS_PER_WIDE_INT >= 64
3485 #endif
3510 {
3512 tree inner_type;
3528 }
3530 {
3535 }
3545 {
3631 }
3639 }
3641 tree
3643 {
3645 }
3647 /* Return a signed type the same as TYPE in other respects. */
3649 tree
3651 {
3653 }
3655 /* Return a type the same as TYPE except unsigned or
3656 signed according to UNSIGNEDP. */
3658 tree
3660 {
3661 tree type1;
3663 /* This block of code emulates the behavior of the old
3664 c_common_unsigned_type. In particular, it returns
3665 long_unsigned_type_node if passed a long, even when a int would
3666 have the same size. This is necessary for warnings to work
3667 correctly in archs where sizeof(int) == sizeof(long) */
3670 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3686 #if HOST_BITS_PER_WIDE_INT >= 64
3689 #endif
3699 #define C_COMMON_FIXED_TYPES(NAME) \
3700 if (type1 == short_ ## NAME ## _type_node \
3701 || type1 == unsigned_short_ ## NAME ## _type_node) \
3702 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3703 : short_ ## NAME ## _type_node; \
3704 if (type1 == NAME ## _type_node \
3705 || type1 == unsigned_ ## NAME ## _type_node) \
3706 return unsignedp ? unsigned_ ## NAME ## _type_node \
3707 : NAME ## _type_node; \
3708 if (type1 == long_ ## NAME ## _type_node \
3709 || type1 == unsigned_long_ ## NAME ## _type_node) \
3710 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3711 : long_ ## NAME ## _type_node; \
3712 if (type1 == long_long_ ## NAME ## _type_node \
3713 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3714 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3715 : long_long_ ## NAME ## _type_node;
3717 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3718 if (type1 == NAME ## _type_node \
3719 || type1 == u ## NAME ## _type_node) \
3720 return unsignedp ? u ## NAME ## _type_node \
3721 : NAME ## _type_node;
3723 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3724 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3725 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3726 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3727 : sat_ ## short_ ## NAME ## _type_node; \
3728 if (type1 == sat_ ## NAME ## _type_node \
3729 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3730 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3731 : sat_ ## NAME ## _type_node; \
3732 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3733 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3734 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3735 : sat_ ## long_ ## NAME ## _type_node; \
3736 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3737 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3738 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3739 : sat_ ## long_long_ ## NAME ## _type_node;
3741 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3742 if (type1 == sat_ ## NAME ## _type_node \
3743 || type1 == sat_ ## u ## NAME ## _type_node) \
3744 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3745 : sat_ ## NAME ## _type_node;
3771 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3772 the precision; they have precision set to match their range, but
3773 may use a wider mode to match an ABI. If we change modes, we may
3774 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3775 the precision as well, so as to yield correct results for
3776 bit-field types. C++ does not have these separate bit-field
3777 types, and producing a signed or unsigned variant of an
3778 ENUMERAL_TYPE may cause other problems as well. */
3784 #define TYPE_OK(node) \
3785 (TYPE_MODE (type) == TYPE_MODE (node) \
3786 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3805 #if HOST_BITS_PER_WIDE_INT >= 64
3808 #endif
3817 #undef TYPE_OK
3820 }
3822 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3824 tree
3826 {
3827 /* Extended integer types of the same width as a standard type have
3828 lesser rank, so those of the same width as int promote to int or
3829 unsigned int and are valid for printf formats expecting int or
3830 unsigned int. To avoid such special cases, avoid creating
3831 extended integer types for bit-fields if a standard integer type
3832 is available. */
3849 }
3851 /* The C version of the register_builtin_type langhook. */
3853 void
3855 {
3856 tree decl;
3866 }
3867 \f
3868 /* Print an error message for invalid operands to arith operation
3869 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3870 LOCATION is the location of the message. */
3872 void
3875 {
3879 {
3924 }
3928 }
3929 \f
3930 /* Given an expression as a tree, return its original type. Do this
3931 by stripping any conversion that preserves the sign and precision. */
3932 static tree
3934 {
3937 }
3939 /* Subroutine of build_binary_op, used for comparison operations.
3940 See if the operands have both been converted from subword integer types
3941 and, if so, perhaps change them both back to their original type.
3942 This function is also responsible for converting the two operands
3943 to the proper common type for comparison.
3945 The arguments of this function are all pointers to local variables
3946 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3947 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3949 If this function returns nonzero, it means that the comparison has
3950 a constant value. What this function returns is an expression for
3951 that value. */
3953 tree
3956 {
3957 tree type;
3966 /* Throw away any conversions to wider types
3967 already present in the operands. */
3972 /* If primopN is first sign-extended from primopN's precision to opN's
3973 precision, then zero-extended from opN's precision to
3974 *restype_ptr precision, shortenings might be invalid. */
3977 && !unsignedp0
3982 && !unsignedp1
3986 /* Handle the case that OP0 does not *contain* a conversion
3987 but it *requires* conversion to FINAL_TYPE. */
3994 /* If one of the operands must be floated, we cannot optimize. */
3998 /* If first arg is constant, swap the args (changing operation
3999 so value is preserved), for canonicalization. Don't do this if
4000 the second arg is 0. */
4005 {
4022 {
4037 }
4039 }
4041 /* If comparing an integer against a constant more bits wide,
4042 maybe we can deduce a value of 1 or 0 independent of the data.
4043 Or else truncate the constant now
4044 rather than extend the variable at run time.
4046 This is only interesting if the constant is the wider arg.
4047 Also, it is not safe if the constant is unsigned and the
4048 variable arg is signed, since in this case the variable
4049 would be sign-extended and then regarded as unsigned.
4050 Our technique fails in this case because the lowest/highest
4051 possible unsigned results don't follow naturally from the
4052 lowest/highest possible values of the variable operand.
4053 For just EQ_EXPR and NE_EXPR there is another technique that
4054 could be used: see if the constant can be faithfully represented
4055 in the other operand's type, by truncating it and reextending it
4056 and see if that preserves the constant's value. */
4062 {
4065 /* 1 if comparison is nominally unsigned. */
4067 tree val;
4079 {
4080 /* Convert primop1 to target type, but do not introduce
4081 additional overflow. We know primop1 is an int_cst. */
4085 }
4087 {
4090 }
4093 {
4098 }
4099 else
4100 {
4105 }
4108 /* This used to be a switch, but Genix compiler can't handle that. */
4110 {
4113 }
4115 {
4118 }
4120 {
4125 }
4127 {
4132 }
4134 {
4139 }
4141 {
4146 }
4148 /* If primop0 was sign-extended and unsigned comparison specd,
4149 we did a signed comparison above using the signed type bounds.
4150 But the comparison we output must be unsigned.
4152 Also, for inequalities, VAL is no good; but if the signed
4153 comparison had *any* fixed result, it follows that the
4154 unsigned comparison just tests the sign in reverse
4155 (positive values are LE, negative ones GE).
4156 So we can generate an unsigned comparison
4157 against an extreme value of the signed type. */
4160 {
4163 {
4178 }
4180 }
4184 {
4191 }
4194 {
4195 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4199 }
4201 /* Value is not predetermined, but do the comparison
4202 in the type of the operand that is not constant.
4203 TYPE is already properly set. */
4204 }
4206 /* If either arg is decimal float and the other is float, find the
4207 proper common type to use for comparison. */
4218 /* If args' natural types are both narrower than nominal type
4219 and both extend in the same manner, compare them
4220 in the type of the wider arg.
4221 Otherwise must actually extend both to the nominal
4222 common type lest different ways of extending
4223 alter the result.
4224 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4229 {
4233 type);
4234 /* Make sure shorter operand is extended the right way
4235 to match the longer operand. */
4236 primop0
4239 primop0);
4240 primop1
4243 primop1);
4244 }
4245 else
4246 {
4247 /* Here we must do the comparison on the nominal type
4248 using the args exactly as we received them. */
4255 {
4257 /* All unsigned values are >= 0, so we warn. However,
4258 if OP0 is a constant that is >= 0, the signedness of
4259 the comparison isn't an issue, so suppress the
4260 warning. */
4262 warn_type_limits && !in_system_header
4266 primop0)))
4267 /* Do not warn for enumeration types. */
4271 {
4288 }
4291 {
4292 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4297 }
4298 }
4299 }
4307 }
4308 \f
4309 /* Return a tree for the sum or difference (RESULTCODE says which)
4310 of pointer PTROP and integer INTOP. */
4312 tree
4315 {
4318 /* The result is a pointer of the same type that is being added. */
4322 {
4329 }
4331 {
4338 }
4339 else
4342 /* We are manipulating pointer values, so we don't need to warn
4343 about relying on undefined signed overflow. We disable the
4344 warning here because we use integer types so fold won't know that
4345 they are really pointers. */
4348 /* If what we are about to multiply by the size of the elements
4349 contains a constant term, apply distributive law
4350 and multiply that constant term separately.
4351 This helps produce common subexpressions. */
4356 /* If the constant comes from pointer subtraction,
4357 skip this optimization--it would cause an error. */
4359 /* If the constant is unsigned, and smaller than the pointer size,
4360 then we must skip this optimization. This is because it could cause
4361 an overflow error if the constant is negative but INTOP is not. */
4365 {
4370 /* Convert both subexpression types to the type of intop,
4371 because weird cases involving pointer arithmetic
4372 can result in a sum or difference with different type args. */
4377 }
4379 /* Convert the integer argument to a type the same size as sizetype
4380 so the multiply won't overflow spuriously. */
4386 /* Replace the integer argument with a suitable product by the object size.
4387 Do this multiplication as signed, then convert to the appropriate type
4388 for the pointer operation and disregard an overflow that occurred only
4389 because of the sign-extension change in the latter conversion. */
4390 {
4398 }
4400 /* Create the sum or difference. */
4409 }
4410 \f
4411 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4412 and if NON_CONST is known not to be permitted in an evaluated part
4413 of a constant expression. */
4415 tree
4417 {
4421 /* This should never be called for C++. */
4425 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4434 }
4436 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4437 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4438 around the SAVE_EXPR if needed so that c_fully_fold does not need
4439 to look inside SAVE_EXPRs. */
4441 tree
4443 {
4452 }
4454 /* Return whether EXPR is a declaration whose address can never be
4455 NULL. */
4457 bool
4459 {
4464 }
4466 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4467 or for an `if' or `while' statement or ?..: exp. It should already
4468 have been validated to be of suitable type; otherwise, a bad
4469 diagnostic may result.
4471 The EXPR is located at LOCATION.
4473 This preparation consists of taking the ordinary
4474 representation of an expression expr and producing a valid tree
4475 boolean expression describing whether expr is nonzero. We could
4476 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4477 but we optimize comparisons, &&, ||, and !.
4479 The resulting type should always be `truthvalue_type_node'. */
4481 tree
4483 {
4485 {
4527 ? truthvalue_true_node
4533 ? truthvalue_true_node
4538 /* Fall through. */
4541 {
4544 {
4545 /* Common Ada/Pascal programmer's mistake. */
4547 OPT_Waddress,
4549 inner);
4551 }
4553 }
4570 /* These don't change whether an object is nonzero or zero. */
4575 /* These don't change whether an object is zero or nonzero, but
4576 we can't ignore them if their second arg has side-effects. */
4578 {
4581 c_common_truthvalue_conversion
4584 }
4585 else
4590 /* Distribute the conversion into the arms of a COND_EXPR. */
4592 {
4595 /* In C++ one of the arms might have void type if it is throw. */
4603 }
4604 else
4605 {
4606 /* Folding will happen later for C. */
4614 }
4616 CASE_CONVERT:
4617 {
4621 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4622 since that affects how `default_conversion' will behave. */
4626 /* Don't strip a conversion from C++0x scoped enum, since they
4627 don't implicitly convert to other types. */
4631 /* If this isn't narrowing the argument, we can ignore it. */
4635 }
4641 {
4645 }
4650 }
4653 {
4655 expr = (build_binary_op
4659 c_common_truthvalue_conversion
4662 c_common_truthvalue_conversion
4667 }
4670 {
4675 }
4676 else
4679 ret:
4682 }
4683 \f
4692 /* Apply the TYPE_QUALS to the new DECL. */
4694 void
4696 {
4704 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4705 constructor can produce constant init, so rely on cp_finish_decl to
4706 clear TREE_READONLY if the variable has non-constant init. */
4709 {
4712 }
4714 {
4716 /* Allow 'restrict' on arrays of pointers.
4717 FIXME currently we just ignore it. */
4723 }
4724 }
4726 /* Hash function for the problem of multiple type definitions in
4727 different files. This must hash all types that will compare
4728 equal via comptypes to the same value. In practice it hashes
4729 on some of the simple stuff and leaves the details to comptypes. */
4731 static hashval_t
4733 {
4737 tree t2;
4739 {
4740 /* For pointers, hash on pointee type plus some swizzling. */
4743 /* Hash on number of elements and total size. */
4762 }
4763 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4764 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4766 /* We might have a VLA here. */
4769 else
4772 }
4776 /* Return the typed-based alias set for T, which may be an expression
4777 or a type. Return -1 if we don't do anything special. */
4779 alias_set_type
4781 {
4782 tree u;
4785 /* For VLAs, use the alias set of the element type rather than the
4786 default of alias set 0 for types compared structurally. */
4788 {
4792 }
4794 /* Permit type-punning when accessing a union, provided the access
4795 is directly through the union. For example, this code does not
4796 permit taking the address of a union member and then storing
4797 through it. Even the type-punning allowed here is a GCC
4798 extension, albeit a common and useful one; the C standard says
4799 that such accesses have implementation-defined behavior. */
4807 /* That's all the expressions we handle specially. */
4811 /* The C standard guarantees that any object may be accessed via an
4812 lvalue that has character type. */
4818 /* The C standard specifically allows aliasing between signed and
4819 unsigned variants of the same type. We treat the signed
4820 variant as canonical. */
4822 {
4825 /* t1 == t can happen for boolean nodes which are always unsigned. */
4828 }
4830 /* Handle the case of multiple type nodes referring to "the same" type,
4831 which occurs with IMA. These share an alias set. FIXME: Currently only
4832 C90 is handled. (In C99 type compatibility is not transitive, which
4833 complicates things mightily. The alias set splay trees can theoretically
4834 represent this, but insertion is tricky when you consider all the
4835 different orders things might arrive in.) */
4840 /* Save time if there's only one input file. */
4844 /* Pointers need special handling if they point to any type that
4845 needs special handling (below). */
4847 {
4848 tree t2;
4849 /* Find bottom type under any nested POINTERs. */
4853 ;
4861 }
4862 /* These are the only cases that need special handling. */
4869 /* Undefined? */
4873 /* Look up t in hash table. Only one of the compatible types within each
4874 alias set is recorded in the table. */
4878 NULL);
4881 {
4884 }
4885 else
4886 /* Our caller will assign and record (in t) a new alias set; all we need
4887 to do is remember t in the hash table. */
4891 }
4892 \f
4893 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4894 the second parameter indicates which OPERATOR is being applied.
4895 The COMPLAIN flag controls whether we should diagnose possibly
4896 ill-formed constructs or not. LOC is the location of the SIZEOF or
4897 TYPEOF operator. */
4899 tree
4902 {
4910 {
4912 {
4919 }
4920 else
4921 {
4923 {
4927 else
4930 }
4932 }
4933 }
4935 {
4943 }
4946 {
4951 }
4954 {
4959 }
4960 else
4961 {
4963 /* Convert in case a char is more than one unit. */
4967 else
4969 }
4971 /* VALUE will have the middle-end integer type sizetype.
4972 However, we should really return a value of type `size_t',
4973 which is just a typedef for an ordinary integer type. */
4977 }
4979 /* Implement the __alignof keyword: Return the minimum required
4980 alignment of EXPR, measured in bytes. For VAR_DECLs,
4981 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4982 from an "aligned" __attribute__ specification). LOC is the
4983 location of the ALIGNOF operator. */
4985 tree
4987 {
4988 tree t;
4995 {
4998 }
5004 {
5011 {
5018 }
5020 }
5021 else
5025 }
5026 \f
5027 /* Handle C and C++ default attributes. */
5029 enum built_in_attribute
5030 {
5031 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5032 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5033 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5034 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5035 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5037 #undef DEF_ATTR_NULL_TREE
5038 #undef DEF_ATTR_INT
5039 #undef DEF_ATTR_STRING
5040 #undef DEF_ATTR_IDENT
5041 #undef DEF_ATTR_TREE_LIST
5042 ATTR_LAST
5043 };
5049 enum c_builtin_type
5050 {
5051 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5052 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5053 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5054 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5055 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5056 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5057 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5058 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5059 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5060 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5061 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5062 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5063 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5064 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5065 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5066 NAME,
5067 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5069 #undef DEF_PRIMITIVE_TYPE
5070 #undef DEF_FUNCTION_TYPE_0
5071 #undef DEF_FUNCTION_TYPE_1
5072 #undef DEF_FUNCTION_TYPE_2
5073 #undef DEF_FUNCTION_TYPE_3
5074 #undef DEF_FUNCTION_TYPE_4
5075 #undef DEF_FUNCTION_TYPE_5
5076 #undef DEF_FUNCTION_TYPE_6
5077 #undef DEF_FUNCTION_TYPE_7
5078 #undef DEF_FUNCTION_TYPE_VAR_0
5079 #undef DEF_FUNCTION_TYPE_VAR_1
5080 #undef DEF_FUNCTION_TYPE_VAR_2
5081 #undef DEF_FUNCTION_TYPE_VAR_3
5082 #undef DEF_FUNCTION_TYPE_VAR_4
5083 #undef DEF_FUNCTION_TYPE_VAR_5
5084 #undef DEF_POINTER_TYPE
5085 BT_LAST
5086 };
5090 /* A temporary array for c_common_nodes_and_builtins. Used in
5091 communication with def_fn_type. */
5094 /* A helper function for c_common_nodes_and_builtins. Build function type
5095 for DEF with return type RET and N arguments. If VAR is true, then the
5096 function should be variadic after those N arguments.
5098 Takes special care not to ICE if any of the types involved are
5099 error_mark_node, which indicates that said type is not in fact available
5100 (see builtin_type_for_size). In which case the function type as a whole
5101 should be error_mark_node. */
5103 static void
5105 {
5106 tree t;
5113 {
5119 }
5126 else
5129 egress:
5132 }
5134 /* Build builtin functions common to both C and C++ language
5135 frontends. */
5137 static void
5139 {
5140 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5141 builtin_types[ENUM] = VALUE;
5142 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5143 def_fn_type (ENUM, RETURN, 0, 0);
5144 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5145 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5146 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5147 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5148 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5149 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5150 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5151 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5152 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5153 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5154 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5155 ARG6) \
5156 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5157 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5158 ARG6, ARG7) \
5159 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5160 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5161 def_fn_type (ENUM, RETURN, 1, 0);
5162 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5163 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5164 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5165 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5166 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5167 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5168 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5169 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5170 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5171 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5172 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5173 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5177 #undef DEF_PRIMITIVE_TYPE
5178 #undef DEF_FUNCTION_TYPE_1
5179 #undef DEF_FUNCTION_TYPE_2
5180 #undef DEF_FUNCTION_TYPE_3
5181 #undef DEF_FUNCTION_TYPE_4
5182 #undef DEF_FUNCTION_TYPE_5
5183 #undef DEF_FUNCTION_TYPE_6
5184 #undef DEF_FUNCTION_TYPE_VAR_0
5185 #undef DEF_FUNCTION_TYPE_VAR_1
5186 #undef DEF_FUNCTION_TYPE_VAR_2
5187 #undef DEF_FUNCTION_TYPE_VAR_3
5188 #undef DEF_FUNCTION_TYPE_VAR_4
5189 #undef DEF_FUNCTION_TYPE_VAR_5
5190 #undef DEF_POINTER_TYPE
5195 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5196 NONANSI_P, ATTRS, IMPLICIT, COND) \
5197 if (NAME && COND) \
5198 def_builtin_1 (ENUM, NAME, CLASS, \
5199 builtin_types[(int) TYPE], \
5200 builtin_types[(int) LIBTYPE], \
5201 BOTH_P, FALLBACK_P, NONANSI_P, \
5202 built_in_attributes[(int) ATTRS], IMPLICIT);
5204 #undef DEF_BUILTIN
5212 }
5214 /* Like get_identifier, but avoid warnings about null arguments when
5215 the argument may be NULL for targets where GCC lacks stdint.h type
5216 information. */
5220 {
5222 }
5224 /* Build tree nodes and builtin functions common to both C and C++ language
5225 frontends. */
5227 void
5229 {
5233 tree array_domain_type;
5234 tree va_list_ref_type_node;
5235 tree va_list_arg_type_node;
5239 /* Define `int' and `char' first so that dbx will output them first. */
5243 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5244 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5245 but not C. Are the conditionals here needed? */
5251 long_unsigned_type_node);
5253 {
5255 int128_integer_type_node);
5257 int128_unsigned_type_node);
5258 }
5262 long_long_integer_type_node);
5264 long_long_unsigned_type_node);
5267 long_long_unsigned_type_node);
5270 short_unsigned_type_node);
5273 short_unsigned_type_node);
5275 /* Define both `signed char' and `unsigned char'. */
5279 /* These are types that c_common_type_for_size and
5280 c_common_type_for_mode use. */
5283 intQI_type_node));
5286 intHI_type_node));
5289 intSI_type_node));
5292 intDI_type_node));
5293 #if HOST_BITS_PER_WIDE_INT >= 64
5296 TYPE_DECL,
5298 intTI_type_node));
5299 #endif
5302 unsigned_intQI_type_node));
5305 unsigned_intHI_type_node));
5308 unsigned_intSI_type_node));
5311 unsigned_intDI_type_node));
5312 #if HOST_BITS_PER_WIDE_INT >= 64
5315 TYPE_DECL,
5317 unsigned_intTI_type_node));
5318 #endif
5320 /* Create the widest literal types. */
5321 widest_integer_literal_type_node
5325 widest_integer_literal_type_node));
5327 widest_unsigned_literal_type_node
5331 widest_unsigned_literal_type_node));
5335 pid_type_node =
5342 /* Only supported decimal floating point extension if the target
5343 actually supports underlying modes. */
5347 {
5351 }
5354 {
5359 long_long_fract_type_node);
5361 unsigned_short_fract_type_node);
5363 unsigned_fract_type_node);
5365 unsigned_long_fract_type_node);
5367 unsigned_long_long_fract_type_node);
5369 sat_short_fract_type_node);
5372 sat_long_fract_type_node);
5374 sat_long_long_fract_type_node);
5376 sat_unsigned_short_fract_type_node);
5378 sat_unsigned_fract_type_node);
5380 sat_unsigned_long_fract_type_node);
5382 sat_unsigned_long_long_fract_type_node);
5387 long_long_accum_type_node);
5389 unsigned_short_accum_type_node);
5391 unsigned_accum_type_node);
5393 unsigned_long_accum_type_node);
5395 unsigned_long_long_accum_type_node);
5397 sat_short_accum_type_node);
5400 sat_long_accum_type_node);
5402 sat_long_long_accum_type_node);
5404 sat_unsigned_short_accum_type_node);
5406 sat_unsigned_accum_type_node);
5408 sat_unsigned_long_accum_type_node);
5410 sat_unsigned_long_long_accum_type_node);
5412 }
5415 TYPE_DECL,
5417 complex_integer_type_node));
5419 TYPE_DECL,
5421 complex_float_type_node));
5423 TYPE_DECL,
5425 complex_double_type_node));
5429 complex_long_double_type_node));
5432 /* For C++, make fileptr_type_node a distinct void * type until
5433 FILE type is defined. */
5438 /* Set the TYPE_NAME for any variants that were built before
5439 record_builtin_type gave names to the built-in types. */
5440 {
5446 }
5448 /* This node must not be shared. */
5454 /* Make a type to be the domain of a few array types
5455 whose domains don't really matter.
5456 200 is small enough that it always fits in size_t
5457 and large enough that it can hold most function names for the
5458 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5461 /* Make a type for arrays of characters.
5462 With luck nothing will ever really depend on the length of this
5463 array type. */
5464 char_array_type_node
5467 /* Likewise for arrays of ints. */
5468 int_array_type_node
5472 const_string_type_node
5476 /* This is special for C++ so functions can be overloaded. */
5482 {
5485 else
5488 }
5490 /* This is for wide string constants. */
5491 wchar_array_type_node
5494 /* Define 'char16_t'. */
5499 {
5504 }
5506 /* This is for UTF-16 string constants. */
5507 char16_array_type_node
5510 /* Define 'char32_t'. */
5515 {
5520 }
5522 /* This is for UTF-32 string constants. */
5523 char32_array_type_node
5526 wint_type_node =
5529 intmax_type_node =
5531 uintmax_type_node =
5535 sig_atomic_type_node =
5538 int8_type_node =
5541 int16_type_node =
5544 int32_type_node =
5547 int64_type_node =
5550 uint8_type_node =
5553 c_uint16_type_node =
5556 c_uint32_type_node =
5559 c_uint64_type_node =
5562 int_least8_type_node =
5565 int_least16_type_node =
5568 int_least32_type_node =
5571 int_least64_type_node =
5574 uint_least8_type_node =
5577 uint_least16_type_node =
5580 uint_least32_type_node =
5583 uint_least64_type_node =
5586 int_fast8_type_node =
5589 int_fast16_type_node =
5592 int_fast32_type_node =
5595 int_fast64_type_node =
5598 uint_fast8_type_node =
5601 uint_fast16_type_node =
5604 uint_fast32_type_node =
5607 uint_fast64_type_node =
5610 intptr_type_node =
5613 uintptr_type_node =
5616 default_function_type
5618 ptrdiff_type_node
5625 va_list_type_node));
5627 {
5630 tree ptype;
5633 {
5637 ptype));
5639 }
5640 }
5643 {
5646 }
5647 else
5648 {
5651 }
5658 /* Create the built-in __null node. It is important that this is
5659 not shared. */
5663 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5665 }
5667 /* The number of named compound-literals generated thus far. */
5670 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5672 void
5674 {
5677 compound_literal_number);
5678 compound_literal_number++;
5680 }
5682 tree
5684 {
5688 }
5691 /* Linked list of disabled built-in functions. */
5694 {
5702 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5703 begins with "__builtin_", give an error. */
5705 void
5707 {
5710 else
5711 {
5716 }
5717 }
5720 /* Return true if the built-in function NAME has been disabled, false
5721 otherwise. */
5723 static bool
5725 {
5728 {
5731 }
5733 }
5736 /* Worker for DEF_BUILTIN.
5737 Possibly define a builtin function with one or two names.
5738 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5739 nonansi_p and flag_no_nonansi_builtin. */
5741 static void
5748 {
5749 tree decl;
5762 fnattrs);
5771 }
5772 \f
5773 /* Nonzero if the type T promotes to int. This is (nearly) the
5774 integral promotions defined in ISO C99 6.3.1.1/2. */
5776 bool
5778 {
5780 {
5790 /* ??? Technically all enumerations not larger than an int
5791 promote to an int. But this is used along code paths
5792 that only want to notice a size change. */
5800 }
5801 }
5803 /* Return 1 if PARMS specifies a fixed number of parameters
5804 and none of their types is affected by default promotions. */
5806 int
5808 {
5809 const_tree t;
5811 {
5828 }
5830 }
5832 /* Recursively remove any '*' or '&' operator from TYPE. */
5833 tree
5835 {
5839 }
5841 /* Recursively remove pointer or array type from TYPE. */
5842 tree
5844 {
5848 }
5850 /* Used to compare case labels. K1 and K2 are actually tree nodes
5851 representing case labels, or NULL_TREE for a `default' label.
5852 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5853 K2, and 0 if K1 and K2 are equal. */
5855 int
5857 {
5858 /* Consider a NULL key (such as arises with a `default' label) to be
5859 smaller than anything else. */
5866 }
5868 /* Process a case label, located at LOC, for the range LOW_VALUE
5869 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5870 then this case label is actually a `default' label. If only
5871 HIGH_VALUE is NULL_TREE, then case label was declared using the
5872 usual C/C++ syntax, rather than the GNU case range extension.
5873 CASES is a tree containing all the case ranges processed so far;
5874 COND is the condition for the switch-statement itself. Returns the
5875 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5876 is created. */
5878 tree
5881 {
5882 tree type;
5883 tree label;
5884 tree case_label;
5885 splay_tree_node node;
5887 /* Create the LABEL_DECL itself. */
5890 /* If there was an error processing the switch condition, bail now
5891 before we get more confused. */
5899 {
5902 }
5904 /* Case ranges are a GNU extension. */
5911 {
5916 }
5918 {
5923 }
5926 {
5927 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5928 really a case range, even though it was written that way.
5929 Remove the HIGH_VALUE to simplify later processing. */
5934 }
5936 /* See if the case is in range of the type of the original testing
5937 expression. If both low_value and high_value are out of range,
5938 don't insert the case label and return NULL_TREE. */
5944 /* Look up the LOW_VALUE in the table of case labels we already
5945 have. */
5947 /* If there was not an exact match, check for overlapping ranges.
5948 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5949 that's a `default' label and the only overlap is an exact match. */
5951 {
5952 splay_tree_node low_bound;
5953 splay_tree_node high_bound;
5955 /* Even though there wasn't an exact match, there might be an
5956 overlap between this case range and another case range.
5957 Since we've (inductively) not allowed any overlapping case
5958 ranges, we simply need to find the greatest low case label
5959 that is smaller that LOW_VALUE, and the smallest low case
5960 label that is greater than LOW_VALUE. If there is an overlap
5961 it will occur in one of these two ranges. */
5967 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5968 the LOW_VALUE, so there is no need to check unless the
5969 LOW_BOUND is in fact itself a case range. */
5975 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5976 range is bigger than the low end of the current range, so we
5977 are only interested if the current range is a real range, and
5978 not an ordinary case label. */
5980 && high_value
5982 high_value)
5985 }
5986 /* If there was an overlap, issue an error. */
5988 {
5992 {
5996 }
5998 {
6001 }
6002 else
6003 {
6007 }
6009 }
6011 /* Add a CASE_LABEL to the statement-tree. */
6013 /* Register this case label in the splay tree. */
6020 error_out:
6021 /* Add a label so that the back-end doesn't think that the beginning of
6022 the switch is unreachable. Note that we do not add a case label, as
6023 that just leads to duplicates and thence to failure later on. */
6025 {
6028 }
6030 }
6032 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6033 Used to verify that case values match up with enumerator values. */
6035 static void
6037 {
6040 /* ??? Not working too hard to print the double-word value.
6041 Should perhaps be done with %lwd in the diagnostic routines? */
6050 else
6059 buf);
6060 else
6065 }
6067 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6068 Used to verify that case values match up with enumerator values. */
6070 static int
6072 {
6076 /* Skip default case. */
6080 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6081 when we did our enum->case scan. Reset our scratch bit after. */
6084 else
6087 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6088 not set, that means that CASE_HIGH did not appear when we did our
6089 enum->case scan. Reset our scratch bit after. */
6091 {
6094 else
6096 }
6099 }
6101 /* Handle -Wswitch*. Called from the front end after parsing the
6102 switch construct. */
6103 /* ??? Should probably be somewhere generic, since other languages
6104 besides C and C++ would want this. At the moment, however, C/C++
6105 are the only tree-ssa languages that support enumerations at all,
6106 so the point is moot. */
6108 void
6111 {
6112 splay_tree_node default_node;
6113 splay_tree_node node;
6114 tree chain;
6124 /* From here on, we only care about about enumerated types. */
6128 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6132 /* Check the cases. Warn about case values which are not members of
6133 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6134 there is no default case, check that exactly all enumeration
6135 literals are covered by the cases. */
6137 /* Clearing COND if it is not an integer constant simplifies
6138 the tests inside the loop below. */
6142 /* The time complexity here is O(N*lg(N)) worst case, but for the
6143 common case of monotonically increasing enumerators, it is
6144 O(N), since the nature of the splay tree will keep the next
6145 element adjacent to the root at all times. */
6148 {
6154 {
6155 /* Mark the CASE_LOW part of the case entry as seen. */
6159 }
6161 /* Even though there wasn't an exact match, there might be a
6162 case range which includes the enumerator's value. */
6165 {
6169 {
6170 /* If we match the upper bound exactly, mark the CASE_HIGH
6171 part of the case entry as seen. */
6175 }
6176 }
6178 /* We've now determined that this enumerated literal isn't
6179 handled by the case labels of the switch statement. */
6181 /* If the switch expression is a constant, we only really care
6182 about whether that constant is handled by the switch. */
6186 /* If there is a default_node, the only relevant option is
6187 Wswitch-enum. Otherwise, if both are enabled then we prefer
6188 to warn using -Wswitch because -Wswitch is enabled by -Wall
6189 while -Wswitch-enum is explicit. */
6192 ? OPT_Wswitch_enum
6196 }
6198 /* Warn if there are case expressions that don't correspond to
6199 enumerators. This can occur since C and C++ don't enforce
6200 type-checking of assignments to enumeration variables.
6202 The time complexity here is now always O(N) worst case, since
6203 we should have marked both the lower bound and upper bound of
6204 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6205 above. This scan also resets those fields. */
6208 }
6210 /* Finish an expression taking the address of LABEL (an
6211 IDENTIFIER_NODE). Returns an expression for the address.
6213 LOC is the location for the expression returned. */
6215 tree
6217 {
6218 tree result;
6228 else
6229 {
6232 /* The current function is not necessarily uninlinable.
6233 Computed gotos are incompatible with inlining, but the value
6234 here could be used only in a diagnostic, for example. */
6236 }
6239 }
6240 \f
6242 /* Given a boolean expression ARG, return a tree representing an increment
6243 or decrement (as indicated by CODE) of ARG. The front end must check for
6244 invalid cases (e.g., decrement in C++). */
6245 tree
6247 {
6248 tree val;
6253 {
6276 }
6279 }
6280 \f
6281 /* Built-in macros for stddef.h and stdint.h, that require macros
6282 defined in this file. */
6283 void
6285 {
6348 }
6350 static void
6352 {
6353 /* Fill in the built_in_attributes array. */
6354 #define DEF_ATTR_NULL_TREE(ENUM) \
6355 built_in_attributes[(int) ENUM] = NULL_TREE;
6356 #define DEF_ATTR_INT(ENUM, VALUE) \
6357 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6358 #define DEF_ATTR_STRING(ENUM, VALUE) \
6359 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6360 #define DEF_ATTR_IDENT(ENUM, STRING) \
6361 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6362 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6363 built_in_attributes[(int) ENUM] \
6364 = tree_cons (built_in_attributes[(int) PURPOSE], \
6365 built_in_attributes[(int) VALUE], \
6366 built_in_attributes[(int) CHAIN]);
6368 #undef DEF_ATTR_NULL_TREE
6369 #undef DEF_ATTR_INT
6370 #undef DEF_ATTR_IDENT
6371 #undef DEF_ATTR_TREE_LIST
6372 }
6374 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6375 identifier as an argument, so the front end shouldn't look it up. */
6377 bool
6379 {
6382 /* Unknown attribute that we'll end up ignoring, return true so we
6383 don't complain about an identifier argument. */
6389 else
6391 }
6393 /* Attribute handlers common to C front ends. */
6395 /* Handle a "packed" attribute; arguments as in
6396 struct attribute_spec.handler. */
6398 static tree
6401 {
6403 {
6407 }
6409 {
6411 /* Still pack bitfields. */
6416 else
6418 }
6419 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6420 used for DECL_REGISTER. It wouldn't mean anything anyway.
6421 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6422 that changes what the typedef is typing. */
6423 else
6424 {
6427 }
6430 }
6432 /* Handle a "nocommon" attribute; arguments as in
6433 struct attribute_spec.handler. */
6435 static tree
6439 {
6442 else
6443 {
6446 }
6449 }
6451 /* Handle a "common" attribute; arguments as in
6452 struct attribute_spec.handler. */
6454 static tree
6457 {
6460 else
6461 {
6464 }
6467 }
6469 /* Handle a "noreturn" attribute; arguments as in
6470 struct attribute_spec.handler. */
6472 static tree
6475 {
6478 /* See FIXME comment in c_common_attribute_table. */
6485 = build_pointer_type
6488 else
6489 {
6492 }
6495 }
6497 /* Handle a "hot" and attribute; arguments as in
6498 struct attribute_spec.handler. */
6500 static tree
6503 {
6506 {
6508 {
6512 }
6513 /* Most of the rest of the hot processing is done later with
6514 lookup_attribute. */
6515 }
6516 else
6517 {
6520 }
6523 }
6525 /* Handle a "cold" and attribute; arguments as in
6526 struct attribute_spec.handler. */
6528 static tree
6531 {
6534 {
6536 {
6540 }
6541 /* Most of the rest of the cold processing is done later with
6542 lookup_attribute. */
6543 }
6544 else
6545 {
6548 }
6551 }
6553 /* Handle a "no_sanitize_address" attribute; arguments as in
6554 struct attribute_spec.handler. */
6556 static tree
6559 {
6561 {
6564 }
6567 }
6569 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6570 struct attribute_spec.handler. */
6572 static tree
6575 {
6584 }
6586 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6587 struct attribute_spec.handler. */
6589 static tree
6592 {
6594 {
6597 }
6600 }
6602 /* Handle a "noinline" attribute; arguments as in
6603 struct attribute_spec.handler. */
6605 static tree
6609 {
6612 else
6613 {
6616 }
6619 }
6621 /* Handle a "noclone" attribute; arguments as in
6622 struct attribute_spec.handler. */
6624 static tree
6628 {
6630 {
6633 }
6636 }
6638 /* Handle a "always_inline" attribute; arguments as in
6639 struct attribute_spec.handler. */
6641 static tree
6646 {
6648 {
6649 /* Set the attribute and mark it for disregarding inline
6650 limits. */
6652 }
6653 else
6654 {
6657 }
6660 }
6662 /* Handle a "gnu_inline" attribute; arguments as in
6663 struct attribute_spec.handler. */
6665 static tree
6670 {
6672 {
6673 /* Do nothing else, just set the attribute. We'll get at
6674 it later with lookup_attribute. */
6675 }
6676 else
6677 {
6680 }
6683 }
6685 /* Handle a "leaf" attribute; arguments as in
6686 struct attribute_spec.handler. */
6688 static tree
6692 {
6694 {
6697 }
6699 {
6702 }
6705 }
6707 /* Handle an "artificial" attribute; arguments as in
6708 struct attribute_spec.handler. */
6710 static tree
6715 {
6717 {
6718 /* Do nothing else, just set the attribute. We'll get at
6719 it later with lookup_attribute. */
6720 }
6721 else
6722 {
6725 }
6728 }
6730 /* Handle a "flatten" attribute; arguments as in
6731 struct attribute_spec.handler. */
6733 static tree
6735 tree args ATTRIBUTE_UNUSED,
6737 {
6739 /* Do nothing else, just set the attribute. We'll get at
6740 it later with lookup_attribute. */
6741 ;
6742 else
6743 {
6746 }
6749 }
6751 /* Handle a "warning" or "error" attribute; arguments as in
6752 struct attribute_spec.handler. */
6754 static tree
6757 {
6760 /* Do nothing else, just set the attribute. We'll get at
6761 it later with lookup_attribute. */
6762 ;
6763 else
6764 {
6767 }
6770 }
6772 /* Handle a "used" attribute; arguments as in
6773 struct attribute_spec.handler. */
6775 static tree
6778 {
6784 {
6789 }
6790 else
6791 {
6794 }
6797 }
6799 /* Handle a "unused" attribute; arguments as in
6800 struct attribute_spec.handler. */
6802 static tree
6805 {
6807 {
6815 {
6820 }
6821 else
6822 {
6825 }
6826 }
6827 else
6828 {
6832 }
6835 }
6837 /* Handle a "externally_visible" attribute; arguments as in
6838 struct attribute_spec.handler. */
6840 static tree
6845 {
6849 {
6852 {
6856 }
6857 }
6858 else
6859 {
6862 }
6865 }
6867 /* Handle a "const" attribute; arguments as in
6868 struct attribute_spec.handler. */
6870 static tree
6873 {
6876 /* See FIXME comment on noreturn in c_common_attribute_table. */
6882 = build_pointer_type
6885 else
6886 {
6889 }
6892 }
6894 /* Handle a "transparent_union" attribute; arguments as in
6895 struct attribute_spec.handler. */
6897 static tree
6901 {
6902 tree type;
6913 {
6914 /* Make sure that the first field will work for a transparent union.
6915 If the type isn't complete yet, leave the check to the code in
6916 finish_struct. */
6918 {
6924 }
6927 {
6928 /* If the type isn't complete yet, setting the flag
6929 on a variant wouldn't ever be checked. */
6933 /* build_duplicate_type doesn't work for C++. */
6937 /* A type variant isn't good enough, since we don't a cast
6938 to such a type removed as a no-op. */
6940 }
6944 }
6946 ignored:
6949 }
6951 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6952 get the requested priority for a constructor or destructor,
6953 possibly issuing diagnostics for invalid or reserved
6954 priorities. */
6956 static priority_type
6958 {
6959 HOST_WIDE_INT pri;
6960 tree arg;
6966 {
6969 else
6972 }
6985 {
6988 "destructor priorities from 0 to %d are reserved "
6990 MAX_RESERVED_INIT_PRIORITY);
6991 else
6993 "constructor priorities from 0 to %d are reserved "
6995 MAX_RESERVED_INIT_PRIORITY);
6996 }
6999 invalid:
7002 MAX_INIT_PRIORITY);
7003 else
7005 MAX_INIT_PRIORITY);
7007 }
7009 /* Handle a "constructor" attribute; arguments as in
7010 struct attribute_spec.handler. */
7012 static tree
7016 {
7023 {
7024 priority_type priority;
7029 }
7030 else
7031 {
7034 }
7037 }
7039 /* Handle a "destructor" attribute; arguments as in
7040 struct attribute_spec.handler. */
7042 static tree
7046 {
7053 {
7054 priority_type priority;
7059 }
7060 else
7061 {
7064 }
7067 }
7069 /* Nonzero if the mode is a valid vector mode for this architecture.
7070 This returns nonzero even if there is no hardware support for the
7071 vector mode, but we can emulate with narrower modes. */
7073 static int
7075 {
7079 /* Doh! What's going on? */
7088 /* Hardware support. Woo hoo! */
7094 /* We should probably return 1 if requesting V4DI and we have no DI,
7095 but we have V2DI, but this is probably very unlikely. */
7097 /* If we have support for the inner mode, we can safely emulate it.
7098 We may not have V2DI, but me can emulate with a pair of DIs. */
7100 }
7103 /* Handle a "mode" attribute; arguments as in
7104 struct attribute_spec.handler. */
7106 static tree
7109 {
7117 else
7118 {
7123 tree typefm;
7128 {
7134 }
7136 /* Change this type to have a type with the specified mode.
7137 First check for the special modes. */
7150 else
7153 {
7156 }
7159 {
7162 }
7166 {
7198 }
7200 {
7203 }
7206 {
7211 {
7214 }
7218 else
7221 }
7222 else
7223 {
7224 /* For fixed-point modes, we need to test if the signness of type
7225 and the machine mode are consistent. */
7228 {
7231 }
7232 /* For fixed-point modes, we need to pass saturating info. */
7236 }
7239 {
7242 }
7244 {
7245 /* For enumeral types, copy the precision from the integer
7246 type returned above. If not an INTEGER_TYPE, we can't use
7247 this mode for this type. */
7249 {
7252 }
7255 {
7258 }
7259 else
7260 {
7261 /* We cannot build a type variant, as there's code that assumes
7262 that TYPE_MAIN_VARIANT has the same mode. This includes the
7263 debug generators. Instead, create a subrange type. This
7264 results in all of the enumeral values being emitted only once
7265 in the original, and the subtype gets them by reference. */
7268 else
7271 }
7272 }
7276 {
7279 }
7282 }
7285 }
7287 /* Handle a "section" attribute; arguments as in
7288 struct attribute_spec.handler. */
7290 static tree
7293 {
7297 {
7303 {
7307 {
7309 "section attribute cannot be specified for "
7312 }
7314 /* The decl may have already been given a section attribute
7315 from a previous declaration. Ensure they match. */
7319 {
7323 }
7327 {
7330 }
7331 else
7333 }
7334 else
7335 {
7338 }
7339 }
7340 else
7341 {
7345 }
7348 }
7350 /* Check whether ALIGN is a valid user-specified alignment. If so,
7351 return its base-2 log; if not, output an error and return -1. If
7352 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7353 no error. */
7354 int
7356 {
7361 {
7364 }
7369 {
7372 }
7374 {
7377 }
7379 }
7381 /*
7382 If in c++-11, check if the c++-11 alignment constraint with respect
7383 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7384 c++-11 mode, does nothing.
7386 [dcl.align]2/ says:
7388 [* if the constant expression evaluates to a fundamental alignment,
7389 the alignment requirement of the declared entity shall be the
7390 specified fundamental alignment.
7392 * if the constant expression evaluates to an extended alignment
7393 and the implementation supports that alignment in the context
7394 of the declaration, the alignment of the declared entity shall
7395 be that alignment
7397 * if the constant expression evaluates to an extended alignment
7398 and the implementation does not support that alignment in the
7399 context of the declaration, the program is ill-formed]. */
7401 static bool
7405 {
7418 {
7420 {
7421 /* For file scope variables and static members, the target
7422 supports alignments that are at most
7423 MAX_OFILE_ALIGNMENT. */
7426 }
7427 else
7428 {
7429 #ifdef BIGGEST_FIELD_ALIGNMENT
7430 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7431 #else
7432 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7433 #endif
7434 /* For non-static members, the target supports either
7435 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7436 if it is defined or BIGGEST_ALIGNMENT. */
7441 #undef MAX_TARGET_FIELD_ALIGNMENT
7442 /* For stack variables, the target supports at most
7443 MAX_STACK_ALIGNMENT. */
7447 }
7448 }
7450 {
7451 /* Let's be liberal for types. */
7454 }
7462 }
7464 /* Handle a "aligned" attribute; arguments as in
7465 struct attribute_spec.handler. */
7467 static tree
7470 {
7479 {
7483 }
7491 {
7494 /* If we have a TYPE_DECL, then copy the type, so that we
7495 don't accidentally modify a builtin type. See pushdecl. */
7498 {
7505 }
7506 else
7511 }
7514 {
7517 }
7520 /* C++-11 [dcl.align/4]:
7522 When multiple alignment-specifiers are specified for an
7523 entity, the alignment requirement shall be set to the
7524 strictest specified alignment.
7526 This formally comes from the c++11 specification but we are
7527 doing it for the GNU attribute syntax as well. */
7531 {
7536 else
7540 }
7541 else
7542 {
7545 }
7548 }
7550 /* Handle a "weak" attribute; arguments as in
7551 struct attribute_spec.handler. */
7553 static tree
7558 {
7561 {
7564 }
7566 {
7570 }
7574 else
7578 }
7580 /* Handle an "alias" or "ifunc" attribute; arguments as in
7581 struct attribute_spec.handler, except that IS_ALIAS tells us
7582 whether this is an alias as opposed to ifunc attribute. */
7584 static tree
7587 {
7592 {
7595 }
7599 /* A static variable declaration is always a tentative definition,
7600 but the alias is a non-tentative definition which overrides. */
7603 {
7607 }
7611 {
7615 }
7617 /* Note that the very first time we process a nested declaration,
7618 decl_function_context will not be set. Indeed, *would* never
7619 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7620 we do below. After such frobbery, pushdecl would set the context.
7621 In any case, this is never what we want. */
7623 {
7624 tree id;
7628 {
7632 }
7634 /* This counts as a use of the object pointed to. */
7639 else
7643 /* ifuncs are also aliases, so set that attribute too. */
7646 }
7647 else
7648 {
7651 }
7654 }
7656 /* Handle an "alias" or "ifunc" attribute; arguments as in
7657 struct attribute_spec.handler. */
7659 static tree
7662 {
7664 }
7666 /* Handle an "alias" or "ifunc" attribute; arguments as in
7667 struct attribute_spec.handler. */
7669 static tree
7672 {
7674 }
7676 /* Handle a "weakref" attribute; arguments as in struct
7677 attribute_spec.handler. */
7679 static tree
7682 {
7685 /* We must ignore the attribute when it is associated with
7686 local-scoped decls, since attribute alias is ignored and many
7687 such symbols do not even have a DECL_WEAK field. */
7689 || current_function_decl
7691 {
7695 }
7698 {
7702 }
7704 /* The idea here is that `weakref("name")' mutates into `weakref,
7705 alias("name")', and weakref without arguments, in turn,
7706 implicitly adds weak. */
7709 {
7716 }
7717 else
7718 {
7723 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7724 and that isn't supported; and because it wants to add it to
7725 the list of weak decls, which isn't helpful. */
7727 }
7730 }
7732 /* Handle an "visibility" attribute; arguments as in
7733 struct attribute_spec.handler. */
7735 static tree
7739 {
7745 {
7749 {
7751 name);
7753 }
7755 {
7759 }
7760 }
7762 {
7765 }
7768 {
7771 }
7773 /* If this is a type, set the visibility on the type decl. */
7775 {
7780 {
7782 name);
7784 }
7785 }
7795 else
7796 {
7797 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7799 }
7803 {
7817 }
7822 /* Go ahead and attach the attribute to the node as well. This is needed
7823 so we can determine whether we have VISIBILITY_DEFAULT because the
7824 visibility was not specified, or because it was explicitly overridden
7825 from the containing scope. */
7828 }
7830 /* Determine the ELF symbol visibility for DECL, which is either a
7831 variable or a function. It is an error to use this function if a
7832 definition of DECL is not available in this translation unit.
7833 Returns true if the final visibility has been determined by this
7834 function; false if the caller is free to make additional
7835 modifications. */
7837 bool
7839 {
7843 /* If the user explicitly specified the visibility with an
7844 attribute, honor that. DECL_VISIBILITY will have been set during
7845 the processing of the attribute. We check for an explicit
7846 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7847 to distinguish the use of an attribute from the use of a "#pragma
7848 GCC visibility push(...)"; in the latter case we still want other
7849 considerations to be able to overrule the #pragma. */
7851 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7856 /* Set default visibility to whatever the user supplied with
7857 visibility_specified depending on #pragma GCC visibility. */
7859 {
7862 {
7865 /* If visibility changed and DECL already has DECL_RTL, ensure
7866 symbol flags are updated. */
7871 }
7872 }
7874 }
7876 /* Handle an "tls_model" attribute; arguments as in
7877 struct attribute_spec.handler. */
7879 static tree
7882 {
7883 tree id;
7890 {
7893 }
7898 {
7901 }
7911 else
7912 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7916 }
7918 /* Handle a "no_instrument_function" attribute; arguments as in
7919 struct attribute_spec.handler. */
7921 static tree
7926 {
7930 {
7934 }
7936 {
7940 }
7941 else
7945 }
7947 /* Handle a "malloc" attribute; arguments as in
7948 struct attribute_spec.handler. */
7950 static tree
7953 {
7957 else
7958 {
7961 }
7964 }
7966 /* Handle a "alloc_size" attribute; arguments as in
7967 struct attribute_spec.handler. */
7969 static tree
7972 {
7975 {
7982 {
7987 }
7988 }
7990 }
7992 /* Handle a "fn spec" attribute; arguments as in
7993 struct attribute_spec.handler. */
7995 static tree
7999 {
8004 }
8006 /* Handle a "warn_unused" attribute; arguments as in
8007 struct attribute_spec.handler. */
8009 static tree
8011 tree args ATTRIBUTE_UNUSED,
8013 {
8015 /* Do nothing else, just set the attribute. We'll get at
8016 it later with lookup_attribute. */
8017 ;
8018 else
8019 {
8022 }
8025 }
8027 /* Handle a "returns_twice" attribute; arguments as in
8028 struct attribute_spec.handler. */
8030 static tree
8033 {
8036 else
8037 {
8040 }
8043 }
8045 /* Handle a "no_limit_stack" attribute; arguments as in
8046 struct attribute_spec.handler. */
8048 static tree
8053 {
8057 {
8061 }
8063 {
8067 }
8068 else
8072 }
8074 /* Handle a "pure" attribute; arguments as in
8075 struct attribute_spec.handler. */
8077 static tree
8080 {
8083 /* ??? TODO: Support types. */
8084 else
8085 {
8088 }
8091 }
8093 /* Digest an attribute list destined for a transactional memory statement.
8094 ALLOWED is the set of attributes that are allowed for this statement;
8095 return the attribute we parsed. Multiple attributes are never allowed. */
8097 int
8099 {
8104 {
8112 {
8115 }
8118 {
8121 }
8124 else
8126 }
8129 }
8131 /* Transform a TM attribute name into a maskable integer and back.
8132 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8133 to how the lack of an attribute is treated. */
8135 int
8137 {
8151 }
8153 tree
8155 {
8158 {
8176 }
8178 }
8180 /* Return the first TM attribute seen in LIST. */
8182 tree
8184 {
8186 {
8190 }
8192 }
8194 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8195 Here we accept only function types, and verify that none of the other
8196 function TM attributes are also applied. */
8197 /* ??? We need to accept class types for C++, but not C. This greatly
8198 complicates this function, since we can no longer rely on the extra
8199 processing given by function_type_required. */
8201 static tree
8204 {
8205 /* Only one path adds the attribute; others don't. */
8209 {
8212 /* Only tm_callable and tm_safe apply to classes. */
8215 /* FALLTHRU */
8219 {
8222 ;
8225 else
8227 }
8231 {
8234 {
8239 }
8240 }
8241 /* FALLTHRU */
8244 /* If a function is next, pass it on to be tried next. */
8248 ignored:
8251 }
8254 }
8256 /* Handle the TM_WRAP attribute; arguments as in
8257 struct attribute_spec.handler. */
8259 static tree
8262 {
8265 /* We don't need the attribute even on success, since we
8266 record the entry in an external table. */
8271 else
8272 {
8278 else
8279 {
8283 {
8287 else
8289 }
8290 else
8292 }
8293 }
8296 }
8298 /* Ignore the given attribute. Used when this attribute may be usefully
8299 overridden by the target, but is not used generically. */
8301 static tree
8305 {
8308 }
8310 /* Handle a "no vops" attribute; arguments as in
8311 struct attribute_spec.handler. */
8313 static tree
8317 {
8321 }
8323 /* Handle a "deprecated" attribute; arguments as in
8324 struct attribute_spec.handler. */
8326 static tree
8330 {
8338 {
8341 }
8344 {
8355 else
8357 }
8359 {
8364 }
8365 else
8369 {
8372 {
8378 }
8381 else
8383 }
8386 }
8388 /* Handle a "vector_size" attribute; arguments as in
8389 struct attribute_spec.handler. */
8391 static tree
8395 {
8405 {
8408 }
8410 /* Get the vector size (in bytes). */
8413 /* We need to provide for vector pointers, vector arrays, and
8414 functions returning vectors. For example:
8416 __attribute__((vector_size(16))) short *foo;
8418 In this case, the mode is SI, but the type being modified is
8419 HI, so we need to look further. */
8428 /* Get the mode of the type being modified. */
8439 {
8442 }
8445 {
8448 }
8451 {
8454 }
8456 /* Calculate how many units fit in the vector. */
8459 {
8462 }
8466 /* Build back pointers if needed. */
8470 }
8472 /* Handle the "nonnull" attribute. */
8473 static tree
8477 {
8481 /* If no arguments are specified, all pointer arguments should be
8482 non-null. Verify a full prototype is given so that the arguments
8483 will have the correct types when we actually check them later. */
8485 {
8487 {
8490 }
8492 }
8494 /* Argument list specified. Verify that each argument number references
8495 a pointer argument. */
8497 {
8501 {
8506 }
8509 {
8510 function_args_iterator iter;
8511 tree argument;
8515 {
8519 }
8523 {
8528 }
8531 {
8536 }
8537 }
8538 }
8541 }
8543 /* Check the argument list of a function call for null in argument slots
8544 that are marked as requiring a non-null pointer argument. The NARGS
8545 arguments are passed in the array ARGARRAY.
8546 */
8548 static void
8550 {
8551 tree a;
8559 /* See if any of the nonnull attributes has no arguments. If so,
8560 then every pointer argument is checked (in which case the check
8561 for pointer type is done in check_nonnull_arg). */
8563 do
8571 else
8572 {
8573 /* Walk the argument list. If we encounter an argument number we
8574 should check for non-null, do it. */
8576 {
8578 {
8582 }
8587 }
8588 }
8589 }
8591 /* Check that the Nth argument of a function call (counting backwards
8592 from the end) is a (pointer)0. The NARGS arguments are passed in the
8593 array ARGARRAY. */
8595 static void
8597 {
8601 {
8604 tree sentinel;
8605 function_args_iterator iter;
8606 tree t;
8608 /* Skip over the named arguments. */
8610 {
8613 len++;
8614 }
8617 {
8620 }
8622 /* The sentinel must be one of the varargs, i.e.
8623 in position >= the number of fixed arguments. */
8625 {
8629 }
8631 /* Validate the sentinel. */
8635 /* Although __null (in C++) is only an integer we allow it
8636 nevertheless, as we are guaranteed that it's exactly
8637 as wide as a pointer, and we don't want to force
8638 users to cast the NULL they have written there.
8639 We warn with -Wstrict-null-sentinel, though. */
8642 }
8643 }
8645 /* Helper for check_function_nonnull; given a list of operands which
8646 must be non-null in ARGS, determine if operand PARAM_NUM should be
8647 checked. */
8649 static bool
8651 {
8655 {
8662 }
8664 }
8666 /* Check that the function argument PARAM (which is operand number
8667 PARAM_NUM) is non-null. This is called by check_function_nonnull
8668 via check_function_arguments_recurse. */
8670 static void
8673 {
8674 /* Just skip checking the argument if it's not a pointer. This can
8675 happen if the "nonnull" attribute was given without an operand
8676 list (which means to check every pointer argument). */
8684 }
8686 /* Helper for nonnull attribute handling; fetch the operand number
8687 from the attribute argument list. */
8689 static bool
8691 {
8692 /* Verify the arg number is a constant. */
8699 }
8701 /* Handle a "nothrow" attribute; arguments as in
8702 struct attribute_spec.handler. */
8704 static tree
8707 {
8710 /* ??? TODO: Support types. */
8711 else
8712 {
8715 }
8718 }
8720 /* Handle a "cleanup" attribute; arguments as in
8721 struct attribute_spec.handler. */
8723 static tree
8726 {
8730 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8731 for global destructors in C++. This requires infrastructure that
8732 we don't have generically at the moment. It's also not a feature
8733 we'd be missing too much, since we do have attribute constructor. */
8735 {
8739 }
8741 /* Verify that the argument is a function in scope. */
8742 /* ??? We could support pointers to functions here as well, if
8743 that was considered desirable. */
8746 {
8750 }
8753 {
8757 }
8759 /* That the function has proper type is checked with the
8760 eventual call to build_function_call. */
8763 }
8765 /* Handle a "warn_unused_result" attribute. No special handling. */
8767 static tree
8771 {
8772 /* Ignore the attribute for functions not returning any value. */
8774 {
8777 }
8780 }
8782 /* Handle a "sentinel" attribute. */
8784 static tree
8787 {
8789 {
8793 }
8794 else
8795 {
8797 {
8801 }
8802 }
8805 {
8809 {
8813 }
8814 else
8815 {
8817 {
8821 }
8822 }
8823 }
8826 }
8828 /* Handle a "type_generic" attribute. */
8830 static tree
8834 {
8835 /* Ensure we have a function type. */
8838 /* Ensure we have a variadic function. */
8842 }
8844 /* Handle a "target" attribute. */
8846 static tree
8849 {
8850 /* Ensure we have a function type. */
8852 {
8855 }
8857 flags))
8861 }
8863 /* Arguments being collected for optimization. */
8868 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8869 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8870 false for #pragma GCC optimize. */
8872 bool
8874 {
8882 tree ap;
8884 /* Build up argv vector. Just in case the string is stored away, use garbage
8885 collected strings. */
8890 {
8894 {
8898 }
8901 {
8902 /* Split string into multiple substrings. */
8910 {
8917 {
8921 }
8922 else
8923 {
8926 }
8930 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8931 options. */
8933 {
8938 else
8942 }
8945 {
8948 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8949 itself is -Os, and any other switch begins with a -f. */
8955 }
8960 }
8962 }
8963 }
8973 /* Now parse the options. */
8983 /* Don't allow changing -fstrict-aliasing. */
8988 }
8990 /* For handling "optimize" attribute. arguments as in
8991 struct attribute_spec.handler. */
8993 static tree
8996 {
8997 /* Ensure we have a function type. */
8999 {
9002 }
9003 else
9004 {
9008 /* Save current options. */
9011 /* If we previously had some optimization options, use them as the
9012 default. */
9017 /* Parse options, and update the vector. */
9022 /* Restore current options. */
9024 }
9027 }
9029 /* Handle a "no_split_stack" attribute. */
9031 static tree
9036 {
9040 {
9044 }
9046 {
9050 }
9053 }
9055 /* Handle a "returns_nonnull" attribute; arguments as in
9056 struct attribute_spec.handler. */
9058 static tree
9061 {
9062 // Even without a prototype we still have a return type we can check.
9064 {
9067 }
9069 }
9071 \f
9072 /* Check for valid arguments being passed to a function with FNTYPE.
9073 There are NARGS arguments in the array ARGARRAY. */
9074 void
9076 {
9077 /* Check for null being passed in a pointer argument that must be
9078 non-null. We also need to do this if format checking is enabled. */
9083 /* Check for errors in format strings. */
9090 }
9092 /* Generic argument checking recursion routine. PARAM is the argument to
9093 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9094 once the argument is resolved. CTX is context for the callback. */
9095 void
9100 {
9104 {
9105 /* Strip coercion. */
9109 }
9112 {
9114 tree attrs;
9117 /* See if this is a call to a known internationalization function
9118 that modifies a format arg. Such a function may have multiple
9119 format_arg attributes (for example, ngettext). */
9122 attrs;
9125 {
9126 tree inner_arg;
9127 tree format_num_expr;
9130 call_expr_arg_iterator iter;
9132 /* Extract the argument number, which was previously checked
9133 to be valid. */
9145 {
9150 }
9151 }
9153 /* If we found a format_arg attribute and did a recursive check,
9154 we are done with checking this argument. Otherwise, we continue
9155 and this will be considered a non-literal. */
9158 }
9161 {
9162 /* Check both halves of the conditional expression. */
9168 }
9171 }
9173 /* Checks for a builtin function FNDECL that the number of arguments
9174 NARGS against the required number REQUIRED and issues an error if
9175 there is a mismatch. Returns true if the number of arguments is
9176 correct, otherwise false. */
9178 static bool
9180 {
9182 {
9186 }
9188 {
9192 }
9194 }
9196 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9197 Returns false if there was an error, otherwise true. */
9199 bool
9201 {
9207 {
9217 {
9219 {
9223 }
9225 }
9235 {
9242 {
9246 }
9248 }
9253 {
9258 {
9262 }
9265 {
9267 fndecl);
9269 }
9271 }
9276 {
9278 {
9281 }
9283 }
9288 }
9289 }
9291 /* Function to help qsort sort FIELD_DECLs by name order. */
9293 int
9295 {
9300 /* A nontype is "greater" than a type. */
9309 }
9312 gt_pointer_operator new_value;
9316 /* This routine compares two fields like field_decl_cmp but using the
9317 pointer operator in resort_data. */
9319 static int
9321 {
9326 /* A nontype is "greater" than a type. */
9332 {
9339 }
9341 }
9343 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9345 void
9348 gt_pointer_operator new_value,
9350 {
9355 resort_field_decl_cmp);
9356 }
9358 /* Subroutine of c_parse_error.
9359 Return the result of concatenating LHS and RHS. RHS is really
9360 a string literal, its first character is indicated by RHS_START and
9361 RHS_SIZE is its length (including the terminating NUL character).
9363 The caller is responsible for deleting the returned pointer. */
9367 {
9373 }
9375 /* Issue the error given by GMSGID, indicating that it occurred before
9376 TOKEN, which had the associated VALUE. */
9378 void
9381 {
9382 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9392 {
9397 {
9410 }
9414 else
9420 }
9442 {
9447 }
9455 {
9460 }
9461 else
9465 {
9468 }
9469 #undef catenate_messages
9470 }
9472 /* Mapping for cpp message reasons to the options that enable them. */
9474 struct reason_option_codes_t
9475 {
9478 };
9498 };
9500 /* Return the gcc option code associated with the reason for a cpp
9501 message, or 0 if none. */
9503 static int
9505 {
9509 {
9512 }
9514 }
9516 /* Callback from cpp_error for PFILE to print diagnostics from the
9517 preprocessor. The diagnostic is of type LEVEL, with REASON set
9518 to the reason code if LEVEL is represents a warning, at location
9519 LOCATION unless this is after lexing and the compiler's location
9520 should be used instead, with column number possibly overridden by
9521 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9522 the arguments. Returns true if a diagnostic was emitted, false
9523 otherwise. */
9525 bool
9529 {
9530 diagnostic_info diagnostic;
9531 diagnostic_t dlevel;
9536 {
9541 /* Fall through. */
9566 }
9579 }
9581 /* Convert a character from the host to the target execution character
9582 set. cpplib handles this, mostly. */
9584 HOST_WIDE_INT
9586 {
9587 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9588 zero-extended under -fno-signed-char. cpplib insists that characters
9589 and character constants are always unsigned. Hence we must convert
9590 back and forth. */
9598 else
9600 }
9602 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9603 references with an INDIRECT_REF of a constant at the bottom; much like the
9604 traditional rendering of offsetof as a macro. Return the folded result. */
9606 tree
9608 {
9612 {
9628 {
9631 }
9641 {
9645 }
9659 /* Check if the offset goes beyond the upper bound of the array. */
9661 {
9667 {
9671 {
9672 tree v;
9679 {
9687 }
9688 /* Don't warn if the array might be considered a poor
9689 man's flexible array member with a very permissive
9690 definition thereof. */
9694 "index %E denotes an offset "
9697 }
9698 }
9699 }
9706 /* Handle static members of volatile structs. */
9713 }
9716 }
9718 /* Likewise, but convert it to the return type of offsetof. */
9720 tree
9722 {
9724 }
9726 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9727 expression, because B will always be true. */
9729 void
9731 {
9734 "the omitted middle operand in ?: will always be %<true%>, "
9736 }
9738 /* Give an error for storing into ARG, which is 'const'. USE indicates
9739 how ARG was being used. */
9741 void
9743 {
9746 /* Using this macro rather than (for example) arrays of messages
9747 ensures that all the format strings are checked at compile
9748 time. */
9749 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9750 : (use == lv_increment ? (I) \
9751 : (use == lv_decrement ? (D) : (AS))))
9753 {
9764 else
9770 }
9776 arg);
9782 arg);
9784 {
9794 arg);
9795 }
9801 arg);
9802 else
9807 arg);
9808 }
9810 /* Print an error message for an invalid lvalue. USE says
9811 how the lvalue is being used and so selects the error message. LOC
9812 is the location for the error. */
9814 void
9816 {
9818 {
9836 }
9837 }
9839 /* Print an error message for an invalid indirection of type TYPE.
9840 ERRSTRING is the name of the operator for the indirection. */
9842 void
9844 {
9846 {
9854 type);
9859 type);
9864 type);
9869 type);
9873 }
9874 }
9875 \f
9876 /* *PTYPE is an incomplete array. Complete it with a domain based on
9877 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9878 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9879 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9881 int
9883 {
9891 {
9893 {
9894 int eltsize
9897 }
9899 {
9903 {
9907 }
9908 else
9909 {
9910 tree curindex;
9921 {
9925 else
9926 {
9928 {
9929 /* Since we treat size types now as ordinary
9930 unsigned types, we need an explicit overflow
9931 check. */
9935 }
9937 size_one_node);
9938 }
9941 }
9943 {
9947 }
9948 }
9949 }
9950 else
9951 {
9952 /* Make an error message unless that happened already. */
9955 }
9956 }
9957 else
9958 {
9962 }
9969 else
9972 /* Using build_distinct_type_copy and modifying things afterward instead
9973 of using build_array_type to create a new type preserves all of the
9974 TYPE_LANG_FLAG_? bits that the front end may have set. */
9982 /* Make sure we have the canonical MAIN_TYPE. */
9985 hashcode);
9988 /* Fix the canonical type. */
9998 else
10003 else
10009 {
10011 /* If we proceed with the array type as it is, we'll eventually
10012 crash in tree_low_cst(). */
10014 }
10018 }
10020 /* Like c_mark_addressable but don't check register qualifier. */
10021 void
10023 {
10029 }
10032 \f
10033 /* Used to help initialize the builtin-types.def table. When a type of
10034 the correct size doesn't exist, use error_mark_node instead of NULL.
10035 The later results in segfaults even when a decl using the type doesn't
10036 get invoked. */
10038 tree
10040 {
10043 }
10045 /* A helper function for resolve_overloaded_builtin in resolving the
10046 overloaded __sync_ builtins. Returns a positive power of 2 if the
10047 first operand of PARAMS is a pointer to a supported data type.
10048 Returns 0 if an error is encountered. */
10050 static int
10052 {
10053 tree type;
10057 {
10060 }
10074 incompatible:
10077 }
10079 /* A helper function for resolve_overloaded_builtin. Adds casts to
10080 PARAMS to make arguments match up with those of FUNCTION. Drops
10081 the variadic arguments at the end. Returns false if some error
10082 was encountered; true on success. */
10084 static bool
10087 {
10088 function_args_iterator iter;
10089 tree ptype;
10093 /* We've declared the implementation functions to use "volatile void *"
10094 as the pointer parameter, so we shouldn't get any complaints from the
10095 call to check_function_arguments what ever type the user used. */
10099 /* For the rest of the values, we need to cast these to FTYPE, so that we
10100 don't get warnings for passing pointer types, etc. */
10103 {
10107 /* XXX void_type_node belies the abstraction. */
10113 {
10116 }
10118 /* Only convert parameters if arg_type is unsigned integer type with
10119 new format sync routines, i.e. don't attempt to convert pointer
10120 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10121 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10122 kinds). */
10124 {
10125 /* Ideally for the first conversion we'd use convert_for_assignment
10126 so that we get warnings for anything that doesn't match the pointer
10127 type. This isn't portable across the C and C++ front ends atm. */
10132 }
10135 }
10137 /* __atomic routines are not variadic. */
10139 {
10142 }
10144 /* The definition of these primitives is variadic, with the remaining
10145 being "an optional list of variables protected by the memory barrier".
10146 No clue what that's supposed to mean, precisely, but we consider all
10147 call-clobbered variables to be protected so we're safe. */
10151 }
10153 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10154 RESULT to make it match the type of the first pointer argument in
10155 PARAMS. */
10157 static tree
10159 {
10164 /* New format doesn't require casting unless the types are the same size. */
10167 else
10169 }
10171 /* This function verifies the PARAMS to generic atomic FUNCTION.
10172 It returns the size if all the parameters are the same size, otherwise
10173 0 is returned if the parameters are invalid. */
10175 static int
10178 {
10183 tree type_0;
10185 /* Determine the parameter makeup. */
10187 {
10203 }
10206 {
10209 }
10211 /* Get type of first parameter, and determine its size. */
10214 {
10216 function);
10218 }
10220 /* Types must be compile time constant sizes. */
10222 {
10225 function);
10227 }
10231 /* Zero size objects are not allowed. */
10233 {
10236 function);
10238 }
10240 /* Check each other parameter is a pointer and the same size. */
10242 {
10245 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10249 {
10251 function);
10253 }
10256 {
10258 function);
10260 }
10261 }
10263 /* Check memory model parameters for validity. */
10265 {
10268 {
10271 {
10274 function);
10275 }
10276 }
10277 else
10279 {
10281 function);
10283 }
10284 }
10287 }
10290 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10291 at the beginning of the parameter list PARAMS representing the size of the
10292 objects. This is to match the library ABI requirement. LOC is the location
10293 of the function call.
10294 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10295 returned to allow the external call to be constructed. */
10297 static tree
10300 {
10301 tree size_node;
10303 /* Insert a SIZE_T parameter as the first param. If there isn't
10304 enough space, allocate a new vector and recursively re-build with that. */
10306 {
10309 tree f;
10318 }
10320 /* Add the size parameter and leave as a function call for processing. */
10324 }
10327 /* This will process an __atomic_exchange function call, determine whether it
10328 needs to be mapped to the _N variation, or turned into a library call.
10329 LOC is the location of the builtin call.
10330 FUNCTION is the DECL that has been invoked;
10331 PARAMS is the argument list for the call. The return value is non-null
10332 TRUE is returned if it is translated into the proper format for a call to the
10333 external library, and NEW_RETURN is set the tree for that function.
10334 FALSE is returned if processing for the _N variation is required, and
10335 NEW_RETURN is set to the the return value the result is copied into. */
10336 static bool
10339 {
10344 /* Size of 0 is an error condition. */
10346 {
10349 }
10351 /* If not a lock-free size, change to the library generic format. */
10353 {
10356 }
10358 /* Otherwise there is a lockfree match, transform the call from:
10359 void fn(T* mem, T* desired, T* return, model)
10360 into
10361 *return = (T) (fn (In* mem, (In) *desired, model)) */
10368 /* Create pointer to appropriate size. */
10372 /* Convert object pointer to required type. */
10375 /* Convert new value to required type, and dereference it. */
10380 /* Move memory model to the 3rd position, and end param list. */
10384 /* Convert return pointer and dereference it for later assignment. */
10388 }
10391 /* This will process an __atomic_compare_exchange function call, determine
10392 whether it needs to be mapped to the _N variation, or turned into a lib call.
10393 LOC is the location of the builtin call.
10394 FUNCTION is the DECL that has been invoked;
10395 PARAMS is the argument list for the call. The return value is non-null
10396 TRUE is returned if it is translated into the proper format for a call to the
10397 external library, and NEW_RETURN is set the tree for that function.
10398 FALSE is returned if processing for the _N variation is required. */
10400 static bool
10404 {
10409 /* Size of 0 is an error condition. */
10411 {
10414 }
10416 /* If not a lock-free size, change to the library generic format. */
10418 {
10419 /* The library generic format does not have the weak parameter, so
10420 remove it from the param list. Since a parameter has been removed,
10421 we can be sure that there is room for the SIZE_T parameter, meaning
10422 there will not be a recursive rebuilding of the parameter list, so
10423 there is no danger this will be done twice. */
10425 {
10429 }
10432 }
10434 /* Otherwise, there is a match, so the call needs to be transformed from:
10435 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10436 into
10437 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10443 /* Create pointer to appropriate size. */
10447 /* Convert object pointer to required type. */
10451 /* Convert expected pointer to required type. */
10455 /* Convert desired value to required type, and dereference it. */
10460 /* The rest of the parameters are fine. NULL means no special return value
10461 processing.*/
10464 }
10467 /* This will process an __atomic_load function call, determine whether it
10468 needs to be mapped to the _N variation, or turned into a library call.
10469 LOC is the location of the builtin call.
10470 FUNCTION is the DECL that has been invoked;
10471 PARAMS is the argument list for the call. The return value is non-null
10472 TRUE is returned if it is translated into the proper format for a call to the
10473 external library, and NEW_RETURN is set the tree for that function.
10474 FALSE is returned if processing for the _N variation is required, and
10475 NEW_RETURN is set to the the return value the result is copied into. */
10477 static bool
10480 {
10485 /* Size of 0 is an error condition. */
10487 {
10490 }
10492 /* If not a lock-free size, change to the library generic format. */
10494 {
10497 }
10499 /* Otherwise, there is a match, so the call needs to be transformed from:
10500 void fn(T* mem, T* return, model)
10501 into
10502 *return = (T) (fn ((In *) mem, model)) */
10508 /* Create pointer to appropriate size. */
10512 /* Convert object pointer to required type. */
10516 /* Move memory model to the 2nd position, and end param list. */
10520 /* Convert return pointer and dereference it for later assignment. */
10524 }
10527 /* This will process an __atomic_store function call, determine whether it
10528 needs to be mapped to the _N variation, or turned into a library call.
10529 LOC is the location of the builtin call.
10530 FUNCTION is the DECL that has been invoked;
10531 PARAMS is the argument list for the call. The return value is non-null
10532 TRUE is returned if it is translated into the proper format for a call to the
10533 external library, and NEW_RETURN is set the tree for that function.
10534 FALSE is returned if processing for the _N variation is required, and
10535 NEW_RETURN is set to the the return value the result is copied into. */
10537 static bool
10540 {
10545 /* Size of 0 is an error condition. */
10547 {
10550 }
10552 /* If not a lock-free size, change to the library generic format. */
10554 {
10557 }
10559 /* Otherwise, there is a match, so the call needs to be transformed from:
10560 void fn(T* mem, T* value, model)
10561 into
10562 fn ((In *) mem, (In) *value, model) */
10567 /* Create pointer to appropriate size. */
10571 /* Convert object pointer to required type. */
10575 /* Convert new value to required type, and dereference it. */
10580 /* The memory model is in the right spot already. Return is void. */
10584 }
10587 /* Some builtin functions are placeholders for other expressions. This
10588 function should be called immediately after parsing the call expression
10589 before surrounding code has committed to the type of the expression.
10591 LOC is the location of the builtin call.
10593 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10594 PARAMS is the argument list for the call. The return value is non-null
10595 when expansion is complete, and null if normal processing should
10596 continue. */
10598 tree
10601 {
10607 {
10613 else
10617 }
10619 /* Handle BUILT_IN_NORMAL here. */
10621 {
10626 {
10627 /* Handle these 4 together so that they can fall through to the next
10628 case if the call is transformed to an _N variant. */
10630 {
10632 {
10636 /* Change to the _N variant. */
10639 }
10642 {
10644 params,
10647 /* Change to the _N variant. */
10650 }
10652 {
10656 /* Change to the _N variant. */
10659 }
10661 {
10665 /* Change to the _N variant. */
10668 }
10671 }
10672 /* Fallthrough to the normal processing. */
10673 }
10690 {
10692 /* Fallthru for parameter processing. */
10693 }
10710 {
10721 orig_format))
10733 /* If new_return is set, assign function to that expr and cast the
10734 result to void since the generic interface returned void. */
10736 {
10737 /* Cast function result from I{1,2,4,8,16} to the required type. */
10740 result);
10744 }
10746 }
10750 }
10751 }
10753 /* vector_types_compatible_elements_p is used in type checks of vectors
10754 values used as operands of binary operators. Where it returns true, and
10755 the other checks of the caller succeed (being vector types in he first
10756 place, and matching number of elements), we can just treat the types
10757 as essentially the same.
10758 Contrast with vector_targets_convertible_p, which is used for vector
10759 pointer types, and vector_types_convertible_p, which will allow
10760 language-specific matches under the control of flag_lax_vector_conversions,
10761 and might still require a conversion. */
10762 /* True if vector types T1 and T2 can be inputs to the same binary
10763 operator without conversion.
10764 We don't check the overall vector size here because some of our callers
10765 want to give different error messages when the vectors are compatible
10766 except for the element count. */
10768 bool
10770 {
10783 /* Equality works here because c_common_signed_type uses
10784 TYPE_MAIN_VARIANT. */
10792 }
10794 /* Check for missing format attributes on function pointers. LTYPE is
10795 the new type or left-hand side type. RTYPE is the old type or
10796 right-hand side type. Returns TRUE if LTYPE is missing the desired
10797 attribute. */
10799 bool
10801 {
10803 tree ra;
10809 {
10810 tree la;
10815 }
10816 else
10818 }
10820 /* Subscripting with type char is likely to lose on a machine where
10821 chars are signed. So warn on any machine, but optionally. Don't
10822 warn for unsigned char since that type is safe. Don't warn for
10823 signed char because anyone who uses that must have done so
10824 deliberately. Furthermore, we reduce the false positive load by
10825 warning only for non-constant value of type char. */
10827 void
10829 {
10833 }
10835 /* Implement -Wparentheses for the unexpected C precedence rules, to
10836 cover cases like x + y << z which readers are likely to
10837 misinterpret. We have seen an expression in which CODE is a binary
10838 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10839 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10840 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10841 expression was not formed using a binary or unary operator, or it
10842 was enclosed in parentheses. */
10844 void
10848 {
10852 /* This macro tests that the expression ARG with original tree code
10853 CODE appears to be a boolean expression. or the result of folding a
10854 boolean expression. */
10855 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10856 (truth_value_p (TREE_CODE (ARG)) \
10857 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10859 || ((CODE) != INTEGER_CST \
10860 && (integer_onep (ARG) || integer_zerop (ARG))))
10863 {
10912 /* Check cases like x|y==z */
10919 /* Check cases like !x | y */
10923 "suggest parentheses around operand of "
10936 /* Check cases like x^y==z */
10958 /* Check cases like x&y==z */
10965 /* Check cases like !x & y */
10969 "suggest parentheses around operand of "
10992 {
10997 "comparisons like %<X<=Y<=Z%> do not "
11003 "comparisons like %<X<=Y<=Z%> do not "
11005 }
11007 }
11008 #undef NOT_A_BOOLEAN_EXPR_P
11009 }
11011 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11013 void
11015 {
11017 {
11020 else
11022 }
11023 }
11025 /* Warn for division by zero according to the value of DIVISOR. LOC
11026 is the location of the division operator. */
11028 void
11030 {
11031 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11032 about division by zero. Do not issue a warning if DIVISOR has a
11033 floating-point type, since we consider 0.0/0.0 a valid way of
11034 generating a NaN. */
11038 }
11040 /* Subroutine of build_binary_op. Give warnings for comparisons
11041 between signed and unsigned quantities that may fail. Do the
11042 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11043 so that casts will be considered, but default promotions won't
11044 be.
11046 LOCATION is the location of the comparison operator.
11048 The arguments of this function map directly to local variables
11049 of build_binary_op. */
11051 void
11056 {
11061 /* In C++, check for comparison of different enum types. */
11067 {
11071 }
11073 /* Do not warn if the comparison is being done in a signed type,
11074 since the signed type will only be chosen if it can represent
11075 all the values of the unsigned type. */
11078 /* Do not warn if both operands are unsigned. */
11081 else
11082 {
11088 else
11096 /* Do not warn if the signed quantity is an unsuffixed integer
11097 literal (or some static constant expression involving such
11098 literals or a conditional expression involving such literals)
11099 and it is non-negative. */
11102 /* Do not warn if the comparison is an equality operation, the
11103 unsigned quantity is an integral constant, and it would fit
11104 in the result if the result were signed. */
11109 /* In C, do not warn if the unsigned quantity is an enumeration
11110 constant and its maximum value would fit in the result if the
11111 result were signed. */
11117 else
11119 OPT_Wsign_compare,
11121 }
11123 /* Warn if two unsigned values are being compared in a size larger
11124 than their original size, and one (and only one) is the result of
11125 a `~' operator. This comparison will always fail.
11127 Also warn if one operand is a constant, and the constant does not
11128 have all bits set that are set in the ~ operand when it is
11129 extended. */
11136 {
11143 {
11144 tree primop;
11150 {
11154 }
11155 else
11156 {
11160 }
11165 {
11168 {
11172 else
11175 }
11176 }
11177 }
11185 }
11186 }
11188 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11189 type via c_common_type. If -Wdouble-promotion is in use, and the
11190 conditions for warning have been met, issue a warning. GMSGID is
11191 the warning message. It must have two %T specifiers for the type
11192 that was converted (generally "float") and the type to which it was
11193 converted (generally "double), respectively. LOC is the location
11194 to which the awrning should refer. */
11196 void
11199 {
11200 tree source_type;
11204 /* If the conversion will not occur at run-time, there is no need to
11205 warn about it. */
11217 else
11220 }
11222 /* Setup a TYPE_DECL node as a typedef representation.
11224 X is a TYPE_DECL for a typedef statement. Create a brand new
11225 ..._TYPE node (which will be just a variant of the existing
11226 ..._TYPE node with identical properties) and then install X
11227 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11229 The whole point here is to end up with a situation where each
11230 and every ..._TYPE node the compiler creates will be uniquely
11231 associated with AT MOST one node representing a typedef name.
11232 This way, even though the compiler substitutes corresponding
11233 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11234 early on, later parts of the compiler can always do the reverse
11235 translation and get back the corresponding typedef name. For
11236 example, given:
11238 typedef struct S MY_TYPE;
11239 MY_TYPE object;
11241 Later parts of the compiler might only know that `object' was of
11242 type `struct S' if it were not for code just below. With this
11243 code however, later parts of the compiler see something like:
11245 struct S' == struct S
11246 typedef struct S' MY_TYPE;
11247 struct S' object;
11249 And they can then deduce (from the node for type struct S') that
11250 the original object declaration was:
11252 MY_TYPE object;
11254 Being able to do this is important for proper support of protoize,
11255 and also for generating precise symbolic debugging information
11256 which takes full account of the programmer's (typedef) vocabulary.
11258 Obviously, we don't want to generate a duplicate ..._TYPE node if
11259 the TYPE_DECL node that we are now processing really represents a
11260 standard built-in type. */
11262 void
11264 {
11268 {
11271 }
11274 {
11282 }
11283 }
11285 /* Record the types used by the current global variable declaration
11286 being parsed, so that we can decide later to emit their debug info.
11287 Those types are in types_used_by_cur_var_decl, and we are going to
11288 store them in the types_used_by_vars_hash hash table.
11289 DECL is the declaration of the global variable that has been parsed. */
11291 void
11293 {
11297 {
11300 }
11301 }
11303 /* If DECL is a typedef that is declared in the current function,
11304 record it for the purpose of -Wunused-local-typedefs. */
11306 void
11308 {
11313 /* if this is not a locally defined typedef then we are not
11314 interested. */
11321 }
11323 /* If T is a TYPE_DECL declared locally, mark it as used. */
11325 void
11327 {
11332 }
11334 /* Warn if there are some unused locally defined typedefs in the
11335 current function. */
11337 void
11339 {
11341 tree decl;
11342 /* The number of times we have emitted -Wunused-local-typedefs
11343 warnings. If this is different from errorcount, that means some
11344 unrelated errors have been issued. In which case, we'll avoid
11345 emitting "unused-local-typedefs" warnings. */
11357 {
11361 OPT_Wunused_local_typedefs,
11364 }
11367 }
11369 /* The C and C++ parsers both use vectors to hold function arguments.
11370 For efficiency, we keep a cache of unused vectors. This is the
11371 cache. */
11376 /* Return a new vector from the cache. If the cache is empty,
11377 allocate a new vector. These vectors are GC'ed, so it is OK if the
11378 pointer is not released.. */
11382 {
11385 else
11386 {
11387 /* Passing 0 to vec::alloc returns NULL, and our callers require
11388 that we always return a non-NULL value. The vector code uses
11389 4 when growing a NULL vector, so we do too. */
11393 }
11394 }
11396 /* Release a vector of trees back to the cache. */
11398 void
11400 {
11402 {
11405 }
11406 }
11408 /* Get a new tree vector holding a single tree. */
11412 {
11416 }
11418 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11422 {
11427 }
11429 /* Get a new tree vector which is a copy of an existing one. */
11433 {
11436 tree t;
11443 }
11445 /* Return true if KEYWORD starts a type specifier. */
11447 bool
11449 {
11451 {
11481 }
11482 }
11484 /* Return true if KEYWORD names a type qualifier. */
11486 bool
11488 {
11490 {
11497 }
11498 }
11500 /* Return true if KEYWORD names a storage class specifier.
11502 RID_TYPEDEF is not included in this list despite `typedef' being
11503 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11504 such for syntactic convenience only. */
11506 bool
11508 {
11510 {
11520 }
11521 }
11523 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11525 static bool
11527 {
11529 {
11537 }
11538 }
11540 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11541 declaration-specifier (C99 6.7). */
11543 bool
11545 {
11552 {
11559 }
11560 }
11562 /* Initialize language-specific-bits of tree_contains_struct. */
11564 void
11566 {
11570 }
11572 /* Build a user-defined numeric literal out of an integer constant type VALUE
11573 with identifier SUFFIX. */
11575 tree
11578 {
11585 }
11587 /* For vector[index], convert the vector to a
11588 pointer of the underlying type. */
11589 void
11592 {
11594 {
11596 tree type1;
11610 }
11611 }
11613 /* Determine which of the operands, if any, is a scalar that needs to be
11614 converted to a vector, for the range of operations. */
11615 enum stv_conv
11618 {
11627 {
11628 /* Most GENERIC binary expressions require homogeneous arguments.
11629 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11630 argument that is a vector and a second one that is a scalar, so
11631 we never return stv_secondarg for them. */
11636 {
11638 {
11643 }
11644 else
11646 }
11653 /* ... fall through ... */
11674 /* What about UNLT_EXPR? */
11676 {
11677 tree tmp;
11679 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11682 }
11686 {
11688 {
11693 }
11695 }
11697 /* Allow integer --> real conversion if safe. */
11701 {
11703 {
11708 }
11710 }
11713 }
11716 }
11718 /* Return true iff ALIGN is an integral constant that is a fundamental
11719 alignment, as defined by [basic.align] in the c++-11
11720 specifications.
11722 That is:
11724 [A fundamental alignment is represented by an alignment less than or
11725 equal to the greatest alignment supported by the implementation
11726 in all contexts, which is equal to
11727 alignof(max_align_t)]. */
11729 bool
11731 {
11734 }