| blob | 2147a14f659dba75cde9f448cc3f0b25b9f3bc22 |
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 {
583 /* These Objective-C keywords are recognized only immediately after
584 an '@'. */
601 /* These are recognized only in protocol-qualifier context
602 (see above) */
610 /* UPC keywords */
622 /* These are recognized inside a property attribute list */
631 };
636 /* Table of machine-independent attributes common to all C-like languages. */
638 {
639 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
640 affects_type_identity } */
647 /* FIXME: logically, noreturn attributes should be listed as
648 "false, true, true" and apply to function types. But implementing this
649 would require all the places in the compiler that use TREE_THIS_VOLATILE
650 on a decl to identify non-returning functions to be located and fixed
651 to check the function type instead. */
676 /* The same comments as for noreturn attributes apply to const ones. */
700 handle_no_instrument_function_attribute,
718 /* ??? These two attributes didn't make the transition from the
719 Intel language document to the multi-vendor language document. */
724 /* For internal use (marking of builtins) only. The name contains space
725 to prevent its usage in source code. */
747 /* For internal use (marking of builtins) only. The name contains space
748 to prevent its usage in source code. */
759 handle_no_address_safety_analysis_attribute,
762 handle_no_sanitize_address_attribute,
765 handle_no_sanitize_undefined_attribute,
775 /* For internal use only. The leading '*' both prevents its usage in
776 source code and signals that it may be overridden by machine tables. */
781 /* For internal use (marking of builtins and runtime functions) only.
782 The name contains space to prevent its usage in source code. */
798 };
800 /* Give the specifications for the format attributes, used by C and all
801 descendants. */
804 {
805 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
806 affects_type_identity } */
812 };
814 /* Return identifier for address space AS. */
818 {
822 }
824 /* Push current bindings for the function name VAR_DECLS. */
826 void
828 {
833 {
837 {
839 saved);
841 }
842 }
844 /* Normally they'll have been NULL, so only push if we've got a
845 stack, or they are non-NULL. */
847 saved_function_name_decls);
848 }
850 /* Finish up the current bindings, adding them into the current function's
851 statement tree. This must be done _before_ finish_stmt_tree is called.
852 If there is no current function, we must be at file scope and no statements
853 are involved. Pop the previous bindings. */
855 void
857 {
866 {
874 }
880 {
881 /* We had saved values, restore them. */
882 tree saved;
885 {
890 }
892 }
894 }
896 /* Return the text name of the current function, suitably prettified
897 by PRETTY_P. Return string must be freed by caller. */
901 {
908 {
911 }
924 {
927 }
930 }
932 /* Return the VAR_DECL for a const char array naming the current
933 function. If the VAR_DECL has not yet been created, create it
934 now. RID indicates how it should be formatted and IDENTIFIER_NODE
935 ID is its name (unfortunately C and C++ hold the RID values of
936 keywords in different places, so we can't derive RID from ID in
937 this language independent code. LOC is the location of the
938 function. */
940 tree
942 {
952 {
953 /* If a tree is built here, it would normally have the lineno of
954 the current statement. Later this tree will be moved to the
955 beginning of the function and this line number will be wrong.
956 To avoid this problem set the lineno to 0 here; that prevents
957 it from appearing in the RTL. */
958 tree stmts;
966 saved_function_name_decls
970 }
975 }
977 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
979 tree
981 {
986 /* Compute the number of elements, for the array type. */
988 {
991 }
993 {
996 }
998 {
1001 }
1002 else
1003 {
1006 }
1008 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1009 limit in C++98 Annex B is very large (65536) and is not normative,
1010 so we do not diagnose it (warn_overlength_strings is forced off
1011 in c_common_post_options). */
1013 {
1017 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1018 separate the %d from the 'C'. 'ISO' should not be
1019 translated, but it may be moved after 'C%d' in languages
1020 where modifiers follow nouns. */
1022 "string length %qd is greater than the length %qd "
1025 }
1027 /* Create the array type for the string constant. The ISO C++
1028 standard says that a string literal has type `const char[N]' or
1029 `const wchar_t[N]'. We use the same logic when invoked as a C
1030 front-end with -Wwrite-strings.
1031 ??? We should change the type of an expression depending on the
1032 state of a warning flag. We should just be warning -- see how
1033 this is handled in the C++ front-end for the deprecated implicit
1034 conversion from string literals to `char*' or `wchar_t*'.
1036 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1037 array type being the unqualified version of that type.
1038 Therefore, if we are constructing an array of const char, we must
1039 construct the matching unqualified array type first. The C front
1040 end does not require this, but it does no harm, so we do it
1041 unconditionally. */
1052 }
1053 \f
1054 /* If DISABLE is true, stop issuing warnings. This is used when
1055 parsing code that we know will not be executed. This function may
1056 be called multiple times, and works as a stack. */
1058 static void
1060 {
1062 {
1065 }
1066 }
1068 /* If ENABLE is true, reenable issuing warnings. */
1070 static void
1072 {
1074 {
1077 }
1078 }
1080 /* Fully fold EXPR, an expression that was not folded (beyond integer
1081 constant expressions and null pointer constants) when being built
1082 up. If IN_INIT, this is in a static initializer and certain
1083 changes are made to the folding done. Clear *MAYBE_CONST if
1084 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1085 expression because it contains an evaluated operator (in C99) or an
1086 operator outside of sizeof returning an integer constant (in C90)
1087 not permitted in constant expressions, or because it contains an
1088 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1089 set to true by callers before calling this function.) Return the
1090 folded expression. Function arguments have already been folded
1091 before calling this function, as have the contents of SAVE_EXPR,
1092 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1093 C_MAYBE_CONST_EXPR. */
1095 tree
1097 {
1098 tree ret;
1104 /* This function is not relevant to C++ because C++ folds while
1105 parsing, and may need changes to be correct for C++ when C++
1106 stops folding while parsing. */
1113 {
1116 }
1123 }
1125 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1126 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1127 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1128 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1129 both evaluated and unevaluated subexpressions while
1130 *MAYBE_CONST_ITSELF is carried from only evaluated
1131 subexpressions). */
1133 static tree
1136 {
1148 /* This function is not relevant to C++ because C++ folds while
1149 parsing, and may need changes to be correct for C++ when C++
1150 stops folding while parsing. */
1154 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1155 anything else not counted as an expression cannot usefully be
1156 folded further at this point. */
1162 /* Operands of variable-length expressions (function calls) have
1163 already been folded, as have __builtin_* function calls, and such
1164 expressions cannot occur in constant expressions. */
1166 {
1170 }
1173 {
1182 else
1185 }
1187 /* Assignment, increment, decrement, function call and comma
1188 operators, and statement expressions, cannot occur in constant
1189 expressions if evaluated / outside of sizeof. (Function calls
1190 were handled above, though VA_ARG_EXPR is treated like a function
1191 call here, and statement expressions are handled through
1192 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1194 {
1214 }
1216 /* Fold individual tree codes as appropriate. */
1218 {
1220 /* Any non-constancy will have been marked in a containing
1221 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1229 maybe_const_itself);
1234 {
1237 }
1246 maybe_const_itself);
1249 maybe_const_itself);
1255 {
1259 }
1301 /* Binary operations evaluating both arguments (increment and
1302 decrement are binary internally in GCC). */
1306 maybe_const_itself);
1314 /* The RHS of a MODIFY_EXPR was fully folded when building that
1315 expression for the sake of conversion warnings. */
1318 maybe_const_itself);
1322 ret = in_init
1325 else
1338 {
1349 }
1355 CASE_CONVERT:
1365 /* Unary operations. */
1368 maybe_const_itself);
1372 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1373 not prepared to deal with them if they occur in initializers.
1374 Avoid attempts to fold references to UPC shared components
1375 due to the complexities of UPC pointer-to-shared arithmetic. */
1384 ret = in_init
1387 else
1392 {
1396 }
1398 {
1401 CASE_CONVERT:
1402 /* Don't warn about explicit conversions. We will already
1403 have warned about suspect implicit conversions. */
1410 }
1415 /* Binary operations not necessarily evaluating both
1416 arguments. */
1423 ? truthvalue_false_node
1431 ret = in_init
1434 else
1439 && op0_const
1440 && op0_const_self
1446 && op0_const_self
1472 else
1477 && op0_const
1478 && op0_const_self
1482 && op0_const_self
1486 && op0_const
1487 && op0_const_self
1491 && op0_const_self
1497 /* Each case where an operand with excess precision may be
1498 encountered must remove the EXCESS_PRECISION_EXPR around
1499 inner operands and possibly put one around the whole
1500 expression or possibly convert to the semantic type (which
1501 c_fully_fold does); we cannot tell at this stage which is
1502 appropriate in any particular case. */
1506 /* Various codes may appear through folding built-in functions
1507 and their arguments. */
1509 }
1511 out:
1512 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1513 have been done by this point, so remove them again. */
1517 {
1521 }
1525 }
1527 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1528 return EXP. Otherwise, return either EXP or its known constant
1529 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1530 Is the BLKmode test appropriate? */
1532 tree
1534 {
1535 tree ret;
1537 /* This function is only used by C, for c_fully_fold and other
1538 optimization, and may not be correct for C++. */
1549 /* Avoid unwanted tree sharing between the initializer and current
1550 function's body where the tree can be modified e.g. by the
1551 gimplifier. */
1555 }
1557 /* Print a warning if a constant expression had overflow in folding.
1558 Invoke this function on every expression that the language
1559 requires to be a constant expression.
1560 Note the ANSI C standard says it is erroneous for a
1561 constant expression to overflow. */
1563 void
1565 {
1573 }
1575 /* The same as above but print an unconditional error. */
1576 void
1578 {
1585 }
1587 /* Print a warning if an expression had overflow in folding and its
1588 operands hadn't.
1590 Invoke this function on every expression that
1591 (1) appears in the source code, and
1592 (2) is a constant expression that overflowed, and
1593 (3) is not already checked by convert_and_check;
1594 however, do not invoke this function on operands of explicit casts
1595 or when the expression is the result of an operator and any operand
1596 already overflowed. */
1598 void
1600 {
1605 {
1634 }
1635 }
1637 /* Warn about uses of logical || / && operator in a context where it
1638 is likely that the bitwise equivalent was intended by the
1639 programmer. We have seen an expression in which CODE is a binary
1640 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1641 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1642 void
1646 {
1658 /* Warn if &&/|| are being used in a context where it is
1659 likely that the bitwise equivalent was intended by the
1660 programmer. That is, an expression such as op && MASK
1661 where op should not be any boolean expression, nor a
1662 constant, and mask seems to be a non-boolean integer constant. */
1670 {
1674 else
1679 }
1681 /* We do not warn for constants because they are typical of macro
1682 expansions that test for features. */
1686 /* This warning only makes sense with logical operands. */
1694 /* We first test whether either side separately is trivially true
1695 (with OR) or trivially false (with AND). If so, do not warn.
1696 This is a common idiom for testing ranges of data types in
1697 portable code. */
1704 /* If this is an OR operation, invert both sides; now, the result
1705 should be always false to get a warning. */
1719 /* If this is an OR operation, invert both sides; now, the result
1720 should be always false to get a warning. */
1728 /* If both expressions have the same operand, if we can merge the
1729 ranges, and if the range test is always false, then warn. */
1736 {
1739 "logical %<or%> "
1741 else
1743 "logical %<and%> "
1745 }
1746 }
1749 /* Warn if EXP contains any computations whose results are not used.
1750 Return true if a warning is printed; false otherwise. LOCUS is the
1751 (potential) location of the expression. */
1753 bool
1755 {
1756 restart:
1760 /* Don't warn about void constructs. This includes casting to void,
1761 void function calls, and statement expressions with a final cast
1762 to void. */
1770 {
1786 /* For a binding, warn if no side effect within it. */
1798 /* In && or ||, warn if 2nd operand has no side effect. */
1805 /* Let people do `(foo (), 0)' without a warning. */
1812 /* If this is an expression with side effects, don't warn; this
1813 case commonly appears in macro expansions. */
1819 /* Don't warn about automatic dereferencing of references, since
1820 the user cannot control it. */
1822 {
1825 }
1826 /* Fall through. */
1829 /* Referencing a volatile value is a side effect, so don't warn. */
1834 /* If this is an expression which has no operands, there is no value
1835 to be unused. There are no such language-independent codes,
1836 but front ends may define such. */
1840 warn:
1842 }
1843 }
1846 /* Print a warning about casts that might indicate violation
1847 of strict aliasing rules if -Wstrict-aliasing is used and
1848 strict aliasing mode is in effect. OTYPE is the original
1849 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1851 bool
1853 {
1854 /* Strip pointer conversion chains and get to the correct original type. */
1862 /* If the type we are casting to is a ref-all pointer
1863 dereferencing it is always valid. */
1870 {
1871 /* Casting the address of an object to non void pointer. Warn
1872 if the cast breaks type based aliasing. */
1874 {
1878 }
1879 else
1880 {
1881 /* warn_strict_aliasing >= 3. This includes the default (3).
1882 Only warn if the cast is dereferenced immediately. */
1883 alias_set_type set1 =
1889 {
1893 }
1896 {
1900 }
1901 }
1902 }
1903 else
1905 {
1906 /* At this level, warn for any conversions, even if an address is
1907 not taken in the same statement. This will likely produce many
1908 false positives, but could be useful to pinpoint problems that
1909 are not revealed at higher levels. */
1914 {
1918 }
1919 }
1922 }
1924 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1925 sizeof as last operand of certain builtins. */
1927 void
1931 {
1935 location_t loc;
1943 {
1947 /* FALLTHRU */
1955 /* FALLTHRU */
2014 }
2042 {
2046 {
2049 "argument to %<sizeof%> in %qD call is the same "
2050 "expression as the destination; did you mean to "
2056 "argument to %<sizeof%> in %qD call is the same "
2057 "expression as the destination; did you mean to "
2059 else
2061 "argument to %<sizeof%> in %qD call is the same "
2062 "expression as the destination; did you mean to "
2065 }
2068 && !strop
2071 {
2073 "argument to %<sizeof%> in %qD call is the same "
2074 "pointer type %qT as the destination; expected %qT "
2078 }
2079 }
2082 {
2086 {
2089 "argument to %<sizeof%> in %qD call is the same "
2090 "expression as the source; did you mean to "
2096 "argument to %<sizeof%> in %qD call is the same "
2097 "expression as the source; did you mean to "
2099 else
2101 "argument to %<sizeof%> in %qD call is the same "
2102 "expression as the source; did you mean to "
2105 }
2108 && !strop
2111 {
2113 "argument to %<sizeof%> in %qD call is the same "
2114 "pointer type %qT as the source; expected %qT "
2118 }
2119 }
2122 {
2126 {
2129 "argument to %<sizeof%> in %qD call is the same "
2130 "expression as the first source; did you mean to "
2136 "argument to %<sizeof%> in %qD call is the same "
2137 "expression as the first source; did you mean to "
2139 else
2141 "argument to %<sizeof%> in %qD call is the same "
2142 "expression as the first source; did you mean to "
2145 }
2148 && !strop
2151 {
2153 "argument to %<sizeof%> in %qD call is the same "
2154 "pointer type %qT as the first source; expected %qT "
2158 }
2159 }
2162 {
2166 {
2169 "argument to %<sizeof%> in %qD call is the same "
2170 "expression as the second source; did you mean to "
2176 "argument to %<sizeof%> in %qD call is the same "
2177 "expression as the second source; did you mean to "
2179 else
2181 "argument to %<sizeof%> in %qD call is the same "
2182 "expression as the second source; did you mean to "
2185 }
2188 && !strop
2191 {
2193 "argument to %<sizeof%> in %qD call is the same "
2194 "pointer type %qT as the second source; expected %qT "
2198 }
2199 }
2201 }
2203 /* Warn for unlikely, improbable, or stupid DECL declarations
2204 of `main'. */
2206 void
2208 {
2209 function_args_iterator iter;
2210 tree type;
2214 {
2215 /* XXX void_type_node belies the abstraction. */
2221 {
2243 "third argument of %q+D should probably be "
2246 }
2247 }
2249 /* It is intentional that this message does not mention the third
2250 argument because it's only mentioned in an appendix of the
2251 standard. */
2255 }
2257 /* vector_targets_convertible_p is used for vector pointer types. The
2258 callers perform various checks that the qualifiers are satisfactory,
2259 while OTOH vector_targets_convertible_p ignores the number of elements
2260 in the vectors. That's fine with vector pointers as we can consider,
2261 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2262 and that does not require and conversion of the pointer values.
2263 In contrast, vector_types_convertible_p and
2264 vector_types_compatible_elements_p are used for vector value types. */
2265 /* True if pointers to distinct types T1 and T2 can be converted to
2266 each other without an explicit cast. Only returns true for opaque
2267 vector types. */
2268 bool
2270 {
2277 }
2279 /* vector_types_convertible_p is used for vector value types.
2280 It could in principle call vector_targets_convertible_p as a subroutine,
2281 but then the check for vector type would be duplicated with its callers,
2282 and also the purpose of vector_targets_convertible_p would become
2283 muddled.
2284 Where vector_types_convertible_p returns true, a conversion might still be
2285 needed to make the types match.
2286 In contrast, vector_targets_convertible_p is used for vector pointer
2287 values, and vector_types_compatible_elements_p is used specifically
2288 in the context for binary operators, as a check if use is possible without
2289 conversion. */
2290 /* True if vector types T1 and T2 can be converted to each other
2291 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2292 can only be converted with -flax-vector-conversions yet that is not
2293 in effect, emit a note telling the user about that option if such
2294 a note has not previously been emitted. */
2295 bool
2297 {
2305 convertible_lax =
2320 {
2323 "conversions between vectors with differing "
2325 }
2328 }
2330 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2331 and have vector types, V0 has the same type as V1, and the number of
2332 elements of V0, V1, MASK is the same.
2334 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2335 called with two arguments. In this case implementation passes the
2336 first argument twice in order to share the same tree code. This fact
2337 could enable the mask-values being twice the vector length. This is
2338 an implementation accident and this semantics is not guaranteed to
2339 the user. */
2340 tree
2343 {
2344 tree ret;
2350 {
2353 }
2361 {
2366 }
2370 {
2374 }
2377 {
2382 }
2388 {
2391 "argument vector(s) and the mask vector should "
2394 }
2398 {
2403 }
2406 {
2407 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2413 else
2414 {
2417 }
2421 }
2431 }
2433 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2434 to integral type. */
2436 static tree
2438 {
2443 {
2444 /* C++0x scoped enumerations don't implicitly convert to integral
2445 type; if we stripped an explicit conversion to a larger type we
2446 need to replace it so common_type will still work. */
2450 }
2452 }
2454 /* This is a helper function of build_binary_op.
2456 For certain operations if both args were extended from the same
2457 smaller type, do the arithmetic in that type and then extend.
2459 BITWISE indicates a bitwise operation.
2460 For them, this optimization is safe only if
2461 both args are zero-extended or both are sign-extended.
2462 Otherwise, we might change the result.
2463 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2464 but calculated in (unsigned short) it would be (unsigned short)-1.
2465 */
2466 tree
2468 {
2472 tree type;
2474 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2475 excessive narrowing when we call get_narrower below. For
2476 example, suppose that OP0 is of unsigned int extended
2477 from signed char and that RESULT_TYPE is long long int.
2478 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2479 like
2481 (long long int) (unsigned int) signed_char
2483 which get_narrower would narrow down to
2485 (unsigned int) signed char
2487 If we do not cast OP0 first, get_narrower would return
2488 signed_char, which is inconsistent with the case of the
2489 explicit cast. */
2496 /* UNS is 1 if the operation to be done is an unsigned one. */
2499 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2500 but it *requires* conversion to FINAL_TYPE. */
2511 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2513 /* For bitwise operations, signedness of nominal type
2514 does not matter. Consider only how operands were extended. */
2518 /* Note that in all three cases below we refrain from optimizing
2519 an unsigned operation on sign-extended args.
2520 That would not be valid. */
2522 /* Both args variable: if both extended in same way
2523 from same width, do it in that width.
2524 Do it unsigned if args were zero-extended. */
2531 return c_common_signed_or_unsigned_type
2538 && (type
2549 && (type
2557 }
2559 /* Checks if expression EXPR of real/integer type cannot be converted
2560 to the real/integer type TYPE. Function returns true when:
2561 * EXPR is a constant which cannot be exactly converted to TYPE
2562 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2563 for EXPR type and TYPE being both integers or both real.
2564 * EXPR is not a constant of real type and TYPE is an integer.
2565 * EXPR is not a constant of integer type which cannot be
2566 exactly converted to real type.
2567 Function allows conversions between types of different signedness and
2568 does not return true in that case. Function can produce signedness
2569 warnings if PRODUCE_WARNS is true. */
2570 bool
2572 {
2578 {
2579 /* Warn for real constant that is not an exact integer converted
2580 to integer type. */
2583 {
2586 }
2587 /* Warn for an integer constant that does not fit into integer type. */
2591 {
2594 {
2598 }
2600 {
2604 }
2605 else
2607 }
2609 {
2610 /* Warn for an integer constant that does not fit into real type. */
2612 {
2616 }
2617 /* Warn for a real constant that does not fit into a smaller
2618 real type. */
2621 {
2625 }
2626 }
2627 }
2628 else
2629 {
2630 /* Warn for real types converted to integer types. */
2637 {
2638 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2642 /* Don't warn for short y; short x = ((int)y & 0xff); */
2646 {
2647 /* If both args were extended from a shortest type,
2648 use that type if that is safe. */
2655 {
2661 /* If one of the operands is a non-negative constant
2662 that fits in the target type, then the type of the
2663 other operand does not matter. */
2672 /* If constant is unsigned and fits in the target
2673 type, then the result will also fit. */
2675 && unsigned0
2678 && unsigned1
2681 }
2682 }
2683 /* Warn for integer types converted to smaller integer types. */
2687 /* When they are the same width but different signedness,
2688 then the value may change. */
2691 /* Even when converted to a bigger type, if the type is
2692 unsigned but expr is signed, then negative values
2693 will be changed. */
2699 }
2701 /* Warn for integer types converted to real types if and only if
2702 all the range of values of the integer type cannot be
2703 represented by the real type. */
2706 {
2710 /* Don't warn about char y = 0xff; float x = (int) y; */
2722 }
2724 /* Warn for real types converted to smaller real types. */
2729 }
2732 }
2734 /* Warns if the conversion of EXPR to TYPE may alter a value.
2735 This is a helper function for warnings_for_convert_and_check. */
2737 static void
2739 {
2747 {
2760 /* Conversion from boolean to a signed:1 bit-field (which only
2761 can hold the values 0 and -1) doesn't lose information - but
2762 it does change the value. */
2777 {
2778 /* In case of COND_EXPR, we do not care about the type of
2779 COND_EXPR, only about the conversion of each operand. */
2786 }
2793 }
2794 }
2796 /* Produce warnings after a conversion. RESULT is the result of
2797 converting EXPR to TYPE. This is a helper function for
2798 convert_and_check and cp_convert_and_check. */
2800 void
2802 {
2809 {
2810 /* Do not diagnose overflow in a constant expression merely
2811 because a conversion overflowed. */
2816 {
2817 /* This detects cases like converting -129 or 256 to
2818 unsigned char. */
2822 else
2824 }
2828 /* No warning for converting 0x80000000 to int. */
2836 else
2838 }
2843 else
2845 }
2848 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2849 Invoke this function on every expression that is converted implicitly,
2850 i.e. because of language rules and not because of an explicit cast. */
2852 tree
2854 {
2855 tree result;
2856 tree expr_for_warning;
2858 /* Convert from a value with possible excess precision rather than
2859 via the semantic type, but do not warn about values not fitting
2860 exactly in the semantic type. */
2862 {
2868 }
2869 else
2883 }
2884 \f
2885 /* A node in a list that describes references to variables (EXPR), which are
2886 either read accesses if WRITER is zero, or write accesses, in which case
2887 WRITER is the parent of EXPR. */
2888 struct tlist
2889 {
2892 };
2894 /* Used to implement a cache the results of a call to verify_tree. We only
2895 use this for SAVE_EXPRs. */
2896 struct tlist_cache
2897 {
2901 tree expr;
2902 };
2904 /* Obstack to use when allocating tlist structures, and corresponding
2905 firstobj. */
2909 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2910 warnings. */
2912 /* SAVE_EXPRs need special treatment. We process them only once and then
2913 cache the results. */
2925 /* Create a new struct tlist and fill in its fields. */
2928 {
2935 }
2937 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2938 is nonnull, we ignore any node we find which has a writer equal to it. */
2940 static void
2942 {
2944 {
2951 }
2952 }
2954 /* Merge the nodes of ADD into TO. This merging process is done so that for
2955 each variable that already exists in TO, no new node is added; however if
2956 there is a write access recorded in ADD, and an occurrence on TO is only
2957 a read access, then the occurrence in TO will be modified to record the
2958 write. */
2960 static void
2962 {
2969 {
2976 {
2980 }
2982 {
2986 }
2988 }
2989 }
2991 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2992 references in list LIST conflict with it, excluding reads if ONLY writers
2993 is nonzero. */
2995 static void
2998 {
3001 /* Avoid duplicate warnings. */
3007 {
3011 {
3016 }
3018 }
3019 }
3021 /* Given a list LIST of references to variables, find whether any of these
3022 can cause conflicts due to missing sequence points. */
3024 static void
3026 {
3030 {
3033 }
3034 }
3036 /* Return nonzero if X is a tree that can be verified by the sequence point
3037 warnings. */
3038 static int
3040 {
3047 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3048 (lvalue_p) crash on TRY/CATCH. */
3055 /* No point to track non-const calls, they will never satisfy
3056 operand_equal_p. */
3064 }
3066 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3067 static bool
3069 {
3071 }
3073 /* Walk the tree X, and record accesses to variables. If X is written by the
3074 parent tree, WRITER is the parent.
3075 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3076 expression or its only operand forces a sequence point, then everything up
3077 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3078 in PNO_SP.
3079 Once we return, we will have emitted warnings if any subexpression before
3080 such a sequence point could be undefined. On a higher level, however, the
3081 sequence point may not be relevant, and we'll merge the two lists.
3083 Example: (b++, a) + b;
3084 The call that processes the COMPOUND_EXPR will store the increment of B
3085 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3086 processes the PLUS_EXPR will need to merge the two lists so that
3087 eventually, all accesses end up on the same list (and we'll warn about the
3088 unordered subexpressions b++ and b.
3090 A note on merging. If we modify the former example so that our expression
3091 becomes
3092 (b++, b) + a
3093 care must be taken not simply to add all three expressions into the final
3094 PNO_SP list. The function merge_tlist takes care of that by merging the
3095 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3096 way, so that no more than one access to B is recorded. */
3098 static void
3100 tree writer)
3101 {
3106 /* X may be NULL if it is the operand of an empty statement expression
3107 ({ }). */
3111 restart:
3119 {
3152 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3153 two first, to avoid warning for (a ? b++ : b++). */
3169 /* Expressions inside the LHS are not ordered wrt. the sequence points
3170 in the RHS. Example:
3171 *a = (a++, 2)
3172 Despite the fact that the modification of "a" is in the before_sp
3173 list (tmp_before), it conflicts with the use of "a" in the LHS.
3174 We can handle this by adding the contents of tmp_list3
3175 to those of tmp_before, and redoing the collision warnings for that
3176 list. */
3179 /* Exclude the LHS itself here; we first have to merge it into the
3180 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3181 didn't exclude the LHS, we'd get it twice, once as a read and once
3182 as a write. */
3193 /* We need to warn about conflicts among arguments and conflicts between
3194 args and the function address. Side effects of the function address,
3195 however, are not ordered by the sequence point of the call. */
3196 {
3197 call_expr_arg_iterator iter;
3198 tree arg;
3202 {
3207 }
3212 }
3215 /* Scan all the list, e.g. indices of multi dimensional array. */
3217 {
3223 }
3227 {
3234 {
3246 {
3250 }
3253 }
3257 }
3267 /* For other expressions, simply recurse on their operands.
3268 Manual tail recursion for unary expressions.
3269 Other non-expressions need not be processed. */
3271 {
3275 }
3277 {
3281 {
3286 }
3287 }
3289 }
3290 }
3292 /* Try to warn for undefined behavior in EXPR due to missing sequence
3293 points. */
3295 DEBUG_FUNCTION void
3297 {
3303 {
3306 }
3311 }
3312 \f
3313 /* Validate the expression after `case' and apply default promotions. */
3315 static tree
3317 {
3322 /* Promote char or short to int. */
3325 {
3328 }
3333 }
3334 \f
3335 /* See if the case values LOW and HIGH are in the range of the original
3336 type (i.e. before the default conversion to int) of the switch testing
3337 expression.
3338 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3339 the type before promoting it. CASE_LOW_P is a pointer to the lower
3340 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3341 if the case is not a case range.
3342 The caller has to make sure that we are not called with NULL for
3343 CASE_LOW_P (i.e. the default case).
3344 Returns true if the case label is in range of ORIG_TYPE (saturated or
3345 untouched) or false if the label is out of range. */
3347 static bool
3350 {
3355 /* If there was a problem with the original type, do nothing. */
3362 /* Case label is less than minimum for type. */
3365 {
3368 }
3370 /* Case value is greater than maximum for type. */
3373 {
3376 }
3378 /* Saturate lower case label value to minimum. */
3381 {
3385 }
3387 /* Saturate upper case label value to maximum. */
3390 {
3394 }
3402 }
3403 \f
3404 /* Return an integer type with BITS bits of precision,
3405 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3407 tree
3409 {
3448 }
3450 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3451 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3452 and saturating if SATP is nonzero, otherwise not saturating. */
3454 tree
3457 {
3461 else
3469 {
3471 "fixed-point types that have too many integral and "
3474 }
3477 }
3479 /* Used for communication between c_common_type_for_mode and
3480 c_register_builtin_type. */
3483 /* Return a data type that has machine mode MODE.
3484 If the mode is an integer,
3485 then UNSIGNEDP selects between signed and unsigned types.
3486 If the mode is a fixed-point mode,
3487 then UNSIGNEDP selects between saturating and nonsaturating types. */
3489 tree
3491 {
3492 tree t;
3529 #if HOST_BITS_PER_WIDE_INT >= 64
3532 #endif
3557 {
3559 tree inner_type;
3575 }
3577 {
3582 }
3592 {
3678 }
3686 }
3688 tree
3690 {
3692 }
3694 /* Return a signed type the same as TYPE in other respects. */
3696 tree
3698 {
3700 }
3702 /* Return a type the same as TYPE except unsigned or
3703 signed according to UNSIGNEDP. */
3705 tree
3707 {
3708 tree type1;
3710 /* This block of code emulates the behavior of the old
3711 c_common_unsigned_type. In particular, it returns
3712 long_unsigned_type_node if passed a long, even when a int would
3713 have the same size. This is necessary for warnings to work
3714 correctly in archs where sizeof(int) == sizeof(long) */
3717 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3733 #if HOST_BITS_PER_WIDE_INT >= 64
3736 #endif
3746 #define C_COMMON_FIXED_TYPES(NAME) \
3747 if (type1 == short_ ## NAME ## _type_node \
3748 || type1 == unsigned_short_ ## NAME ## _type_node) \
3749 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3750 : short_ ## NAME ## _type_node; \
3751 if (type1 == NAME ## _type_node \
3752 || type1 == unsigned_ ## NAME ## _type_node) \
3753 return unsignedp ? unsigned_ ## NAME ## _type_node \
3754 : NAME ## _type_node; \
3755 if (type1 == long_ ## NAME ## _type_node \
3756 || type1 == unsigned_long_ ## NAME ## _type_node) \
3757 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3758 : long_ ## NAME ## _type_node; \
3759 if (type1 == long_long_ ## NAME ## _type_node \
3760 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3761 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3762 : long_long_ ## NAME ## _type_node;
3764 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3765 if (type1 == NAME ## _type_node \
3766 || type1 == u ## NAME ## _type_node) \
3767 return unsignedp ? u ## NAME ## _type_node \
3768 : NAME ## _type_node;
3770 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3771 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3772 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3773 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3774 : sat_ ## short_ ## NAME ## _type_node; \
3775 if (type1 == sat_ ## NAME ## _type_node \
3776 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3777 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3778 : sat_ ## NAME ## _type_node; \
3779 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3780 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3781 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3782 : sat_ ## long_ ## NAME ## _type_node; \
3783 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3784 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3785 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3786 : sat_ ## long_long_ ## NAME ## _type_node;
3788 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3789 if (type1 == sat_ ## NAME ## _type_node \
3790 || type1 == sat_ ## u ## NAME ## _type_node) \
3791 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3792 : sat_ ## NAME ## _type_node;
3818 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3819 the precision; they have precision set to match their range, but
3820 may use a wider mode to match an ABI. If we change modes, we may
3821 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3822 the precision as well, so as to yield correct results for
3823 bit-field types. C++ does not have these separate bit-field
3824 types, and producing a signed or unsigned variant of an
3825 ENUMERAL_TYPE may cause other problems as well. */
3831 #define TYPE_OK(node) \
3832 (TYPE_MODE (type) == TYPE_MODE (node) \
3833 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3852 #if HOST_BITS_PER_WIDE_INT >= 64
3855 #endif
3864 #undef TYPE_OK
3867 }
3869 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3871 tree
3873 {
3874 /* Extended integer types of the same width as a standard type have
3875 lesser rank, so those of the same width as int promote to int or
3876 unsigned int and are valid for printf formats expecting int or
3877 unsigned int. To avoid such special cases, avoid creating
3878 extended integer types for bit-fields if a standard integer type
3879 is available. */
3896 }
3898 /* The C version of the register_builtin_type langhook. */
3900 void
3902 {
3903 tree decl;
3913 }
3914 \f
3915 /* Print an error message for invalid operands to arith operation
3916 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3917 LOCATION is the location of the message. */
3919 void
3922 {
3926 {
3971 }
3975 }
3976 \f
3977 /* Given an expression as a tree, return its original type. Do this
3978 by stripping any conversion that preserves the sign and precision. */
3979 static tree
3981 {
3984 }
3986 /* Subroutine of build_binary_op, used for comparison operations.
3987 See if the operands have both been converted from subword integer types
3988 and, if so, perhaps change them both back to their original type.
3989 This function is also responsible for converting the two operands
3990 to the proper common type for comparison.
3992 The arguments of this function are all pointers to local variables
3993 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3994 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3996 If this function returns nonzero, it means that the comparison has
3997 a constant value. What this function returns is an expression for
3998 that value. */
4000 tree
4003 {
4004 tree type;
4013 /* Throw away any conversions to wider types
4014 already present in the operands. */
4019 /* If primopN is first sign-extended from primopN's precision to opN's
4020 precision, then zero-extended from opN's precision to
4021 *restype_ptr precision, shortenings might be invalid. */
4024 && !unsignedp0
4029 && !unsignedp1
4033 /* Handle the case that OP0 does not *contain* a conversion
4034 but it *requires* conversion to FINAL_TYPE. */
4041 /* If one of the operands must be floated, we cannot optimize. */
4045 /* If first arg is constant, swap the args (changing operation
4046 so value is preserved), for canonicalization. Don't do this if
4047 the second arg is 0. */
4052 {
4069 {
4084 }
4086 }
4088 /* If comparing an integer against a constant more bits wide,
4089 maybe we can deduce a value of 1 or 0 independent of the data.
4090 Or else truncate the constant now
4091 rather than extend the variable at run time.
4093 This is only interesting if the constant is the wider arg.
4094 Also, it is not safe if the constant is unsigned and the
4095 variable arg is signed, since in this case the variable
4096 would be sign-extended and then regarded as unsigned.
4097 Our technique fails in this case because the lowest/highest
4098 possible unsigned results don't follow naturally from the
4099 lowest/highest possible values of the variable operand.
4100 For just EQ_EXPR and NE_EXPR there is another technique that
4101 could be used: see if the constant can be faithfully represented
4102 in the other operand's type, by truncating it and reextending it
4103 and see if that preserves the constant's value. */
4109 {
4112 /* 1 if comparison is nominally unsigned. */
4114 tree val;
4126 {
4127 /* Convert primop1 to target type, but do not introduce
4128 additional overflow. We know primop1 is an int_cst. */
4132 }
4134 {
4137 }
4140 {
4145 }
4146 else
4147 {
4152 }
4155 /* This used to be a switch, but Genix compiler can't handle that. */
4157 {
4160 }
4162 {
4165 }
4167 {
4172 }
4174 {
4179 }
4181 {
4186 }
4188 {
4193 }
4195 /* If primop0 was sign-extended and unsigned comparison specd,
4196 we did a signed comparison above using the signed type bounds.
4197 But the comparison we output must be unsigned.
4199 Also, for inequalities, VAL is no good; but if the signed
4200 comparison had *any* fixed result, it follows that the
4201 unsigned comparison just tests the sign in reverse
4202 (positive values are LE, negative ones GE).
4203 So we can generate an unsigned comparison
4204 against an extreme value of the signed type. */
4207 {
4210 {
4225 }
4227 }
4231 {
4238 }
4241 {
4242 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4246 }
4248 /* Value is not predetermined, but do the comparison
4249 in the type of the operand that is not constant.
4250 TYPE is already properly set. */
4251 }
4253 /* If either arg is decimal float and the other is float, find the
4254 proper common type to use for comparison. */
4265 /* If args' natural types are both narrower than nominal type
4266 and both extend in the same manner, compare them
4267 in the type of the wider arg.
4268 Otherwise must actually extend both to the nominal
4269 common type lest different ways of extending
4270 alter the result.
4271 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4276 {
4280 type);
4281 /* Make sure shorter operand is extended the right way
4282 to match the longer operand. */
4283 primop0
4286 primop0);
4287 primop1
4290 primop1);
4291 }
4292 else
4293 {
4294 /* Here we must do the comparison on the nominal type
4295 using the args exactly as we received them. */
4302 {
4304 /* All unsigned values are >= 0, so we warn. However,
4305 if OP0 is a constant that is >= 0, the signedness of
4306 the comparison isn't an issue, so suppress the
4307 warning. */
4309 warn_type_limits && !in_system_header
4313 primop0)))
4314 /* Do not warn for enumeration types. */
4318 {
4335 }
4338 {
4339 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4344 }
4345 }
4346 }
4354 }
4355 \f
4356 /* Return a tree for the sum or difference (RESULTCODE says which)
4357 of pointer PTROP and integer INTOP. */
4359 tree
4362 {
4365 /* The result is a pointer of the same type that is being added. */
4368 /* If the pointer lives in UPC shared memory, then
4369 drop the 'shared' qualifier. */
4374 {
4381 }
4383 {
4390 }
4391 else
4394 /* We are manipulating pointer values, so we don't need to warn
4395 about relying on undefined signed overflow. We disable the
4396 warning here because we use integer types so fold won't know that
4397 they are really pointers. */
4400 /* If what we are about to multiply by the size of the elements
4401 contains a constant term, apply distributive law
4402 and multiply that constant term separately.
4403 This helps produce common subexpressions. */
4408 /* If the constant comes from pointer subtraction,
4409 skip this optimization--it would cause an error. */
4411 /* If the constant is unsigned, and smaller than the pointer size,
4412 then we must skip this optimization. This is because it could cause
4413 an overflow error if the constant is negative but INTOP is not. */
4417 {
4422 /* Convert both subexpression types to the type of intop,
4423 because weird cases involving pointer arithmetic
4424 can result in a sum or difference with different type args. */
4429 }
4431 /* Convert the integer argument to a type the same size as sizetype
4432 so the multiply won't overflow spuriously. */
4438 /* Replace the integer argument with a suitable product by the object size.
4439 Do this multiplication as signed, then convert to the appropriate type
4440 for the pointer operation and disregard an overflow that occurred only
4441 because of the sign-extension change in the latter conversion. */
4442 {
4450 }
4452 /* Create the sum or difference. */
4461 }
4462 \f
4463 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4464 and if NON_CONST is known not to be permitted in an evaluated part
4465 of a constant expression. */
4467 tree
4469 {
4473 /* This should never be called for C++. */
4477 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4486 }
4488 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4489 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4490 around the SAVE_EXPR if needed so that c_fully_fold does not need
4491 to look inside SAVE_EXPRs. */
4493 tree
4495 {
4504 }
4506 /* Return whether EXPR is a declaration whose address can never be
4507 NULL. */
4509 bool
4511 {
4516 }
4518 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4519 or for an `if' or `while' statement or ?..: exp. It should already
4520 have been validated to be of suitable type; otherwise, a bad
4521 diagnostic may result.
4523 The EXPR is located at LOCATION.
4525 This preparation consists of taking the ordinary
4526 representation of an expression expr and producing a valid tree
4527 boolean expression describing whether expr is nonzero. We could
4528 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4529 but we optimize comparisons, &&, ||, and !.
4531 The resulting type should always be `truthvalue_type_node'. */
4533 tree
4535 {
4537 {
4579 ? truthvalue_true_node
4585 ? truthvalue_true_node
4590 /* Fall through. */
4593 {
4596 {
4597 /* Common Ada/Pascal programmer's mistake. */
4599 OPT_Waddress,
4601 inner);
4603 }
4605 }
4622 /* These don't change whether an object is nonzero or zero. */
4627 /* These don't change whether an object is zero or nonzero, but
4628 we can't ignore them if their second arg has side-effects. */
4630 {
4633 c_common_truthvalue_conversion
4636 }
4637 else
4642 /* Distribute the conversion into the arms of a COND_EXPR. */
4644 {
4647 /* In C++ one of the arms might have void type if it is throw. */
4655 }
4656 else
4657 {
4658 /* Folding will happen later for C. */
4666 }
4668 CASE_CONVERT:
4669 {
4673 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4674 since that affects how `default_conversion' will behave. */
4678 /* Don't strip a conversion from C++0x scoped enum, since they
4679 don't implicitly convert to other types. */
4683 /* If this isn't narrowing the argument, we can ignore it. */
4687 }
4693 {
4697 }
4702 }
4705 {
4707 expr = (build_binary_op
4711 c_common_truthvalue_conversion
4714 c_common_truthvalue_conversion
4719 }
4722 {
4727 }
4728 else
4731 ret:
4734 }
4735 \f
4744 /* Apply the TYPE_QUALS to the new DECL. */
4746 void
4748 {
4756 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4757 constructor can produce constant init, so rely on cp_finish_decl to
4758 clear TREE_READONLY if the variable has non-constant init. */
4761 {
4764 }
4766 {
4768 /* Allow 'restrict' on arrays of pointers.
4769 FIXME currently we just ignore it. */
4775 }
4777 {
4783 /* The declaration's type should have been previously defined
4784 as a UPC shared type. */
4786 }
4787 }
4789 /* Hash function for the problem of multiple type definitions in
4790 different files. This must hash all types that will compare
4791 equal via comptypes to the same value. In practice it hashes
4792 on some of the simple stuff and leaves the details to comptypes. */
4794 static hashval_t
4796 {
4800 tree t2;
4802 {
4803 /* For pointers, hash on pointee type plus some swizzling. */
4806 /* Hash on number of elements and total size. */
4825 }
4826 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4827 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4829 /* We might have a VLA here. */
4832 else
4835 }
4839 /* Return the typed-based alias set for T, which may be an expression
4840 or a type. Return -1 if we don't do anything special. */
4842 alias_set_type
4844 {
4845 tree u;
4848 /* For VLAs, use the alias set of the element type rather than the
4849 default of alias set 0 for types compared structurally. */
4851 {
4855 }
4857 /* Permit type-punning when accessing a union, provided the access
4858 is directly through the union. For example, this code does not
4859 permit taking the address of a union member and then storing
4860 through it. Even the type-punning allowed here is a GCC
4861 extension, albeit a common and useful one; the C standard says
4862 that such accesses have implementation-defined behavior. */
4870 /* That's all the expressions we handle specially. */
4874 /* The C standard guarantees that any object may be accessed via an
4875 lvalue that has character type. */
4881 /* The C standard specifically allows aliasing between signed and
4882 unsigned variants of the same type. We treat the signed
4883 variant as canonical. */
4885 {
4888 /* t1 == t can happen for boolean nodes which are always unsigned. */
4891 }
4893 /* Handle the case of multiple type nodes referring to "the same" type,
4894 which occurs with IMA. These share an alias set. FIXME: Currently only
4895 C90 is handled. (In C99 type compatibility is not transitive, which
4896 complicates things mightily. The alias set splay trees can theoretically
4897 represent this, but insertion is tricky when you consider all the
4898 different orders things might arrive in.) */
4903 /* Save time if there's only one input file. */
4907 /* Pointers need special handling if they point to any type that
4908 needs special handling (below). */
4910 {
4911 tree t2;
4912 /* Find bottom type under any nested POINTERs. */
4916 ;
4924 }
4925 /* These are the only cases that need special handling. */
4932 /* Undefined? */
4936 /* Look up t in hash table. Only one of the compatible types within each
4937 alias set is recorded in the table. */
4941 NULL);
4944 {
4947 }
4948 else
4949 /* Our caller will assign and record (in t) a new alias set; all we need
4950 to do is remember t in the hash table. */
4954 }
4955 \f
4956 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4957 the second parameter indicates which OPERATOR is being applied.
4958 The COMPLAIN flag controls whether we should diagnose possibly
4959 ill-formed constructs or not. LOC is the location of the SIZEOF or
4960 TYPEOF operator. */
4962 tree
4965 {
4973 {
4975 {
4982 }
4983 else
4984 {
4986 {
4990 else
4993 }
4995 }
4996 }
4998 {
5000 {
5007 }
5008 else
5011 }
5014 {
5019 }
5022 {
5027 }
5028 else
5029 {
5031 /* Convert in case a char is more than one unit. */
5035 else
5037 }
5042 {
5045 }
5047 /* VALUE will have the middle-end integer type sizetype.
5048 However, we should really return a value of type `size_t',
5049 which is just a typedef for an ordinary integer type. */
5053 }
5055 /* Implement the __alignof keyword: Return the minimum required
5056 alignment of EXPR, measured in bytes. For VAR_DECLs,
5057 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5058 from an "aligned" __attribute__ specification). LOC is the
5059 location of the ALIGNOF operator. */
5061 tree
5063 {
5064 tree t;
5071 {
5074 }
5080 {
5087 {
5094 }
5096 }
5097 else
5101 }
5102 \f
5103 /* Handle C and C++ default attributes. */
5105 enum built_in_attribute
5106 {
5107 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5108 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5109 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5110 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5111 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5113 #undef DEF_ATTR_NULL_TREE
5114 #undef DEF_ATTR_INT
5115 #undef DEF_ATTR_STRING
5116 #undef DEF_ATTR_IDENT
5117 #undef DEF_ATTR_TREE_LIST
5118 ATTR_LAST
5119 };
5125 enum c_builtin_type
5126 {
5127 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5128 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5129 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5130 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5131 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5132 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5133 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5134 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5135 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5136 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5137 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5138 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5139 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5140 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5141 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5142 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5143 NAME,
5144 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5146 #undef DEF_PRIMITIVE_TYPE
5147 #undef DEF_FUNCTION_TYPE_0
5148 #undef DEF_FUNCTION_TYPE_1
5149 #undef DEF_FUNCTION_TYPE_2
5150 #undef DEF_FUNCTION_TYPE_3
5151 #undef DEF_FUNCTION_TYPE_4
5152 #undef DEF_FUNCTION_TYPE_5
5153 #undef DEF_FUNCTION_TYPE_6
5154 #undef DEF_FUNCTION_TYPE_7
5155 #undef DEF_FUNCTION_TYPE_8
5156 #undef DEF_FUNCTION_TYPE_VAR_0
5157 #undef DEF_FUNCTION_TYPE_VAR_1
5158 #undef DEF_FUNCTION_TYPE_VAR_2
5159 #undef DEF_FUNCTION_TYPE_VAR_3
5160 #undef DEF_FUNCTION_TYPE_VAR_4
5161 #undef DEF_FUNCTION_TYPE_VAR_5
5162 #undef DEF_POINTER_TYPE
5163 BT_LAST
5164 };
5168 /* A temporary array for c_common_nodes_and_builtins. Used in
5169 communication with def_fn_type. */
5172 /* A helper function for c_common_nodes_and_builtins. Build function type
5173 for DEF with return type RET and N arguments. If VAR is true, then the
5174 function should be variadic after those N arguments.
5176 Takes special care not to ICE if any of the types involved are
5177 error_mark_node, which indicates that said type is not in fact available
5178 (see builtin_type_for_size). In which case the function type as a whole
5179 should be error_mark_node. */
5181 static void
5183 {
5184 tree t;
5191 {
5197 }
5204 else
5207 egress:
5210 }
5212 /* Build builtin functions common to both C and C++ language
5213 frontends. */
5215 static void
5217 {
5218 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5219 builtin_types[ENUM] = VALUE;
5220 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5221 def_fn_type (ENUM, RETURN, 0, 0);
5222 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5223 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5224 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5225 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5226 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5227 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5228 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5229 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5230 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5231 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5232 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5233 ARG6) \
5234 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5235 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5236 ARG6, ARG7) \
5237 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5238 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5239 ARG6, ARG7, ARG8) \
5240 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5241 ARG7, ARG8);
5242 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5243 def_fn_type (ENUM, RETURN, 1, 0);
5244 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5245 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5246 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5247 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5248 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5249 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5250 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5251 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5252 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5253 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5254 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5255 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5259 #undef DEF_PRIMITIVE_TYPE
5260 #undef DEF_FUNCTION_TYPE_1
5261 #undef DEF_FUNCTION_TYPE_2
5262 #undef DEF_FUNCTION_TYPE_3
5263 #undef DEF_FUNCTION_TYPE_4
5264 #undef DEF_FUNCTION_TYPE_5
5265 #undef DEF_FUNCTION_TYPE_6
5266 #undef DEF_FUNCTION_TYPE_VAR_0
5267 #undef DEF_FUNCTION_TYPE_VAR_1
5268 #undef DEF_FUNCTION_TYPE_VAR_2
5269 #undef DEF_FUNCTION_TYPE_VAR_3
5270 #undef DEF_FUNCTION_TYPE_VAR_4
5271 #undef DEF_FUNCTION_TYPE_VAR_5
5272 #undef DEF_POINTER_TYPE
5277 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5278 NONANSI_P, ATTRS, IMPLICIT, COND) \
5279 if (NAME && COND) \
5280 def_builtin_1 (ENUM, NAME, CLASS, \
5281 builtin_types[(int) TYPE], \
5282 builtin_types[(int) LIBTYPE], \
5283 BOTH_P, FALLBACK_P, NONANSI_P, \
5284 built_in_attributes[(int) ATTRS], IMPLICIT);
5286 #undef DEF_BUILTIN
5294 }
5296 /* Like get_identifier, but avoid warnings about null arguments when
5297 the argument may be NULL for targets where GCC lacks stdint.h type
5298 information. */
5302 {
5304 }
5306 /* Build tree nodes and builtin functions common to both C and C++ language
5307 frontends. */
5309 void
5311 {
5315 tree array_domain_type;
5316 tree va_list_ref_type_node;
5317 tree va_list_arg_type_node;
5321 /* Define `int' and `char' first so that dbx will output them first. */
5325 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5326 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5327 but not C. Are the conditionals here needed? */
5333 long_unsigned_type_node);
5335 {
5337 int128_integer_type_node);
5339 int128_unsigned_type_node);
5340 }
5344 long_long_integer_type_node);
5346 long_long_unsigned_type_node);
5349 long_long_unsigned_type_node);
5352 short_unsigned_type_node);
5355 short_unsigned_type_node);
5357 /* Define both `signed char' and `unsigned char'. */
5361 /* These are types that c_common_type_for_size and
5362 c_common_type_for_mode use. */
5365 intQI_type_node));
5368 intHI_type_node));
5371 intSI_type_node));
5374 intDI_type_node));
5375 #if HOST_BITS_PER_WIDE_INT >= 64
5378 TYPE_DECL,
5380 intTI_type_node));
5381 #endif
5384 unsigned_intQI_type_node));
5387 unsigned_intHI_type_node));
5390 unsigned_intSI_type_node));
5393 unsigned_intDI_type_node));
5394 #if HOST_BITS_PER_WIDE_INT >= 64
5397 TYPE_DECL,
5399 unsigned_intTI_type_node));
5400 #endif
5402 /* Create the widest literal types. */
5403 widest_integer_literal_type_node
5407 widest_integer_literal_type_node));
5409 widest_unsigned_literal_type_node
5413 widest_unsigned_literal_type_node));
5417 pid_type_node =
5424 /* Only supported decimal floating point extension if the target
5425 actually supports underlying modes. */
5429 {
5433 }
5436 {
5441 long_long_fract_type_node);
5443 unsigned_short_fract_type_node);
5445 unsigned_fract_type_node);
5447 unsigned_long_fract_type_node);
5449 unsigned_long_long_fract_type_node);
5451 sat_short_fract_type_node);
5454 sat_long_fract_type_node);
5456 sat_long_long_fract_type_node);
5458 sat_unsigned_short_fract_type_node);
5460 sat_unsigned_fract_type_node);
5462 sat_unsigned_long_fract_type_node);
5464 sat_unsigned_long_long_fract_type_node);
5469 long_long_accum_type_node);
5471 unsigned_short_accum_type_node);
5473 unsigned_accum_type_node);
5475 unsigned_long_accum_type_node);
5477 unsigned_long_long_accum_type_node);
5479 sat_short_accum_type_node);
5482 sat_long_accum_type_node);
5484 sat_long_long_accum_type_node);
5486 sat_unsigned_short_accum_type_node);
5488 sat_unsigned_accum_type_node);
5490 sat_unsigned_long_accum_type_node);
5492 sat_unsigned_long_long_accum_type_node);
5494 }
5497 TYPE_DECL,
5499 complex_integer_type_node));
5501 TYPE_DECL,
5503 complex_float_type_node));
5505 TYPE_DECL,
5507 complex_double_type_node));
5511 complex_long_double_type_node));
5514 /* For C++, make fileptr_type_node a distinct void * type until
5515 FILE type is defined. */
5520 /* Set the TYPE_NAME for any variants that were built before
5521 record_builtin_type gave names to the built-in types. */
5522 {
5528 }
5530 /* This node must not be shared. */
5536 /* Make a type to be the domain of a few array types
5537 whose domains don't really matter.
5538 200 is small enough that it always fits in size_t
5539 and large enough that it can hold most function names for the
5540 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5543 /* Make a type for arrays of characters.
5544 With luck nothing will ever really depend on the length of this
5545 array type. */
5546 char_array_type_node
5549 /* Likewise for arrays of ints. */
5550 int_array_type_node
5554 const_string_type_node
5558 /* This is special for C++ so functions can be overloaded. */
5564 {
5567 else
5570 }
5572 /* This is for wide string constants. */
5573 wchar_array_type_node
5576 /* Define 'char16_t'. */
5581 {
5586 }
5588 /* This is for UTF-16 string constants. */
5589 char16_array_type_node
5592 /* Define 'char32_t'. */
5597 {
5602 }
5604 /* This is for UTF-32 string constants. */
5605 char32_array_type_node
5608 wint_type_node =
5611 intmax_type_node =
5613 uintmax_type_node =
5617 sig_atomic_type_node =
5620 int8_type_node =
5623 int16_type_node =
5626 int32_type_node =
5629 int64_type_node =
5632 uint8_type_node =
5635 c_uint16_type_node =
5638 c_uint32_type_node =
5641 c_uint64_type_node =
5644 int_least8_type_node =
5647 int_least16_type_node =
5650 int_least32_type_node =
5653 int_least64_type_node =
5656 uint_least8_type_node =
5659 uint_least16_type_node =
5662 uint_least32_type_node =
5665 uint_least64_type_node =
5668 int_fast8_type_node =
5671 int_fast16_type_node =
5674 int_fast32_type_node =
5677 int_fast64_type_node =
5680 uint_fast8_type_node =
5683 uint_fast16_type_node =
5686 uint_fast32_type_node =
5689 uint_fast64_type_node =
5692 intptr_type_node =
5695 uintptr_type_node =
5698 default_function_type
5700 ptrdiff_type_node
5707 va_list_type_node));
5709 {
5712 tree ptype;
5715 {
5719 ptype));
5721 }
5722 }
5725 {
5728 }
5729 else
5730 {
5733 }
5740 /* Create the built-in __null node. It is important that this is
5741 not shared. */
5745 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5747 }
5749 /* The number of named compound-literals generated thus far. */
5752 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5754 void
5756 {
5759 compound_literal_number);
5760 compound_literal_number++;
5762 }
5764 tree
5766 {
5770 }
5773 /* Linked list of disabled built-in functions. */
5776 {
5784 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5785 begins with "__builtin_", give an error. */
5787 void
5789 {
5792 else
5793 {
5798 }
5799 }
5802 /* Return true if the built-in function NAME has been disabled, false
5803 otherwise. */
5805 static bool
5807 {
5810 {
5813 }
5815 }
5818 /* Worker for DEF_BUILTIN.
5819 Possibly define a builtin function with one or two names.
5820 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5821 nonansi_p and flag_no_nonansi_builtin. */
5823 static void
5830 {
5831 tree decl;
5844 fnattrs);
5853 }
5854 \f
5855 /* Nonzero if the type T promotes to int. This is (nearly) the
5856 integral promotions defined in ISO C99 6.3.1.1/2. */
5858 bool
5860 {
5862 {
5872 /* ??? Technically all enumerations not larger than an int
5873 promote to an int. But this is used along code paths
5874 that only want to notice a size change. */
5882 }
5883 }
5885 /* Return 1 if PARMS specifies a fixed number of parameters
5886 and none of their types is affected by default promotions. */
5888 int
5890 {
5891 const_tree t;
5893 {
5910 }
5912 }
5914 /* Recursively remove any '*' or '&' operator from TYPE. */
5915 tree
5917 {
5921 }
5923 /* Recursively remove pointer or array type from TYPE. */
5924 tree
5926 {
5930 }
5932 /* Used to compare case labels. K1 and K2 are actually tree nodes
5933 representing case labels, or NULL_TREE for a `default' label.
5934 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5935 K2, and 0 if K1 and K2 are equal. */
5937 int
5939 {
5940 /* Consider a NULL key (such as arises with a `default' label) to be
5941 smaller than anything else. */
5948 }
5950 /* Process a case label, located at LOC, for the range LOW_VALUE
5951 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5952 then this case label is actually a `default' label. If only
5953 HIGH_VALUE is NULL_TREE, then case label was declared using the
5954 usual C/C++ syntax, rather than the GNU case range extension.
5955 CASES is a tree containing all the case ranges processed so far;
5956 COND is the condition for the switch-statement itself. Returns the
5957 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5958 is created. */
5960 tree
5963 {
5964 tree type;
5965 tree label;
5966 tree case_label;
5967 splay_tree_node node;
5969 /* Create the LABEL_DECL itself. */
5972 /* If there was an error processing the switch condition, bail now
5973 before we get more confused. */
5981 {
5984 }
5986 /* Case ranges are a GNU extension. */
5993 {
5998 }
6000 {
6005 }
6008 {
6009 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6010 really a case range, even though it was written that way.
6011 Remove the HIGH_VALUE to simplify later processing. */
6016 }
6018 /* See if the case is in range of the type of the original testing
6019 expression. If both low_value and high_value are out of range,
6020 don't insert the case label and return NULL_TREE. */
6026 /* Look up the LOW_VALUE in the table of case labels we already
6027 have. */
6029 /* If there was not an exact match, check for overlapping ranges.
6030 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6031 that's a `default' label and the only overlap is an exact match. */
6033 {
6034 splay_tree_node low_bound;
6035 splay_tree_node high_bound;
6037 /* Even though there wasn't an exact match, there might be an
6038 overlap between this case range and another case range.
6039 Since we've (inductively) not allowed any overlapping case
6040 ranges, we simply need to find the greatest low case label
6041 that is smaller that LOW_VALUE, and the smallest low case
6042 label that is greater than LOW_VALUE. If there is an overlap
6043 it will occur in one of these two ranges. */
6049 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6050 the LOW_VALUE, so there is no need to check unless the
6051 LOW_BOUND is in fact itself a case range. */
6057 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6058 range is bigger than the low end of the current range, so we
6059 are only interested if the current range is a real range, and
6060 not an ordinary case label. */
6062 && high_value
6064 high_value)
6067 }
6068 /* If there was an overlap, issue an error. */
6070 {
6074 {
6078 }
6080 {
6083 }
6084 else
6085 {
6089 }
6091 }
6093 /* Add a CASE_LABEL to the statement-tree. */
6095 /* Register this case label in the splay tree. */
6102 error_out:
6103 /* Add a label so that the back-end doesn't think that the beginning of
6104 the switch is unreachable. Note that we do not add a case label, as
6105 that just leads to duplicates and thence to failure later on. */
6107 {
6110 }
6112 }
6114 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6115 Used to verify that case values match up with enumerator values. */
6117 static void
6119 {
6122 /* ??? Not working too hard to print the double-word value.
6123 Should perhaps be done with %lwd in the diagnostic routines? */
6132 else
6141 buf);
6142 else
6147 }
6149 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6150 Used to verify that case values match up with enumerator values. */
6152 static int
6154 {
6158 /* Skip default case. */
6162 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6163 when we did our enum->case scan. Reset our scratch bit after. */
6166 else
6169 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6170 not set, that means that CASE_HIGH did not appear when we did our
6171 enum->case scan. Reset our scratch bit after. */
6173 {
6176 else
6178 }
6181 }
6183 /* Handle -Wswitch*. Called from the front end after parsing the
6184 switch construct. */
6185 /* ??? Should probably be somewhere generic, since other languages
6186 besides C and C++ would want this. At the moment, however, C/C++
6187 are the only tree-ssa languages that support enumerations at all,
6188 so the point is moot. */
6190 void
6193 {
6194 splay_tree_node default_node;
6195 splay_tree_node node;
6196 tree chain;
6206 /* From here on, we only care about about enumerated types. */
6210 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6214 /* Check the cases. Warn about case values which are not members of
6215 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6216 there is no default case, check that exactly all enumeration
6217 literals are covered by the cases. */
6219 /* Clearing COND if it is not an integer constant simplifies
6220 the tests inside the loop below. */
6224 /* The time complexity here is O(N*lg(N)) worst case, but for the
6225 common case of monotonically increasing enumerators, it is
6226 O(N), since the nature of the splay tree will keep the next
6227 element adjacent to the root at all times. */
6230 {
6236 {
6237 /* Mark the CASE_LOW part of the case entry as seen. */
6241 }
6243 /* Even though there wasn't an exact match, there might be a
6244 case range which includes the enumerator's value. */
6247 {
6251 {
6252 /* If we match the upper bound exactly, mark the CASE_HIGH
6253 part of the case entry as seen. */
6257 }
6258 }
6260 /* We've now determined that this enumerated literal isn't
6261 handled by the case labels of the switch statement. */
6263 /* If the switch expression is a constant, we only really care
6264 about whether that constant is handled by the switch. */
6268 /* If there is a default_node, the only relevant option is
6269 Wswitch-enum. Otherwise, if both are enabled then we prefer
6270 to warn using -Wswitch because -Wswitch is enabled by -Wall
6271 while -Wswitch-enum is explicit. */
6274 ? OPT_Wswitch_enum
6278 }
6280 /* Warn if there are case expressions that don't correspond to
6281 enumerators. This can occur since C and C++ don't enforce
6282 type-checking of assignments to enumeration variables.
6284 The time complexity here is now always O(N) worst case, since
6285 we should have marked both the lower bound and upper bound of
6286 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6287 above. This scan also resets those fields. */
6290 }
6292 /* Finish an expression taking the address of LABEL (an
6293 IDENTIFIER_NODE). Returns an expression for the address.
6295 LOC is the location for the expression returned. */
6297 tree
6299 {
6300 tree result;
6310 else
6311 {
6314 /* The current function is not necessarily uninlinable.
6315 Computed gotos are incompatible with inlining, but the value
6316 here could be used only in a diagnostic, for example. */
6318 }
6321 }
6322 \f
6324 /* Given a boolean expression ARG, return a tree representing an increment
6325 or decrement (as indicated by CODE) of ARG. The front end must check for
6326 invalid cases (e.g., decrement in C++). */
6327 tree
6329 {
6330 tree val;
6335 {
6358 }
6361 }
6362 \f
6363 /* Built-in macros for stddef.h and stdint.h, that require macros
6364 defined in this file. */
6365 void
6367 {
6430 }
6432 static void
6434 {
6435 /* Fill in the built_in_attributes array. */
6436 #define DEF_ATTR_NULL_TREE(ENUM) \
6437 built_in_attributes[(int) ENUM] = NULL_TREE;
6438 #define DEF_ATTR_INT(ENUM, VALUE) \
6439 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6440 #define DEF_ATTR_STRING(ENUM, VALUE) \
6441 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6442 #define DEF_ATTR_IDENT(ENUM, STRING) \
6443 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6444 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6445 built_in_attributes[(int) ENUM] \
6446 = tree_cons (built_in_attributes[(int) PURPOSE], \
6447 built_in_attributes[(int) VALUE], \
6448 built_in_attributes[(int) CHAIN]);
6450 #undef DEF_ATTR_NULL_TREE
6451 #undef DEF_ATTR_INT
6452 #undef DEF_ATTR_IDENT
6453 #undef DEF_ATTR_TREE_LIST
6454 }
6456 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6457 identifier as an argument, so the front end shouldn't look it up. */
6459 bool
6461 {
6464 /* Unknown attribute that we'll end up ignoring, return true so we
6465 don't complain about an identifier argument. */
6471 else
6473 }
6475 /* Attribute handlers common to C front ends. */
6477 /* Handle a "packed" attribute; arguments as in
6478 struct attribute_spec.handler. */
6480 static tree
6483 {
6485 {
6489 }
6491 {
6493 /* Still pack bitfields. */
6498 else
6500 }
6501 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6502 used for DECL_REGISTER. It wouldn't mean anything anyway.
6503 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6504 that changes what the typedef is typing. */
6505 else
6506 {
6509 }
6512 }
6514 /* Handle a "nocommon" attribute; arguments as in
6515 struct attribute_spec.handler. */
6517 static tree
6521 {
6524 else
6525 {
6528 }
6531 }
6533 /* Handle a "common" attribute; arguments as in
6534 struct attribute_spec.handler. */
6536 static tree
6539 {
6542 else
6543 {
6546 }
6549 }
6551 /* Handle a "noreturn" attribute; arguments as in
6552 struct attribute_spec.handler. */
6554 static tree
6557 {
6560 /* See FIXME comment in c_common_attribute_table. */
6567 = build_pointer_type
6570 else
6571 {
6574 }
6577 }
6579 /* Handle a "hot" and attribute; arguments as in
6580 struct attribute_spec.handler. */
6582 static tree
6585 {
6588 {
6590 {
6594 }
6595 /* Most of the rest of the hot processing is done later with
6596 lookup_attribute. */
6597 }
6598 else
6599 {
6602 }
6605 }
6607 /* Handle a "cold" and attribute; arguments as in
6608 struct attribute_spec.handler. */
6610 static tree
6613 {
6616 {
6618 {
6622 }
6623 /* Most of the rest of the cold processing is done later with
6624 lookup_attribute. */
6625 }
6626 else
6627 {
6630 }
6633 }
6635 /* Handle a "no_sanitize_address" attribute; arguments as in
6636 struct attribute_spec.handler. */
6638 static tree
6641 {
6643 {
6646 }
6649 }
6651 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6652 struct attribute_spec.handler. */
6654 static tree
6657 {
6666 }
6668 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6669 struct attribute_spec.handler. */
6671 static tree
6674 {
6676 {
6679 }
6682 }
6684 /* Handle a "noinline" attribute; arguments as in
6685 struct attribute_spec.handler. */
6687 static tree
6691 {
6694 else
6695 {
6698 }
6701 }
6703 /* Handle a "noclone" attribute; arguments as in
6704 struct attribute_spec.handler. */
6706 static tree
6710 {
6712 {
6715 }
6718 }
6720 /* Handle a "always_inline" attribute; arguments as in
6721 struct attribute_spec.handler. */
6723 static tree
6728 {
6730 {
6731 /* Set the attribute and mark it for disregarding inline
6732 limits. */
6734 }
6735 else
6736 {
6739 }
6742 }
6744 /* Handle a "gnu_inline" attribute; arguments as in
6745 struct attribute_spec.handler. */
6747 static tree
6752 {
6754 {
6755 /* Do nothing else, just set the attribute. We'll get at
6756 it later with lookup_attribute. */
6757 }
6758 else
6759 {
6762 }
6765 }
6767 /* Handle a "leaf" attribute; arguments as in
6768 struct attribute_spec.handler. */
6770 static tree
6774 {
6776 {
6779 }
6781 {
6784 }
6787 }
6789 /* Handle an "artificial" attribute; arguments as in
6790 struct attribute_spec.handler. */
6792 static tree
6797 {
6799 {
6800 /* Do nothing else, just set the attribute. We'll get at
6801 it later with lookup_attribute. */
6802 }
6803 else
6804 {
6807 }
6810 }
6812 /* Handle a "flatten" attribute; arguments as in
6813 struct attribute_spec.handler. */
6815 static tree
6817 tree args ATTRIBUTE_UNUSED,
6819 {
6821 /* Do nothing else, just set the attribute. We'll get at
6822 it later with lookup_attribute. */
6823 ;
6824 else
6825 {
6828 }
6831 }
6833 /* Handle a "warning" or "error" attribute; arguments as in
6834 struct attribute_spec.handler. */
6836 static tree
6839 {
6842 /* Do nothing else, just set the attribute. We'll get at
6843 it later with lookup_attribute. */
6844 ;
6845 else
6846 {
6849 }
6852 }
6854 /* Handle a "used" attribute; arguments as in
6855 struct attribute_spec.handler. */
6857 static tree
6860 {
6866 {
6871 }
6872 else
6873 {
6876 }
6879 }
6881 /* Handle a "unused" attribute; arguments as in
6882 struct attribute_spec.handler. */
6884 static tree
6887 {
6889 {
6897 {
6902 }
6903 else
6904 {
6907 }
6908 }
6909 else
6910 {
6914 }
6917 }
6919 /* Handle a "externally_visible" attribute; arguments as in
6920 struct attribute_spec.handler. */
6922 static tree
6927 {
6931 {
6934 {
6938 }
6939 }
6940 else
6941 {
6944 }
6947 }
6949 /* Handle a "const" attribute; arguments as in
6950 struct attribute_spec.handler. */
6952 static tree
6955 {
6958 /* See FIXME comment on noreturn in c_common_attribute_table. */
6964 = build_pointer_type
6967 else
6968 {
6971 }
6974 }
6976 /* Handle a "transparent_union" attribute; arguments as in
6977 struct attribute_spec.handler. */
6979 static tree
6983 {
6984 tree type;
6995 {
6996 /* Make sure that the first field will work for a transparent union.
6997 If the type isn't complete yet, leave the check to the code in
6998 finish_struct. */
7000 {
7006 }
7009 {
7010 /* If the type isn't complete yet, setting the flag
7011 on a variant wouldn't ever be checked. */
7015 /* build_duplicate_type doesn't work for C++. */
7019 /* A type variant isn't good enough, since we don't a cast
7020 to such a type removed as a no-op. */
7022 }
7026 }
7028 ignored:
7031 }
7033 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7034 get the requested priority for a constructor or destructor,
7035 possibly issuing diagnostics for invalid or reserved
7036 priorities. */
7038 static priority_type
7040 {
7041 HOST_WIDE_INT pri;
7042 tree arg;
7048 {
7051 else
7054 }
7067 {
7070 "destructor priorities from 0 to %d are reserved "
7072 MAX_RESERVED_INIT_PRIORITY);
7073 else
7075 "constructor priorities from 0 to %d are reserved "
7077 MAX_RESERVED_INIT_PRIORITY);
7078 }
7081 invalid:
7084 MAX_INIT_PRIORITY);
7085 else
7087 MAX_INIT_PRIORITY);
7089 }
7091 /* Handle a "constructor" attribute; arguments as in
7092 struct attribute_spec.handler. */
7094 static tree
7098 {
7105 {
7106 priority_type priority;
7111 }
7112 else
7113 {
7116 }
7119 }
7121 /* Handle a "destructor" attribute; arguments as in
7122 struct attribute_spec.handler. */
7124 static tree
7128 {
7135 {
7136 priority_type priority;
7141 }
7142 else
7143 {
7146 }
7149 }
7151 /* Nonzero if the mode is a valid vector mode for this architecture.
7152 This returns nonzero even if there is no hardware support for the
7153 vector mode, but we can emulate with narrower modes. */
7155 static int
7157 {
7161 /* Doh! What's going on? */
7170 /* Hardware support. Woo hoo! */
7176 /* We should probably return 1 if requesting V4DI and we have no DI,
7177 but we have V2DI, but this is probably very unlikely. */
7179 /* If we have support for the inner mode, we can safely emulate it.
7180 We may not have V2DI, but me can emulate with a pair of DIs. */
7182 }
7185 /* Handle a "mode" attribute; arguments as in
7186 struct attribute_spec.handler. */
7188 static tree
7191 {
7199 else
7200 {
7205 tree typefm;
7210 {
7216 }
7218 /* Change this type to have a type with the specified mode.
7219 First check for the special modes. */
7232 else
7235 {
7238 }
7241 {
7244 }
7248 {
7280 }
7282 {
7285 }
7288 {
7293 {
7296 }
7300 else
7303 }
7304 else
7305 {
7306 /* For fixed-point modes, we need to test if the signness of type
7307 and the machine mode are consistent. */
7310 {
7313 }
7314 /* For fixed-point modes, we need to pass saturating info. */
7318 }
7321 {
7324 }
7326 {
7327 /* For enumeral types, copy the precision from the integer
7328 type returned above. If not an INTEGER_TYPE, we can't use
7329 this mode for this type. */
7331 {
7334 }
7337 {
7340 }
7341 else
7342 {
7343 /* We cannot build a type variant, as there's code that assumes
7344 that TYPE_MAIN_VARIANT has the same mode. This includes the
7345 debug generators. Instead, create a subrange type. This
7346 results in all of the enumeral values being emitted only once
7347 in the original, and the subtype gets them by reference. */
7350 else
7353 }
7354 }
7358 {
7361 }
7364 }
7367 }
7369 /* Handle a "section" attribute; arguments as in
7370 struct attribute_spec.handler. */
7372 static tree
7375 {
7379 {
7385 {
7389 {
7391 "section attribute cannot be specified for "
7394 }
7396 /* The decl may have already been given a section attribute
7397 from a previous declaration. Ensure they match. */
7401 {
7405 }
7409 {
7412 }
7413 else
7415 }
7416 else
7417 {
7420 }
7421 }
7422 else
7423 {
7427 }
7430 }
7432 /* Check whether ALIGN is a valid user-specified alignment. If so,
7433 return its base-2 log; if not, output an error and return -1. If
7434 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7435 no error. */
7436 int
7438 {
7443 {
7446 }
7451 {
7454 }
7456 {
7459 }
7461 }
7463 /*
7464 If in c++-11, check if the c++-11 alignment constraint with respect
7465 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7466 c++-11 mode, does nothing.
7468 [dcl.align]2/ says:
7470 [* if the constant expression evaluates to a fundamental alignment,
7471 the alignment requirement of the declared entity shall be the
7472 specified fundamental alignment.
7474 * if the constant expression evaluates to an extended alignment
7475 and the implementation supports that alignment in the context
7476 of the declaration, the alignment of the declared entity shall
7477 be that alignment
7479 * if the constant expression evaluates to an extended alignment
7480 and the implementation does not support that alignment in the
7481 context of the declaration, the program is ill-formed]. */
7483 static bool
7487 {
7500 {
7502 {
7503 /* For file scope variables and static members, the target
7504 supports alignments that are at most
7505 MAX_OFILE_ALIGNMENT. */
7508 }
7509 else
7510 {
7511 #ifdef BIGGEST_FIELD_ALIGNMENT
7512 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7513 #else
7514 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7515 #endif
7516 /* For non-static members, the target supports either
7517 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7518 if it is defined or BIGGEST_ALIGNMENT. */
7523 #undef MAX_TARGET_FIELD_ALIGNMENT
7524 /* For stack variables, the target supports at most
7525 MAX_STACK_ALIGNMENT. */
7529 }
7530 }
7532 {
7533 /* Let's be liberal for types. */
7536 }
7544 }
7546 /* Handle a "aligned" attribute; arguments as in
7547 struct attribute_spec.handler. */
7549 static tree
7552 {
7561 {
7565 }
7573 {
7576 /* If we have a TYPE_DECL, then copy the type, so that we
7577 don't accidentally modify a builtin type. See pushdecl. */
7580 {
7587 }
7588 else
7593 }
7596 {
7599 }
7602 /* C++-11 [dcl.align/4]:
7604 When multiple alignment-specifiers are specified for an
7605 entity, the alignment requirement shall be set to the
7606 strictest specified alignment.
7608 This formally comes from the c++11 specification but we are
7609 doing it for the GNU attribute syntax as well. */
7613 {
7618 else
7622 }
7623 else
7624 {
7627 }
7630 }
7632 /* Handle a "weak" attribute; arguments as in
7633 struct attribute_spec.handler. */
7635 static tree
7640 {
7643 {
7646 }
7648 {
7652 }
7656 else
7660 }
7662 /* Handle an "alias" or "ifunc" attribute; arguments as in
7663 struct attribute_spec.handler, except that IS_ALIAS tells us
7664 whether this is an alias as opposed to ifunc attribute. */
7666 static tree
7669 {
7674 {
7677 }
7681 /* A static variable declaration is always a tentative definition,
7682 but the alias is a non-tentative definition which overrides. */
7685 {
7689 }
7693 {
7697 }
7699 /* Note that the very first time we process a nested declaration,
7700 decl_function_context will not be set. Indeed, *would* never
7701 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7702 we do below. After such frobbery, pushdecl would set the context.
7703 In any case, this is never what we want. */
7705 {
7706 tree id;
7710 {
7714 }
7716 /* This counts as a use of the object pointed to. */
7721 else
7725 /* ifuncs are also aliases, so set that attribute too. */
7728 }
7729 else
7730 {
7733 }
7736 }
7738 /* Handle an "alias" or "ifunc" attribute; arguments as in
7739 struct attribute_spec.handler. */
7741 static tree
7744 {
7746 }
7748 /* Handle an "alias" or "ifunc" attribute; arguments as in
7749 struct attribute_spec.handler. */
7751 static tree
7754 {
7756 }
7758 /* Handle a "weakref" attribute; arguments as in struct
7759 attribute_spec.handler. */
7761 static tree
7764 {
7767 /* We must ignore the attribute when it is associated with
7768 local-scoped decls, since attribute alias is ignored and many
7769 such symbols do not even have a DECL_WEAK field. */
7771 || current_function_decl
7773 {
7777 }
7780 {
7784 }
7786 /* The idea here is that `weakref("name")' mutates into `weakref,
7787 alias("name")', and weakref without arguments, in turn,
7788 implicitly adds weak. */
7791 {
7798 }
7799 else
7800 {
7805 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7806 and that isn't supported; and because it wants to add it to
7807 the list of weak decls, which isn't helpful. */
7809 }
7812 }
7814 /* Handle an "visibility" attribute; arguments as in
7815 struct attribute_spec.handler. */
7817 static tree
7821 {
7827 {
7831 {
7833 name);
7835 }
7837 {
7841 }
7842 }
7844 {
7847 }
7850 {
7853 }
7855 /* If this is a type, set the visibility on the type decl. */
7857 {
7862 {
7864 name);
7866 }
7867 }
7877 else
7878 {
7879 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7881 }
7885 {
7899 }
7904 /* Go ahead and attach the attribute to the node as well. This is needed
7905 so we can determine whether we have VISIBILITY_DEFAULT because the
7906 visibility was not specified, or because it was explicitly overridden
7907 from the containing scope. */
7910 }
7912 /* Determine the ELF symbol visibility for DECL, which is either a
7913 variable or a function. It is an error to use this function if a
7914 definition of DECL is not available in this translation unit.
7915 Returns true if the final visibility has been determined by this
7916 function; false if the caller is free to make additional
7917 modifications. */
7919 bool
7921 {
7925 /* If the user explicitly specified the visibility with an
7926 attribute, honor that. DECL_VISIBILITY will have been set during
7927 the processing of the attribute. We check for an explicit
7928 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7929 to distinguish the use of an attribute from the use of a "#pragma
7930 GCC visibility push(...)"; in the latter case we still want other
7931 considerations to be able to overrule the #pragma. */
7933 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7938 /* Set default visibility to whatever the user supplied with
7939 visibility_specified depending on #pragma GCC visibility. */
7941 {
7944 {
7947 /* If visibility changed and DECL already has DECL_RTL, ensure
7948 symbol flags are updated. */
7953 }
7954 }
7956 }
7958 /* Handle an "tls_model" attribute; arguments as in
7959 struct attribute_spec.handler. */
7961 static tree
7964 {
7965 tree id;
7972 {
7975 }
7980 {
7983 }
7993 else
7994 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7998 }
8000 /* Handle a "no_instrument_function" attribute; arguments as in
8001 struct attribute_spec.handler. */
8003 static tree
8008 {
8012 {
8016 }
8018 {
8022 }
8023 else
8027 }
8029 /* Handle a "malloc" attribute; arguments as in
8030 struct attribute_spec.handler. */
8032 static tree
8035 {
8039 else
8040 {
8043 }
8046 }
8048 /* Handle a "alloc_size" attribute; arguments as in
8049 struct attribute_spec.handler. */
8051 static tree
8054 {
8057 {
8064 {
8069 }
8070 }
8072 }
8074 /* Handle a "fn spec" attribute; arguments as in
8075 struct attribute_spec.handler. */
8077 static tree
8081 {
8086 }
8088 /* Handle a "bnd_variable_size" attribute; arguments as in
8089 struct attribute_spec.handler. */
8091 static tree
8094 {
8096 {
8099 }
8102 }
8104 /* Handle a "bnd_legacy" attribute; arguments as in
8105 struct attribute_spec.handler. */
8107 static tree
8110 {
8112 {
8115 }
8118 }
8120 /* Handle a "warn_unused" attribute; arguments as in
8121 struct attribute_spec.handler. */
8123 static tree
8125 tree args ATTRIBUTE_UNUSED,
8127 {
8129 /* Do nothing else, just set the attribute. We'll get at
8130 it later with lookup_attribute. */
8131 ;
8132 else
8133 {
8136 }
8139 }
8141 /* Handle an "omp declare simd" attribute; arguments as in
8142 struct attribute_spec.handler. */
8144 static tree
8146 {
8148 }
8150 /* Handle an "omp declare target" attribute; arguments as in
8151 struct attribute_spec.handler. */
8153 static tree
8155 {
8157 }
8159 /* Handle a "returns_twice" attribute; arguments as in
8160 struct attribute_spec.handler. */
8162 static tree
8165 {
8168 else
8169 {
8172 }
8175 }
8177 /* Handle a "no_limit_stack" attribute; arguments as in
8178 struct attribute_spec.handler. */
8180 static tree
8185 {
8189 {
8193 }
8195 {
8199 }
8200 else
8204 }
8206 /* Handle a "pure" attribute; arguments as in
8207 struct attribute_spec.handler. */
8209 static tree
8212 {
8215 /* ??? TODO: Support types. */
8216 else
8217 {
8220 }
8223 }
8225 /* Digest an attribute list destined for a transactional memory statement.
8226 ALLOWED is the set of attributes that are allowed for this statement;
8227 return the attribute we parsed. Multiple attributes are never allowed. */
8229 int
8231 {
8236 {
8244 {
8247 }
8250 {
8253 }
8256 else
8258 }
8261 }
8263 /* Transform a TM attribute name into a maskable integer and back.
8264 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8265 to how the lack of an attribute is treated. */
8267 int
8269 {
8283 }
8285 tree
8287 {
8290 {
8308 }
8310 }
8312 /* Return the first TM attribute seen in LIST. */
8314 tree
8316 {
8318 {
8322 }
8324 }
8326 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8327 Here we accept only function types, and verify that none of the other
8328 function TM attributes are also applied. */
8329 /* ??? We need to accept class types for C++, but not C. This greatly
8330 complicates this function, since we can no longer rely on the extra
8331 processing given by function_type_required. */
8333 static tree
8336 {
8337 /* Only one path adds the attribute; others don't. */
8341 {
8344 /* Only tm_callable and tm_safe apply to classes. */
8347 /* FALLTHRU */
8351 {
8354 ;
8357 else
8359 }
8363 {
8366 {
8371 }
8372 }
8373 /* FALLTHRU */
8376 /* If a function is next, pass it on to be tried next. */
8380 ignored:
8383 }
8386 }
8388 /* Handle the TM_WRAP attribute; arguments as in
8389 struct attribute_spec.handler. */
8391 static tree
8394 {
8397 /* We don't need the attribute even on success, since we
8398 record the entry in an external table. */
8403 else
8404 {
8410 else
8411 {
8415 {
8419 else
8421 }
8422 else
8424 }
8425 }
8428 }
8430 /* Ignore the given attribute. Used when this attribute may be usefully
8431 overridden by the target, but is not used generically. */
8433 static tree
8437 {
8440 }
8442 /* Handle a "no vops" attribute; arguments as in
8443 struct attribute_spec.handler. */
8445 static tree
8449 {
8453 }
8455 /* Handle a "deprecated" attribute; arguments as in
8456 struct attribute_spec.handler. */
8458 static tree
8462 {
8470 {
8473 }
8476 {
8487 else
8489 }
8491 {
8496 }
8497 else
8501 {
8504 {
8510 }
8513 else
8515 }
8518 }
8520 /* Handle a "vector_size" attribute; arguments as in
8521 struct attribute_spec.handler. */
8523 static tree
8527 {
8537 {
8540 }
8542 /* Get the vector size (in bytes). */
8545 /* We need to provide for vector pointers, vector arrays, and
8546 functions returning vectors. For example:
8548 __attribute__((vector_size(16))) short *foo;
8550 In this case, the mode is SI, but the type being modified is
8551 HI, so we need to look further. */
8560 /* Get the mode of the type being modified. */
8571 {
8574 }
8577 {
8580 }
8583 {
8586 }
8588 /* Calculate how many units fit in the vector. */
8591 {
8594 }
8598 /* Build back pointers if needed. */
8602 }
8604 /* Handle the "nonnull" attribute. */
8605 static tree
8609 {
8613 /* If no arguments are specified, all pointer arguments should be
8614 non-null. Verify a full prototype is given so that the arguments
8615 will have the correct types when we actually check them later. */
8617 {
8619 {
8622 }
8624 }
8626 /* Argument list specified. Verify that each argument number references
8627 a pointer argument. */
8629 {
8633 {
8638 }
8641 {
8642 function_args_iterator iter;
8643 tree argument;
8647 {
8651 }
8655 {
8660 }
8663 {
8668 }
8669 }
8670 }
8673 }
8675 /* Check the argument list of a function call for null in argument slots
8676 that are marked as requiring a non-null pointer argument. The NARGS
8677 arguments are passed in the array ARGARRAY.
8678 */
8680 static void
8682 {
8683 tree a;
8691 /* See if any of the nonnull attributes has no arguments. If so,
8692 then every pointer argument is checked (in which case the check
8693 for pointer type is done in check_nonnull_arg). */
8695 do
8703 else
8704 {
8705 /* Walk the argument list. If we encounter an argument number we
8706 should check for non-null, do it. */
8708 {
8710 {
8714 }
8719 }
8720 }
8721 }
8723 /* Check that the Nth argument of a function call (counting backwards
8724 from the end) is a (pointer)0. The NARGS arguments are passed in the
8725 array ARGARRAY. */
8727 static void
8729 {
8733 {
8736 tree sentinel;
8737 function_args_iterator iter;
8738 tree t;
8740 /* Skip over the named arguments. */
8742 {
8745 len++;
8746 }
8749 {
8752 }
8754 /* The sentinel must be one of the varargs, i.e.
8755 in position >= the number of fixed arguments. */
8757 {
8761 }
8763 /* Validate the sentinel. */
8767 /* Although __null (in C++) is only an integer we allow it
8768 nevertheless, as we are guaranteed that it's exactly
8769 as wide as a pointer, and we don't want to force
8770 users to cast the NULL they have written there.
8771 We warn with -Wstrict-null-sentinel, though. */
8774 }
8775 }
8777 /* Helper for check_function_nonnull; given a list of operands which
8778 must be non-null in ARGS, determine if operand PARAM_NUM should be
8779 checked. */
8781 static bool
8783 {
8787 {
8794 }
8796 }
8798 /* Check that the function argument PARAM (which is operand number
8799 PARAM_NUM) is non-null. This is called by check_function_nonnull
8800 via check_function_arguments_recurse. */
8802 static void
8805 {
8806 /* Just skip checking the argument if it's not a pointer. This can
8807 happen if the "nonnull" attribute was given without an operand
8808 list (which means to check every pointer argument). */
8816 }
8818 /* Helper for nonnull attribute handling; fetch the operand number
8819 from the attribute argument list. */
8821 static bool
8823 {
8824 /* Verify the arg number is a constant. */
8831 }
8833 /* Handle a "nothrow" attribute; arguments as in
8834 struct attribute_spec.handler. */
8836 static tree
8839 {
8842 /* ??? TODO: Support types. */
8843 else
8844 {
8847 }
8850 }
8852 /* Handle a "cleanup" attribute; arguments as in
8853 struct attribute_spec.handler. */
8855 static tree
8858 {
8862 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8863 for global destructors in C++. This requires infrastructure that
8864 we don't have generically at the moment. It's also not a feature
8865 we'd be missing too much, since we do have attribute constructor. */
8867 {
8871 }
8873 /* Verify that the argument is a function in scope. */
8874 /* ??? We could support pointers to functions here as well, if
8875 that was considered desirable. */
8878 {
8882 }
8885 {
8889 }
8891 /* That the function has proper type is checked with the
8892 eventual call to build_function_call. */
8895 }
8897 /* Handle a "warn_unused_result" attribute. No special handling. */
8899 static tree
8903 {
8904 /* Ignore the attribute for functions not returning any value. */
8906 {
8909 }
8912 }
8914 /* Handle a "sentinel" attribute. */
8916 static tree
8919 {
8921 {
8925 }
8926 else
8927 {
8929 {
8933 }
8934 }
8937 {
8941 {
8945 }
8946 else
8947 {
8949 {
8953 }
8954 }
8955 }
8958 }
8960 /* Handle a "type_generic" attribute. */
8962 static tree
8966 {
8967 /* Ensure we have a function type. */
8970 /* Ensure we have a variadic function. */
8974 }
8976 /* Handle a "target" attribute. */
8978 static tree
8981 {
8982 /* Ensure we have a function type. */
8984 {
8987 }
8989 flags))
8993 }
8995 /* Arguments being collected for optimization. */
9000 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9001 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9002 false for #pragma GCC optimize. */
9004 bool
9006 {
9014 tree ap;
9016 /* Build up argv vector. Just in case the string is stored away, use garbage
9017 collected strings. */
9022 {
9026 {
9030 }
9033 {
9034 /* Split string into multiple substrings. */
9042 {
9049 {
9053 }
9054 else
9055 {
9058 }
9062 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9063 options. */
9065 {
9070 else
9074 }
9077 {
9080 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9081 itself is -Os, and any other switch begins with a -f. */
9087 }
9092 }
9094 }
9095 }
9105 /* Now parse the options. */
9115 /* Don't allow changing -fstrict-aliasing. */
9120 }
9122 /* For handling "optimize" attribute. arguments as in
9123 struct attribute_spec.handler. */
9125 static tree
9128 {
9129 /* Ensure we have a function type. */
9131 {
9134 }
9135 else
9136 {
9140 /* Save current options. */
9143 /* If we previously had some optimization options, use them as the
9144 default. */
9149 /* Parse options, and update the vector. */
9154 /* Restore current options. */
9156 }
9159 }
9161 /* Handle a "no_split_stack" attribute. */
9163 static tree
9168 {
9172 {
9176 }
9178 {
9182 }
9185 }
9187 /* Handle a "returns_nonnull" attribute; arguments as in
9188 struct attribute_spec.handler. */
9190 static tree
9193 {
9194 // Even without a prototype we still have a return type we can check.
9196 {
9199 }
9201 }
9203 \f
9204 /* Check for valid arguments being passed to a function with FNTYPE.
9205 There are NARGS arguments in the array ARGARRAY. */
9206 void
9208 {
9209 /* Check for null being passed in a pointer argument that must be
9210 non-null. We also need to do this if format checking is enabled. */
9215 /* Check for errors in format strings. */
9222 }
9224 /* Generic argument checking recursion routine. PARAM is the argument to
9225 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9226 once the argument is resolved. CTX is context for the callback. */
9227 void
9232 {
9236 {
9237 /* Strip coercion. */
9241 }
9244 {
9246 tree attrs;
9249 /* See if this is a call to a known internationalization function
9250 that modifies a format arg. Such a function may have multiple
9251 format_arg attributes (for example, ngettext). */
9254 attrs;
9257 {
9258 tree inner_arg;
9259 tree format_num_expr;
9262 call_expr_arg_iterator iter;
9264 /* Extract the argument number, which was previously checked
9265 to be valid. */
9277 {
9282 }
9283 }
9285 /* If we found a format_arg attribute and did a recursive check,
9286 we are done with checking this argument. Otherwise, we continue
9287 and this will be considered a non-literal. */
9290 }
9293 {
9294 /* Check both halves of the conditional expression. */
9300 }
9303 }
9305 /* Checks for a builtin function FNDECL that the number of arguments
9306 NARGS against the required number REQUIRED and issues an error if
9307 there is a mismatch. Returns true if the number of arguments is
9308 correct, otherwise false. */
9310 static bool
9312 {
9314 {
9318 }
9320 {
9324 }
9326 }
9328 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9329 Returns false if there was an error, otherwise true. */
9331 bool
9333 {
9339 {
9349 {
9351 {
9355 }
9357 }
9367 {
9374 {
9378 }
9380 }
9385 {
9390 {
9394 }
9397 {
9399 fndecl);
9401 }
9403 }
9408 {
9410 {
9413 }
9415 }
9420 }
9421 }
9423 /* Function to help qsort sort FIELD_DECLs by name order. */
9425 int
9427 {
9432 /* A nontype is "greater" than a type. */
9441 }
9444 gt_pointer_operator new_value;
9448 /* This routine compares two fields like field_decl_cmp but using the
9449 pointer operator in resort_data. */
9451 static int
9453 {
9458 /* A nontype is "greater" than a type. */
9464 {
9471 }
9473 }
9475 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9477 void
9480 gt_pointer_operator new_value,
9482 {
9487 resort_field_decl_cmp);
9488 }
9490 /* Subroutine of c_parse_error.
9491 Return the result of concatenating LHS and RHS. RHS is really
9492 a string literal, its first character is indicated by RHS_START and
9493 RHS_SIZE is its length (including the terminating NUL character).
9495 The caller is responsible for deleting the returned pointer. */
9499 {
9505 }
9507 /* Issue the error given by GMSGID, indicating that it occurred before
9508 TOKEN, which had the associated VALUE. */
9510 void
9513 {
9514 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9524 {
9529 {
9542 }
9546 else
9552 }
9574 {
9579 }
9587 {
9592 }
9593 else
9597 {
9600 }
9601 #undef catenate_messages
9602 }
9604 /* Mapping for cpp message reasons to the options that enable them. */
9606 struct reason_option_codes_t
9607 {
9610 };
9631 };
9633 /* Return the gcc option code associated with the reason for a cpp
9634 message, or 0 if none. */
9636 static int
9638 {
9642 {
9645 }
9647 }
9649 /* Callback from cpp_error for PFILE to print diagnostics from the
9650 preprocessor. The diagnostic is of type LEVEL, with REASON set
9651 to the reason code if LEVEL is represents a warning, at location
9652 LOCATION unless this is after lexing and the compiler's location
9653 should be used instead, with column number possibly overridden by
9654 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9655 the arguments. Returns true if a diagnostic was emitted, false
9656 otherwise. */
9658 bool
9662 {
9663 diagnostic_info diagnostic;
9664 diagnostic_t dlevel;
9669 {
9674 /* Fall through. */
9699 }
9712 }
9714 /* Convert a character from the host to the target execution character
9715 set. cpplib handles this, mostly. */
9717 HOST_WIDE_INT
9719 {
9720 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9721 zero-extended under -fno-signed-char. cpplib insists that characters
9722 and character constants are always unsigned. Hence we must convert
9723 back and forth. */
9731 else
9733 }
9735 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9736 references with an INDIRECT_REF of a constant at the bottom; much like the
9737 traditional rendering of offsetof as a macro. Return the folded result. */
9739 tree
9741 {
9745 {
9761 {
9764 }
9774 {
9778 }
9792 /* Check if the offset goes beyond the upper bound of the array. */
9794 {
9800 {
9804 {
9805 tree v;
9812 {
9820 }
9821 /* Don't warn if the array might be considered a poor
9822 man's flexible array member with a very permissive
9823 definition thereof. */
9827 "index %E denotes an offset "
9830 }
9831 }
9832 }
9839 /* Handle static members of volatile structs. */
9846 }
9849 }
9851 /* Likewise, but convert it to the return type of offsetof. */
9853 tree
9855 {
9857 }
9859 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9860 expression, because B will always be true. */
9862 void
9864 {
9867 "the omitted middle operand in ?: will always be %<true%>, "
9869 }
9871 /* Give an error for storing into ARG, which is 'const'. USE indicates
9872 how ARG was being used. */
9874 void
9876 {
9879 /* Using this macro rather than (for example) arrays of messages
9880 ensures that all the format strings are checked at compile
9881 time. */
9882 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9883 : (use == lv_increment ? (I) \
9884 : (use == lv_decrement ? (D) : (AS))))
9886 {
9897 else
9903 }
9909 arg);
9915 arg);
9917 {
9927 arg);
9928 }
9934 arg);
9935 else
9940 arg);
9941 }
9943 /* Print an error message for an invalid lvalue. USE says
9944 how the lvalue is being used and so selects the error message. LOC
9945 is the location for the error. */
9947 void
9949 {
9951 {
9969 }
9970 }
9972 /* Print an error message for an invalid indirection of type TYPE.
9973 ERRSTRING is the name of the operator for the indirection. */
9975 void
9977 {
9979 {
9987 type);
9992 type);
9997 type);
10002 type);
10007 type);
10011 }
10012 }
10013 \f
10014 /* *PTYPE is an incomplete array. Complete it with a domain based on
10015 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10016 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10017 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10019 int
10021 {
10029 {
10031 {
10032 int eltsize
10035 }
10037 {
10041 {
10045 }
10046 else
10047 {
10048 tree curindex;
10059 {
10063 else
10064 {
10066 {
10067 /* Since we treat size types now as ordinary
10068 unsigned types, we need an explicit overflow
10069 check. */
10073 }
10075 size_one_node);
10076 }
10079 }
10081 {
10085 }
10086 }
10087 }
10088 else
10089 {
10090 /* Make an error message unless that happened already. */
10093 }
10094 }
10095 else
10096 {
10100 }
10103 /* Force an indefinite layout factor. */
10110 else
10113 /* Using build_distinct_type_copy and modifying things afterward instead
10114 of using build_array_type to create a new type preserves all of the
10115 TYPE_LANG_FLAG_? bits that the front end may have set. */
10123 /* Make sure we have the canonical MAIN_TYPE. */
10126 hashcode);
10129 /* Fix the canonical type. */
10139 else
10144 else
10150 {
10152 /* If we proceed with the array type as it is, we'll eventually
10153 crash in tree_low_cst(). */
10155 }
10159 }
10161 /* Like c_mark_addressable but don't check register qualifier. */
10162 void
10164 {
10170 }
10173 \f
10174 /* Used to help initialize the builtin-types.def table. When a type of
10175 the correct size doesn't exist, use error_mark_node instead of NULL.
10176 The later results in segfaults even when a decl using the type doesn't
10177 get invoked. */
10179 tree
10181 {
10184 }
10186 /* A helper function for resolve_overloaded_builtin in resolving the
10187 overloaded __sync_ builtins. Returns a positive power of 2 if the
10188 first operand of PARAMS is a pointer to a supported data type.
10189 Returns 0 if an error is encountered. */
10191 static int
10193 {
10194 tree type;
10198 {
10201 }
10215 incompatible:
10218 }
10220 /* A helper function for resolve_overloaded_builtin. Adds casts to
10221 PARAMS to make arguments match up with those of FUNCTION. Drops
10222 the variadic arguments at the end. Returns false if some error
10223 was encountered; true on success. */
10225 static bool
10228 {
10229 function_args_iterator iter;
10230 tree ptype;
10234 /* We've declared the implementation functions to use "volatile void *"
10235 as the pointer parameter, so we shouldn't get any complaints from the
10236 call to check_function_arguments what ever type the user used. */
10241 /* For the rest of the values, we need to cast these to FTYPE, so that we
10242 don't get warnings for passing pointer types, etc. */
10245 {
10249 /* XXX void_type_node belies the abstraction. */
10255 {
10258 }
10260 /* Only convert parameters if arg_type is unsigned integer type with
10261 new format sync routines, i.e. don't attempt to convert pointer
10262 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10263 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10264 kinds). */
10266 {
10267 /* Ideally for the first conversion we'd use convert_for_assignment
10268 so that we get warnings for anything that doesn't match the pointer
10269 type. This isn't portable across the C and C++ front ends atm. */
10274 }
10277 }
10279 /* __atomic routines are not variadic. */
10281 {
10284 }
10286 /* The definition of these primitives is variadic, with the remaining
10287 being "an optional list of variables protected by the memory barrier".
10288 No clue what that's supposed to mean, precisely, but we consider all
10289 call-clobbered variables to be protected so we're safe. */
10293 }
10295 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10296 RESULT to make it match the type of the first pointer argument in
10297 PARAMS. */
10299 static tree
10301 {
10306 /* New format doesn't require casting unless the types are the same size. */
10309 else
10311 }
10313 /* This function verifies the PARAMS to generic atomic FUNCTION.
10314 It returns the size if all the parameters are the same size, otherwise
10315 0 is returned if the parameters are invalid. */
10317 static int
10320 {
10325 tree type_0;
10327 /* Determine the parameter makeup. */
10329 {
10345 }
10348 {
10351 }
10353 /* Get type of first parameter, and determine its size. */
10356 {
10358 function);
10360 }
10362 /* Types must be compile time constant sizes. */
10364 {
10367 function);
10369 }
10373 /* Zero size objects are not allowed. */
10375 {
10378 function);
10380 }
10382 /* Check each other parameter is a pointer and the same size. */
10384 {
10387 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10391 {
10393 function);
10395 }
10398 {
10400 function);
10402 }
10403 }
10405 /* Check memory model parameters for validity. */
10407 {
10410 {
10413 {
10416 function);
10417 }
10418 }
10419 else
10421 {
10423 function);
10425 }
10426 }
10429 }
10432 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10433 at the beginning of the parameter list PARAMS representing the size of the
10434 objects. This is to match the library ABI requirement. LOC is the location
10435 of the function call.
10436 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10437 returned to allow the external call to be constructed. */
10439 static tree
10442 {
10443 tree size_node;
10445 /* Insert a SIZE_T parameter as the first param. If there isn't
10446 enough space, allocate a new vector and recursively re-build with that. */
10448 {
10451 tree f;
10460 }
10462 /* Add the size parameter and leave as a function call for processing. */
10466 }
10469 /* Return whether atomic operations for naturally aligned N-byte
10470 arguments are supported, whether inline or through libatomic. */
10471 static bool
10473 {
10475 {
10487 }
10488 }
10490 /* This will process an __atomic_exchange function call, determine whether it
10491 needs to be mapped to the _N variation, or turned into a library call.
10492 LOC is the location of the builtin call.
10493 FUNCTION is the DECL that has been invoked;
10494 PARAMS is the argument list for the call. The return value is non-null
10495 TRUE is returned if it is translated into the proper format for a call to the
10496 external library, and NEW_RETURN is set the tree for that function.
10497 FALSE is returned if processing for the _N variation is required, and
10498 NEW_RETURN is set to the the return value the result is copied into. */
10499 static bool
10502 {
10507 /* Size of 0 is an error condition. */
10509 {
10512 }
10514 /* If not a lock-free size, change to the library generic format. */
10516 {
10519 }
10521 /* Otherwise there is a lockfree match, transform the call from:
10522 void fn(T* mem, T* desired, T* return, model)
10523 into
10524 *return = (T) (fn (In* mem, (In) *desired, model)) */
10531 /* Create pointer to appropriate size. */
10535 /* Convert object pointer to required type. */
10538 /* Convert new value to required type, and dereference it. */
10543 /* Move memory model to the 3rd position, and end param list. */
10547 /* Convert return pointer and dereference it for later assignment. */
10551 }
10554 /* This will process an __atomic_compare_exchange function call, determine
10555 whether it needs to be mapped to the _N variation, or turned into a lib call.
10556 LOC is the location of the builtin call.
10557 FUNCTION is the DECL that has been invoked;
10558 PARAMS is the argument list for the call. The return value is non-null
10559 TRUE is returned if it is translated into the proper format for a call to the
10560 external library, and NEW_RETURN is set the tree for that function.
10561 FALSE is returned if processing for the _N variation is required. */
10563 static bool
10567 {
10572 /* Size of 0 is an error condition. */
10574 {
10577 }
10579 /* If not a lock-free size, change to the library generic format. */
10581 {
10582 /* The library generic format does not have the weak parameter, so
10583 remove it from the param list. Since a parameter has been removed,
10584 we can be sure that there is room for the SIZE_T parameter, meaning
10585 there will not be a recursive rebuilding of the parameter list, so
10586 there is no danger this will be done twice. */
10588 {
10592 }
10595 }
10597 /* Otherwise, there is a match, so the call needs to be transformed from:
10598 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10599 into
10600 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10606 /* Create pointer to appropriate size. */
10610 /* Convert object pointer to required type. */
10614 /* Convert expected pointer to required type. */
10618 /* Convert desired value to required type, and dereference it. */
10623 /* The rest of the parameters are fine. NULL means no special return value
10624 processing.*/
10627 }
10630 /* This will process an __atomic_load function call, determine whether it
10631 needs to be mapped to the _N variation, or turned into a library call.
10632 LOC is the location of the builtin call.
10633 FUNCTION is the DECL that has been invoked;
10634 PARAMS is the argument list for the call. The return value is non-null
10635 TRUE is returned if it is translated into the proper format for a call to the
10636 external library, and NEW_RETURN is set the tree for that function.
10637 FALSE is returned if processing for the _N variation is required, and
10638 NEW_RETURN is set to the the return value the result is copied into. */
10640 static bool
10643 {
10648 /* Size of 0 is an error condition. */
10650 {
10653 }
10655 /* If not a lock-free size, change to the library generic format. */
10657 {
10660 }
10662 /* Otherwise, there is a match, so the call needs to be transformed from:
10663 void fn(T* mem, T* return, model)
10664 into
10665 *return = (T) (fn ((In *) mem, model)) */
10671 /* Create pointer to appropriate size. */
10675 /* Convert object pointer to required type. */
10679 /* Move memory model to the 2nd position, and end param list. */
10683 /* Convert return pointer and dereference it for later assignment. */
10687 }
10690 /* This will process an __atomic_store function call, determine whether it
10691 needs to be mapped to the _N variation, or turned into a library call.
10692 LOC is the location of the builtin call.
10693 FUNCTION is the DECL that has been invoked;
10694 PARAMS is the argument list for the call. The return value is non-null
10695 TRUE is returned if it is translated into the proper format for a call to the
10696 external library, and NEW_RETURN is set the tree for that function.
10697 FALSE is returned if processing for the _N variation is required, and
10698 NEW_RETURN is set to the the return value the result is copied into. */
10700 static bool
10703 {
10708 /* Size of 0 is an error condition. */
10710 {
10713 }
10715 /* If not a lock-free size, change to the library generic format. */
10717 {
10720 }
10722 /* Otherwise, there is a match, so the call needs to be transformed from:
10723 void fn(T* mem, T* value, model)
10724 into
10725 fn ((In *) mem, (In) *value, model) */
10730 /* Create pointer to appropriate size. */
10734 /* Convert object pointer to required type. */
10738 /* Convert new value to required type, and dereference it. */
10743 /* The memory model is in the right spot already. Return is void. */
10747 }
10750 /* Some builtin functions are placeholders for other expressions. This
10751 function should be called immediately after parsing the call expression
10752 before surrounding code has committed to the type of the expression.
10754 LOC is the location of the builtin call.
10756 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10757 PARAMS is the argument list for the call. The return value is non-null
10758 when expansion is complete, and null if normal processing should
10759 continue. */
10761 tree
10764 {
10770 {
10776 else
10780 }
10782 /* Handle BUILT_IN_NORMAL here. */
10784 {
10789 {
10790 /* Handle these 4 together so that they can fall through to the next
10791 case if the call is transformed to an _N variant. */
10793 {
10795 {
10799 /* Change to the _N variant. */
10802 }
10805 {
10807 params,
10810 /* Change to the _N variant. */
10813 }
10815 {
10819 /* Change to the _N variant. */
10822 }
10824 {
10828 /* Change to the _N variant. */
10831 }
10834 }
10835 /* Fallthrough to the normal processing. */
10836 }
10853 {
10855 /* Fallthru for parameter processing. */
10856 }
10873 {
10884 orig_format))
10896 /* If new_return is set, assign function to that expr and cast the
10897 result to void since the generic interface returned void. */
10899 {
10900 /* Cast function result from I{1,2,4,8,16} to the required type. */
10903 result);
10907 }
10909 }
10913 }
10914 }
10916 /* vector_types_compatible_elements_p is used in type checks of vectors
10917 values used as operands of binary operators. Where it returns true, and
10918 the other checks of the caller succeed (being vector types in he first
10919 place, and matching number of elements), we can just treat the types
10920 as essentially the same.
10921 Contrast with vector_targets_convertible_p, which is used for vector
10922 pointer types, and vector_types_convertible_p, which will allow
10923 language-specific matches under the control of flag_lax_vector_conversions,
10924 and might still require a conversion. */
10925 /* True if vector types T1 and T2 can be inputs to the same binary
10926 operator without conversion.
10927 We don't check the overall vector size here because some of our callers
10928 want to give different error messages when the vectors are compatible
10929 except for the element count. */
10931 bool
10933 {
10946 /* Equality works here because c_common_signed_type uses
10947 TYPE_MAIN_VARIANT. */
10955 }
10957 /* Check for missing format attributes on function pointers. LTYPE is
10958 the new type or left-hand side type. RTYPE is the old type or
10959 right-hand side type. Returns TRUE if LTYPE is missing the desired
10960 attribute. */
10962 bool
10964 {
10966 tree ra;
10972 {
10973 tree la;
10978 }
10979 else
10981 }
10983 /* Subscripting with type char is likely to lose on a machine where
10984 chars are signed. So warn on any machine, but optionally. Don't
10985 warn for unsigned char since that type is safe. Don't warn for
10986 signed char because anyone who uses that must have done so
10987 deliberately. Furthermore, we reduce the false positive load by
10988 warning only for non-constant value of type char. */
10990 void
10992 {
10996 }
10998 /* Implement -Wparentheses for the unexpected C precedence rules, to
10999 cover cases like x + y << z which readers are likely to
11000 misinterpret. We have seen an expression in which CODE is a binary
11001 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11002 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11003 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11004 expression was not formed using a binary or unary operator, or it
11005 was enclosed in parentheses. */
11007 void
11011 {
11015 /* This macro tests that the expression ARG with original tree code
11016 CODE appears to be a boolean expression. or the result of folding a
11017 boolean expression. */
11018 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11019 (truth_value_p (TREE_CODE (ARG)) \
11020 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11022 || ((CODE) != INTEGER_CST \
11023 && (integer_onep (ARG) || integer_zerop (ARG))))
11026 {
11075 /* Check cases like x|y==z */
11082 /* Check cases like !x | y */
11086 "suggest parentheses around operand of "
11099 /* Check cases like x^y==z */
11121 /* Check cases like x&y==z */
11128 /* Check cases like !x & y */
11132 "suggest parentheses around operand of "
11155 {
11160 "comparisons like %<X<=Y<=Z%> do not "
11166 "comparisons like %<X<=Y<=Z%> do not "
11168 }
11170 }
11171 #undef NOT_A_BOOLEAN_EXPR_P
11172 }
11174 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11176 void
11178 {
11180 {
11183 else
11185 }
11186 }
11188 /* Warn for division by zero according to the value of DIVISOR. LOC
11189 is the location of the division operator. */
11191 void
11193 {
11194 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11195 about division by zero. Do not issue a warning if DIVISOR has a
11196 floating-point type, since we consider 0.0/0.0 a valid way of
11197 generating a NaN. */
11201 }
11203 /* Subroutine of build_binary_op. Give warnings for comparisons
11204 between signed and unsigned quantities that may fail. Do the
11205 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11206 so that casts will be considered, but default promotions won't
11207 be.
11209 LOCATION is the location of the comparison operator.
11211 The arguments of this function map directly to local variables
11212 of build_binary_op. */
11214 void
11219 {
11224 /* In C++, check for comparison of different enum types. */
11230 {
11234 }
11236 /* Do not warn if the comparison is being done in a signed type,
11237 since the signed type will only be chosen if it can represent
11238 all the values of the unsigned type. */
11241 /* Do not warn if both operands are unsigned. */
11244 else
11245 {
11251 else
11259 /* Do not warn if the signed quantity is an unsuffixed integer
11260 literal (or some static constant expression involving such
11261 literals or a conditional expression involving such literals)
11262 and it is non-negative. */
11265 /* Do not warn if the comparison is an equality operation, the
11266 unsigned quantity is an integral constant, and it would fit
11267 in the result if the result were signed. */
11272 /* In C, do not warn if the unsigned quantity is an enumeration
11273 constant and its maximum value would fit in the result if the
11274 result were signed. */
11280 else
11282 OPT_Wsign_compare,
11284 }
11286 /* Warn if two unsigned values are being compared in a size larger
11287 than their original size, and one (and only one) is the result of
11288 a `~' operator. This comparison will always fail.
11290 Also warn if one operand is a constant, and the constant does not
11291 have all bits set that are set in the ~ operand when it is
11292 extended. */
11299 {
11306 {
11307 tree primop;
11313 {
11317 }
11318 else
11319 {
11323 }
11328 {
11331 {
11335 else
11338 }
11339 }
11340 }
11348 }
11349 }
11351 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11352 type via c_common_type. If -Wdouble-promotion is in use, and the
11353 conditions for warning have been met, issue a warning. GMSGID is
11354 the warning message. It must have two %T specifiers for the type
11355 that was converted (generally "float") and the type to which it was
11356 converted (generally "double), respectively. LOC is the location
11357 to which the awrning should refer. */
11359 void
11362 {
11363 tree source_type;
11367 /* If the conversion will not occur at run-time, there is no need to
11368 warn about it. */
11380 else
11383 }
11385 /* Setup a TYPE_DECL node as a typedef representation.
11387 X is a TYPE_DECL for a typedef statement. Create a brand new
11388 ..._TYPE node (which will be just a variant of the existing
11389 ..._TYPE node with identical properties) and then install X
11390 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11392 The whole point here is to end up with a situation where each
11393 and every ..._TYPE node the compiler creates will be uniquely
11394 associated with AT MOST one node representing a typedef name.
11395 This way, even though the compiler substitutes corresponding
11396 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11397 early on, later parts of the compiler can always do the reverse
11398 translation and get back the corresponding typedef name. For
11399 example, given:
11401 typedef struct S MY_TYPE;
11402 MY_TYPE object;
11404 Later parts of the compiler might only know that `object' was of
11405 type `struct S' if it were not for code just below. With this
11406 code however, later parts of the compiler see something like:
11408 struct S' == struct S
11409 typedef struct S' MY_TYPE;
11410 struct S' object;
11412 And they can then deduce (from the node for type struct S') that
11413 the original object declaration was:
11415 MY_TYPE object;
11417 Being able to do this is important for proper support of protoize,
11418 and also for generating precise symbolic debugging information
11419 which takes full account of the programmer's (typedef) vocabulary.
11421 Obviously, we don't want to generate a duplicate ..._TYPE node if
11422 the TYPE_DECL node that we are now processing really represents a
11423 standard built-in type. */
11425 void
11427 {
11431 {
11434 }
11437 {
11445 }
11446 }
11448 /* Record the types used by the current global variable declaration
11449 being parsed, so that we can decide later to emit their debug info.
11450 Those types are in types_used_by_cur_var_decl, and we are going to
11451 store them in the types_used_by_vars_hash hash table.
11452 DECL is the declaration of the global variable that has been parsed. */
11454 void
11456 {
11460 {
11463 }
11464 }
11466 /* If DECL is a typedef that is declared in the current function,
11467 record it for the purpose of -Wunused-local-typedefs. */
11469 void
11471 {
11476 /* if this is not a locally defined typedef then we are not
11477 interested. */
11484 }
11486 /* If T is a TYPE_DECL declared locally, mark it as used. */
11488 void
11490 {
11495 }
11497 /* Warn if there are some unused locally defined typedefs in the
11498 current function. */
11500 void
11502 {
11504 tree decl;
11505 /* The number of times we have emitted -Wunused-local-typedefs
11506 warnings. If this is different from errorcount, that means some
11507 unrelated errors have been issued. In which case, we'll avoid
11508 emitting "unused-local-typedefs" warnings. */
11520 {
11524 OPT_Wunused_local_typedefs,
11527 }
11530 }
11532 /* The C and C++ parsers both use vectors to hold function arguments.
11533 For efficiency, we keep a cache of unused vectors. This is the
11534 cache. */
11539 /* Return a new vector from the cache. If the cache is empty,
11540 allocate a new vector. These vectors are GC'ed, so it is OK if the
11541 pointer is not released.. */
11545 {
11548 else
11549 {
11550 /* Passing 0 to vec::alloc returns NULL, and our callers require
11551 that we always return a non-NULL value. The vector code uses
11552 4 when growing a NULL vector, so we do too. */
11556 }
11557 }
11559 /* Release a vector of trees back to the cache. */
11561 void
11563 {
11565 {
11568 }
11569 }
11571 /* Get a new tree vector holding a single tree. */
11575 {
11579 }
11581 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11585 {
11590 }
11592 /* Get a new tree vector which is a copy of an existing one. */
11596 {
11599 tree t;
11606 }
11608 /* Return true if KEYWORD starts a type specifier. */
11610 bool
11612 {
11614 {
11644 }
11645 }
11647 /* Return true if KEYWORD names a type qualifier. */
11649 bool
11651 {
11653 {
11661 }
11662 }
11664 /* Return true if KEYWORD names a storage class specifier.
11666 RID_TYPEDEF is not included in this list despite `typedef' being
11667 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11668 such for syntactic convenience only. */
11670 bool
11672 {
11674 {
11684 }
11685 }
11687 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11689 static bool
11691 {
11693 {
11701 }
11702 }
11704 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11705 declaration-specifier (C99 6.7). */
11707 bool
11709 {
11716 {
11723 }
11724 }
11726 /* Initialize language-specific-bits of tree_contains_struct. */
11728 void
11730 {
11734 }
11736 /* Build a user-defined numeric literal out of an integer constant type VALUE
11737 with identifier SUFFIX. */
11739 tree
11742 {
11749 }
11751 /* For vector[index], convert the vector to a
11752 pointer of the underlying type. */
11753 void
11756 {
11758 {
11760 tree type1;
11774 }
11775 }
11777 /* Determine which of the operands, if any, is a scalar that needs to be
11778 converted to a vector, for the range of operations. */
11779 enum stv_conv
11782 {
11791 {
11792 /* Most GENERIC binary expressions require homogeneous arguments.
11793 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11794 argument that is a vector and a second one that is a scalar, so
11795 we never return stv_secondarg for them. */
11800 {
11802 {
11807 }
11808 else
11810 }
11817 /* ... fall through ... */
11838 /* What about UNLT_EXPR? */
11840 {
11841 tree tmp;
11843 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11846 }
11850 {
11852 {
11857 }
11859 }
11861 /* Allow integer --> real conversion if safe. */
11865 {
11867 {
11872 }
11874 }
11877 }
11880 }
11882 /* Return true iff ALIGN is an integral constant that is a fundamental
11883 alignment, as defined by [basic.align] in the c++-11
11884 specifications.
11886 That is:
11888 [A fundamental alignment is represented by an alignment less than or
11889 equal to the greatest alignment supported by the implementation
11890 in all contexts, which is equal to
11891 alignof(max_align_t)]. */
11893 bool
11895 {
11898 }