| blob | 835d22c6cf90028b7dad2669c96254bdfe13d801 |
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. */
388 /* Reserved words. The third field is a mask: keywords are disabled
389 if they match the mask.
391 Masks for languages:
392 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
393 C --std=c99: D_CXXONLY | D_OBJC
394 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
395 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
396 C++ --std=c0x: D_CONLY | D_OBJC
397 ObjC++ is like C++ except that D_OBJC is not set
399 If -fno-asm is used, D_ASM is added to the mask. If
400 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
401 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
402 In C with -Wc++-compat, we warn if D_CXXWARN is set.
404 Note the complication of the D_CXX_OBJC keywords. These are
405 reserved words such as 'class'. In C++, 'class' is a reserved
406 word. In Objective-C++ it is too. In Objective-C, it is a
407 reserved word too, but only if it follows an '@' sign.
408 */
410 {
570 /* These Objective-C keywords are recognized only immediately after
571 an '@'. */
588 /* These are recognized only in protocol-qualifier context
589 (see above) */
596 /* These are recognized inside a property attribute list */
605 };
610 /* Table of machine-independent attributes common to all C-like languages. */
612 {
613 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
614 affects_type_identity } */
621 /* FIXME: logically, noreturn attributes should be listed as
622 "false, true, true" and apply to function types. But implementing this
623 would require all the places in the compiler that use TREE_THIS_VOLATILE
624 on a decl to identify non-returning functions to be located and fixed
625 to check the function type instead. */
650 /* The same comments as for noreturn attributes apply to const ones. */
674 handle_no_instrument_function_attribute,
692 /* ??? These two attributes didn't make the transition from the
693 Intel language document to the multi-vendor language document. */
698 /* For internal use (marking of builtins) only. The name contains space
699 to prevent its usage in source code. */
721 /* For internal use (marking of builtins) only. The name contains space
722 to prevent its usage in source code. */
733 handle_no_address_safety_analysis_attribute,
736 handle_no_sanitize_address_attribute,
739 handle_no_sanitize_undefined_attribute,
749 /* For internal use only. The leading '*' both prevents its usage in
750 source code and signals that it may be overridden by machine tables. */
755 /* For internal use (marking of builtins and runtime functions) only.
756 The name contains space to prevent its usage in source code. */
772 };
774 /* Give the specifications for the format attributes, used by C and all
775 descendants. */
778 {
779 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
780 affects_type_identity } */
786 };
788 /* Return identifier for address space AS. */
792 {
796 }
798 /* Push current bindings for the function name VAR_DECLS. */
800 void
802 {
807 {
811 {
813 saved);
815 }
816 }
818 /* Normally they'll have been NULL, so only push if we've got a
819 stack, or they are non-NULL. */
821 saved_function_name_decls);
822 }
824 /* Finish up the current bindings, adding them into the current function's
825 statement tree. This must be done _before_ finish_stmt_tree is called.
826 If there is no current function, we must be at file scope and no statements
827 are involved. Pop the previous bindings. */
829 void
831 {
840 {
848 }
854 {
855 /* We had saved values, restore them. */
856 tree saved;
859 {
864 }
866 }
868 }
870 /* Return the text name of the current function, suitably prettified
871 by PRETTY_P. Return string must be freed by caller. */
875 {
882 {
885 }
898 {
901 }
904 }
906 /* Return the VAR_DECL for a const char array naming the current
907 function. If the VAR_DECL has not yet been created, create it
908 now. RID indicates how it should be formatted and IDENTIFIER_NODE
909 ID is its name (unfortunately C and C++ hold the RID values of
910 keywords in different places, so we can't derive RID from ID in
911 this language independent code. LOC is the location of the
912 function. */
914 tree
916 {
926 {
927 /* If a tree is built here, it would normally have the lineno of
928 the current statement. Later this tree will be moved to the
929 beginning of the function and this line number will be wrong.
930 To avoid this problem set the lineno to 0 here; that prevents
931 it from appearing in the RTL. */
932 tree stmts;
940 saved_function_name_decls
944 }
949 }
951 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
953 tree
955 {
960 /* Compute the number of elements, for the array type. */
962 {
965 }
967 {
970 }
972 {
975 }
976 else
977 {
980 }
982 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
983 limit in C++98 Annex B is very large (65536) and is not normative,
984 so we do not diagnose it (warn_overlength_strings is forced off
985 in c_common_post_options). */
987 {
991 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
992 separate the %d from the 'C'. 'ISO' should not be
993 translated, but it may be moved after 'C%d' in languages
994 where modifiers follow nouns. */
996 "string length %qd is greater than the length %qd "
999 }
1001 /* Create the array type for the string constant. The ISO C++
1002 standard says that a string literal has type `const char[N]' or
1003 `const wchar_t[N]'. We use the same logic when invoked as a C
1004 front-end with -Wwrite-strings.
1005 ??? We should change the type of an expression depending on the
1006 state of a warning flag. We should just be warning -- see how
1007 this is handled in the C++ front-end for the deprecated implicit
1008 conversion from string literals to `char*' or `wchar_t*'.
1010 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1011 array type being the unqualified version of that type.
1012 Therefore, if we are constructing an array of const char, we must
1013 construct the matching unqualified array type first. The C front
1014 end does not require this, but it does no harm, so we do it
1015 unconditionally. */
1026 }
1027 \f
1028 /* If DISABLE is true, stop issuing warnings. This is used when
1029 parsing code that we know will not be executed. This function may
1030 be called multiple times, and works as a stack. */
1032 static void
1034 {
1036 {
1039 }
1040 }
1042 /* If ENABLE is true, reenable issuing warnings. */
1044 static void
1046 {
1048 {
1051 }
1052 }
1054 /* Fully fold EXPR, an expression that was not folded (beyond integer
1055 constant expressions and null pointer constants) when being built
1056 up. If IN_INIT, this is in a static initializer and certain
1057 changes are made to the folding done. Clear *MAYBE_CONST if
1058 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1059 expression because it contains an evaluated operator (in C99) or an
1060 operator outside of sizeof returning an integer constant (in C90)
1061 not permitted in constant expressions, or because it contains an
1062 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1063 set to true by callers before calling this function.) Return the
1064 folded expression. Function arguments have already been folded
1065 before calling this function, as have the contents of SAVE_EXPR,
1066 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1067 C_MAYBE_CONST_EXPR. */
1069 tree
1071 {
1072 tree ret;
1078 /* This function is not relevant to C++ because C++ folds while
1079 parsing, and may need changes to be correct for C++ when C++
1080 stops folding while parsing. */
1087 {
1090 }
1097 }
1099 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1100 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1101 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1102 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1103 both evaluated and unevaluated subexpressions while
1104 *MAYBE_CONST_ITSELF is carried from only evaluated
1105 subexpressions). */
1107 static tree
1110 {
1122 /* This function is not relevant to C++ because C++ folds while
1123 parsing, and may need changes to be correct for C++ when C++
1124 stops folding while parsing. */
1128 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1129 anything else not counted as an expression cannot usefully be
1130 folded further at this point. */
1136 /* Operands of variable-length expressions (function calls) have
1137 already been folded, as have __builtin_* function calls, and such
1138 expressions cannot occur in constant expressions. */
1140 {
1144 }
1147 {
1156 else
1159 }
1161 /* Assignment, increment, decrement, function call and comma
1162 operators, and statement expressions, cannot occur in constant
1163 expressions if evaluated / outside of sizeof. (Function calls
1164 were handled above, though VA_ARG_EXPR is treated like a function
1165 call here, and statement expressions are handled through
1166 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1168 {
1188 }
1190 /* Fold individual tree codes as appropriate. */
1192 {
1194 /* Any non-constancy will have been marked in a containing
1195 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1203 maybe_const_itself);
1208 {
1211 }
1220 maybe_const_itself);
1223 maybe_const_itself);
1229 {
1233 }
1275 /* Binary operations evaluating both arguments (increment and
1276 decrement are binary internally in GCC). */
1280 maybe_const_itself);
1288 /* The RHS of a MODIFY_EXPR was fully folded when building that
1289 expression for the sake of conversion warnings. */
1292 maybe_const_itself);
1296 ret = in_init
1299 else
1312 {
1323 }
1329 CASE_CONVERT:
1339 /* Unary operations. */
1342 maybe_const_itself);
1346 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1347 not prepared to deal with them if they occur in initializers. */
1355 ret = in_init
1358 else
1363 {
1367 }
1369 {
1372 CASE_CONVERT:
1373 /* Don't warn about explicit conversions. We will already
1374 have warned about suspect implicit conversions. */
1381 }
1386 /* Binary operations not necessarily evaluating both
1387 arguments. */
1394 ? truthvalue_false_node
1402 ret = in_init
1405 else
1410 && op0_const
1411 && op0_const_self
1417 && op0_const_self
1443 else
1448 && op0_const
1449 && op0_const_self
1453 && op0_const_self
1457 && op0_const
1458 && op0_const_self
1462 && op0_const_self
1468 /* Each case where an operand with excess precision may be
1469 encountered must remove the EXCESS_PRECISION_EXPR around
1470 inner operands and possibly put one around the whole
1471 expression or possibly convert to the semantic type (which
1472 c_fully_fold does); we cannot tell at this stage which is
1473 appropriate in any particular case. */
1477 /* Various codes may appear through folding built-in functions
1478 and their arguments. */
1480 }
1482 out:
1483 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1484 have been done by this point, so remove them again. */
1488 {
1492 }
1496 }
1498 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1499 return EXP. Otherwise, return either EXP or its known constant
1500 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1501 Is the BLKmode test appropriate? */
1503 tree
1505 {
1506 tree ret;
1508 /* This function is only used by C, for c_fully_fold and other
1509 optimization, and may not be correct for C++. */
1520 /* Avoid unwanted tree sharing between the initializer and current
1521 function's body where the tree can be modified e.g. by the
1522 gimplifier. */
1526 }
1528 /* Print a warning if a constant expression had overflow in folding.
1529 Invoke this function on every expression that the language
1530 requires to be a constant expression.
1531 Note the ANSI C standard says it is erroneous for a
1532 constant expression to overflow. */
1534 void
1536 {
1544 }
1546 /* The same as above but print an unconditional error. */
1547 void
1549 {
1556 }
1558 /* Print a warning if an expression had overflow in folding and its
1559 operands hadn't.
1561 Invoke this function on every expression that
1562 (1) appears in the source code, and
1563 (2) is a constant expression that overflowed, and
1564 (3) is not already checked by convert_and_check;
1565 however, do not invoke this function on operands of explicit casts
1566 or when the expression is the result of an operator and any operand
1567 already overflowed. */
1569 void
1571 {
1576 {
1605 }
1606 }
1608 /* Warn about uses of logical || / && operator in a context where it
1609 is likely that the bitwise equivalent was intended by the
1610 programmer. We have seen an expression in which CODE is a binary
1611 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1612 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1613 void
1617 {
1629 /* Warn if &&/|| are being used in a context where it is
1630 likely that the bitwise equivalent was intended by the
1631 programmer. That is, an expression such as op && MASK
1632 where op should not be any boolean expression, nor a
1633 constant, and mask seems to be a non-boolean integer constant. */
1641 {
1645 else
1650 }
1652 /* We do not warn for constants because they are typical of macro
1653 expansions that test for features. */
1657 /* This warning only makes sense with logical operands. */
1665 /* We first test whether either side separately is trivially true
1666 (with OR) or trivially false (with AND). If so, do not warn.
1667 This is a common idiom for testing ranges of data types in
1668 portable code. */
1675 /* If this is an OR operation, invert both sides; now, the result
1676 should be always false to get a warning. */
1690 /* If this is an OR operation, invert both sides; now, the result
1691 should be always false to get a warning. */
1699 /* If both expressions have the same operand, if we can merge the
1700 ranges, and if the range test is always false, then warn. */
1707 {
1710 "logical %<or%> "
1712 else
1714 "logical %<and%> "
1716 }
1717 }
1720 /* Warn if EXP contains any computations whose results are not used.
1721 Return true if a warning is printed; false otherwise. LOCUS is the
1722 (potential) location of the expression. */
1724 bool
1726 {
1727 restart:
1731 /* Don't warn about void constructs. This includes casting to void,
1732 void function calls, and statement expressions with a final cast
1733 to void. */
1741 {
1757 /* For a binding, warn if no side effect within it. */
1769 /* In && or ||, warn if 2nd operand has no side effect. */
1776 /* Let people do `(foo (), 0)' without a warning. */
1783 /* If this is an expression with side effects, don't warn; this
1784 case commonly appears in macro expansions. */
1790 /* Don't warn about automatic dereferencing of references, since
1791 the user cannot control it. */
1793 {
1796 }
1797 /* Fall through. */
1800 /* Referencing a volatile value is a side effect, so don't warn. */
1805 /* If this is an expression which has no operands, there is no value
1806 to be unused. There are no such language-independent codes,
1807 but front ends may define such. */
1811 warn:
1813 }
1814 }
1817 /* Print a warning about casts that might indicate violation
1818 of strict aliasing rules if -Wstrict-aliasing is used and
1819 strict aliasing mode is in effect. OTYPE is the original
1820 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1822 bool
1824 {
1825 /* Strip pointer conversion chains and get to the correct original type. */
1833 /* If the type we are casting to is a ref-all pointer
1834 dereferencing it is always valid. */
1841 {
1842 /* Casting the address of an object to non void pointer. Warn
1843 if the cast breaks type based aliasing. */
1845 {
1849 }
1850 else
1851 {
1852 /* warn_strict_aliasing >= 3. This includes the default (3).
1853 Only warn if the cast is dereferenced immediately. */
1854 alias_set_type set1 =
1860 {
1864 }
1867 {
1871 }
1872 }
1873 }
1874 else
1876 {
1877 /* At this level, warn for any conversions, even if an address is
1878 not taken in the same statement. This will likely produce many
1879 false positives, but could be useful to pinpoint problems that
1880 are not revealed at higher levels. */
1885 {
1889 }
1890 }
1893 }
1895 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1896 sizeof as last operand of certain builtins. */
1898 void
1902 {
1906 location_t loc;
1914 {
1918 /* FALLTHRU */
1926 /* FALLTHRU */
1985 }
2013 {
2017 {
2020 "argument to %<sizeof%> in %qD call is the same "
2021 "expression as the destination; did you mean to "
2027 "argument to %<sizeof%> in %qD call is the same "
2028 "expression as the destination; did you mean to "
2030 else
2032 "argument to %<sizeof%> in %qD call is the same "
2033 "expression as the destination; did you mean to "
2036 }
2039 && !strop
2042 {
2044 "argument to %<sizeof%> in %qD call is the same "
2045 "pointer type %qT as the destination; expected %qT "
2049 }
2050 }
2053 {
2057 {
2060 "argument to %<sizeof%> in %qD call is the same "
2061 "expression as the source; did you mean to "
2067 "argument to %<sizeof%> in %qD call is the same "
2068 "expression as the source; did you mean to "
2070 else
2072 "argument to %<sizeof%> in %qD call is the same "
2073 "expression as the source; did you mean to "
2076 }
2079 && !strop
2082 {
2084 "argument to %<sizeof%> in %qD call is the same "
2085 "pointer type %qT as the source; expected %qT "
2089 }
2090 }
2093 {
2097 {
2100 "argument to %<sizeof%> in %qD call is the same "
2101 "expression as the first source; did you mean to "
2107 "argument to %<sizeof%> in %qD call is the same "
2108 "expression as the first source; did you mean to "
2110 else
2112 "argument to %<sizeof%> in %qD call is the same "
2113 "expression as the first source; did you mean to "
2116 }
2119 && !strop
2122 {
2124 "argument to %<sizeof%> in %qD call is the same "
2125 "pointer type %qT as the first source; expected %qT "
2129 }
2130 }
2133 {
2137 {
2140 "argument to %<sizeof%> in %qD call is the same "
2141 "expression as the second source; did you mean to "
2147 "argument to %<sizeof%> in %qD call is the same "
2148 "expression as the second source; did you mean to "
2150 else
2152 "argument to %<sizeof%> in %qD call is the same "
2153 "expression as the second source; did you mean to "
2156 }
2159 && !strop
2162 {
2164 "argument to %<sizeof%> in %qD call is the same "
2165 "pointer type %qT as the second source; expected %qT "
2169 }
2170 }
2172 }
2174 /* Warn for unlikely, improbable, or stupid DECL declarations
2175 of `main'. */
2177 void
2179 {
2180 function_args_iterator iter;
2181 tree type;
2185 {
2186 /* XXX void_type_node belies the abstraction. */
2192 {
2214 "third argument of %q+D should probably be "
2217 }
2218 }
2220 /* It is intentional that this message does not mention the third
2221 argument because it's only mentioned in an appendix of the
2222 standard. */
2226 }
2228 /* vector_targets_convertible_p is used for vector pointer types. The
2229 callers perform various checks that the qualifiers are satisfactory,
2230 while OTOH vector_targets_convertible_p ignores the number of elements
2231 in the vectors. That's fine with vector pointers as we can consider,
2232 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2233 and that does not require and conversion of the pointer values.
2234 In contrast, vector_types_convertible_p and
2235 vector_types_compatible_elements_p are used for vector value types. */
2236 /* True if pointers to distinct types T1 and T2 can be converted to
2237 each other without an explicit cast. Only returns true for opaque
2238 vector types. */
2239 bool
2241 {
2248 }
2250 /* vector_types_convertible_p is used for vector value types.
2251 It could in principle call vector_targets_convertible_p as a subroutine,
2252 but then the check for vector type would be duplicated with its callers,
2253 and also the purpose of vector_targets_convertible_p would become
2254 muddled.
2255 Where vector_types_convertible_p returns true, a conversion might still be
2256 needed to make the types match.
2257 In contrast, vector_targets_convertible_p is used for vector pointer
2258 values, and vector_types_compatible_elements_p is used specifically
2259 in the context for binary operators, as a check if use is possible without
2260 conversion. */
2261 /* True if vector types T1 and T2 can be converted to each other
2262 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2263 can only be converted with -flax-vector-conversions yet that is not
2264 in effect, emit a note telling the user about that option if such
2265 a note has not previously been emitted. */
2266 bool
2268 {
2276 convertible_lax =
2291 {
2294 "conversions between vectors with differing "
2296 }
2299 }
2301 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2302 and have vector types, V0 has the same type as V1, and the number of
2303 elements of V0, V1, MASK is the same.
2305 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2306 called with two arguments. In this case implementation passes the
2307 first argument twice in order to share the same tree code. This fact
2308 could enable the mask-values being twice the vector length. This is
2309 an implementation accident and this semantics is not guaranteed to
2310 the user. */
2311 tree
2314 {
2315 tree ret;
2321 {
2324 }
2332 {
2337 }
2341 {
2345 }
2348 {
2353 }
2359 {
2362 "argument vector(s) and the mask vector should "
2365 }
2369 {
2374 }
2377 {
2378 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2384 else
2385 {
2388 }
2392 }
2402 }
2404 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2405 to integral type. */
2407 static tree
2409 {
2414 {
2415 /* C++0x scoped enumerations don't implicitly convert to integral
2416 type; if we stripped an explicit conversion to a larger type we
2417 need to replace it so common_type will still work. */
2421 }
2423 }
2425 /* This is a helper function of build_binary_op.
2427 For certain operations if both args were extended from the same
2428 smaller type, do the arithmetic in that type and then extend.
2430 BITWISE indicates a bitwise operation.
2431 For them, this optimization is safe only if
2432 both args are zero-extended or both are sign-extended.
2433 Otherwise, we might change the result.
2434 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2435 but calculated in (unsigned short) it would be (unsigned short)-1.
2436 */
2437 tree
2439 {
2443 tree type;
2445 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2446 excessive narrowing when we call get_narrower below. For
2447 example, suppose that OP0 is of unsigned int extended
2448 from signed char and that RESULT_TYPE is long long int.
2449 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2450 like
2452 (long long int) (unsigned int) signed_char
2454 which get_narrower would narrow down to
2456 (unsigned int) signed char
2458 If we do not cast OP0 first, get_narrower would return
2459 signed_char, which is inconsistent with the case of the
2460 explicit cast. */
2467 /* UNS is 1 if the operation to be done is an unsigned one. */
2470 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2471 but it *requires* conversion to FINAL_TYPE. */
2482 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2484 /* For bitwise operations, signedness of nominal type
2485 does not matter. Consider only how operands were extended. */
2489 /* Note that in all three cases below we refrain from optimizing
2490 an unsigned operation on sign-extended args.
2491 That would not be valid. */
2493 /* Both args variable: if both extended in same way
2494 from same width, do it in that width.
2495 Do it unsigned if args were zero-extended. */
2502 return c_common_signed_or_unsigned_type
2509 && (type
2520 && (type
2528 }
2530 /* Checks if expression EXPR of real/integer type cannot be converted
2531 to the real/integer type TYPE. Function returns true when:
2532 * EXPR is a constant which cannot be exactly converted to TYPE
2533 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2534 for EXPR type and TYPE being both integers or both real.
2535 * EXPR is not a constant of real type and TYPE is an integer.
2536 * EXPR is not a constant of integer type which cannot be
2537 exactly converted to real type.
2538 Function allows conversions between types of different signedness and
2539 does not return true in that case. Function can produce signedness
2540 warnings if PRODUCE_WARNS is true. */
2541 bool
2543 {
2549 {
2550 /* Warn for real constant that is not an exact integer converted
2551 to integer type. */
2554 {
2557 }
2558 /* Warn for an integer constant that does not fit into integer type. */
2562 {
2565 {
2569 }
2571 {
2575 }
2576 else
2578 }
2580 {
2581 /* Warn for an integer constant that does not fit into real type. */
2583 {
2587 }
2588 /* Warn for a real constant that does not fit into a smaller
2589 real type. */
2592 {
2596 }
2597 }
2598 }
2599 else
2600 {
2601 /* Warn for real types converted to integer types. */
2608 {
2609 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2613 /* Don't warn for short y; short x = ((int)y & 0xff); */
2617 {
2618 /* If both args were extended from a shortest type,
2619 use that type if that is safe. */
2626 {
2632 /* If one of the operands is a non-negative constant
2633 that fits in the target type, then the type of the
2634 other operand does not matter. */
2643 /* If constant is unsigned and fits in the target
2644 type, then the result will also fit. */
2646 && unsigned0
2649 && unsigned1
2652 }
2653 }
2654 /* Warn for integer types converted to smaller integer types. */
2658 /* When they are the same width but different signedness,
2659 then the value may change. */
2662 /* Even when converted to a bigger type, if the type is
2663 unsigned but expr is signed, then negative values
2664 will be changed. */
2670 }
2672 /* Warn for integer types converted to real types if and only if
2673 all the range of values of the integer type cannot be
2674 represented by the real type. */
2677 {
2681 /* Don't warn about char y = 0xff; float x = (int) y; */
2693 }
2695 /* Warn for real types converted to smaller real types. */
2700 }
2703 }
2705 /* Warns if the conversion of EXPR to TYPE may alter a value.
2706 This is a helper function for warnings_for_convert_and_check. */
2708 static void
2710 {
2718 {
2731 /* Conversion from boolean to a signed:1 bit-field (which only
2732 can hold the values 0 and -1) doesn't lose information - but
2733 it does change the value. */
2748 {
2749 /* In case of COND_EXPR, we do not care about the type of
2750 COND_EXPR, only about the conversion of each operand. */
2757 }
2764 }
2765 }
2767 /* Produce warnings after a conversion. RESULT is the result of
2768 converting EXPR to TYPE. This is a helper function for
2769 convert_and_check and cp_convert_and_check. */
2771 void
2773 {
2780 {
2781 /* Do not diagnose overflow in a constant expression merely
2782 because a conversion overflowed. */
2787 {
2788 /* This detects cases like converting -129 or 256 to
2789 unsigned char. */
2793 else
2795 }
2799 /* No warning for converting 0x80000000 to int. */
2807 else
2809 }
2814 else
2816 }
2819 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2820 Invoke this function on every expression that is converted implicitly,
2821 i.e. because of language rules and not because of an explicit cast. */
2823 tree
2825 {
2826 tree result;
2827 tree expr_for_warning;
2829 /* Convert from a value with possible excess precision rather than
2830 via the semantic type, but do not warn about values not fitting
2831 exactly in the semantic type. */
2833 {
2839 }
2840 else
2854 }
2855 \f
2856 /* A node in a list that describes references to variables (EXPR), which are
2857 either read accesses if WRITER is zero, or write accesses, in which case
2858 WRITER is the parent of EXPR. */
2859 struct tlist
2860 {
2863 };
2865 /* Used to implement a cache the results of a call to verify_tree. We only
2866 use this for SAVE_EXPRs. */
2867 struct tlist_cache
2868 {
2872 tree expr;
2873 };
2875 /* Obstack to use when allocating tlist structures, and corresponding
2876 firstobj. */
2880 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2881 warnings. */
2883 /* SAVE_EXPRs need special treatment. We process them only once and then
2884 cache the results. */
2896 /* Create a new struct tlist and fill in its fields. */
2899 {
2906 }
2908 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2909 is nonnull, we ignore any node we find which has a writer equal to it. */
2911 static void
2913 {
2915 {
2922 }
2923 }
2925 /* Merge the nodes of ADD into TO. This merging process is done so that for
2926 each variable that already exists in TO, no new node is added; however if
2927 there is a write access recorded in ADD, and an occurrence on TO is only
2928 a read access, then the occurrence in TO will be modified to record the
2929 write. */
2931 static void
2933 {
2940 {
2947 {
2951 }
2953 {
2957 }
2959 }
2960 }
2962 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2963 references in list LIST conflict with it, excluding reads if ONLY writers
2964 is nonzero. */
2966 static void
2969 {
2972 /* Avoid duplicate warnings. */
2978 {
2982 {
2987 }
2989 }
2990 }
2992 /* Given a list LIST of references to variables, find whether any of these
2993 can cause conflicts due to missing sequence points. */
2995 static void
2997 {
3001 {
3004 }
3005 }
3007 /* Return nonzero if X is a tree that can be verified by the sequence point
3008 warnings. */
3009 static int
3011 {
3018 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3019 (lvalue_p) crash on TRY/CATCH. */
3026 /* No point to track non-const calls, they will never satisfy
3027 operand_equal_p. */
3035 }
3037 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3038 static bool
3040 {
3042 }
3044 /* Walk the tree X, and record accesses to variables. If X is written by the
3045 parent tree, WRITER is the parent.
3046 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3047 expression or its only operand forces a sequence point, then everything up
3048 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3049 in PNO_SP.
3050 Once we return, we will have emitted warnings if any subexpression before
3051 such a sequence point could be undefined. On a higher level, however, the
3052 sequence point may not be relevant, and we'll merge the two lists.
3054 Example: (b++, a) + b;
3055 The call that processes the COMPOUND_EXPR will store the increment of B
3056 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3057 processes the PLUS_EXPR will need to merge the two lists so that
3058 eventually, all accesses end up on the same list (and we'll warn about the
3059 unordered subexpressions b++ and b.
3061 A note on merging. If we modify the former example so that our expression
3062 becomes
3063 (b++, b) + a
3064 care must be taken not simply to add all three expressions into the final
3065 PNO_SP list. The function merge_tlist takes care of that by merging the
3066 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3067 way, so that no more than one access to B is recorded. */
3069 static void
3071 tree writer)
3072 {
3077 /* X may be NULL if it is the operand of an empty statement expression
3078 ({ }). */
3082 restart:
3090 {
3123 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3124 two first, to avoid warning for (a ? b++ : b++). */
3140 /* Expressions inside the LHS are not ordered wrt. the sequence points
3141 in the RHS. Example:
3142 *a = (a++, 2)
3143 Despite the fact that the modification of "a" is in the before_sp
3144 list (tmp_before), it conflicts with the use of "a" in the LHS.
3145 We can handle this by adding the contents of tmp_list3
3146 to those of tmp_before, and redoing the collision warnings for that
3147 list. */
3150 /* Exclude the LHS itself here; we first have to merge it into the
3151 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3152 didn't exclude the LHS, we'd get it twice, once as a read and once
3153 as a write. */
3164 /* We need to warn about conflicts among arguments and conflicts between
3165 args and the function address. Side effects of the function address,
3166 however, are not ordered by the sequence point of the call. */
3167 {
3168 call_expr_arg_iterator iter;
3169 tree arg;
3173 {
3178 }
3183 }
3186 /* Scan all the list, e.g. indices of multi dimensional array. */
3188 {
3194 }
3198 {
3205 {
3217 {
3221 }
3224 }
3228 }
3238 /* For other expressions, simply recurse on their operands.
3239 Manual tail recursion for unary expressions.
3240 Other non-expressions need not be processed. */
3242 {
3246 }
3248 {
3252 {
3257 }
3258 }
3260 }
3261 }
3263 /* Try to warn for undefined behavior in EXPR due to missing sequence
3264 points. */
3266 DEBUG_FUNCTION void
3268 {
3274 {
3277 }
3282 }
3283 \f
3284 /* Validate the expression after `case' and apply default promotions. */
3286 static tree
3288 {
3293 /* Promote char or short to int. */
3296 {
3299 }
3304 }
3305 \f
3306 /* See if the case values LOW and HIGH are in the range of the original
3307 type (i.e. before the default conversion to int) of the switch testing
3308 expression.
3309 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3310 the type before promoting it. CASE_LOW_P is a pointer to the lower
3311 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3312 if the case is not a case range.
3313 The caller has to make sure that we are not called with NULL for
3314 CASE_LOW_P (i.e. the default case).
3315 Returns true if the case label is in range of ORIG_TYPE (saturated or
3316 untouched) or false if the label is out of range. */
3318 static bool
3321 {
3326 /* If there was a problem with the original type, do nothing. */
3333 /* Case label is less than minimum for type. */
3336 {
3339 }
3341 /* Case value is greater than maximum for type. */
3344 {
3347 }
3349 /* Saturate lower case label value to minimum. */
3352 {
3356 }
3358 /* Saturate upper case label value to maximum. */
3361 {
3365 }
3373 }
3374 \f
3375 /* Return an integer type with BITS bits of precision,
3376 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3378 tree
3380 {
3419 }
3421 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3422 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3423 and saturating if SATP is nonzero, otherwise not saturating. */
3425 tree
3428 {
3432 else
3440 {
3442 "fixed-point types that have too many integral and "
3445 }
3448 }
3450 /* Used for communication between c_common_type_for_mode and
3451 c_register_builtin_type. */
3454 /* Return a data type that has machine mode MODE.
3455 If the mode is an integer,
3456 then UNSIGNEDP selects between signed and unsigned types.
3457 If the mode is a fixed-point mode,
3458 then UNSIGNEDP selects between saturating and nonsaturating types. */
3460 tree
3462 {
3463 tree t;
3500 #if HOST_BITS_PER_WIDE_INT >= 64
3503 #endif
3528 {
3530 tree inner_type;
3546 }
3548 {
3553 }
3563 {
3649 }
3657 }
3659 tree
3661 {
3663 }
3665 /* Return a signed type the same as TYPE in other respects. */
3667 tree
3669 {
3671 }
3673 /* Return a type the same as TYPE except unsigned or
3674 signed according to UNSIGNEDP. */
3676 tree
3678 {
3679 tree type1;
3681 /* This block of code emulates the behavior of the old
3682 c_common_unsigned_type. In particular, it returns
3683 long_unsigned_type_node if passed a long, even when a int would
3684 have the same size. This is necessary for warnings to work
3685 correctly in archs where sizeof(int) == sizeof(long) */
3688 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3704 #if HOST_BITS_PER_WIDE_INT >= 64
3707 #endif
3717 #define C_COMMON_FIXED_TYPES(NAME) \
3718 if (type1 == short_ ## NAME ## _type_node \
3719 || type1 == unsigned_short_ ## NAME ## _type_node) \
3720 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3721 : short_ ## NAME ## _type_node; \
3722 if (type1 == NAME ## _type_node \
3723 || type1 == unsigned_ ## NAME ## _type_node) \
3724 return unsignedp ? unsigned_ ## NAME ## _type_node \
3725 : NAME ## _type_node; \
3726 if (type1 == long_ ## NAME ## _type_node \
3727 || type1 == unsigned_long_ ## NAME ## _type_node) \
3728 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3729 : long_ ## NAME ## _type_node; \
3730 if (type1 == long_long_ ## NAME ## _type_node \
3731 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3732 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3733 : long_long_ ## NAME ## _type_node;
3735 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3736 if (type1 == NAME ## _type_node \
3737 || type1 == u ## NAME ## _type_node) \
3738 return unsignedp ? u ## NAME ## _type_node \
3739 : NAME ## _type_node;
3741 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3742 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3743 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3744 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3745 : sat_ ## short_ ## NAME ## _type_node; \
3746 if (type1 == sat_ ## NAME ## _type_node \
3747 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3748 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3749 : sat_ ## NAME ## _type_node; \
3750 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3751 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3752 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3753 : sat_ ## long_ ## NAME ## _type_node; \
3754 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3755 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3756 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3757 : sat_ ## long_long_ ## NAME ## _type_node;
3759 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3760 if (type1 == sat_ ## NAME ## _type_node \
3761 || type1 == sat_ ## u ## NAME ## _type_node) \
3762 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3763 : sat_ ## NAME ## _type_node;
3789 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3790 the precision; they have precision set to match their range, but
3791 may use a wider mode to match an ABI. If we change modes, we may
3792 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3793 the precision as well, so as to yield correct results for
3794 bit-field types. C++ does not have these separate bit-field
3795 types, and producing a signed or unsigned variant of an
3796 ENUMERAL_TYPE may cause other problems as well. */
3802 #define TYPE_OK(node) \
3803 (TYPE_MODE (type) == TYPE_MODE (node) \
3804 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3823 #if HOST_BITS_PER_WIDE_INT >= 64
3826 #endif
3835 #undef TYPE_OK
3838 }
3840 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3842 tree
3844 {
3845 /* Extended integer types of the same width as a standard type have
3846 lesser rank, so those of the same width as int promote to int or
3847 unsigned int and are valid for printf formats expecting int or
3848 unsigned int. To avoid such special cases, avoid creating
3849 extended integer types for bit-fields if a standard integer type
3850 is available. */
3867 }
3869 /* The C version of the register_builtin_type langhook. */
3871 void
3873 {
3874 tree decl;
3884 }
3885 \f
3886 /* Print an error message for invalid operands to arith operation
3887 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3888 LOCATION is the location of the message. */
3890 void
3893 {
3897 {
3942 }
3946 }
3947 \f
3948 /* Given an expression as a tree, return its original type. Do this
3949 by stripping any conversion that preserves the sign and precision. */
3950 static tree
3952 {
3955 }
3957 /* Subroutine of build_binary_op, used for comparison operations.
3958 See if the operands have both been converted from subword integer types
3959 and, if so, perhaps change them both back to their original type.
3960 This function is also responsible for converting the two operands
3961 to the proper common type for comparison.
3963 The arguments of this function are all pointers to local variables
3964 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3965 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3967 If this function returns nonzero, it means that the comparison has
3968 a constant value. What this function returns is an expression for
3969 that value. */
3971 tree
3974 {
3975 tree type;
3984 /* Throw away any conversions to wider types
3985 already present in the operands. */
3990 /* If primopN is first sign-extended from primopN's precision to opN's
3991 precision, then zero-extended from opN's precision to
3992 *restype_ptr precision, shortenings might be invalid. */
3995 && !unsignedp0
4000 && !unsignedp1
4004 /* Handle the case that OP0 does not *contain* a conversion
4005 but it *requires* conversion to FINAL_TYPE. */
4012 /* If one of the operands must be floated, we cannot optimize. */
4016 /* If first arg is constant, swap the args (changing operation
4017 so value is preserved), for canonicalization. Don't do this if
4018 the second arg is 0. */
4023 {
4040 {
4055 }
4057 }
4059 /* If comparing an integer against a constant more bits wide,
4060 maybe we can deduce a value of 1 or 0 independent of the data.
4061 Or else truncate the constant now
4062 rather than extend the variable at run time.
4064 This is only interesting if the constant is the wider arg.
4065 Also, it is not safe if the constant is unsigned and the
4066 variable arg is signed, since in this case the variable
4067 would be sign-extended and then regarded as unsigned.
4068 Our technique fails in this case because the lowest/highest
4069 possible unsigned results don't follow naturally from the
4070 lowest/highest possible values of the variable operand.
4071 For just EQ_EXPR and NE_EXPR there is another technique that
4072 could be used: see if the constant can be faithfully represented
4073 in the other operand's type, by truncating it and reextending it
4074 and see if that preserves the constant's value. */
4080 {
4083 /* 1 if comparison is nominally unsigned. */
4085 tree val;
4097 {
4098 /* Convert primop1 to target type, but do not introduce
4099 additional overflow. We know primop1 is an int_cst. */
4103 }
4105 {
4108 }
4111 {
4116 }
4117 else
4118 {
4123 }
4126 /* This used to be a switch, but Genix compiler can't handle that. */
4128 {
4131 }
4133 {
4136 }
4138 {
4143 }
4145 {
4150 }
4152 {
4157 }
4159 {
4164 }
4166 /* If primop0 was sign-extended and unsigned comparison specd,
4167 we did a signed comparison above using the signed type bounds.
4168 But the comparison we output must be unsigned.
4170 Also, for inequalities, VAL is no good; but if the signed
4171 comparison had *any* fixed result, it follows that the
4172 unsigned comparison just tests the sign in reverse
4173 (positive values are LE, negative ones GE).
4174 So we can generate an unsigned comparison
4175 against an extreme value of the signed type. */
4178 {
4181 {
4196 }
4198 }
4202 {
4209 }
4212 {
4213 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4217 }
4219 /* Value is not predetermined, but do the comparison
4220 in the type of the operand that is not constant.
4221 TYPE is already properly set. */
4222 }
4224 /* If either arg is decimal float and the other is float, find the
4225 proper common type to use for comparison. */
4236 /* If args' natural types are both narrower than nominal type
4237 and both extend in the same manner, compare them
4238 in the type of the wider arg.
4239 Otherwise must actually extend both to the nominal
4240 common type lest different ways of extending
4241 alter the result.
4242 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4247 {
4251 type);
4252 /* Make sure shorter operand is extended the right way
4253 to match the longer operand. */
4254 primop0
4257 primop0);
4258 primop1
4261 primop1);
4262 }
4263 else
4264 {
4265 /* Here we must do the comparison on the nominal type
4266 using the args exactly as we received them. */
4273 {
4275 /* All unsigned values are >= 0, so we warn. However,
4276 if OP0 is a constant that is >= 0, the signedness of
4277 the comparison isn't an issue, so suppress the
4278 warning. */
4280 warn_type_limits && !in_system_header
4284 primop0)))
4285 /* Do not warn for enumeration types. */
4289 {
4306 }
4309 {
4310 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4315 }
4316 }
4317 }
4325 }
4326 \f
4327 /* Return a tree for the sum or difference (RESULTCODE says which)
4328 of pointer PTROP and integer INTOP. */
4330 tree
4333 {
4336 /* The result is a pointer of the same type that is being added. */
4340 {
4347 }
4349 {
4356 }
4357 else
4360 /* We are manipulating pointer values, so we don't need to warn
4361 about relying on undefined signed overflow. We disable the
4362 warning here because we use integer types so fold won't know that
4363 they are really pointers. */
4366 /* If what we are about to multiply by the size of the elements
4367 contains a constant term, apply distributive law
4368 and multiply that constant term separately.
4369 This helps produce common subexpressions. */
4374 /* If the constant comes from pointer subtraction,
4375 skip this optimization--it would cause an error. */
4377 /* If the constant is unsigned, and smaller than the pointer size,
4378 then we must skip this optimization. This is because it could cause
4379 an overflow error if the constant is negative but INTOP is not. */
4383 {
4388 /* Convert both subexpression types to the type of intop,
4389 because weird cases involving pointer arithmetic
4390 can result in a sum or difference with different type args. */
4395 }
4397 /* Convert the integer argument to a type the same size as sizetype
4398 so the multiply won't overflow spuriously. */
4404 /* Replace the integer argument with a suitable product by the object size.
4405 Do this multiplication as signed, then convert to the appropriate type
4406 for the pointer operation and disregard an overflow that occurred only
4407 because of the sign-extension change in the latter conversion. */
4408 {
4416 }
4418 /* Create the sum or difference. */
4427 }
4428 \f
4429 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4430 and if NON_CONST is known not to be permitted in an evaluated part
4431 of a constant expression. */
4433 tree
4435 {
4439 /* This should never be called for C++. */
4443 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4452 }
4454 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4455 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4456 around the SAVE_EXPR if needed so that c_fully_fold does not need
4457 to look inside SAVE_EXPRs. */
4459 tree
4461 {
4470 }
4472 /* Return whether EXPR is a declaration whose address can never be
4473 NULL. */
4475 bool
4477 {
4482 }
4484 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4485 or for an `if' or `while' statement or ?..: exp. It should already
4486 have been validated to be of suitable type; otherwise, a bad
4487 diagnostic may result.
4489 The EXPR is located at LOCATION.
4491 This preparation consists of taking the ordinary
4492 representation of an expression expr and producing a valid tree
4493 boolean expression describing whether expr is nonzero. We could
4494 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4495 but we optimize comparisons, &&, ||, and !.
4497 The resulting type should always be `truthvalue_type_node'. */
4499 tree
4501 {
4503 {
4545 ? truthvalue_true_node
4551 ? truthvalue_true_node
4556 /* Fall through. */
4559 {
4562 {
4563 /* Common Ada/Pascal programmer's mistake. */
4565 OPT_Waddress,
4567 inner);
4569 }
4571 }
4588 /* These don't change whether an object is nonzero or zero. */
4593 /* These don't change whether an object is zero or nonzero, but
4594 we can't ignore them if their second arg has side-effects. */
4596 {
4599 c_common_truthvalue_conversion
4602 }
4603 else
4608 /* Distribute the conversion into the arms of a COND_EXPR. */
4610 {
4613 /* In C++ one of the arms might have void type if it is throw. */
4621 }
4622 else
4623 {
4624 /* Folding will happen later for C. */
4632 }
4634 CASE_CONVERT:
4635 {
4639 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4640 since that affects how `default_conversion' will behave. */
4644 /* Don't strip a conversion from C++0x scoped enum, since they
4645 don't implicitly convert to other types. */
4649 /* If this isn't narrowing the argument, we can ignore it. */
4653 }
4659 {
4663 }
4668 }
4671 {
4673 expr = (build_binary_op
4677 c_common_truthvalue_conversion
4680 c_common_truthvalue_conversion
4685 }
4688 {
4693 }
4694 else
4697 ret:
4700 }
4701 \f
4710 /* Apply the TYPE_QUALS to the new DECL. */
4712 void
4714 {
4722 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4723 constructor can produce constant init, so rely on cp_finish_decl to
4724 clear TREE_READONLY if the variable has non-constant init. */
4727 {
4730 }
4732 {
4734 /* Allow 'restrict' on arrays of pointers.
4735 FIXME currently we just ignore it. */
4741 }
4742 }
4744 /* Hash function for the problem of multiple type definitions in
4745 different files. This must hash all types that will compare
4746 equal via comptypes to the same value. In practice it hashes
4747 on some of the simple stuff and leaves the details to comptypes. */
4749 static hashval_t
4751 {
4755 tree t2;
4757 {
4758 /* For pointers, hash on pointee type plus some swizzling. */
4761 /* Hash on number of elements and total size. */
4780 }
4781 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4782 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4784 /* We might have a VLA here. */
4787 else
4790 }
4794 /* Return the typed-based alias set for T, which may be an expression
4795 or a type. Return -1 if we don't do anything special. */
4797 alias_set_type
4799 {
4800 tree u;
4803 /* For VLAs, use the alias set of the element type rather than the
4804 default of alias set 0 for types compared structurally. */
4806 {
4810 }
4812 /* Permit type-punning when accessing a union, provided the access
4813 is directly through the union. For example, this code does not
4814 permit taking the address of a union member and then storing
4815 through it. Even the type-punning allowed here is a GCC
4816 extension, albeit a common and useful one; the C standard says
4817 that such accesses have implementation-defined behavior. */
4825 /* That's all the expressions we handle specially. */
4829 /* The C standard guarantees that any object may be accessed via an
4830 lvalue that has character type. */
4836 /* The C standard specifically allows aliasing between signed and
4837 unsigned variants of the same type. We treat the signed
4838 variant as canonical. */
4840 {
4843 /* t1 == t can happen for boolean nodes which are always unsigned. */
4846 }
4848 /* Handle the case of multiple type nodes referring to "the same" type,
4849 which occurs with IMA. These share an alias set. FIXME: Currently only
4850 C90 is handled. (In C99 type compatibility is not transitive, which
4851 complicates things mightily. The alias set splay trees can theoretically
4852 represent this, but insertion is tricky when you consider all the
4853 different orders things might arrive in.) */
4858 /* Save time if there's only one input file. */
4862 /* Pointers need special handling if they point to any type that
4863 needs special handling (below). */
4865 {
4866 tree t2;
4867 /* Find bottom type under any nested POINTERs. */
4871 ;
4879 }
4880 /* These are the only cases that need special handling. */
4887 /* Undefined? */
4891 /* Look up t in hash table. Only one of the compatible types within each
4892 alias set is recorded in the table. */
4896 NULL);
4899 {
4902 }
4903 else
4904 /* Our caller will assign and record (in t) a new alias set; all we need
4905 to do is remember t in the hash table. */
4909 }
4910 \f
4911 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4912 the second parameter indicates which OPERATOR is being applied.
4913 The COMPLAIN flag controls whether we should diagnose possibly
4914 ill-formed constructs or not. LOC is the location of the SIZEOF or
4915 TYPEOF operator. */
4917 tree
4920 {
4928 {
4930 {
4937 }
4938 else
4939 {
4941 {
4945 else
4948 }
4950 }
4951 }
4953 {
4961 }
4964 {
4969 }
4972 {
4977 }
4978 else
4979 {
4981 /* Convert in case a char is more than one unit. */
4985 else
4987 }
4989 /* VALUE will have the middle-end integer type sizetype.
4990 However, we should really return a value of type `size_t',
4991 which is just a typedef for an ordinary integer type. */
4995 }
4997 /* Implement the __alignof keyword: Return the minimum required
4998 alignment of EXPR, measured in bytes. For VAR_DECLs,
4999 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5000 from an "aligned" __attribute__ specification). LOC is the
5001 location of the ALIGNOF operator. */
5003 tree
5005 {
5006 tree t;
5013 {
5016 }
5022 {
5029 {
5036 }
5038 }
5039 else
5043 }
5044 \f
5045 /* Handle C and C++ default attributes. */
5047 enum built_in_attribute
5048 {
5049 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5050 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5051 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5052 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5053 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5055 #undef DEF_ATTR_NULL_TREE
5056 #undef DEF_ATTR_INT
5057 #undef DEF_ATTR_STRING
5058 #undef DEF_ATTR_IDENT
5059 #undef DEF_ATTR_TREE_LIST
5060 ATTR_LAST
5061 };
5067 enum c_builtin_type
5068 {
5069 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5070 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5071 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5072 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5073 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5074 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5075 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5076 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5077 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5078 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5079 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5080 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5081 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5082 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5083 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5084 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5085 NAME,
5086 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5088 #undef DEF_PRIMITIVE_TYPE
5089 #undef DEF_FUNCTION_TYPE_0
5090 #undef DEF_FUNCTION_TYPE_1
5091 #undef DEF_FUNCTION_TYPE_2
5092 #undef DEF_FUNCTION_TYPE_3
5093 #undef DEF_FUNCTION_TYPE_4
5094 #undef DEF_FUNCTION_TYPE_5
5095 #undef DEF_FUNCTION_TYPE_6
5096 #undef DEF_FUNCTION_TYPE_7
5097 #undef DEF_FUNCTION_TYPE_8
5098 #undef DEF_FUNCTION_TYPE_VAR_0
5099 #undef DEF_FUNCTION_TYPE_VAR_1
5100 #undef DEF_FUNCTION_TYPE_VAR_2
5101 #undef DEF_FUNCTION_TYPE_VAR_3
5102 #undef DEF_FUNCTION_TYPE_VAR_4
5103 #undef DEF_FUNCTION_TYPE_VAR_5
5104 #undef DEF_POINTER_TYPE
5105 BT_LAST
5106 };
5110 /* A temporary array for c_common_nodes_and_builtins. Used in
5111 communication with def_fn_type. */
5114 /* A helper function for c_common_nodes_and_builtins. Build function type
5115 for DEF with return type RET and N arguments. If VAR is true, then the
5116 function should be variadic after those N arguments.
5118 Takes special care not to ICE if any of the types involved are
5119 error_mark_node, which indicates that said type is not in fact available
5120 (see builtin_type_for_size). In which case the function type as a whole
5121 should be error_mark_node. */
5123 static void
5125 {
5126 tree t;
5133 {
5139 }
5146 else
5149 egress:
5152 }
5154 /* Build builtin functions common to both C and C++ language
5155 frontends. */
5157 static void
5159 {
5160 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5161 builtin_types[ENUM] = VALUE;
5162 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5163 def_fn_type (ENUM, RETURN, 0, 0);
5164 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5165 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5166 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5167 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5168 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5169 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5170 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5171 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5172 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5173 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5174 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5175 ARG6) \
5176 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5177 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5178 ARG6, ARG7) \
5179 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5180 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5181 ARG6, ARG7, ARG8) \
5182 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5183 ARG7, ARG8);
5184 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5185 def_fn_type (ENUM, RETURN, 1, 0);
5186 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5187 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5188 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5189 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5190 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5191 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5192 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5193 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5194 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5195 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5196 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5197 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5201 #undef DEF_PRIMITIVE_TYPE
5202 #undef DEF_FUNCTION_TYPE_1
5203 #undef DEF_FUNCTION_TYPE_2
5204 #undef DEF_FUNCTION_TYPE_3
5205 #undef DEF_FUNCTION_TYPE_4
5206 #undef DEF_FUNCTION_TYPE_5
5207 #undef DEF_FUNCTION_TYPE_6
5208 #undef DEF_FUNCTION_TYPE_VAR_0
5209 #undef DEF_FUNCTION_TYPE_VAR_1
5210 #undef DEF_FUNCTION_TYPE_VAR_2
5211 #undef DEF_FUNCTION_TYPE_VAR_3
5212 #undef DEF_FUNCTION_TYPE_VAR_4
5213 #undef DEF_FUNCTION_TYPE_VAR_5
5214 #undef DEF_POINTER_TYPE
5219 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5220 NONANSI_P, ATTRS, IMPLICIT, COND) \
5221 if (NAME && COND) \
5222 def_builtin_1 (ENUM, NAME, CLASS, \
5223 builtin_types[(int) TYPE], \
5224 builtin_types[(int) LIBTYPE], \
5225 BOTH_P, FALLBACK_P, NONANSI_P, \
5226 built_in_attributes[(int) ATTRS], IMPLICIT);
5228 #undef DEF_BUILTIN
5236 }
5238 /* Like get_identifier, but avoid warnings about null arguments when
5239 the argument may be NULL for targets where GCC lacks stdint.h type
5240 information. */
5244 {
5246 }
5248 /* Build tree nodes and builtin functions common to both C and C++ language
5249 frontends. */
5251 void
5253 {
5257 tree array_domain_type;
5258 tree va_list_ref_type_node;
5259 tree va_list_arg_type_node;
5263 /* Define `int' and `char' first so that dbx will output them first. */
5267 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5268 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5269 but not C. Are the conditionals here needed? */
5275 long_unsigned_type_node);
5277 {
5279 int128_integer_type_node);
5281 int128_unsigned_type_node);
5282 }
5286 long_long_integer_type_node);
5288 long_long_unsigned_type_node);
5291 long_long_unsigned_type_node);
5294 short_unsigned_type_node);
5297 short_unsigned_type_node);
5299 /* Define both `signed char' and `unsigned char'. */
5303 /* These are types that c_common_type_for_size and
5304 c_common_type_for_mode use. */
5307 intQI_type_node));
5310 intHI_type_node));
5313 intSI_type_node));
5316 intDI_type_node));
5317 #if HOST_BITS_PER_WIDE_INT >= 64
5320 TYPE_DECL,
5322 intTI_type_node));
5323 #endif
5326 unsigned_intQI_type_node));
5329 unsigned_intHI_type_node));
5332 unsigned_intSI_type_node));
5335 unsigned_intDI_type_node));
5336 #if HOST_BITS_PER_WIDE_INT >= 64
5339 TYPE_DECL,
5341 unsigned_intTI_type_node));
5342 #endif
5344 /* Create the widest literal types. */
5345 widest_integer_literal_type_node
5349 widest_integer_literal_type_node));
5351 widest_unsigned_literal_type_node
5355 widest_unsigned_literal_type_node));
5359 pid_type_node =
5366 /* Only supported decimal floating point extension if the target
5367 actually supports underlying modes. */
5371 {
5375 }
5378 {
5383 long_long_fract_type_node);
5385 unsigned_short_fract_type_node);
5387 unsigned_fract_type_node);
5389 unsigned_long_fract_type_node);
5391 unsigned_long_long_fract_type_node);
5393 sat_short_fract_type_node);
5396 sat_long_fract_type_node);
5398 sat_long_long_fract_type_node);
5400 sat_unsigned_short_fract_type_node);
5402 sat_unsigned_fract_type_node);
5404 sat_unsigned_long_fract_type_node);
5406 sat_unsigned_long_long_fract_type_node);
5411 long_long_accum_type_node);
5413 unsigned_short_accum_type_node);
5415 unsigned_accum_type_node);
5417 unsigned_long_accum_type_node);
5419 unsigned_long_long_accum_type_node);
5421 sat_short_accum_type_node);
5424 sat_long_accum_type_node);
5426 sat_long_long_accum_type_node);
5428 sat_unsigned_short_accum_type_node);
5430 sat_unsigned_accum_type_node);
5432 sat_unsigned_long_accum_type_node);
5434 sat_unsigned_long_long_accum_type_node);
5436 }
5439 TYPE_DECL,
5441 complex_integer_type_node));
5443 TYPE_DECL,
5445 complex_float_type_node));
5447 TYPE_DECL,
5449 complex_double_type_node));
5453 complex_long_double_type_node));
5456 /* For C++, make fileptr_type_node a distinct void * type until
5457 FILE type is defined. */
5462 /* Set the TYPE_NAME for any variants that were built before
5463 record_builtin_type gave names to the built-in types. */
5464 {
5470 }
5472 /* This node must not be shared. */
5478 /* Make a type to be the domain of a few array types
5479 whose domains don't really matter.
5480 200 is small enough that it always fits in size_t
5481 and large enough that it can hold most function names for the
5482 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5485 /* Make a type for arrays of characters.
5486 With luck nothing will ever really depend on the length of this
5487 array type. */
5488 char_array_type_node
5491 /* Likewise for arrays of ints. */
5492 int_array_type_node
5496 const_string_type_node
5500 /* This is special for C++ so functions can be overloaded. */
5506 {
5509 else
5512 }
5514 /* This is for wide string constants. */
5515 wchar_array_type_node
5518 /* Define 'char16_t'. */
5523 {
5528 }
5530 /* This is for UTF-16 string constants. */
5531 char16_array_type_node
5534 /* Define 'char32_t'. */
5539 {
5544 }
5546 /* This is for UTF-32 string constants. */
5547 char32_array_type_node
5550 wint_type_node =
5553 intmax_type_node =
5555 uintmax_type_node =
5559 sig_atomic_type_node =
5562 int8_type_node =
5565 int16_type_node =
5568 int32_type_node =
5571 int64_type_node =
5574 uint8_type_node =
5577 c_uint16_type_node =
5580 c_uint32_type_node =
5583 c_uint64_type_node =
5586 int_least8_type_node =
5589 int_least16_type_node =
5592 int_least32_type_node =
5595 int_least64_type_node =
5598 uint_least8_type_node =
5601 uint_least16_type_node =
5604 uint_least32_type_node =
5607 uint_least64_type_node =
5610 int_fast8_type_node =
5613 int_fast16_type_node =
5616 int_fast32_type_node =
5619 int_fast64_type_node =
5622 uint_fast8_type_node =
5625 uint_fast16_type_node =
5628 uint_fast32_type_node =
5631 uint_fast64_type_node =
5634 intptr_type_node =
5637 uintptr_type_node =
5640 default_function_type
5642 ptrdiff_type_node
5649 va_list_type_node));
5651 {
5654 tree ptype;
5657 {
5661 ptype));
5663 }
5664 }
5667 {
5670 }
5671 else
5672 {
5675 }
5682 /* Create the built-in __null node. It is important that this is
5683 not shared. */
5687 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5689 }
5691 /* The number of named compound-literals generated thus far. */
5694 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5696 void
5698 {
5701 compound_literal_number);
5702 compound_literal_number++;
5704 }
5706 tree
5708 {
5712 }
5715 /* Linked list of disabled built-in functions. */
5718 {
5726 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5727 begins with "__builtin_", give an error. */
5729 void
5731 {
5734 else
5735 {
5740 }
5741 }
5744 /* Return true if the built-in function NAME has been disabled, false
5745 otherwise. */
5747 static bool
5749 {
5752 {
5755 }
5757 }
5760 /* Worker for DEF_BUILTIN.
5761 Possibly define a builtin function with one or two names.
5762 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5763 nonansi_p and flag_no_nonansi_builtin. */
5765 static void
5772 {
5773 tree decl;
5786 fnattrs);
5795 }
5796 \f
5797 /* Nonzero if the type T promotes to int. This is (nearly) the
5798 integral promotions defined in ISO C99 6.3.1.1/2. */
5800 bool
5802 {
5804 {
5814 /* ??? Technically all enumerations not larger than an int
5815 promote to an int. But this is used along code paths
5816 that only want to notice a size change. */
5824 }
5825 }
5827 /* Return 1 if PARMS specifies a fixed number of parameters
5828 and none of their types is affected by default promotions. */
5830 int
5832 {
5833 const_tree t;
5835 {
5852 }
5854 }
5856 /* Recursively remove any '*' or '&' operator from TYPE. */
5857 tree
5859 {
5863 }
5865 /* Recursively remove pointer or array type from TYPE. */
5866 tree
5868 {
5872 }
5874 /* Used to compare case labels. K1 and K2 are actually tree nodes
5875 representing case labels, or NULL_TREE for a `default' label.
5876 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5877 K2, and 0 if K1 and K2 are equal. */
5879 int
5881 {
5882 /* Consider a NULL key (such as arises with a `default' label) to be
5883 smaller than anything else. */
5890 }
5892 /* Process a case label, located at LOC, for the range LOW_VALUE
5893 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5894 then this case label is actually a `default' label. If only
5895 HIGH_VALUE is NULL_TREE, then case label was declared using the
5896 usual C/C++ syntax, rather than the GNU case range extension.
5897 CASES is a tree containing all the case ranges processed so far;
5898 COND is the condition for the switch-statement itself. Returns the
5899 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5900 is created. */
5902 tree
5905 {
5906 tree type;
5907 tree label;
5908 tree case_label;
5909 splay_tree_node node;
5911 /* Create the LABEL_DECL itself. */
5914 /* If there was an error processing the switch condition, bail now
5915 before we get more confused. */
5923 {
5926 }
5928 /* Case ranges are a GNU extension. */
5935 {
5940 }
5942 {
5947 }
5950 {
5951 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5952 really a case range, even though it was written that way.
5953 Remove the HIGH_VALUE to simplify later processing. */
5958 }
5960 /* See if the case is in range of the type of the original testing
5961 expression. If both low_value and high_value are out of range,
5962 don't insert the case label and return NULL_TREE. */
5968 /* Look up the LOW_VALUE in the table of case labels we already
5969 have. */
5971 /* If there was not an exact match, check for overlapping ranges.
5972 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5973 that's a `default' label and the only overlap is an exact match. */
5975 {
5976 splay_tree_node low_bound;
5977 splay_tree_node high_bound;
5979 /* Even though there wasn't an exact match, there might be an
5980 overlap between this case range and another case range.
5981 Since we've (inductively) not allowed any overlapping case
5982 ranges, we simply need to find the greatest low case label
5983 that is smaller that LOW_VALUE, and the smallest low case
5984 label that is greater than LOW_VALUE. If there is an overlap
5985 it will occur in one of these two ranges. */
5991 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5992 the LOW_VALUE, so there is no need to check unless the
5993 LOW_BOUND is in fact itself a case range. */
5999 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6000 range is bigger than the low end of the current range, so we
6001 are only interested if the current range is a real range, and
6002 not an ordinary case label. */
6004 && high_value
6006 high_value)
6009 }
6010 /* If there was an overlap, issue an error. */
6012 {
6016 {
6020 }
6022 {
6025 }
6026 else
6027 {
6031 }
6033 }
6035 /* Add a CASE_LABEL to the statement-tree. */
6037 /* Register this case label in the splay tree. */
6044 error_out:
6045 /* Add a label so that the back-end doesn't think that the beginning of
6046 the switch is unreachable. Note that we do not add a case label, as
6047 that just leads to duplicates and thence to failure later on. */
6049 {
6052 }
6054 }
6056 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6057 Used to verify that case values match up with enumerator values. */
6059 static void
6061 {
6064 /* ??? Not working too hard to print the double-word value.
6065 Should perhaps be done with %lwd in the diagnostic routines? */
6074 else
6083 buf);
6084 else
6089 }
6091 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6092 Used to verify that case values match up with enumerator values. */
6094 static int
6096 {
6100 /* Skip default case. */
6104 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6105 when we did our enum->case scan. Reset our scratch bit after. */
6108 else
6111 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6112 not set, that means that CASE_HIGH did not appear when we did our
6113 enum->case scan. Reset our scratch bit after. */
6115 {
6118 else
6120 }
6123 }
6125 /* Handle -Wswitch*. Called from the front end after parsing the
6126 switch construct. */
6127 /* ??? Should probably be somewhere generic, since other languages
6128 besides C and C++ would want this. At the moment, however, C/C++
6129 are the only tree-ssa languages that support enumerations at all,
6130 so the point is moot. */
6132 void
6135 {
6136 splay_tree_node default_node;
6137 splay_tree_node node;
6138 tree chain;
6148 /* From here on, we only care about about enumerated types. */
6152 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6156 /* Check the cases. Warn about case values which are not members of
6157 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6158 there is no default case, check that exactly all enumeration
6159 literals are covered by the cases. */
6161 /* Clearing COND if it is not an integer constant simplifies
6162 the tests inside the loop below. */
6166 /* The time complexity here is O(N*lg(N)) worst case, but for the
6167 common case of monotonically increasing enumerators, it is
6168 O(N), since the nature of the splay tree will keep the next
6169 element adjacent to the root at all times. */
6172 {
6178 {
6179 /* Mark the CASE_LOW part of the case entry as seen. */
6183 }
6185 /* Even though there wasn't an exact match, there might be a
6186 case range which includes the enumerator's value. */
6189 {
6193 {
6194 /* If we match the upper bound exactly, mark the CASE_HIGH
6195 part of the case entry as seen. */
6199 }
6200 }
6202 /* We've now determined that this enumerated literal isn't
6203 handled by the case labels of the switch statement. */
6205 /* If the switch expression is a constant, we only really care
6206 about whether that constant is handled by the switch. */
6210 /* If there is a default_node, the only relevant option is
6211 Wswitch-enum. Otherwise, if both are enabled then we prefer
6212 to warn using -Wswitch because -Wswitch is enabled by -Wall
6213 while -Wswitch-enum is explicit. */
6216 ? OPT_Wswitch_enum
6220 }
6222 /* Warn if there are case expressions that don't correspond to
6223 enumerators. This can occur since C and C++ don't enforce
6224 type-checking of assignments to enumeration variables.
6226 The time complexity here is now always O(N) worst case, since
6227 we should have marked both the lower bound and upper bound of
6228 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6229 above. This scan also resets those fields. */
6232 }
6234 /* Finish an expression taking the address of LABEL (an
6235 IDENTIFIER_NODE). Returns an expression for the address.
6237 LOC is the location for the expression returned. */
6239 tree
6241 {
6242 tree result;
6252 else
6253 {
6256 /* The current function is not necessarily uninlinable.
6257 Computed gotos are incompatible with inlining, but the value
6258 here could be used only in a diagnostic, for example. */
6260 }
6263 }
6264 \f
6266 /* Given a boolean expression ARG, return a tree representing an increment
6267 or decrement (as indicated by CODE) of ARG. The front end must check for
6268 invalid cases (e.g., decrement in C++). */
6269 tree
6271 {
6272 tree val;
6277 {
6300 }
6303 }
6304 \f
6305 /* Built-in macros for stddef.h and stdint.h, that require macros
6306 defined in this file. */
6307 void
6309 {
6372 }
6374 static void
6376 {
6377 /* Fill in the built_in_attributes array. */
6378 #define DEF_ATTR_NULL_TREE(ENUM) \
6379 built_in_attributes[(int) ENUM] = NULL_TREE;
6380 #define DEF_ATTR_INT(ENUM, VALUE) \
6381 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6382 #define DEF_ATTR_STRING(ENUM, VALUE) \
6383 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6384 #define DEF_ATTR_IDENT(ENUM, STRING) \
6385 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6386 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6387 built_in_attributes[(int) ENUM] \
6388 = tree_cons (built_in_attributes[(int) PURPOSE], \
6389 built_in_attributes[(int) VALUE], \
6390 built_in_attributes[(int) CHAIN]);
6392 #undef DEF_ATTR_NULL_TREE
6393 #undef DEF_ATTR_INT
6394 #undef DEF_ATTR_IDENT
6395 #undef DEF_ATTR_TREE_LIST
6396 }
6398 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6399 identifier as an argument, so the front end shouldn't look it up. */
6401 bool
6403 {
6406 /* Unknown attribute that we'll end up ignoring, return true so we
6407 don't complain about an identifier argument. */
6413 else
6415 }
6417 /* Attribute handlers common to C front ends. */
6419 /* Handle a "packed" attribute; arguments as in
6420 struct attribute_spec.handler. */
6422 static tree
6425 {
6427 {
6431 }
6433 {
6435 /* Still pack bitfields. */
6440 else
6442 }
6443 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6444 used for DECL_REGISTER. It wouldn't mean anything anyway.
6445 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6446 that changes what the typedef is typing. */
6447 else
6448 {
6451 }
6454 }
6456 /* Handle a "nocommon" attribute; arguments as in
6457 struct attribute_spec.handler. */
6459 static tree
6463 {
6466 else
6467 {
6470 }
6473 }
6475 /* Handle a "common" attribute; arguments as in
6476 struct attribute_spec.handler. */
6478 static tree
6481 {
6484 else
6485 {
6488 }
6491 }
6493 /* Handle a "noreturn" attribute; arguments as in
6494 struct attribute_spec.handler. */
6496 static tree
6499 {
6502 /* See FIXME comment in c_common_attribute_table. */
6509 = build_pointer_type
6512 else
6513 {
6516 }
6519 }
6521 /* Handle a "hot" and attribute; arguments as in
6522 struct attribute_spec.handler. */
6524 static tree
6527 {
6530 {
6532 {
6536 }
6537 /* Most of the rest of the hot processing is done later with
6538 lookup_attribute. */
6539 }
6540 else
6541 {
6544 }
6547 }
6549 /* Handle a "cold" and attribute; arguments as in
6550 struct attribute_spec.handler. */
6552 static tree
6555 {
6558 {
6560 {
6564 }
6565 /* Most of the rest of the cold processing is done later with
6566 lookup_attribute. */
6567 }
6568 else
6569 {
6572 }
6575 }
6577 /* Handle a "no_sanitize_address" attribute; arguments as in
6578 struct attribute_spec.handler. */
6580 static tree
6583 {
6585 {
6588 }
6591 }
6593 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6594 struct attribute_spec.handler. */
6596 static tree
6599 {
6608 }
6610 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6611 struct attribute_spec.handler. */
6613 static tree
6616 {
6618 {
6621 }
6624 }
6626 /* Handle a "noinline" attribute; arguments as in
6627 struct attribute_spec.handler. */
6629 static tree
6633 {
6636 else
6637 {
6640 }
6643 }
6645 /* Handle a "noclone" attribute; arguments as in
6646 struct attribute_spec.handler. */
6648 static tree
6652 {
6654 {
6657 }
6660 }
6662 /* Handle a "always_inline" attribute; arguments as in
6663 struct attribute_spec.handler. */
6665 static tree
6670 {
6672 {
6673 /* Set the attribute and mark it for disregarding inline
6674 limits. */
6676 }
6677 else
6678 {
6681 }
6684 }
6686 /* Handle a "gnu_inline" attribute; arguments as in
6687 struct attribute_spec.handler. */
6689 static tree
6694 {
6696 {
6697 /* Do nothing else, just set the attribute. We'll get at
6698 it later with lookup_attribute. */
6699 }
6700 else
6701 {
6704 }
6707 }
6709 /* Handle a "leaf" attribute; arguments as in
6710 struct attribute_spec.handler. */
6712 static tree
6716 {
6718 {
6721 }
6723 {
6726 }
6729 }
6731 /* Handle an "artificial" attribute; arguments as in
6732 struct attribute_spec.handler. */
6734 static tree
6739 {
6741 {
6742 /* Do nothing else, just set the attribute. We'll get at
6743 it later with lookup_attribute. */
6744 }
6745 else
6746 {
6749 }
6752 }
6754 /* Handle a "flatten" attribute; arguments as in
6755 struct attribute_spec.handler. */
6757 static tree
6759 tree args ATTRIBUTE_UNUSED,
6761 {
6763 /* Do nothing else, just set the attribute. We'll get at
6764 it later with lookup_attribute. */
6765 ;
6766 else
6767 {
6770 }
6773 }
6775 /* Handle a "warning" or "error" attribute; arguments as in
6776 struct attribute_spec.handler. */
6778 static tree
6781 {
6784 /* Do nothing else, just set the attribute. We'll get at
6785 it later with lookup_attribute. */
6786 ;
6787 else
6788 {
6791 }
6794 }
6796 /* Handle a "used" attribute; arguments as in
6797 struct attribute_spec.handler. */
6799 static tree
6802 {
6808 {
6813 }
6814 else
6815 {
6818 }
6821 }
6823 /* Handle a "unused" attribute; arguments as in
6824 struct attribute_spec.handler. */
6826 static tree
6829 {
6831 {
6839 {
6844 }
6845 else
6846 {
6849 }
6850 }
6851 else
6852 {
6856 }
6859 }
6861 /* Handle a "externally_visible" attribute; arguments as in
6862 struct attribute_spec.handler. */
6864 static tree
6869 {
6873 {
6876 {
6880 }
6881 }
6882 else
6883 {
6886 }
6889 }
6891 /* Handle a "const" attribute; arguments as in
6892 struct attribute_spec.handler. */
6894 static tree
6897 {
6900 /* See FIXME comment on noreturn in c_common_attribute_table. */
6906 = build_pointer_type
6909 else
6910 {
6913 }
6916 }
6918 /* Handle a "transparent_union" attribute; arguments as in
6919 struct attribute_spec.handler. */
6921 static tree
6925 {
6926 tree type;
6937 {
6938 /* Make sure that the first field will work for a transparent union.
6939 If the type isn't complete yet, leave the check to the code in
6940 finish_struct. */
6942 {
6948 }
6951 {
6952 /* If the type isn't complete yet, setting the flag
6953 on a variant wouldn't ever be checked. */
6957 /* build_duplicate_type doesn't work for C++. */
6961 /* A type variant isn't good enough, since we don't a cast
6962 to such a type removed as a no-op. */
6964 }
6968 }
6970 ignored:
6973 }
6975 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6976 get the requested priority for a constructor or destructor,
6977 possibly issuing diagnostics for invalid or reserved
6978 priorities. */
6980 static priority_type
6982 {
6983 HOST_WIDE_INT pri;
6984 tree arg;
6990 {
6993 else
6996 }
7009 {
7012 "destructor priorities from 0 to %d are reserved "
7014 MAX_RESERVED_INIT_PRIORITY);
7015 else
7017 "constructor priorities from 0 to %d are reserved "
7019 MAX_RESERVED_INIT_PRIORITY);
7020 }
7023 invalid:
7026 MAX_INIT_PRIORITY);
7027 else
7029 MAX_INIT_PRIORITY);
7031 }
7033 /* Handle a "constructor" attribute; arguments as in
7034 struct attribute_spec.handler. */
7036 static tree
7040 {
7047 {
7048 priority_type priority;
7053 }
7054 else
7055 {
7058 }
7061 }
7063 /* Handle a "destructor" attribute; arguments as in
7064 struct attribute_spec.handler. */
7066 static tree
7070 {
7077 {
7078 priority_type priority;
7083 }
7084 else
7085 {
7088 }
7091 }
7093 /* Nonzero if the mode is a valid vector mode for this architecture.
7094 This returns nonzero even if there is no hardware support for the
7095 vector mode, but we can emulate with narrower modes. */
7097 static int
7099 {
7103 /* Doh! What's going on? */
7112 /* Hardware support. Woo hoo! */
7118 /* We should probably return 1 if requesting V4DI and we have no DI,
7119 but we have V2DI, but this is probably very unlikely. */
7121 /* If we have support for the inner mode, we can safely emulate it.
7122 We may not have V2DI, but me can emulate with a pair of DIs. */
7124 }
7127 /* Handle a "mode" attribute; arguments as in
7128 struct attribute_spec.handler. */
7130 static tree
7133 {
7141 else
7142 {
7147 tree typefm;
7152 {
7158 }
7160 /* Change this type to have a type with the specified mode.
7161 First check for the special modes. */
7174 else
7177 {
7180 }
7183 {
7186 }
7190 {
7222 }
7224 {
7227 }
7230 {
7235 {
7238 }
7242 else
7245 }
7246 else
7247 {
7248 /* For fixed-point modes, we need to test if the signness of type
7249 and the machine mode are consistent. */
7252 {
7255 }
7256 /* For fixed-point modes, we need to pass saturating info. */
7260 }
7263 {
7266 }
7268 {
7269 /* For enumeral types, copy the precision from the integer
7270 type returned above. If not an INTEGER_TYPE, we can't use
7271 this mode for this type. */
7273 {
7276 }
7279 {
7282 }
7283 else
7284 {
7285 /* We cannot build a type variant, as there's code that assumes
7286 that TYPE_MAIN_VARIANT has the same mode. This includes the
7287 debug generators. Instead, create a subrange type. This
7288 results in all of the enumeral values being emitted only once
7289 in the original, and the subtype gets them by reference. */
7292 else
7295 }
7296 }
7300 {
7303 }
7306 }
7309 }
7311 /* Handle a "section" attribute; arguments as in
7312 struct attribute_spec.handler. */
7314 static tree
7317 {
7321 {
7327 {
7331 {
7333 "section attribute cannot be specified for "
7336 }
7338 /* The decl may have already been given a section attribute
7339 from a previous declaration. Ensure they match. */
7343 {
7347 }
7351 {
7354 }
7355 else
7357 }
7358 else
7359 {
7362 }
7363 }
7364 else
7365 {
7369 }
7372 }
7374 /* Check whether ALIGN is a valid user-specified alignment. If so,
7375 return its base-2 log; if not, output an error and return -1. If
7376 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7377 no error. */
7378 int
7380 {
7385 {
7388 }
7393 {
7396 }
7398 {
7401 }
7403 }
7405 /*
7406 If in c++-11, check if the c++-11 alignment constraint with respect
7407 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7408 c++-11 mode, does nothing.
7410 [dcl.align]2/ says:
7412 [* if the constant expression evaluates to a fundamental alignment,
7413 the alignment requirement of the declared entity shall be the
7414 specified fundamental alignment.
7416 * if the constant expression evaluates to an extended alignment
7417 and the implementation supports that alignment in the context
7418 of the declaration, the alignment of the declared entity shall
7419 be that alignment
7421 * if the constant expression evaluates to an extended alignment
7422 and the implementation does not support that alignment in the
7423 context of the declaration, the program is ill-formed]. */
7425 static bool
7429 {
7442 {
7444 {
7445 /* For file scope variables and static members, the target
7446 supports alignments that are at most
7447 MAX_OFILE_ALIGNMENT. */
7450 }
7451 else
7452 {
7453 #ifdef BIGGEST_FIELD_ALIGNMENT
7454 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7455 #else
7456 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7457 #endif
7458 /* For non-static members, the target supports either
7459 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7460 if it is defined or BIGGEST_ALIGNMENT. */
7465 #undef MAX_TARGET_FIELD_ALIGNMENT
7466 /* For stack variables, the target supports at most
7467 MAX_STACK_ALIGNMENT. */
7471 }
7472 }
7474 {
7475 /* Let's be liberal for types. */
7478 }
7486 }
7488 /* Handle a "aligned" attribute; arguments as in
7489 struct attribute_spec.handler. */
7491 static tree
7494 {
7503 {
7507 }
7515 {
7518 /* If we have a TYPE_DECL, then copy the type, so that we
7519 don't accidentally modify a builtin type. See pushdecl. */
7522 {
7529 }
7530 else
7535 }
7538 {
7541 }
7544 /* C++-11 [dcl.align/4]:
7546 When multiple alignment-specifiers are specified for an
7547 entity, the alignment requirement shall be set to the
7548 strictest specified alignment.
7550 This formally comes from the c++11 specification but we are
7551 doing it for the GNU attribute syntax as well. */
7555 {
7560 else
7564 }
7565 else
7566 {
7569 }
7572 }
7574 /* Handle a "weak" attribute; arguments as in
7575 struct attribute_spec.handler. */
7577 static tree
7582 {
7585 {
7588 }
7590 {
7594 }
7598 else
7602 }
7604 /* Handle an "alias" or "ifunc" attribute; arguments as in
7605 struct attribute_spec.handler, except that IS_ALIAS tells us
7606 whether this is an alias as opposed to ifunc attribute. */
7608 static tree
7611 {
7616 {
7619 }
7623 /* A static variable declaration is always a tentative definition,
7624 but the alias is a non-tentative definition which overrides. */
7627 {
7631 }
7635 {
7639 }
7641 /* Note that the very first time we process a nested declaration,
7642 decl_function_context will not be set. Indeed, *would* never
7643 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7644 we do below. After such frobbery, pushdecl would set the context.
7645 In any case, this is never what we want. */
7647 {
7648 tree id;
7652 {
7656 }
7658 /* This counts as a use of the object pointed to. */
7663 else
7667 /* ifuncs are also aliases, so set that attribute too. */
7670 }
7671 else
7672 {
7675 }
7678 }
7680 /* Handle an "alias" or "ifunc" attribute; arguments as in
7681 struct attribute_spec.handler. */
7683 static tree
7686 {
7688 }
7690 /* Handle an "alias" or "ifunc" attribute; arguments as in
7691 struct attribute_spec.handler. */
7693 static tree
7696 {
7698 }
7700 /* Handle a "weakref" attribute; arguments as in struct
7701 attribute_spec.handler. */
7703 static tree
7706 {
7709 /* We must ignore the attribute when it is associated with
7710 local-scoped decls, since attribute alias is ignored and many
7711 such symbols do not even have a DECL_WEAK field. */
7713 || current_function_decl
7715 {
7719 }
7722 {
7726 }
7728 /* The idea here is that `weakref("name")' mutates into `weakref,
7729 alias("name")', and weakref without arguments, in turn,
7730 implicitly adds weak. */
7733 {
7740 }
7741 else
7742 {
7747 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7748 and that isn't supported; and because it wants to add it to
7749 the list of weak decls, which isn't helpful. */
7751 }
7754 }
7756 /* Handle an "visibility" attribute; arguments as in
7757 struct attribute_spec.handler. */
7759 static tree
7763 {
7769 {
7773 {
7775 name);
7777 }
7779 {
7783 }
7784 }
7786 {
7789 }
7792 {
7795 }
7797 /* If this is a type, set the visibility on the type decl. */
7799 {
7804 {
7806 name);
7808 }
7809 }
7819 else
7820 {
7821 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7823 }
7827 {
7841 }
7846 /* Go ahead and attach the attribute to the node as well. This is needed
7847 so we can determine whether we have VISIBILITY_DEFAULT because the
7848 visibility was not specified, or because it was explicitly overridden
7849 from the containing scope. */
7852 }
7854 /* Determine the ELF symbol visibility for DECL, which is either a
7855 variable or a function. It is an error to use this function if a
7856 definition of DECL is not available in this translation unit.
7857 Returns true if the final visibility has been determined by this
7858 function; false if the caller is free to make additional
7859 modifications. */
7861 bool
7863 {
7867 /* If the user explicitly specified the visibility with an
7868 attribute, honor that. DECL_VISIBILITY will have been set during
7869 the processing of the attribute. We check for an explicit
7870 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7871 to distinguish the use of an attribute from the use of a "#pragma
7872 GCC visibility push(...)"; in the latter case we still want other
7873 considerations to be able to overrule the #pragma. */
7875 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7880 /* Set default visibility to whatever the user supplied with
7881 visibility_specified depending on #pragma GCC visibility. */
7883 {
7886 {
7889 /* If visibility changed and DECL already has DECL_RTL, ensure
7890 symbol flags are updated. */
7895 }
7896 }
7898 }
7900 /* Handle an "tls_model" attribute; arguments as in
7901 struct attribute_spec.handler. */
7903 static tree
7906 {
7907 tree id;
7914 {
7917 }
7922 {
7925 }
7935 else
7936 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7940 }
7942 /* Handle a "no_instrument_function" attribute; arguments as in
7943 struct attribute_spec.handler. */
7945 static tree
7950 {
7954 {
7958 }
7960 {
7964 }
7965 else
7969 }
7971 /* Handle a "malloc" attribute; arguments as in
7972 struct attribute_spec.handler. */
7974 static tree
7977 {
7981 else
7982 {
7985 }
7988 }
7990 /* Handle a "alloc_size" attribute; arguments as in
7991 struct attribute_spec.handler. */
7993 static tree
7996 {
7999 {
8006 {
8011 }
8012 }
8014 }
8016 /* Handle a "fn spec" attribute; arguments as in
8017 struct attribute_spec.handler. */
8019 static tree
8023 {
8028 }
8030 /* Handle a "bnd_variable_size" attribute; arguments as in
8031 struct attribute_spec.handler. */
8033 static tree
8036 {
8038 {
8041 }
8044 }
8046 /* Handle a "bnd_legacy" attribute; arguments as in
8047 struct attribute_spec.handler. */
8049 static tree
8052 {
8054 {
8057 }
8060 }
8062 /* Handle a "warn_unused" attribute; arguments as in
8063 struct attribute_spec.handler. */
8065 static tree
8067 tree args ATTRIBUTE_UNUSED,
8069 {
8071 /* Do nothing else, just set the attribute. We'll get at
8072 it later with lookup_attribute. */
8073 ;
8074 else
8075 {
8078 }
8081 }
8083 /* Handle an "omp declare simd" attribute; arguments as in
8084 struct attribute_spec.handler. */
8086 static tree
8088 {
8090 }
8092 /* Handle an "omp declare target" attribute; arguments as in
8093 struct attribute_spec.handler. */
8095 static tree
8097 {
8099 }
8101 /* Handle a "returns_twice" attribute; arguments as in
8102 struct attribute_spec.handler. */
8104 static tree
8107 {
8110 else
8111 {
8114 }
8117 }
8119 /* Handle a "no_limit_stack" attribute; arguments as in
8120 struct attribute_spec.handler. */
8122 static tree
8127 {
8131 {
8135 }
8137 {
8141 }
8142 else
8146 }
8148 /* Handle a "pure" attribute; arguments as in
8149 struct attribute_spec.handler. */
8151 static tree
8154 {
8157 /* ??? TODO: Support types. */
8158 else
8159 {
8162 }
8165 }
8167 /* Digest an attribute list destined for a transactional memory statement.
8168 ALLOWED is the set of attributes that are allowed for this statement;
8169 return the attribute we parsed. Multiple attributes are never allowed. */
8171 int
8173 {
8178 {
8186 {
8189 }
8192 {
8195 }
8198 else
8200 }
8203 }
8205 /* Transform a TM attribute name into a maskable integer and back.
8206 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8207 to how the lack of an attribute is treated. */
8209 int
8211 {
8225 }
8227 tree
8229 {
8232 {
8250 }
8252 }
8254 /* Return the first TM attribute seen in LIST. */
8256 tree
8258 {
8260 {
8264 }
8266 }
8268 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8269 Here we accept only function types, and verify that none of the other
8270 function TM attributes are also applied. */
8271 /* ??? We need to accept class types for C++, but not C. This greatly
8272 complicates this function, since we can no longer rely on the extra
8273 processing given by function_type_required. */
8275 static tree
8278 {
8279 /* Only one path adds the attribute; others don't. */
8283 {
8286 /* Only tm_callable and tm_safe apply to classes. */
8289 /* FALLTHRU */
8293 {
8296 ;
8299 else
8301 }
8305 {
8308 {
8313 }
8314 }
8315 /* FALLTHRU */
8318 /* If a function is next, pass it on to be tried next. */
8322 ignored:
8325 }
8328 }
8330 /* Handle the TM_WRAP attribute; arguments as in
8331 struct attribute_spec.handler. */
8333 static tree
8336 {
8339 /* We don't need the attribute even on success, since we
8340 record the entry in an external table. */
8345 else
8346 {
8352 else
8353 {
8357 {
8361 else
8363 }
8364 else
8366 }
8367 }
8370 }
8372 /* Ignore the given attribute. Used when this attribute may be usefully
8373 overridden by the target, but is not used generically. */
8375 static tree
8379 {
8382 }
8384 /* Handle a "no vops" attribute; arguments as in
8385 struct attribute_spec.handler. */
8387 static tree
8391 {
8395 }
8397 /* Handle a "deprecated" attribute; arguments as in
8398 struct attribute_spec.handler. */
8400 static tree
8404 {
8412 {
8415 }
8418 {
8429 else
8431 }
8433 {
8438 }
8439 else
8443 {
8446 {
8452 }
8455 else
8457 }
8460 }
8462 /* Handle a "vector_size" attribute; arguments as in
8463 struct attribute_spec.handler. */
8465 static tree
8469 {
8479 {
8482 }
8484 /* Get the vector size (in bytes). */
8487 /* We need to provide for vector pointers, vector arrays, and
8488 functions returning vectors. For example:
8490 __attribute__((vector_size(16))) short *foo;
8492 In this case, the mode is SI, but the type being modified is
8493 HI, so we need to look further. */
8502 /* Get the mode of the type being modified. */
8513 {
8516 }
8519 {
8522 }
8525 {
8528 }
8530 /* Calculate how many units fit in the vector. */
8533 {
8536 }
8540 /* Build back pointers if needed. */
8544 }
8546 /* Handle the "nonnull" attribute. */
8547 static tree
8551 {
8555 /* If no arguments are specified, all pointer arguments should be
8556 non-null. Verify a full prototype is given so that the arguments
8557 will have the correct types when we actually check them later. */
8559 {
8561 {
8564 }
8566 }
8568 /* Argument list specified. Verify that each argument number references
8569 a pointer argument. */
8571 {
8575 {
8580 }
8583 {
8584 function_args_iterator iter;
8585 tree argument;
8589 {
8593 }
8597 {
8602 }
8605 {
8610 }
8611 }
8612 }
8615 }
8617 /* Check the argument list of a function call for null in argument slots
8618 that are marked as requiring a non-null pointer argument. The NARGS
8619 arguments are passed in the array ARGARRAY.
8620 */
8622 static void
8624 {
8625 tree a;
8633 /* See if any of the nonnull attributes has no arguments. If so,
8634 then every pointer argument is checked (in which case the check
8635 for pointer type is done in check_nonnull_arg). */
8637 do
8645 else
8646 {
8647 /* Walk the argument list. If we encounter an argument number we
8648 should check for non-null, do it. */
8650 {
8652 {
8656 }
8661 }
8662 }
8663 }
8665 /* Check that the Nth argument of a function call (counting backwards
8666 from the end) is a (pointer)0. The NARGS arguments are passed in the
8667 array ARGARRAY. */
8669 static void
8671 {
8675 {
8678 tree sentinel;
8679 function_args_iterator iter;
8680 tree t;
8682 /* Skip over the named arguments. */
8684 {
8687 len++;
8688 }
8691 {
8694 }
8696 /* The sentinel must be one of the varargs, i.e.
8697 in position >= the number of fixed arguments. */
8699 {
8703 }
8705 /* Validate the sentinel. */
8709 /* Although __null (in C++) is only an integer we allow it
8710 nevertheless, as we are guaranteed that it's exactly
8711 as wide as a pointer, and we don't want to force
8712 users to cast the NULL they have written there.
8713 We warn with -Wstrict-null-sentinel, though. */
8716 }
8717 }
8719 /* Helper for check_function_nonnull; given a list of operands which
8720 must be non-null in ARGS, determine if operand PARAM_NUM should be
8721 checked. */
8723 static bool
8725 {
8729 {
8736 }
8738 }
8740 /* Check that the function argument PARAM (which is operand number
8741 PARAM_NUM) is non-null. This is called by check_function_nonnull
8742 via check_function_arguments_recurse. */
8744 static void
8747 {
8748 /* Just skip checking the argument if it's not a pointer. This can
8749 happen if the "nonnull" attribute was given without an operand
8750 list (which means to check every pointer argument). */
8758 }
8760 /* Helper for nonnull attribute handling; fetch the operand number
8761 from the attribute argument list. */
8763 static bool
8765 {
8766 /* Verify the arg number is a constant. */
8773 }
8775 /* Handle a "nothrow" attribute; arguments as in
8776 struct attribute_spec.handler. */
8778 static tree
8781 {
8784 /* ??? TODO: Support types. */
8785 else
8786 {
8789 }
8792 }
8794 /* Handle a "cleanup" attribute; arguments as in
8795 struct attribute_spec.handler. */
8797 static tree
8800 {
8804 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8805 for global destructors in C++. This requires infrastructure that
8806 we don't have generically at the moment. It's also not a feature
8807 we'd be missing too much, since we do have attribute constructor. */
8809 {
8813 }
8815 /* Verify that the argument is a function in scope. */
8816 /* ??? We could support pointers to functions here as well, if
8817 that was considered desirable. */
8820 {
8824 }
8827 {
8831 }
8833 /* That the function has proper type is checked with the
8834 eventual call to build_function_call. */
8837 }
8839 /* Handle a "warn_unused_result" attribute. No special handling. */
8841 static tree
8845 {
8846 /* Ignore the attribute for functions not returning any value. */
8848 {
8851 }
8854 }
8856 /* Handle a "sentinel" attribute. */
8858 static tree
8861 {
8863 {
8867 }
8868 else
8869 {
8871 {
8875 }
8876 }
8879 {
8883 {
8887 }
8888 else
8889 {
8891 {
8895 }
8896 }
8897 }
8900 }
8902 /* Handle a "type_generic" attribute. */
8904 static tree
8908 {
8909 /* Ensure we have a function type. */
8912 /* Ensure we have a variadic function. */
8916 }
8918 /* Handle a "target" attribute. */
8920 static tree
8923 {
8924 /* Ensure we have a function type. */
8926 {
8929 }
8931 flags))
8935 }
8937 /* Arguments being collected for optimization. */
8942 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8943 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8944 false for #pragma GCC optimize. */
8946 bool
8948 {
8956 tree ap;
8958 /* Build up argv vector. Just in case the string is stored away, use garbage
8959 collected strings. */
8964 {
8968 {
8972 }
8975 {
8976 /* Split string into multiple substrings. */
8984 {
8991 {
8995 }
8996 else
8997 {
9000 }
9004 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9005 options. */
9007 {
9012 else
9016 }
9019 {
9022 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9023 itself is -Os, and any other switch begins with a -f. */
9029 }
9034 }
9036 }
9037 }
9047 /* Now parse the options. */
9057 /* Don't allow changing -fstrict-aliasing. */
9062 }
9064 /* For handling "optimize" attribute. arguments as in
9065 struct attribute_spec.handler. */
9067 static tree
9070 {
9071 /* Ensure we have a function type. */
9073 {
9076 }
9077 else
9078 {
9082 /* Save current options. */
9085 /* If we previously had some optimization options, use them as the
9086 default. */
9091 /* Parse options, and update the vector. */
9096 /* Restore current options. */
9098 }
9101 }
9103 /* Handle a "no_split_stack" attribute. */
9105 static tree
9110 {
9114 {
9118 }
9120 {
9124 }
9127 }
9129 /* Handle a "returns_nonnull" attribute; arguments as in
9130 struct attribute_spec.handler. */
9132 static tree
9135 {
9136 // Even without a prototype we still have a return type we can check.
9138 {
9141 }
9143 }
9145 \f
9146 /* Check for valid arguments being passed to a function with FNTYPE.
9147 There are NARGS arguments in the array ARGARRAY. */
9148 void
9150 {
9151 /* Check for null being passed in a pointer argument that must be
9152 non-null. We also need to do this if format checking is enabled. */
9157 /* Check for errors in format strings. */
9164 }
9166 /* Generic argument checking recursion routine. PARAM is the argument to
9167 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9168 once the argument is resolved. CTX is context for the callback. */
9169 void
9174 {
9178 {
9179 /* Strip coercion. */
9183 }
9186 {
9188 tree attrs;
9191 /* See if this is a call to a known internationalization function
9192 that modifies a format arg. Such a function may have multiple
9193 format_arg attributes (for example, ngettext). */
9196 attrs;
9199 {
9200 tree inner_arg;
9201 tree format_num_expr;
9204 call_expr_arg_iterator iter;
9206 /* Extract the argument number, which was previously checked
9207 to be valid. */
9219 {
9224 }
9225 }
9227 /* If we found a format_arg attribute and did a recursive check,
9228 we are done with checking this argument. Otherwise, we continue
9229 and this will be considered a non-literal. */
9232 }
9235 {
9236 /* Check both halves of the conditional expression. */
9242 }
9245 }
9247 /* Checks for a builtin function FNDECL that the number of arguments
9248 NARGS against the required number REQUIRED and issues an error if
9249 there is a mismatch. Returns true if the number of arguments is
9250 correct, otherwise false. */
9252 static bool
9254 {
9256 {
9260 }
9262 {
9266 }
9268 }
9270 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9271 Returns false if there was an error, otherwise true. */
9273 bool
9275 {
9281 {
9291 {
9293 {
9297 }
9299 }
9309 {
9316 {
9320 }
9322 }
9327 {
9332 {
9336 }
9339 {
9341 fndecl);
9343 }
9345 }
9350 {
9352 {
9355 }
9357 }
9362 }
9363 }
9365 /* Function to help qsort sort FIELD_DECLs by name order. */
9367 int
9369 {
9374 /* A nontype is "greater" than a type. */
9383 }
9386 gt_pointer_operator new_value;
9390 /* This routine compares two fields like field_decl_cmp but using the
9391 pointer operator in resort_data. */
9393 static int
9395 {
9400 /* A nontype is "greater" than a type. */
9406 {
9413 }
9415 }
9417 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9419 void
9422 gt_pointer_operator new_value,
9424 {
9429 resort_field_decl_cmp);
9430 }
9432 /* Subroutine of c_parse_error.
9433 Return the result of concatenating LHS and RHS. RHS is really
9434 a string literal, its first character is indicated by RHS_START and
9435 RHS_SIZE is its length (including the terminating NUL character).
9437 The caller is responsible for deleting the returned pointer. */
9441 {
9447 }
9449 /* Issue the error given by GMSGID, indicating that it occurred before
9450 TOKEN, which had the associated VALUE. */
9452 void
9455 {
9456 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9466 {
9471 {
9484 }
9488 else
9494 }
9516 {
9521 }
9529 {
9534 }
9535 else
9539 {
9542 }
9543 #undef catenate_messages
9544 }
9546 /* Mapping for cpp message reasons to the options that enable them. */
9548 struct reason_option_codes_t
9549 {
9552 };
9573 };
9575 /* Return the gcc option code associated with the reason for a cpp
9576 message, or 0 if none. */
9578 static int
9580 {
9584 {
9587 }
9589 }
9591 /* Callback from cpp_error for PFILE to print diagnostics from the
9592 preprocessor. The diagnostic is of type LEVEL, with REASON set
9593 to the reason code if LEVEL is represents a warning, at location
9594 LOCATION unless this is after lexing and the compiler's location
9595 should be used instead, with column number possibly overridden by
9596 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9597 the arguments. Returns true if a diagnostic was emitted, false
9598 otherwise. */
9600 bool
9604 {
9605 diagnostic_info diagnostic;
9606 diagnostic_t dlevel;
9611 {
9616 /* Fall through. */
9641 }
9654 }
9656 /* Convert a character from the host to the target execution character
9657 set. cpplib handles this, mostly. */
9659 HOST_WIDE_INT
9661 {
9662 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9663 zero-extended under -fno-signed-char. cpplib insists that characters
9664 and character constants are always unsigned. Hence we must convert
9665 back and forth. */
9673 else
9675 }
9677 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9678 references with an INDIRECT_REF of a constant at the bottom; much like the
9679 traditional rendering of offsetof as a macro. Return the folded result. */
9681 tree
9683 {
9687 {
9703 {
9706 }
9716 {
9720 }
9734 /* Check if the offset goes beyond the upper bound of the array. */
9736 {
9742 {
9746 {
9747 tree v;
9754 {
9762 }
9763 /* Don't warn if the array might be considered a poor
9764 man's flexible array member with a very permissive
9765 definition thereof. */
9769 "index %E denotes an offset "
9772 }
9773 }
9774 }
9781 /* Handle static members of volatile structs. */
9788 }
9791 }
9793 /* Likewise, but convert it to the return type of offsetof. */
9795 tree
9797 {
9799 }
9801 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9802 expression, because B will always be true. */
9804 void
9806 {
9809 "the omitted middle operand in ?: will always be %<true%>, "
9811 }
9813 /* Give an error for storing into ARG, which is 'const'. USE indicates
9814 how ARG was being used. */
9816 void
9818 {
9821 /* Using this macro rather than (for example) arrays of messages
9822 ensures that all the format strings are checked at compile
9823 time. */
9824 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9825 : (use == lv_increment ? (I) \
9826 : (use == lv_decrement ? (D) : (AS))))
9828 {
9839 else
9845 }
9851 arg);
9857 arg);
9859 {
9869 arg);
9870 }
9876 arg);
9877 else
9882 arg);
9883 }
9885 /* Print an error message for an invalid lvalue. USE says
9886 how the lvalue is being used and so selects the error message. LOC
9887 is the location for the error. */
9889 void
9891 {
9893 {
9911 }
9912 }
9914 /* Print an error message for an invalid indirection of type TYPE.
9915 ERRSTRING is the name of the operator for the indirection. */
9917 void
9919 {
9921 {
9929 type);
9934 type);
9939 type);
9944 type);
9949 type);
9953 }
9954 }
9955 \f
9956 /* *PTYPE is an incomplete array. Complete it with a domain based on
9957 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9958 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9959 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9961 int
9963 {
9971 {
9973 {
9974 int eltsize
9977 }
9979 {
9983 {
9987 }
9988 else
9989 {
9990 tree curindex;
10001 {
10005 else
10006 {
10008 {
10009 /* Since we treat size types now as ordinary
10010 unsigned types, we need an explicit overflow
10011 check. */
10015 }
10017 size_one_node);
10018 }
10021 }
10023 {
10027 }
10028 }
10029 }
10030 else
10031 {
10032 /* Make an error message unless that happened already. */
10035 }
10036 }
10037 else
10038 {
10042 }
10049 else
10052 /* Using build_distinct_type_copy and modifying things afterward instead
10053 of using build_array_type to create a new type preserves all of the
10054 TYPE_LANG_FLAG_? bits that the front end may have set. */
10062 /* Make sure we have the canonical MAIN_TYPE. */
10065 hashcode);
10068 /* Fix the canonical type. */
10078 else
10083 else
10089 {
10091 /* If we proceed with the array type as it is, we'll eventually
10092 crash in tree_low_cst(). */
10094 }
10098 }
10100 /* Like c_mark_addressable but don't check register qualifier. */
10101 void
10103 {
10109 }
10112 \f
10113 /* Used to help initialize the builtin-types.def table. When a type of
10114 the correct size doesn't exist, use error_mark_node instead of NULL.
10115 The later results in segfaults even when a decl using the type doesn't
10116 get invoked. */
10118 tree
10120 {
10123 }
10125 /* A helper function for resolve_overloaded_builtin in resolving the
10126 overloaded __sync_ builtins. Returns a positive power of 2 if the
10127 first operand of PARAMS is a pointer to a supported data type.
10128 Returns 0 if an error is encountered. */
10130 static int
10132 {
10133 tree type;
10137 {
10140 }
10154 incompatible:
10157 }
10159 /* A helper function for resolve_overloaded_builtin. Adds casts to
10160 PARAMS to make arguments match up with those of FUNCTION. Drops
10161 the variadic arguments at the end. Returns false if some error
10162 was encountered; true on success. */
10164 static bool
10167 {
10168 function_args_iterator iter;
10169 tree ptype;
10173 /* We've declared the implementation functions to use "volatile void *"
10174 as the pointer parameter, so we shouldn't get any complaints from the
10175 call to check_function_arguments what ever type the user used. */
10180 /* For the rest of the values, we need to cast these to FTYPE, so that we
10181 don't get warnings for passing pointer types, etc. */
10184 {
10188 /* XXX void_type_node belies the abstraction. */
10194 {
10197 }
10199 /* Only convert parameters if arg_type is unsigned integer type with
10200 new format sync routines, i.e. don't attempt to convert pointer
10201 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10202 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10203 kinds). */
10205 {
10206 /* Ideally for the first conversion we'd use convert_for_assignment
10207 so that we get warnings for anything that doesn't match the pointer
10208 type. This isn't portable across the C and C++ front ends atm. */
10213 }
10216 }
10218 /* __atomic routines are not variadic. */
10220 {
10223 }
10225 /* The definition of these primitives is variadic, with the remaining
10226 being "an optional list of variables protected by the memory barrier".
10227 No clue what that's supposed to mean, precisely, but we consider all
10228 call-clobbered variables to be protected so we're safe. */
10232 }
10234 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10235 RESULT to make it match the type of the first pointer argument in
10236 PARAMS. */
10238 static tree
10240 {
10245 /* New format doesn't require casting unless the types are the same size. */
10248 else
10250 }
10252 /* This function verifies the PARAMS to generic atomic FUNCTION.
10253 It returns the size if all the parameters are the same size, otherwise
10254 0 is returned if the parameters are invalid. */
10256 static int
10259 {
10264 tree type_0;
10266 /* Determine the parameter makeup. */
10268 {
10284 }
10287 {
10290 }
10292 /* Get type of first parameter, and determine its size. */
10295 {
10297 function);
10299 }
10301 /* Types must be compile time constant sizes. */
10303 {
10306 function);
10308 }
10312 /* Zero size objects are not allowed. */
10314 {
10317 function);
10319 }
10321 /* Check each other parameter is a pointer and the same size. */
10323 {
10326 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10330 {
10332 function);
10334 }
10337 {
10339 function);
10341 }
10342 }
10344 /* Check memory model parameters for validity. */
10346 {
10349 {
10352 {
10355 function);
10356 }
10357 }
10358 else
10360 {
10362 function);
10364 }
10365 }
10368 }
10371 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10372 at the beginning of the parameter list PARAMS representing the size of the
10373 objects. This is to match the library ABI requirement. LOC is the location
10374 of the function call.
10375 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10376 returned to allow the external call to be constructed. */
10378 static tree
10381 {
10382 tree size_node;
10384 /* Insert a SIZE_T parameter as the first param. If there isn't
10385 enough space, allocate a new vector and recursively re-build with that. */
10387 {
10390 tree f;
10399 }
10401 /* Add the size parameter and leave as a function call for processing. */
10405 }
10408 /* Return whether atomic operations for naturally aligned N-byte
10409 arguments are supported, whether inline or through libatomic. */
10410 static bool
10412 {
10414 {
10426 }
10427 }
10429 /* This will process an __atomic_exchange function call, determine whether it
10430 needs to be mapped to the _N variation, or turned into a library call.
10431 LOC is the location of the builtin call.
10432 FUNCTION is the DECL that has been invoked;
10433 PARAMS is the argument list for the call. The return value is non-null
10434 TRUE is returned if it is translated into the proper format for a call to the
10435 external library, and NEW_RETURN is set the tree for that function.
10436 FALSE is returned if processing for the _N variation is required, and
10437 NEW_RETURN is set to the the return value the result is copied into. */
10438 static bool
10441 {
10446 /* Size of 0 is an error condition. */
10448 {
10451 }
10453 /* If not a lock-free size, change to the library generic format. */
10455 {
10458 }
10460 /* Otherwise there is a lockfree match, transform the call from:
10461 void fn(T* mem, T* desired, T* return, model)
10462 into
10463 *return = (T) (fn (In* mem, (In) *desired, model)) */
10470 /* Create pointer to appropriate size. */
10474 /* Convert object pointer to required type. */
10477 /* Convert new value to required type, and dereference it. */
10482 /* Move memory model to the 3rd position, and end param list. */
10486 /* Convert return pointer and dereference it for later assignment. */
10490 }
10493 /* This will process an __atomic_compare_exchange function call, determine
10494 whether it needs to be mapped to the _N variation, or turned into a lib call.
10495 LOC is the location of the builtin call.
10496 FUNCTION is the DECL that has been invoked;
10497 PARAMS is the argument list for the call. The return value is non-null
10498 TRUE is returned if it is translated into the proper format for a call to the
10499 external library, and NEW_RETURN is set the tree for that function.
10500 FALSE is returned if processing for the _N variation is required. */
10502 static bool
10506 {
10511 /* Size of 0 is an error condition. */
10513 {
10516 }
10518 /* If not a lock-free size, change to the library generic format. */
10520 {
10521 /* The library generic format does not have the weak parameter, so
10522 remove it from the param list. Since a parameter has been removed,
10523 we can be sure that there is room for the SIZE_T parameter, meaning
10524 there will not be a recursive rebuilding of the parameter list, so
10525 there is no danger this will be done twice. */
10527 {
10531 }
10534 }
10536 /* Otherwise, there is a match, so the call needs to be transformed from:
10537 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10538 into
10539 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10545 /* Create pointer to appropriate size. */
10549 /* Convert object pointer to required type. */
10553 /* Convert expected pointer to required type. */
10557 /* Convert desired value to required type, and dereference it. */
10562 /* The rest of the parameters are fine. NULL means no special return value
10563 processing.*/
10566 }
10569 /* This will process an __atomic_load function call, determine whether it
10570 needs to be mapped to the _N variation, or turned into a library call.
10571 LOC is the location of the builtin call.
10572 FUNCTION is the DECL that has been invoked;
10573 PARAMS is the argument list for the call. The return value is non-null
10574 TRUE is returned if it is translated into the proper format for a call to the
10575 external library, and NEW_RETURN is set the tree for that function.
10576 FALSE is returned if processing for the _N variation is required, and
10577 NEW_RETURN is set to the the return value the result is copied into. */
10579 static bool
10582 {
10587 /* Size of 0 is an error condition. */
10589 {
10592 }
10594 /* If not a lock-free size, change to the library generic format. */
10596 {
10599 }
10601 /* Otherwise, there is a match, so the call needs to be transformed from:
10602 void fn(T* mem, T* return, model)
10603 into
10604 *return = (T) (fn ((In *) mem, model)) */
10610 /* Create pointer to appropriate size. */
10614 /* Convert object pointer to required type. */
10618 /* Move memory model to the 2nd position, and end param list. */
10622 /* Convert return pointer and dereference it for later assignment. */
10626 }
10629 /* This will process an __atomic_store function call, determine whether it
10630 needs to be mapped to the _N variation, or turned into a library call.
10631 LOC is the location of the builtin call.
10632 FUNCTION is the DECL that has been invoked;
10633 PARAMS is the argument list for the call. The return value is non-null
10634 TRUE is returned if it is translated into the proper format for a call to the
10635 external library, and NEW_RETURN is set the tree for that function.
10636 FALSE is returned if processing for the _N variation is required, and
10637 NEW_RETURN is set to the the return value the result is copied into. */
10639 static bool
10642 {
10647 /* Size of 0 is an error condition. */
10649 {
10652 }
10654 /* If not a lock-free size, change to the library generic format. */
10656 {
10659 }
10661 /* Otherwise, there is a match, so the call needs to be transformed from:
10662 void fn(T* mem, T* value, model)
10663 into
10664 fn ((In *) mem, (In) *value, model) */
10669 /* Create pointer to appropriate size. */
10673 /* Convert object pointer to required type. */
10677 /* Convert new value to required type, and dereference it. */
10682 /* The memory model is in the right spot already. Return is void. */
10686 }
10689 /* Some builtin functions are placeholders for other expressions. This
10690 function should be called immediately after parsing the call expression
10691 before surrounding code has committed to the type of the expression.
10693 LOC is the location of the builtin call.
10695 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10696 PARAMS is the argument list for the call. The return value is non-null
10697 when expansion is complete, and null if normal processing should
10698 continue. */
10700 tree
10703 {
10709 {
10715 else
10719 }
10721 /* Handle BUILT_IN_NORMAL here. */
10723 {
10728 {
10729 /* Handle these 4 together so that they can fall through to the next
10730 case if the call is transformed to an _N variant. */
10732 {
10734 {
10738 /* Change to the _N variant. */
10741 }
10744 {
10746 params,
10749 /* Change to the _N variant. */
10752 }
10754 {
10758 /* Change to the _N variant. */
10761 }
10763 {
10767 /* Change to the _N variant. */
10770 }
10773 }
10774 /* Fallthrough to the normal processing. */
10775 }
10792 {
10794 /* Fallthru for parameter processing. */
10795 }
10812 {
10823 orig_format))
10835 /* If new_return is set, assign function to that expr and cast the
10836 result to void since the generic interface returned void. */
10838 {
10839 /* Cast function result from I{1,2,4,8,16} to the required type. */
10842 result);
10846 }
10848 }
10852 }
10853 }
10855 /* vector_types_compatible_elements_p is used in type checks of vectors
10856 values used as operands of binary operators. Where it returns true, and
10857 the other checks of the caller succeed (being vector types in he first
10858 place, and matching number of elements), we can just treat the types
10859 as essentially the same.
10860 Contrast with vector_targets_convertible_p, which is used for vector
10861 pointer types, and vector_types_convertible_p, which will allow
10862 language-specific matches under the control of flag_lax_vector_conversions,
10863 and might still require a conversion. */
10864 /* True if vector types T1 and T2 can be inputs to the same binary
10865 operator without conversion.
10866 We don't check the overall vector size here because some of our callers
10867 want to give different error messages when the vectors are compatible
10868 except for the element count. */
10870 bool
10872 {
10885 /* Equality works here because c_common_signed_type uses
10886 TYPE_MAIN_VARIANT. */
10894 }
10896 /* Check for missing format attributes on function pointers. LTYPE is
10897 the new type or left-hand side type. RTYPE is the old type or
10898 right-hand side type. Returns TRUE if LTYPE is missing the desired
10899 attribute. */
10901 bool
10903 {
10905 tree ra;
10911 {
10912 tree la;
10917 }
10918 else
10920 }
10922 /* Subscripting with type char is likely to lose on a machine where
10923 chars are signed. So warn on any machine, but optionally. Don't
10924 warn for unsigned char since that type is safe. Don't warn for
10925 signed char because anyone who uses that must have done so
10926 deliberately. Furthermore, we reduce the false positive load by
10927 warning only for non-constant value of type char. */
10929 void
10931 {
10935 }
10937 /* Implement -Wparentheses for the unexpected C precedence rules, to
10938 cover cases like x + y << z which readers are likely to
10939 misinterpret. We have seen an expression in which CODE is a binary
10940 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10941 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10942 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10943 expression was not formed using a binary or unary operator, or it
10944 was enclosed in parentheses. */
10946 void
10950 {
10954 /* This macro tests that the expression ARG with original tree code
10955 CODE appears to be a boolean expression. or the result of folding a
10956 boolean expression. */
10957 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10958 (truth_value_p (TREE_CODE (ARG)) \
10959 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10961 || ((CODE) != INTEGER_CST \
10962 && (integer_onep (ARG) || integer_zerop (ARG))))
10965 {
11014 /* Check cases like x|y==z */
11021 /* Check cases like !x | y */
11025 "suggest parentheses around operand of "
11038 /* Check cases like x^y==z */
11060 /* Check cases like x&y==z */
11067 /* Check cases like !x & y */
11071 "suggest parentheses around operand of "
11094 {
11099 "comparisons like %<X<=Y<=Z%> do not "
11105 "comparisons like %<X<=Y<=Z%> do not "
11107 }
11109 }
11110 #undef NOT_A_BOOLEAN_EXPR_P
11111 }
11113 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11115 void
11117 {
11119 {
11122 else
11124 }
11125 }
11127 /* Warn for division by zero according to the value of DIVISOR. LOC
11128 is the location of the division operator. */
11130 void
11132 {
11133 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11134 about division by zero. Do not issue a warning if DIVISOR has a
11135 floating-point type, since we consider 0.0/0.0 a valid way of
11136 generating a NaN. */
11140 }
11142 /* Subroutine of build_binary_op. Give warnings for comparisons
11143 between signed and unsigned quantities that may fail. Do the
11144 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11145 so that casts will be considered, but default promotions won't
11146 be.
11148 LOCATION is the location of the comparison operator.
11150 The arguments of this function map directly to local variables
11151 of build_binary_op. */
11153 void
11158 {
11163 /* In C++, check for comparison of different enum types. */
11169 {
11173 }
11175 /* Do not warn if the comparison is being done in a signed type,
11176 since the signed type will only be chosen if it can represent
11177 all the values of the unsigned type. */
11180 /* Do not warn if both operands are unsigned. */
11183 else
11184 {
11190 else
11198 /* Do not warn if the signed quantity is an unsuffixed integer
11199 literal (or some static constant expression involving such
11200 literals or a conditional expression involving such literals)
11201 and it is non-negative. */
11204 /* Do not warn if the comparison is an equality operation, the
11205 unsigned quantity is an integral constant, and it would fit
11206 in the result if the result were signed. */
11211 /* In C, do not warn if the unsigned quantity is an enumeration
11212 constant and its maximum value would fit in the result if the
11213 result were signed. */
11219 else
11221 OPT_Wsign_compare,
11223 }
11225 /* Warn if two unsigned values are being compared in a size larger
11226 than their original size, and one (and only one) is the result of
11227 a `~' operator. This comparison will always fail.
11229 Also warn if one operand is a constant, and the constant does not
11230 have all bits set that are set in the ~ operand when it is
11231 extended. */
11238 {
11245 {
11246 tree primop;
11252 {
11256 }
11257 else
11258 {
11262 }
11267 {
11270 {
11274 else
11277 }
11278 }
11279 }
11287 }
11288 }
11290 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11291 type via c_common_type. If -Wdouble-promotion is in use, and the
11292 conditions for warning have been met, issue a warning. GMSGID is
11293 the warning message. It must have two %T specifiers for the type
11294 that was converted (generally "float") and the type to which it was
11295 converted (generally "double), respectively. LOC is the location
11296 to which the awrning should refer. */
11298 void
11301 {
11302 tree source_type;
11306 /* If the conversion will not occur at run-time, there is no need to
11307 warn about it. */
11319 else
11322 }
11324 /* Setup a TYPE_DECL node as a typedef representation.
11326 X is a TYPE_DECL for a typedef statement. Create a brand new
11327 ..._TYPE node (which will be just a variant of the existing
11328 ..._TYPE node with identical properties) and then install X
11329 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11331 The whole point here is to end up with a situation where each
11332 and every ..._TYPE node the compiler creates will be uniquely
11333 associated with AT MOST one node representing a typedef name.
11334 This way, even though the compiler substitutes corresponding
11335 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11336 early on, later parts of the compiler can always do the reverse
11337 translation and get back the corresponding typedef name. For
11338 example, given:
11340 typedef struct S MY_TYPE;
11341 MY_TYPE object;
11343 Later parts of the compiler might only know that `object' was of
11344 type `struct S' if it were not for code just below. With this
11345 code however, later parts of the compiler see something like:
11347 struct S' == struct S
11348 typedef struct S' MY_TYPE;
11349 struct S' object;
11351 And they can then deduce (from the node for type struct S') that
11352 the original object declaration was:
11354 MY_TYPE object;
11356 Being able to do this is important for proper support of protoize,
11357 and also for generating precise symbolic debugging information
11358 which takes full account of the programmer's (typedef) vocabulary.
11360 Obviously, we don't want to generate a duplicate ..._TYPE node if
11361 the TYPE_DECL node that we are now processing really represents a
11362 standard built-in type. */
11364 void
11366 {
11370 {
11373 }
11376 {
11384 }
11385 }
11387 /* Record the types used by the current global variable declaration
11388 being parsed, so that we can decide later to emit their debug info.
11389 Those types are in types_used_by_cur_var_decl, and we are going to
11390 store them in the types_used_by_vars_hash hash table.
11391 DECL is the declaration of the global variable that has been parsed. */
11393 void
11395 {
11399 {
11402 }
11403 }
11405 /* If DECL is a typedef that is declared in the current function,
11406 record it for the purpose of -Wunused-local-typedefs. */
11408 void
11410 {
11415 /* if this is not a locally defined typedef then we are not
11416 interested. */
11423 }
11425 /* If T is a TYPE_DECL declared locally, mark it as used. */
11427 void
11429 {
11434 }
11436 /* Warn if there are some unused locally defined typedefs in the
11437 current function. */
11439 void
11441 {
11443 tree decl;
11444 /* The number of times we have emitted -Wunused-local-typedefs
11445 warnings. If this is different from errorcount, that means some
11446 unrelated errors have been issued. In which case, we'll avoid
11447 emitting "unused-local-typedefs" warnings. */
11459 {
11463 OPT_Wunused_local_typedefs,
11466 }
11469 }
11471 /* The C and C++ parsers both use vectors to hold function arguments.
11472 For efficiency, we keep a cache of unused vectors. This is the
11473 cache. */
11478 /* Return a new vector from the cache. If the cache is empty,
11479 allocate a new vector. These vectors are GC'ed, so it is OK if the
11480 pointer is not released.. */
11484 {
11487 else
11488 {
11489 /* Passing 0 to vec::alloc returns NULL, and our callers require
11490 that we always return a non-NULL value. The vector code uses
11491 4 when growing a NULL vector, so we do too. */
11495 }
11496 }
11498 /* Release a vector of trees back to the cache. */
11500 void
11502 {
11504 {
11507 }
11508 }
11510 /* Get a new tree vector holding a single tree. */
11514 {
11518 }
11520 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11524 {
11529 }
11531 /* Get a new tree vector which is a copy of an existing one. */
11535 {
11538 tree t;
11545 }
11547 /* Return true if KEYWORD starts a type specifier. */
11549 bool
11551 {
11553 {
11583 }
11584 }
11586 /* Return true if KEYWORD names a type qualifier. */
11588 bool
11590 {
11592 {
11600 }
11601 }
11603 /* Return true if KEYWORD names a storage class specifier.
11605 RID_TYPEDEF is not included in this list despite `typedef' being
11606 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11607 such for syntactic convenience only. */
11609 bool
11611 {
11613 {
11623 }
11624 }
11626 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11628 static bool
11630 {
11632 {
11640 }
11641 }
11643 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11644 declaration-specifier (C99 6.7). */
11646 bool
11648 {
11655 {
11662 }
11663 }
11665 /* Initialize language-specific-bits of tree_contains_struct. */
11667 void
11669 {
11673 }
11675 /* Build a user-defined numeric literal out of an integer constant type VALUE
11676 with identifier SUFFIX. */
11678 tree
11681 {
11688 }
11690 /* For vector[index], convert the vector to a
11691 pointer of the underlying type. */
11692 void
11695 {
11697 {
11699 tree type1;
11713 }
11714 }
11716 /* Determine which of the operands, if any, is a scalar that needs to be
11717 converted to a vector, for the range of operations. */
11718 enum stv_conv
11721 {
11730 {
11731 /* Most GENERIC binary expressions require homogeneous arguments.
11732 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11733 argument that is a vector and a second one that is a scalar, so
11734 we never return stv_secondarg for them. */
11739 {
11741 {
11746 }
11747 else
11749 }
11756 /* ... fall through ... */
11777 /* What about UNLT_EXPR? */
11779 {
11780 tree tmp;
11782 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11785 }
11789 {
11791 {
11796 }
11798 }
11800 /* Allow integer --> real conversion if safe. */
11804 {
11806 {
11811 }
11813 }
11816 }
11819 }
11821 /* Return true iff ALIGN is an integral constant that is a fundamental
11822 alignment, as defined by [basic.align] in the c++-11
11823 specifications.
11825 That is:
11827 [A fundamental alignment is represented by an alignment less than or
11828 equal to the greatest alignment supported by the implementation
11829 in all contexts, which is equal to
11830 alignof(max_align_t)]. */
11832 bool
11834 {
11837 }