| blob | 4e2654ab6d04813338d44f3b47d6b6801e020206 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
49 /* The following symbols are subsumed in the c_global_trees array, and
50 listed here individually for documentation purposes.
52 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
54 tree short_integer_type_node;
55 tree long_integer_type_node;
56 tree long_long_integer_type_node;
57 tree int128_integer_type_node;
59 tree short_unsigned_type_node;
60 tree long_unsigned_type_node;
61 tree long_long_unsigned_type_node;
62 tree int128_unsigned_type_node;
64 tree truthvalue_type_node;
65 tree truthvalue_false_node;
66 tree truthvalue_true_node;
68 tree ptrdiff_type_node;
70 tree unsigned_char_type_node;
71 tree signed_char_type_node;
72 tree wchar_type_node;
74 tree char16_type_node;
75 tree char32_type_node;
77 tree float_type_node;
78 tree double_type_node;
79 tree long_double_type_node;
81 tree complex_integer_type_node;
82 tree complex_float_type_node;
83 tree complex_double_type_node;
84 tree complex_long_double_type_node;
86 tree dfloat32_type_node;
87 tree dfloat64_type_node;
88 tree_dfloat128_type_node;
90 tree intQI_type_node;
91 tree intHI_type_node;
92 tree intSI_type_node;
93 tree intDI_type_node;
94 tree intTI_type_node;
96 tree unsigned_intQI_type_node;
97 tree unsigned_intHI_type_node;
98 tree unsigned_intSI_type_node;
99 tree unsigned_intDI_type_node;
100 tree unsigned_intTI_type_node;
102 tree widest_integer_literal_type_node;
103 tree widest_unsigned_literal_type_node;
105 Nodes for types `void *' and `const void *'.
107 tree ptr_type_node, const_ptr_type_node;
109 Nodes for types `char *' and `const char *'.
111 tree string_type_node, const_string_type_node;
113 Type `char[SOMENUMBER]'.
114 Used when an array of char is needed and the size is irrelevant.
116 tree char_array_type_node;
118 Type `int[SOMENUMBER]' or something like it.
119 Used when an array of int needed and the size is irrelevant.
121 tree int_array_type_node;
123 Type `wchar_t[SOMENUMBER]' or something like it.
124 Used when a wide string literal is created.
126 tree wchar_array_type_node;
128 Type `char16_t[SOMENUMBER]' or something like it.
129 Used when a UTF-16 string literal is created.
131 tree char16_array_type_node;
133 Type `char32_t[SOMENUMBER]' or something like it.
134 Used when a UTF-32 string literal is created.
136 tree char32_array_type_node;
138 Type `int ()' -- used for implicit declaration of functions.
140 tree default_function_type;
142 A VOID_TYPE node, packaged in a TREE_LIST.
144 tree void_list_node;
146 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
147 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
148 VAR_DECLS, but C++ does.)
150 tree function_name_decl_node;
151 tree pretty_function_name_decl_node;
152 tree c99_function_name_decl_node;
154 Stack of nested function name VAR_DECLs.
156 tree saved_function_name_decls;
158 */
161 \f
162 /* Switches common to the C front ends. */
164 /* Nonzero means don't output line number information. */
168 /* Nonzero causes -E output not to be done, but directives such as
169 #define that have side effects are still obeyed. */
173 /* Nonzero means dump macros in some fashion. */
177 /* Nonzero means pass #include lines through to the output. */
181 /* Nonzero means process PCH files while preprocessing. */
185 /* The file name to which we should write a precompiled header, or
186 NULL if no header will be written in this compile. */
190 /* Nonzero if an ISO standard was selected. It rejects macros in the
191 user's namespace. */
194 /* Nonzero whenever UPC -fupc-threads-N is asserted.
195 The value N gives the number of UPC threads to be
196 defined at compile-time. */
199 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
202 /* The implementation model for UPC threads that
203 are mapped to POSIX threads, specified at compilation
204 time by the -fupc-pthreads-model-* switch. */
205 upc_pthreads_model_kind upc_pthreads_model;
207 /* C/ObjC language option variables. */
210 /* Nonzero means allow type mismatches in conditional expressions;
211 just make their values `void'. */
215 /* Nonzero means enable C89 Amendment 1 features. */
219 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
223 /* Nonzero means use the ISO C11 dialect of C. */
227 /* Nonzero means that we have builtin functions, and main is an int. */
232 /* ObjC language option variables. */
235 /* Tells the compiler that this is a special run. Do not perform any
236 compiling, instead we are to test some platform dependent features
237 and output a C header file with appropriate definitions. */
241 /* Tells the compiler what is the constant string class for ObjC. */
246 /* C++ language option variables. */
249 /* Nonzero means generate separate instantiation control files and
250 juggle them at link time. */
254 /* The C++ dialect being used. C++98 is the default. */
258 /* Maximum template instantiation depth. This limit exists to limit the
259 time it takes to notice excessively recursive template instantiations.
261 The default is lower than the 1024 recommended by the C++0x standard
262 because G++ runs out of stack before 1024 with highly recursive template
263 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
267 /* The elements of `ridpointers' are identifier nodes for the reserved
268 type names and storage classes. It is indexed by a RID_... value. */
273 /* Nonzero means don't warn about problems that occur when the code is
274 executed. */
277 /* Whether we are building a boolean conversion inside
278 convert_for_assignment, or some other late binary operation. If
279 build_binary_op is called for C (from code shared by C and C++) in
280 this case, then the operands have already been folded and the
281 result will not be folded again, so C_MAYBE_CONST_EXPR should not
282 be generated. */
285 /* Whether lexing has been completed, so subsequent preprocessor
286 errors should use the compiler's input_location. */
289 /* Information about how a function name is generated. */
290 struct fname_var_t
291 {
295 };
297 /* The three ways of getting then name of the current function. */
300 {
301 /* C99 compliant __func__, must be first. */
303 /* GCC __FUNCTION__ compliant. */
305 /* GCC __PRETTY_FUNCTION__ compliant. */
308 };
310 /* Global visibility options. */
401 /* Reserved words. The third field is a mask: keywords are disabled
402 if they match the mask.
404 Masks for languages:
405 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
406 C --std=c99: D_CXXONLY | D_OBJC
407 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
408 UPC is like C except that D_UPC is not set
409 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
410 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
411 ObjC++ is like C++ except that D_OBJC is not set
413 If -fno-asm is used, D_ASM is added to the mask. If
414 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
415 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
416 In C with -Wc++-compat, we warn if D_CXXWARN is set.
418 Note the complication of the D_CXX_OBJC keywords. These are
419 reserved words such as 'class'. In C++, 'class' is a reserved
420 word. In Objective-C++ it is too. In Objective-C, it is a
421 reserved word too, but only if it follows an '@' sign.
422 */
424 {
582 /* These Objective-C keywords are recognized only immediately after
583 an '@'. */
600 /* These are recognized only in protocol-qualifier context
601 (see above) */
609 /* UPC keywords */
621 /* These are recognized inside a property attribute list */
630 };
635 /* Table of machine-independent attributes common to all C-like languages. */
637 {
638 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
639 affects_type_identity } */
646 /* FIXME: logically, noreturn attributes should be listed as
647 "false, true, true" and apply to function types. But implementing this
648 would require all the places in the compiler that use TREE_THIS_VOLATILE
649 on a decl to identify non-returning functions to be located and fixed
650 to check the function type instead. */
675 /* The same comments as for noreturn attributes apply to const ones. */
699 handle_no_instrument_function_attribute,
717 /* ??? These two attributes didn't make the transition from the
718 Intel language document to the multi-vendor language document. */
723 /* For internal use (marking of builtins) only. The name contains space
724 to prevent its usage in source code. */
746 /* For internal use (marking of builtins) only. The name contains space
747 to prevent its usage in source code. */
758 handle_no_address_safety_analysis_attribute,
761 handle_no_sanitize_address_attribute,
764 handle_no_sanitize_undefined_attribute,
774 /* For internal use only. The leading '*' both prevents its usage in
775 source code and signals that it may be overridden by machine tables. */
780 /* For internal use (marking of builtins and runtime functions) only.
781 The name contains space to prevent its usage in source code. */
797 };
799 /* Give the specifications for the format attributes, used by C and all
800 descendants. */
803 {
804 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
805 affects_type_identity } */
811 };
813 /* Return identifier for address space AS. */
817 {
821 }
823 /* Push current bindings for the function name VAR_DECLS. */
825 void
827 {
832 {
836 {
838 saved);
840 }
841 }
843 /* Normally they'll have been NULL, so only push if we've got a
844 stack, or they are non-NULL. */
846 saved_function_name_decls);
847 }
849 /* Finish up the current bindings, adding them into the current function's
850 statement tree. This must be done _before_ finish_stmt_tree is called.
851 If there is no current function, we must be at file scope and no statements
852 are involved. Pop the previous bindings. */
854 void
856 {
865 {
873 }
879 {
880 /* We had saved values, restore them. */
881 tree saved;
884 {
889 }
891 }
893 }
895 /* Return the text name of the current function, suitably prettified
896 by PRETTY_P. Return string must be freed by caller. */
900 {
907 {
910 }
923 {
926 }
929 }
931 /* Return the VAR_DECL for a const char array naming the current
932 function. If the VAR_DECL has not yet been created, create it
933 now. RID indicates how it should be formatted and IDENTIFIER_NODE
934 ID is its name (unfortunately C and C++ hold the RID values of
935 keywords in different places, so we can't derive RID from ID in
936 this language independent code. LOC is the location of the
937 function. */
939 tree
941 {
951 {
952 /* If a tree is built here, it would normally have the lineno of
953 the current statement. Later this tree will be moved to the
954 beginning of the function and this line number will be wrong.
955 To avoid this problem set the lineno to 0 here; that prevents
956 it from appearing in the RTL. */
957 tree stmts;
965 saved_function_name_decls
969 }
974 }
976 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
978 tree
980 {
985 /* Compute the number of elements, for the array type. */
987 {
990 }
992 {
995 }
997 {
1000 }
1001 else
1002 {
1005 }
1007 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1008 limit in C++98 Annex B is very large (65536) and is not normative,
1009 so we do not diagnose it (warn_overlength_strings is forced off
1010 in c_common_post_options). */
1012 {
1016 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1017 separate the %d from the 'C'. 'ISO' should not be
1018 translated, but it may be moved after 'C%d' in languages
1019 where modifiers follow nouns. */
1021 "string length %qd is greater than the length %qd "
1024 }
1026 /* Create the array type for the string constant. The ISO C++
1027 standard says that a string literal has type `const char[N]' or
1028 `const wchar_t[N]'. We use the same logic when invoked as a C
1029 front-end with -Wwrite-strings.
1030 ??? We should change the type of an expression depending on the
1031 state of a warning flag. We should just be warning -- see how
1032 this is handled in the C++ front-end for the deprecated implicit
1033 conversion from string literals to `char*' or `wchar_t*'.
1035 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1036 array type being the unqualified version of that type.
1037 Therefore, if we are constructing an array of const char, we must
1038 construct the matching unqualified array type first. The C front
1039 end does not require this, but it does no harm, so we do it
1040 unconditionally. */
1051 }
1052 \f
1053 /* If DISABLE is true, stop issuing warnings. This is used when
1054 parsing code that we know will not be executed. This function may
1055 be called multiple times, and works as a stack. */
1057 static void
1059 {
1061 {
1064 }
1065 }
1067 /* If ENABLE is true, reenable issuing warnings. */
1069 static void
1071 {
1073 {
1076 }
1077 }
1079 /* Fully fold EXPR, an expression that was not folded (beyond integer
1080 constant expressions and null pointer constants) when being built
1081 up. If IN_INIT, this is in a static initializer and certain
1082 changes are made to the folding done. Clear *MAYBE_CONST if
1083 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1084 expression because it contains an evaluated operator (in C99) or an
1085 operator outside of sizeof returning an integer constant (in C90)
1086 not permitted in constant expressions, or because it contains an
1087 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1088 set to true by callers before calling this function.) Return the
1089 folded expression. Function arguments have already been folded
1090 before calling this function, as have the contents of SAVE_EXPR,
1091 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1092 C_MAYBE_CONST_EXPR. */
1094 tree
1096 {
1097 tree ret;
1103 /* This function is not relevant to C++ because C++ folds while
1104 parsing, and may need changes to be correct for C++ when C++
1105 stops folding while parsing. */
1112 {
1115 }
1122 }
1124 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1125 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1126 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1127 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1128 both evaluated and unevaluated subexpressions while
1129 *MAYBE_CONST_ITSELF is carried from only evaluated
1130 subexpressions). */
1132 static tree
1135 {
1147 /* This function is not relevant to C++ because C++ folds while
1148 parsing, and may need changes to be correct for C++ when C++
1149 stops folding while parsing. */
1153 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1154 anything else not counted as an expression cannot usefully be
1155 folded further at this point. */
1161 /* Operands of variable-length expressions (function calls) have
1162 already been folded, as have __builtin_* function calls, and such
1163 expressions cannot occur in constant expressions. */
1165 {
1169 }
1172 {
1181 else
1184 }
1186 /* Assignment, increment, decrement, function call and comma
1187 operators, and statement expressions, cannot occur in constant
1188 expressions if evaluated / outside of sizeof. (Function calls
1189 were handled above, though VA_ARG_EXPR is treated like a function
1190 call here, and statement expressions are handled through
1191 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1193 {
1213 }
1215 /* Fold individual tree codes as appropriate. */
1217 {
1219 /* Any non-constancy will have been marked in a containing
1220 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1228 maybe_const_itself);
1233 {
1236 }
1245 maybe_const_itself);
1248 maybe_const_itself);
1254 {
1258 }
1300 /* Binary operations evaluating both arguments (increment and
1301 decrement are binary internally in GCC). */
1305 maybe_const_itself);
1313 /* The RHS of a MODIFY_EXPR was fully folded when building that
1314 expression for the sake of conversion warnings. */
1317 maybe_const_itself);
1321 ret = in_init
1324 else
1337 {
1348 }
1354 CASE_CONVERT:
1364 /* Unary operations. */
1367 maybe_const_itself);
1371 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1372 not prepared to deal with them if they occur in initializers.
1373 Avoid attempts to fold references to UPC shared components
1374 due to the complexities of UPC pointer-to-shared arithmetic. */
1383 ret = in_init
1386 else
1391 {
1395 }
1397 {
1400 CASE_CONVERT:
1401 /* Don't warn about explicit conversions. We will already
1402 have warned about suspect implicit conversions. */
1409 }
1414 /* Binary operations not necessarily evaluating both
1415 arguments. */
1422 ? truthvalue_false_node
1430 ret = in_init
1433 else
1438 && op0_const
1439 && op0_const_self
1445 && op0_const_self
1471 else
1476 && op0_const
1477 && op0_const_self
1481 && op0_const_self
1485 && op0_const
1486 && op0_const_self
1490 && op0_const_self
1496 /* Each case where an operand with excess precision may be
1497 encountered must remove the EXCESS_PRECISION_EXPR around
1498 inner operands and possibly put one around the whole
1499 expression or possibly convert to the semantic type (which
1500 c_fully_fold does); we cannot tell at this stage which is
1501 appropriate in any particular case. */
1505 /* Various codes may appear through folding built-in functions
1506 and their arguments. */
1508 }
1510 out:
1511 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1512 have been done by this point, so remove them again. */
1516 {
1520 }
1524 }
1526 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1527 return EXP. Otherwise, return either EXP or its known constant
1528 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1529 Is the BLKmode test appropriate? */
1531 tree
1533 {
1534 tree ret;
1536 /* This function is only used by C, for c_fully_fold and other
1537 optimization, and may not be correct for C++. */
1548 /* Avoid unwanted tree sharing between the initializer and current
1549 function's body where the tree can be modified e.g. by the
1550 gimplifier. */
1554 }
1556 /* Print a warning if a constant expression had overflow in folding.
1557 Invoke this function on every expression that the language
1558 requires to be a constant expression.
1559 Note the ANSI C standard says it is erroneous for a
1560 constant expression to overflow. */
1562 void
1564 {
1572 }
1574 /* The same as above but print an unconditional error. */
1575 void
1577 {
1584 }
1586 /* Print a warning if an expression had overflow in folding and its
1587 operands hadn't.
1589 Invoke this function on every expression that
1590 (1) appears in the source code, and
1591 (2) is a constant expression that overflowed, and
1592 (3) is not already checked by convert_and_check;
1593 however, do not invoke this function on operands of explicit casts
1594 or when the expression is the result of an operator and any operand
1595 already overflowed. */
1597 void
1599 {
1604 {
1633 }
1634 }
1636 /* Warn about uses of logical || / && operator in a context where it
1637 is likely that the bitwise equivalent was intended by the
1638 programmer. We have seen an expression in which CODE is a binary
1639 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1640 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1641 void
1645 {
1657 /* Warn if &&/|| are being used in a context where it is
1658 likely that the bitwise equivalent was intended by the
1659 programmer. That is, an expression such as op && MASK
1660 where op should not be any boolean expression, nor a
1661 constant, and mask seems to be a non-boolean integer constant. */
1669 {
1673 else
1678 }
1680 /* We do not warn for constants because they are typical of macro
1681 expansions that test for features. */
1685 /* This warning only makes sense with logical operands. */
1693 /* We first test whether either side separately is trivially true
1694 (with OR) or trivially false (with AND). If so, do not warn.
1695 This is a common idiom for testing ranges of data types in
1696 portable code. */
1703 /* If this is an OR operation, invert both sides; now, the result
1704 should be always false to get a warning. */
1718 /* If this is an OR operation, invert both sides; now, the result
1719 should be always false to get a warning. */
1727 /* If both expressions have the same operand, if we can merge the
1728 ranges, and if the range test is always false, then warn. */
1735 {
1738 "logical %<or%> "
1740 else
1742 "logical %<and%> "
1744 }
1745 }
1748 /* Warn if EXP contains any computations whose results are not used.
1749 Return true if a warning is printed; false otherwise. LOCUS is the
1750 (potential) location of the expression. */
1752 bool
1754 {
1755 restart:
1759 /* Don't warn about void constructs. This includes casting to void,
1760 void function calls, and statement expressions with a final cast
1761 to void. */
1769 {
1785 /* For a binding, warn if no side effect within it. */
1797 /* In && or ||, warn if 2nd operand has no side effect. */
1804 /* Let people do `(foo (), 0)' without a warning. */
1811 /* If this is an expression with side effects, don't warn; this
1812 case commonly appears in macro expansions. */
1818 /* Don't warn about automatic dereferencing of references, since
1819 the user cannot control it. */
1821 {
1824 }
1825 /* Fall through. */
1828 /* Referencing a volatile value is a side effect, so don't warn. */
1833 /* If this is an expression which has no operands, there is no value
1834 to be unused. There are no such language-independent codes,
1835 but front ends may define such. */
1839 warn:
1841 }
1842 }
1845 /* Print a warning about casts that might indicate violation
1846 of strict aliasing rules if -Wstrict-aliasing is used and
1847 strict aliasing mode is in effect. OTYPE is the original
1848 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1850 bool
1852 {
1853 /* Strip pointer conversion chains and get to the correct original type. */
1861 /* If the type we are casting to is a ref-all pointer
1862 dereferencing it is always valid. */
1869 {
1870 /* Casting the address of an object to non void pointer. Warn
1871 if the cast breaks type based aliasing. */
1873 {
1877 }
1878 else
1879 {
1880 /* warn_strict_aliasing >= 3. This includes the default (3).
1881 Only warn if the cast is dereferenced immediately. */
1882 alias_set_type set1 =
1888 {
1892 }
1895 {
1899 }
1900 }
1901 }
1902 else
1904 {
1905 /* At this level, warn for any conversions, even if an address is
1906 not taken in the same statement. This will likely produce many
1907 false positives, but could be useful to pinpoint problems that
1908 are not revealed at higher levels. */
1913 {
1917 }
1918 }
1921 }
1923 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1924 sizeof as last operand of certain builtins. */
1926 void
1930 {
1934 location_t loc;
1942 {
1946 /* FALLTHRU */
1954 /* FALLTHRU */
2013 }
2041 {
2045 {
2048 "argument to %<sizeof%> in %qD call is the same "
2049 "expression as the destination; did you mean to "
2055 "argument to %<sizeof%> in %qD call is the same "
2056 "expression as the destination; did you mean to "
2058 else
2060 "argument to %<sizeof%> in %qD call is the same "
2061 "expression as the destination; did you mean to "
2064 }
2067 && !strop
2070 {
2072 "argument to %<sizeof%> in %qD call is the same "
2073 "pointer type %qT as the destination; expected %qT "
2077 }
2078 }
2081 {
2085 {
2088 "argument to %<sizeof%> in %qD call is the same "
2089 "expression as the source; did you mean to "
2095 "argument to %<sizeof%> in %qD call is the same "
2096 "expression as the source; did you mean to "
2098 else
2100 "argument to %<sizeof%> in %qD call is the same "
2101 "expression as the source; did you mean to "
2104 }
2107 && !strop
2110 {
2112 "argument to %<sizeof%> in %qD call is the same "
2113 "pointer type %qT as the source; expected %qT "
2117 }
2118 }
2121 {
2125 {
2128 "argument to %<sizeof%> in %qD call is the same "
2129 "expression as the first source; did you mean to "
2135 "argument to %<sizeof%> in %qD call is the same "
2136 "expression as the first source; did you mean to "
2138 else
2140 "argument to %<sizeof%> in %qD call is the same "
2141 "expression as the first source; did you mean to "
2144 }
2147 && !strop
2150 {
2152 "argument to %<sizeof%> in %qD call is the same "
2153 "pointer type %qT as the first source; expected %qT "
2157 }
2158 }
2161 {
2165 {
2168 "argument to %<sizeof%> in %qD call is the same "
2169 "expression as the second source; did you mean to "
2175 "argument to %<sizeof%> in %qD call is the same "
2176 "expression as the second source; did you mean to "
2178 else
2180 "argument to %<sizeof%> in %qD call is the same "
2181 "expression as the second source; did you mean to "
2184 }
2187 && !strop
2190 {
2192 "argument to %<sizeof%> in %qD call is the same "
2193 "pointer type %qT as the second source; expected %qT "
2197 }
2198 }
2200 }
2202 /* Warn for unlikely, improbable, or stupid DECL declarations
2203 of `main'. */
2205 void
2207 {
2208 function_args_iterator iter;
2209 tree type;
2213 {
2214 /* XXX void_type_node belies the abstraction. */
2220 {
2242 "third argument of %q+D should probably be "
2245 }
2246 }
2248 /* It is intentional that this message does not mention the third
2249 argument because it's only mentioned in an appendix of the
2250 standard. */
2254 }
2256 /* vector_targets_convertible_p is used for vector pointer types. The
2257 callers perform various checks that the qualifiers are satisfactory,
2258 while OTOH vector_targets_convertible_p ignores the number of elements
2259 in the vectors. That's fine with vector pointers as we can consider,
2260 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2261 and that does not require and conversion of the pointer values.
2262 In contrast, vector_types_convertible_p and
2263 vector_types_compatible_elements_p are used for vector value types. */
2264 /* True if pointers to distinct types T1 and T2 can be converted to
2265 each other without an explicit cast. Only returns true for opaque
2266 vector types. */
2267 bool
2269 {
2276 }
2278 /* vector_types_convertible_p is used for vector value types.
2279 It could in principle call vector_targets_convertible_p as a subroutine,
2280 but then the check for vector type would be duplicated with its callers,
2281 and also the purpose of vector_targets_convertible_p would become
2282 muddled.
2283 Where vector_types_convertible_p returns true, a conversion might still be
2284 needed to make the types match.
2285 In contrast, vector_targets_convertible_p is used for vector pointer
2286 values, and vector_types_compatible_elements_p is used specifically
2287 in the context for binary operators, as a check if use is possible without
2288 conversion. */
2289 /* True if vector types T1 and T2 can be converted to each other
2290 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2291 can only be converted with -flax-vector-conversions yet that is not
2292 in effect, emit a note telling the user about that option if such
2293 a note has not previously been emitted. */
2294 bool
2296 {
2304 convertible_lax =
2319 {
2322 "conversions between vectors with differing "
2324 }
2327 }
2329 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2330 and have vector types, V0 has the same type as V1, and the number of
2331 elements of V0, V1, MASK is the same.
2333 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2334 called with two arguments. In this case implementation passes the
2335 first argument twice in order to share the same tree code. This fact
2336 could enable the mask-values being twice the vector length. This is
2337 an implementation accident and this semantics is not guaranteed to
2338 the user. */
2339 tree
2342 {
2343 tree ret;
2349 {
2352 }
2360 {
2365 }
2369 {
2373 }
2376 {
2381 }
2387 {
2390 "argument vector(s) and the mask vector should "
2393 }
2397 {
2402 }
2405 {
2406 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2412 else
2413 {
2416 }
2420 }
2430 }
2432 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2433 to integral type. */
2435 static tree
2437 {
2442 {
2443 /* C++0x scoped enumerations don't implicitly convert to integral
2444 type; if we stripped an explicit conversion to a larger type we
2445 need to replace it so common_type will still work. */
2449 }
2451 }
2453 /* This is a helper function of build_binary_op.
2455 For certain operations if both args were extended from the same
2456 smaller type, do the arithmetic in that type and then extend.
2458 BITWISE indicates a bitwise operation.
2459 For them, this optimization is safe only if
2460 both args are zero-extended or both are sign-extended.
2461 Otherwise, we might change the result.
2462 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2463 but calculated in (unsigned short) it would be (unsigned short)-1.
2464 */
2465 tree
2467 {
2471 tree type;
2473 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2474 excessive narrowing when we call get_narrower below. For
2475 example, suppose that OP0 is of unsigned int extended
2476 from signed char and that RESULT_TYPE is long long int.
2477 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2478 like
2480 (long long int) (unsigned int) signed_char
2482 which get_narrower would narrow down to
2484 (unsigned int) signed char
2486 If we do not cast OP0 first, get_narrower would return
2487 signed_char, which is inconsistent with the case of the
2488 explicit cast. */
2495 /* UNS is 1 if the operation to be done is an unsigned one. */
2498 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2499 but it *requires* conversion to FINAL_TYPE. */
2510 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2512 /* For bitwise operations, signedness of nominal type
2513 does not matter. Consider only how operands were extended. */
2517 /* Note that in all three cases below we refrain from optimizing
2518 an unsigned operation on sign-extended args.
2519 That would not be valid. */
2521 /* Both args variable: if both extended in same way
2522 from same width, do it in that width.
2523 Do it unsigned if args were zero-extended. */
2530 return c_common_signed_or_unsigned_type
2537 && (type
2548 && (type
2556 }
2558 /* Checks if expression EXPR of real/integer type cannot be converted
2559 to the real/integer type TYPE. Function returns true when:
2560 * EXPR is a constant which cannot be exactly converted to TYPE
2561 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2562 for EXPR type and TYPE being both integers or both real.
2563 * EXPR is not a constant of real type and TYPE is an integer.
2564 * EXPR is not a constant of integer type which cannot be
2565 exactly converted to real type.
2566 Function allows conversions between types of different signedness and
2567 does not return true in that case. Function can produce signedness
2568 warnings if PRODUCE_WARNS is true. */
2569 bool
2571 {
2577 {
2578 /* Warn for real constant that is not an exact integer converted
2579 to integer type. */
2582 {
2585 }
2586 /* Warn for an integer constant that does not fit into integer type. */
2590 {
2593 {
2597 }
2599 {
2603 }
2604 else
2606 }
2608 {
2609 /* Warn for an integer constant that does not fit into real type. */
2611 {
2615 }
2616 /* Warn for a real constant that does not fit into a smaller
2617 real type. */
2620 {
2624 }
2625 }
2626 }
2627 else
2628 {
2629 /* Warn for real types converted to integer types. */
2636 {
2637 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2641 /* Don't warn for short y; short x = ((int)y & 0xff); */
2645 {
2646 /* If both args were extended from a shortest type,
2647 use that type if that is safe. */
2654 {
2660 /* If one of the operands is a non-negative constant
2661 that fits in the target type, then the type of the
2662 other operand does not matter. */
2671 /* If constant is unsigned and fits in the target
2672 type, then the result will also fit. */
2674 && unsigned0
2677 && unsigned1
2680 }
2681 }
2682 /* Warn for integer types converted to smaller integer types. */
2686 /* When they are the same width but different signedness,
2687 then the value may change. */
2690 /* Even when converted to a bigger type, if the type is
2691 unsigned but expr is signed, then negative values
2692 will be changed. */
2698 }
2700 /* Warn for integer types converted to real types if and only if
2701 all the range of values of the integer type cannot be
2702 represented by the real type. */
2705 {
2709 /* Don't warn about char y = 0xff; float x = (int) y; */
2721 }
2723 /* Warn for real types converted to smaller real types. */
2728 }
2731 }
2733 /* Warns if the conversion of EXPR to TYPE may alter a value.
2734 This is a helper function for warnings_for_convert_and_check. */
2736 static void
2738 {
2746 {
2759 /* Conversion from boolean to a signed:1 bit-field (which only
2760 can hold the values 0 and -1) doesn't lose information - but
2761 it does change the value. */
2776 {
2777 /* In case of COND_EXPR, we do not care about the type of
2778 COND_EXPR, only about the conversion of each operand. */
2785 }
2792 }
2793 }
2795 /* Produce warnings after a conversion. RESULT is the result of
2796 converting EXPR to TYPE. This is a helper function for
2797 convert_and_check and cp_convert_and_check. */
2799 void
2801 {
2808 {
2809 /* Do not diagnose overflow in a constant expression merely
2810 because a conversion overflowed. */
2815 {
2816 /* This detects cases like converting -129 or 256 to
2817 unsigned char. */
2821 else
2823 }
2827 /* No warning for converting 0x80000000 to int. */
2835 else
2837 }
2842 else
2844 }
2847 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2848 Invoke this function on every expression that is converted implicitly,
2849 i.e. because of language rules and not because of an explicit cast. */
2851 tree
2853 {
2854 tree result;
2855 tree expr_for_warning;
2857 /* Convert from a value with possible excess precision rather than
2858 via the semantic type, but do not warn about values not fitting
2859 exactly in the semantic type. */
2861 {
2867 }
2868 else
2882 }
2883 \f
2884 /* A node in a list that describes references to variables (EXPR), which are
2885 either read accesses if WRITER is zero, or write accesses, in which case
2886 WRITER is the parent of EXPR. */
2887 struct tlist
2888 {
2891 };
2893 /* Used to implement a cache the results of a call to verify_tree. We only
2894 use this for SAVE_EXPRs. */
2895 struct tlist_cache
2896 {
2900 tree expr;
2901 };
2903 /* Obstack to use when allocating tlist structures, and corresponding
2904 firstobj. */
2908 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2909 warnings. */
2911 /* SAVE_EXPRs need special treatment. We process them only once and then
2912 cache the results. */
2924 /* Create a new struct tlist and fill in its fields. */
2927 {
2934 }
2936 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2937 is nonnull, we ignore any node we find which has a writer equal to it. */
2939 static void
2941 {
2943 {
2950 }
2951 }
2953 /* Merge the nodes of ADD into TO. This merging process is done so that for
2954 each variable that already exists in TO, no new node is added; however if
2955 there is a write access recorded in ADD, and an occurrence on TO is only
2956 a read access, then the occurrence in TO will be modified to record the
2957 write. */
2959 static void
2961 {
2968 {
2975 {
2979 }
2981 {
2985 }
2987 }
2988 }
2990 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2991 references in list LIST conflict with it, excluding reads if ONLY writers
2992 is nonzero. */
2994 static void
2997 {
3000 /* Avoid duplicate warnings. */
3006 {
3010 {
3015 }
3017 }
3018 }
3020 /* Given a list LIST of references to variables, find whether any of these
3021 can cause conflicts due to missing sequence points. */
3023 static void
3025 {
3029 {
3032 }
3033 }
3035 /* Return nonzero if X is a tree that can be verified by the sequence point
3036 warnings. */
3037 static int
3039 {
3046 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3047 (lvalue_p) crash on TRY/CATCH. */
3054 /* No point to track non-const calls, they will never satisfy
3055 operand_equal_p. */
3063 }
3065 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3066 static bool
3068 {
3070 }
3072 /* Walk the tree X, and record accesses to variables. If X is written by the
3073 parent tree, WRITER is the parent.
3074 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3075 expression or its only operand forces a sequence point, then everything up
3076 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3077 in PNO_SP.
3078 Once we return, we will have emitted warnings if any subexpression before
3079 such a sequence point could be undefined. On a higher level, however, the
3080 sequence point may not be relevant, and we'll merge the two lists.
3082 Example: (b++, a) + b;
3083 The call that processes the COMPOUND_EXPR will store the increment of B
3084 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3085 processes the PLUS_EXPR will need to merge the two lists so that
3086 eventually, all accesses end up on the same list (and we'll warn about the
3087 unordered subexpressions b++ and b.
3089 A note on merging. If we modify the former example so that our expression
3090 becomes
3091 (b++, b) + a
3092 care must be taken not simply to add all three expressions into the final
3093 PNO_SP list. The function merge_tlist takes care of that by merging the
3094 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3095 way, so that no more than one access to B is recorded. */
3097 static void
3099 tree writer)
3100 {
3105 /* X may be NULL if it is the operand of an empty statement expression
3106 ({ }). */
3110 restart:
3118 {
3151 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3152 two first, to avoid warning for (a ? b++ : b++). */
3168 /* Expressions inside the LHS are not ordered wrt. the sequence points
3169 in the RHS. Example:
3170 *a = (a++, 2)
3171 Despite the fact that the modification of "a" is in the before_sp
3172 list (tmp_before), it conflicts with the use of "a" in the LHS.
3173 We can handle this by adding the contents of tmp_list3
3174 to those of tmp_before, and redoing the collision warnings for that
3175 list. */
3178 /* Exclude the LHS itself here; we first have to merge it into the
3179 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3180 didn't exclude the LHS, we'd get it twice, once as a read and once
3181 as a write. */
3192 /* We need to warn about conflicts among arguments and conflicts between
3193 args and the function address. Side effects of the function address,
3194 however, are not ordered by the sequence point of the call. */
3195 {
3196 call_expr_arg_iterator iter;
3197 tree arg;
3201 {
3206 }
3211 }
3214 /* Scan all the list, e.g. indices of multi dimensional array. */
3216 {
3222 }
3226 {
3233 {
3245 {
3249 }
3252 }
3256 }
3266 /* For other expressions, simply recurse on their operands.
3267 Manual tail recursion for unary expressions.
3268 Other non-expressions need not be processed. */
3270 {
3274 }
3276 {
3280 {
3285 }
3286 }
3288 }
3289 }
3291 /* Try to warn for undefined behavior in EXPR due to missing sequence
3292 points. */
3294 DEBUG_FUNCTION void
3296 {
3302 {
3305 }
3310 }
3311 \f
3312 /* Validate the expression after `case' and apply default promotions. */
3314 static tree
3316 {
3321 /* Promote char or short to int. */
3324 {
3327 }
3332 }
3333 \f
3334 /* See if the case values LOW and HIGH are in the range of the original
3335 type (i.e. before the default conversion to int) of the switch testing
3336 expression.
3337 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3338 the type before promoting it. CASE_LOW_P is a pointer to the lower
3339 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3340 if the case is not a case range.
3341 The caller has to make sure that we are not called with NULL for
3342 CASE_LOW_P (i.e. the default case).
3343 Returns true if the case label is in range of ORIG_TYPE (saturated or
3344 untouched) or false if the label is out of range. */
3346 static bool
3349 {
3354 /* If there was a problem with the original type, do nothing. */
3361 /* Case label is less than minimum for type. */
3364 {
3367 }
3369 /* Case value is greater than maximum for type. */
3372 {
3375 }
3377 /* Saturate lower case label value to minimum. */
3380 {
3384 }
3386 /* Saturate upper case label value to maximum. */
3389 {
3393 }
3401 }
3402 \f
3403 /* Return an integer type with BITS bits of precision,
3404 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3406 tree
3408 {
3447 }
3449 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3450 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3451 and saturating if SATP is nonzero, otherwise not saturating. */
3453 tree
3456 {
3460 else
3468 {
3470 "fixed-point types that have too many integral and "
3473 }
3476 }
3478 /* Used for communication between c_common_type_for_mode and
3479 c_register_builtin_type. */
3482 /* Return a data type that has machine mode MODE.
3483 If the mode is an integer,
3484 then UNSIGNEDP selects between signed and unsigned types.
3485 If the mode is a fixed-point mode,
3486 then UNSIGNEDP selects between saturating and nonsaturating types. */
3488 tree
3490 {
3491 tree t;
3528 #if HOST_BITS_PER_WIDE_INT >= 64
3531 #endif
3556 {
3558 tree inner_type;
3574 }
3576 {
3581 }
3591 {
3677 }
3685 }
3687 tree
3689 {
3691 }
3693 /* Return a signed type the same as TYPE in other respects. */
3695 tree
3697 {
3699 }
3701 /* Return a type the same as TYPE except unsigned or
3702 signed according to UNSIGNEDP. */
3704 tree
3706 {
3707 tree type1;
3709 /* This block of code emulates the behavior of the old
3710 c_common_unsigned_type. In particular, it returns
3711 long_unsigned_type_node if passed a long, even when a int would
3712 have the same size. This is necessary for warnings to work
3713 correctly in archs where sizeof(int) == sizeof(long) */
3716 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3732 #if HOST_BITS_PER_WIDE_INT >= 64
3735 #endif
3745 #define C_COMMON_FIXED_TYPES(NAME) \
3746 if (type1 == short_ ## NAME ## _type_node \
3747 || type1 == unsigned_short_ ## NAME ## _type_node) \
3748 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3749 : short_ ## NAME ## _type_node; \
3750 if (type1 == NAME ## _type_node \
3751 || type1 == unsigned_ ## NAME ## _type_node) \
3752 return unsignedp ? unsigned_ ## NAME ## _type_node \
3753 : NAME ## _type_node; \
3754 if (type1 == long_ ## NAME ## _type_node \
3755 || type1 == unsigned_long_ ## NAME ## _type_node) \
3756 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3757 : long_ ## NAME ## _type_node; \
3758 if (type1 == long_long_ ## NAME ## _type_node \
3759 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3760 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3761 : long_long_ ## NAME ## _type_node;
3763 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3764 if (type1 == NAME ## _type_node \
3765 || type1 == u ## NAME ## _type_node) \
3766 return unsignedp ? u ## NAME ## _type_node \
3767 : NAME ## _type_node;
3769 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3770 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3771 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3772 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3773 : sat_ ## short_ ## NAME ## _type_node; \
3774 if (type1 == sat_ ## NAME ## _type_node \
3775 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3776 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3777 : sat_ ## NAME ## _type_node; \
3778 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3779 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3780 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3781 : sat_ ## long_ ## NAME ## _type_node; \
3782 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3783 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3784 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3785 : sat_ ## long_long_ ## NAME ## _type_node;
3787 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3788 if (type1 == sat_ ## NAME ## _type_node \
3789 || type1 == sat_ ## u ## NAME ## _type_node) \
3790 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3791 : sat_ ## NAME ## _type_node;
3817 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3818 the precision; they have precision set to match their range, but
3819 may use a wider mode to match an ABI. If we change modes, we may
3820 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3821 the precision as well, so as to yield correct results for
3822 bit-field types. C++ does not have these separate bit-field
3823 types, and producing a signed or unsigned variant of an
3824 ENUMERAL_TYPE may cause other problems as well. */
3830 #define TYPE_OK(node) \
3831 (TYPE_MODE (type) == TYPE_MODE (node) \
3832 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3851 #if HOST_BITS_PER_WIDE_INT >= 64
3854 #endif
3863 #undef TYPE_OK
3866 }
3868 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3870 tree
3872 {
3873 /* Extended integer types of the same width as a standard type have
3874 lesser rank, so those of the same width as int promote to int or
3875 unsigned int and are valid for printf formats expecting int or
3876 unsigned int. To avoid such special cases, avoid creating
3877 extended integer types for bit-fields if a standard integer type
3878 is available. */
3895 }
3897 /* The C version of the register_builtin_type langhook. */
3899 void
3901 {
3902 tree decl;
3912 }
3913 \f
3914 /* Print an error message for invalid operands to arith operation
3915 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3916 LOCATION is the location of the message. */
3918 void
3921 {
3925 {
3970 }
3974 }
3975 \f
3976 /* Given an expression as a tree, return its original type. Do this
3977 by stripping any conversion that preserves the sign and precision. */
3978 static tree
3980 {
3983 }
3985 /* Subroutine of build_binary_op, used for comparison operations.
3986 See if the operands have both been converted from subword integer types
3987 and, if so, perhaps change them both back to their original type.
3988 This function is also responsible for converting the two operands
3989 to the proper common type for comparison.
3991 The arguments of this function are all pointers to local variables
3992 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3993 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3995 If this function returns nonzero, it means that the comparison has
3996 a constant value. What this function returns is an expression for
3997 that value. */
3999 tree
4002 {
4003 tree type;
4012 /* Throw away any conversions to wider types
4013 already present in the operands. */
4018 /* If primopN is first sign-extended from primopN's precision to opN's
4019 precision, then zero-extended from opN's precision to
4020 *restype_ptr precision, shortenings might be invalid. */
4023 && !unsignedp0
4028 && !unsignedp1
4032 /* Handle the case that OP0 does not *contain* a conversion
4033 but it *requires* conversion to FINAL_TYPE. */
4040 /* If one of the operands must be floated, we cannot optimize. */
4044 /* If first arg is constant, swap the args (changing operation
4045 so value is preserved), for canonicalization. Don't do this if
4046 the second arg is 0. */
4051 {
4068 {
4083 }
4085 }
4087 /* If comparing an integer against a constant more bits wide,
4088 maybe we can deduce a value of 1 or 0 independent of the data.
4089 Or else truncate the constant now
4090 rather than extend the variable at run time.
4092 This is only interesting if the constant is the wider arg.
4093 Also, it is not safe if the constant is unsigned and the
4094 variable arg is signed, since in this case the variable
4095 would be sign-extended and then regarded as unsigned.
4096 Our technique fails in this case because the lowest/highest
4097 possible unsigned results don't follow naturally from the
4098 lowest/highest possible values of the variable operand.
4099 For just EQ_EXPR and NE_EXPR there is another technique that
4100 could be used: see if the constant can be faithfully represented
4101 in the other operand's type, by truncating it and reextending it
4102 and see if that preserves the constant's value. */
4108 {
4111 /* 1 if comparison is nominally unsigned. */
4113 tree val;
4125 {
4126 /* Convert primop1 to target type, but do not introduce
4127 additional overflow. We know primop1 is an int_cst. */
4131 }
4133 {
4136 }
4139 {
4144 }
4145 else
4146 {
4151 }
4154 /* This used to be a switch, but Genix compiler can't handle that. */
4156 {
4159 }
4161 {
4164 }
4166 {
4171 }
4173 {
4178 }
4180 {
4185 }
4187 {
4192 }
4194 /* If primop0 was sign-extended and unsigned comparison specd,
4195 we did a signed comparison above using the signed type bounds.
4196 But the comparison we output must be unsigned.
4198 Also, for inequalities, VAL is no good; but if the signed
4199 comparison had *any* fixed result, it follows that the
4200 unsigned comparison just tests the sign in reverse
4201 (positive values are LE, negative ones GE).
4202 So we can generate an unsigned comparison
4203 against an extreme value of the signed type. */
4206 {
4209 {
4224 }
4226 }
4230 {
4237 }
4240 {
4241 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4245 }
4247 /* Value is not predetermined, but do the comparison
4248 in the type of the operand that is not constant.
4249 TYPE is already properly set. */
4250 }
4252 /* If either arg is decimal float and the other is float, find the
4253 proper common type to use for comparison. */
4264 /* If args' natural types are both narrower than nominal type
4265 and both extend in the same manner, compare them
4266 in the type of the wider arg.
4267 Otherwise must actually extend both to the nominal
4268 common type lest different ways of extending
4269 alter the result.
4270 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4275 {
4279 type);
4280 /* Make sure shorter operand is extended the right way
4281 to match the longer operand. */
4282 primop0
4285 primop0);
4286 primop1
4289 primop1);
4290 }
4291 else
4292 {
4293 /* Here we must do the comparison on the nominal type
4294 using the args exactly as we received them. */
4301 {
4303 /* All unsigned values are >= 0, so we warn. However,
4304 if OP0 is a constant that is >= 0, the signedness of
4305 the comparison isn't an issue, so suppress the
4306 warning. */
4308 warn_type_limits && !in_system_header
4312 primop0)))
4313 /* Do not warn for enumeration types. */
4317 {
4334 }
4337 {
4338 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4343 }
4344 }
4345 }
4353 }
4354 \f
4355 /* Return a tree for the sum or difference (RESULTCODE says which)
4356 of pointer PTROP and integer INTOP. */
4358 tree
4361 {
4364 /* The result is a pointer of the same type that is being added. */
4367 /* If the pointer lives in UPC shared memory, then
4368 drop the 'shared' qualifier. */
4373 {
4380 }
4382 {
4389 }
4390 else
4393 /* We are manipulating pointer values, so we don't need to warn
4394 about relying on undefined signed overflow. We disable the
4395 warning here because we use integer types so fold won't know that
4396 they are really pointers. */
4399 /* If what we are about to multiply by the size of the elements
4400 contains a constant term, apply distributive law
4401 and multiply that constant term separately.
4402 This helps produce common subexpressions. */
4407 /* If the constant comes from pointer subtraction,
4408 skip this optimization--it would cause an error. */
4410 /* If the constant is unsigned, and smaller than the pointer size,
4411 then we must skip this optimization. This is because it could cause
4412 an overflow error if the constant is negative but INTOP is not. */
4416 {
4421 /* Convert both subexpression types to the type of intop,
4422 because weird cases involving pointer arithmetic
4423 can result in a sum or difference with different type args. */
4428 }
4430 /* Convert the integer argument to a type the same size as sizetype
4431 so the multiply won't overflow spuriously. */
4437 /* Replace the integer argument with a suitable product by the object size.
4438 Do this multiplication as signed, then convert to the appropriate type
4439 for the pointer operation and disregard an overflow that occurred only
4440 because of the sign-extension change in the latter conversion. */
4441 {
4449 }
4451 /* Create the sum or difference. */
4460 }
4461 \f
4462 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4463 and if NON_CONST is known not to be permitted in an evaluated part
4464 of a constant expression. */
4466 tree
4468 {
4472 /* This should never be called for C++. */
4476 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4485 }
4487 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4488 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4489 around the SAVE_EXPR if needed so that c_fully_fold does not need
4490 to look inside SAVE_EXPRs. */
4492 tree
4494 {
4503 }
4505 /* Return whether EXPR is a declaration whose address can never be
4506 NULL. */
4508 bool
4510 {
4515 }
4517 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4518 or for an `if' or `while' statement or ?..: exp. It should already
4519 have been validated to be of suitable type; otherwise, a bad
4520 diagnostic may result.
4522 The EXPR is located at LOCATION.
4524 This preparation consists of taking the ordinary
4525 representation of an expression expr and producing a valid tree
4526 boolean expression describing whether expr is nonzero. We could
4527 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4528 but we optimize comparisons, &&, ||, and !.
4530 The resulting type should always be `truthvalue_type_node'. */
4532 tree
4534 {
4536 {
4578 ? truthvalue_true_node
4584 ? truthvalue_true_node
4589 /* Fall through. */
4592 {
4595 {
4596 /* Common Ada/Pascal programmer's mistake. */
4598 OPT_Waddress,
4600 inner);
4602 }
4604 }
4621 /* These don't change whether an object is nonzero or zero. */
4626 /* These don't change whether an object is zero or nonzero, but
4627 we can't ignore them if their second arg has side-effects. */
4629 {
4632 c_common_truthvalue_conversion
4635 }
4636 else
4641 /* Distribute the conversion into the arms of a COND_EXPR. */
4643 {
4646 /* In C++ one of the arms might have void type if it is throw. */
4654 }
4655 else
4656 {
4657 /* Folding will happen later for C. */
4665 }
4667 CASE_CONVERT:
4668 {
4672 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4673 since that affects how `default_conversion' will behave. */
4677 /* Don't strip a conversion from C++0x scoped enum, since they
4678 don't implicitly convert to other types. */
4682 /* If this isn't narrowing the argument, we can ignore it. */
4686 }
4692 {
4696 }
4701 }
4704 {
4706 expr = (build_binary_op
4710 c_common_truthvalue_conversion
4713 c_common_truthvalue_conversion
4718 }
4721 {
4726 }
4727 else
4730 ret:
4733 }
4734 \f
4743 /* Apply the TYPE_QUALS to the new DECL. */
4745 void
4747 {
4755 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4756 constructor can produce constant init, so rely on cp_finish_decl to
4757 clear TREE_READONLY if the variable has non-constant init. */
4760 {
4763 }
4765 {
4767 /* Allow 'restrict' on arrays of pointers.
4768 FIXME currently we just ignore it. */
4774 }
4776 {
4782 /* The declaration's type should have been previously defined
4783 as a UPC shared type. */
4785 }
4786 }
4788 /* Hash function for the problem of multiple type definitions in
4789 different files. This must hash all types that will compare
4790 equal via comptypes to the same value. In practice it hashes
4791 on some of the simple stuff and leaves the details to comptypes. */
4793 static hashval_t
4795 {
4799 tree t2;
4801 {
4802 /* For pointers, hash on pointee type plus some swizzling. */
4805 /* Hash on number of elements and total size. */
4824 }
4825 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4826 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4828 /* We might have a VLA here. */
4831 else
4834 }
4838 /* Return the typed-based alias set for T, which may be an expression
4839 or a type. Return -1 if we don't do anything special. */
4841 alias_set_type
4843 {
4844 tree u;
4847 /* For VLAs, use the alias set of the element type rather than the
4848 default of alias set 0 for types compared structurally. */
4850 {
4854 }
4856 /* Permit type-punning when accessing a union, provided the access
4857 is directly through the union. For example, this code does not
4858 permit taking the address of a union member and then storing
4859 through it. Even the type-punning allowed here is a GCC
4860 extension, albeit a common and useful one; the C standard says
4861 that such accesses have implementation-defined behavior. */
4869 /* That's all the expressions we handle specially. */
4873 /* The C standard guarantees that any object may be accessed via an
4874 lvalue that has character type. */
4880 /* The C standard specifically allows aliasing between signed and
4881 unsigned variants of the same type. We treat the signed
4882 variant as canonical. */
4884 {
4887 /* t1 == t can happen for boolean nodes which are always unsigned. */
4890 }
4892 /* Handle the case of multiple type nodes referring to "the same" type,
4893 which occurs with IMA. These share an alias set. FIXME: Currently only
4894 C90 is handled. (In C99 type compatibility is not transitive, which
4895 complicates things mightily. The alias set splay trees can theoretically
4896 represent this, but insertion is tricky when you consider all the
4897 different orders things might arrive in.) */
4902 /* Save time if there's only one input file. */
4906 /* Pointers need special handling if they point to any type that
4907 needs special handling (below). */
4909 {
4910 tree t2;
4911 /* Find bottom type under any nested POINTERs. */
4915 ;
4923 }
4924 /* These are the only cases that need special handling. */
4931 /* Undefined? */
4935 /* Look up t in hash table. Only one of the compatible types within each
4936 alias set is recorded in the table. */
4940 NULL);
4943 {
4946 }
4947 else
4948 /* Our caller will assign and record (in t) a new alias set; all we need
4949 to do is remember t in the hash table. */
4953 }
4954 \f
4955 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4956 the second parameter indicates which OPERATOR is being applied.
4957 The COMPLAIN flag controls whether we should diagnose possibly
4958 ill-formed constructs or not. LOC is the location of the SIZEOF or
4959 TYPEOF operator. */
4961 tree
4964 {
4972 {
4974 {
4981 }
4982 else
4983 {
4985 {
4989 else
4992 }
4994 }
4995 }
4997 {
4999 {
5006 }
5007 else
5010 }
5013 {
5018 }
5021 {
5026 }
5027 else
5028 {
5030 /* Convert in case a char is more than one unit. */
5034 else
5036 }
5041 {
5044 }
5046 /* VALUE will have the middle-end integer type sizetype.
5047 However, we should really return a value of type `size_t',
5048 which is just a typedef for an ordinary integer type. */
5052 }
5054 /* Implement the __alignof keyword: Return the minimum required
5055 alignment of EXPR, measured in bytes. For VAR_DECLs,
5056 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5057 from an "aligned" __attribute__ specification). LOC is the
5058 location of the ALIGNOF operator. */
5060 tree
5062 {
5063 tree t;
5070 {
5073 }
5079 {
5086 {
5093 }
5095 }
5096 else
5100 }
5101 \f
5102 /* Handle C and C++ default attributes. */
5104 enum built_in_attribute
5105 {
5106 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5107 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5108 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5109 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5110 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5112 #undef DEF_ATTR_NULL_TREE
5113 #undef DEF_ATTR_INT
5114 #undef DEF_ATTR_STRING
5115 #undef DEF_ATTR_IDENT
5116 #undef DEF_ATTR_TREE_LIST
5117 ATTR_LAST
5118 };
5124 enum c_builtin_type
5125 {
5126 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5127 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5128 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5129 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5130 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5131 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5132 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5133 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5134 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5135 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5136 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5137 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5138 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5139 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5140 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5141 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5142 NAME,
5143 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5145 #undef DEF_PRIMITIVE_TYPE
5146 #undef DEF_FUNCTION_TYPE_0
5147 #undef DEF_FUNCTION_TYPE_1
5148 #undef DEF_FUNCTION_TYPE_2
5149 #undef DEF_FUNCTION_TYPE_3
5150 #undef DEF_FUNCTION_TYPE_4
5151 #undef DEF_FUNCTION_TYPE_5
5152 #undef DEF_FUNCTION_TYPE_6
5153 #undef DEF_FUNCTION_TYPE_7
5154 #undef DEF_FUNCTION_TYPE_8
5155 #undef DEF_FUNCTION_TYPE_VAR_0
5156 #undef DEF_FUNCTION_TYPE_VAR_1
5157 #undef DEF_FUNCTION_TYPE_VAR_2
5158 #undef DEF_FUNCTION_TYPE_VAR_3
5159 #undef DEF_FUNCTION_TYPE_VAR_4
5160 #undef DEF_FUNCTION_TYPE_VAR_5
5161 #undef DEF_POINTER_TYPE
5162 BT_LAST
5163 };
5167 /* A temporary array for c_common_nodes_and_builtins. Used in
5168 communication with def_fn_type. */
5171 /* A helper function for c_common_nodes_and_builtins. Build function type
5172 for DEF with return type RET and N arguments. If VAR is true, then the
5173 function should be variadic after those N arguments.
5175 Takes special care not to ICE if any of the types involved are
5176 error_mark_node, which indicates that said type is not in fact available
5177 (see builtin_type_for_size). In which case the function type as a whole
5178 should be error_mark_node. */
5180 static void
5182 {
5183 tree t;
5190 {
5196 }
5203 else
5206 egress:
5209 }
5211 /* Build builtin functions common to both C and C++ language
5212 frontends. */
5214 static void
5216 {
5217 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5218 builtin_types[ENUM] = VALUE;
5219 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5220 def_fn_type (ENUM, RETURN, 0, 0);
5221 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5222 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5223 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5224 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5225 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5226 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5227 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5228 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5229 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5230 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5231 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5232 ARG6) \
5233 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5234 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5235 ARG6, ARG7) \
5236 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5237 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5238 ARG6, ARG7, ARG8) \
5239 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5240 ARG7, ARG8);
5241 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5242 def_fn_type (ENUM, RETURN, 1, 0);
5243 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5244 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5245 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5246 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5247 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5248 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5249 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5250 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5251 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5252 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5253 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5254 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5258 #undef DEF_PRIMITIVE_TYPE
5259 #undef DEF_FUNCTION_TYPE_1
5260 #undef DEF_FUNCTION_TYPE_2
5261 #undef DEF_FUNCTION_TYPE_3
5262 #undef DEF_FUNCTION_TYPE_4
5263 #undef DEF_FUNCTION_TYPE_5
5264 #undef DEF_FUNCTION_TYPE_6
5265 #undef DEF_FUNCTION_TYPE_VAR_0
5266 #undef DEF_FUNCTION_TYPE_VAR_1
5267 #undef DEF_FUNCTION_TYPE_VAR_2
5268 #undef DEF_FUNCTION_TYPE_VAR_3
5269 #undef DEF_FUNCTION_TYPE_VAR_4
5270 #undef DEF_FUNCTION_TYPE_VAR_5
5271 #undef DEF_POINTER_TYPE
5276 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5277 NONANSI_P, ATTRS, IMPLICIT, COND) \
5278 if (NAME && COND) \
5279 def_builtin_1 (ENUM, NAME, CLASS, \
5280 builtin_types[(int) TYPE], \
5281 builtin_types[(int) LIBTYPE], \
5282 BOTH_P, FALLBACK_P, NONANSI_P, \
5283 built_in_attributes[(int) ATTRS], IMPLICIT);
5285 #undef DEF_BUILTIN
5293 }
5295 /* Like get_identifier, but avoid warnings about null arguments when
5296 the argument may be NULL for targets where GCC lacks stdint.h type
5297 information. */
5301 {
5303 }
5305 /* Build tree nodes and builtin functions common to both C and C++ language
5306 frontends. */
5308 void
5310 {
5314 tree array_domain_type;
5315 tree va_list_ref_type_node;
5316 tree va_list_arg_type_node;
5320 /* Define `int' and `char' first so that dbx will output them first. */
5324 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5325 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5326 but not C. Are the conditionals here needed? */
5332 long_unsigned_type_node);
5334 {
5336 int128_integer_type_node);
5338 int128_unsigned_type_node);
5339 }
5343 long_long_integer_type_node);
5345 long_long_unsigned_type_node);
5348 long_long_unsigned_type_node);
5351 short_unsigned_type_node);
5354 short_unsigned_type_node);
5356 /* Define both `signed char' and `unsigned char'. */
5360 /* These are types that c_common_type_for_size and
5361 c_common_type_for_mode use. */
5364 intQI_type_node));
5367 intHI_type_node));
5370 intSI_type_node));
5373 intDI_type_node));
5374 #if HOST_BITS_PER_WIDE_INT >= 64
5377 TYPE_DECL,
5379 intTI_type_node));
5380 #endif
5383 unsigned_intQI_type_node));
5386 unsigned_intHI_type_node));
5389 unsigned_intSI_type_node));
5392 unsigned_intDI_type_node));
5393 #if HOST_BITS_PER_WIDE_INT >= 64
5396 TYPE_DECL,
5398 unsigned_intTI_type_node));
5399 #endif
5401 /* Create the widest literal types. */
5402 widest_integer_literal_type_node
5406 widest_integer_literal_type_node));
5408 widest_unsigned_literal_type_node
5412 widest_unsigned_literal_type_node));
5416 pid_type_node =
5423 /* Only supported decimal floating point extension if the target
5424 actually supports underlying modes. */
5428 {
5432 }
5435 {
5440 long_long_fract_type_node);
5442 unsigned_short_fract_type_node);
5444 unsigned_fract_type_node);
5446 unsigned_long_fract_type_node);
5448 unsigned_long_long_fract_type_node);
5450 sat_short_fract_type_node);
5453 sat_long_fract_type_node);
5455 sat_long_long_fract_type_node);
5457 sat_unsigned_short_fract_type_node);
5459 sat_unsigned_fract_type_node);
5461 sat_unsigned_long_fract_type_node);
5463 sat_unsigned_long_long_fract_type_node);
5468 long_long_accum_type_node);
5470 unsigned_short_accum_type_node);
5472 unsigned_accum_type_node);
5474 unsigned_long_accum_type_node);
5476 unsigned_long_long_accum_type_node);
5478 sat_short_accum_type_node);
5481 sat_long_accum_type_node);
5483 sat_long_long_accum_type_node);
5485 sat_unsigned_short_accum_type_node);
5487 sat_unsigned_accum_type_node);
5489 sat_unsigned_long_accum_type_node);
5491 sat_unsigned_long_long_accum_type_node);
5493 }
5496 TYPE_DECL,
5498 complex_integer_type_node));
5500 TYPE_DECL,
5502 complex_float_type_node));
5504 TYPE_DECL,
5506 complex_double_type_node));
5510 complex_long_double_type_node));
5513 /* For C++, make fileptr_type_node a distinct void * type until
5514 FILE type is defined. */
5519 /* Set the TYPE_NAME for any variants that were built before
5520 record_builtin_type gave names to the built-in types. */
5521 {
5527 }
5529 /* This node must not be shared. */
5535 /* Make a type to be the domain of a few array types
5536 whose domains don't really matter.
5537 200 is small enough that it always fits in size_t
5538 and large enough that it can hold most function names for the
5539 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5542 /* Make a type for arrays of characters.
5543 With luck nothing will ever really depend on the length of this
5544 array type. */
5545 char_array_type_node
5548 /* Likewise for arrays of ints. */
5549 int_array_type_node
5553 const_string_type_node
5557 /* This is special for C++ so functions can be overloaded. */
5563 {
5566 else
5569 }
5571 /* This is for wide string constants. */
5572 wchar_array_type_node
5575 /* Define 'char16_t'. */
5580 {
5585 }
5587 /* This is for UTF-16 string constants. */
5588 char16_array_type_node
5591 /* Define 'char32_t'. */
5596 {
5601 }
5603 /* This is for UTF-32 string constants. */
5604 char32_array_type_node
5607 wint_type_node =
5610 intmax_type_node =
5612 uintmax_type_node =
5616 sig_atomic_type_node =
5619 int8_type_node =
5622 int16_type_node =
5625 int32_type_node =
5628 int64_type_node =
5631 uint8_type_node =
5634 c_uint16_type_node =
5637 c_uint32_type_node =
5640 c_uint64_type_node =
5643 int_least8_type_node =
5646 int_least16_type_node =
5649 int_least32_type_node =
5652 int_least64_type_node =
5655 uint_least8_type_node =
5658 uint_least16_type_node =
5661 uint_least32_type_node =
5664 uint_least64_type_node =
5667 int_fast8_type_node =
5670 int_fast16_type_node =
5673 int_fast32_type_node =
5676 int_fast64_type_node =
5679 uint_fast8_type_node =
5682 uint_fast16_type_node =
5685 uint_fast32_type_node =
5688 uint_fast64_type_node =
5691 intptr_type_node =
5694 uintptr_type_node =
5697 default_function_type
5699 ptrdiff_type_node
5706 va_list_type_node));
5708 {
5711 tree ptype;
5714 {
5718 ptype));
5720 }
5721 }
5724 {
5727 }
5728 else
5729 {
5732 }
5739 /* Create the built-in __null node. It is important that this is
5740 not shared. */
5744 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5746 }
5748 /* The number of named compound-literals generated thus far. */
5751 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5753 void
5755 {
5758 compound_literal_number);
5759 compound_literal_number++;
5761 }
5763 tree
5765 {
5769 }
5772 /* Linked list of disabled built-in functions. */
5775 {
5783 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5784 begins with "__builtin_", give an error. */
5786 void
5788 {
5791 else
5792 {
5797 }
5798 }
5801 /* Return true if the built-in function NAME has been disabled, false
5802 otherwise. */
5804 static bool
5806 {
5809 {
5812 }
5814 }
5817 /* Worker for DEF_BUILTIN.
5818 Possibly define a builtin function with one or two names.
5819 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5820 nonansi_p and flag_no_nonansi_builtin. */
5822 static void
5829 {
5830 tree decl;
5843 fnattrs);
5852 }
5853 \f
5854 /* Nonzero if the type T promotes to int. This is (nearly) the
5855 integral promotions defined in ISO C99 6.3.1.1/2. */
5857 bool
5859 {
5861 {
5871 /* ??? Technically all enumerations not larger than an int
5872 promote to an int. But this is used along code paths
5873 that only want to notice a size change. */
5881 }
5882 }
5884 /* Return 1 if PARMS specifies a fixed number of parameters
5885 and none of their types is affected by default promotions. */
5887 int
5889 {
5890 const_tree t;
5892 {
5909 }
5911 }
5913 /* Recursively remove any '*' or '&' operator from TYPE. */
5914 tree
5916 {
5920 }
5922 /* Recursively remove pointer or array type from TYPE. */
5923 tree
5925 {
5929 }
5931 /* Used to compare case labels. K1 and K2 are actually tree nodes
5932 representing case labels, or NULL_TREE for a `default' label.
5933 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5934 K2, and 0 if K1 and K2 are equal. */
5936 int
5938 {
5939 /* Consider a NULL key (such as arises with a `default' label) to be
5940 smaller than anything else. */
5947 }
5949 /* Process a case label, located at LOC, for the range LOW_VALUE
5950 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5951 then this case label is actually a `default' label. If only
5952 HIGH_VALUE is NULL_TREE, then case label was declared using the
5953 usual C/C++ syntax, rather than the GNU case range extension.
5954 CASES is a tree containing all the case ranges processed so far;
5955 COND is the condition for the switch-statement itself. Returns the
5956 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5957 is created. */
5959 tree
5962 {
5963 tree type;
5964 tree label;
5965 tree case_label;
5966 splay_tree_node node;
5968 /* Create the LABEL_DECL itself. */
5971 /* If there was an error processing the switch condition, bail now
5972 before we get more confused. */
5980 {
5983 }
5985 /* Case ranges are a GNU extension. */
5992 {
5997 }
5999 {
6004 }
6007 {
6008 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6009 really a case range, even though it was written that way.
6010 Remove the HIGH_VALUE to simplify later processing. */
6015 }
6017 /* See if the case is in range of the type of the original testing
6018 expression. If both low_value and high_value are out of range,
6019 don't insert the case label and return NULL_TREE. */
6025 /* Look up the LOW_VALUE in the table of case labels we already
6026 have. */
6028 /* If there was not an exact match, check for overlapping ranges.
6029 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6030 that's a `default' label and the only overlap is an exact match. */
6032 {
6033 splay_tree_node low_bound;
6034 splay_tree_node high_bound;
6036 /* Even though there wasn't an exact match, there might be an
6037 overlap between this case range and another case range.
6038 Since we've (inductively) not allowed any overlapping case
6039 ranges, we simply need to find the greatest low case label
6040 that is smaller that LOW_VALUE, and the smallest low case
6041 label that is greater than LOW_VALUE. If there is an overlap
6042 it will occur in one of these two ranges. */
6048 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6049 the LOW_VALUE, so there is no need to check unless the
6050 LOW_BOUND is in fact itself a case range. */
6056 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6057 range is bigger than the low end of the current range, so we
6058 are only interested if the current range is a real range, and
6059 not an ordinary case label. */
6061 && high_value
6063 high_value)
6066 }
6067 /* If there was an overlap, issue an error. */
6069 {
6073 {
6077 }
6079 {
6082 }
6083 else
6084 {
6088 }
6090 }
6092 /* Add a CASE_LABEL to the statement-tree. */
6094 /* Register this case label in the splay tree. */
6101 error_out:
6102 /* Add a label so that the back-end doesn't think that the beginning of
6103 the switch is unreachable. Note that we do not add a case label, as
6104 that just leads to duplicates and thence to failure later on. */
6106 {
6109 }
6111 }
6113 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6114 Used to verify that case values match up with enumerator values. */
6116 static void
6118 {
6121 /* ??? Not working too hard to print the double-word value.
6122 Should perhaps be done with %lwd in the diagnostic routines? */
6131 else
6140 buf);
6141 else
6146 }
6148 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6149 Used to verify that case values match up with enumerator values. */
6151 static int
6153 {
6157 /* Skip default case. */
6161 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6162 when we did our enum->case scan. Reset our scratch bit after. */
6165 else
6168 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6169 not set, that means that CASE_HIGH did not appear when we did our
6170 enum->case scan. Reset our scratch bit after. */
6172 {
6175 else
6177 }
6180 }
6182 /* Handle -Wswitch*. Called from the front end after parsing the
6183 switch construct. */
6184 /* ??? Should probably be somewhere generic, since other languages
6185 besides C and C++ would want this. At the moment, however, C/C++
6186 are the only tree-ssa languages that support enumerations at all,
6187 so the point is moot. */
6189 void
6192 {
6193 splay_tree_node default_node;
6194 splay_tree_node node;
6195 tree chain;
6205 /* From here on, we only care about about enumerated types. */
6209 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6213 /* Check the cases. Warn about case values which are not members of
6214 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6215 there is no default case, check that exactly all enumeration
6216 literals are covered by the cases. */
6218 /* Clearing COND if it is not an integer constant simplifies
6219 the tests inside the loop below. */
6223 /* The time complexity here is O(N*lg(N)) worst case, but for the
6224 common case of monotonically increasing enumerators, it is
6225 O(N), since the nature of the splay tree will keep the next
6226 element adjacent to the root at all times. */
6229 {
6235 {
6236 /* Mark the CASE_LOW part of the case entry as seen. */
6240 }
6242 /* Even though there wasn't an exact match, there might be a
6243 case range which includes the enumerator's value. */
6246 {
6250 {
6251 /* If we match the upper bound exactly, mark the CASE_HIGH
6252 part of the case entry as seen. */
6256 }
6257 }
6259 /* We've now determined that this enumerated literal isn't
6260 handled by the case labels of the switch statement. */
6262 /* If the switch expression is a constant, we only really care
6263 about whether that constant is handled by the switch. */
6267 /* If there is a default_node, the only relevant option is
6268 Wswitch-enum. Otherwise, if both are enabled then we prefer
6269 to warn using -Wswitch because -Wswitch is enabled by -Wall
6270 while -Wswitch-enum is explicit. */
6273 ? OPT_Wswitch_enum
6277 }
6279 /* Warn if there are case expressions that don't correspond to
6280 enumerators. This can occur since C and C++ don't enforce
6281 type-checking of assignments to enumeration variables.
6283 The time complexity here is now always O(N) worst case, since
6284 we should have marked both the lower bound and upper bound of
6285 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6286 above. This scan also resets those fields. */
6289 }
6291 /* Finish an expression taking the address of LABEL (an
6292 IDENTIFIER_NODE). Returns an expression for the address.
6294 LOC is the location for the expression returned. */
6296 tree
6298 {
6299 tree result;
6309 else
6310 {
6313 /* The current function is not necessarily uninlinable.
6314 Computed gotos are incompatible with inlining, but the value
6315 here could be used only in a diagnostic, for example. */
6317 }
6320 }
6321 \f
6323 /* Given a boolean expression ARG, return a tree representing an increment
6324 or decrement (as indicated by CODE) of ARG. The front end must check for
6325 invalid cases (e.g., decrement in C++). */
6326 tree
6328 {
6329 tree val;
6334 {
6357 }
6360 }
6361 \f
6362 /* Built-in macros for stddef.h and stdint.h, that require macros
6363 defined in this file. */
6364 void
6366 {
6429 }
6431 static void
6433 {
6434 /* Fill in the built_in_attributes array. */
6435 #define DEF_ATTR_NULL_TREE(ENUM) \
6436 built_in_attributes[(int) ENUM] = NULL_TREE;
6437 #define DEF_ATTR_INT(ENUM, VALUE) \
6438 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6439 #define DEF_ATTR_STRING(ENUM, VALUE) \
6440 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6441 #define DEF_ATTR_IDENT(ENUM, STRING) \
6442 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6443 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6444 built_in_attributes[(int) ENUM] \
6445 = tree_cons (built_in_attributes[(int) PURPOSE], \
6446 built_in_attributes[(int) VALUE], \
6447 built_in_attributes[(int) CHAIN]);
6449 #undef DEF_ATTR_NULL_TREE
6450 #undef DEF_ATTR_INT
6451 #undef DEF_ATTR_IDENT
6452 #undef DEF_ATTR_TREE_LIST
6453 }
6455 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6456 identifier as an argument, so the front end shouldn't look it up. */
6458 bool
6460 {
6463 /* Unknown attribute that we'll end up ignoring, return true so we
6464 don't complain about an identifier argument. */
6470 else
6472 }
6474 /* Attribute handlers common to C front ends. */
6476 /* Handle a "packed" attribute; arguments as in
6477 struct attribute_spec.handler. */
6479 static tree
6482 {
6484 {
6488 }
6490 {
6492 /* Still pack bitfields. */
6497 else
6499 }
6500 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6501 used for DECL_REGISTER. It wouldn't mean anything anyway.
6502 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6503 that changes what the typedef is typing. */
6504 else
6505 {
6508 }
6511 }
6513 /* Handle a "nocommon" attribute; arguments as in
6514 struct attribute_spec.handler. */
6516 static tree
6520 {
6523 else
6524 {
6527 }
6530 }
6532 /* Handle a "common" attribute; arguments as in
6533 struct attribute_spec.handler. */
6535 static tree
6538 {
6541 else
6542 {
6545 }
6548 }
6550 /* Handle a "noreturn" attribute; arguments as in
6551 struct attribute_spec.handler. */
6553 static tree
6556 {
6559 /* See FIXME comment in c_common_attribute_table. */
6566 = build_pointer_type
6569 else
6570 {
6573 }
6576 }
6578 /* Handle a "hot" and attribute; arguments as in
6579 struct attribute_spec.handler. */
6581 static tree
6584 {
6587 {
6589 {
6593 }
6594 /* Most of the rest of the hot processing is done later with
6595 lookup_attribute. */
6596 }
6597 else
6598 {
6601 }
6604 }
6606 /* Handle a "cold" and attribute; arguments as in
6607 struct attribute_spec.handler. */
6609 static tree
6612 {
6615 {
6617 {
6621 }
6622 /* Most of the rest of the cold processing is done later with
6623 lookup_attribute. */
6624 }
6625 else
6626 {
6629 }
6632 }
6634 /* Handle a "no_sanitize_address" attribute; arguments as in
6635 struct attribute_spec.handler. */
6637 static tree
6640 {
6642 {
6645 }
6648 }
6650 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6651 struct attribute_spec.handler. */
6653 static tree
6656 {
6665 }
6667 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6668 struct attribute_spec.handler. */
6670 static tree
6673 {
6675 {
6678 }
6681 }
6683 /* Handle a "noinline" attribute; arguments as in
6684 struct attribute_spec.handler. */
6686 static tree
6690 {
6693 else
6694 {
6697 }
6700 }
6702 /* Handle a "noclone" attribute; arguments as in
6703 struct attribute_spec.handler. */
6705 static tree
6709 {
6711 {
6714 }
6717 }
6719 /* Handle a "always_inline" attribute; arguments as in
6720 struct attribute_spec.handler. */
6722 static tree
6727 {
6729 {
6730 /* Set the attribute and mark it for disregarding inline
6731 limits. */
6733 }
6734 else
6735 {
6738 }
6741 }
6743 /* Handle a "gnu_inline" attribute; arguments as in
6744 struct attribute_spec.handler. */
6746 static tree
6751 {
6753 {
6754 /* Do nothing else, just set the attribute. We'll get at
6755 it later with lookup_attribute. */
6756 }
6757 else
6758 {
6761 }
6764 }
6766 /* Handle a "leaf" attribute; arguments as in
6767 struct attribute_spec.handler. */
6769 static tree
6773 {
6775 {
6778 }
6780 {
6783 }
6786 }
6788 /* Handle an "artificial" attribute; arguments as in
6789 struct attribute_spec.handler. */
6791 static tree
6796 {
6798 {
6799 /* Do nothing else, just set the attribute. We'll get at
6800 it later with lookup_attribute. */
6801 }
6802 else
6803 {
6806 }
6809 }
6811 /* Handle a "flatten" attribute; arguments as in
6812 struct attribute_spec.handler. */
6814 static tree
6816 tree args ATTRIBUTE_UNUSED,
6818 {
6820 /* Do nothing else, just set the attribute. We'll get at
6821 it later with lookup_attribute. */
6822 ;
6823 else
6824 {
6827 }
6830 }
6832 /* Handle a "warning" or "error" attribute; arguments as in
6833 struct attribute_spec.handler. */
6835 static tree
6838 {
6841 /* Do nothing else, just set the attribute. We'll get at
6842 it later with lookup_attribute. */
6843 ;
6844 else
6845 {
6848 }
6851 }
6853 /* Handle a "used" attribute; arguments as in
6854 struct attribute_spec.handler. */
6856 static tree
6859 {
6865 {
6870 }
6871 else
6872 {
6875 }
6878 }
6880 /* Handle a "unused" attribute; arguments as in
6881 struct attribute_spec.handler. */
6883 static tree
6886 {
6888 {
6896 {
6901 }
6902 else
6903 {
6906 }
6907 }
6908 else
6909 {
6913 }
6916 }
6918 /* Handle a "externally_visible" attribute; arguments as in
6919 struct attribute_spec.handler. */
6921 static tree
6926 {
6930 {
6933 {
6937 }
6938 }
6939 else
6940 {
6943 }
6946 }
6948 /* Handle a "const" attribute; arguments as in
6949 struct attribute_spec.handler. */
6951 static tree
6954 {
6957 /* See FIXME comment on noreturn in c_common_attribute_table. */
6963 = build_pointer_type
6966 else
6967 {
6970 }
6973 }
6975 /* Handle a "transparent_union" attribute; arguments as in
6976 struct attribute_spec.handler. */
6978 static tree
6982 {
6983 tree type;
6994 {
6995 /* Make sure that the first field will work for a transparent union.
6996 If the type isn't complete yet, leave the check to the code in
6997 finish_struct. */
6999 {
7005 }
7008 {
7009 /* If the type isn't complete yet, setting the flag
7010 on a variant wouldn't ever be checked. */
7014 /* build_duplicate_type doesn't work for C++. */
7018 /* A type variant isn't good enough, since we don't a cast
7019 to such a type removed as a no-op. */
7021 }
7025 }
7027 ignored:
7030 }
7032 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7033 get the requested priority for a constructor or destructor,
7034 possibly issuing diagnostics for invalid or reserved
7035 priorities. */
7037 static priority_type
7039 {
7040 HOST_WIDE_INT pri;
7041 tree arg;
7047 {
7050 else
7053 }
7066 {
7069 "destructor priorities from 0 to %d are reserved "
7071 MAX_RESERVED_INIT_PRIORITY);
7072 else
7074 "constructor priorities from 0 to %d are reserved "
7076 MAX_RESERVED_INIT_PRIORITY);
7077 }
7080 invalid:
7083 MAX_INIT_PRIORITY);
7084 else
7086 MAX_INIT_PRIORITY);
7088 }
7090 /* Handle a "constructor" attribute; arguments as in
7091 struct attribute_spec.handler. */
7093 static tree
7097 {
7104 {
7105 priority_type priority;
7110 }
7111 else
7112 {
7115 }
7118 }
7120 /* Handle a "destructor" attribute; arguments as in
7121 struct attribute_spec.handler. */
7123 static tree
7127 {
7134 {
7135 priority_type priority;
7140 }
7141 else
7142 {
7145 }
7148 }
7150 /* Nonzero if the mode is a valid vector mode for this architecture.
7151 This returns nonzero even if there is no hardware support for the
7152 vector mode, but we can emulate with narrower modes. */
7154 static int
7156 {
7160 /* Doh! What's going on? */
7169 /* Hardware support. Woo hoo! */
7175 /* We should probably return 1 if requesting V4DI and we have no DI,
7176 but we have V2DI, but this is probably very unlikely. */
7178 /* If we have support for the inner mode, we can safely emulate it.
7179 We may not have V2DI, but me can emulate with a pair of DIs. */
7181 }
7184 /* Handle a "mode" attribute; arguments as in
7185 struct attribute_spec.handler. */
7187 static tree
7190 {
7198 else
7199 {
7204 tree typefm;
7209 {
7215 }
7217 /* Change this type to have a type with the specified mode.
7218 First check for the special modes. */
7231 else
7234 {
7237 }
7240 {
7243 }
7247 {
7279 }
7281 {
7284 }
7287 {
7292 {
7295 }
7299 else
7302 }
7303 else
7304 {
7305 /* For fixed-point modes, we need to test if the signness of type
7306 and the machine mode are consistent. */
7309 {
7312 }
7313 /* For fixed-point modes, we need to pass saturating info. */
7317 }
7320 {
7323 }
7325 {
7326 /* For enumeral types, copy the precision from the integer
7327 type returned above. If not an INTEGER_TYPE, we can't use
7328 this mode for this type. */
7330 {
7333 }
7336 {
7339 }
7340 else
7341 {
7342 /* We cannot build a type variant, as there's code that assumes
7343 that TYPE_MAIN_VARIANT has the same mode. This includes the
7344 debug generators. Instead, create a subrange type. This
7345 results in all of the enumeral values being emitted only once
7346 in the original, and the subtype gets them by reference. */
7349 else
7352 }
7353 }
7357 {
7360 }
7363 }
7366 }
7368 /* Handle a "section" attribute; arguments as in
7369 struct attribute_spec.handler. */
7371 static tree
7374 {
7378 {
7384 {
7388 {
7390 "section attribute cannot be specified for "
7393 }
7395 /* The decl may have already been given a section attribute
7396 from a previous declaration. Ensure they match. */
7400 {
7404 }
7408 {
7411 }
7412 else
7414 }
7415 else
7416 {
7419 }
7420 }
7421 else
7422 {
7426 }
7429 }
7431 /* Check whether ALIGN is a valid user-specified alignment. If so,
7432 return its base-2 log; if not, output an error and return -1. If
7433 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7434 no error. */
7435 int
7437 {
7442 {
7445 }
7450 {
7453 }
7455 {
7458 }
7460 }
7462 /*
7463 If in c++-11, check if the c++-11 alignment constraint with respect
7464 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7465 c++-11 mode, does nothing.
7467 [dcl.align]2/ says:
7469 [* if the constant expression evaluates to a fundamental alignment,
7470 the alignment requirement of the declared entity shall be the
7471 specified fundamental alignment.
7473 * if the constant expression evaluates to an extended alignment
7474 and the implementation supports that alignment in the context
7475 of the declaration, the alignment of the declared entity shall
7476 be that alignment
7478 * if the constant expression evaluates to an extended alignment
7479 and the implementation does not support that alignment in the
7480 context of the declaration, the program is ill-formed]. */
7482 static bool
7486 {
7499 {
7501 {
7502 /* For file scope variables and static members, the target
7503 supports alignments that are at most
7504 MAX_OFILE_ALIGNMENT. */
7507 }
7508 else
7509 {
7510 #ifdef BIGGEST_FIELD_ALIGNMENT
7511 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7512 #else
7513 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7514 #endif
7515 /* For non-static members, the target supports either
7516 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7517 if it is defined or BIGGEST_ALIGNMENT. */
7522 #undef MAX_TARGET_FIELD_ALIGNMENT
7523 /* For stack variables, the target supports at most
7524 MAX_STACK_ALIGNMENT. */
7528 }
7529 }
7531 {
7532 /* Let's be liberal for types. */
7535 }
7543 }
7545 /* Handle a "aligned" attribute; arguments as in
7546 struct attribute_spec.handler. */
7548 static tree
7551 {
7560 {
7564 }
7572 {
7575 /* If we have a TYPE_DECL, then copy the type, so that we
7576 don't accidentally modify a builtin type. See pushdecl. */
7579 {
7586 }
7587 else
7592 }
7595 {
7598 }
7601 /* C++-11 [dcl.align/4]:
7603 When multiple alignment-specifiers are specified for an
7604 entity, the alignment requirement shall be set to the
7605 strictest specified alignment.
7607 This formally comes from the c++11 specification but we are
7608 doing it for the GNU attribute syntax as well. */
7612 {
7617 else
7621 }
7622 else
7623 {
7626 }
7629 }
7631 /* Handle a "weak" attribute; arguments as in
7632 struct attribute_spec.handler. */
7634 static tree
7639 {
7642 {
7645 }
7647 {
7651 }
7655 else
7659 }
7661 /* Handle an "alias" or "ifunc" attribute; arguments as in
7662 struct attribute_spec.handler, except that IS_ALIAS tells us
7663 whether this is an alias as opposed to ifunc attribute. */
7665 static tree
7668 {
7673 {
7676 }
7680 /* A static variable declaration is always a tentative definition,
7681 but the alias is a non-tentative definition which overrides. */
7684 {
7688 }
7692 {
7696 }
7698 /* Note that the very first time we process a nested declaration,
7699 decl_function_context will not be set. Indeed, *would* never
7700 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7701 we do below. After such frobbery, pushdecl would set the context.
7702 In any case, this is never what we want. */
7704 {
7705 tree id;
7709 {
7713 }
7715 /* This counts as a use of the object pointed to. */
7720 else
7724 /* ifuncs are also aliases, so set that attribute too. */
7727 }
7728 else
7729 {
7732 }
7735 }
7737 /* Handle an "alias" or "ifunc" attribute; arguments as in
7738 struct attribute_spec.handler. */
7740 static tree
7743 {
7745 }
7747 /* Handle an "alias" or "ifunc" attribute; arguments as in
7748 struct attribute_spec.handler. */
7750 static tree
7753 {
7755 }
7757 /* Handle a "weakref" attribute; arguments as in struct
7758 attribute_spec.handler. */
7760 static tree
7763 {
7766 /* We must ignore the attribute when it is associated with
7767 local-scoped decls, since attribute alias is ignored and many
7768 such symbols do not even have a DECL_WEAK field. */
7770 || current_function_decl
7772 {
7776 }
7779 {
7783 }
7785 /* The idea here is that `weakref("name")' mutates into `weakref,
7786 alias("name")', and weakref without arguments, in turn,
7787 implicitly adds weak. */
7790 {
7797 }
7798 else
7799 {
7804 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7805 and that isn't supported; and because it wants to add it to
7806 the list of weak decls, which isn't helpful. */
7808 }
7811 }
7813 /* Handle an "visibility" attribute; arguments as in
7814 struct attribute_spec.handler. */
7816 static tree
7820 {
7826 {
7830 {
7832 name);
7834 }
7836 {
7840 }
7841 }
7843 {
7846 }
7849 {
7852 }
7854 /* If this is a type, set the visibility on the type decl. */
7856 {
7861 {
7863 name);
7865 }
7866 }
7876 else
7877 {
7878 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7880 }
7884 {
7898 }
7903 /* Go ahead and attach the attribute to the node as well. This is needed
7904 so we can determine whether we have VISIBILITY_DEFAULT because the
7905 visibility was not specified, or because it was explicitly overridden
7906 from the containing scope. */
7909 }
7911 /* Determine the ELF symbol visibility for DECL, which is either a
7912 variable or a function. It is an error to use this function if a
7913 definition of DECL is not available in this translation unit.
7914 Returns true if the final visibility has been determined by this
7915 function; false if the caller is free to make additional
7916 modifications. */
7918 bool
7920 {
7924 /* If the user explicitly specified the visibility with an
7925 attribute, honor that. DECL_VISIBILITY will have been set during
7926 the processing of the attribute. We check for an explicit
7927 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7928 to distinguish the use of an attribute from the use of a "#pragma
7929 GCC visibility push(...)"; in the latter case we still want other
7930 considerations to be able to overrule the #pragma. */
7932 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7937 /* Set default visibility to whatever the user supplied with
7938 visibility_specified depending on #pragma GCC visibility. */
7940 {
7943 {
7946 /* If visibility changed and DECL already has DECL_RTL, ensure
7947 symbol flags are updated. */
7952 }
7953 }
7955 }
7957 /* Handle an "tls_model" attribute; arguments as in
7958 struct attribute_spec.handler. */
7960 static tree
7963 {
7964 tree id;
7971 {
7974 }
7979 {
7982 }
7992 else
7993 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7997 }
7999 /* Handle a "no_instrument_function" attribute; arguments as in
8000 struct attribute_spec.handler. */
8002 static tree
8007 {
8011 {
8015 }
8017 {
8021 }
8022 else
8026 }
8028 /* Handle a "malloc" attribute; arguments as in
8029 struct attribute_spec.handler. */
8031 static tree
8034 {
8038 else
8039 {
8042 }
8045 }
8047 /* Handle a "alloc_size" attribute; arguments as in
8048 struct attribute_spec.handler. */
8050 static tree
8053 {
8056 {
8063 {
8068 }
8069 }
8071 }
8073 /* Handle a "fn spec" attribute; arguments as in
8074 struct attribute_spec.handler. */
8076 static tree
8080 {
8085 }
8087 /* Handle a "bnd_variable_size" attribute; arguments as in
8088 struct attribute_spec.handler. */
8090 static tree
8093 {
8095 {
8098 }
8101 }
8103 /* Handle a "bnd_legacy" attribute; arguments as in
8104 struct attribute_spec.handler. */
8106 static tree
8109 {
8111 {
8114 }
8117 }
8119 /* Handle a "warn_unused" attribute; arguments as in
8120 struct attribute_spec.handler. */
8122 static tree
8124 tree args ATTRIBUTE_UNUSED,
8126 {
8128 /* Do nothing else, just set the attribute. We'll get at
8129 it later with lookup_attribute. */
8130 ;
8131 else
8132 {
8135 }
8138 }
8140 /* Handle an "omp declare simd" attribute; arguments as in
8141 struct attribute_spec.handler. */
8143 static tree
8145 {
8147 }
8149 /* Handle an "omp declare target" attribute; arguments as in
8150 struct attribute_spec.handler. */
8152 static tree
8154 {
8156 }
8158 /* Handle a "returns_twice" attribute; arguments as in
8159 struct attribute_spec.handler. */
8161 static tree
8164 {
8167 else
8168 {
8171 }
8174 }
8176 /* Handle a "no_limit_stack" attribute; arguments as in
8177 struct attribute_spec.handler. */
8179 static tree
8184 {
8188 {
8192 }
8194 {
8198 }
8199 else
8203 }
8205 /* Handle a "pure" attribute; arguments as in
8206 struct attribute_spec.handler. */
8208 static tree
8211 {
8214 /* ??? TODO: Support types. */
8215 else
8216 {
8219 }
8222 }
8224 /* Digest an attribute list destined for a transactional memory statement.
8225 ALLOWED is the set of attributes that are allowed for this statement;
8226 return the attribute we parsed. Multiple attributes are never allowed. */
8228 int
8230 {
8235 {
8243 {
8246 }
8249 {
8252 }
8255 else
8257 }
8260 }
8262 /* Transform a TM attribute name into a maskable integer and back.
8263 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8264 to how the lack of an attribute is treated. */
8266 int
8268 {
8282 }
8284 tree
8286 {
8289 {
8307 }
8309 }
8311 /* Return the first TM attribute seen in LIST. */
8313 tree
8315 {
8317 {
8321 }
8323 }
8325 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8326 Here we accept only function types, and verify that none of the other
8327 function TM attributes are also applied. */
8328 /* ??? We need to accept class types for C++, but not C. This greatly
8329 complicates this function, since we can no longer rely on the extra
8330 processing given by function_type_required. */
8332 static tree
8335 {
8336 /* Only one path adds the attribute; others don't. */
8340 {
8343 /* Only tm_callable and tm_safe apply to classes. */
8346 /* FALLTHRU */
8350 {
8353 ;
8356 else
8358 }
8362 {
8365 {
8370 }
8371 }
8372 /* FALLTHRU */
8375 /* If a function is next, pass it on to be tried next. */
8379 ignored:
8382 }
8385 }
8387 /* Handle the TM_WRAP attribute; arguments as in
8388 struct attribute_spec.handler. */
8390 static tree
8393 {
8396 /* We don't need the attribute even on success, since we
8397 record the entry in an external table. */
8402 else
8403 {
8409 else
8410 {
8414 {
8418 else
8420 }
8421 else
8423 }
8424 }
8427 }
8429 /* Ignore the given attribute. Used when this attribute may be usefully
8430 overridden by the target, but is not used generically. */
8432 static tree
8436 {
8439 }
8441 /* Handle a "no vops" attribute; arguments as in
8442 struct attribute_spec.handler. */
8444 static tree
8448 {
8452 }
8454 /* Handle a "deprecated" attribute; arguments as in
8455 struct attribute_spec.handler. */
8457 static tree
8461 {
8469 {
8472 }
8475 {
8486 else
8488 }
8490 {
8495 }
8496 else
8500 {
8503 {
8509 }
8512 else
8514 }
8517 }
8519 /* Handle a "vector_size" attribute; arguments as in
8520 struct attribute_spec.handler. */
8522 static tree
8526 {
8536 {
8539 }
8541 /* Get the vector size (in bytes). */
8544 /* We need to provide for vector pointers, vector arrays, and
8545 functions returning vectors. For example:
8547 __attribute__((vector_size(16))) short *foo;
8549 In this case, the mode is SI, but the type being modified is
8550 HI, so we need to look further. */
8559 /* Get the mode of the type being modified. */
8570 {
8573 }
8576 {
8579 }
8582 {
8585 }
8587 /* Calculate how many units fit in the vector. */
8590 {
8593 }
8597 /* Build back pointers if needed. */
8601 }
8603 /* Handle the "nonnull" attribute. */
8604 static tree
8608 {
8612 /* If no arguments are specified, all pointer arguments should be
8613 non-null. Verify a full prototype is given so that the arguments
8614 will have the correct types when we actually check them later. */
8616 {
8618 {
8621 }
8623 }
8625 /* Argument list specified. Verify that each argument number references
8626 a pointer argument. */
8628 {
8632 {
8637 }
8640 {
8641 function_args_iterator iter;
8642 tree argument;
8646 {
8650 }
8654 {
8659 }
8662 {
8667 }
8668 }
8669 }
8672 }
8674 /* Check the argument list of a function call for null in argument slots
8675 that are marked as requiring a non-null pointer argument. The NARGS
8676 arguments are passed in the array ARGARRAY.
8677 */
8679 static void
8681 {
8682 tree a;
8690 /* See if any of the nonnull attributes has no arguments. If so,
8691 then every pointer argument is checked (in which case the check
8692 for pointer type is done in check_nonnull_arg). */
8694 do
8702 else
8703 {
8704 /* Walk the argument list. If we encounter an argument number we
8705 should check for non-null, do it. */
8707 {
8709 {
8713 }
8718 }
8719 }
8720 }
8722 /* Check that the Nth argument of a function call (counting backwards
8723 from the end) is a (pointer)0. The NARGS arguments are passed in the
8724 array ARGARRAY. */
8726 static void
8728 {
8732 {
8735 tree sentinel;
8736 function_args_iterator iter;
8737 tree t;
8739 /* Skip over the named arguments. */
8741 {
8744 len++;
8745 }
8748 {
8751 }
8753 /* The sentinel must be one of the varargs, i.e.
8754 in position >= the number of fixed arguments. */
8756 {
8760 }
8762 /* Validate the sentinel. */
8766 /* Although __null (in C++) is only an integer we allow it
8767 nevertheless, as we are guaranteed that it's exactly
8768 as wide as a pointer, and we don't want to force
8769 users to cast the NULL they have written there.
8770 We warn with -Wstrict-null-sentinel, though. */
8773 }
8774 }
8776 /* Helper for check_function_nonnull; given a list of operands which
8777 must be non-null in ARGS, determine if operand PARAM_NUM should be
8778 checked. */
8780 static bool
8782 {
8786 {
8793 }
8795 }
8797 /* Check that the function argument PARAM (which is operand number
8798 PARAM_NUM) is non-null. This is called by check_function_nonnull
8799 via check_function_arguments_recurse. */
8801 static void
8804 {
8805 /* Just skip checking the argument if it's not a pointer. This can
8806 happen if the "nonnull" attribute was given without an operand
8807 list (which means to check every pointer argument). */
8815 }
8817 /* Helper for nonnull attribute handling; fetch the operand number
8818 from the attribute argument list. */
8820 static bool
8822 {
8823 /* Verify the arg number is a constant. */
8830 }
8832 /* Handle a "nothrow" attribute; arguments as in
8833 struct attribute_spec.handler. */
8835 static tree
8838 {
8841 /* ??? TODO: Support types. */
8842 else
8843 {
8846 }
8849 }
8851 /* Handle a "cleanup" attribute; arguments as in
8852 struct attribute_spec.handler. */
8854 static tree
8857 {
8861 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8862 for global destructors in C++. This requires infrastructure that
8863 we don't have generically at the moment. It's also not a feature
8864 we'd be missing too much, since we do have attribute constructor. */
8866 {
8870 }
8872 /* Verify that the argument is a function in scope. */
8873 /* ??? We could support pointers to functions here as well, if
8874 that was considered desirable. */
8877 {
8881 }
8884 {
8888 }
8890 /* That the function has proper type is checked with the
8891 eventual call to build_function_call. */
8894 }
8896 /* Handle a "warn_unused_result" attribute. No special handling. */
8898 static tree
8902 {
8903 /* Ignore the attribute for functions not returning any value. */
8905 {
8908 }
8911 }
8913 /* Handle a "sentinel" attribute. */
8915 static tree
8918 {
8920 {
8924 }
8925 else
8926 {
8928 {
8932 }
8933 }
8936 {
8940 {
8944 }
8945 else
8946 {
8948 {
8952 }
8953 }
8954 }
8957 }
8959 /* Handle a "type_generic" attribute. */
8961 static tree
8965 {
8966 /* Ensure we have a function type. */
8969 /* Ensure we have a variadic function. */
8973 }
8975 /* Handle a "target" attribute. */
8977 static tree
8980 {
8981 /* Ensure we have a function type. */
8983 {
8986 }
8988 flags))
8992 }
8994 /* Arguments being collected for optimization. */
8999 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9000 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9001 false for #pragma GCC optimize. */
9003 bool
9005 {
9013 tree ap;
9015 /* Build up argv vector. Just in case the string is stored away, use garbage
9016 collected strings. */
9021 {
9025 {
9029 }
9032 {
9033 /* Split string into multiple substrings. */
9041 {
9048 {
9052 }
9053 else
9054 {
9057 }
9061 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9062 options. */
9064 {
9069 else
9073 }
9076 {
9079 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9080 itself is -Os, and any other switch begins with a -f. */
9086 }
9091 }
9093 }
9094 }
9104 /* Now parse the options. */
9114 /* Don't allow changing -fstrict-aliasing. */
9119 }
9121 /* For handling "optimize" attribute. arguments as in
9122 struct attribute_spec.handler. */
9124 static tree
9127 {
9128 /* Ensure we have a function type. */
9130 {
9133 }
9134 else
9135 {
9139 /* Save current options. */
9142 /* If we previously had some optimization options, use them as the
9143 default. */
9148 /* Parse options, and update the vector. */
9153 /* Restore current options. */
9155 }
9158 }
9160 /* Handle a "no_split_stack" attribute. */
9162 static tree
9167 {
9171 {
9175 }
9177 {
9181 }
9184 }
9186 /* Handle a "returns_nonnull" attribute; arguments as in
9187 struct attribute_spec.handler. */
9189 static tree
9192 {
9193 // Even without a prototype we still have a return type we can check.
9195 {
9198 }
9200 }
9202 \f
9203 /* Check for valid arguments being passed to a function with FNTYPE.
9204 There are NARGS arguments in the array ARGARRAY. */
9205 void
9207 {
9208 /* Check for null being passed in a pointer argument that must be
9209 non-null. We also need to do this if format checking is enabled. */
9214 /* Check for errors in format strings. */
9221 }
9223 /* Generic argument checking recursion routine. PARAM is the argument to
9224 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9225 once the argument is resolved. CTX is context for the callback. */
9226 void
9231 {
9235 {
9236 /* Strip coercion. */
9240 }
9243 {
9245 tree attrs;
9248 /* See if this is a call to a known internationalization function
9249 that modifies a format arg. Such a function may have multiple
9250 format_arg attributes (for example, ngettext). */
9253 attrs;
9256 {
9257 tree inner_arg;
9258 tree format_num_expr;
9261 call_expr_arg_iterator iter;
9263 /* Extract the argument number, which was previously checked
9264 to be valid. */
9276 {
9281 }
9282 }
9284 /* If we found a format_arg attribute and did a recursive check,
9285 we are done with checking this argument. Otherwise, we continue
9286 and this will be considered a non-literal. */
9289 }
9292 {
9293 /* Check both halves of the conditional expression. */
9299 }
9302 }
9304 /* Checks for a builtin function FNDECL that the number of arguments
9305 NARGS against the required number REQUIRED and issues an error if
9306 there is a mismatch. Returns true if the number of arguments is
9307 correct, otherwise false. */
9309 static bool
9311 {
9313 {
9317 }
9319 {
9323 }
9325 }
9327 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9328 Returns false if there was an error, otherwise true. */
9330 bool
9332 {
9338 {
9348 {
9350 {
9354 }
9356 }
9366 {
9373 {
9377 }
9379 }
9384 {
9389 {
9393 }
9396 {
9398 fndecl);
9400 }
9402 }
9407 {
9409 {
9412 }
9414 }
9419 }
9420 }
9422 /* Function to help qsort sort FIELD_DECLs by name order. */
9424 int
9426 {
9431 /* A nontype is "greater" than a type. */
9440 }
9443 gt_pointer_operator new_value;
9447 /* This routine compares two fields like field_decl_cmp but using the
9448 pointer operator in resort_data. */
9450 static int
9452 {
9457 /* A nontype is "greater" than a type. */
9463 {
9470 }
9472 }
9474 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9476 void
9479 gt_pointer_operator new_value,
9481 {
9486 resort_field_decl_cmp);
9487 }
9489 /* Subroutine of c_parse_error.
9490 Return the result of concatenating LHS and RHS. RHS is really
9491 a string literal, its first character is indicated by RHS_START and
9492 RHS_SIZE is its length (including the terminating NUL character).
9494 The caller is responsible for deleting the returned pointer. */
9498 {
9504 }
9506 /* Issue the error given by GMSGID, indicating that it occurred before
9507 TOKEN, which had the associated VALUE. */
9509 void
9512 {
9513 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9523 {
9528 {
9541 }
9545 else
9551 }
9573 {
9578 }
9586 {
9591 }
9592 else
9596 {
9599 }
9600 #undef catenate_messages
9601 }
9603 /* Mapping for cpp message reasons to the options that enable them. */
9605 struct reason_option_codes_t
9606 {
9609 };
9629 };
9631 /* Return the gcc option code associated with the reason for a cpp
9632 message, or 0 if none. */
9634 static int
9636 {
9640 {
9643 }
9645 }
9647 /* Callback from cpp_error for PFILE to print diagnostics from the
9648 preprocessor. The diagnostic is of type LEVEL, with REASON set
9649 to the reason code if LEVEL is represents a warning, at location
9650 LOCATION unless this is after lexing and the compiler's location
9651 should be used instead, with column number possibly overridden by
9652 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9653 the arguments. Returns true if a diagnostic was emitted, false
9654 otherwise. */
9656 bool
9660 {
9661 diagnostic_info diagnostic;
9662 diagnostic_t dlevel;
9667 {
9672 /* Fall through. */
9697 }
9710 }
9712 /* Convert a character from the host to the target execution character
9713 set. cpplib handles this, mostly. */
9715 HOST_WIDE_INT
9717 {
9718 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9719 zero-extended under -fno-signed-char. cpplib insists that characters
9720 and character constants are always unsigned. Hence we must convert
9721 back and forth. */
9729 else
9731 }
9733 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9734 references with an INDIRECT_REF of a constant at the bottom; much like the
9735 traditional rendering of offsetof as a macro. Return the folded result. */
9737 tree
9739 {
9743 {
9759 {
9762 }
9772 {
9776 }
9790 /* Check if the offset goes beyond the upper bound of the array. */
9792 {
9798 {
9802 {
9803 tree v;
9810 {
9818 }
9819 /* Don't warn if the array might be considered a poor
9820 man's flexible array member with a very permissive
9821 definition thereof. */
9825 "index %E denotes an offset "
9828 }
9829 }
9830 }
9837 /* Handle static members of volatile structs. */
9844 }
9847 }
9849 /* Likewise, but convert it to the return type of offsetof. */
9851 tree
9853 {
9855 }
9857 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9858 expression, because B will always be true. */
9860 void
9862 {
9865 "the omitted middle operand in ?: will always be %<true%>, "
9867 }
9869 /* Give an error for storing into ARG, which is 'const'. USE indicates
9870 how ARG was being used. */
9872 void
9874 {
9877 /* Using this macro rather than (for example) arrays of messages
9878 ensures that all the format strings are checked at compile
9879 time. */
9880 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9881 : (use == lv_increment ? (I) \
9882 : (use == lv_decrement ? (D) : (AS))))
9884 {
9895 else
9901 }
9907 arg);
9913 arg);
9915 {
9925 arg);
9926 }
9932 arg);
9933 else
9938 arg);
9939 }
9941 /* Print an error message for an invalid lvalue. USE says
9942 how the lvalue is being used and so selects the error message. LOC
9943 is the location for the error. */
9945 void
9947 {
9949 {
9967 }
9968 }
9970 /* Print an error message for an invalid indirection of type TYPE.
9971 ERRSTRING is the name of the operator for the indirection. */
9973 void
9975 {
9977 {
9985 type);
9990 type);
9995 type);
10000 type);
10004 }
10005 }
10006 \f
10007 /* *PTYPE is an incomplete array. Complete it with a domain based on
10008 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10009 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10010 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10012 int
10014 {
10022 {
10024 {
10025 int eltsize
10028 }
10030 {
10034 {
10038 }
10039 else
10040 {
10041 tree curindex;
10052 {
10056 else
10057 {
10059 {
10060 /* Since we treat size types now as ordinary
10061 unsigned types, we need an explicit overflow
10062 check. */
10066 }
10068 size_one_node);
10069 }
10072 }
10074 {
10078 }
10079 }
10080 }
10081 else
10082 {
10083 /* Make an error message unless that happened already. */
10086 }
10087 }
10088 else
10089 {
10093 }
10096 /* Force an indefinite layout factor. */
10103 else
10106 /* Using build_distinct_type_copy and modifying things afterward instead
10107 of using build_array_type to create a new type preserves all of the
10108 TYPE_LANG_FLAG_? bits that the front end may have set. */
10116 /* Make sure we have the canonical MAIN_TYPE. */
10119 hashcode);
10122 /* Fix the canonical type. */
10132 else
10137 else
10143 {
10145 /* If we proceed with the array type as it is, we'll eventually
10146 crash in tree_low_cst(). */
10148 }
10152 }
10154 /* Like c_mark_addressable but don't check register qualifier. */
10155 void
10157 {
10163 }
10166 \f
10167 /* Used to help initialize the builtin-types.def table. When a type of
10168 the correct size doesn't exist, use error_mark_node instead of NULL.
10169 The later results in segfaults even when a decl using the type doesn't
10170 get invoked. */
10172 tree
10174 {
10177 }
10179 /* A helper function for resolve_overloaded_builtin in resolving the
10180 overloaded __sync_ builtins. Returns a positive power of 2 if the
10181 first operand of PARAMS is a pointer to a supported data type.
10182 Returns 0 if an error is encountered. */
10184 static int
10186 {
10187 tree type;
10191 {
10194 }
10208 incompatible:
10211 }
10213 /* A helper function for resolve_overloaded_builtin. Adds casts to
10214 PARAMS to make arguments match up with those of FUNCTION. Drops
10215 the variadic arguments at the end. Returns false if some error
10216 was encountered; true on success. */
10218 static bool
10221 {
10222 function_args_iterator iter;
10223 tree ptype;
10227 /* We've declared the implementation functions to use "volatile void *"
10228 as the pointer parameter, so we shouldn't get any complaints from the
10229 call to check_function_arguments what ever type the user used. */
10233 /* For the rest of the values, we need to cast these to FTYPE, so that we
10234 don't get warnings for passing pointer types, etc. */
10237 {
10241 /* XXX void_type_node belies the abstraction. */
10247 {
10250 }
10252 /* Only convert parameters if arg_type is unsigned integer type with
10253 new format sync routines, i.e. don't attempt to convert pointer
10254 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10255 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10256 kinds). */
10258 {
10259 /* Ideally for the first conversion we'd use convert_for_assignment
10260 so that we get warnings for anything that doesn't match the pointer
10261 type. This isn't portable across the C and C++ front ends atm. */
10266 }
10269 }
10271 /* __atomic routines are not variadic. */
10273 {
10276 }
10278 /* The definition of these primitives is variadic, with the remaining
10279 being "an optional list of variables protected by the memory barrier".
10280 No clue what that's supposed to mean, precisely, but we consider all
10281 call-clobbered variables to be protected so we're safe. */
10285 }
10287 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10288 RESULT to make it match the type of the first pointer argument in
10289 PARAMS. */
10291 static tree
10293 {
10298 /* New format doesn't require casting unless the types are the same size. */
10301 else
10303 }
10305 /* This function verifies the PARAMS to generic atomic FUNCTION.
10306 It returns the size if all the parameters are the same size, otherwise
10307 0 is returned if the parameters are invalid. */
10309 static int
10312 {
10317 tree type_0;
10319 /* Determine the parameter makeup. */
10321 {
10337 }
10340 {
10343 }
10345 /* Get type of first parameter, and determine its size. */
10348 {
10350 function);
10352 }
10354 /* Types must be compile time constant sizes. */
10356 {
10359 function);
10361 }
10365 /* Zero size objects are not allowed. */
10367 {
10370 function);
10372 }
10374 /* Check each other parameter is a pointer and the same size. */
10376 {
10379 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10383 {
10385 function);
10387 }
10390 {
10392 function);
10394 }
10395 }
10397 /* Check memory model parameters for validity. */
10399 {
10402 {
10405 {
10408 function);
10409 }
10410 }
10411 else
10413 {
10415 function);
10417 }
10418 }
10421 }
10424 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10425 at the beginning of the parameter list PARAMS representing the size of the
10426 objects. This is to match the library ABI requirement. LOC is the location
10427 of the function call.
10428 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10429 returned to allow the external call to be constructed. */
10431 static tree
10434 {
10435 tree size_node;
10437 /* Insert a SIZE_T parameter as the first param. If there isn't
10438 enough space, allocate a new vector and recursively re-build with that. */
10440 {
10443 tree f;
10452 }
10454 /* Add the size parameter and leave as a function call for processing. */
10458 }
10461 /* This will process an __atomic_exchange function call, determine whether it
10462 needs to be mapped to the _N variation, or turned into a library call.
10463 LOC is the location of the builtin call.
10464 FUNCTION is the DECL that has been invoked;
10465 PARAMS is the argument list for the call. The return value is non-null
10466 TRUE is returned if it is translated into the proper format for a call to the
10467 external library, and NEW_RETURN is set the tree for that function.
10468 FALSE is returned if processing for the _N variation is required, and
10469 NEW_RETURN is set to the the return value the result is copied into. */
10470 static bool
10473 {
10478 /* Size of 0 is an error condition. */
10480 {
10483 }
10485 /* If not a lock-free size, change to the library generic format. */
10487 {
10490 }
10492 /* Otherwise there is a lockfree match, transform the call from:
10493 void fn(T* mem, T* desired, T* return, model)
10494 into
10495 *return = (T) (fn (In* mem, (In) *desired, model)) */
10502 /* Create pointer to appropriate size. */
10506 /* Convert object pointer to required type. */
10509 /* Convert new value to required type, and dereference it. */
10514 /* Move memory model to the 3rd position, and end param list. */
10518 /* Convert return pointer and dereference it for later assignment. */
10522 }
10525 /* This will process an __atomic_compare_exchange function call, determine
10526 whether it needs to be mapped to the _N variation, or turned into a lib call.
10527 LOC is the location of the builtin call.
10528 FUNCTION is the DECL that has been invoked;
10529 PARAMS is the argument list for the call. The return value is non-null
10530 TRUE is returned if it is translated into the proper format for a call to the
10531 external library, and NEW_RETURN is set the tree for that function.
10532 FALSE is returned if processing for the _N variation is required. */
10534 static bool
10538 {
10543 /* Size of 0 is an error condition. */
10545 {
10548 }
10550 /* If not a lock-free size, change to the library generic format. */
10552 {
10553 /* The library generic format does not have the weak parameter, so
10554 remove it from the param list. Since a parameter has been removed,
10555 we can be sure that there is room for the SIZE_T parameter, meaning
10556 there will not be a recursive rebuilding of the parameter list, so
10557 there is no danger this will be done twice. */
10559 {
10563 }
10566 }
10568 /* Otherwise, there is a match, so the call needs to be transformed from:
10569 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10570 into
10571 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10577 /* Create pointer to appropriate size. */
10581 /* Convert object pointer to required type. */
10585 /* Convert expected pointer to required type. */
10589 /* Convert desired value to required type, and dereference it. */
10594 /* The rest of the parameters are fine. NULL means no special return value
10595 processing.*/
10598 }
10601 /* This will process an __atomic_load function call, determine whether it
10602 needs to be mapped to the _N variation, or turned into a library call.
10603 LOC is the location of the builtin call.
10604 FUNCTION is the DECL that has been invoked;
10605 PARAMS is the argument list for the call. The return value is non-null
10606 TRUE is returned if it is translated into the proper format for a call to the
10607 external library, and NEW_RETURN is set the tree for that function.
10608 FALSE is returned if processing for the _N variation is required, and
10609 NEW_RETURN is set to the the return value the result is copied into. */
10611 static bool
10614 {
10619 /* Size of 0 is an error condition. */
10621 {
10624 }
10626 /* If not a lock-free size, change to the library generic format. */
10628 {
10631 }
10633 /* Otherwise, there is a match, so the call needs to be transformed from:
10634 void fn(T* mem, T* return, model)
10635 into
10636 *return = (T) (fn ((In *) mem, model)) */
10642 /* Create pointer to appropriate size. */
10646 /* Convert object pointer to required type. */
10650 /* Move memory model to the 2nd position, and end param list. */
10654 /* Convert return pointer and dereference it for later assignment. */
10658 }
10661 /* This will process an __atomic_store function call, determine whether it
10662 needs to be mapped to the _N variation, or turned into a library call.
10663 LOC is the location of the builtin call.
10664 FUNCTION is the DECL that has been invoked;
10665 PARAMS is the argument list for the call. The return value is non-null
10666 TRUE is returned if it is translated into the proper format for a call to the
10667 external library, and NEW_RETURN is set the tree for that function.
10668 FALSE is returned if processing for the _N variation is required, and
10669 NEW_RETURN is set to the the return value the result is copied into. */
10671 static bool
10674 {
10679 /* Size of 0 is an error condition. */
10681 {
10684 }
10686 /* If not a lock-free size, change to the library generic format. */
10688 {
10691 }
10693 /* Otherwise, there is a match, so the call needs to be transformed from:
10694 void fn(T* mem, T* value, model)
10695 into
10696 fn ((In *) mem, (In) *value, model) */
10701 /* Create pointer to appropriate size. */
10705 /* Convert object pointer to required type. */
10709 /* Convert new value to required type, and dereference it. */
10714 /* The memory model is in the right spot already. Return is void. */
10718 }
10721 /* Some builtin functions are placeholders for other expressions. This
10722 function should be called immediately after parsing the call expression
10723 before surrounding code has committed to the type of the expression.
10725 LOC is the location of the builtin call.
10727 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10728 PARAMS is the argument list for the call. The return value is non-null
10729 when expansion is complete, and null if normal processing should
10730 continue. */
10732 tree
10735 {
10741 {
10747 else
10751 }
10753 /* Handle BUILT_IN_NORMAL here. */
10755 {
10760 {
10761 /* Handle these 4 together so that they can fall through to the next
10762 case if the call is transformed to an _N variant. */
10764 {
10766 {
10770 /* Change to the _N variant. */
10773 }
10776 {
10778 params,
10781 /* Change to the _N variant. */
10784 }
10786 {
10790 /* Change to the _N variant. */
10793 }
10795 {
10799 /* Change to the _N variant. */
10802 }
10805 }
10806 /* Fallthrough to the normal processing. */
10807 }
10824 {
10826 /* Fallthru for parameter processing. */
10827 }
10844 {
10855 orig_format))
10867 /* If new_return is set, assign function to that expr and cast the
10868 result to void since the generic interface returned void. */
10870 {
10871 /* Cast function result from I{1,2,4,8,16} to the required type. */
10874 result);
10878 }
10880 }
10884 }
10885 }
10887 /* vector_types_compatible_elements_p is used in type checks of vectors
10888 values used as operands of binary operators. Where it returns true, and
10889 the other checks of the caller succeed (being vector types in he first
10890 place, and matching number of elements), we can just treat the types
10891 as essentially the same.
10892 Contrast with vector_targets_convertible_p, which is used for vector
10893 pointer types, and vector_types_convertible_p, which will allow
10894 language-specific matches under the control of flag_lax_vector_conversions,
10895 and might still require a conversion. */
10896 /* True if vector types T1 and T2 can be inputs to the same binary
10897 operator without conversion.
10898 We don't check the overall vector size here because some of our callers
10899 want to give different error messages when the vectors are compatible
10900 except for the element count. */
10902 bool
10904 {
10917 /* Equality works here because c_common_signed_type uses
10918 TYPE_MAIN_VARIANT. */
10926 }
10928 /* Check for missing format attributes on function pointers. LTYPE is
10929 the new type or left-hand side type. RTYPE is the old type or
10930 right-hand side type. Returns TRUE if LTYPE is missing the desired
10931 attribute. */
10933 bool
10935 {
10937 tree ra;
10943 {
10944 tree la;
10949 }
10950 else
10952 }
10954 /* Subscripting with type char is likely to lose on a machine where
10955 chars are signed. So warn on any machine, but optionally. Don't
10956 warn for unsigned char since that type is safe. Don't warn for
10957 signed char because anyone who uses that must have done so
10958 deliberately. Furthermore, we reduce the false positive load by
10959 warning only for non-constant value of type char. */
10961 void
10963 {
10967 }
10969 /* Implement -Wparentheses for the unexpected C precedence rules, to
10970 cover cases like x + y << z which readers are likely to
10971 misinterpret. We have seen an expression in which CODE is a binary
10972 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10973 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10974 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10975 expression was not formed using a binary or unary operator, or it
10976 was enclosed in parentheses. */
10978 void
10982 {
10986 /* This macro tests that the expression ARG with original tree code
10987 CODE appears to be a boolean expression. or the result of folding a
10988 boolean expression. */
10989 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10990 (truth_value_p (TREE_CODE (ARG)) \
10991 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10993 || ((CODE) != INTEGER_CST \
10994 && (integer_onep (ARG) || integer_zerop (ARG))))
10997 {
11046 /* Check cases like x|y==z */
11053 /* Check cases like !x | y */
11057 "suggest parentheses around operand of "
11070 /* Check cases like x^y==z */
11092 /* Check cases like x&y==z */
11099 /* Check cases like !x & y */
11103 "suggest parentheses around operand of "
11126 {
11131 "comparisons like %<X<=Y<=Z%> do not "
11137 "comparisons like %<X<=Y<=Z%> do not "
11139 }
11141 }
11142 #undef NOT_A_BOOLEAN_EXPR_P
11143 }
11145 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11147 void
11149 {
11151 {
11154 else
11156 }
11157 }
11159 /* Warn for division by zero according to the value of DIVISOR. LOC
11160 is the location of the division operator. */
11162 void
11164 {
11165 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11166 about division by zero. Do not issue a warning if DIVISOR has a
11167 floating-point type, since we consider 0.0/0.0 a valid way of
11168 generating a NaN. */
11172 }
11174 /* Subroutine of build_binary_op. Give warnings for comparisons
11175 between signed and unsigned quantities that may fail. Do the
11176 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11177 so that casts will be considered, but default promotions won't
11178 be.
11180 LOCATION is the location of the comparison operator.
11182 The arguments of this function map directly to local variables
11183 of build_binary_op. */
11185 void
11190 {
11195 /* In C++, check for comparison of different enum types. */
11201 {
11205 }
11207 /* Do not warn if the comparison is being done in a signed type,
11208 since the signed type will only be chosen if it can represent
11209 all the values of the unsigned type. */
11212 /* Do not warn if both operands are unsigned. */
11215 else
11216 {
11222 else
11230 /* Do not warn if the signed quantity is an unsuffixed integer
11231 literal (or some static constant expression involving such
11232 literals or a conditional expression involving such literals)
11233 and it is non-negative. */
11236 /* Do not warn if the comparison is an equality operation, the
11237 unsigned quantity is an integral constant, and it would fit
11238 in the result if the result were signed. */
11243 /* In C, do not warn if the unsigned quantity is an enumeration
11244 constant and its maximum value would fit in the result if the
11245 result were signed. */
11251 else
11253 OPT_Wsign_compare,
11255 }
11257 /* Warn if two unsigned values are being compared in a size larger
11258 than their original size, and one (and only one) is the result of
11259 a `~' operator. This comparison will always fail.
11261 Also warn if one operand is a constant, and the constant does not
11262 have all bits set that are set in the ~ operand when it is
11263 extended. */
11270 {
11277 {
11278 tree primop;
11284 {
11288 }
11289 else
11290 {
11294 }
11299 {
11302 {
11306 else
11309 }
11310 }
11311 }
11319 }
11320 }
11322 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11323 type via c_common_type. If -Wdouble-promotion is in use, and the
11324 conditions for warning have been met, issue a warning. GMSGID is
11325 the warning message. It must have two %T specifiers for the type
11326 that was converted (generally "float") and the type to which it was
11327 converted (generally "double), respectively. LOC is the location
11328 to which the awrning should refer. */
11330 void
11333 {
11334 tree source_type;
11338 /* If the conversion will not occur at run-time, there is no need to
11339 warn about it. */
11351 else
11354 }
11356 /* Setup a TYPE_DECL node as a typedef representation.
11358 X is a TYPE_DECL for a typedef statement. Create a brand new
11359 ..._TYPE node (which will be just a variant of the existing
11360 ..._TYPE node with identical properties) and then install X
11361 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11363 The whole point here is to end up with a situation where each
11364 and every ..._TYPE node the compiler creates will be uniquely
11365 associated with AT MOST one node representing a typedef name.
11366 This way, even though the compiler substitutes corresponding
11367 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11368 early on, later parts of the compiler can always do the reverse
11369 translation and get back the corresponding typedef name. For
11370 example, given:
11372 typedef struct S MY_TYPE;
11373 MY_TYPE object;
11375 Later parts of the compiler might only know that `object' was of
11376 type `struct S' if it were not for code just below. With this
11377 code however, later parts of the compiler see something like:
11379 struct S' == struct S
11380 typedef struct S' MY_TYPE;
11381 struct S' object;
11383 And they can then deduce (from the node for type struct S') that
11384 the original object declaration was:
11386 MY_TYPE object;
11388 Being able to do this is important for proper support of protoize,
11389 and also for generating precise symbolic debugging information
11390 which takes full account of the programmer's (typedef) vocabulary.
11392 Obviously, we don't want to generate a duplicate ..._TYPE node if
11393 the TYPE_DECL node that we are now processing really represents a
11394 standard built-in type. */
11396 void
11398 {
11402 {
11405 }
11408 {
11416 }
11417 }
11419 /* Record the types used by the current global variable declaration
11420 being parsed, so that we can decide later to emit their debug info.
11421 Those types are in types_used_by_cur_var_decl, and we are going to
11422 store them in the types_used_by_vars_hash hash table.
11423 DECL is the declaration of the global variable that has been parsed. */
11425 void
11427 {
11431 {
11434 }
11435 }
11437 /* If DECL is a typedef that is declared in the current function,
11438 record it for the purpose of -Wunused-local-typedefs. */
11440 void
11442 {
11447 /* if this is not a locally defined typedef then we are not
11448 interested. */
11455 }
11457 /* If T is a TYPE_DECL declared locally, mark it as used. */
11459 void
11461 {
11466 }
11468 /* Warn if there are some unused locally defined typedefs in the
11469 current function. */
11471 void
11473 {
11475 tree decl;
11476 /* The number of times we have emitted -Wunused-local-typedefs
11477 warnings. If this is different from errorcount, that means some
11478 unrelated errors have been issued. In which case, we'll avoid
11479 emitting "unused-local-typedefs" warnings. */
11491 {
11495 OPT_Wunused_local_typedefs,
11498 }
11501 }
11503 /* The C and C++ parsers both use vectors to hold function arguments.
11504 For efficiency, we keep a cache of unused vectors. This is the
11505 cache. */
11510 /* Return a new vector from the cache. If the cache is empty,
11511 allocate a new vector. These vectors are GC'ed, so it is OK if the
11512 pointer is not released.. */
11516 {
11519 else
11520 {
11521 /* Passing 0 to vec::alloc returns NULL, and our callers require
11522 that we always return a non-NULL value. The vector code uses
11523 4 when growing a NULL vector, so we do too. */
11527 }
11528 }
11530 /* Release a vector of trees back to the cache. */
11532 void
11534 {
11536 {
11539 }
11540 }
11542 /* Get a new tree vector holding a single tree. */
11546 {
11550 }
11552 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11556 {
11561 }
11563 /* Get a new tree vector which is a copy of an existing one. */
11567 {
11570 tree t;
11577 }
11579 /* Return true if KEYWORD starts a type specifier. */
11581 bool
11583 {
11585 {
11615 }
11616 }
11618 /* Return true if KEYWORD names a type qualifier. */
11620 bool
11622 {
11624 {
11631 }
11632 }
11634 /* Return true if KEYWORD names a storage class specifier.
11636 RID_TYPEDEF is not included in this list despite `typedef' being
11637 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11638 such for syntactic convenience only. */
11640 bool
11642 {
11644 {
11654 }
11655 }
11657 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11659 static bool
11661 {
11663 {
11671 }
11672 }
11674 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11675 declaration-specifier (C99 6.7). */
11677 bool
11679 {
11686 {
11693 }
11694 }
11696 /* Initialize language-specific-bits of tree_contains_struct. */
11698 void
11700 {
11704 }
11706 /* Build a user-defined numeric literal out of an integer constant type VALUE
11707 with identifier SUFFIX. */
11709 tree
11712 {
11719 }
11721 /* For vector[index], convert the vector to a
11722 pointer of the underlying type. */
11723 void
11726 {
11728 {
11730 tree type1;
11744 }
11745 }
11747 /* Determine which of the operands, if any, is a scalar that needs to be
11748 converted to a vector, for the range of operations. */
11749 enum stv_conv
11752 {
11761 {
11762 /* Most GENERIC binary expressions require homogeneous arguments.
11763 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11764 argument that is a vector and a second one that is a scalar, so
11765 we never return stv_secondarg for them. */
11770 {
11772 {
11777 }
11778 else
11780 }
11787 /* ... fall through ... */
11808 /* What about UNLT_EXPR? */
11810 {
11811 tree tmp;
11813 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11816 }
11820 {
11822 {
11827 }
11829 }
11831 /* Allow integer --> real conversion if safe. */
11835 {
11837 {
11842 }
11844 }
11847 }
11850 }
11852 /* Return true iff ALIGN is an integral constant that is a fundamental
11853 alignment, as defined by [basic.align] in the c++-11
11854 specifications.
11856 That is:
11858 [A fundamental alignment is represented by an alignment less than or
11859 equal to the greatest alignment supported by the implementation
11860 in all contexts, which is equal to
11861 alignof(max_align_t)]. */
11863 bool
11865 {
11868 }