| blob | 069a90396bcae46766f1db15a0d9fb4947c75980 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
50 /* The following symbols are subsumed in the c_global_trees array, and
51 listed here individually for documentation purposes.
53 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
55 tree short_integer_type_node;
56 tree long_integer_type_node;
57 tree long_long_integer_type_node;
58 tree int128_integer_type_node;
60 tree short_unsigned_type_node;
61 tree long_unsigned_type_node;
62 tree long_long_unsigned_type_node;
63 tree int128_unsigned_type_node;
65 tree truthvalue_type_node;
66 tree truthvalue_false_node;
67 tree truthvalue_true_node;
69 tree ptrdiff_type_node;
71 tree unsigned_char_type_node;
72 tree signed_char_type_node;
73 tree wchar_type_node;
75 tree char16_type_node;
76 tree char32_type_node;
78 tree float_type_node;
79 tree double_type_node;
80 tree long_double_type_node;
82 tree complex_integer_type_node;
83 tree complex_float_type_node;
84 tree complex_double_type_node;
85 tree complex_long_double_type_node;
87 tree dfloat32_type_node;
88 tree dfloat64_type_node;
89 tree_dfloat128_type_node;
91 tree intQI_type_node;
92 tree intHI_type_node;
93 tree intSI_type_node;
94 tree intDI_type_node;
95 tree intTI_type_node;
97 tree unsigned_intQI_type_node;
98 tree unsigned_intHI_type_node;
99 tree unsigned_intSI_type_node;
100 tree unsigned_intDI_type_node;
101 tree unsigned_intTI_type_node;
103 tree widest_integer_literal_type_node;
104 tree widest_unsigned_literal_type_node;
106 Nodes for types `void *' and `const void *'.
108 tree ptr_type_node, const_ptr_type_node;
110 Nodes for types `char *' and `const char *'.
112 tree string_type_node, const_string_type_node;
114 Type `char[SOMENUMBER]'.
115 Used when an array of char is needed and the size is irrelevant.
117 tree char_array_type_node;
119 Type `int[SOMENUMBER]' or something like it.
120 Used when an array of int needed and the size is irrelevant.
122 tree int_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
195 /* C/ObjC language option variables. */
198 /* Nonzero means allow type mismatches in conditional expressions;
199 just make their values `void'. */
203 /* Nonzero means enable C89 Amendment 1 features. */
207 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
211 /* Nonzero means use the ISO C11 dialect of C. */
215 /* Nonzero means that we have builtin functions, and main is an int. */
220 /* ObjC language option variables. */
223 /* Tells the compiler that this is a special run. Do not perform any
224 compiling, instead we are to test some platform dependent features
225 and output a C header file with appropriate definitions. */
229 /* Tells the compiler what is the constant string class for ObjC. */
234 /* C++ language option variables. */
237 /* Nonzero means generate separate instantiation control files and
238 juggle them at link time. */
242 /* The C++ dialect being used. C++11 is the default. */
246 /* Maximum template instantiation depth. This limit exists to limit the
247 time it takes to notice excessively recursive template instantiations.
249 The default is lower than the 1024 recommended by the C++0x standard
250 because G++ runs out of stack before 1024 with highly recursive template
251 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
255 /* The elements of `ridpointers' are identifier nodes for the reserved
256 type names and storage classes. It is indexed by a RID_... value. */
261 /* Nonzero means don't warn about problems that occur when the code is
262 executed. */
265 /* Whether we are building a boolean conversion inside
266 convert_for_assignment, or some other late binary operation. If
267 build_binary_op is called for C (from code shared by C and C++) in
268 this case, then the operands have already been folded and the
269 result will not be folded again, so C_MAYBE_CONST_EXPR should not
270 be generated. */
273 /* Whether lexing has been completed, so subsequent preprocessor
274 errors should use the compiler's input_location. */
277 /* Information about how a function name is generated. */
278 struct fname_var_t
279 {
283 };
285 /* The three ways of getting then name of the current function. */
288 {
289 /* C99 compliant __func__, must be first. */
291 /* GCC __FUNCTION__ compliant. */
293 /* GCC __PRETTY_FUNCTION__ compliant. */
296 };
298 /* Global visibility options. */
389 /* Reserved words. The third field is a mask: keywords are disabled
390 if they match the mask.
392 Masks for languages:
393 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
394 C --std=c99: D_CXXONLY | D_OBJC
395 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
396 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
397 C++ --std=c0x: D_CONLY | D_OBJC
398 ObjC++ is like C++ except that D_OBJC is not set
400 If -fno-asm is used, D_ASM is added to the mask. If
401 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
402 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
403 In C with -Wc++-compat, we warn if D_CXXWARN is set.
405 Note the complication of the D_CXX_OBJC keywords. These are
406 reserved words such as 'class'. In C++, 'class' is a reserved
407 word. In Objective-C++ it is too. In Objective-C, it is a
408 reserved word too, but only if it follows an '@' sign.
409 */
411 {
574 /* Concepts-related keywords */
578 /* These Objective-C keywords are recognized only immediately after
579 an '@'. */
596 /* These are recognized only in protocol-qualifier context
597 (see above) */
604 /* These are recognized inside a property attribute list */
613 };
618 /* Table of machine-independent attributes common to all C-like languages. */
620 {
621 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
622 affects_type_identity } */
629 /* FIXME: logically, noreturn attributes should be listed as
630 "false, true, true" and apply to function types. But implementing this
631 would require all the places in the compiler that use TREE_THIS_VOLATILE
632 on a decl to identify non-returning functions to be located and fixed
633 to check the function type instead. */
658 /* The same comments as for noreturn attributes apply to const ones. */
682 handle_no_instrument_function_attribute,
700 /* ??? These two attributes didn't make the transition from the
701 Intel language document to the multi-vendor language document. */
706 /* For internal use (marking of builtins) only. The name contains space
707 to prevent its usage in source code. */
729 /* For internal use (marking of builtins) only. The name contains space
730 to prevent its usage in source code. */
741 handle_no_address_safety_analysis_attribute,
744 handle_no_sanitize_address_attribute,
747 handle_no_sanitize_undefined_attribute,
757 /* For internal use only. The leading '*' both prevents its usage in
758 source code and signals that it may be overridden by machine tables. */
763 /* For internal use (marking of builtins and runtime functions) only.
764 The name contains space to prevent its usage in source code. */
780 };
782 /* Give the specifications for the format attributes, used by C and all
783 descendants. */
786 {
787 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
788 affects_type_identity } */
794 };
796 /* Return identifier for address space AS. */
800 {
804 }
806 /* Push current bindings for the function name VAR_DECLS. */
808 void
810 {
815 {
819 {
821 saved);
823 }
824 }
826 /* Normally they'll have been NULL, so only push if we've got a
827 stack, or they are non-NULL. */
829 saved_function_name_decls);
830 }
832 /* Finish up the current bindings, adding them into the current function's
833 statement tree. This must be done _before_ finish_stmt_tree is called.
834 If there is no current function, we must be at file scope and no statements
835 are involved. Pop the previous bindings. */
837 void
839 {
848 {
856 }
862 {
863 /* We had saved values, restore them. */
864 tree saved;
867 {
872 }
874 }
876 }
878 /* Return the text name of the current function, suitably prettified
879 by PRETTY_P. Return string must be freed by caller. */
883 {
890 {
893 }
906 {
909 }
912 }
914 /* Return the VAR_DECL for a const char array naming the current
915 function. If the VAR_DECL has not yet been created, create it
916 now. RID indicates how it should be formatted and IDENTIFIER_NODE
917 ID is its name (unfortunately C and C++ hold the RID values of
918 keywords in different places, so we can't derive RID from ID in
919 this language independent code. LOC is the location of the
920 function. */
922 tree
924 {
934 {
935 /* If a tree is built here, it would normally have the lineno of
936 the current statement. Later this tree will be moved to the
937 beginning of the function and this line number will be wrong.
938 To avoid this problem set the lineno to 0 here; that prevents
939 it from appearing in the RTL. */
940 tree stmts;
948 saved_function_name_decls
952 }
957 }
959 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
961 tree
963 {
968 /* Compute the number of elements, for the array type. */
970 {
973 }
975 {
978 }
980 {
983 }
984 else
985 {
988 }
990 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
991 limit in C++98 Annex B is very large (65536) and is not normative,
992 so we do not diagnose it (warn_overlength_strings is forced off
993 in c_common_post_options). */
995 {
999 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1000 separate the %d from the 'C'. 'ISO' should not be
1001 translated, but it may be moved after 'C%d' in languages
1002 where modifiers follow nouns. */
1004 "string length %qd is greater than the length %qd "
1007 }
1009 /* Create the array type for the string constant. The ISO C++
1010 standard says that a string literal has type `const char[N]' or
1011 `const wchar_t[N]'. We use the same logic when invoked as a C
1012 front-end with -Wwrite-strings.
1013 ??? We should change the type of an expression depending on the
1014 state of a warning flag. We should just be warning -- see how
1015 this is handled in the C++ front-end for the deprecated implicit
1016 conversion from string literals to `char*' or `wchar_t*'.
1018 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1019 array type being the unqualified version of that type.
1020 Therefore, if we are constructing an array of const char, we must
1021 construct the matching unqualified array type first. The C front
1022 end does not require this, but it does no harm, so we do it
1023 unconditionally. */
1034 }
1035 \f
1036 /* If DISABLE is true, stop issuing warnings. This is used when
1037 parsing code that we know will not be executed. This function may
1038 be called multiple times, and works as a stack. */
1040 static void
1042 {
1044 {
1047 }
1048 }
1050 /* If ENABLE is true, reenable issuing warnings. */
1052 static void
1054 {
1056 {
1059 }
1060 }
1062 /* Fully fold EXPR, an expression that was not folded (beyond integer
1063 constant expressions and null pointer constants) when being built
1064 up. If IN_INIT, this is in a static initializer and certain
1065 changes are made to the folding done. Clear *MAYBE_CONST if
1066 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1067 expression because it contains an evaluated operator (in C99) or an
1068 operator outside of sizeof returning an integer constant (in C90)
1069 not permitted in constant expressions, or because it contains an
1070 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1071 set to true by callers before calling this function.) Return the
1072 folded expression. Function arguments have already been folded
1073 before calling this function, as have the contents of SAVE_EXPR,
1074 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1075 C_MAYBE_CONST_EXPR. */
1077 tree
1079 {
1080 tree ret;
1086 /* This function is not relevant to C++ because C++ folds while
1087 parsing, and may need changes to be correct for C++ when C++
1088 stops folding while parsing. */
1095 {
1098 }
1105 }
1107 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1108 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1109 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1110 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1111 both evaluated and unevaluated subexpressions while
1112 *MAYBE_CONST_ITSELF is carried from only evaluated
1113 subexpressions). */
1115 static tree
1118 {
1130 /* This function is not relevant to C++ because C++ folds while
1131 parsing, and may need changes to be correct for C++ when C++
1132 stops folding while parsing. */
1136 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1137 anything else not counted as an expression cannot usefully be
1138 folded further at this point. */
1144 /* Operands of variable-length expressions (function calls) have
1145 already been folded, as have __builtin_* function calls, and such
1146 expressions cannot occur in constant expressions. */
1148 {
1152 }
1155 {
1164 else
1167 }
1169 /* Assignment, increment, decrement, function call and comma
1170 operators, and statement expressions, cannot occur in constant
1171 expressions if evaluated / outside of sizeof. (Function calls
1172 were handled above, though VA_ARG_EXPR is treated like a function
1173 call here, and statement expressions are handled through
1174 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1176 {
1196 }
1198 /* Fold individual tree codes as appropriate. */
1200 {
1202 /* Any non-constancy will have been marked in a containing
1203 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1211 maybe_const_itself);
1216 {
1219 }
1228 maybe_const_itself);
1231 maybe_const_itself);
1237 {
1241 }
1283 /* Binary operations evaluating both arguments (increment and
1284 decrement are binary internally in GCC). */
1288 maybe_const_itself);
1296 /* The RHS of a MODIFY_EXPR was fully folded when building that
1297 expression for the sake of conversion warnings. */
1300 maybe_const_itself);
1304 ret = in_init
1307 else
1320 {
1331 }
1337 CASE_CONVERT:
1347 /* Unary operations. */
1350 maybe_const_itself);
1354 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1355 not prepared to deal with them if they occur in initializers. */
1363 ret = in_init
1366 else
1371 {
1375 }
1377 {
1380 CASE_CONVERT:
1381 /* Don't warn about explicit conversions. We will already
1382 have warned about suspect implicit conversions. */
1389 }
1394 /* Binary operations not necessarily evaluating both
1395 arguments. */
1402 ? truthvalue_false_node
1410 ret = in_init
1413 else
1418 && op0_const
1419 && op0_const_self
1425 && op0_const_self
1451 else
1456 && op0_const
1457 && op0_const_self
1461 && op0_const_self
1465 && op0_const
1466 && op0_const_self
1470 && op0_const_self
1476 /* Each case where an operand with excess precision may be
1477 encountered must remove the EXCESS_PRECISION_EXPR around
1478 inner operands and possibly put one around the whole
1479 expression or possibly convert to the semantic type (which
1480 c_fully_fold does); we cannot tell at this stage which is
1481 appropriate in any particular case. */
1485 /* Various codes may appear through folding built-in functions
1486 and their arguments. */
1488 }
1490 out:
1491 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1492 have been done by this point, so remove them again. */
1496 {
1500 }
1504 }
1506 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1507 return EXP. Otherwise, return either EXP or its known constant
1508 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1509 Is the BLKmode test appropriate? */
1511 tree
1513 {
1514 tree ret;
1516 /* This function is only used by C, for c_fully_fold and other
1517 optimization, and may not be correct for C++. */
1528 /* Avoid unwanted tree sharing between the initializer and current
1529 function's body where the tree can be modified e.g. by the
1530 gimplifier. */
1534 }
1536 /* Print a warning if a constant expression had overflow in folding.
1537 Invoke this function on every expression that the language
1538 requires to be a constant expression.
1539 Note the ANSI C standard says it is erroneous for a
1540 constant expression to overflow. */
1542 void
1544 {
1552 }
1554 /* The same as above but print an unconditional error. */
1555 void
1557 {
1564 }
1566 /* Print a warning if an expression had overflow in folding and its
1567 operands hadn't.
1569 Invoke this function on every expression that
1570 (1) appears in the source code, and
1571 (2) is a constant expression that overflowed, and
1572 (3) is not already checked by convert_and_check;
1573 however, do not invoke this function on operands of explicit casts
1574 or when the expression is the result of an operator and any operand
1575 already overflowed. */
1577 void
1579 {
1584 {
1613 }
1614 }
1616 /* Warn about uses of logical || / && operator in a context where it
1617 is likely that the bitwise equivalent was intended by the
1618 programmer. We have seen an expression in which CODE is a binary
1619 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1620 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1621 void
1625 {
1637 /* Warn if &&/|| are being used in a context where it is
1638 likely that the bitwise equivalent was intended by the
1639 programmer. That is, an expression such as op && MASK
1640 where op should not be any boolean expression, nor a
1641 constant, and mask seems to be a non-boolean integer constant. */
1649 {
1653 else
1658 }
1660 /* We do not warn for constants because they are typical of macro
1661 expansions that test for features. */
1665 /* This warning only makes sense with logical operands. */
1673 /* We first test whether either side separately is trivially true
1674 (with OR) or trivially false (with AND). If so, do not warn.
1675 This is a common idiom for testing ranges of data types in
1676 portable code. */
1683 /* If this is an OR operation, invert both sides; now, the result
1684 should be always false to get a warning. */
1698 /* If this is an OR operation, invert both sides; now, the result
1699 should be always false to get a warning. */
1707 /* If both expressions have the same operand, if we can merge the
1708 ranges, and if the range test is always false, then warn. */
1715 {
1718 "logical %<or%> "
1720 else
1722 "logical %<and%> "
1724 }
1725 }
1728 /* Warn if EXP contains any computations whose results are not used.
1729 Return true if a warning is printed; false otherwise. LOCUS is the
1730 (potential) location of the expression. */
1732 bool
1734 {
1735 restart:
1739 /* Don't warn about void constructs. This includes casting to void,
1740 void function calls, and statement expressions with a final cast
1741 to void. */
1749 {
1765 /* For a binding, warn if no side effect within it. */
1777 /* In && or ||, warn if 2nd operand has no side effect. */
1784 /* Let people do `(foo (), 0)' without a warning. */
1791 /* If this is an expression with side effects, don't warn; this
1792 case commonly appears in macro expansions. */
1798 /* Don't warn about automatic dereferencing of references, since
1799 the user cannot control it. */
1801 {
1804 }
1805 /* Fall through. */
1808 /* Referencing a volatile value is a side effect, so don't warn. */
1813 /* If this is an expression which has no operands, there is no value
1814 to be unused. There are no such language-independent codes,
1815 but front ends may define such. */
1819 warn:
1821 }
1822 }
1825 /* Print a warning about casts that might indicate violation
1826 of strict aliasing rules if -Wstrict-aliasing is used and
1827 strict aliasing mode is in effect. OTYPE is the original
1828 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1830 bool
1832 {
1833 /* Strip pointer conversion chains and get to the correct original type. */
1841 /* If the type we are casting to is a ref-all pointer
1842 dereferencing it is always valid. */
1849 {
1850 /* Casting the address of an object to non void pointer. Warn
1851 if the cast breaks type based aliasing. */
1853 {
1857 }
1858 else
1859 {
1860 /* warn_strict_aliasing >= 3. This includes the default (3).
1861 Only warn if the cast is dereferenced immediately. */
1862 alias_set_type set1 =
1868 {
1872 }
1875 {
1879 }
1880 }
1881 }
1882 else
1884 {
1885 /* At this level, warn for any conversions, even if an address is
1886 not taken in the same statement. This will likely produce many
1887 false positives, but could be useful to pinpoint problems that
1888 are not revealed at higher levels. */
1893 {
1897 }
1898 }
1901 }
1903 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1904 sizeof as last operand of certain builtins. */
1906 void
1910 {
1914 location_t loc;
1922 {
1926 /* FALLTHRU */
1934 /* FALLTHRU */
1993 }
2021 {
2025 {
2028 "argument to %<sizeof%> in %qD call is the same "
2029 "expression as the destination; did you mean to "
2035 "argument to %<sizeof%> in %qD call is the same "
2036 "expression as the destination; did you mean to "
2038 else
2040 "argument to %<sizeof%> in %qD call is the same "
2041 "expression as the destination; did you mean to "
2044 }
2047 && !strop
2050 {
2052 "argument to %<sizeof%> in %qD call is the same "
2053 "pointer type %qT as the destination; expected %qT "
2057 }
2058 }
2061 {
2065 {
2068 "argument to %<sizeof%> in %qD call is the same "
2069 "expression as the source; did you mean to "
2075 "argument to %<sizeof%> in %qD call is the same "
2076 "expression as the source; did you mean to "
2078 else
2080 "argument to %<sizeof%> in %qD call is the same "
2081 "expression as the source; did you mean to "
2084 }
2087 && !strop
2090 {
2092 "argument to %<sizeof%> in %qD call is the same "
2093 "pointer type %qT as the source; expected %qT "
2097 }
2098 }
2101 {
2105 {
2108 "argument to %<sizeof%> in %qD call is the same "
2109 "expression as the first source; did you mean to "
2115 "argument to %<sizeof%> in %qD call is the same "
2116 "expression as the first source; did you mean to "
2118 else
2120 "argument to %<sizeof%> in %qD call is the same "
2121 "expression as the first source; did you mean to "
2124 }
2127 && !strop
2130 {
2132 "argument to %<sizeof%> in %qD call is the same "
2133 "pointer type %qT as the first source; expected %qT "
2137 }
2138 }
2141 {
2145 {
2148 "argument to %<sizeof%> in %qD call is the same "
2149 "expression as the second source; did you mean to "
2155 "argument to %<sizeof%> in %qD call is the same "
2156 "expression as the second source; did you mean to "
2158 else
2160 "argument to %<sizeof%> in %qD call is the same "
2161 "expression as the second source; did you mean to "
2164 }
2167 && !strop
2170 {
2172 "argument to %<sizeof%> in %qD call is the same "
2173 "pointer type %qT as the second source; expected %qT "
2177 }
2178 }
2180 }
2182 /* Warn for unlikely, improbable, or stupid DECL declarations
2183 of `main'. */
2185 void
2187 {
2188 function_args_iterator iter;
2189 tree type;
2193 {
2194 /* XXX void_type_node belies the abstraction. */
2200 {
2222 "third argument of %q+D should probably be "
2225 }
2226 }
2228 /* It is intentional that this message does not mention the third
2229 argument because it's only mentioned in an appendix of the
2230 standard. */
2234 }
2236 /* vector_targets_convertible_p is used for vector pointer types. The
2237 callers perform various checks that the qualifiers are satisfactory,
2238 while OTOH vector_targets_convertible_p ignores the number of elements
2239 in the vectors. That's fine with vector pointers as we can consider,
2240 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2241 and that does not require and conversion of the pointer values.
2242 In contrast, vector_types_convertible_p and
2243 vector_types_compatible_elements_p are used for vector value types. */
2244 /* True if pointers to distinct types T1 and T2 can be converted to
2245 each other without an explicit cast. Only returns true for opaque
2246 vector types. */
2247 bool
2249 {
2256 }
2258 /* vector_types_convertible_p is used for vector value types.
2259 It could in principle call vector_targets_convertible_p as a subroutine,
2260 but then the check for vector type would be duplicated with its callers,
2261 and also the purpose of vector_targets_convertible_p would become
2262 muddled.
2263 Where vector_types_convertible_p returns true, a conversion might still be
2264 needed to make the types match.
2265 In contrast, vector_targets_convertible_p is used for vector pointer
2266 values, and vector_types_compatible_elements_p is used specifically
2267 in the context for binary operators, as a check if use is possible without
2268 conversion. */
2269 /* True if vector types T1 and T2 can be converted to each other
2270 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2271 can only be converted with -flax-vector-conversions yet that is not
2272 in effect, emit a note telling the user about that option if such
2273 a note has not previously been emitted. */
2274 bool
2276 {
2284 convertible_lax =
2299 {
2302 "conversions between vectors with differing "
2304 }
2307 }
2309 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2310 and have vector types, V0 has the same type as V1, and the number of
2311 elements of V0, V1, MASK is the same.
2313 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2314 called with two arguments. In this case implementation passes the
2315 first argument twice in order to share the same tree code. This fact
2316 could enable the mask-values being twice the vector length. This is
2317 an implementation accident and this semantics is not guaranteed to
2318 the user. */
2319 tree
2322 {
2323 tree ret;
2329 {
2332 }
2340 {
2345 }
2349 {
2353 }
2356 {
2361 }
2367 {
2370 "argument vector(s) and the mask vector should "
2373 }
2377 {
2382 }
2385 {
2386 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2392 else
2393 {
2396 }
2400 }
2410 }
2412 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2413 to integral type. */
2415 static tree
2417 {
2422 {
2423 /* C++0x scoped enumerations don't implicitly convert to integral
2424 type; if we stripped an explicit conversion to a larger type we
2425 need to replace it so common_type will still work. */
2429 }
2431 }
2433 /* This is a helper function of build_binary_op.
2435 For certain operations if both args were extended from the same
2436 smaller type, do the arithmetic in that type and then extend.
2438 BITWISE indicates a bitwise operation.
2439 For them, this optimization is safe only if
2440 both args are zero-extended or both are sign-extended.
2441 Otherwise, we might change the result.
2442 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2443 but calculated in (unsigned short) it would be (unsigned short)-1.
2444 */
2445 tree
2447 {
2451 tree type;
2453 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2454 excessive narrowing when we call get_narrower below. For
2455 example, suppose that OP0 is of unsigned int extended
2456 from signed char and that RESULT_TYPE is long long int.
2457 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2458 like
2460 (long long int) (unsigned int) signed_char
2462 which get_narrower would narrow down to
2464 (unsigned int) signed char
2466 If we do not cast OP0 first, get_narrower would return
2467 signed_char, which is inconsistent with the case of the
2468 explicit cast. */
2475 /* UNS is 1 if the operation to be done is an unsigned one. */
2478 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2479 but it *requires* conversion to FINAL_TYPE. */
2490 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2492 /* For bitwise operations, signedness of nominal type
2493 does not matter. Consider only how operands were extended. */
2497 /* Note that in all three cases below we refrain from optimizing
2498 an unsigned operation on sign-extended args.
2499 That would not be valid. */
2501 /* Both args variable: if both extended in same way
2502 from same width, do it in that width.
2503 Do it unsigned if args were zero-extended. */
2510 return c_common_signed_or_unsigned_type
2517 && (type
2528 && (type
2536 }
2538 /* Checks if expression EXPR of real/integer type cannot be converted
2539 to the real/integer type TYPE. Function returns true when:
2540 * EXPR is a constant which cannot be exactly converted to TYPE
2541 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2542 for EXPR type and TYPE being both integers or both real.
2543 * EXPR is not a constant of real type and TYPE is an integer.
2544 * EXPR is not a constant of integer type which cannot be
2545 exactly converted to real type.
2546 Function allows conversions between types of different signedness and
2547 does not return true in that case. Function can produce signedness
2548 warnings if PRODUCE_WARNS is true. */
2549 bool
2551 {
2557 {
2558 /* Warn for real constant that is not an exact integer converted
2559 to integer type. */
2562 {
2565 }
2566 /* Warn for an integer constant that does not fit into integer type. */
2570 {
2573 {
2577 }
2579 {
2583 }
2584 else
2586 }
2588 {
2589 /* Warn for an integer constant that does not fit into real type. */
2591 {
2595 }
2596 /* Warn for a real constant that does not fit into a smaller
2597 real type. */
2600 {
2604 }
2605 }
2606 }
2607 else
2608 {
2609 /* Warn for real types converted to integer types. */
2616 {
2617 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2621 /* Don't warn for short y; short x = ((int)y & 0xff); */
2625 {
2626 /* If both args were extended from a shortest type,
2627 use that type if that is safe. */
2634 {
2640 /* If one of the operands is a non-negative constant
2641 that fits in the target type, then the type of the
2642 other operand does not matter. */
2651 /* If constant is unsigned and fits in the target
2652 type, then the result will also fit. */
2654 && unsigned0
2657 && unsigned1
2660 }
2661 }
2662 /* Warn for integer types converted to smaller integer types. */
2666 /* When they are the same width but different signedness,
2667 then the value may change. */
2670 /* Even when converted to a bigger type, if the type is
2671 unsigned but expr is signed, then negative values
2672 will be changed. */
2678 }
2680 /* Warn for integer types converted to real types if and only if
2681 all the range of values of the integer type cannot be
2682 represented by the real type. */
2685 {
2689 /* Don't warn about char y = 0xff; float x = (int) y; */
2701 }
2703 /* Warn for real types converted to smaller real types. */
2708 }
2711 }
2713 /* Warns if the conversion of EXPR to TYPE may alter a value.
2714 This is a helper function for warnings_for_convert_and_check. */
2716 static void
2718 {
2726 {
2739 /* Conversion from boolean to a signed:1 bit-field (which only
2740 can hold the values 0 and -1) doesn't lose information - but
2741 it does change the value. */
2756 {
2757 /* In case of COND_EXPR, we do not care about the type of
2758 COND_EXPR, only about the conversion of each operand. */
2765 }
2772 }
2773 }
2775 /* Produce warnings after a conversion. RESULT is the result of
2776 converting EXPR to TYPE. This is a helper function for
2777 convert_and_check and cp_convert_and_check. */
2779 void
2781 {
2788 {
2789 /* Do not diagnose overflow in a constant expression merely
2790 because a conversion overflowed. */
2795 {
2796 /* This detects cases like converting -129 or 256 to
2797 unsigned char. */
2801 else
2803 }
2807 /* No warning for converting 0x80000000 to int. */
2815 else
2817 }
2822 else
2824 }
2827 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2828 Invoke this function on every expression that is converted implicitly,
2829 i.e. because of language rules and not because of an explicit cast. */
2831 tree
2833 {
2834 tree result;
2835 tree expr_for_warning;
2837 /* Convert from a value with possible excess precision rather than
2838 via the semantic type, but do not warn about values not fitting
2839 exactly in the semantic type. */
2841 {
2847 }
2848 else
2862 }
2863 \f
2864 /* A node in a list that describes references to variables (EXPR), which are
2865 either read accesses if WRITER is zero, or write accesses, in which case
2866 WRITER is the parent of EXPR. */
2867 struct tlist
2868 {
2871 };
2873 /* Used to implement a cache the results of a call to verify_tree. We only
2874 use this for SAVE_EXPRs. */
2875 struct tlist_cache
2876 {
2880 tree expr;
2881 };
2883 /* Obstack to use when allocating tlist structures, and corresponding
2884 firstobj. */
2888 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2889 warnings. */
2891 /* SAVE_EXPRs need special treatment. We process them only once and then
2892 cache the results. */
2904 /* Create a new struct tlist and fill in its fields. */
2907 {
2914 }
2916 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2917 is nonnull, we ignore any node we find which has a writer equal to it. */
2919 static void
2921 {
2923 {
2930 }
2931 }
2933 /* Merge the nodes of ADD into TO. This merging process is done so that for
2934 each variable that already exists in TO, no new node is added; however if
2935 there is a write access recorded in ADD, and an occurrence on TO is only
2936 a read access, then the occurrence in TO will be modified to record the
2937 write. */
2939 static void
2941 {
2948 {
2955 {
2959 }
2961 {
2965 }
2967 }
2968 }
2970 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2971 references in list LIST conflict with it, excluding reads if ONLY writers
2972 is nonzero. */
2974 static void
2977 {
2980 /* Avoid duplicate warnings. */
2986 {
2990 {
2995 }
2997 }
2998 }
3000 /* Given a list LIST of references to variables, find whether any of these
3001 can cause conflicts due to missing sequence points. */
3003 static void
3005 {
3009 {
3012 }
3013 }
3015 /* Return nonzero if X is a tree that can be verified by the sequence point
3016 warnings. */
3017 static int
3019 {
3026 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3027 (lvalue_p) crash on TRY/CATCH. */
3034 /* No point to track non-const calls, they will never satisfy
3035 operand_equal_p. */
3043 }
3045 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3046 static bool
3048 {
3050 }
3052 /* Walk the tree X, and record accesses to variables. If X is written by the
3053 parent tree, WRITER is the parent.
3054 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3055 expression or its only operand forces a sequence point, then everything up
3056 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3057 in PNO_SP.
3058 Once we return, we will have emitted warnings if any subexpression before
3059 such a sequence point could be undefined. On a higher level, however, the
3060 sequence point may not be relevant, and we'll merge the two lists.
3062 Example: (b++, a) + b;
3063 The call that processes the COMPOUND_EXPR will store the increment of B
3064 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3065 processes the PLUS_EXPR will need to merge the two lists so that
3066 eventually, all accesses end up on the same list (and we'll warn about the
3067 unordered subexpressions b++ and b.
3069 A note on merging. If we modify the former example so that our expression
3070 becomes
3071 (b++, b) + a
3072 care must be taken not simply to add all three expressions into the final
3073 PNO_SP list. The function merge_tlist takes care of that by merging the
3074 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3075 way, so that no more than one access to B is recorded. */
3077 static void
3079 tree writer)
3080 {
3085 /* X may be NULL if it is the operand of an empty statement expression
3086 ({ }). */
3090 restart:
3098 {
3131 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3132 two first, to avoid warning for (a ? b++ : b++). */
3148 /* Expressions inside the LHS are not ordered wrt. the sequence points
3149 in the RHS. Example:
3150 *a = (a++, 2)
3151 Despite the fact that the modification of "a" is in the before_sp
3152 list (tmp_before), it conflicts with the use of "a" in the LHS.
3153 We can handle this by adding the contents of tmp_list3
3154 to those of tmp_before, and redoing the collision warnings for that
3155 list. */
3158 /* Exclude the LHS itself here; we first have to merge it into the
3159 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3160 didn't exclude the LHS, we'd get it twice, once as a read and once
3161 as a write. */
3172 /* We need to warn about conflicts among arguments and conflicts between
3173 args and the function address. Side effects of the function address,
3174 however, are not ordered by the sequence point of the call. */
3175 {
3176 call_expr_arg_iterator iter;
3177 tree arg;
3181 {
3186 }
3191 }
3194 /* Scan all the list, e.g. indices of multi dimensional array. */
3196 {
3202 }
3206 {
3213 {
3225 {
3229 }
3232 }
3236 }
3246 /* For other expressions, simply recurse on their operands.
3247 Manual tail recursion for unary expressions.
3248 Other non-expressions need not be processed. */
3250 {
3254 }
3256 {
3260 {
3265 }
3266 }
3268 }
3269 }
3271 /* Try to warn for undefined behavior in EXPR due to missing sequence
3272 points. */
3274 DEBUG_FUNCTION void
3276 {
3282 {
3285 }
3290 }
3291 \f
3292 /* Validate the expression after `case' and apply default promotions. */
3294 static tree
3296 {
3301 /* Promote char or short to int. */
3304 {
3307 }
3312 }
3313 \f
3314 /* See if the case values LOW and HIGH are in the range of the original
3315 type (i.e. before the default conversion to int) of the switch testing
3316 expression.
3317 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3318 the type before promoting it. CASE_LOW_P is a pointer to the lower
3319 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3320 if the case is not a case range.
3321 The caller has to make sure that we are not called with NULL for
3322 CASE_LOW_P (i.e. the default case).
3323 Returns true if the case label is in range of ORIG_TYPE (saturated or
3324 untouched) or false if the label is out of range. */
3326 static bool
3329 {
3334 /* If there was a problem with the original type, do nothing. */
3341 /* Case label is less than minimum for type. */
3344 {
3347 }
3349 /* Case value is greater than maximum for type. */
3352 {
3355 }
3357 /* Saturate lower case label value to minimum. */
3360 {
3364 }
3366 /* Saturate upper case label value to maximum. */
3369 {
3373 }
3381 }
3382 \f
3383 /* Return an integer type with BITS bits of precision,
3384 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3386 tree
3388 {
3427 }
3429 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3430 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3431 and saturating if SATP is nonzero, otherwise not saturating. */
3433 tree
3436 {
3440 else
3448 {
3450 "fixed-point types that have too many integral and "
3453 }
3456 }
3458 /* Used for communication between c_common_type_for_mode and
3459 c_register_builtin_type. */
3462 /* Return a data type that has machine mode MODE.
3463 If the mode is an integer,
3464 then UNSIGNEDP selects between signed and unsigned types.
3465 If the mode is a fixed-point mode,
3466 then UNSIGNEDP selects between saturating and nonsaturating types. */
3468 tree
3470 {
3471 tree t;
3508 #if HOST_BITS_PER_WIDE_INT >= 64
3511 #endif
3536 {
3538 tree inner_type;
3554 }
3556 {
3561 }
3571 {
3657 }
3665 }
3667 tree
3669 {
3671 }
3673 /* Return a signed type the same as TYPE in other respects. */
3675 tree
3677 {
3679 }
3681 /* Return a type the same as TYPE except unsigned or
3682 signed according to UNSIGNEDP. */
3684 tree
3686 {
3687 tree type1;
3689 /* This block of code emulates the behavior of the old
3690 c_common_unsigned_type. In particular, it returns
3691 long_unsigned_type_node if passed a long, even when a int would
3692 have the same size. This is necessary for warnings to work
3693 correctly in archs where sizeof(int) == sizeof(long) */
3696 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3712 #if HOST_BITS_PER_WIDE_INT >= 64
3715 #endif
3725 #define C_COMMON_FIXED_TYPES(NAME) \
3726 if (type1 == short_ ## NAME ## _type_node \
3727 || type1 == unsigned_short_ ## NAME ## _type_node) \
3728 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3729 : short_ ## NAME ## _type_node; \
3730 if (type1 == NAME ## _type_node \
3731 || type1 == unsigned_ ## NAME ## _type_node) \
3732 return unsignedp ? unsigned_ ## NAME ## _type_node \
3733 : NAME ## _type_node; \
3734 if (type1 == long_ ## NAME ## _type_node \
3735 || type1 == unsigned_long_ ## NAME ## _type_node) \
3736 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3737 : long_ ## NAME ## _type_node; \
3738 if (type1 == long_long_ ## NAME ## _type_node \
3739 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3740 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3741 : long_long_ ## NAME ## _type_node;
3743 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3744 if (type1 == NAME ## _type_node \
3745 || type1 == u ## NAME ## _type_node) \
3746 return unsignedp ? u ## NAME ## _type_node \
3747 : NAME ## _type_node;
3749 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3750 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3751 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3752 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3753 : sat_ ## short_ ## NAME ## _type_node; \
3754 if (type1 == sat_ ## NAME ## _type_node \
3755 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3756 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3757 : sat_ ## NAME ## _type_node; \
3758 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3759 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3760 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3761 : sat_ ## long_ ## NAME ## _type_node; \
3762 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3763 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3764 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3765 : sat_ ## long_long_ ## NAME ## _type_node;
3767 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3768 if (type1 == sat_ ## NAME ## _type_node \
3769 || type1 == sat_ ## u ## NAME ## _type_node) \
3770 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3771 : sat_ ## NAME ## _type_node;
3797 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3798 the precision; they have precision set to match their range, but
3799 may use a wider mode to match an ABI. If we change modes, we may
3800 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3801 the precision as well, so as to yield correct results for
3802 bit-field types. C++ does not have these separate bit-field
3803 types, and producing a signed or unsigned variant of an
3804 ENUMERAL_TYPE may cause other problems as well. */
3810 #define TYPE_OK(node) \
3811 (TYPE_MODE (type) == TYPE_MODE (node) \
3812 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3831 #if HOST_BITS_PER_WIDE_INT >= 64
3834 #endif
3843 #undef TYPE_OK
3846 }
3848 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3850 tree
3852 {
3853 /* Extended integer types of the same width as a standard type have
3854 lesser rank, so those of the same width as int promote to int or
3855 unsigned int and are valid for printf formats expecting int or
3856 unsigned int. To avoid such special cases, avoid creating
3857 extended integer types for bit-fields if a standard integer type
3858 is available. */
3875 }
3877 /* The C version of the register_builtin_type langhook. */
3879 void
3881 {
3882 tree decl;
3892 }
3893 \f
3894 /* Print an error message for invalid operands to arith operation
3895 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3896 LOCATION is the location of the message. */
3898 void
3901 {
3905 {
3950 }
3954 }
3955 \f
3956 /* Given an expression as a tree, return its original type. Do this
3957 by stripping any conversion that preserves the sign and precision. */
3958 static tree
3960 {
3963 }
3965 /* Subroutine of build_binary_op, used for comparison operations.
3966 See if the operands have both been converted from subword integer types
3967 and, if so, perhaps change them both back to their original type.
3968 This function is also responsible for converting the two operands
3969 to the proper common type for comparison.
3971 The arguments of this function are all pointers to local variables
3972 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3973 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3975 If this function returns nonzero, it means that the comparison has
3976 a constant value. What this function returns is an expression for
3977 that value. */
3979 tree
3982 {
3983 tree type;
3992 /* Throw away any conversions to wider types
3993 already present in the operands. */
3998 /* If primopN is first sign-extended from primopN's precision to opN's
3999 precision, then zero-extended from opN's precision to
4000 *restype_ptr precision, shortenings might be invalid. */
4003 && !unsignedp0
4008 && !unsignedp1
4012 /* Handle the case that OP0 does not *contain* a conversion
4013 but it *requires* conversion to FINAL_TYPE. */
4020 /* If one of the operands must be floated, we cannot optimize. */
4024 /* If first arg is constant, swap the args (changing operation
4025 so value is preserved), for canonicalization. Don't do this if
4026 the second arg is 0. */
4031 {
4048 {
4063 }
4065 }
4067 /* If comparing an integer against a constant more bits wide,
4068 maybe we can deduce a value of 1 or 0 independent of the data.
4069 Or else truncate the constant now
4070 rather than extend the variable at run time.
4072 This is only interesting if the constant is the wider arg.
4073 Also, it is not safe if the constant is unsigned and the
4074 variable arg is signed, since in this case the variable
4075 would be sign-extended and then regarded as unsigned.
4076 Our technique fails in this case because the lowest/highest
4077 possible unsigned results don't follow naturally from the
4078 lowest/highest possible values of the variable operand.
4079 For just EQ_EXPR and NE_EXPR there is another technique that
4080 could be used: see if the constant can be faithfully represented
4081 in the other operand's type, by truncating it and reextending it
4082 and see if that preserves the constant's value. */
4088 {
4091 /* 1 if comparison is nominally unsigned. */
4093 tree val;
4105 {
4106 /* Convert primop1 to target type, but do not introduce
4107 additional overflow. We know primop1 is an int_cst. */
4111 }
4113 {
4116 }
4119 {
4124 }
4125 else
4126 {
4131 }
4134 /* This used to be a switch, but Genix compiler can't handle that. */
4136 {
4139 }
4141 {
4144 }
4146 {
4151 }
4153 {
4158 }
4160 {
4165 }
4167 {
4172 }
4174 /* If primop0 was sign-extended and unsigned comparison specd,
4175 we did a signed comparison above using the signed type bounds.
4176 But the comparison we output must be unsigned.
4178 Also, for inequalities, VAL is no good; but if the signed
4179 comparison had *any* fixed result, it follows that the
4180 unsigned comparison just tests the sign in reverse
4181 (positive values are LE, negative ones GE).
4182 So we can generate an unsigned comparison
4183 against an extreme value of the signed type. */
4186 {
4189 {
4204 }
4206 }
4210 {
4217 }
4220 {
4221 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4225 }
4227 /* Value is not predetermined, but do the comparison
4228 in the type of the operand that is not constant.
4229 TYPE is already properly set. */
4230 }
4232 /* If either arg is decimal float and the other is float, find the
4233 proper common type to use for comparison. */
4244 /* If args' natural types are both narrower than nominal type
4245 and both extend in the same manner, compare them
4246 in the type of the wider arg.
4247 Otherwise must actually extend both to the nominal
4248 common type lest different ways of extending
4249 alter the result.
4250 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4255 {
4259 type);
4260 /* Make sure shorter operand is extended the right way
4261 to match the longer operand. */
4262 primop0
4265 primop0);
4266 primop1
4269 primop1);
4270 }
4271 else
4272 {
4273 /* Here we must do the comparison on the nominal type
4274 using the args exactly as we received them. */
4281 {
4283 /* All unsigned values are >= 0, so we warn. However,
4284 if OP0 is a constant that is >= 0, the signedness of
4285 the comparison isn't an issue, so suppress the
4286 warning. */
4288 warn_type_limits && !in_system_header
4292 primop0)))
4293 /* Do not warn for enumeration types. */
4297 {
4314 }
4317 {
4318 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4323 }
4324 }
4325 }
4333 }
4334 \f
4335 /* Return a tree for the sum or difference (RESULTCODE says which)
4336 of pointer PTROP and integer INTOP. */
4338 tree
4341 {
4344 /* The result is a pointer of the same type that is being added. */
4348 {
4355 }
4357 {
4364 }
4365 else
4368 /* We are manipulating pointer values, so we don't need to warn
4369 about relying on undefined signed overflow. We disable the
4370 warning here because we use integer types so fold won't know that
4371 they are really pointers. */
4374 /* If what we are about to multiply by the size of the elements
4375 contains a constant term, apply distributive law
4376 and multiply that constant term separately.
4377 This helps produce common subexpressions. */
4382 /* If the constant comes from pointer subtraction,
4383 skip this optimization--it would cause an error. */
4385 /* If the constant is unsigned, and smaller than the pointer size,
4386 then we must skip this optimization. This is because it could cause
4387 an overflow error if the constant is negative but INTOP is not. */
4391 {
4396 /* Convert both subexpression types to the type of intop,
4397 because weird cases involving pointer arithmetic
4398 can result in a sum or difference with different type args. */
4403 }
4405 /* Convert the integer argument to a type the same size as sizetype
4406 so the multiply won't overflow spuriously. */
4412 /* Replace the integer argument with a suitable product by the object size.
4413 Do this multiplication as signed, then convert to the appropriate type
4414 for the pointer operation and disregard an overflow that occurred only
4415 because of the sign-extension change in the latter conversion. */
4416 {
4424 }
4426 /* Create the sum or difference. */
4435 }
4436 \f
4437 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4438 and if NON_CONST is known not to be permitted in an evaluated part
4439 of a constant expression. */
4441 tree
4443 {
4447 /* This should never be called for C++. */
4451 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4460 }
4462 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4463 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4464 around the SAVE_EXPR if needed so that c_fully_fold does not need
4465 to look inside SAVE_EXPRs. */
4467 tree
4469 {
4478 }
4480 /* Return whether EXPR is a declaration whose address can never be
4481 NULL. */
4483 bool
4485 {
4490 }
4492 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4493 or for an `if' or `while' statement or ?..: exp. It should already
4494 have been validated to be of suitable type; otherwise, a bad
4495 diagnostic may result.
4497 The EXPR is located at LOCATION.
4499 This preparation consists of taking the ordinary
4500 representation of an expression expr and producing a valid tree
4501 boolean expression describing whether expr is nonzero. We could
4502 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4503 but we optimize comparisons, &&, ||, and !.
4505 The resulting type should always be `truthvalue_type_node'. */
4507 tree
4509 {
4511 {
4553 ? truthvalue_true_node
4559 ? truthvalue_true_node
4564 /* Fall through. */
4567 {
4570 {
4571 /* Common Ada/Pascal programmer's mistake. */
4573 OPT_Waddress,
4575 inner);
4577 }
4579 }
4596 /* These don't change whether an object is nonzero or zero. */
4601 /* These don't change whether an object is zero or nonzero, but
4602 we can't ignore them if their second arg has side-effects. */
4604 {
4607 c_common_truthvalue_conversion
4610 }
4611 else
4616 /* Distribute the conversion into the arms of a COND_EXPR. */
4618 {
4621 /* In C++ one of the arms might have void type if it is throw. */
4629 }
4630 else
4631 {
4632 /* Folding will happen later for C. */
4640 }
4642 CASE_CONVERT:
4643 {
4647 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4648 since that affects how `default_conversion' will behave. */
4652 /* Don't strip a conversion from C++0x scoped enum, since they
4653 don't implicitly convert to other types. */
4657 /* If this isn't narrowing the argument, we can ignore it. */
4661 }
4667 {
4671 }
4676 }
4679 {
4681 expr = (build_binary_op
4685 c_common_truthvalue_conversion
4688 c_common_truthvalue_conversion
4693 }
4696 {
4701 }
4702 else
4705 ret:
4708 }
4709 \f
4718 /* Apply the TYPE_QUALS to the new DECL. */
4720 void
4722 {
4730 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4731 constructor can produce constant init, so rely on cp_finish_decl to
4732 clear TREE_READONLY if the variable has non-constant init. */
4735 {
4738 }
4740 {
4742 /* Allow 'restrict' on arrays of pointers.
4743 FIXME currently we just ignore it. */
4749 }
4750 }
4752 /* Hash function for the problem of multiple type definitions in
4753 different files. This must hash all types that will compare
4754 equal via comptypes to the same value. In practice it hashes
4755 on some of the simple stuff and leaves the details to comptypes. */
4757 static hashval_t
4759 {
4763 tree t2;
4765 {
4766 /* For pointers, hash on pointee type plus some swizzling. */
4769 /* Hash on number of elements and total size. */
4788 }
4789 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4790 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4792 /* We might have a VLA here. */
4795 else
4798 }
4802 /* Return the typed-based alias set for T, which may be an expression
4803 or a type. Return -1 if we don't do anything special. */
4805 alias_set_type
4807 {
4808 tree u;
4811 /* For VLAs, use the alias set of the element type rather than the
4812 default of alias set 0 for types compared structurally. */
4814 {
4818 }
4820 /* Permit type-punning when accessing a union, provided the access
4821 is directly through the union. For example, this code does not
4822 permit taking the address of a union member and then storing
4823 through it. Even the type-punning allowed here is a GCC
4824 extension, albeit a common and useful one; the C standard says
4825 that such accesses have implementation-defined behavior. */
4833 /* That's all the expressions we handle specially. */
4837 /* The C standard guarantees that any object may be accessed via an
4838 lvalue that has character type. */
4844 /* The C standard specifically allows aliasing between signed and
4845 unsigned variants of the same type. We treat the signed
4846 variant as canonical. */
4848 {
4851 /* t1 == t can happen for boolean nodes which are always unsigned. */
4854 }
4856 /* Handle the case of multiple type nodes referring to "the same" type,
4857 which occurs with IMA. These share an alias set. FIXME: Currently only
4858 C90 is handled. (In C99 type compatibility is not transitive, which
4859 complicates things mightily. The alias set splay trees can theoretically
4860 represent this, but insertion is tricky when you consider all the
4861 different orders things might arrive in.) */
4866 /* Save time if there's only one input file. */
4870 /* Pointers need special handling if they point to any type that
4871 needs special handling (below). */
4873 {
4874 tree t2;
4875 /* Find bottom type under any nested POINTERs. */
4879 ;
4887 }
4888 /* These are the only cases that need special handling. */
4895 /* Undefined? */
4899 /* Look up t in hash table. Only one of the compatible types within each
4900 alias set is recorded in the table. */
4904 NULL);
4907 {
4910 }
4911 else
4912 /* Our caller will assign and record (in t) a new alias set; all we need
4913 to do is remember t in the hash table. */
4917 }
4918 \f
4919 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4920 the second parameter indicates which OPERATOR is being applied.
4921 The COMPLAIN flag controls whether we should diagnose possibly
4922 ill-formed constructs or not. LOC is the location of the SIZEOF or
4923 TYPEOF operator. */
4925 tree
4928 {
4936 {
4938 {
4945 }
4946 else
4947 {
4949 {
4953 else
4956 }
4958 }
4959 }
4961 {
4969 }
4972 {
4977 }
4980 {
4985 }
4986 else
4987 {
4989 /* Convert in case a char is more than one unit. */
4993 else
4995 }
4997 /* VALUE will have the middle-end integer type sizetype.
4998 However, we should really return a value of type `size_t',
4999 which is just a typedef for an ordinary integer type. */
5003 }
5005 /* Implement the __alignof keyword: Return the minimum required
5006 alignment of EXPR, measured in bytes. For VAR_DECLs,
5007 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5008 from an "aligned" __attribute__ specification). LOC is the
5009 location of the ALIGNOF operator. */
5011 tree
5013 {
5014 tree t;
5021 {
5024 }
5030 {
5037 {
5044 }
5046 }
5047 else
5051 }
5052 \f
5053 /* Handle C and C++ default attributes. */
5055 enum built_in_attribute
5056 {
5057 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5058 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5059 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5060 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5061 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5063 #undef DEF_ATTR_NULL_TREE
5064 #undef DEF_ATTR_INT
5065 #undef DEF_ATTR_STRING
5066 #undef DEF_ATTR_IDENT
5067 #undef DEF_ATTR_TREE_LIST
5068 ATTR_LAST
5069 };
5075 enum c_builtin_type
5076 {
5077 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5078 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5079 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5080 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5081 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5082 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5083 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5084 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5085 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5086 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5087 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5088 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5089 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5090 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5091 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5092 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5093 NAME,
5094 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5096 #undef DEF_PRIMITIVE_TYPE
5097 #undef DEF_FUNCTION_TYPE_0
5098 #undef DEF_FUNCTION_TYPE_1
5099 #undef DEF_FUNCTION_TYPE_2
5100 #undef DEF_FUNCTION_TYPE_3
5101 #undef DEF_FUNCTION_TYPE_4
5102 #undef DEF_FUNCTION_TYPE_5
5103 #undef DEF_FUNCTION_TYPE_6
5104 #undef DEF_FUNCTION_TYPE_7
5105 #undef DEF_FUNCTION_TYPE_8
5106 #undef DEF_FUNCTION_TYPE_VAR_0
5107 #undef DEF_FUNCTION_TYPE_VAR_1
5108 #undef DEF_FUNCTION_TYPE_VAR_2
5109 #undef DEF_FUNCTION_TYPE_VAR_3
5110 #undef DEF_FUNCTION_TYPE_VAR_4
5111 #undef DEF_FUNCTION_TYPE_VAR_5
5112 #undef DEF_POINTER_TYPE
5113 BT_LAST
5114 };
5118 /* A temporary array for c_common_nodes_and_builtins. Used in
5119 communication with def_fn_type. */
5122 /* A helper function for c_common_nodes_and_builtins. Build function type
5123 for DEF with return type RET and N arguments. If VAR is true, then the
5124 function should be variadic after those N arguments.
5126 Takes special care not to ICE if any of the types involved are
5127 error_mark_node, which indicates that said type is not in fact available
5128 (see builtin_type_for_size). In which case the function type as a whole
5129 should be error_mark_node. */
5131 static void
5133 {
5134 tree t;
5141 {
5147 }
5154 else
5157 egress:
5160 }
5162 /* Build builtin functions common to both C and C++ language
5163 frontends. */
5165 static void
5167 {
5168 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5169 builtin_types[ENUM] = VALUE;
5170 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5171 def_fn_type (ENUM, RETURN, 0, 0);
5172 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5173 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5174 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5175 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5176 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5177 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5178 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5179 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5180 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5181 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5182 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5183 ARG6) \
5184 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5185 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5186 ARG6, ARG7) \
5187 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5188 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5189 ARG6, ARG7, ARG8) \
5190 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5191 ARG7, ARG8);
5192 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5193 def_fn_type (ENUM, RETURN, 1, 0);
5194 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5195 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5196 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5197 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5198 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5199 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5200 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5201 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5202 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5203 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5204 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5205 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5209 #undef DEF_PRIMITIVE_TYPE
5210 #undef DEF_FUNCTION_TYPE_1
5211 #undef DEF_FUNCTION_TYPE_2
5212 #undef DEF_FUNCTION_TYPE_3
5213 #undef DEF_FUNCTION_TYPE_4
5214 #undef DEF_FUNCTION_TYPE_5
5215 #undef DEF_FUNCTION_TYPE_6
5216 #undef DEF_FUNCTION_TYPE_VAR_0
5217 #undef DEF_FUNCTION_TYPE_VAR_1
5218 #undef DEF_FUNCTION_TYPE_VAR_2
5219 #undef DEF_FUNCTION_TYPE_VAR_3
5220 #undef DEF_FUNCTION_TYPE_VAR_4
5221 #undef DEF_FUNCTION_TYPE_VAR_5
5222 #undef DEF_POINTER_TYPE
5227 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5228 NONANSI_P, ATTRS, IMPLICIT, COND) \
5229 if (NAME && COND) \
5230 def_builtin_1 (ENUM, NAME, CLASS, \
5231 builtin_types[(int) TYPE], \
5232 builtin_types[(int) LIBTYPE], \
5233 BOTH_P, FALLBACK_P, NONANSI_P, \
5234 built_in_attributes[(int) ATTRS], IMPLICIT);
5236 #undef DEF_BUILTIN
5244 }
5246 /* Like get_identifier, but avoid warnings about null arguments when
5247 the argument may be NULL for targets where GCC lacks stdint.h type
5248 information. */
5252 {
5254 }
5256 /* Build tree nodes and builtin functions common to both C and C++ language
5257 frontends. */
5259 void
5261 {
5265 tree array_domain_type;
5266 tree va_list_ref_type_node;
5267 tree va_list_arg_type_node;
5271 /* Define `int' and `char' first so that dbx will output them first. */
5275 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5276 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5277 but not C. Are the conditionals here needed? */
5283 long_unsigned_type_node);
5285 {
5287 int128_integer_type_node);
5289 int128_unsigned_type_node);
5290 }
5294 long_long_integer_type_node);
5296 long_long_unsigned_type_node);
5299 long_long_unsigned_type_node);
5302 short_unsigned_type_node);
5305 short_unsigned_type_node);
5307 /* Define both `signed char' and `unsigned char'. */
5311 /* These are types that c_common_type_for_size and
5312 c_common_type_for_mode use. */
5315 intQI_type_node));
5318 intHI_type_node));
5321 intSI_type_node));
5324 intDI_type_node));
5325 #if HOST_BITS_PER_WIDE_INT >= 64
5328 TYPE_DECL,
5330 intTI_type_node));
5331 #endif
5334 unsigned_intQI_type_node));
5337 unsigned_intHI_type_node));
5340 unsigned_intSI_type_node));
5343 unsigned_intDI_type_node));
5344 #if HOST_BITS_PER_WIDE_INT >= 64
5347 TYPE_DECL,
5349 unsigned_intTI_type_node));
5350 #endif
5352 /* Create the widest literal types. */
5353 widest_integer_literal_type_node
5357 widest_integer_literal_type_node));
5359 widest_unsigned_literal_type_node
5363 widest_unsigned_literal_type_node));
5367 pid_type_node =
5374 /* Only supported decimal floating point extension if the target
5375 actually supports underlying modes. */
5379 {
5383 }
5386 {
5391 long_long_fract_type_node);
5393 unsigned_short_fract_type_node);
5395 unsigned_fract_type_node);
5397 unsigned_long_fract_type_node);
5399 unsigned_long_long_fract_type_node);
5401 sat_short_fract_type_node);
5404 sat_long_fract_type_node);
5406 sat_long_long_fract_type_node);
5408 sat_unsigned_short_fract_type_node);
5410 sat_unsigned_fract_type_node);
5412 sat_unsigned_long_fract_type_node);
5414 sat_unsigned_long_long_fract_type_node);
5419 long_long_accum_type_node);
5421 unsigned_short_accum_type_node);
5423 unsigned_accum_type_node);
5425 unsigned_long_accum_type_node);
5427 unsigned_long_long_accum_type_node);
5429 sat_short_accum_type_node);
5432 sat_long_accum_type_node);
5434 sat_long_long_accum_type_node);
5436 sat_unsigned_short_accum_type_node);
5438 sat_unsigned_accum_type_node);
5440 sat_unsigned_long_accum_type_node);
5442 sat_unsigned_long_long_accum_type_node);
5444 }
5447 TYPE_DECL,
5449 complex_integer_type_node));
5451 TYPE_DECL,
5453 complex_float_type_node));
5455 TYPE_DECL,
5457 complex_double_type_node));
5461 complex_long_double_type_node));
5464 /* For C++, make fileptr_type_node a distinct void * type until
5465 FILE type is defined. */
5470 /* Set the TYPE_NAME for any variants that were built before
5471 record_builtin_type gave names to the built-in types. */
5472 {
5478 }
5480 /* This node must not be shared. */
5486 /* Make a type to be the domain of a few array types
5487 whose domains don't really matter.
5488 200 is small enough that it always fits in size_t
5489 and large enough that it can hold most function names for the
5490 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5493 /* Make a type for arrays of characters.
5494 With luck nothing will ever really depend on the length of this
5495 array type. */
5496 char_array_type_node
5499 /* Likewise for arrays of ints. */
5500 int_array_type_node
5504 const_string_type_node
5508 /* This is special for C++ so functions can be overloaded. */
5514 {
5517 else
5520 }
5522 /* This is for wide string constants. */
5523 wchar_array_type_node
5526 /* Define 'char16_t'. */
5531 {
5536 }
5538 /* This is for UTF-16 string constants. */
5539 char16_array_type_node
5542 /* Define 'char32_t'. */
5547 {
5552 }
5554 /* This is for UTF-32 string constants. */
5555 char32_array_type_node
5558 wint_type_node =
5561 intmax_type_node =
5563 uintmax_type_node =
5567 sig_atomic_type_node =
5570 int8_type_node =
5573 int16_type_node =
5576 int32_type_node =
5579 int64_type_node =
5582 uint8_type_node =
5585 c_uint16_type_node =
5588 c_uint32_type_node =
5591 c_uint64_type_node =
5594 int_least8_type_node =
5597 int_least16_type_node =
5600 int_least32_type_node =
5603 int_least64_type_node =
5606 uint_least8_type_node =
5609 uint_least16_type_node =
5612 uint_least32_type_node =
5615 uint_least64_type_node =
5618 int_fast8_type_node =
5621 int_fast16_type_node =
5624 int_fast32_type_node =
5627 int_fast64_type_node =
5630 uint_fast8_type_node =
5633 uint_fast16_type_node =
5636 uint_fast32_type_node =
5639 uint_fast64_type_node =
5642 intptr_type_node =
5645 uintptr_type_node =
5648 default_function_type
5650 ptrdiff_type_node
5657 va_list_type_node));
5659 {
5662 tree ptype;
5665 {
5669 ptype));
5671 }
5672 }
5675 {
5678 }
5679 else
5680 {
5683 }
5690 /* Create the built-in __null node. It is important that this is
5691 not shared. */
5695 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5697 }
5699 /* The number of named compound-literals generated thus far. */
5702 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5704 void
5706 {
5709 compound_literal_number);
5710 compound_literal_number++;
5712 }
5714 tree
5716 {
5720 }
5723 /* Linked list of disabled built-in functions. */
5726 {
5734 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5735 begins with "__builtin_", give an error. */
5737 void
5739 {
5742 else
5743 {
5748 }
5749 }
5752 /* Return true if the built-in function NAME has been disabled, false
5753 otherwise. */
5755 static bool
5757 {
5760 {
5763 }
5765 }
5768 /* Worker for DEF_BUILTIN.
5769 Possibly define a builtin function with one or two names.
5770 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5771 nonansi_p and flag_no_nonansi_builtin. */
5773 static void
5780 {
5781 tree decl;
5794 fnattrs);
5803 }
5804 \f
5805 /* Nonzero if the type T promotes to int. This is (nearly) the
5806 integral promotions defined in ISO C99 6.3.1.1/2. */
5808 bool
5810 {
5812 {
5822 /* ??? Technically all enumerations not larger than an int
5823 promote to an int. But this is used along code paths
5824 that only want to notice a size change. */
5832 }
5833 }
5835 /* Return 1 if PARMS specifies a fixed number of parameters
5836 and none of their types is affected by default promotions. */
5838 int
5840 {
5841 const_tree t;
5843 {
5860 }
5862 }
5864 /* Recursively remove any '*' or '&' operator from TYPE. */
5865 tree
5867 {
5871 }
5873 /* Recursively remove pointer or array type from TYPE. */
5874 tree
5876 {
5880 }
5882 /* Used to compare case labels. K1 and K2 are actually tree nodes
5883 representing case labels, or NULL_TREE for a `default' label.
5884 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5885 K2, and 0 if K1 and K2 are equal. */
5887 int
5889 {
5890 /* Consider a NULL key (such as arises with a `default' label) to be
5891 smaller than anything else. */
5898 }
5900 /* Process a case label, located at LOC, for the range LOW_VALUE
5901 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5902 then this case label is actually a `default' label. If only
5903 HIGH_VALUE is NULL_TREE, then case label was declared using the
5904 usual C/C++ syntax, rather than the GNU case range extension.
5905 CASES is a tree containing all the case ranges processed so far;
5906 COND is the condition for the switch-statement itself. Returns the
5907 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5908 is created. */
5910 tree
5913 {
5914 tree type;
5915 tree label;
5916 tree case_label;
5917 splay_tree_node node;
5919 /* Create the LABEL_DECL itself. */
5922 /* If there was an error processing the switch condition, bail now
5923 before we get more confused. */
5931 {
5934 }
5936 /* Case ranges are a GNU extension. */
5943 {
5948 }
5950 {
5955 }
5958 {
5959 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5960 really a case range, even though it was written that way.
5961 Remove the HIGH_VALUE to simplify later processing. */
5966 }
5968 /* See if the case is in range of the type of the original testing
5969 expression. If both low_value and high_value are out of range,
5970 don't insert the case label and return NULL_TREE. */
5976 /* Look up the LOW_VALUE in the table of case labels we already
5977 have. */
5979 /* If there was not an exact match, check for overlapping ranges.
5980 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5981 that's a `default' label and the only overlap is an exact match. */
5983 {
5984 splay_tree_node low_bound;
5985 splay_tree_node high_bound;
5987 /* Even though there wasn't an exact match, there might be an
5988 overlap between this case range and another case range.
5989 Since we've (inductively) not allowed any overlapping case
5990 ranges, we simply need to find the greatest low case label
5991 that is smaller that LOW_VALUE, and the smallest low case
5992 label that is greater than LOW_VALUE. If there is an overlap
5993 it will occur in one of these two ranges. */
5999 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6000 the LOW_VALUE, so there is no need to check unless the
6001 LOW_BOUND is in fact itself a case range. */
6007 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6008 range is bigger than the low end of the current range, so we
6009 are only interested if the current range is a real range, and
6010 not an ordinary case label. */
6012 && high_value
6014 high_value)
6017 }
6018 /* If there was an overlap, issue an error. */
6020 {
6024 {
6028 }
6030 {
6033 }
6034 else
6035 {
6039 }
6041 }
6043 /* Add a CASE_LABEL to the statement-tree. */
6045 /* Register this case label in the splay tree. */
6052 error_out:
6053 /* Add a label so that the back-end doesn't think that the beginning of
6054 the switch is unreachable. Note that we do not add a case label, as
6055 that just leads to duplicates and thence to failure later on. */
6057 {
6060 }
6062 }
6064 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6065 Used to verify that case values match up with enumerator values. */
6067 static void
6069 {
6072 /* ??? Not working too hard to print the double-word value.
6073 Should perhaps be done with %lwd in the diagnostic routines? */
6082 else
6091 buf);
6092 else
6097 }
6099 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6100 Used to verify that case values match up with enumerator values. */
6102 static int
6104 {
6108 /* Skip default case. */
6112 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6113 when we did our enum->case scan. Reset our scratch bit after. */
6116 else
6119 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6120 not set, that means that CASE_HIGH did not appear when we did our
6121 enum->case scan. Reset our scratch bit after. */
6123 {
6126 else
6128 }
6131 }
6133 /* Handle -Wswitch*. Called from the front end after parsing the
6134 switch construct. */
6135 /* ??? Should probably be somewhere generic, since other languages
6136 besides C and C++ would want this. At the moment, however, C/C++
6137 are the only tree-ssa languages that support enumerations at all,
6138 so the point is moot. */
6140 void
6143 {
6144 splay_tree_node default_node;
6145 splay_tree_node node;
6146 tree chain;
6156 /* From here on, we only care about about enumerated types. */
6160 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6164 /* Check the cases. Warn about case values which are not members of
6165 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6166 there is no default case, check that exactly all enumeration
6167 literals are covered by the cases. */
6169 /* Clearing COND if it is not an integer constant simplifies
6170 the tests inside the loop below. */
6174 /* The time complexity here is O(N*lg(N)) worst case, but for the
6175 common case of monotonically increasing enumerators, it is
6176 O(N), since the nature of the splay tree will keep the next
6177 element adjacent to the root at all times. */
6180 {
6186 {
6187 /* Mark the CASE_LOW part of the case entry as seen. */
6191 }
6193 /* Even though there wasn't an exact match, there might be a
6194 case range which includes the enumerator's value. */
6197 {
6201 {
6202 /* If we match the upper bound exactly, mark the CASE_HIGH
6203 part of the case entry as seen. */
6207 }
6208 }
6210 /* We've now determined that this enumerated literal isn't
6211 handled by the case labels of the switch statement. */
6213 /* If the switch expression is a constant, we only really care
6214 about whether that constant is handled by the switch. */
6218 /* If there is a default_node, the only relevant option is
6219 Wswitch-enum. Otherwise, if both are enabled then we prefer
6220 to warn using -Wswitch because -Wswitch is enabled by -Wall
6221 while -Wswitch-enum is explicit. */
6224 ? OPT_Wswitch_enum
6228 }
6230 /* Warn if there are case expressions that don't correspond to
6231 enumerators. This can occur since C and C++ don't enforce
6232 type-checking of assignments to enumeration variables.
6234 The time complexity here is now always O(N) worst case, since
6235 we should have marked both the lower bound and upper bound of
6236 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6237 above. This scan also resets those fields. */
6240 }
6242 /* Finish an expression taking the address of LABEL (an
6243 IDENTIFIER_NODE). Returns an expression for the address.
6245 LOC is the location for the expression returned. */
6247 tree
6249 {
6250 tree result;
6260 else
6261 {
6264 /* The current function is not necessarily uninlinable.
6265 Computed gotos are incompatible with inlining, but the value
6266 here could be used only in a diagnostic, for example. */
6268 }
6271 }
6272 \f
6274 /* Given a boolean expression ARG, return a tree representing an increment
6275 or decrement (as indicated by CODE) of ARG. The front end must check for
6276 invalid cases (e.g., decrement in C++). */
6277 tree
6279 {
6280 tree val;
6285 {
6308 }
6311 }
6312 \f
6313 /* Built-in macros for stddef.h and stdint.h, that require macros
6314 defined in this file. */
6315 void
6317 {
6380 }
6382 static void
6384 {
6385 /* Fill in the built_in_attributes array. */
6386 #define DEF_ATTR_NULL_TREE(ENUM) \
6387 built_in_attributes[(int) ENUM] = NULL_TREE;
6388 #define DEF_ATTR_INT(ENUM, VALUE) \
6389 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6390 #define DEF_ATTR_STRING(ENUM, VALUE) \
6391 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6392 #define DEF_ATTR_IDENT(ENUM, STRING) \
6393 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6394 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6395 built_in_attributes[(int) ENUM] \
6396 = tree_cons (built_in_attributes[(int) PURPOSE], \
6397 built_in_attributes[(int) VALUE], \
6398 built_in_attributes[(int) CHAIN]);
6400 #undef DEF_ATTR_NULL_TREE
6401 #undef DEF_ATTR_INT
6402 #undef DEF_ATTR_IDENT
6403 #undef DEF_ATTR_TREE_LIST
6404 }
6406 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6407 identifier as an argument, so the front end shouldn't look it up. */
6409 bool
6411 {
6414 /* Unknown attribute that we'll end up ignoring, return true so we
6415 don't complain about an identifier argument. */
6421 else
6423 }
6425 /* Attribute handlers common to C front ends. */
6427 /* Handle a "packed" attribute; arguments as in
6428 struct attribute_spec.handler. */
6430 static tree
6433 {
6435 {
6439 }
6441 {
6443 /* Still pack bitfields. */
6448 else
6450 }
6451 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6452 used for DECL_REGISTER. It wouldn't mean anything anyway.
6453 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6454 that changes what the typedef is typing. */
6455 else
6456 {
6459 }
6462 }
6464 /* Handle a "nocommon" attribute; arguments as in
6465 struct attribute_spec.handler. */
6467 static tree
6471 {
6474 else
6475 {
6478 }
6481 }
6483 /* Handle a "common" attribute; arguments as in
6484 struct attribute_spec.handler. */
6486 static tree
6489 {
6492 else
6493 {
6496 }
6499 }
6501 /* Handle a "noreturn" attribute; arguments as in
6502 struct attribute_spec.handler. */
6504 static tree
6507 {
6510 /* See FIXME comment in c_common_attribute_table. */
6517 = build_pointer_type
6520 else
6521 {
6524 }
6527 }
6529 /* Handle a "hot" and attribute; arguments as in
6530 struct attribute_spec.handler. */
6532 static tree
6535 {
6538 {
6540 {
6544 }
6545 /* Most of the rest of the hot processing is done later with
6546 lookup_attribute. */
6547 }
6548 else
6549 {
6552 }
6555 }
6557 /* Handle a "cold" and attribute; arguments as in
6558 struct attribute_spec.handler. */
6560 static tree
6563 {
6566 {
6568 {
6572 }
6573 /* Most of the rest of the cold processing is done later with
6574 lookup_attribute. */
6575 }
6576 else
6577 {
6580 }
6583 }
6585 /* Handle a "no_sanitize_address" attribute; arguments as in
6586 struct attribute_spec.handler. */
6588 static tree
6591 {
6593 {
6596 }
6599 }
6601 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6602 struct attribute_spec.handler. */
6604 static tree
6607 {
6616 }
6618 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6619 struct attribute_spec.handler. */
6621 static tree
6624 {
6626 {
6629 }
6632 }
6634 /* Handle a "noinline" attribute; arguments as in
6635 struct attribute_spec.handler. */
6637 static tree
6641 {
6644 else
6645 {
6648 }
6651 }
6653 /* Handle a "noclone" attribute; arguments as in
6654 struct attribute_spec.handler. */
6656 static tree
6660 {
6662 {
6665 }
6668 }
6670 /* Handle a "always_inline" attribute; arguments as in
6671 struct attribute_spec.handler. */
6673 static tree
6678 {
6680 {
6681 /* Set the attribute and mark it for disregarding inline
6682 limits. */
6684 }
6685 else
6686 {
6689 }
6692 }
6694 /* Handle a "gnu_inline" attribute; arguments as in
6695 struct attribute_spec.handler. */
6697 static tree
6702 {
6704 {
6705 /* Do nothing else, just set the attribute. We'll get at
6706 it later with lookup_attribute. */
6707 }
6708 else
6709 {
6712 }
6715 }
6717 /* Handle a "leaf" attribute; arguments as in
6718 struct attribute_spec.handler. */
6720 static tree
6724 {
6726 {
6729 }
6731 {
6734 }
6737 }
6739 /* Handle an "artificial" attribute; arguments as in
6740 struct attribute_spec.handler. */
6742 static tree
6747 {
6749 {
6750 /* Do nothing else, just set the attribute. We'll get at
6751 it later with lookup_attribute. */
6752 }
6753 else
6754 {
6757 }
6760 }
6762 /* Handle a "flatten" attribute; arguments as in
6763 struct attribute_spec.handler. */
6765 static tree
6767 tree args ATTRIBUTE_UNUSED,
6769 {
6771 /* Do nothing else, just set the attribute. We'll get at
6772 it later with lookup_attribute. */
6773 ;
6774 else
6775 {
6778 }
6781 }
6783 /* Handle a "warning" or "error" attribute; arguments as in
6784 struct attribute_spec.handler. */
6786 static tree
6789 {
6792 /* Do nothing else, just set the attribute. We'll get at
6793 it later with lookup_attribute. */
6794 ;
6795 else
6796 {
6799 }
6802 }
6804 /* Handle a "used" attribute; arguments as in
6805 struct attribute_spec.handler. */
6807 static tree
6810 {
6816 {
6821 }
6822 else
6823 {
6826 }
6829 }
6831 /* Handle a "unused" attribute; arguments as in
6832 struct attribute_spec.handler. */
6834 static tree
6837 {
6839 {
6847 {
6852 }
6853 else
6854 {
6857 }
6858 }
6859 else
6860 {
6864 }
6867 }
6869 /* Handle a "externally_visible" attribute; arguments as in
6870 struct attribute_spec.handler. */
6872 static tree
6877 {
6881 {
6884 {
6888 }
6889 }
6890 else
6891 {
6894 }
6897 }
6899 /* Handle a "const" attribute; arguments as in
6900 struct attribute_spec.handler. */
6902 static tree
6905 {
6908 /* See FIXME comment on noreturn in c_common_attribute_table. */
6914 = build_pointer_type
6917 else
6918 {
6921 }
6924 }
6926 /* Handle a "transparent_union" attribute; arguments as in
6927 struct attribute_spec.handler. */
6929 static tree
6933 {
6934 tree type;
6945 {
6946 /* Make sure that the first field will work for a transparent union.
6947 If the type isn't complete yet, leave the check to the code in
6948 finish_struct. */
6950 {
6956 }
6959 {
6960 /* If the type isn't complete yet, setting the flag
6961 on a variant wouldn't ever be checked. */
6965 /* build_duplicate_type doesn't work for C++. */
6969 /* A type variant isn't good enough, since we don't a cast
6970 to such a type removed as a no-op. */
6972 }
6976 }
6978 ignored:
6981 }
6983 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6984 get the requested priority for a constructor or destructor,
6985 possibly issuing diagnostics for invalid or reserved
6986 priorities. */
6988 static priority_type
6990 {
6991 HOST_WIDE_INT pri;
6992 tree arg;
6998 {
7001 else
7004 }
7017 {
7020 "destructor priorities from 0 to %d are reserved "
7022 MAX_RESERVED_INIT_PRIORITY);
7023 else
7025 "constructor priorities from 0 to %d are reserved "
7027 MAX_RESERVED_INIT_PRIORITY);
7028 }
7031 invalid:
7034 MAX_INIT_PRIORITY);
7035 else
7037 MAX_INIT_PRIORITY);
7039 }
7041 /* Handle a "constructor" attribute; arguments as in
7042 struct attribute_spec.handler. */
7044 static tree
7048 {
7055 {
7056 priority_type priority;
7061 }
7062 else
7063 {
7066 }
7069 }
7071 /* Handle a "destructor" attribute; arguments as in
7072 struct attribute_spec.handler. */
7074 static tree
7078 {
7085 {
7086 priority_type priority;
7091 }
7092 else
7093 {
7096 }
7099 }
7101 /* Nonzero if the mode is a valid vector mode for this architecture.
7102 This returns nonzero even if there is no hardware support for the
7103 vector mode, but we can emulate with narrower modes. */
7105 static int
7107 {
7111 /* Doh! What's going on? */
7120 /* Hardware support. Woo hoo! */
7126 /* We should probably return 1 if requesting V4DI and we have no DI,
7127 but we have V2DI, but this is probably very unlikely. */
7129 /* If we have support for the inner mode, we can safely emulate it.
7130 We may not have V2DI, but me can emulate with a pair of DIs. */
7132 }
7135 /* Handle a "mode" attribute; arguments as in
7136 struct attribute_spec.handler. */
7138 static tree
7141 {
7149 else
7150 {
7155 tree typefm;
7160 {
7166 }
7168 /* Change this type to have a type with the specified mode.
7169 First check for the special modes. */
7182 else
7185 {
7188 }
7191 {
7194 }
7198 {
7230 }
7232 {
7235 }
7238 {
7243 {
7246 }
7250 else
7253 }
7254 else
7255 {
7256 /* For fixed-point modes, we need to test if the signness of type
7257 and the machine mode are consistent. */
7260 {
7263 }
7264 /* For fixed-point modes, we need to pass saturating info. */
7268 }
7271 {
7274 }
7276 {
7277 /* For enumeral types, copy the precision from the integer
7278 type returned above. If not an INTEGER_TYPE, we can't use
7279 this mode for this type. */
7281 {
7284 }
7287 {
7290 }
7291 else
7292 {
7293 /* We cannot build a type variant, as there's code that assumes
7294 that TYPE_MAIN_VARIANT has the same mode. This includes the
7295 debug generators. Instead, create a subrange type. This
7296 results in all of the enumeral values being emitted only once
7297 in the original, and the subtype gets them by reference. */
7300 else
7303 }
7304 }
7308 {
7311 }
7314 }
7317 }
7319 /* Handle a "section" attribute; arguments as in
7320 struct attribute_spec.handler. */
7322 static tree
7325 {
7329 {
7335 {
7339 {
7341 "section attribute cannot be specified for "
7344 }
7346 /* The decl may have already been given a section attribute
7347 from a previous declaration. Ensure they match. */
7351 {
7355 }
7359 {
7362 }
7363 else
7365 }
7366 else
7367 {
7370 }
7371 }
7372 else
7373 {
7377 }
7380 }
7382 /* Check whether ALIGN is a valid user-specified alignment. If so,
7383 return its base-2 log; if not, output an error and return -1. If
7384 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7385 no error. */
7386 int
7388 {
7393 {
7396 }
7401 {
7404 }
7406 {
7409 }
7411 }
7413 /*
7414 If in c++-11, check if the c++-11 alignment constraint with respect
7415 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7416 c++-11 mode, does nothing.
7418 [dcl.align]2/ says:
7420 [* if the constant expression evaluates to a fundamental alignment,
7421 the alignment requirement of the declared entity shall be the
7422 specified fundamental alignment.
7424 * if the constant expression evaluates to an extended alignment
7425 and the implementation supports that alignment in the context
7426 of the declaration, the alignment of the declared entity shall
7427 be that alignment
7429 * if the constant expression evaluates to an extended alignment
7430 and the implementation does not support that alignment in the
7431 context of the declaration, the program is ill-formed]. */
7433 static bool
7437 {
7450 {
7452 {
7453 /* For file scope variables and static members, the target
7454 supports alignments that are at most
7455 MAX_OFILE_ALIGNMENT. */
7458 }
7459 else
7460 {
7461 #ifdef BIGGEST_FIELD_ALIGNMENT
7462 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7463 #else
7464 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7465 #endif
7466 /* For non-static members, the target supports either
7467 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7468 if it is defined or BIGGEST_ALIGNMENT. */
7473 #undef MAX_TARGET_FIELD_ALIGNMENT
7474 /* For stack variables, the target supports at most
7475 MAX_STACK_ALIGNMENT. */
7479 }
7480 }
7482 {
7483 /* Let's be liberal for types. */
7486 }
7494 }
7496 /* Handle a "aligned" attribute; arguments as in
7497 struct attribute_spec.handler. */
7499 static tree
7502 {
7511 {
7515 }
7523 {
7526 /* If we have a TYPE_DECL, then copy the type, so that we
7527 don't accidentally modify a builtin type. See pushdecl. */
7530 {
7537 }
7538 else
7543 }
7546 {
7549 }
7552 /* C++-11 [dcl.align/4]:
7554 When multiple alignment-specifiers are specified for an
7555 entity, the alignment requirement shall be set to the
7556 strictest specified alignment.
7558 This formally comes from the c++11 specification but we are
7559 doing it for the GNU attribute syntax as well. */
7563 {
7568 else
7572 }
7573 else
7574 {
7577 }
7580 }
7582 /* Handle a "weak" attribute; arguments as in
7583 struct attribute_spec.handler. */
7585 static tree
7590 {
7593 {
7596 }
7598 {
7602 }
7606 else
7610 }
7612 /* Handle an "alias" or "ifunc" attribute; arguments as in
7613 struct attribute_spec.handler, except that IS_ALIAS tells us
7614 whether this is an alias as opposed to ifunc attribute. */
7616 static tree
7619 {
7624 {
7627 }
7631 /* A static variable declaration is always a tentative definition,
7632 but the alias is a non-tentative definition which overrides. */
7635 {
7639 }
7643 {
7647 }
7649 /* Note that the very first time we process a nested declaration,
7650 decl_function_context will not be set. Indeed, *would* never
7651 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7652 we do below. After such frobbery, pushdecl would set the context.
7653 In any case, this is never what we want. */
7655 {
7656 tree id;
7660 {
7664 }
7666 /* This counts as a use of the object pointed to. */
7671 else
7675 /* ifuncs are also aliases, so set that attribute too. */
7678 }
7679 else
7680 {
7683 }
7686 }
7688 /* Handle an "alias" or "ifunc" attribute; arguments as in
7689 struct attribute_spec.handler. */
7691 static tree
7694 {
7696 }
7698 /* Handle an "alias" or "ifunc" attribute; arguments as in
7699 struct attribute_spec.handler. */
7701 static tree
7704 {
7706 }
7708 /* Handle a "weakref" attribute; arguments as in struct
7709 attribute_spec.handler. */
7711 static tree
7714 {
7717 /* We must ignore the attribute when it is associated with
7718 local-scoped decls, since attribute alias is ignored and many
7719 such symbols do not even have a DECL_WEAK field. */
7721 || current_function_decl
7723 {
7727 }
7730 {
7734 }
7736 /* The idea here is that `weakref("name")' mutates into `weakref,
7737 alias("name")', and weakref without arguments, in turn,
7738 implicitly adds weak. */
7741 {
7748 }
7749 else
7750 {
7755 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7756 and that isn't supported; and because it wants to add it to
7757 the list of weak decls, which isn't helpful. */
7759 }
7762 }
7764 /* Handle an "visibility" attribute; arguments as in
7765 struct attribute_spec.handler. */
7767 static tree
7771 {
7777 {
7781 {
7783 name);
7785 }
7787 {
7791 }
7792 }
7794 {
7797 }
7800 {
7803 }
7805 /* If this is a type, set the visibility on the type decl. */
7807 {
7812 {
7814 name);
7816 }
7817 }
7827 else
7828 {
7829 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7831 }
7835 {
7849 }
7854 /* Go ahead and attach the attribute to the node as well. This is needed
7855 so we can determine whether we have VISIBILITY_DEFAULT because the
7856 visibility was not specified, or because it was explicitly overridden
7857 from the containing scope. */
7860 }
7862 /* Determine the ELF symbol visibility for DECL, which is either a
7863 variable or a function. It is an error to use this function if a
7864 definition of DECL is not available in this translation unit.
7865 Returns true if the final visibility has been determined by this
7866 function; false if the caller is free to make additional
7867 modifications. */
7869 bool
7871 {
7875 /* If the user explicitly specified the visibility with an
7876 attribute, honor that. DECL_VISIBILITY will have been set during
7877 the processing of the attribute. We check for an explicit
7878 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7879 to distinguish the use of an attribute from the use of a "#pragma
7880 GCC visibility push(...)"; in the latter case we still want other
7881 considerations to be able to overrule the #pragma. */
7883 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7888 /* Set default visibility to whatever the user supplied with
7889 visibility_specified depending on #pragma GCC visibility. */
7891 {
7894 {
7897 /* If visibility changed and DECL already has DECL_RTL, ensure
7898 symbol flags are updated. */
7903 }
7904 }
7906 }
7908 /* Handle an "tls_model" attribute; arguments as in
7909 struct attribute_spec.handler. */
7911 static tree
7914 {
7915 tree id;
7922 {
7925 }
7930 {
7933 }
7943 else
7944 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7948 }
7950 /* Handle a "no_instrument_function" attribute; arguments as in
7951 struct attribute_spec.handler. */
7953 static tree
7958 {
7962 {
7966 }
7968 {
7972 }
7973 else
7977 }
7979 /* Handle a "malloc" attribute; arguments as in
7980 struct attribute_spec.handler. */
7982 static tree
7985 {
7989 else
7990 {
7993 }
7996 }
7998 /* Handle a "alloc_size" attribute; arguments as in
7999 struct attribute_spec.handler. */
8001 static tree
8004 {
8007 {
8014 {
8019 }
8020 }
8022 }
8024 /* Handle a "fn spec" attribute; arguments as in
8025 struct attribute_spec.handler. */
8027 static tree
8031 {
8036 }
8038 /* Handle a "bnd_variable_size" attribute; arguments as in
8039 struct attribute_spec.handler. */
8041 static tree
8044 {
8046 {
8049 }
8052 }
8054 /* Handle a "bnd_legacy" attribute; arguments as in
8055 struct attribute_spec.handler. */
8057 static tree
8060 {
8062 {
8065 }
8068 }
8070 /* Handle a "warn_unused" attribute; arguments as in
8071 struct attribute_spec.handler. */
8073 static tree
8075 tree args ATTRIBUTE_UNUSED,
8077 {
8079 /* Do nothing else, just set the attribute. We'll get at
8080 it later with lookup_attribute. */
8081 ;
8082 else
8083 {
8086 }
8089 }
8091 /* Handle an "omp declare simd" attribute; arguments as in
8092 struct attribute_spec.handler. */
8094 static tree
8096 {
8098 }
8100 /* Handle an "omp declare target" attribute; arguments as in
8101 struct attribute_spec.handler. */
8103 static tree
8105 {
8107 }
8109 /* Handle a "returns_twice" attribute; arguments as in
8110 struct attribute_spec.handler. */
8112 static tree
8115 {
8118 else
8119 {
8122 }
8125 }
8127 /* Handle a "no_limit_stack" attribute; arguments as in
8128 struct attribute_spec.handler. */
8130 static tree
8135 {
8139 {
8143 }
8145 {
8149 }
8150 else
8154 }
8156 /* Handle a "pure" attribute; arguments as in
8157 struct attribute_spec.handler. */
8159 static tree
8162 {
8165 /* ??? TODO: Support types. */
8166 else
8167 {
8170 }
8173 }
8175 /* Digest an attribute list destined for a transactional memory statement.
8176 ALLOWED is the set of attributes that are allowed for this statement;
8177 return the attribute we parsed. Multiple attributes are never allowed. */
8179 int
8181 {
8186 {
8194 {
8197 }
8200 {
8203 }
8206 else
8208 }
8211 }
8213 /* Transform a TM attribute name into a maskable integer and back.
8214 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8215 to how the lack of an attribute is treated. */
8217 int
8219 {
8233 }
8235 tree
8237 {
8240 {
8258 }
8260 }
8262 /* Return the first TM attribute seen in LIST. */
8264 tree
8266 {
8268 {
8272 }
8274 }
8276 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8277 Here we accept only function types, and verify that none of the other
8278 function TM attributes are also applied. */
8279 /* ??? We need to accept class types for C++, but not C. This greatly
8280 complicates this function, since we can no longer rely on the extra
8281 processing given by function_type_required. */
8283 static tree
8286 {
8287 /* Only one path adds the attribute; others don't. */
8291 {
8294 /* Only tm_callable and tm_safe apply to classes. */
8297 /* FALLTHRU */
8301 {
8304 ;
8307 else
8309 }
8313 {
8316 {
8321 }
8322 }
8323 /* FALLTHRU */
8326 /* If a function is next, pass it on to be tried next. */
8330 ignored:
8333 }
8336 }
8338 /* Handle the TM_WRAP attribute; arguments as in
8339 struct attribute_spec.handler. */
8341 static tree
8344 {
8347 /* We don't need the attribute even on success, since we
8348 record the entry in an external table. */
8353 else
8354 {
8360 else
8361 {
8365 {
8369 else
8371 }
8372 else
8374 }
8375 }
8378 }
8380 /* Ignore the given attribute. Used when this attribute may be usefully
8381 overridden by the target, but is not used generically. */
8383 static tree
8387 {
8390 }
8392 /* Handle a "no vops" attribute; arguments as in
8393 struct attribute_spec.handler. */
8395 static tree
8399 {
8403 }
8405 /* Handle a "deprecated" attribute; arguments as in
8406 struct attribute_spec.handler. */
8408 static tree
8412 {
8420 {
8423 }
8426 {
8437 else
8439 }
8441 {
8446 }
8447 else
8451 {
8454 {
8460 }
8463 else
8465 }
8468 }
8470 /* Handle a "vector_size" attribute; arguments as in
8471 struct attribute_spec.handler. */
8473 static tree
8477 {
8487 {
8490 }
8492 /* Get the vector size (in bytes). */
8495 /* We need to provide for vector pointers, vector arrays, and
8496 functions returning vectors. For example:
8498 __attribute__((vector_size(16))) short *foo;
8500 In this case, the mode is SI, but the type being modified is
8501 HI, so we need to look further. */
8510 /* Get the mode of the type being modified. */
8521 {
8524 }
8527 {
8530 }
8533 {
8536 }
8538 /* Calculate how many units fit in the vector. */
8541 {
8544 }
8548 /* Build back pointers if needed. */
8552 }
8554 /* Handle the "nonnull" attribute. */
8555 static tree
8559 {
8563 /* If no arguments are specified, all pointer arguments should be
8564 non-null. Verify a full prototype is given so that the arguments
8565 will have the correct types when we actually check them later. */
8567 {
8569 {
8572 }
8574 }
8576 /* Argument list specified. Verify that each argument number references
8577 a pointer argument. */
8579 {
8583 {
8588 }
8591 {
8592 function_args_iterator iter;
8593 tree argument;
8597 {
8601 }
8605 {
8610 }
8613 {
8618 }
8619 }
8620 }
8623 }
8625 /* Check the argument list of a function call for null in argument slots
8626 that are marked as requiring a non-null pointer argument. The NARGS
8627 arguments are passed in the array ARGARRAY.
8628 */
8630 static void
8632 {
8633 tree a;
8641 /* See if any of the nonnull attributes has no arguments. If so,
8642 then every pointer argument is checked (in which case the check
8643 for pointer type is done in check_nonnull_arg). */
8645 do
8653 else
8654 {
8655 /* Walk the argument list. If we encounter an argument number we
8656 should check for non-null, do it. */
8658 {
8660 {
8664 }
8669 }
8670 }
8671 }
8673 /* Check that the Nth argument of a function call (counting backwards
8674 from the end) is a (pointer)0. The NARGS arguments are passed in the
8675 array ARGARRAY. */
8677 static void
8679 {
8683 {
8686 tree sentinel;
8687 function_args_iterator iter;
8688 tree t;
8690 /* Skip over the named arguments. */
8692 {
8695 len++;
8696 }
8699 {
8702 }
8704 /* The sentinel must be one of the varargs, i.e.
8705 in position >= the number of fixed arguments. */
8707 {
8711 }
8713 /* Validate the sentinel. */
8717 /* Although __null (in C++) is only an integer we allow it
8718 nevertheless, as we are guaranteed that it's exactly
8719 as wide as a pointer, and we don't want to force
8720 users to cast the NULL they have written there.
8721 We warn with -Wstrict-null-sentinel, though. */
8724 }
8725 }
8727 /* Helper for check_function_nonnull; given a list of operands which
8728 must be non-null in ARGS, determine if operand PARAM_NUM should be
8729 checked. */
8731 static bool
8733 {
8737 {
8744 }
8746 }
8748 /* Check that the function argument PARAM (which is operand number
8749 PARAM_NUM) is non-null. This is called by check_function_nonnull
8750 via check_function_arguments_recurse. */
8752 static void
8755 {
8756 /* Just skip checking the argument if it's not a pointer. This can
8757 happen if the "nonnull" attribute was given without an operand
8758 list (which means to check every pointer argument). */
8766 }
8768 /* Helper for nonnull attribute handling; fetch the operand number
8769 from the attribute argument list. */
8771 static bool
8773 {
8774 /* Verify the arg number is a constant. */
8781 }
8783 /* Handle a "nothrow" attribute; arguments as in
8784 struct attribute_spec.handler. */
8786 static tree
8789 {
8792 /* ??? TODO: Support types. */
8793 else
8794 {
8797 }
8800 }
8802 /* Handle a "cleanup" attribute; arguments as in
8803 struct attribute_spec.handler. */
8805 static tree
8808 {
8812 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8813 for global destructors in C++. This requires infrastructure that
8814 we don't have generically at the moment. It's also not a feature
8815 we'd be missing too much, since we do have attribute constructor. */
8817 {
8821 }
8823 /* Verify that the argument is a function in scope. */
8824 /* ??? We could support pointers to functions here as well, if
8825 that was considered desirable. */
8828 {
8832 }
8835 {
8839 }
8841 /* That the function has proper type is checked with the
8842 eventual call to build_function_call. */
8845 }
8847 /* Handle a "warn_unused_result" attribute. No special handling. */
8849 static tree
8853 {
8854 /* Ignore the attribute for functions not returning any value. */
8856 {
8859 }
8862 }
8864 /* Handle a "sentinel" attribute. */
8866 static tree
8869 {
8871 {
8875 }
8876 else
8877 {
8879 {
8883 }
8884 }
8887 {
8891 {
8895 }
8896 else
8897 {
8899 {
8903 }
8904 }
8905 }
8908 }
8910 /* Handle a "type_generic" attribute. */
8912 static tree
8916 {
8917 /* Ensure we have a function type. */
8920 /* Ensure we have a variadic function. */
8924 }
8926 /* Handle a "target" attribute. */
8928 static tree
8931 {
8932 /* Ensure we have a function type. */
8934 {
8937 }
8939 flags))
8943 }
8945 /* Arguments being collected for optimization. */
8950 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8951 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8952 false for #pragma GCC optimize. */
8954 bool
8956 {
8964 tree ap;
8966 /* Build up argv vector. Just in case the string is stored away, use garbage
8967 collected strings. */
8972 {
8976 {
8980 }
8983 {
8984 /* Split string into multiple substrings. */
8992 {
8999 {
9003 }
9004 else
9005 {
9008 }
9012 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9013 options. */
9015 {
9020 else
9024 }
9027 {
9030 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9031 itself is -Os, and any other switch begins with a -f. */
9037 }
9042 }
9044 }
9045 }
9055 /* Now parse the options. */
9065 /* Don't allow changing -fstrict-aliasing. */
9070 }
9072 /* For handling "optimize" attribute. arguments as in
9073 struct attribute_spec.handler. */
9075 static tree
9078 {
9079 /* Ensure we have a function type. */
9081 {
9084 }
9085 else
9086 {
9090 /* Save current options. */
9093 /* If we previously had some optimization options, use them as the
9094 default. */
9099 /* Parse options, and update the vector. */
9104 /* Restore current options. */
9106 }
9109 }
9111 /* Handle a "no_split_stack" attribute. */
9113 static tree
9118 {
9122 {
9126 }
9128 {
9132 }
9135 }
9137 /* Handle a "returns_nonnull" attribute; arguments as in
9138 struct attribute_spec.handler. */
9140 static tree
9143 {
9144 // Even without a prototype we still have a return type we can check.
9146 {
9149 }
9151 }
9153 \f
9154 /* Check for valid arguments being passed to a function with FNTYPE.
9155 There are NARGS arguments in the array ARGARRAY. */
9156 void
9158 {
9159 /* Check for null being passed in a pointer argument that must be
9160 non-null. We also need to do this if format checking is enabled. */
9165 /* Check for errors in format strings. */
9172 }
9174 /* Generic argument checking recursion routine. PARAM is the argument to
9175 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9176 once the argument is resolved. CTX is context for the callback. */
9177 void
9182 {
9186 {
9187 /* Strip coercion. */
9191 }
9194 {
9196 tree attrs;
9199 /* See if this is a call to a known internationalization function
9200 that modifies a format arg. Such a function may have multiple
9201 format_arg attributes (for example, ngettext). */
9204 attrs;
9207 {
9208 tree inner_arg;
9209 tree format_num_expr;
9212 call_expr_arg_iterator iter;
9214 /* Extract the argument number, which was previously checked
9215 to be valid. */
9227 {
9232 }
9233 }
9235 /* If we found a format_arg attribute and did a recursive check,
9236 we are done with checking this argument. Otherwise, we continue
9237 and this will be considered a non-literal. */
9240 }
9243 {
9244 /* Check both halves of the conditional expression. */
9250 }
9253 }
9255 /* Checks for a builtin function FNDECL that the number of arguments
9256 NARGS against the required number REQUIRED and issues an error if
9257 there is a mismatch. Returns true if the number of arguments is
9258 correct, otherwise false. */
9260 static bool
9262 {
9264 {
9268 }
9270 {
9274 }
9276 }
9278 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9279 Returns false if there was an error, otherwise true. */
9281 bool
9283 {
9289 {
9299 {
9301 {
9305 }
9307 }
9317 {
9324 {
9328 }
9330 }
9335 {
9340 {
9344 }
9347 {
9349 fndecl);
9351 }
9353 }
9358 {
9360 {
9363 }
9365 }
9370 }
9371 }
9373 /* Function to help qsort sort FIELD_DECLs by name order. */
9375 int
9377 {
9382 /* A nontype is "greater" than a type. */
9391 }
9394 gt_pointer_operator new_value;
9398 /* This routine compares two fields like field_decl_cmp but using the
9399 pointer operator in resort_data. */
9401 static int
9403 {
9408 /* A nontype is "greater" than a type. */
9414 {
9421 }
9423 }
9425 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9427 void
9430 gt_pointer_operator new_value,
9432 {
9437 resort_field_decl_cmp);
9438 }
9440 /* Subroutine of c_parse_error.
9441 Return the result of concatenating LHS and RHS. RHS is really
9442 a string literal, its first character is indicated by RHS_START and
9443 RHS_SIZE is its length (including the terminating NUL character).
9445 The caller is responsible for deleting the returned pointer. */
9449 {
9455 }
9457 /* Issue the error given by GMSGID, indicating that it occurred before
9458 TOKEN, which had the associated VALUE. */
9460 void
9463 {
9464 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9474 {
9479 {
9492 }
9496 else
9502 }
9524 {
9529 }
9537 {
9542 }
9543 else
9547 {
9550 }
9551 #undef catenate_messages
9552 }
9554 /* Mapping for cpp message reasons to the options that enable them. */
9556 struct reason_option_codes_t
9557 {
9560 };
9581 };
9583 /* Return the gcc option code associated with the reason for a cpp
9584 message, or 0 if none. */
9586 static int
9588 {
9592 {
9595 }
9597 }
9599 /* Callback from cpp_error for PFILE to print diagnostics from the
9600 preprocessor. The diagnostic is of type LEVEL, with REASON set
9601 to the reason code if LEVEL is represents a warning, at location
9602 LOCATION unless this is after lexing and the compiler's location
9603 should be used instead, with column number possibly overridden by
9604 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9605 the arguments. Returns true if a diagnostic was emitted, false
9606 otherwise. */
9608 bool
9612 {
9613 diagnostic_info diagnostic;
9614 diagnostic_t dlevel;
9619 {
9624 /* Fall through. */
9649 }
9662 }
9664 /* Convert a character from the host to the target execution character
9665 set. cpplib handles this, mostly. */
9667 HOST_WIDE_INT
9669 {
9670 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9671 zero-extended under -fno-signed-char. cpplib insists that characters
9672 and character constants are always unsigned. Hence we must convert
9673 back and forth. */
9681 else
9683 }
9685 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9686 references with an INDIRECT_REF of a constant at the bottom; much like the
9687 traditional rendering of offsetof as a macro. Return the folded result. */
9689 tree
9691 {
9695 {
9711 {
9714 }
9724 {
9728 }
9742 /* Check if the offset goes beyond the upper bound of the array. */
9744 {
9750 {
9754 {
9755 tree v;
9762 {
9770 }
9771 /* Don't warn if the array might be considered a poor
9772 man's flexible array member with a very permissive
9773 definition thereof. */
9777 "index %E denotes an offset "
9780 }
9781 }
9782 }
9789 /* Handle static members of volatile structs. */
9796 }
9799 }
9801 /* Likewise, but convert it to the return type of offsetof. */
9803 tree
9805 {
9807 }
9809 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9810 expression, because B will always be true. */
9812 void
9814 {
9817 "the omitted middle operand in ?: will always be %<true%>, "
9819 }
9821 /* Give an error for storing into ARG, which is 'const'. USE indicates
9822 how ARG was being used. */
9824 void
9826 {
9829 /* Using this macro rather than (for example) arrays of messages
9830 ensures that all the format strings are checked at compile
9831 time. */
9832 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9833 : (use == lv_increment ? (I) \
9834 : (use == lv_decrement ? (D) : (AS))))
9836 {
9847 else
9853 }
9859 arg);
9865 arg);
9867 {
9877 arg);
9878 }
9884 arg);
9885 else
9890 arg);
9891 }
9893 /* Print an error message for an invalid lvalue. USE says
9894 how the lvalue is being used and so selects the error message. LOC
9895 is the location for the error. */
9897 void
9899 {
9901 {
9919 }
9920 }
9922 /* Print an error message for an invalid indirection of type TYPE.
9923 ERRSTRING is the name of the operator for the indirection. */
9925 void
9927 {
9929 {
9937 type);
9942 type);
9947 type);
9952 type);
9957 type);
9961 }
9962 }
9963 \f
9964 /* *PTYPE is an incomplete array. Complete it with a domain based on
9965 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9966 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9967 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9969 int
9971 {
9979 {
9981 {
9982 int eltsize
9985 }
9987 {
9991 {
9995 }
9996 else
9997 {
9998 tree curindex;
10009 {
10013 else
10014 {
10016 {
10017 /* Since we treat size types now as ordinary
10018 unsigned types, we need an explicit overflow
10019 check. */
10023 }
10025 size_one_node);
10026 }
10029 }
10031 {
10035 }
10036 }
10037 }
10038 else
10039 {
10040 /* Make an error message unless that happened already. */
10043 }
10044 }
10045 else
10046 {
10050 }
10057 else
10060 /* Using build_distinct_type_copy and modifying things afterward instead
10061 of using build_array_type to create a new type preserves all of the
10062 TYPE_LANG_FLAG_? bits that the front end may have set. */
10070 /* Make sure we have the canonical MAIN_TYPE. */
10073 hashcode);
10076 /* Fix the canonical type. */
10086 else
10091 else
10097 {
10099 /* If we proceed with the array type as it is, we'll eventually
10100 crash in tree_low_cst(). */
10102 }
10106 }
10108 /* Like c_mark_addressable but don't check register qualifier. */
10109 void
10111 {
10117 }
10120 \f
10121 /* Used to help initialize the builtin-types.def table. When a type of
10122 the correct size doesn't exist, use error_mark_node instead of NULL.
10123 The later results in segfaults even when a decl using the type doesn't
10124 get invoked. */
10126 tree
10128 {
10131 }
10133 /* A helper function for resolve_overloaded_builtin in resolving the
10134 overloaded __sync_ builtins. Returns a positive power of 2 if the
10135 first operand of PARAMS is a pointer to a supported data type.
10136 Returns 0 if an error is encountered. */
10138 static int
10140 {
10141 tree type;
10145 {
10148 }
10162 incompatible:
10165 }
10167 /* A helper function for resolve_overloaded_builtin. Adds casts to
10168 PARAMS to make arguments match up with those of FUNCTION. Drops
10169 the variadic arguments at the end. Returns false if some error
10170 was encountered; true on success. */
10172 static bool
10175 {
10176 function_args_iterator iter;
10177 tree ptype;
10181 /* We've declared the implementation functions to use "volatile void *"
10182 as the pointer parameter, so we shouldn't get any complaints from the
10183 call to check_function_arguments what ever type the user used. */
10188 /* For the rest of the values, we need to cast these to FTYPE, so that we
10189 don't get warnings for passing pointer types, etc. */
10192 {
10196 /* XXX void_type_node belies the abstraction. */
10202 {
10205 }
10207 /* Only convert parameters if arg_type is unsigned integer type with
10208 new format sync routines, i.e. don't attempt to convert pointer
10209 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10210 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10211 kinds). */
10213 {
10214 /* Ideally for the first conversion we'd use convert_for_assignment
10215 so that we get warnings for anything that doesn't match the pointer
10216 type. This isn't portable across the C and C++ front ends atm. */
10221 }
10224 }
10226 /* __atomic routines are not variadic. */
10228 {
10231 }
10233 /* The definition of these primitives is variadic, with the remaining
10234 being "an optional list of variables protected by the memory barrier".
10235 No clue what that's supposed to mean, precisely, but we consider all
10236 call-clobbered variables to be protected so we're safe. */
10240 }
10242 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10243 RESULT to make it match the type of the first pointer argument in
10244 PARAMS. */
10246 static tree
10248 {
10253 /* New format doesn't require casting unless the types are the same size. */
10256 else
10258 }
10260 /* This function verifies the PARAMS to generic atomic FUNCTION.
10261 It returns the size if all the parameters are the same size, otherwise
10262 0 is returned if the parameters are invalid. */
10264 static int
10267 {
10272 tree type_0;
10274 /* Determine the parameter makeup. */
10276 {
10292 }
10295 {
10298 }
10300 /* Get type of first parameter, and determine its size. */
10303 {
10305 function);
10307 }
10309 /* Types must be compile time constant sizes. */
10311 {
10314 function);
10316 }
10320 /* Zero size objects are not allowed. */
10322 {
10325 function);
10327 }
10329 /* Check each other parameter is a pointer and the same size. */
10331 {
10334 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10338 {
10340 function);
10342 }
10345 {
10347 function);
10349 }
10350 }
10352 /* Check memory model parameters for validity. */
10354 {
10357 {
10360 {
10363 function);
10364 }
10365 }
10366 else
10368 {
10370 function);
10372 }
10373 }
10376 }
10379 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10380 at the beginning of the parameter list PARAMS representing the size of the
10381 objects. This is to match the library ABI requirement. LOC is the location
10382 of the function call.
10383 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10384 returned to allow the external call to be constructed. */
10386 static tree
10389 {
10390 tree size_node;
10392 /* Insert a SIZE_T parameter as the first param. If there isn't
10393 enough space, allocate a new vector and recursively re-build with that. */
10395 {
10398 tree f;
10407 }
10409 /* Add the size parameter and leave as a function call for processing. */
10413 }
10416 /* Return whether atomic operations for naturally aligned N-byte
10417 arguments are supported, whether inline or through libatomic. */
10418 static bool
10420 {
10422 {
10434 }
10435 }
10437 /* This will process an __atomic_exchange function call, determine whether it
10438 needs to be mapped to the _N variation, or turned into a library call.
10439 LOC is the location of the builtin call.
10440 FUNCTION is the DECL that has been invoked;
10441 PARAMS is the argument list for the call. The return value is non-null
10442 TRUE is returned if it is translated into the proper format for a call to the
10443 external library, and NEW_RETURN is set the tree for that function.
10444 FALSE is returned if processing for the _N variation is required, and
10445 NEW_RETURN is set to the the return value the result is copied into. */
10446 static bool
10449 {
10454 /* Size of 0 is an error condition. */
10456 {
10459 }
10461 /* If not a lock-free size, change to the library generic format. */
10463 {
10466 }
10468 /* Otherwise there is a lockfree match, transform the call from:
10469 void fn(T* mem, T* desired, T* return, model)
10470 into
10471 *return = (T) (fn (In* mem, (In) *desired, model)) */
10478 /* Create pointer to appropriate size. */
10482 /* Convert object pointer to required type. */
10485 /* Convert new value to required type, and dereference it. */
10490 /* Move memory model to the 3rd position, and end param list. */
10494 /* Convert return pointer and dereference it for later assignment. */
10498 }
10501 /* This will process an __atomic_compare_exchange function call, determine
10502 whether it needs to be mapped to the _N variation, or turned into a lib call.
10503 LOC is the location of the builtin call.
10504 FUNCTION is the DECL that has been invoked;
10505 PARAMS is the argument list for the call. The return value is non-null
10506 TRUE is returned if it is translated into the proper format for a call to the
10507 external library, and NEW_RETURN is set the tree for that function.
10508 FALSE is returned if processing for the _N variation is required. */
10510 static bool
10514 {
10519 /* Size of 0 is an error condition. */
10521 {
10524 }
10526 /* If not a lock-free size, change to the library generic format. */
10528 {
10529 /* The library generic format does not have the weak parameter, so
10530 remove it from the param list. Since a parameter has been removed,
10531 we can be sure that there is room for the SIZE_T parameter, meaning
10532 there will not be a recursive rebuilding of the parameter list, so
10533 there is no danger this will be done twice. */
10535 {
10539 }
10542 }
10544 /* Otherwise, there is a match, so the call needs to be transformed from:
10545 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10546 into
10547 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10553 /* Create pointer to appropriate size. */
10557 /* Convert object pointer to required type. */
10561 /* Convert expected pointer to required type. */
10565 /* Convert desired value to required type, and dereference it. */
10570 /* The rest of the parameters are fine. NULL means no special return value
10571 processing.*/
10574 }
10577 /* This will process an __atomic_load function call, determine whether it
10578 needs to be mapped to the _N variation, or turned into a library call.
10579 LOC is the location of the builtin call.
10580 FUNCTION is the DECL that has been invoked;
10581 PARAMS is the argument list for the call. The return value is non-null
10582 TRUE is returned if it is translated into the proper format for a call to the
10583 external library, and NEW_RETURN is set the tree for that function.
10584 FALSE is returned if processing for the _N variation is required, and
10585 NEW_RETURN is set to the the return value the result is copied into. */
10587 static bool
10590 {
10595 /* Size of 0 is an error condition. */
10597 {
10600 }
10602 /* If not a lock-free size, change to the library generic format. */
10604 {
10607 }
10609 /* Otherwise, there is a match, so the call needs to be transformed from:
10610 void fn(T* mem, T* return, model)
10611 into
10612 *return = (T) (fn ((In *) mem, model)) */
10618 /* Create pointer to appropriate size. */
10622 /* Convert object pointer to required type. */
10626 /* Move memory model to the 2nd position, and end param list. */
10630 /* Convert return pointer and dereference it for later assignment. */
10634 }
10637 /* This will process an __atomic_store function call, determine whether it
10638 needs to be mapped to the _N variation, or turned into a library call.
10639 LOC is the location of the builtin call.
10640 FUNCTION is the DECL that has been invoked;
10641 PARAMS is the argument list for the call. The return value is non-null
10642 TRUE is returned if it is translated into the proper format for a call to the
10643 external library, and NEW_RETURN is set the tree for that function.
10644 FALSE is returned if processing for the _N variation is required, and
10645 NEW_RETURN is set to the the return value the result is copied into. */
10647 static bool
10650 {
10655 /* Size of 0 is an error condition. */
10657 {
10660 }
10662 /* If not a lock-free size, change to the library generic format. */
10664 {
10667 }
10669 /* Otherwise, there is a match, so the call needs to be transformed from:
10670 void fn(T* mem, T* value, model)
10671 into
10672 fn ((In *) mem, (In) *value, model) */
10677 /* Create pointer to appropriate size. */
10681 /* Convert object pointer to required type. */
10685 /* Convert new value to required type, and dereference it. */
10690 /* The memory model is in the right spot already. Return is void. */
10694 }
10697 /* Some builtin functions are placeholders for other expressions. This
10698 function should be called immediately after parsing the call expression
10699 before surrounding code has committed to the type of the expression.
10701 LOC is the location of the builtin call.
10703 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10704 PARAMS is the argument list for the call. The return value is non-null
10705 when expansion is complete, and null if normal processing should
10706 continue. */
10708 tree
10711 {
10717 {
10723 else
10727 }
10729 /* Handle BUILT_IN_NORMAL here. */
10731 {
10736 {
10737 /* Handle these 4 together so that they can fall through to the next
10738 case if the call is transformed to an _N variant. */
10740 {
10742 {
10746 /* Change to the _N variant. */
10749 }
10752 {
10754 params,
10757 /* Change to the _N variant. */
10760 }
10762 {
10766 /* Change to the _N variant. */
10769 }
10771 {
10775 /* Change to the _N variant. */
10778 }
10781 }
10782 /* Fallthrough to the normal processing. */
10783 }
10800 {
10802 /* Fallthru for parameter processing. */
10803 }
10820 {
10831 orig_format))
10843 /* If new_return is set, assign function to that expr and cast the
10844 result to void since the generic interface returned void. */
10846 {
10847 /* Cast function result from I{1,2,4,8,16} to the required type. */
10850 result);
10854 }
10856 }
10860 }
10861 }
10863 /* vector_types_compatible_elements_p is used in type checks of vectors
10864 values used as operands of binary operators. Where it returns true, and
10865 the other checks of the caller succeed (being vector types in he first
10866 place, and matching number of elements), we can just treat the types
10867 as essentially the same.
10868 Contrast with vector_targets_convertible_p, which is used for vector
10869 pointer types, and vector_types_convertible_p, which will allow
10870 language-specific matches under the control of flag_lax_vector_conversions,
10871 and might still require a conversion. */
10872 /* True if vector types T1 and T2 can be inputs to the same binary
10873 operator without conversion.
10874 We don't check the overall vector size here because some of our callers
10875 want to give different error messages when the vectors are compatible
10876 except for the element count. */
10878 bool
10880 {
10893 /* Equality works here because c_common_signed_type uses
10894 TYPE_MAIN_VARIANT. */
10902 }
10904 /* Check for missing format attributes on function pointers. LTYPE is
10905 the new type or left-hand side type. RTYPE is the old type or
10906 right-hand side type. Returns TRUE if LTYPE is missing the desired
10907 attribute. */
10909 bool
10911 {
10913 tree ra;
10919 {
10920 tree la;
10925 }
10926 else
10928 }
10930 /* Subscripting with type char is likely to lose on a machine where
10931 chars are signed. So warn on any machine, but optionally. Don't
10932 warn for unsigned char since that type is safe. Don't warn for
10933 signed char because anyone who uses that must have done so
10934 deliberately. Furthermore, we reduce the false positive load by
10935 warning only for non-constant value of type char. */
10937 void
10939 {
10943 }
10945 /* Implement -Wparentheses for the unexpected C precedence rules, to
10946 cover cases like x + y << z which readers are likely to
10947 misinterpret. We have seen an expression in which CODE is a binary
10948 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10949 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10950 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10951 expression was not formed using a binary or unary operator, or it
10952 was enclosed in parentheses. */
10954 void
10958 {
10962 /* This macro tests that the expression ARG with original tree code
10963 CODE appears to be a boolean expression. or the result of folding a
10964 boolean expression. */
10965 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10966 (truth_value_p (TREE_CODE (ARG)) \
10967 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10969 || ((CODE) != INTEGER_CST \
10970 && (integer_onep (ARG) || integer_zerop (ARG))))
10973 {
11022 /* Check cases like x|y==z */
11029 /* Check cases like !x | y */
11033 "suggest parentheses around operand of "
11046 /* Check cases like x^y==z */
11068 /* Check cases like x&y==z */
11075 /* Check cases like !x & y */
11079 "suggest parentheses around operand of "
11102 {
11107 "comparisons like %<X<=Y<=Z%> do not "
11113 "comparisons like %<X<=Y<=Z%> do not "
11115 }
11117 }
11118 #undef NOT_A_BOOLEAN_EXPR_P
11119 }
11121 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11123 void
11125 {
11127 {
11130 else
11132 }
11133 }
11135 /* Warn for division by zero according to the value of DIVISOR. LOC
11136 is the location of the division operator. */
11138 void
11140 {
11141 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11142 about division by zero. Do not issue a warning if DIVISOR has a
11143 floating-point type, since we consider 0.0/0.0 a valid way of
11144 generating a NaN. */
11148 }
11150 /* Subroutine of build_binary_op. Give warnings for comparisons
11151 between signed and unsigned quantities that may fail. Do the
11152 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11153 so that casts will be considered, but default promotions won't
11154 be.
11156 LOCATION is the location of the comparison operator.
11158 The arguments of this function map directly to local variables
11159 of build_binary_op. */
11161 void
11166 {
11171 /* In C++, check for comparison of different enum types. */
11177 {
11181 }
11183 /* Do not warn if the comparison is being done in a signed type,
11184 since the signed type will only be chosen if it can represent
11185 all the values of the unsigned type. */
11188 /* Do not warn if both operands are unsigned. */
11191 else
11192 {
11198 else
11206 /* Do not warn if the signed quantity is an unsuffixed integer
11207 literal (or some static constant expression involving such
11208 literals or a conditional expression involving such literals)
11209 and it is non-negative. */
11212 /* Do not warn if the comparison is an equality operation, the
11213 unsigned quantity is an integral constant, and it would fit
11214 in the result if the result were signed. */
11219 /* In C, do not warn if the unsigned quantity is an enumeration
11220 constant and its maximum value would fit in the result if the
11221 result were signed. */
11227 else
11229 OPT_Wsign_compare,
11231 }
11233 /* Warn if two unsigned values are being compared in a size larger
11234 than their original size, and one (and only one) is the result of
11235 a `~' operator. This comparison will always fail.
11237 Also warn if one operand is a constant, and the constant does not
11238 have all bits set that are set in the ~ operand when it is
11239 extended. */
11246 {
11253 {
11254 tree primop;
11260 {
11264 }
11265 else
11266 {
11270 }
11275 {
11278 {
11282 else
11285 }
11286 }
11287 }
11295 }
11296 }
11298 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11299 type via c_common_type. If -Wdouble-promotion is in use, and the
11300 conditions for warning have been met, issue a warning. GMSGID is
11301 the warning message. It must have two %T specifiers for the type
11302 that was converted (generally "float") and the type to which it was
11303 converted (generally "double), respectively. LOC is the location
11304 to which the awrning should refer. */
11306 void
11309 {
11310 tree source_type;
11314 /* If the conversion will not occur at run-time, there is no need to
11315 warn about it. */
11327 else
11330 }
11332 /* Setup a TYPE_DECL node as a typedef representation.
11334 X is a TYPE_DECL for a typedef statement. Create a brand new
11335 ..._TYPE node (which will be just a variant of the existing
11336 ..._TYPE node with identical properties) and then install X
11337 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11339 The whole point here is to end up with a situation where each
11340 and every ..._TYPE node the compiler creates will be uniquely
11341 associated with AT MOST one node representing a typedef name.
11342 This way, even though the compiler substitutes corresponding
11343 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11344 early on, later parts of the compiler can always do the reverse
11345 translation and get back the corresponding typedef name. For
11346 example, given:
11348 typedef struct S MY_TYPE;
11349 MY_TYPE object;
11351 Later parts of the compiler might only know that `object' was of
11352 type `struct S' if it were not for code just below. With this
11353 code however, later parts of the compiler see something like:
11355 struct S' == struct S
11356 typedef struct S' MY_TYPE;
11357 struct S' object;
11359 And they can then deduce (from the node for type struct S') that
11360 the original object declaration was:
11362 MY_TYPE object;
11364 Being able to do this is important for proper support of protoize,
11365 and also for generating precise symbolic debugging information
11366 which takes full account of the programmer's (typedef) vocabulary.
11368 Obviously, we don't want to generate a duplicate ..._TYPE node if
11369 the TYPE_DECL node that we are now processing really represents a
11370 standard built-in type. */
11372 void
11374 {
11378 {
11381 }
11384 {
11392 }
11393 }
11395 /* Record the types used by the current global variable declaration
11396 being parsed, so that we can decide later to emit their debug info.
11397 Those types are in types_used_by_cur_var_decl, and we are going to
11398 store them in the types_used_by_vars_hash hash table.
11399 DECL is the declaration of the global variable that has been parsed. */
11401 void
11403 {
11407 {
11410 }
11411 }
11413 /* If DECL is a typedef that is declared in the current function,
11414 record it for the purpose of -Wunused-local-typedefs. */
11416 void
11418 {
11423 /* if this is not a locally defined typedef then we are not
11424 interested. */
11431 }
11433 /* If T is a TYPE_DECL declared locally, mark it as used. */
11435 void
11437 {
11442 }
11444 /* Warn if there are some unused locally defined typedefs in the
11445 current function. */
11447 void
11449 {
11451 tree decl;
11452 /* The number of times we have emitted -Wunused-local-typedefs
11453 warnings. If this is different from errorcount, that means some
11454 unrelated errors have been issued. In which case, we'll avoid
11455 emitting "unused-local-typedefs" warnings. */
11467 {
11471 OPT_Wunused_local_typedefs,
11474 }
11477 }
11479 /* The C and C++ parsers both use vectors to hold function arguments.
11480 For efficiency, we keep a cache of unused vectors. This is the
11481 cache. */
11486 /* Return a new vector from the cache. If the cache is empty,
11487 allocate a new vector. These vectors are GC'ed, so it is OK if the
11488 pointer is not released.. */
11492 {
11495 else
11496 {
11497 /* Passing 0 to vec::alloc returns NULL, and our callers require
11498 that we always return a non-NULL value. The vector code uses
11499 4 when growing a NULL vector, so we do too. */
11503 }
11504 }
11506 /* Release a vector of trees back to the cache. */
11508 void
11510 {
11512 {
11515 }
11516 }
11518 /* Get a new tree vector holding a single tree. */
11522 {
11526 }
11528 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11532 {
11537 }
11539 /* Get a new tree vector which is a copy of an existing one. */
11543 {
11546 tree t;
11553 }
11555 /* Return true if KEYWORD starts a type specifier. */
11557 bool
11559 {
11561 {
11592 }
11593 }
11595 /* Return true if KEYWORD names a type qualifier. */
11597 bool
11599 {
11601 {
11609 }
11610 }
11612 /* Return true if KEYWORD names a storage class specifier.
11614 RID_TYPEDEF is not included in this list despite `typedef' being
11615 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11616 such for syntactic convenience only. */
11618 bool
11620 {
11622 {
11632 }
11633 }
11635 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11637 static bool
11639 {
11641 {
11649 }
11650 }
11652 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11653 declaration-specifier (C99 6.7). */
11655 bool
11657 {
11664 {
11671 }
11672 }
11674 /* Initialize language-specific-bits of tree_contains_struct. */
11676 void
11678 {
11682 }
11684 /* Build a user-defined numeric literal out of an integer constant type VALUE
11685 with identifier SUFFIX. */
11687 tree
11690 {
11697 }
11699 /* For vector[index], convert the vector to a
11700 pointer of the underlying type. */
11701 void
11704 {
11706 {
11708 tree type1;
11722 }
11723 }
11725 /* Determine which of the operands, if any, is a scalar that needs to be
11726 converted to a vector, for the range of operations. */
11727 enum stv_conv
11730 {
11739 {
11740 /* Most GENERIC binary expressions require homogeneous arguments.
11741 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11742 argument that is a vector and a second one that is a scalar, so
11743 we never return stv_secondarg for them. */
11748 {
11750 {
11755 }
11756 else
11758 }
11765 /* ... fall through ... */
11786 /* What about UNLT_EXPR? */
11788 {
11789 tree tmp;
11791 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11794 }
11798 {
11800 {
11805 }
11807 }
11809 /* Allow integer --> real conversion if safe. */
11813 {
11815 {
11820 }
11822 }
11825 }
11828 }
11830 /* Return true iff ALIGN is an integral constant that is a fundamental
11831 alignment, as defined by [basic.align] in the c++-11
11832 specifications.
11834 That is:
11836 [A fundamental alignment is represented by an alignment less than or
11837 equal to the greatest alignment supported by the implementation
11838 in all contexts, which is equal to
11839 alignof(max_align_t)]. */
11841 bool
11843 {
11846 }