| blob | 93481b9302713c33e93783d7d3519fedab0dbba2 |
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/>. */
48 /* The following symbols are subsumed in the c_global_trees array, and
49 listed here individually for documentation purposes.
51 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
53 tree short_integer_type_node;
54 tree long_integer_type_node;
55 tree long_long_integer_type_node;
56 tree int128_integer_type_node;
58 tree short_unsigned_type_node;
59 tree long_unsigned_type_node;
60 tree long_long_unsigned_type_node;
61 tree int128_unsigned_type_node;
63 tree truthvalue_type_node;
64 tree truthvalue_false_node;
65 tree truthvalue_true_node;
67 tree ptrdiff_type_node;
69 tree unsigned_char_type_node;
70 tree signed_char_type_node;
71 tree wchar_type_node;
73 tree char16_type_node;
74 tree char32_type_node;
76 tree float_type_node;
77 tree double_type_node;
78 tree long_double_type_node;
80 tree complex_integer_type_node;
81 tree complex_float_type_node;
82 tree complex_double_type_node;
83 tree complex_long_double_type_node;
85 tree dfloat32_type_node;
86 tree dfloat64_type_node;
87 tree_dfloat128_type_node;
89 tree intQI_type_node;
90 tree intHI_type_node;
91 tree intSI_type_node;
92 tree intDI_type_node;
93 tree intTI_type_node;
95 tree unsigned_intQI_type_node;
96 tree unsigned_intHI_type_node;
97 tree unsigned_intSI_type_node;
98 tree unsigned_intDI_type_node;
99 tree unsigned_intTI_type_node;
101 tree widest_integer_literal_type_node;
102 tree widest_unsigned_literal_type_node;
104 Nodes for types `void *' and `const void *'.
106 tree ptr_type_node, const_ptr_type_node;
108 Nodes for types `char *' and `const char *'.
110 tree string_type_node, const_string_type_node;
112 Type `char[SOMENUMBER]'.
113 Used when an array of char is needed and the size is irrelevant.
115 tree char_array_type_node;
117 Type `int[SOMENUMBER]' or something like it.
118 Used when an array of int needed and the size is irrelevant.
120 tree int_array_type_node;
122 Type `wchar_t[SOMENUMBER]' or something like it.
123 Used when a wide string literal is created.
125 tree wchar_array_type_node;
127 Type `char16_t[SOMENUMBER]' or something like it.
128 Used when a UTF-16 string literal is created.
130 tree char16_array_type_node;
132 Type `char32_t[SOMENUMBER]' or something like it.
133 Used when a UTF-32 string literal is created.
135 tree char32_array_type_node;
137 Type `int ()' -- used for implicit declaration of functions.
139 tree default_function_type;
141 A VOID_TYPE node, packaged in a TREE_LIST.
143 tree void_list_node;
145 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
146 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
147 VAR_DECLS, but C++ does.)
149 tree function_name_decl_node;
150 tree pretty_function_name_decl_node;
151 tree c99_function_name_decl_node;
153 Stack of nested function name VAR_DECLs.
155 tree saved_function_name_decls;
157 */
160 \f
161 /* Switches common to the C front ends. */
163 /* Nonzero means don't output line number information. */
167 /* Nonzero causes -E output not to be done, but directives such as
168 #define that have side effects are still obeyed. */
172 /* Nonzero means dump macros in some fashion. */
176 /* Nonzero means pass #include lines through to the output. */
180 /* Nonzero means process PCH files while preprocessing. */
184 /* The file name to which we should write a precompiled header, or
185 NULL if no header will be written in this compile. */
189 /* Nonzero if an ISO standard was selected. It rejects macros in the
190 user's namespace. */
193 /* C/ObjC language option variables. */
196 /* Nonzero means allow type mismatches in conditional expressions;
197 just make their values `void'. */
201 /* Nonzero means enable C89 Amendment 1 features. */
205 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
209 /* Nonzero means use the ISO C11 dialect of C. */
213 /* Nonzero means that we have builtin functions, and main is an int. */
218 /* ObjC language option variables. */
221 /* Tells the compiler that this is a special run. Do not perform any
222 compiling, instead we are to test some platform dependent features
223 and output a C header file with appropriate definitions. */
227 /* Tells the compiler what is the constant string class for ObjC. */
232 /* C++ language option variables. */
235 /* Nonzero means generate separate instantiation control files and
236 juggle them at link time. */
240 /* The C++ dialect being used. C++98 is the default. */
244 /* Maximum template instantiation depth. This limit exists to limit the
245 time it takes to notice excessively recursive template instantiations.
247 The default is lower than the 1024 recommended by the C++0x standard
248 because G++ runs out of stack before 1024 with highly recursive template
249 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
253 /* The elements of `ridpointers' are identifier nodes for the reserved
254 type names and storage classes. It is indexed by a RID_... value. */
259 /* Nonzero means don't warn about problems that occur when the code is
260 executed. */
263 /* Whether we are building a boolean conversion inside
264 convert_for_assignment, or some other late binary operation. If
265 build_binary_op is called for C (from code shared by C and C++) in
266 this case, then the operands have already been folded and the
267 result will not be folded again, so C_MAYBE_CONST_EXPR should not
268 be generated. */
271 /* Whether lexing has been completed, so subsequent preprocessor
272 errors should use the compiler's input_location. */
275 /* Information about how a function name is generated. */
276 struct fname_var_t
277 {
281 };
283 /* The three ways of getting then name of the current function. */
286 {
287 /* C99 compliant __func__, must be first. */
289 /* GCC __FUNCTION__ compliant. */
291 /* GCC __PRETTY_FUNCTION__ compliant. */
294 };
296 /* Global visibility options. */
387 /* Reserved words. The third field is a mask: keywords are disabled
388 if they match the mask.
390 Masks for languages:
391 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
392 C --std=c99: D_CXXONLY | D_OBJC
393 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
394 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
395 C++ --std=c0x: D_CONLY | D_OBJC
396 ObjC++ is like C++ except that D_OBJC is not set
398 If -fno-asm is used, D_ASM is added to the mask. If
399 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
400 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
401 In C with -Wc++-compat, we warn if D_CXXWARN is set.
403 Note the complication of the D_CXX_OBJC keywords. These are
404 reserved words such as 'class'. In C++, 'class' is a reserved
405 word. In Objective-C++ it is too. In Objective-C, it is a
406 reserved word too, but only if it follows an '@' sign.
407 */
409 {
568 /* These Objective-C keywords are recognized only immediately after
569 an '@'. */
586 /* These are recognized only in protocol-qualifier context
587 (see above) */
594 /* These are recognized inside a property attribute list */
603 };
608 /* Table of machine-independent attributes common to all C-like languages. */
610 {
611 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
612 affects_type_identity } */
619 /* FIXME: logically, noreturn attributes should be listed as
620 "false, true, true" and apply to function types. But implementing this
621 would require all the places in the compiler that use TREE_THIS_VOLATILE
622 on a decl to identify non-returning functions to be located and fixed
623 to check the function type instead. */
648 /* The same comments as for noreturn attributes apply to const ones. */
672 handle_no_instrument_function_attribute,
690 /* ??? These two attributes didn't make the transition from the
691 Intel language document to the multi-vendor language document. */
696 /* For internal use (marking of builtins) only. The name contains space
697 to prevent its usage in source code. */
719 /* For internal use (marking of builtins) only. The name contains space
720 to prevent its usage in source code. */
731 handle_no_address_safety_analysis_attribute,
734 handle_no_sanitize_address_attribute,
737 handle_no_sanitize_undefined_attribute,
747 /* For internal use only. The leading '*' both prevents its usage in
748 source code and signals that it may be overridden by machine tables. */
753 /* For internal use (marking of builtins and runtime functions) only.
754 The name contains space to prevent its usage in source code. */
770 };
772 /* Give the specifications for the format attributes, used by C and all
773 descendants. */
776 {
777 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
778 affects_type_identity } */
784 };
786 /* Return identifier for address space AS. */
790 {
794 }
796 /* Push current bindings for the function name VAR_DECLS. */
798 void
800 {
805 {
809 {
811 saved);
813 }
814 }
816 /* Normally they'll have been NULL, so only push if we've got a
817 stack, or they are non-NULL. */
819 saved_function_name_decls);
820 }
822 /* Finish up the current bindings, adding them into the current function's
823 statement tree. This must be done _before_ finish_stmt_tree is called.
824 If there is no current function, we must be at file scope and no statements
825 are involved. Pop the previous bindings. */
827 void
829 {
838 {
846 }
852 {
853 /* We had saved values, restore them. */
854 tree saved;
857 {
862 }
864 }
866 }
868 /* Return the text name of the current function, suitably prettified
869 by PRETTY_P. Return string must be freed by caller. */
873 {
880 {
883 }
896 {
899 }
902 }
904 /* Return the VAR_DECL for a const char array naming the current
905 function. If the VAR_DECL has not yet been created, create it
906 now. RID indicates how it should be formatted and IDENTIFIER_NODE
907 ID is its name (unfortunately C and C++ hold the RID values of
908 keywords in different places, so we can't derive RID from ID in
909 this language independent code. LOC is the location of the
910 function. */
912 tree
914 {
924 {
925 /* If a tree is built here, it would normally have the lineno of
926 the current statement. Later this tree will be moved to the
927 beginning of the function and this line number will be wrong.
928 To avoid this problem set the lineno to 0 here; that prevents
929 it from appearing in the RTL. */
930 tree stmts;
938 saved_function_name_decls
942 }
947 }
949 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
951 tree
953 {
958 /* Compute the number of elements, for the array type. */
960 {
963 }
965 {
968 }
970 {
973 }
974 else
975 {
978 }
980 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
981 limit in C++98 Annex B is very large (65536) and is not normative,
982 so we do not diagnose it (warn_overlength_strings is forced off
983 in c_common_post_options). */
985 {
989 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
990 separate the %d from the 'C'. 'ISO' should not be
991 translated, but it may be moved after 'C%d' in languages
992 where modifiers follow nouns. */
994 "string length %qd is greater than the length %qd "
997 }
999 /* Create the array type for the string constant. The ISO C++
1000 standard says that a string literal has type `const char[N]' or
1001 `const wchar_t[N]'. We use the same logic when invoked as a C
1002 front-end with -Wwrite-strings.
1003 ??? We should change the type of an expression depending on the
1004 state of a warning flag. We should just be warning -- see how
1005 this is handled in the C++ front-end for the deprecated implicit
1006 conversion from string literals to `char*' or `wchar_t*'.
1008 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1009 array type being the unqualified version of that type.
1010 Therefore, if we are constructing an array of const char, we must
1011 construct the matching unqualified array type first. The C front
1012 end does not require this, but it does no harm, so we do it
1013 unconditionally. */
1024 }
1025 \f
1026 /* If DISABLE is true, stop issuing warnings. This is used when
1027 parsing code that we know will not be executed. This function may
1028 be called multiple times, and works as a stack. */
1030 static void
1032 {
1034 {
1037 }
1038 }
1040 /* If ENABLE is true, reenable issuing warnings. */
1042 static void
1044 {
1046 {
1049 }
1050 }
1052 /* Fully fold EXPR, an expression that was not folded (beyond integer
1053 constant expressions and null pointer constants) when being built
1054 up. If IN_INIT, this is in a static initializer and certain
1055 changes are made to the folding done. Clear *MAYBE_CONST if
1056 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1057 expression because it contains an evaluated operator (in C99) or an
1058 operator outside of sizeof returning an integer constant (in C90)
1059 not permitted in constant expressions, or because it contains an
1060 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1061 set to true by callers before calling this function.) Return the
1062 folded expression. Function arguments have already been folded
1063 before calling this function, as have the contents of SAVE_EXPR,
1064 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1065 C_MAYBE_CONST_EXPR. */
1067 tree
1069 {
1070 tree ret;
1076 /* This function is not relevant to C++ because C++ folds while
1077 parsing, and may need changes to be correct for C++ when C++
1078 stops folding while parsing. */
1085 {
1088 }
1095 }
1097 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1098 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1099 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1100 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1101 both evaluated and unevaluated subexpressions while
1102 *MAYBE_CONST_ITSELF is carried from only evaluated
1103 subexpressions). */
1105 static tree
1108 {
1120 /* This function is not relevant to C++ because C++ folds while
1121 parsing, and may need changes to be correct for C++ when C++
1122 stops folding while parsing. */
1126 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1127 anything else not counted as an expression cannot usefully be
1128 folded further at this point. */
1134 /* Operands of variable-length expressions (function calls) have
1135 already been folded, as have __builtin_* function calls, and such
1136 expressions cannot occur in constant expressions. */
1138 {
1142 }
1145 {
1154 else
1157 }
1159 /* Assignment, increment, decrement, function call and comma
1160 operators, and statement expressions, cannot occur in constant
1161 expressions if evaluated / outside of sizeof. (Function calls
1162 were handled above, though VA_ARG_EXPR is treated like a function
1163 call here, and statement expressions are handled through
1164 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1166 {
1186 }
1188 /* Fold individual tree codes as appropriate. */
1190 {
1192 /* Any non-constancy will have been marked in a containing
1193 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1201 maybe_const_itself);
1206 {
1209 }
1218 maybe_const_itself);
1221 maybe_const_itself);
1227 {
1231 }
1273 /* Binary operations evaluating both arguments (increment and
1274 decrement are binary internally in GCC). */
1278 maybe_const_itself);
1286 /* The RHS of a MODIFY_EXPR was fully folded when building that
1287 expression for the sake of conversion warnings. */
1290 maybe_const_itself);
1294 ret = in_init
1297 else
1310 {
1321 }
1327 CASE_CONVERT:
1337 /* Unary operations. */
1340 maybe_const_itself);
1344 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1345 not prepared to deal with them if they occur in initializers. */
1353 ret = in_init
1356 else
1361 {
1365 }
1367 {
1370 CASE_CONVERT:
1371 /* Don't warn about explicit conversions. We will already
1372 have warned about suspect implicit conversions. */
1379 }
1384 /* Binary operations not necessarily evaluating both
1385 arguments. */
1392 ? truthvalue_false_node
1400 ret = in_init
1403 else
1408 && op0_const
1409 && op0_const_self
1415 && op0_const_self
1441 else
1446 && op0_const
1447 && op0_const_self
1451 && op0_const_self
1455 && op0_const
1456 && op0_const_self
1460 && op0_const_self
1466 /* Each case where an operand with excess precision may be
1467 encountered must remove the EXCESS_PRECISION_EXPR around
1468 inner operands and possibly put one around the whole
1469 expression or possibly convert to the semantic type (which
1470 c_fully_fold does); we cannot tell at this stage which is
1471 appropriate in any particular case. */
1475 /* Various codes may appear through folding built-in functions
1476 and their arguments. */
1478 }
1480 out:
1481 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1482 have been done by this point, so remove them again. */
1486 {
1490 }
1494 }
1496 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1497 return EXP. Otherwise, return either EXP or its known constant
1498 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1499 Is the BLKmode test appropriate? */
1501 tree
1503 {
1504 tree ret;
1506 /* This function is only used by C, for c_fully_fold and other
1507 optimization, and may not be correct for C++. */
1518 /* Avoid unwanted tree sharing between the initializer and current
1519 function's body where the tree can be modified e.g. by the
1520 gimplifier. */
1524 }
1526 /* Print a warning if a constant expression had overflow in folding.
1527 Invoke this function on every expression that the language
1528 requires to be a constant expression.
1529 Note the ANSI C standard says it is erroneous for a
1530 constant expression to overflow. */
1532 void
1534 {
1542 }
1544 /* The same as above but print an unconditional error. */
1545 void
1547 {
1554 }
1556 /* Print a warning if an expression had overflow in folding and its
1557 operands hadn't.
1559 Invoke this function on every expression that
1560 (1) appears in the source code, and
1561 (2) is a constant expression that overflowed, and
1562 (3) is not already checked by convert_and_check;
1563 however, do not invoke this function on operands of explicit casts
1564 or when the expression is the result of an operator and any operand
1565 already overflowed. */
1567 void
1569 {
1574 {
1603 }
1604 }
1606 /* Warn about uses of logical || / && operator in a context where it
1607 is likely that the bitwise equivalent was intended by the
1608 programmer. We have seen an expression in which CODE is a binary
1609 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1610 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1611 void
1615 {
1627 /* Warn if &&/|| are being used in a context where it is
1628 likely that the bitwise equivalent was intended by the
1629 programmer. That is, an expression such as op && MASK
1630 where op should not be any boolean expression, nor a
1631 constant, and mask seems to be a non-boolean integer constant. */
1639 {
1643 else
1648 }
1650 /* We do not warn for constants because they are typical of macro
1651 expansions that test for features. */
1655 /* This warning only makes sense with logical operands. */
1663 /* We first test whether either side separately is trivially true
1664 (with OR) or trivially false (with AND). If so, do not warn.
1665 This is a common idiom for testing ranges of data types in
1666 portable code. */
1673 /* If this is an OR operation, invert both sides; now, the result
1674 should be always false to get a warning. */
1688 /* If this is an OR operation, invert both sides; now, the result
1689 should be always false to get a warning. */
1697 /* If both expressions have the same operand, if we can merge the
1698 ranges, and if the range test is always false, then warn. */
1705 {
1708 "logical %<or%> "
1710 else
1712 "logical %<and%> "
1714 }
1715 }
1718 /* Warn if EXP contains any computations whose results are not used.
1719 Return true if a warning is printed; false otherwise. LOCUS is the
1720 (potential) location of the expression. */
1722 bool
1724 {
1725 restart:
1729 /* Don't warn about void constructs. This includes casting to void,
1730 void function calls, and statement expressions with a final cast
1731 to void. */
1739 {
1755 /* For a binding, warn if no side effect within it. */
1767 /* In && or ||, warn if 2nd operand has no side effect. */
1774 /* Let people do `(foo (), 0)' without a warning. */
1781 /* If this is an expression with side effects, don't warn; this
1782 case commonly appears in macro expansions. */
1788 /* Don't warn about automatic dereferencing of references, since
1789 the user cannot control it. */
1791 {
1794 }
1795 /* Fall through. */
1798 /* Referencing a volatile value is a side effect, so don't warn. */
1803 /* If this is an expression which has no operands, there is no value
1804 to be unused. There are no such language-independent codes,
1805 but front ends may define such. */
1809 warn:
1811 }
1812 }
1815 /* Print a warning about casts that might indicate violation
1816 of strict aliasing rules if -Wstrict-aliasing is used and
1817 strict aliasing mode is in effect. OTYPE is the original
1818 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1820 bool
1822 {
1823 /* Strip pointer conversion chains and get to the correct original type. */
1831 /* If the type we are casting to is a ref-all pointer
1832 dereferencing it is always valid. */
1839 {
1840 /* Casting the address of an object to non void pointer. Warn
1841 if the cast breaks type based aliasing. */
1843 {
1847 }
1848 else
1849 {
1850 /* warn_strict_aliasing >= 3. This includes the default (3).
1851 Only warn if the cast is dereferenced immediately. */
1852 alias_set_type set1 =
1858 {
1862 }
1865 {
1869 }
1870 }
1871 }
1872 else
1874 {
1875 /* At this level, warn for any conversions, even if an address is
1876 not taken in the same statement. This will likely produce many
1877 false positives, but could be useful to pinpoint problems that
1878 are not revealed at higher levels. */
1883 {
1887 }
1888 }
1891 }
1893 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1894 sizeof as last operand of certain builtins. */
1896 void
1900 {
1904 location_t loc;
1912 {
1916 /* FALLTHRU */
1924 /* FALLTHRU */
1983 }
2011 {
2015 {
2018 "argument to %<sizeof%> in %qD call is the same "
2019 "expression as the destination; did you mean to "
2025 "argument to %<sizeof%> in %qD call is the same "
2026 "expression as the destination; did you mean to "
2028 else
2030 "argument to %<sizeof%> in %qD call is the same "
2031 "expression as the destination; did you mean to "
2034 }
2037 && !strop
2040 {
2042 "argument to %<sizeof%> in %qD call is the same "
2043 "pointer type %qT as the destination; expected %qT "
2047 }
2048 }
2051 {
2055 {
2058 "argument to %<sizeof%> in %qD call is the same "
2059 "expression as the source; did you mean to "
2065 "argument to %<sizeof%> in %qD call is the same "
2066 "expression as the source; did you mean to "
2068 else
2070 "argument to %<sizeof%> in %qD call is the same "
2071 "expression as the source; did you mean to "
2074 }
2077 && !strop
2080 {
2082 "argument to %<sizeof%> in %qD call is the same "
2083 "pointer type %qT as the source; expected %qT "
2087 }
2088 }
2091 {
2095 {
2098 "argument to %<sizeof%> in %qD call is the same "
2099 "expression as the first source; did you mean to "
2105 "argument to %<sizeof%> in %qD call is the same "
2106 "expression as the first source; did you mean to "
2108 else
2110 "argument to %<sizeof%> in %qD call is the same "
2111 "expression as the first source; did you mean to "
2114 }
2117 && !strop
2120 {
2122 "argument to %<sizeof%> in %qD call is the same "
2123 "pointer type %qT as the first source; expected %qT "
2127 }
2128 }
2131 {
2135 {
2138 "argument to %<sizeof%> in %qD call is the same "
2139 "expression as the second source; did you mean to "
2145 "argument to %<sizeof%> in %qD call is the same "
2146 "expression as the second source; did you mean to "
2148 else
2150 "argument to %<sizeof%> in %qD call is the same "
2151 "expression as the second source; did you mean to "
2154 }
2157 && !strop
2160 {
2162 "argument to %<sizeof%> in %qD call is the same "
2163 "pointer type %qT as the second source; expected %qT "
2167 }
2168 }
2170 }
2172 /* Warn for unlikely, improbable, or stupid DECL declarations
2173 of `main'. */
2175 void
2177 {
2178 function_args_iterator iter;
2179 tree type;
2183 {
2184 /* XXX void_type_node belies the abstraction. */
2190 {
2212 "third argument of %q+D should probably be "
2215 }
2216 }
2218 /* It is intentional that this message does not mention the third
2219 argument because it's only mentioned in an appendix of the
2220 standard. */
2224 }
2226 /* vector_targets_convertible_p is used for vector pointer types. The
2227 callers perform various checks that the qualifiers are satisfactory,
2228 while OTOH vector_targets_convertible_p ignores the number of elements
2229 in the vectors. That's fine with vector pointers as we can consider,
2230 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2231 and that does not require and conversion of the pointer values.
2232 In contrast, vector_types_convertible_p and
2233 vector_types_compatible_elements_p are used for vector value types. */
2234 /* True if pointers to distinct types T1 and T2 can be converted to
2235 each other without an explicit cast. Only returns true for opaque
2236 vector types. */
2237 bool
2239 {
2246 }
2248 /* vector_types_convertible_p is used for vector value types.
2249 It could in principle call vector_targets_convertible_p as a subroutine,
2250 but then the check for vector type would be duplicated with its callers,
2251 and also the purpose of vector_targets_convertible_p would become
2252 muddled.
2253 Where vector_types_convertible_p returns true, a conversion might still be
2254 needed to make the types match.
2255 In contrast, vector_targets_convertible_p is used for vector pointer
2256 values, and vector_types_compatible_elements_p is used specifically
2257 in the context for binary operators, as a check if use is possible without
2258 conversion. */
2259 /* True if vector types T1 and T2 can be converted to each other
2260 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2261 can only be converted with -flax-vector-conversions yet that is not
2262 in effect, emit a note telling the user about that option if such
2263 a note has not previously been emitted. */
2264 bool
2266 {
2274 convertible_lax =
2289 {
2292 "conversions between vectors with differing "
2294 }
2297 }
2299 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2300 and have vector types, V0 has the same type as V1, and the number of
2301 elements of V0, V1, MASK is the same.
2303 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2304 called with two arguments. In this case implementation passes the
2305 first argument twice in order to share the same tree code. This fact
2306 could enable the mask-values being twice the vector length. This is
2307 an implementation accident and this semantics is not guaranteed to
2308 the user. */
2309 tree
2312 {
2313 tree ret;
2319 {
2322 }
2330 {
2335 }
2339 {
2343 }
2346 {
2351 }
2357 {
2360 "argument vector(s) and the mask vector should "
2363 }
2367 {
2372 }
2375 {
2376 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2382 else
2383 {
2386 }
2390 }
2400 }
2402 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2403 to integral type. */
2405 static tree
2407 {
2412 {
2413 /* C++0x scoped enumerations don't implicitly convert to integral
2414 type; if we stripped an explicit conversion to a larger type we
2415 need to replace it so common_type will still work. */
2419 }
2421 }
2423 /* This is a helper function of build_binary_op.
2425 For certain operations if both args were extended from the same
2426 smaller type, do the arithmetic in that type and then extend.
2428 BITWISE indicates a bitwise operation.
2429 For them, this optimization is safe only if
2430 both args are zero-extended or both are sign-extended.
2431 Otherwise, we might change the result.
2432 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2433 but calculated in (unsigned short) it would be (unsigned short)-1.
2434 */
2435 tree
2437 {
2441 tree type;
2443 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2444 excessive narrowing when we call get_narrower below. For
2445 example, suppose that OP0 is of unsigned int extended
2446 from signed char and that RESULT_TYPE is long long int.
2447 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2448 like
2450 (long long int) (unsigned int) signed_char
2452 which get_narrower would narrow down to
2454 (unsigned int) signed char
2456 If we do not cast OP0 first, get_narrower would return
2457 signed_char, which is inconsistent with the case of the
2458 explicit cast. */
2465 /* UNS is 1 if the operation to be done is an unsigned one. */
2468 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2469 but it *requires* conversion to FINAL_TYPE. */
2480 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2482 /* For bitwise operations, signedness of nominal type
2483 does not matter. Consider only how operands were extended. */
2487 /* Note that in all three cases below we refrain from optimizing
2488 an unsigned operation on sign-extended args.
2489 That would not be valid. */
2491 /* Both args variable: if both extended in same way
2492 from same width, do it in that width.
2493 Do it unsigned if args were zero-extended. */
2500 return c_common_signed_or_unsigned_type
2507 && (type
2518 && (type
2526 }
2528 /* Checks if expression EXPR of real/integer type cannot be converted
2529 to the real/integer type TYPE. Function returns true when:
2530 * EXPR is a constant which cannot be exactly converted to TYPE
2531 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2532 for EXPR type and TYPE being both integers or both real.
2533 * EXPR is not a constant of real type and TYPE is an integer.
2534 * EXPR is not a constant of integer type which cannot be
2535 exactly converted to real type.
2536 Function allows conversions between types of different signedness and
2537 does not return true in that case. Function can produce signedness
2538 warnings if PRODUCE_WARNS is true. */
2539 bool
2541 {
2547 {
2548 /* Warn for real constant that is not an exact integer converted
2549 to integer type. */
2552 {
2555 }
2556 /* Warn for an integer constant that does not fit into integer type. */
2560 {
2563 {
2567 }
2569 {
2573 }
2574 else
2576 }
2578 {
2579 /* Warn for an integer constant that does not fit into real type. */
2581 {
2585 }
2586 /* Warn for a real constant that does not fit into a smaller
2587 real type. */
2590 {
2594 }
2595 }
2596 }
2597 else
2598 {
2599 /* Warn for real types converted to integer types. */
2606 {
2607 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2611 /* Don't warn for short y; short x = ((int)y & 0xff); */
2615 {
2616 /* If both args were extended from a shortest type,
2617 use that type if that is safe. */
2624 {
2630 /* If one of the operands is a non-negative constant
2631 that fits in the target type, then the type of the
2632 other operand does not matter. */
2641 /* If constant is unsigned and fits in the target
2642 type, then the result will also fit. */
2644 && unsigned0
2647 && unsigned1
2650 }
2651 }
2652 /* Warn for integer types converted to smaller integer types. */
2656 /* When they are the same width but different signedness,
2657 then the value may change. */
2660 /* Even when converted to a bigger type, if the type is
2661 unsigned but expr is signed, then negative values
2662 will be changed. */
2668 }
2670 /* Warn for integer types converted to real types if and only if
2671 all the range of values of the integer type cannot be
2672 represented by the real type. */
2675 {
2679 /* Don't warn about char y = 0xff; float x = (int) y; */
2691 }
2693 /* Warn for real types converted to smaller real types. */
2698 }
2701 }
2703 /* Warns if the conversion of EXPR to TYPE may alter a value.
2704 This is a helper function for warnings_for_convert_and_check. */
2706 static void
2708 {
2716 {
2729 /* Conversion from boolean to a signed:1 bit-field (which only
2730 can hold the values 0 and -1) doesn't lose information - but
2731 it does change the value. */
2746 {
2747 /* In case of COND_EXPR, we do not care about the type of
2748 COND_EXPR, only about the conversion of each operand. */
2755 }
2762 }
2763 }
2765 /* Produce warnings after a conversion. RESULT is the result of
2766 converting EXPR to TYPE. This is a helper function for
2767 convert_and_check and cp_convert_and_check. */
2769 void
2771 {
2778 {
2779 /* Do not diagnose overflow in a constant expression merely
2780 because a conversion overflowed. */
2785 {
2786 /* This detects cases like converting -129 or 256 to
2787 unsigned char. */
2791 else
2793 }
2797 /* No warning for converting 0x80000000 to int. */
2805 else
2807 }
2812 else
2814 }
2817 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2818 Invoke this function on every expression that is converted implicitly,
2819 i.e. because of language rules and not because of an explicit cast. */
2821 tree
2823 {
2824 tree result;
2825 tree expr_for_warning;
2827 /* Convert from a value with possible excess precision rather than
2828 via the semantic type, but do not warn about values not fitting
2829 exactly in the semantic type. */
2831 {
2837 }
2838 else
2852 }
2853 \f
2854 /* A node in a list that describes references to variables (EXPR), which are
2855 either read accesses if WRITER is zero, or write accesses, in which case
2856 WRITER is the parent of EXPR. */
2857 struct tlist
2858 {
2861 };
2863 /* Used to implement a cache the results of a call to verify_tree. We only
2864 use this for SAVE_EXPRs. */
2865 struct tlist_cache
2866 {
2870 tree expr;
2871 };
2873 /* Obstack to use when allocating tlist structures, and corresponding
2874 firstobj. */
2878 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2879 warnings. */
2881 /* SAVE_EXPRs need special treatment. We process them only once and then
2882 cache the results. */
2894 /* Create a new struct tlist and fill in its fields. */
2897 {
2904 }
2906 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2907 is nonnull, we ignore any node we find which has a writer equal to it. */
2909 static void
2911 {
2913 {
2920 }
2921 }
2923 /* Merge the nodes of ADD into TO. This merging process is done so that for
2924 each variable that already exists in TO, no new node is added; however if
2925 there is a write access recorded in ADD, and an occurrence on TO is only
2926 a read access, then the occurrence in TO will be modified to record the
2927 write. */
2929 static void
2931 {
2938 {
2945 {
2949 }
2951 {
2955 }
2957 }
2958 }
2960 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2961 references in list LIST conflict with it, excluding reads if ONLY writers
2962 is nonzero. */
2964 static void
2967 {
2970 /* Avoid duplicate warnings. */
2976 {
2980 {
2985 }
2987 }
2988 }
2990 /* Given a list LIST of references to variables, find whether any of these
2991 can cause conflicts due to missing sequence points. */
2993 static void
2995 {
2999 {
3002 }
3003 }
3005 /* Return nonzero if X is a tree that can be verified by the sequence point
3006 warnings. */
3007 static int
3009 {
3016 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3017 (lvalue_p) crash on TRY/CATCH. */
3024 /* No point to track non-const calls, they will never satisfy
3025 operand_equal_p. */
3033 }
3035 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3036 static bool
3038 {
3040 }
3042 /* Walk the tree X, and record accesses to variables. If X is written by the
3043 parent tree, WRITER is the parent.
3044 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3045 expression or its only operand forces a sequence point, then everything up
3046 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3047 in PNO_SP.
3048 Once we return, we will have emitted warnings if any subexpression before
3049 such a sequence point could be undefined. On a higher level, however, the
3050 sequence point may not be relevant, and we'll merge the two lists.
3052 Example: (b++, a) + b;
3053 The call that processes the COMPOUND_EXPR will store the increment of B
3054 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3055 processes the PLUS_EXPR will need to merge the two lists so that
3056 eventually, all accesses end up on the same list (and we'll warn about the
3057 unordered subexpressions b++ and b.
3059 A note on merging. If we modify the former example so that our expression
3060 becomes
3061 (b++, b) + a
3062 care must be taken not simply to add all three expressions into the final
3063 PNO_SP list. The function merge_tlist takes care of that by merging the
3064 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3065 way, so that no more than one access to B is recorded. */
3067 static void
3069 tree writer)
3070 {
3075 /* X may be NULL if it is the operand of an empty statement expression
3076 ({ }). */
3080 restart:
3088 {
3121 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3122 two first, to avoid warning for (a ? b++ : b++). */
3138 /* Expressions inside the LHS are not ordered wrt. the sequence points
3139 in the RHS. Example:
3140 *a = (a++, 2)
3141 Despite the fact that the modification of "a" is in the before_sp
3142 list (tmp_before), it conflicts with the use of "a" in the LHS.
3143 We can handle this by adding the contents of tmp_list3
3144 to those of tmp_before, and redoing the collision warnings for that
3145 list. */
3148 /* Exclude the LHS itself here; we first have to merge it into the
3149 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3150 didn't exclude the LHS, we'd get it twice, once as a read and once
3151 as a write. */
3162 /* We need to warn about conflicts among arguments and conflicts between
3163 args and the function address. Side effects of the function address,
3164 however, are not ordered by the sequence point of the call. */
3165 {
3166 call_expr_arg_iterator iter;
3167 tree arg;
3171 {
3176 }
3181 }
3184 /* Scan all the list, e.g. indices of multi dimensional array. */
3186 {
3192 }
3196 {
3203 {
3215 {
3219 }
3222 }
3226 }
3236 /* For other expressions, simply recurse on their operands.
3237 Manual tail recursion for unary expressions.
3238 Other non-expressions need not be processed. */
3240 {
3244 }
3246 {
3250 {
3255 }
3256 }
3258 }
3259 }
3261 /* Try to warn for undefined behavior in EXPR due to missing sequence
3262 points. */
3264 DEBUG_FUNCTION void
3266 {
3272 {
3275 }
3280 }
3281 \f
3282 /* Validate the expression after `case' and apply default promotions. */
3284 static tree
3286 {
3291 /* Promote char or short to int. */
3294 {
3297 }
3302 }
3303 \f
3304 /* See if the case values LOW and HIGH are in the range of the original
3305 type (i.e. before the default conversion to int) of the switch testing
3306 expression.
3307 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3308 the type before promoting it. CASE_LOW_P is a pointer to the lower
3309 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3310 if the case is not a case range.
3311 The caller has to make sure that we are not called with NULL for
3312 CASE_LOW_P (i.e. the default case).
3313 Returns true if the case label is in range of ORIG_TYPE (saturated or
3314 untouched) or false if the label is out of range. */
3316 static bool
3319 {
3324 /* If there was a problem with the original type, do nothing. */
3331 /* Case label is less than minimum for type. */
3334 {
3337 }
3339 /* Case value is greater than maximum for type. */
3342 {
3345 }
3347 /* Saturate lower case label value to minimum. */
3350 {
3354 }
3356 /* Saturate upper case label value to maximum. */
3359 {
3363 }
3371 }
3372 \f
3373 /* Return an integer type with BITS bits of precision,
3374 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3376 tree
3378 {
3417 }
3419 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3420 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3421 and saturating if SATP is nonzero, otherwise not saturating. */
3423 tree
3426 {
3430 else
3438 {
3440 "fixed-point types that have too many integral and "
3443 }
3446 }
3448 /* Used for communication between c_common_type_for_mode and
3449 c_register_builtin_type. */
3452 /* Return a data type that has machine mode MODE.
3453 If the mode is an integer,
3454 then UNSIGNEDP selects between signed and unsigned types.
3455 If the mode is a fixed-point mode,
3456 then UNSIGNEDP selects between saturating and nonsaturating types. */
3458 tree
3460 {
3461 tree t;
3498 #if HOST_BITS_PER_WIDE_INT >= 64
3501 #endif
3526 {
3528 tree inner_type;
3544 }
3546 {
3551 }
3561 {
3647 }
3655 }
3657 tree
3659 {
3661 }
3663 /* Return a signed type the same as TYPE in other respects. */
3665 tree
3667 {
3669 }
3671 /* Return a type the same as TYPE except unsigned or
3672 signed according to UNSIGNEDP. */
3674 tree
3676 {
3677 tree type1;
3679 /* This block of code emulates the behavior of the old
3680 c_common_unsigned_type. In particular, it returns
3681 long_unsigned_type_node if passed a long, even when a int would
3682 have the same size. This is necessary for warnings to work
3683 correctly in archs where sizeof(int) == sizeof(long) */
3686 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3702 #if HOST_BITS_PER_WIDE_INT >= 64
3705 #endif
3715 #define C_COMMON_FIXED_TYPES(NAME) \
3716 if (type1 == short_ ## NAME ## _type_node \
3717 || type1 == unsigned_short_ ## NAME ## _type_node) \
3718 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3719 : short_ ## NAME ## _type_node; \
3720 if (type1 == NAME ## _type_node \
3721 || type1 == unsigned_ ## NAME ## _type_node) \
3722 return unsignedp ? unsigned_ ## NAME ## _type_node \
3723 : NAME ## _type_node; \
3724 if (type1 == long_ ## NAME ## _type_node \
3725 || type1 == unsigned_long_ ## NAME ## _type_node) \
3726 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3727 : long_ ## NAME ## _type_node; \
3728 if (type1 == long_long_ ## NAME ## _type_node \
3729 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3730 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3731 : long_long_ ## NAME ## _type_node;
3733 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3734 if (type1 == NAME ## _type_node \
3735 || type1 == u ## NAME ## _type_node) \
3736 return unsignedp ? u ## NAME ## _type_node \
3737 : NAME ## _type_node;
3739 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3740 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3741 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3742 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3743 : sat_ ## short_ ## NAME ## _type_node; \
3744 if (type1 == sat_ ## NAME ## _type_node \
3745 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3746 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3747 : sat_ ## NAME ## _type_node; \
3748 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3749 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3750 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3751 : sat_ ## long_ ## NAME ## _type_node; \
3752 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3753 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3754 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3755 : sat_ ## long_long_ ## NAME ## _type_node;
3757 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3758 if (type1 == sat_ ## NAME ## _type_node \
3759 || type1 == sat_ ## u ## NAME ## _type_node) \
3760 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3761 : sat_ ## NAME ## _type_node;
3787 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3788 the precision; they have precision set to match their range, but
3789 may use a wider mode to match an ABI. If we change modes, we may
3790 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3791 the precision as well, so as to yield correct results for
3792 bit-field types. C++ does not have these separate bit-field
3793 types, and producing a signed or unsigned variant of an
3794 ENUMERAL_TYPE may cause other problems as well. */
3800 #define TYPE_OK(node) \
3801 (TYPE_MODE (type) == TYPE_MODE (node) \
3802 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3821 #if HOST_BITS_PER_WIDE_INT >= 64
3824 #endif
3833 #undef TYPE_OK
3836 }
3838 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3840 tree
3842 {
3843 /* Extended integer types of the same width as a standard type have
3844 lesser rank, so those of the same width as int promote to int or
3845 unsigned int and are valid for printf formats expecting int or
3846 unsigned int. To avoid such special cases, avoid creating
3847 extended integer types for bit-fields if a standard integer type
3848 is available. */
3865 }
3867 /* The C version of the register_builtin_type langhook. */
3869 void
3871 {
3872 tree decl;
3882 }
3883 \f
3884 /* Print an error message for invalid operands to arith operation
3885 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3886 LOCATION is the location of the message. */
3888 void
3891 {
3895 {
3940 }
3944 }
3945 \f
3946 /* Given an expression as a tree, return its original type. Do this
3947 by stripping any conversion that preserves the sign and precision. */
3948 static tree
3950 {
3953 }
3955 /* Subroutine of build_binary_op, used for comparison operations.
3956 See if the operands have both been converted from subword integer types
3957 and, if so, perhaps change them both back to their original type.
3958 This function is also responsible for converting the two operands
3959 to the proper common type for comparison.
3961 The arguments of this function are all pointers to local variables
3962 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3963 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3965 If this function returns nonzero, it means that the comparison has
3966 a constant value. What this function returns is an expression for
3967 that value. */
3969 tree
3972 {
3973 tree type;
3982 /* Throw away any conversions to wider types
3983 already present in the operands. */
3988 /* If primopN is first sign-extended from primopN's precision to opN's
3989 precision, then zero-extended from opN's precision to
3990 *restype_ptr precision, shortenings might be invalid. */
3993 && !unsignedp0
3998 && !unsignedp1
4002 /* Handle the case that OP0 does not *contain* a conversion
4003 but it *requires* conversion to FINAL_TYPE. */
4010 /* If one of the operands must be floated, we cannot optimize. */
4014 /* If first arg is constant, swap the args (changing operation
4015 so value is preserved), for canonicalization. Don't do this if
4016 the second arg is 0. */
4021 {
4038 {
4053 }
4055 }
4057 /* If comparing an integer against a constant more bits wide,
4058 maybe we can deduce a value of 1 or 0 independent of the data.
4059 Or else truncate the constant now
4060 rather than extend the variable at run time.
4062 This is only interesting if the constant is the wider arg.
4063 Also, it is not safe if the constant is unsigned and the
4064 variable arg is signed, since in this case the variable
4065 would be sign-extended and then regarded as unsigned.
4066 Our technique fails in this case because the lowest/highest
4067 possible unsigned results don't follow naturally from the
4068 lowest/highest possible values of the variable operand.
4069 For just EQ_EXPR and NE_EXPR there is another technique that
4070 could be used: see if the constant can be faithfully represented
4071 in the other operand's type, by truncating it and reextending it
4072 and see if that preserves the constant's value. */
4078 {
4081 /* 1 if comparison is nominally unsigned. */
4083 tree val;
4095 {
4096 /* Convert primop1 to target type, but do not introduce
4097 additional overflow. We know primop1 is an int_cst. */
4101 }
4103 {
4106 }
4109 {
4114 }
4115 else
4116 {
4121 }
4124 /* This used to be a switch, but Genix compiler can't handle that. */
4126 {
4129 }
4131 {
4134 }
4136 {
4141 }
4143 {
4148 }
4150 {
4155 }
4157 {
4162 }
4164 /* If primop0 was sign-extended and unsigned comparison specd,
4165 we did a signed comparison above using the signed type bounds.
4166 But the comparison we output must be unsigned.
4168 Also, for inequalities, VAL is no good; but if the signed
4169 comparison had *any* fixed result, it follows that the
4170 unsigned comparison just tests the sign in reverse
4171 (positive values are LE, negative ones GE).
4172 So we can generate an unsigned comparison
4173 against an extreme value of the signed type. */
4176 {
4179 {
4194 }
4196 }
4200 {
4207 }
4210 {
4211 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4215 }
4217 /* Value is not predetermined, but do the comparison
4218 in the type of the operand that is not constant.
4219 TYPE is already properly set. */
4220 }
4222 /* If either arg is decimal float and the other is float, find the
4223 proper common type to use for comparison. */
4234 /* If args' natural types are both narrower than nominal type
4235 and both extend in the same manner, compare them
4236 in the type of the wider arg.
4237 Otherwise must actually extend both to the nominal
4238 common type lest different ways of extending
4239 alter the result.
4240 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4245 {
4249 type);
4250 /* Make sure shorter operand is extended the right way
4251 to match the longer operand. */
4252 primop0
4255 primop0);
4256 primop1
4259 primop1);
4260 }
4261 else
4262 {
4263 /* Here we must do the comparison on the nominal type
4264 using the args exactly as we received them. */
4271 {
4273 /* All unsigned values are >= 0, so we warn. However,
4274 if OP0 is a constant that is >= 0, the signedness of
4275 the comparison isn't an issue, so suppress the
4276 warning. */
4278 warn_type_limits && !in_system_header
4282 primop0)))
4283 /* Do not warn for enumeration types. */
4287 {
4304 }
4307 {
4308 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4313 }
4314 }
4315 }
4323 }
4324 \f
4325 /* Return a tree for the sum or difference (RESULTCODE says which)
4326 of pointer PTROP and integer INTOP. */
4328 tree
4331 {
4334 /* The result is a pointer of the same type that is being added. */
4338 {
4345 }
4347 {
4354 }
4355 else
4358 /* We are manipulating pointer values, so we don't need to warn
4359 about relying on undefined signed overflow. We disable the
4360 warning here because we use integer types so fold won't know that
4361 they are really pointers. */
4364 /* If what we are about to multiply by the size of the elements
4365 contains a constant term, apply distributive law
4366 and multiply that constant term separately.
4367 This helps produce common subexpressions. */
4372 /* If the constant comes from pointer subtraction,
4373 skip this optimization--it would cause an error. */
4375 /* If the constant is unsigned, and smaller than the pointer size,
4376 then we must skip this optimization. This is because it could cause
4377 an overflow error if the constant is negative but INTOP is not. */
4381 {
4386 /* Convert both subexpression types to the type of intop,
4387 because weird cases involving pointer arithmetic
4388 can result in a sum or difference with different type args. */
4393 }
4395 /* Convert the integer argument to a type the same size as sizetype
4396 so the multiply won't overflow spuriously. */
4402 /* Replace the integer argument with a suitable product by the object size.
4403 Do this multiplication as signed, then convert to the appropriate type
4404 for the pointer operation and disregard an overflow that occurred only
4405 because of the sign-extension change in the latter conversion. */
4406 {
4414 }
4416 /* Create the sum or difference. */
4425 }
4426 \f
4427 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4428 and if NON_CONST is known not to be permitted in an evaluated part
4429 of a constant expression. */
4431 tree
4433 {
4437 /* This should never be called for C++. */
4441 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4450 }
4452 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4453 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4454 around the SAVE_EXPR if needed so that c_fully_fold does not need
4455 to look inside SAVE_EXPRs. */
4457 tree
4459 {
4468 }
4470 /* Return whether EXPR is a declaration whose address can never be
4471 NULL. */
4473 bool
4475 {
4480 }
4482 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4483 or for an `if' or `while' statement or ?..: exp. It should already
4484 have been validated to be of suitable type; otherwise, a bad
4485 diagnostic may result.
4487 The EXPR is located at LOCATION.
4489 This preparation consists of taking the ordinary
4490 representation of an expression expr and producing a valid tree
4491 boolean expression describing whether expr is nonzero. We could
4492 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4493 but we optimize comparisons, &&, ||, and !.
4495 The resulting type should always be `truthvalue_type_node'. */
4497 tree
4499 {
4501 {
4543 ? truthvalue_true_node
4549 ? truthvalue_true_node
4554 /* Fall through. */
4557 {
4560 {
4561 /* Common Ada/Pascal programmer's mistake. */
4563 OPT_Waddress,
4565 inner);
4567 }
4569 }
4586 /* These don't change whether an object is nonzero or zero. */
4591 /* These don't change whether an object is zero or nonzero, but
4592 we can't ignore them if their second arg has side-effects. */
4594 {
4597 c_common_truthvalue_conversion
4600 }
4601 else
4606 /* Distribute the conversion into the arms of a COND_EXPR. */
4608 {
4611 /* In C++ one of the arms might have void type if it is throw. */
4619 }
4620 else
4621 {
4622 /* Folding will happen later for C. */
4630 }
4632 CASE_CONVERT:
4633 {
4637 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4638 since that affects how `default_conversion' will behave. */
4642 /* Don't strip a conversion from C++0x scoped enum, since they
4643 don't implicitly convert to other types. */
4647 /* If this isn't narrowing the argument, we can ignore it. */
4651 }
4657 {
4661 }
4666 }
4669 {
4671 expr = (build_binary_op
4675 c_common_truthvalue_conversion
4678 c_common_truthvalue_conversion
4683 }
4686 {
4691 }
4692 else
4695 ret:
4698 }
4699 \f
4708 /* Apply the TYPE_QUALS to the new DECL. */
4710 void
4712 {
4720 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4721 constructor can produce constant init, so rely on cp_finish_decl to
4722 clear TREE_READONLY if the variable has non-constant init. */
4725 {
4728 }
4730 {
4732 /* Allow 'restrict' on arrays of pointers.
4733 FIXME currently we just ignore it. */
4739 }
4740 }
4742 /* Hash function for the problem of multiple type definitions in
4743 different files. This must hash all types that will compare
4744 equal via comptypes to the same value. In practice it hashes
4745 on some of the simple stuff and leaves the details to comptypes. */
4747 static hashval_t
4749 {
4753 tree t2;
4755 {
4756 /* For pointers, hash on pointee type plus some swizzling. */
4759 /* Hash on number of elements and total size. */
4778 }
4779 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4780 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4782 /* We might have a VLA here. */
4785 else
4788 }
4792 /* Return the typed-based alias set for T, which may be an expression
4793 or a type. Return -1 if we don't do anything special. */
4795 alias_set_type
4797 {
4798 tree u;
4801 /* For VLAs, use the alias set of the element type rather than the
4802 default of alias set 0 for types compared structurally. */
4804 {
4808 }
4810 /* Permit type-punning when accessing a union, provided the access
4811 is directly through the union. For example, this code does not
4812 permit taking the address of a union member and then storing
4813 through it. Even the type-punning allowed here is a GCC
4814 extension, albeit a common and useful one; the C standard says
4815 that such accesses have implementation-defined behavior. */
4823 /* That's all the expressions we handle specially. */
4827 /* The C standard guarantees that any object may be accessed via an
4828 lvalue that has character type. */
4834 /* The C standard specifically allows aliasing between signed and
4835 unsigned variants of the same type. We treat the signed
4836 variant as canonical. */
4838 {
4841 /* t1 == t can happen for boolean nodes which are always unsigned. */
4844 }
4846 /* Handle the case of multiple type nodes referring to "the same" type,
4847 which occurs with IMA. These share an alias set. FIXME: Currently only
4848 C90 is handled. (In C99 type compatibility is not transitive, which
4849 complicates things mightily. The alias set splay trees can theoretically
4850 represent this, but insertion is tricky when you consider all the
4851 different orders things might arrive in.) */
4856 /* Save time if there's only one input file. */
4860 /* Pointers need special handling if they point to any type that
4861 needs special handling (below). */
4863 {
4864 tree t2;
4865 /* Find bottom type under any nested POINTERs. */
4869 ;
4877 }
4878 /* These are the only cases that need special handling. */
4885 /* Undefined? */
4889 /* Look up t in hash table. Only one of the compatible types within each
4890 alias set is recorded in the table. */
4894 NULL);
4897 {
4900 }
4901 else
4902 /* Our caller will assign and record (in t) a new alias set; all we need
4903 to do is remember t in the hash table. */
4907 }
4908 \f
4909 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4910 the second parameter indicates which OPERATOR is being applied.
4911 The COMPLAIN flag controls whether we should diagnose possibly
4912 ill-formed constructs or not. LOC is the location of the SIZEOF or
4913 TYPEOF operator. */
4915 tree
4918 {
4926 {
4928 {
4935 }
4936 else
4937 {
4939 {
4943 else
4946 }
4948 }
4949 }
4951 {
4959 }
4962 {
4967 }
4970 {
4975 }
4976 else
4977 {
4979 /* Convert in case a char is more than one unit. */
4983 else
4985 }
4987 /* VALUE will have the middle-end integer type sizetype.
4988 However, we should really return a value of type `size_t',
4989 which is just a typedef for an ordinary integer type. */
4993 }
4995 /* Implement the __alignof keyword: Return the minimum required
4996 alignment of EXPR, measured in bytes. For VAR_DECLs,
4997 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4998 from an "aligned" __attribute__ specification). LOC is the
4999 location of the ALIGNOF operator. */
5001 tree
5003 {
5004 tree t;
5011 {
5014 }
5020 {
5027 {
5034 }
5036 }
5037 else
5041 }
5042 \f
5043 /* Handle C and C++ default attributes. */
5045 enum built_in_attribute
5046 {
5047 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5048 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5049 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5050 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5051 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5053 #undef DEF_ATTR_NULL_TREE
5054 #undef DEF_ATTR_INT
5055 #undef DEF_ATTR_STRING
5056 #undef DEF_ATTR_IDENT
5057 #undef DEF_ATTR_TREE_LIST
5058 ATTR_LAST
5059 };
5065 enum c_builtin_type
5066 {
5067 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5068 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5069 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5070 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5071 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5072 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5073 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5074 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5075 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5076 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5077 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5078 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5079 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5080 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5081 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5082 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5083 NAME,
5084 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5086 #undef DEF_PRIMITIVE_TYPE
5087 #undef DEF_FUNCTION_TYPE_0
5088 #undef DEF_FUNCTION_TYPE_1
5089 #undef DEF_FUNCTION_TYPE_2
5090 #undef DEF_FUNCTION_TYPE_3
5091 #undef DEF_FUNCTION_TYPE_4
5092 #undef DEF_FUNCTION_TYPE_5
5093 #undef DEF_FUNCTION_TYPE_6
5094 #undef DEF_FUNCTION_TYPE_7
5095 #undef DEF_FUNCTION_TYPE_8
5096 #undef DEF_FUNCTION_TYPE_VAR_0
5097 #undef DEF_FUNCTION_TYPE_VAR_1
5098 #undef DEF_FUNCTION_TYPE_VAR_2
5099 #undef DEF_FUNCTION_TYPE_VAR_3
5100 #undef DEF_FUNCTION_TYPE_VAR_4
5101 #undef DEF_FUNCTION_TYPE_VAR_5
5102 #undef DEF_POINTER_TYPE
5103 BT_LAST
5104 };
5108 /* A temporary array for c_common_nodes_and_builtins. Used in
5109 communication with def_fn_type. */
5112 /* A helper function for c_common_nodes_and_builtins. Build function type
5113 for DEF with return type RET and N arguments. If VAR is true, then the
5114 function should be variadic after those N arguments.
5116 Takes special care not to ICE if any of the types involved are
5117 error_mark_node, which indicates that said type is not in fact available
5118 (see builtin_type_for_size). In which case the function type as a whole
5119 should be error_mark_node. */
5121 static void
5123 {
5124 tree t;
5131 {
5137 }
5144 else
5147 egress:
5150 }
5152 /* Build builtin functions common to both C and C++ language
5153 frontends. */
5155 static void
5157 {
5158 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5159 builtin_types[ENUM] = VALUE;
5160 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5161 def_fn_type (ENUM, RETURN, 0, 0);
5162 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5163 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5164 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5165 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5166 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5167 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5168 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5169 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5170 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5171 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5172 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5173 ARG6) \
5174 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5175 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5176 ARG6, ARG7) \
5177 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5178 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5179 ARG6, ARG7, ARG8) \
5180 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5181 ARG7, ARG8);
5182 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5183 def_fn_type (ENUM, RETURN, 1, 0);
5184 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5185 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5186 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5187 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5188 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5189 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5190 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5191 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5192 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5193 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5194 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5195 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5199 #undef DEF_PRIMITIVE_TYPE
5200 #undef DEF_FUNCTION_TYPE_1
5201 #undef DEF_FUNCTION_TYPE_2
5202 #undef DEF_FUNCTION_TYPE_3
5203 #undef DEF_FUNCTION_TYPE_4
5204 #undef DEF_FUNCTION_TYPE_5
5205 #undef DEF_FUNCTION_TYPE_6
5206 #undef DEF_FUNCTION_TYPE_VAR_0
5207 #undef DEF_FUNCTION_TYPE_VAR_1
5208 #undef DEF_FUNCTION_TYPE_VAR_2
5209 #undef DEF_FUNCTION_TYPE_VAR_3
5210 #undef DEF_FUNCTION_TYPE_VAR_4
5211 #undef DEF_FUNCTION_TYPE_VAR_5
5212 #undef DEF_POINTER_TYPE
5217 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5218 NONANSI_P, ATTRS, IMPLICIT, COND) \
5219 if (NAME && COND) \
5220 def_builtin_1 (ENUM, NAME, CLASS, \
5221 builtin_types[(int) TYPE], \
5222 builtin_types[(int) LIBTYPE], \
5223 BOTH_P, FALLBACK_P, NONANSI_P, \
5224 built_in_attributes[(int) ATTRS], IMPLICIT);
5226 #undef DEF_BUILTIN
5234 }
5236 /* Like get_identifier, but avoid warnings about null arguments when
5237 the argument may be NULL for targets where GCC lacks stdint.h type
5238 information. */
5242 {
5244 }
5246 /* Build tree nodes and builtin functions common to both C and C++ language
5247 frontends. */
5249 void
5251 {
5255 tree array_domain_type;
5256 tree va_list_ref_type_node;
5257 tree va_list_arg_type_node;
5261 /* Define `int' and `char' first so that dbx will output them first. */
5265 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5266 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5267 but not C. Are the conditionals here needed? */
5273 long_unsigned_type_node);
5275 {
5277 int128_integer_type_node);
5279 int128_unsigned_type_node);
5280 }
5284 long_long_integer_type_node);
5286 long_long_unsigned_type_node);
5289 long_long_unsigned_type_node);
5292 short_unsigned_type_node);
5295 short_unsigned_type_node);
5297 /* Define both `signed char' and `unsigned char'. */
5301 /* These are types that c_common_type_for_size and
5302 c_common_type_for_mode use. */
5305 intQI_type_node));
5308 intHI_type_node));
5311 intSI_type_node));
5314 intDI_type_node));
5315 #if HOST_BITS_PER_WIDE_INT >= 64
5318 TYPE_DECL,
5320 intTI_type_node));
5321 #endif
5324 unsigned_intQI_type_node));
5327 unsigned_intHI_type_node));
5330 unsigned_intSI_type_node));
5333 unsigned_intDI_type_node));
5334 #if HOST_BITS_PER_WIDE_INT >= 64
5337 TYPE_DECL,
5339 unsigned_intTI_type_node));
5340 #endif
5342 /* Create the widest literal types. */
5343 widest_integer_literal_type_node
5347 widest_integer_literal_type_node));
5349 widest_unsigned_literal_type_node
5353 widest_unsigned_literal_type_node));
5357 pid_type_node =
5364 /* Only supported decimal floating point extension if the target
5365 actually supports underlying modes. */
5369 {
5373 }
5376 {
5381 long_long_fract_type_node);
5383 unsigned_short_fract_type_node);
5385 unsigned_fract_type_node);
5387 unsigned_long_fract_type_node);
5389 unsigned_long_long_fract_type_node);
5391 sat_short_fract_type_node);
5394 sat_long_fract_type_node);
5396 sat_long_long_fract_type_node);
5398 sat_unsigned_short_fract_type_node);
5400 sat_unsigned_fract_type_node);
5402 sat_unsigned_long_fract_type_node);
5404 sat_unsigned_long_long_fract_type_node);
5409 long_long_accum_type_node);
5411 unsigned_short_accum_type_node);
5413 unsigned_accum_type_node);
5415 unsigned_long_accum_type_node);
5417 unsigned_long_long_accum_type_node);
5419 sat_short_accum_type_node);
5422 sat_long_accum_type_node);
5424 sat_long_long_accum_type_node);
5426 sat_unsigned_short_accum_type_node);
5428 sat_unsigned_accum_type_node);
5430 sat_unsigned_long_accum_type_node);
5432 sat_unsigned_long_long_accum_type_node);
5434 }
5437 TYPE_DECL,
5439 complex_integer_type_node));
5441 TYPE_DECL,
5443 complex_float_type_node));
5445 TYPE_DECL,
5447 complex_double_type_node));
5451 complex_long_double_type_node));
5454 /* For C++, make fileptr_type_node a distinct void * type until
5455 FILE type is defined. */
5460 /* Set the TYPE_NAME for any variants that were built before
5461 record_builtin_type gave names to the built-in types. */
5462 {
5468 }
5470 /* This node must not be shared. */
5476 /* Make a type to be the domain of a few array types
5477 whose domains don't really matter.
5478 200 is small enough that it always fits in size_t
5479 and large enough that it can hold most function names for the
5480 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5483 /* Make a type for arrays of characters.
5484 With luck nothing will ever really depend on the length of this
5485 array type. */
5486 char_array_type_node
5489 /* Likewise for arrays of ints. */
5490 int_array_type_node
5494 const_string_type_node
5498 /* This is special for C++ so functions can be overloaded. */
5504 {
5507 else
5510 }
5512 /* This is for wide string constants. */
5513 wchar_array_type_node
5516 /* Define 'char16_t'. */
5521 {
5526 }
5528 /* This is for UTF-16 string constants. */
5529 char16_array_type_node
5532 /* Define 'char32_t'. */
5537 {
5542 }
5544 /* This is for UTF-32 string constants. */
5545 char32_array_type_node
5548 wint_type_node =
5551 intmax_type_node =
5553 uintmax_type_node =
5557 sig_atomic_type_node =
5560 int8_type_node =
5563 int16_type_node =
5566 int32_type_node =
5569 int64_type_node =
5572 uint8_type_node =
5575 c_uint16_type_node =
5578 c_uint32_type_node =
5581 c_uint64_type_node =
5584 int_least8_type_node =
5587 int_least16_type_node =
5590 int_least32_type_node =
5593 int_least64_type_node =
5596 uint_least8_type_node =
5599 uint_least16_type_node =
5602 uint_least32_type_node =
5605 uint_least64_type_node =
5608 int_fast8_type_node =
5611 int_fast16_type_node =
5614 int_fast32_type_node =
5617 int_fast64_type_node =
5620 uint_fast8_type_node =
5623 uint_fast16_type_node =
5626 uint_fast32_type_node =
5629 uint_fast64_type_node =
5632 intptr_type_node =
5635 uintptr_type_node =
5638 default_function_type
5640 ptrdiff_type_node
5647 va_list_type_node));
5649 {
5652 tree ptype;
5655 {
5659 ptype));
5661 }
5662 }
5665 {
5668 }
5669 else
5670 {
5673 }
5680 /* Create the built-in __null node. It is important that this is
5681 not shared. */
5685 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5687 }
5689 /* The number of named compound-literals generated thus far. */
5692 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5694 void
5696 {
5699 compound_literal_number);
5700 compound_literal_number++;
5702 }
5704 tree
5706 {
5710 }
5713 /* Linked list of disabled built-in functions. */
5716 {
5724 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5725 begins with "__builtin_", give an error. */
5727 void
5729 {
5732 else
5733 {
5738 }
5739 }
5742 /* Return true if the built-in function NAME has been disabled, false
5743 otherwise. */
5745 static bool
5747 {
5750 {
5753 }
5755 }
5758 /* Worker for DEF_BUILTIN.
5759 Possibly define a builtin function with one or two names.
5760 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5761 nonansi_p and flag_no_nonansi_builtin. */
5763 static void
5770 {
5771 tree decl;
5784 fnattrs);
5793 }
5794 \f
5795 /* Nonzero if the type T promotes to int. This is (nearly) the
5796 integral promotions defined in ISO C99 6.3.1.1/2. */
5798 bool
5800 {
5802 {
5812 /* ??? Technically all enumerations not larger than an int
5813 promote to an int. But this is used along code paths
5814 that only want to notice a size change. */
5822 }
5823 }
5825 /* Return 1 if PARMS specifies a fixed number of parameters
5826 and none of their types is affected by default promotions. */
5828 int
5830 {
5831 const_tree t;
5833 {
5850 }
5852 }
5854 /* Recursively remove any '*' or '&' operator from TYPE. */
5855 tree
5857 {
5861 }
5863 /* Recursively remove pointer or array type from TYPE. */
5864 tree
5866 {
5870 }
5872 /* Used to compare case labels. K1 and K2 are actually tree nodes
5873 representing case labels, or NULL_TREE for a `default' label.
5874 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5875 K2, and 0 if K1 and K2 are equal. */
5877 int
5879 {
5880 /* Consider a NULL key (such as arises with a `default' label) to be
5881 smaller than anything else. */
5888 }
5890 /* Process a case label, located at LOC, for the range LOW_VALUE
5891 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5892 then this case label is actually a `default' label. If only
5893 HIGH_VALUE is NULL_TREE, then case label was declared using the
5894 usual C/C++ syntax, rather than the GNU case range extension.
5895 CASES is a tree containing all the case ranges processed so far;
5896 COND is the condition for the switch-statement itself. Returns the
5897 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5898 is created. */
5900 tree
5903 {
5904 tree type;
5905 tree label;
5906 tree case_label;
5907 splay_tree_node node;
5909 /* Create the LABEL_DECL itself. */
5912 /* If there was an error processing the switch condition, bail now
5913 before we get more confused. */
5921 {
5924 }
5926 /* Case ranges are a GNU extension. */
5933 {
5938 }
5940 {
5945 }
5948 {
5949 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5950 really a case range, even though it was written that way.
5951 Remove the HIGH_VALUE to simplify later processing. */
5956 }
5958 /* See if the case is in range of the type of the original testing
5959 expression. If both low_value and high_value are out of range,
5960 don't insert the case label and return NULL_TREE. */
5966 /* Look up the LOW_VALUE in the table of case labels we already
5967 have. */
5969 /* If there was not an exact match, check for overlapping ranges.
5970 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5971 that's a `default' label and the only overlap is an exact match. */
5973 {
5974 splay_tree_node low_bound;
5975 splay_tree_node high_bound;
5977 /* Even though there wasn't an exact match, there might be an
5978 overlap between this case range and another case range.
5979 Since we've (inductively) not allowed any overlapping case
5980 ranges, we simply need to find the greatest low case label
5981 that is smaller that LOW_VALUE, and the smallest low case
5982 label that is greater than LOW_VALUE. If there is an overlap
5983 it will occur in one of these two ranges. */
5989 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5990 the LOW_VALUE, so there is no need to check unless the
5991 LOW_BOUND is in fact itself a case range. */
5997 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5998 range is bigger than the low end of the current range, so we
5999 are only interested if the current range is a real range, and
6000 not an ordinary case label. */
6002 && high_value
6004 high_value)
6007 }
6008 /* If there was an overlap, issue an error. */
6010 {
6014 {
6018 }
6020 {
6023 }
6024 else
6025 {
6029 }
6031 }
6033 /* Add a CASE_LABEL to the statement-tree. */
6035 /* Register this case label in the splay tree. */
6042 error_out:
6043 /* Add a label so that the back-end doesn't think that the beginning of
6044 the switch is unreachable. Note that we do not add a case label, as
6045 that just leads to duplicates and thence to failure later on. */
6047 {
6050 }
6052 }
6054 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6055 Used to verify that case values match up with enumerator values. */
6057 static void
6059 {
6062 /* ??? Not working too hard to print the double-word value.
6063 Should perhaps be done with %lwd in the diagnostic routines? */
6072 else
6081 buf);
6082 else
6087 }
6089 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6090 Used to verify that case values match up with enumerator values. */
6092 static int
6094 {
6098 /* Skip default case. */
6102 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6103 when we did our enum->case scan. Reset our scratch bit after. */
6106 else
6109 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6110 not set, that means that CASE_HIGH did not appear when we did our
6111 enum->case scan. Reset our scratch bit after. */
6113 {
6116 else
6118 }
6121 }
6123 /* Handle -Wswitch*. Called from the front end after parsing the
6124 switch construct. */
6125 /* ??? Should probably be somewhere generic, since other languages
6126 besides C and C++ would want this. At the moment, however, C/C++
6127 are the only tree-ssa languages that support enumerations at all,
6128 so the point is moot. */
6130 void
6133 {
6134 splay_tree_node default_node;
6135 splay_tree_node node;
6136 tree chain;
6146 /* From here on, we only care about about enumerated types. */
6150 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6154 /* Check the cases. Warn about case values which are not members of
6155 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6156 there is no default case, check that exactly all enumeration
6157 literals are covered by the cases. */
6159 /* Clearing COND if it is not an integer constant simplifies
6160 the tests inside the loop below. */
6164 /* The time complexity here is O(N*lg(N)) worst case, but for the
6165 common case of monotonically increasing enumerators, it is
6166 O(N), since the nature of the splay tree will keep the next
6167 element adjacent to the root at all times. */
6170 {
6176 {
6177 /* Mark the CASE_LOW part of the case entry as seen. */
6181 }
6183 /* Even though there wasn't an exact match, there might be a
6184 case range which includes the enumerator's value. */
6187 {
6191 {
6192 /* If we match the upper bound exactly, mark the CASE_HIGH
6193 part of the case entry as seen. */
6197 }
6198 }
6200 /* We've now determined that this enumerated literal isn't
6201 handled by the case labels of the switch statement. */
6203 /* If the switch expression is a constant, we only really care
6204 about whether that constant is handled by the switch. */
6208 /* If there is a default_node, the only relevant option is
6209 Wswitch-enum. Otherwise, if both are enabled then we prefer
6210 to warn using -Wswitch because -Wswitch is enabled by -Wall
6211 while -Wswitch-enum is explicit. */
6214 ? OPT_Wswitch_enum
6218 }
6220 /* Warn if there are case expressions that don't correspond to
6221 enumerators. This can occur since C and C++ don't enforce
6222 type-checking of assignments to enumeration variables.
6224 The time complexity here is now always O(N) worst case, since
6225 we should have marked both the lower bound and upper bound of
6226 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6227 above. This scan also resets those fields. */
6230 }
6232 /* Finish an expression taking the address of LABEL (an
6233 IDENTIFIER_NODE). Returns an expression for the address.
6235 LOC is the location for the expression returned. */
6237 tree
6239 {
6240 tree result;
6250 else
6251 {
6254 /* The current function is not necessarily uninlinable.
6255 Computed gotos are incompatible with inlining, but the value
6256 here could be used only in a diagnostic, for example. */
6258 }
6261 }
6262 \f
6264 /* Given a boolean expression ARG, return a tree representing an increment
6265 or decrement (as indicated by CODE) of ARG. The front end must check for
6266 invalid cases (e.g., decrement in C++). */
6267 tree
6269 {
6270 tree val;
6275 {
6298 }
6301 }
6302 \f
6303 /* Built-in macros for stddef.h and stdint.h, that require macros
6304 defined in this file. */
6305 void
6307 {
6370 }
6372 static void
6374 {
6375 /* Fill in the built_in_attributes array. */
6376 #define DEF_ATTR_NULL_TREE(ENUM) \
6377 built_in_attributes[(int) ENUM] = NULL_TREE;
6378 #define DEF_ATTR_INT(ENUM, VALUE) \
6379 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6380 #define DEF_ATTR_STRING(ENUM, VALUE) \
6381 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6382 #define DEF_ATTR_IDENT(ENUM, STRING) \
6383 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6384 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6385 built_in_attributes[(int) ENUM] \
6386 = tree_cons (built_in_attributes[(int) PURPOSE], \
6387 built_in_attributes[(int) VALUE], \
6388 built_in_attributes[(int) CHAIN]);
6390 #undef DEF_ATTR_NULL_TREE
6391 #undef DEF_ATTR_INT
6392 #undef DEF_ATTR_IDENT
6393 #undef DEF_ATTR_TREE_LIST
6394 }
6396 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6397 identifier as an argument, so the front end shouldn't look it up. */
6399 bool
6401 {
6404 /* Unknown attribute that we'll end up ignoring, return true so we
6405 don't complain about an identifier argument. */
6411 else
6413 }
6415 /* Attribute handlers common to C front ends. */
6417 /* Handle a "packed" attribute; arguments as in
6418 struct attribute_spec.handler. */
6420 static tree
6423 {
6425 {
6429 }
6431 {
6433 /* Still pack bitfields. */
6438 else
6440 }
6441 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6442 used for DECL_REGISTER. It wouldn't mean anything anyway.
6443 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6444 that changes what the typedef is typing. */
6445 else
6446 {
6449 }
6452 }
6454 /* Handle a "nocommon" attribute; arguments as in
6455 struct attribute_spec.handler. */
6457 static tree
6461 {
6464 else
6465 {
6468 }
6471 }
6473 /* Handle a "common" attribute; arguments as in
6474 struct attribute_spec.handler. */
6476 static tree
6479 {
6482 else
6483 {
6486 }
6489 }
6491 /* Handle a "noreturn" attribute; arguments as in
6492 struct attribute_spec.handler. */
6494 static tree
6497 {
6500 /* See FIXME comment in c_common_attribute_table. */
6507 = build_pointer_type
6510 else
6511 {
6514 }
6517 }
6519 /* Handle a "hot" and attribute; arguments as in
6520 struct attribute_spec.handler. */
6522 static tree
6525 {
6528 {
6530 {
6534 }
6535 /* Most of the rest of the hot processing is done later with
6536 lookup_attribute. */
6537 }
6538 else
6539 {
6542 }
6545 }
6547 /* Handle a "cold" and attribute; arguments as in
6548 struct attribute_spec.handler. */
6550 static tree
6553 {
6556 {
6558 {
6562 }
6563 /* Most of the rest of the cold processing is done later with
6564 lookup_attribute. */
6565 }
6566 else
6567 {
6570 }
6573 }
6575 /* Handle a "no_sanitize_address" attribute; arguments as in
6576 struct attribute_spec.handler. */
6578 static tree
6581 {
6583 {
6586 }
6589 }
6591 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6592 struct attribute_spec.handler. */
6594 static tree
6597 {
6606 }
6608 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6609 struct attribute_spec.handler. */
6611 static tree
6614 {
6616 {
6619 }
6622 }
6624 /* Handle a "noinline" attribute; arguments as in
6625 struct attribute_spec.handler. */
6627 static tree
6631 {
6634 else
6635 {
6638 }
6641 }
6643 /* Handle a "noclone" attribute; arguments as in
6644 struct attribute_spec.handler. */
6646 static tree
6650 {
6652 {
6655 }
6658 }
6660 /* Handle a "always_inline" attribute; arguments as in
6661 struct attribute_spec.handler. */
6663 static tree
6668 {
6670 {
6671 /* Set the attribute and mark it for disregarding inline
6672 limits. */
6674 }
6675 else
6676 {
6679 }
6682 }
6684 /* Handle a "gnu_inline" attribute; arguments as in
6685 struct attribute_spec.handler. */
6687 static tree
6692 {
6694 {
6695 /* Do nothing else, just set the attribute. We'll get at
6696 it later with lookup_attribute. */
6697 }
6698 else
6699 {
6702 }
6705 }
6707 /* Handle a "leaf" attribute; arguments as in
6708 struct attribute_spec.handler. */
6710 static tree
6714 {
6716 {
6719 }
6721 {
6724 }
6727 }
6729 /* Handle an "artificial" attribute; arguments as in
6730 struct attribute_spec.handler. */
6732 static tree
6737 {
6739 {
6740 /* Do nothing else, just set the attribute. We'll get at
6741 it later with lookup_attribute. */
6742 }
6743 else
6744 {
6747 }
6750 }
6752 /* Handle a "flatten" attribute; arguments as in
6753 struct attribute_spec.handler. */
6755 static tree
6757 tree args ATTRIBUTE_UNUSED,
6759 {
6761 /* Do nothing else, just set the attribute. We'll get at
6762 it later with lookup_attribute. */
6763 ;
6764 else
6765 {
6768 }
6771 }
6773 /* Handle a "warning" or "error" attribute; arguments as in
6774 struct attribute_spec.handler. */
6776 static tree
6779 {
6782 /* Do nothing else, just set the attribute. We'll get at
6783 it later with lookup_attribute. */
6784 ;
6785 else
6786 {
6789 }
6792 }
6794 /* Handle a "used" attribute; arguments as in
6795 struct attribute_spec.handler. */
6797 static tree
6800 {
6806 {
6811 }
6812 else
6813 {
6816 }
6819 }
6821 /* Handle a "unused" attribute; arguments as in
6822 struct attribute_spec.handler. */
6824 static tree
6827 {
6829 {
6837 {
6842 }
6843 else
6844 {
6847 }
6848 }
6849 else
6850 {
6854 }
6857 }
6859 /* Handle a "externally_visible" attribute; arguments as in
6860 struct attribute_spec.handler. */
6862 static tree
6867 {
6871 {
6874 {
6878 }
6879 }
6880 else
6881 {
6884 }
6887 }
6889 /* Handle a "const" attribute; arguments as in
6890 struct attribute_spec.handler. */
6892 static tree
6895 {
6898 /* See FIXME comment on noreturn in c_common_attribute_table. */
6904 = build_pointer_type
6907 else
6908 {
6911 }
6914 }
6916 /* Handle a "transparent_union" attribute; arguments as in
6917 struct attribute_spec.handler. */
6919 static tree
6923 {
6924 tree type;
6935 {
6936 /* Make sure that the first field will work for a transparent union.
6937 If the type isn't complete yet, leave the check to the code in
6938 finish_struct. */
6940 {
6946 }
6949 {
6950 /* If the type isn't complete yet, setting the flag
6951 on a variant wouldn't ever be checked. */
6955 /* build_duplicate_type doesn't work for C++. */
6959 /* A type variant isn't good enough, since we don't a cast
6960 to such a type removed as a no-op. */
6962 }
6966 }
6968 ignored:
6971 }
6973 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6974 get the requested priority for a constructor or destructor,
6975 possibly issuing diagnostics for invalid or reserved
6976 priorities. */
6978 static priority_type
6980 {
6981 HOST_WIDE_INT pri;
6982 tree arg;
6988 {
6991 else
6994 }
7007 {
7010 "destructor priorities from 0 to %d are reserved "
7012 MAX_RESERVED_INIT_PRIORITY);
7013 else
7015 "constructor priorities from 0 to %d are reserved "
7017 MAX_RESERVED_INIT_PRIORITY);
7018 }
7021 invalid:
7024 MAX_INIT_PRIORITY);
7025 else
7027 MAX_INIT_PRIORITY);
7029 }
7031 /* Handle a "constructor" attribute; arguments as in
7032 struct attribute_spec.handler. */
7034 static tree
7038 {
7045 {
7046 priority_type priority;
7051 }
7052 else
7053 {
7056 }
7059 }
7061 /* Handle a "destructor" attribute; arguments as in
7062 struct attribute_spec.handler. */
7064 static tree
7068 {
7075 {
7076 priority_type priority;
7081 }
7082 else
7083 {
7086 }
7089 }
7091 /* Nonzero if the mode is a valid vector mode for this architecture.
7092 This returns nonzero even if there is no hardware support for the
7093 vector mode, but we can emulate with narrower modes. */
7095 static int
7097 {
7101 /* Doh! What's going on? */
7110 /* Hardware support. Woo hoo! */
7116 /* We should probably return 1 if requesting V4DI and we have no DI,
7117 but we have V2DI, but this is probably very unlikely. */
7119 /* If we have support for the inner mode, we can safely emulate it.
7120 We may not have V2DI, but me can emulate with a pair of DIs. */
7122 }
7125 /* Handle a "mode" attribute; arguments as in
7126 struct attribute_spec.handler. */
7128 static tree
7131 {
7139 else
7140 {
7145 tree typefm;
7150 {
7156 }
7158 /* Change this type to have a type with the specified mode.
7159 First check for the special modes. */
7172 else
7175 {
7178 }
7181 {
7184 }
7188 {
7220 }
7222 {
7225 }
7228 {
7233 {
7236 }
7240 else
7243 }
7244 else
7245 {
7246 /* For fixed-point modes, we need to test if the signness of type
7247 and the machine mode are consistent. */
7250 {
7253 }
7254 /* For fixed-point modes, we need to pass saturating info. */
7258 }
7261 {
7264 }
7266 {
7267 /* For enumeral types, copy the precision from the integer
7268 type returned above. If not an INTEGER_TYPE, we can't use
7269 this mode for this type. */
7271 {
7274 }
7277 {
7280 }
7281 else
7282 {
7283 /* We cannot build a type variant, as there's code that assumes
7284 that TYPE_MAIN_VARIANT has the same mode. This includes the
7285 debug generators. Instead, create a subrange type. This
7286 results in all of the enumeral values being emitted only once
7287 in the original, and the subtype gets them by reference. */
7290 else
7293 }
7294 }
7298 {
7301 }
7304 }
7307 }
7309 /* Handle a "section" attribute; arguments as in
7310 struct attribute_spec.handler. */
7312 static tree
7315 {
7319 {
7325 {
7329 {
7331 "section attribute cannot be specified for "
7334 }
7336 /* The decl may have already been given a section attribute
7337 from a previous declaration. Ensure they match. */
7341 {
7345 }
7349 {
7352 }
7353 else
7355 }
7356 else
7357 {
7360 }
7361 }
7362 else
7363 {
7367 }
7370 }
7372 /* Check whether ALIGN is a valid user-specified alignment. If so,
7373 return its base-2 log; if not, output an error and return -1. If
7374 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7375 no error. */
7376 int
7378 {
7383 {
7386 }
7391 {
7394 }
7396 {
7399 }
7401 }
7403 /*
7404 If in c++-11, check if the c++-11 alignment constraint with respect
7405 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7406 c++-11 mode, does nothing.
7408 [dcl.align]2/ says:
7410 [* if the constant expression evaluates to a fundamental alignment,
7411 the alignment requirement of the declared entity shall be the
7412 specified fundamental alignment.
7414 * if the constant expression evaluates to an extended alignment
7415 and the implementation supports that alignment in the context
7416 of the declaration, the alignment of the declared entity shall
7417 be that alignment
7419 * if the constant expression evaluates to an extended alignment
7420 and the implementation does not support that alignment in the
7421 context of the declaration, the program is ill-formed]. */
7423 static bool
7427 {
7440 {
7442 {
7443 /* For file scope variables and static members, the target
7444 supports alignments that are at most
7445 MAX_OFILE_ALIGNMENT. */
7448 }
7449 else
7450 {
7451 #ifdef BIGGEST_FIELD_ALIGNMENT
7452 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7453 #else
7454 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7455 #endif
7456 /* For non-static members, the target supports either
7457 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7458 if it is defined or BIGGEST_ALIGNMENT. */
7463 #undef MAX_TARGET_FIELD_ALIGNMENT
7464 /* For stack variables, the target supports at most
7465 MAX_STACK_ALIGNMENT. */
7469 }
7470 }
7472 {
7473 /* Let's be liberal for types. */
7476 }
7484 }
7486 /* Handle a "aligned" attribute; arguments as in
7487 struct attribute_spec.handler. */
7489 static tree
7492 {
7501 {
7505 }
7513 {
7516 /* If we have a TYPE_DECL, then copy the type, so that we
7517 don't accidentally modify a builtin type. See pushdecl. */
7520 {
7527 }
7528 else
7533 }
7536 {
7539 }
7542 /* C++-11 [dcl.align/4]:
7544 When multiple alignment-specifiers are specified for an
7545 entity, the alignment requirement shall be set to the
7546 strictest specified alignment.
7548 This formally comes from the c++11 specification but we are
7549 doing it for the GNU attribute syntax as well. */
7553 {
7558 else
7562 }
7563 else
7564 {
7567 }
7570 }
7572 /* Handle a "weak" attribute; arguments as in
7573 struct attribute_spec.handler. */
7575 static tree
7580 {
7583 {
7586 }
7588 {
7592 }
7596 else
7600 }
7602 /* Handle an "alias" or "ifunc" attribute; arguments as in
7603 struct attribute_spec.handler, except that IS_ALIAS tells us
7604 whether this is an alias as opposed to ifunc attribute. */
7606 static tree
7609 {
7614 {
7617 }
7621 /* A static variable declaration is always a tentative definition,
7622 but the alias is a non-tentative definition which overrides. */
7625 {
7629 }
7633 {
7637 }
7639 /* Note that the very first time we process a nested declaration,
7640 decl_function_context will not be set. Indeed, *would* never
7641 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7642 we do below. After such frobbery, pushdecl would set the context.
7643 In any case, this is never what we want. */
7645 {
7646 tree id;
7650 {
7654 }
7656 /* This counts as a use of the object pointed to. */
7661 else
7665 /* ifuncs are also aliases, so set that attribute too. */
7668 }
7669 else
7670 {
7673 }
7676 }
7678 /* Handle an "alias" or "ifunc" attribute; arguments as in
7679 struct attribute_spec.handler. */
7681 static tree
7684 {
7686 }
7688 /* Handle an "alias" or "ifunc" attribute; arguments as in
7689 struct attribute_spec.handler. */
7691 static tree
7694 {
7696 }
7698 /* Handle a "weakref" attribute; arguments as in struct
7699 attribute_spec.handler. */
7701 static tree
7704 {
7707 /* We must ignore the attribute when it is associated with
7708 local-scoped decls, since attribute alias is ignored and many
7709 such symbols do not even have a DECL_WEAK field. */
7711 || current_function_decl
7713 {
7717 }
7720 {
7724 }
7726 /* The idea here is that `weakref("name")' mutates into `weakref,
7727 alias("name")', and weakref without arguments, in turn,
7728 implicitly adds weak. */
7731 {
7738 }
7739 else
7740 {
7745 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7746 and that isn't supported; and because it wants to add it to
7747 the list of weak decls, which isn't helpful. */
7749 }
7752 }
7754 /* Handle an "visibility" attribute; arguments as in
7755 struct attribute_spec.handler. */
7757 static tree
7761 {
7767 {
7771 {
7773 name);
7775 }
7777 {
7781 }
7782 }
7784 {
7787 }
7790 {
7793 }
7795 /* If this is a type, set the visibility on the type decl. */
7797 {
7802 {
7804 name);
7806 }
7807 }
7817 else
7818 {
7819 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7821 }
7825 {
7839 }
7844 /* Go ahead and attach the attribute to the node as well. This is needed
7845 so we can determine whether we have VISIBILITY_DEFAULT because the
7846 visibility was not specified, or because it was explicitly overridden
7847 from the containing scope. */
7850 }
7852 /* Determine the ELF symbol visibility for DECL, which is either a
7853 variable or a function. It is an error to use this function if a
7854 definition of DECL is not available in this translation unit.
7855 Returns true if the final visibility has been determined by this
7856 function; false if the caller is free to make additional
7857 modifications. */
7859 bool
7861 {
7865 /* If the user explicitly specified the visibility with an
7866 attribute, honor that. DECL_VISIBILITY will have been set during
7867 the processing of the attribute. We check for an explicit
7868 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7869 to distinguish the use of an attribute from the use of a "#pragma
7870 GCC visibility push(...)"; in the latter case we still want other
7871 considerations to be able to overrule the #pragma. */
7873 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7878 /* Set default visibility to whatever the user supplied with
7879 visibility_specified depending on #pragma GCC visibility. */
7881 {
7884 {
7887 /* If visibility changed and DECL already has DECL_RTL, ensure
7888 symbol flags are updated. */
7893 }
7894 }
7896 }
7898 /* Handle an "tls_model" attribute; arguments as in
7899 struct attribute_spec.handler. */
7901 static tree
7904 {
7905 tree id;
7912 {
7915 }
7920 {
7923 }
7933 else
7934 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7938 }
7940 /* Handle a "no_instrument_function" attribute; arguments as in
7941 struct attribute_spec.handler. */
7943 static tree
7948 {
7952 {
7956 }
7958 {
7962 }
7963 else
7967 }
7969 /* Handle a "malloc" attribute; arguments as in
7970 struct attribute_spec.handler. */
7972 static tree
7975 {
7979 else
7980 {
7983 }
7986 }
7988 /* Handle a "alloc_size" attribute; arguments as in
7989 struct attribute_spec.handler. */
7991 static tree
7994 {
7997 {
8004 {
8009 }
8010 }
8012 }
8014 /* Handle a "fn spec" attribute; arguments as in
8015 struct attribute_spec.handler. */
8017 static tree
8021 {
8026 }
8028 /* Handle a "bnd_variable_size" attribute; arguments as in
8029 struct attribute_spec.handler. */
8031 static tree
8034 {
8036 {
8039 }
8042 }
8044 /* Handle a "bnd_legacy" attribute; arguments as in
8045 struct attribute_spec.handler. */
8047 static tree
8050 {
8052 {
8055 }
8058 }
8060 /* Handle a "warn_unused" attribute; arguments as in
8061 struct attribute_spec.handler. */
8063 static tree
8065 tree args ATTRIBUTE_UNUSED,
8067 {
8069 /* Do nothing else, just set the attribute. We'll get at
8070 it later with lookup_attribute. */
8071 ;
8072 else
8073 {
8076 }
8079 }
8081 /* Handle an "omp declare simd" attribute; arguments as in
8082 struct attribute_spec.handler. */
8084 static tree
8086 {
8088 }
8090 /* Handle an "omp declare target" attribute; arguments as in
8091 struct attribute_spec.handler. */
8093 static tree
8095 {
8097 }
8099 /* Handle a "returns_twice" attribute; arguments as in
8100 struct attribute_spec.handler. */
8102 static tree
8105 {
8108 else
8109 {
8112 }
8115 }
8117 /* Handle a "no_limit_stack" attribute; arguments as in
8118 struct attribute_spec.handler. */
8120 static tree
8125 {
8129 {
8133 }
8135 {
8139 }
8140 else
8144 }
8146 /* Handle a "pure" attribute; arguments as in
8147 struct attribute_spec.handler. */
8149 static tree
8152 {
8155 /* ??? TODO: Support types. */
8156 else
8157 {
8160 }
8163 }
8165 /* Digest an attribute list destined for a transactional memory statement.
8166 ALLOWED is the set of attributes that are allowed for this statement;
8167 return the attribute we parsed. Multiple attributes are never allowed. */
8169 int
8171 {
8176 {
8184 {
8187 }
8190 {
8193 }
8196 else
8198 }
8201 }
8203 /* Transform a TM attribute name into a maskable integer and back.
8204 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8205 to how the lack of an attribute is treated. */
8207 int
8209 {
8223 }
8225 tree
8227 {
8230 {
8248 }
8250 }
8252 /* Return the first TM attribute seen in LIST. */
8254 tree
8256 {
8258 {
8262 }
8264 }
8266 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8267 Here we accept only function types, and verify that none of the other
8268 function TM attributes are also applied. */
8269 /* ??? We need to accept class types for C++, but not C. This greatly
8270 complicates this function, since we can no longer rely on the extra
8271 processing given by function_type_required. */
8273 static tree
8276 {
8277 /* Only one path adds the attribute; others don't. */
8281 {
8284 /* Only tm_callable and tm_safe apply to classes. */
8287 /* FALLTHRU */
8291 {
8294 ;
8297 else
8299 }
8303 {
8306 {
8311 }
8312 }
8313 /* FALLTHRU */
8316 /* If a function is next, pass it on to be tried next. */
8320 ignored:
8323 }
8326 }
8328 /* Handle the TM_WRAP attribute; arguments as in
8329 struct attribute_spec.handler. */
8331 static tree
8334 {
8337 /* We don't need the attribute even on success, since we
8338 record the entry in an external table. */
8343 else
8344 {
8350 else
8351 {
8355 {
8359 else
8361 }
8362 else
8364 }
8365 }
8368 }
8370 /* Ignore the given attribute. Used when this attribute may be usefully
8371 overridden by the target, but is not used generically. */
8373 static tree
8377 {
8380 }
8382 /* Handle a "no vops" attribute; arguments as in
8383 struct attribute_spec.handler. */
8385 static tree
8389 {
8393 }
8395 /* Handle a "deprecated" attribute; arguments as in
8396 struct attribute_spec.handler. */
8398 static tree
8402 {
8410 {
8413 }
8416 {
8427 else
8429 }
8431 {
8436 }
8437 else
8441 {
8444 {
8450 }
8453 else
8455 }
8458 }
8460 /* Handle a "vector_size" attribute; arguments as in
8461 struct attribute_spec.handler. */
8463 static tree
8467 {
8477 {
8480 }
8482 /* Get the vector size (in bytes). */
8485 /* We need to provide for vector pointers, vector arrays, and
8486 functions returning vectors. For example:
8488 __attribute__((vector_size(16))) short *foo;
8490 In this case, the mode is SI, but the type being modified is
8491 HI, so we need to look further. */
8500 /* Get the mode of the type being modified. */
8511 {
8514 }
8517 {
8520 }
8523 {
8526 }
8528 /* Calculate how many units fit in the vector. */
8531 {
8534 }
8538 /* Build back pointers if needed. */
8542 }
8544 /* Handle the "nonnull" attribute. */
8545 static tree
8549 {
8553 /* If no arguments are specified, all pointer arguments should be
8554 non-null. Verify a full prototype is given so that the arguments
8555 will have the correct types when we actually check them later. */
8557 {
8559 {
8562 }
8564 }
8566 /* Argument list specified. Verify that each argument number references
8567 a pointer argument. */
8569 {
8573 {
8578 }
8581 {
8582 function_args_iterator iter;
8583 tree argument;
8587 {
8591 }
8595 {
8600 }
8603 {
8608 }
8609 }
8610 }
8613 }
8615 /* Check the argument list of a function call for null in argument slots
8616 that are marked as requiring a non-null pointer argument. The NARGS
8617 arguments are passed in the array ARGARRAY.
8618 */
8620 static void
8622 {
8623 tree a;
8631 /* See if any of the nonnull attributes has no arguments. If so,
8632 then every pointer argument is checked (in which case the check
8633 for pointer type is done in check_nonnull_arg). */
8635 do
8643 else
8644 {
8645 /* Walk the argument list. If we encounter an argument number we
8646 should check for non-null, do it. */
8648 {
8650 {
8654 }
8659 }
8660 }
8661 }
8663 /* Check that the Nth argument of a function call (counting backwards
8664 from the end) is a (pointer)0. The NARGS arguments are passed in the
8665 array ARGARRAY. */
8667 static void
8669 {
8673 {
8676 tree sentinel;
8677 function_args_iterator iter;
8678 tree t;
8680 /* Skip over the named arguments. */
8682 {
8685 len++;
8686 }
8689 {
8692 }
8694 /* The sentinel must be one of the varargs, i.e.
8695 in position >= the number of fixed arguments. */
8697 {
8701 }
8703 /* Validate the sentinel. */
8707 /* Although __null (in C++) is only an integer we allow it
8708 nevertheless, as we are guaranteed that it's exactly
8709 as wide as a pointer, and we don't want to force
8710 users to cast the NULL they have written there.
8711 We warn with -Wstrict-null-sentinel, though. */
8714 }
8715 }
8717 /* Helper for check_function_nonnull; given a list of operands which
8718 must be non-null in ARGS, determine if operand PARAM_NUM should be
8719 checked. */
8721 static bool
8723 {
8727 {
8734 }
8736 }
8738 /* Check that the function argument PARAM (which is operand number
8739 PARAM_NUM) is non-null. This is called by check_function_nonnull
8740 via check_function_arguments_recurse. */
8742 static void
8745 {
8746 /* Just skip checking the argument if it's not a pointer. This can
8747 happen if the "nonnull" attribute was given without an operand
8748 list (which means to check every pointer argument). */
8756 }
8758 /* Helper for nonnull attribute handling; fetch the operand number
8759 from the attribute argument list. */
8761 static bool
8763 {
8764 /* Verify the arg number is a constant. */
8771 }
8773 /* Handle a "nothrow" attribute; arguments as in
8774 struct attribute_spec.handler. */
8776 static tree
8779 {
8782 /* ??? TODO: Support types. */
8783 else
8784 {
8787 }
8790 }
8792 /* Handle a "cleanup" attribute; arguments as in
8793 struct attribute_spec.handler. */
8795 static tree
8798 {
8802 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8803 for global destructors in C++. This requires infrastructure that
8804 we don't have generically at the moment. It's also not a feature
8805 we'd be missing too much, since we do have attribute constructor. */
8807 {
8811 }
8813 /* Verify that the argument is a function in scope. */
8814 /* ??? We could support pointers to functions here as well, if
8815 that was considered desirable. */
8818 {
8822 }
8825 {
8829 }
8831 /* That the function has proper type is checked with the
8832 eventual call to build_function_call. */
8835 }
8837 /* Handle a "warn_unused_result" attribute. No special handling. */
8839 static tree
8843 {
8844 /* Ignore the attribute for functions not returning any value. */
8846 {
8849 }
8852 }
8854 /* Handle a "sentinel" attribute. */
8856 static tree
8859 {
8861 {
8865 }
8866 else
8867 {
8869 {
8873 }
8874 }
8877 {
8881 {
8885 }
8886 else
8887 {
8889 {
8893 }
8894 }
8895 }
8898 }
8900 /* Handle a "type_generic" attribute. */
8902 static tree
8906 {
8907 /* Ensure we have a function type. */
8910 /* Ensure we have a variadic function. */
8914 }
8916 /* Handle a "target" attribute. */
8918 static tree
8921 {
8922 /* Ensure we have a function type. */
8924 {
8927 }
8929 flags))
8933 }
8935 /* Arguments being collected for optimization. */
8940 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8941 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8942 false for #pragma GCC optimize. */
8944 bool
8946 {
8954 tree ap;
8956 /* Build up argv vector. Just in case the string is stored away, use garbage
8957 collected strings. */
8962 {
8966 {
8970 }
8973 {
8974 /* Split string into multiple substrings. */
8982 {
8989 {
8993 }
8994 else
8995 {
8998 }
9002 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9003 options. */
9005 {
9010 else
9014 }
9017 {
9020 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9021 itself is -Os, and any other switch begins with a -f. */
9027 }
9032 }
9034 }
9035 }
9045 /* Now parse the options. */
9055 /* Don't allow changing -fstrict-aliasing. */
9060 }
9062 /* For handling "optimize" attribute. arguments as in
9063 struct attribute_spec.handler. */
9065 static tree
9068 {
9069 /* Ensure we have a function type. */
9071 {
9074 }
9075 else
9076 {
9080 /* Save current options. */
9083 /* If we previously had some optimization options, use them as the
9084 default. */
9089 /* Parse options, and update the vector. */
9094 /* Restore current options. */
9096 }
9099 }
9101 /* Handle a "no_split_stack" attribute. */
9103 static tree
9108 {
9112 {
9116 }
9118 {
9122 }
9125 }
9127 /* Handle a "returns_nonnull" attribute; arguments as in
9128 struct attribute_spec.handler. */
9130 static tree
9133 {
9134 // Even without a prototype we still have a return type we can check.
9136 {
9139 }
9141 }
9143 \f
9144 /* Check for valid arguments being passed to a function with FNTYPE.
9145 There are NARGS arguments in the array ARGARRAY. */
9146 void
9148 {
9149 /* Check for null being passed in a pointer argument that must be
9150 non-null. We also need to do this if format checking is enabled. */
9155 /* Check for errors in format strings. */
9162 }
9164 /* Generic argument checking recursion routine. PARAM is the argument to
9165 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9166 once the argument is resolved. CTX is context for the callback. */
9167 void
9172 {
9176 {
9177 /* Strip coercion. */
9181 }
9184 {
9186 tree attrs;
9189 /* See if this is a call to a known internationalization function
9190 that modifies a format arg. Such a function may have multiple
9191 format_arg attributes (for example, ngettext). */
9194 attrs;
9197 {
9198 tree inner_arg;
9199 tree format_num_expr;
9202 call_expr_arg_iterator iter;
9204 /* Extract the argument number, which was previously checked
9205 to be valid. */
9217 {
9222 }
9223 }
9225 /* If we found a format_arg attribute and did a recursive check,
9226 we are done with checking this argument. Otherwise, we continue
9227 and this will be considered a non-literal. */
9230 }
9233 {
9234 /* Check both halves of the conditional expression. */
9240 }
9243 }
9245 /* Checks for a builtin function FNDECL that the number of arguments
9246 NARGS against the required number REQUIRED and issues an error if
9247 there is a mismatch. Returns true if the number of arguments is
9248 correct, otherwise false. */
9250 static bool
9252 {
9254 {
9258 }
9260 {
9264 }
9266 }
9268 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9269 Returns false if there was an error, otherwise true. */
9271 bool
9273 {
9279 {
9289 {
9291 {
9295 }
9297 }
9307 {
9314 {
9318 }
9320 }
9325 {
9330 {
9334 }
9337 {
9339 fndecl);
9341 }
9343 }
9348 {
9350 {
9353 }
9355 }
9360 }
9361 }
9363 /* Function to help qsort sort FIELD_DECLs by name order. */
9365 int
9367 {
9372 /* A nontype is "greater" than a type. */
9381 }
9384 gt_pointer_operator new_value;
9388 /* This routine compares two fields like field_decl_cmp but using the
9389 pointer operator in resort_data. */
9391 static int
9393 {
9398 /* A nontype is "greater" than a type. */
9404 {
9411 }
9413 }
9415 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9417 void
9420 gt_pointer_operator new_value,
9422 {
9427 resort_field_decl_cmp);
9428 }
9430 /* Subroutine of c_parse_error.
9431 Return the result of concatenating LHS and RHS. RHS is really
9432 a string literal, its first character is indicated by RHS_START and
9433 RHS_SIZE is its length (including the terminating NUL character).
9435 The caller is responsible for deleting the returned pointer. */
9439 {
9445 }
9447 /* Issue the error given by GMSGID, indicating that it occurred before
9448 TOKEN, which had the associated VALUE. */
9450 void
9453 {
9454 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9464 {
9469 {
9482 }
9486 else
9492 }
9514 {
9519 }
9527 {
9532 }
9533 else
9537 {
9540 }
9541 #undef catenate_messages
9542 }
9544 /* Mapping for cpp message reasons to the options that enable them. */
9546 struct reason_option_codes_t
9547 {
9550 };
9571 };
9573 /* Return the gcc option code associated with the reason for a cpp
9574 message, or 0 if none. */
9576 static int
9578 {
9582 {
9585 }
9587 }
9589 /* Callback from cpp_error for PFILE to print diagnostics from the
9590 preprocessor. The diagnostic is of type LEVEL, with REASON set
9591 to the reason code if LEVEL is represents a warning, at location
9592 LOCATION unless this is after lexing and the compiler's location
9593 should be used instead, with column number possibly overridden by
9594 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9595 the arguments. Returns true if a diagnostic was emitted, false
9596 otherwise. */
9598 bool
9602 {
9603 diagnostic_info diagnostic;
9604 diagnostic_t dlevel;
9609 {
9614 /* Fall through. */
9639 }
9652 }
9654 /* Convert a character from the host to the target execution character
9655 set. cpplib handles this, mostly. */
9657 HOST_WIDE_INT
9659 {
9660 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9661 zero-extended under -fno-signed-char. cpplib insists that characters
9662 and character constants are always unsigned. Hence we must convert
9663 back and forth. */
9671 else
9673 }
9675 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9676 references with an INDIRECT_REF of a constant at the bottom; much like the
9677 traditional rendering of offsetof as a macro. Return the folded result. */
9679 tree
9681 {
9685 {
9701 {
9704 }
9714 {
9718 }
9732 /* Check if the offset goes beyond the upper bound of the array. */
9734 {
9740 {
9744 {
9745 tree v;
9752 {
9760 }
9761 /* Don't warn if the array might be considered a poor
9762 man's flexible array member with a very permissive
9763 definition thereof. */
9767 "index %E denotes an offset "
9770 }
9771 }
9772 }
9779 /* Handle static members of volatile structs. */
9786 }
9789 }
9791 /* Likewise, but convert it to the return type of offsetof. */
9793 tree
9795 {
9797 }
9799 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9800 expression, because B will always be true. */
9802 void
9804 {
9807 "the omitted middle operand in ?: will always be %<true%>, "
9809 }
9811 /* Give an error for storing into ARG, which is 'const'. USE indicates
9812 how ARG was being used. */
9814 void
9816 {
9819 /* Using this macro rather than (for example) arrays of messages
9820 ensures that all the format strings are checked at compile
9821 time. */
9822 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9823 : (use == lv_increment ? (I) \
9824 : (use == lv_decrement ? (D) : (AS))))
9826 {
9837 else
9843 }
9849 arg);
9855 arg);
9857 {
9867 arg);
9868 }
9874 arg);
9875 else
9880 arg);
9881 }
9883 /* Print an error message for an invalid lvalue. USE says
9884 how the lvalue is being used and so selects the error message. LOC
9885 is the location for the error. */
9887 void
9889 {
9891 {
9909 }
9910 }
9912 /* Print an error message for an invalid indirection of type TYPE.
9913 ERRSTRING is the name of the operator for the indirection. */
9915 void
9917 {
9919 {
9927 type);
9932 type);
9937 type);
9942 type);
9947 type);
9951 }
9952 }
9953 \f
9954 /* *PTYPE is an incomplete array. Complete it with a domain based on
9955 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9956 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9957 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9959 int
9961 {
9969 {
9971 {
9972 int eltsize
9975 }
9977 {
9981 {
9985 }
9986 else
9987 {
9988 tree curindex;
9999 {
10003 else
10004 {
10006 {
10007 /* Since we treat size types now as ordinary
10008 unsigned types, we need an explicit overflow
10009 check. */
10013 }
10015 size_one_node);
10016 }
10019 }
10021 {
10025 }
10026 }
10027 }
10028 else
10029 {
10030 /* Make an error message unless that happened already. */
10033 }
10034 }
10035 else
10036 {
10040 }
10047 else
10050 /* Using build_distinct_type_copy and modifying things afterward instead
10051 of using build_array_type to create a new type preserves all of the
10052 TYPE_LANG_FLAG_? bits that the front end may have set. */
10060 /* Make sure we have the canonical MAIN_TYPE. */
10063 hashcode);
10066 /* Fix the canonical type. */
10076 else
10081 else
10087 {
10089 /* If we proceed with the array type as it is, we'll eventually
10090 crash in tree_low_cst(). */
10092 }
10096 }
10098 /* Like c_mark_addressable but don't check register qualifier. */
10099 void
10101 {
10107 }
10110 \f
10111 /* Used to help initialize the builtin-types.def table. When a type of
10112 the correct size doesn't exist, use error_mark_node instead of NULL.
10113 The later results in segfaults even when a decl using the type doesn't
10114 get invoked. */
10116 tree
10118 {
10121 }
10123 /* A helper function for resolve_overloaded_builtin in resolving the
10124 overloaded __sync_ builtins. Returns a positive power of 2 if the
10125 first operand of PARAMS is a pointer to a supported data type.
10126 Returns 0 if an error is encountered. */
10128 static int
10130 {
10131 tree type;
10135 {
10138 }
10152 incompatible:
10155 }
10157 /* A helper function for resolve_overloaded_builtin. Adds casts to
10158 PARAMS to make arguments match up with those of FUNCTION. Drops
10159 the variadic arguments at the end. Returns false if some error
10160 was encountered; true on success. */
10162 static bool
10165 {
10166 function_args_iterator iter;
10167 tree ptype;
10171 /* We've declared the implementation functions to use "volatile void *"
10172 as the pointer parameter, so we shouldn't get any complaints from the
10173 call to check_function_arguments what ever type the user used. */
10178 /* For the rest of the values, we need to cast these to FTYPE, so that we
10179 don't get warnings for passing pointer types, etc. */
10182 {
10186 /* XXX void_type_node belies the abstraction. */
10192 {
10195 }
10197 /* Only convert parameters if arg_type is unsigned integer type with
10198 new format sync routines, i.e. don't attempt to convert pointer
10199 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10200 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10201 kinds). */
10203 {
10204 /* Ideally for the first conversion we'd use convert_for_assignment
10205 so that we get warnings for anything that doesn't match the pointer
10206 type. This isn't portable across the C and C++ front ends atm. */
10211 }
10214 }
10216 /* __atomic routines are not variadic. */
10218 {
10221 }
10223 /* The definition of these primitives is variadic, with the remaining
10224 being "an optional list of variables protected by the memory barrier".
10225 No clue what that's supposed to mean, precisely, but we consider all
10226 call-clobbered variables to be protected so we're safe. */
10230 }
10232 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10233 RESULT to make it match the type of the first pointer argument in
10234 PARAMS. */
10236 static tree
10238 {
10243 /* New format doesn't require casting unless the types are the same size. */
10246 else
10248 }
10250 /* This function verifies the PARAMS to generic atomic FUNCTION.
10251 It returns the size if all the parameters are the same size, otherwise
10252 0 is returned if the parameters are invalid. */
10254 static int
10257 {
10262 tree type_0;
10264 /* Determine the parameter makeup. */
10266 {
10282 }
10285 {
10288 }
10290 /* Get type of first parameter, and determine its size. */
10293 {
10295 function);
10297 }
10299 /* Types must be compile time constant sizes. */
10301 {
10304 function);
10306 }
10310 /* Zero size objects are not allowed. */
10312 {
10315 function);
10317 }
10319 /* Check each other parameter is a pointer and the same size. */
10321 {
10324 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10328 {
10330 function);
10332 }
10335 {
10337 function);
10339 }
10340 }
10342 /* Check memory model parameters for validity. */
10344 {
10347 {
10350 {
10353 function);
10354 }
10355 }
10356 else
10358 {
10360 function);
10362 }
10363 }
10366 }
10369 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10370 at the beginning of the parameter list PARAMS representing the size of the
10371 objects. This is to match the library ABI requirement. LOC is the location
10372 of the function call.
10373 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10374 returned to allow the external call to be constructed. */
10376 static tree
10379 {
10380 tree size_node;
10382 /* Insert a SIZE_T parameter as the first param. If there isn't
10383 enough space, allocate a new vector and recursively re-build with that. */
10385 {
10388 tree f;
10397 }
10399 /* Add the size parameter and leave as a function call for processing. */
10403 }
10406 /* Return whether atomic operations for naturally aligned N-byte
10407 arguments are supported, whether inline or through libatomic. */
10408 static bool
10410 {
10412 {
10424 }
10425 }
10427 /* This will process an __atomic_exchange function call, determine whether it
10428 needs to be mapped to the _N variation, or turned into a library call.
10429 LOC is the location of the builtin call.
10430 FUNCTION is the DECL that has been invoked;
10431 PARAMS is the argument list for the call. The return value is non-null
10432 TRUE is returned if it is translated into the proper format for a call to the
10433 external library, and NEW_RETURN is set the tree for that function.
10434 FALSE is returned if processing for the _N variation is required, and
10435 NEW_RETURN is set to the the return value the result is copied into. */
10436 static bool
10439 {
10444 /* Size of 0 is an error condition. */
10446 {
10449 }
10451 /* If not a lock-free size, change to the library generic format. */
10453 {
10456 }
10458 /* Otherwise there is a lockfree match, transform the call from:
10459 void fn(T* mem, T* desired, T* return, model)
10460 into
10461 *return = (T) (fn (In* mem, (In) *desired, model)) */
10468 /* Create pointer to appropriate size. */
10472 /* Convert object pointer to required type. */
10475 /* Convert new value to required type, and dereference it. */
10480 /* Move memory model to the 3rd position, and end param list. */
10484 /* Convert return pointer and dereference it for later assignment. */
10488 }
10491 /* This will process an __atomic_compare_exchange function call, determine
10492 whether it needs to be mapped to the _N variation, or turned into a lib call.
10493 LOC is the location of the builtin call.
10494 FUNCTION is the DECL that has been invoked;
10495 PARAMS is the argument list for the call. The return value is non-null
10496 TRUE is returned if it is translated into the proper format for a call to the
10497 external library, and NEW_RETURN is set the tree for that function.
10498 FALSE is returned if processing for the _N variation is required. */
10500 static bool
10504 {
10509 /* Size of 0 is an error condition. */
10511 {
10514 }
10516 /* If not a lock-free size, change to the library generic format. */
10518 {
10519 /* The library generic format does not have the weak parameter, so
10520 remove it from the param list. Since a parameter has been removed,
10521 we can be sure that there is room for the SIZE_T parameter, meaning
10522 there will not be a recursive rebuilding of the parameter list, so
10523 there is no danger this will be done twice. */
10525 {
10529 }
10532 }
10534 /* Otherwise, there is a match, so the call needs to be transformed from:
10535 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10536 into
10537 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10543 /* Create pointer to appropriate size. */
10547 /* Convert object pointer to required type. */
10551 /* Convert expected pointer to required type. */
10555 /* Convert desired value to required type, and dereference it. */
10560 /* The rest of the parameters are fine. NULL means no special return value
10561 processing.*/
10564 }
10567 /* This will process an __atomic_load function call, determine whether it
10568 needs to be mapped to the _N variation, or turned into a library call.
10569 LOC is the location of the builtin call.
10570 FUNCTION is the DECL that has been invoked;
10571 PARAMS is the argument list for the call. The return value is non-null
10572 TRUE is returned if it is translated into the proper format for a call to the
10573 external library, and NEW_RETURN is set the tree for that function.
10574 FALSE is returned if processing for the _N variation is required, and
10575 NEW_RETURN is set to the the return value the result is copied into. */
10577 static bool
10580 {
10585 /* Size of 0 is an error condition. */
10587 {
10590 }
10592 /* If not a lock-free size, change to the library generic format. */
10594 {
10597 }
10599 /* Otherwise, there is a match, so the call needs to be transformed from:
10600 void fn(T* mem, T* return, model)
10601 into
10602 *return = (T) (fn ((In *) mem, model)) */
10608 /* Create pointer to appropriate size. */
10612 /* Convert object pointer to required type. */
10616 /* Move memory model to the 2nd position, and end param list. */
10620 /* Convert return pointer and dereference it for later assignment. */
10624 }
10627 /* This will process an __atomic_store function call, determine whether it
10628 needs to be mapped to the _N variation, or turned into a library call.
10629 LOC is the location of the builtin call.
10630 FUNCTION is the DECL that has been invoked;
10631 PARAMS is the argument list for the call. The return value is non-null
10632 TRUE is returned if it is translated into the proper format for a call to the
10633 external library, and NEW_RETURN is set the tree for that function.
10634 FALSE is returned if processing for the _N variation is required, and
10635 NEW_RETURN is set to the the return value the result is copied into. */
10637 static bool
10640 {
10645 /* Size of 0 is an error condition. */
10647 {
10650 }
10652 /* If not a lock-free size, change to the library generic format. */
10654 {
10657 }
10659 /* Otherwise, there is a match, so the call needs to be transformed from:
10660 void fn(T* mem, T* value, model)
10661 into
10662 fn ((In *) mem, (In) *value, model) */
10667 /* Create pointer to appropriate size. */
10671 /* Convert object pointer to required type. */
10675 /* Convert new value to required type, and dereference it. */
10680 /* The memory model is in the right spot already. Return is void. */
10684 }
10687 /* Some builtin functions are placeholders for other expressions. This
10688 function should be called immediately after parsing the call expression
10689 before surrounding code has committed to the type of the expression.
10691 LOC is the location of the builtin call.
10693 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10694 PARAMS is the argument list for the call. The return value is non-null
10695 when expansion is complete, and null if normal processing should
10696 continue. */
10698 tree
10701 {
10707 {
10713 else
10717 }
10719 /* Handle BUILT_IN_NORMAL here. */
10721 {
10726 {
10727 /* Handle these 4 together so that they can fall through to the next
10728 case if the call is transformed to an _N variant. */
10730 {
10732 {
10736 /* Change to the _N variant. */
10739 }
10742 {
10744 params,
10747 /* Change to the _N variant. */
10750 }
10752 {
10756 /* Change to the _N variant. */
10759 }
10761 {
10765 /* Change to the _N variant. */
10768 }
10771 }
10772 /* Fallthrough to the normal processing. */
10773 }
10790 {
10792 /* Fallthru for parameter processing. */
10793 }
10810 {
10821 orig_format))
10833 /* If new_return is set, assign function to that expr and cast the
10834 result to void since the generic interface returned void. */
10836 {
10837 /* Cast function result from I{1,2,4,8,16} to the required type. */
10840 result);
10844 }
10846 }
10850 }
10851 }
10853 /* vector_types_compatible_elements_p is used in type checks of vectors
10854 values used as operands of binary operators. Where it returns true, and
10855 the other checks of the caller succeed (being vector types in he first
10856 place, and matching number of elements), we can just treat the types
10857 as essentially the same.
10858 Contrast with vector_targets_convertible_p, which is used for vector
10859 pointer types, and vector_types_convertible_p, which will allow
10860 language-specific matches under the control of flag_lax_vector_conversions,
10861 and might still require a conversion. */
10862 /* True if vector types T1 and T2 can be inputs to the same binary
10863 operator without conversion.
10864 We don't check the overall vector size here because some of our callers
10865 want to give different error messages when the vectors are compatible
10866 except for the element count. */
10868 bool
10870 {
10883 /* Equality works here because c_common_signed_type uses
10884 TYPE_MAIN_VARIANT. */
10892 }
10894 /* Check for missing format attributes on function pointers. LTYPE is
10895 the new type or left-hand side type. RTYPE is the old type or
10896 right-hand side type. Returns TRUE if LTYPE is missing the desired
10897 attribute. */
10899 bool
10901 {
10903 tree ra;
10909 {
10910 tree la;
10915 }
10916 else
10918 }
10920 /* Subscripting with type char is likely to lose on a machine where
10921 chars are signed. So warn on any machine, but optionally. Don't
10922 warn for unsigned char since that type is safe. Don't warn for
10923 signed char because anyone who uses that must have done so
10924 deliberately. Furthermore, we reduce the false positive load by
10925 warning only for non-constant value of type char. */
10927 void
10929 {
10933 }
10935 /* Implement -Wparentheses for the unexpected C precedence rules, to
10936 cover cases like x + y << z which readers are likely to
10937 misinterpret. We have seen an expression in which CODE is a binary
10938 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10939 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10940 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10941 expression was not formed using a binary or unary operator, or it
10942 was enclosed in parentheses. */
10944 void
10948 {
10952 /* This macro tests that the expression ARG with original tree code
10953 CODE appears to be a boolean expression. or the result of folding a
10954 boolean expression. */
10955 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10956 (truth_value_p (TREE_CODE (ARG)) \
10957 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10959 || ((CODE) != INTEGER_CST \
10960 && (integer_onep (ARG) || integer_zerop (ARG))))
10963 {
11012 /* Check cases like x|y==z */
11019 /* Check cases like !x | y */
11023 "suggest parentheses around operand of "
11036 /* Check cases like x^y==z */
11058 /* Check cases like x&y==z */
11065 /* Check cases like !x & y */
11069 "suggest parentheses around operand of "
11092 {
11097 "comparisons like %<X<=Y<=Z%> do not "
11103 "comparisons like %<X<=Y<=Z%> do not "
11105 }
11107 }
11108 #undef NOT_A_BOOLEAN_EXPR_P
11109 }
11111 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11113 void
11115 {
11117 {
11120 else
11122 }
11123 }
11125 /* Warn for division by zero according to the value of DIVISOR. LOC
11126 is the location of the division operator. */
11128 void
11130 {
11131 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11132 about division by zero. Do not issue a warning if DIVISOR has a
11133 floating-point type, since we consider 0.0/0.0 a valid way of
11134 generating a NaN. */
11138 }
11140 /* Subroutine of build_binary_op. Give warnings for comparisons
11141 between signed and unsigned quantities that may fail. Do the
11142 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11143 so that casts will be considered, but default promotions won't
11144 be.
11146 LOCATION is the location of the comparison operator.
11148 The arguments of this function map directly to local variables
11149 of build_binary_op. */
11151 void
11156 {
11161 /* In C++, check for comparison of different enum types. */
11167 {
11171 }
11173 /* Do not warn if the comparison is being done in a signed type,
11174 since the signed type will only be chosen if it can represent
11175 all the values of the unsigned type. */
11178 /* Do not warn if both operands are unsigned. */
11181 else
11182 {
11188 else
11196 /* Do not warn if the signed quantity is an unsuffixed integer
11197 literal (or some static constant expression involving such
11198 literals or a conditional expression involving such literals)
11199 and it is non-negative. */
11202 /* Do not warn if the comparison is an equality operation, the
11203 unsigned quantity is an integral constant, and it would fit
11204 in the result if the result were signed. */
11209 /* In C, do not warn if the unsigned quantity is an enumeration
11210 constant and its maximum value would fit in the result if the
11211 result were signed. */
11217 else
11219 OPT_Wsign_compare,
11221 }
11223 /* Warn if two unsigned values are being compared in a size larger
11224 than their original size, and one (and only one) is the result of
11225 a `~' operator. This comparison will always fail.
11227 Also warn if one operand is a constant, and the constant does not
11228 have all bits set that are set in the ~ operand when it is
11229 extended. */
11236 {
11243 {
11244 tree primop;
11250 {
11254 }
11255 else
11256 {
11260 }
11265 {
11268 {
11272 else
11275 }
11276 }
11277 }
11285 }
11286 }
11288 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11289 type via c_common_type. If -Wdouble-promotion is in use, and the
11290 conditions for warning have been met, issue a warning. GMSGID is
11291 the warning message. It must have two %T specifiers for the type
11292 that was converted (generally "float") and the type to which it was
11293 converted (generally "double), respectively. LOC is the location
11294 to which the awrning should refer. */
11296 void
11299 {
11300 tree source_type;
11304 /* If the conversion will not occur at run-time, there is no need to
11305 warn about it. */
11317 else
11320 }
11322 /* Setup a TYPE_DECL node as a typedef representation.
11324 X is a TYPE_DECL for a typedef statement. Create a brand new
11325 ..._TYPE node (which will be just a variant of the existing
11326 ..._TYPE node with identical properties) and then install X
11327 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11329 The whole point here is to end up with a situation where each
11330 and every ..._TYPE node the compiler creates will be uniquely
11331 associated with AT MOST one node representing a typedef name.
11332 This way, even though the compiler substitutes corresponding
11333 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11334 early on, later parts of the compiler can always do the reverse
11335 translation and get back the corresponding typedef name. For
11336 example, given:
11338 typedef struct S MY_TYPE;
11339 MY_TYPE object;
11341 Later parts of the compiler might only know that `object' was of
11342 type `struct S' if it were not for code just below. With this
11343 code however, later parts of the compiler see something like:
11345 struct S' == struct S
11346 typedef struct S' MY_TYPE;
11347 struct S' object;
11349 And they can then deduce (from the node for type struct S') that
11350 the original object declaration was:
11352 MY_TYPE object;
11354 Being able to do this is important for proper support of protoize,
11355 and also for generating precise symbolic debugging information
11356 which takes full account of the programmer's (typedef) vocabulary.
11358 Obviously, we don't want to generate a duplicate ..._TYPE node if
11359 the TYPE_DECL node that we are now processing really represents a
11360 standard built-in type. */
11362 void
11364 {
11368 {
11371 }
11374 {
11382 }
11383 }
11385 /* Record the types used by the current global variable declaration
11386 being parsed, so that we can decide later to emit their debug info.
11387 Those types are in types_used_by_cur_var_decl, and we are going to
11388 store them in the types_used_by_vars_hash hash table.
11389 DECL is the declaration of the global variable that has been parsed. */
11391 void
11393 {
11397 {
11400 }
11401 }
11403 /* If DECL is a typedef that is declared in the current function,
11404 record it for the purpose of -Wunused-local-typedefs. */
11406 void
11408 {
11413 /* if this is not a locally defined typedef then we are not
11414 interested. */
11421 }
11423 /* If T is a TYPE_DECL declared locally, mark it as used. */
11425 void
11427 {
11432 }
11434 /* Warn if there are some unused locally defined typedefs in the
11435 current function. */
11437 void
11439 {
11441 tree decl;
11442 /* The number of times we have emitted -Wunused-local-typedefs
11443 warnings. If this is different from errorcount, that means some
11444 unrelated errors have been issued. In which case, we'll avoid
11445 emitting "unused-local-typedefs" warnings. */
11457 {
11461 OPT_Wunused_local_typedefs,
11464 }
11467 }
11469 /* The C and C++ parsers both use vectors to hold function arguments.
11470 For efficiency, we keep a cache of unused vectors. This is the
11471 cache. */
11476 /* Return a new vector from the cache. If the cache is empty,
11477 allocate a new vector. These vectors are GC'ed, so it is OK if the
11478 pointer is not released.. */
11482 {
11485 else
11486 {
11487 /* Passing 0 to vec::alloc returns NULL, and our callers require
11488 that we always return a non-NULL value. The vector code uses
11489 4 when growing a NULL vector, so we do too. */
11493 }
11494 }
11496 /* Release a vector of trees back to the cache. */
11498 void
11500 {
11502 {
11505 }
11506 }
11508 /* Get a new tree vector holding a single tree. */
11512 {
11516 }
11518 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11522 {
11527 }
11529 /* Get a new tree vector which is a copy of an existing one. */
11533 {
11536 tree t;
11543 }
11545 /* Return true if KEYWORD starts a type specifier. */
11547 bool
11549 {
11551 {
11581 }
11582 }
11584 /* Return true if KEYWORD names a type qualifier. */
11586 bool
11588 {
11590 {
11598 }
11599 }
11601 /* Return true if KEYWORD names a storage class specifier.
11603 RID_TYPEDEF is not included in this list despite `typedef' being
11604 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11605 such for syntactic convenience only. */
11607 bool
11609 {
11611 {
11621 }
11622 }
11624 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11626 static bool
11628 {
11630 {
11638 }
11639 }
11641 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11642 declaration-specifier (C99 6.7). */
11644 bool
11646 {
11653 {
11660 }
11661 }
11663 /* Initialize language-specific-bits of tree_contains_struct. */
11665 void
11667 {
11671 }
11673 /* Build a user-defined numeric literal out of an integer constant type VALUE
11674 with identifier SUFFIX. */
11676 tree
11679 {
11686 }
11688 /* For vector[index], convert the vector to a
11689 pointer of the underlying type. */
11690 void
11693 {
11695 {
11697 tree type1;
11711 }
11712 }
11714 /* Determine which of the operands, if any, is a scalar that needs to be
11715 converted to a vector, for the range of operations. */
11716 enum stv_conv
11719 {
11728 {
11729 /* Most GENERIC binary expressions require homogeneous arguments.
11730 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11731 argument that is a vector and a second one that is a scalar, so
11732 we never return stv_secondarg for them. */
11737 {
11739 {
11744 }
11745 else
11747 }
11754 /* ... fall through ... */
11775 /* What about UNLT_EXPR? */
11777 {
11778 tree tmp;
11780 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11783 }
11787 {
11789 {
11794 }
11796 }
11798 /* Allow integer --> real conversion if safe. */
11802 {
11804 {
11809 }
11811 }
11814 }
11817 }
11819 /* Return true iff ALIGN is an integral constant that is a fundamental
11820 alignment, as defined by [basic.align] in the c++-11
11821 specifications.
11823 That is:
11825 [A fundamental alignment is represented by an alignment less than or
11826 equal to the greatest alignment supported by the implementation
11827 in all contexts, which is equal to
11828 alignof(max_align_t)]. */
11830 bool
11832 {
11835 }