| blob | a93aba1cd74c3cb88b0eea8299723edcb3c3d23d |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2014 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/>. */
55 /* The following symbols are subsumed in the c_global_trees array, and
56 listed here individually for documentation purposes.
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
63 tree int128_integer_type_node;
65 tree short_unsigned_type_node;
66 tree long_unsigned_type_node;
67 tree long_long_unsigned_type_node;
68 tree int128_unsigned_type_node;
70 tree truthvalue_type_node;
71 tree truthvalue_false_node;
72 tree truthvalue_true_node;
74 tree ptrdiff_type_node;
76 tree unsigned_char_type_node;
77 tree signed_char_type_node;
78 tree wchar_type_node;
80 tree char16_type_node;
81 tree char32_type_node;
83 tree float_type_node;
84 tree double_type_node;
85 tree long_double_type_node;
87 tree complex_integer_type_node;
88 tree complex_float_type_node;
89 tree complex_double_type_node;
90 tree complex_long_double_type_node;
92 tree dfloat32_type_node;
93 tree dfloat64_type_node;
94 tree_dfloat128_type_node;
96 tree intQI_type_node;
97 tree intHI_type_node;
98 tree intSI_type_node;
99 tree intDI_type_node;
100 tree intTI_type_node;
102 tree unsigned_intQI_type_node;
103 tree unsigned_intHI_type_node;
104 tree unsigned_intSI_type_node;
105 tree unsigned_intDI_type_node;
106 tree unsigned_intTI_type_node;
108 tree widest_integer_literal_type_node;
109 tree widest_unsigned_literal_type_node;
111 Nodes for types `void *' and `const void *'.
113 tree ptr_type_node, const_ptr_type_node;
115 Nodes for types `char *' and `const char *'.
117 tree string_type_node, const_string_type_node;
119 Type `char[SOMENUMBER]'.
120 Used when an array of char is needed and the size is irrelevant.
122 tree char_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
196 /* C/ObjC language option variables. */
199 /* Nonzero means allow type mismatches in conditional expressions;
200 just make their values `void'. */
204 /* Nonzero means enable C89 Amendment 1 features. */
208 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
212 /* Nonzero means use the ISO C11 dialect of C. */
216 /* Nonzero means that we have builtin functions, and main is an int. */
221 /* ObjC language option variables. */
224 /* Tells the compiler that this is a special run. Do not perform any
225 compiling, instead we are to test some platform dependent features
226 and output a C header file with appropriate definitions. */
230 /* Tells the compiler what is the constant string class for ObjC. */
234 /* UPC language option variables. */
236 /* Nonzero whenever UPC -fupc-threads-N is asserted.
237 The value N gives the number of UPC threads to be
238 defined at compile-time. */
241 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
244 /* The implementation model for UPC threads that
245 are mapped to POSIX threads, specified at compilation
246 time by the -fupc-pthreads-model-* switch. */
247 upc_pthreads_model_kind upc_pthreads_model;
249 /* C++ language option variables. */
252 /* Nonzero means generate separate instantiation control files and
253 juggle them at link time. */
257 /* The C++ dialect being used. C++98 is the default. */
261 /* Maximum template instantiation depth. This limit exists to limit the
262 time it takes to notice excessively recursive template instantiations.
264 The default is lower than the 1024 recommended by the C++0x standard
265 because G++ runs out of stack before 1024 with highly recursive template
266 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
270 /* The elements of `ridpointers' are identifier nodes for the reserved
271 type names and storage classes. It is indexed by a RID_... value. */
276 /* Nonzero means don't warn about problems that occur when the code is
277 executed. */
280 /* Whether we are building a boolean conversion inside
281 convert_for_assignment, or some other late binary operation. If
282 build_binary_op is called for C (from code shared by C and C++) in
283 this case, then the operands have already been folded and the
284 result will not be folded again, so C_MAYBE_CONST_EXPR should not
285 be generated. */
288 /* Whether lexing has been completed, so subsequent preprocessor
289 errors should use the compiler's input_location. */
292 /* Information about how a function name is generated. */
293 struct fname_var_t
294 {
298 };
300 /* The three ways of getting then name of the current function. */
303 {
304 /* C99 compliant __func__, must be first. */
306 /* GCC __FUNCTION__ compliant. */
308 /* GCC __PRETTY_FUNCTION__ compliant. */
311 };
313 /* Global visibility options. */
404 /* Reserved words. The third field is a mask: keywords are disabled
405 if they match the mask.
407 Masks for languages:
408 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
409 C --std=c99: D_CXXONLY | D_OBJC
410 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
411 UPC is like C except that D_UPC is not set
412 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
413 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
414 ObjC++ is like C++ except that D_OBJC is not set
416 If -fno-asm is used, D_ASM is added to the mask. If
417 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
418 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
419 In C with -Wc++-compat, we warn if D_CXXWARN is set.
421 Note the complication of the D_CXX_OBJC keywords. These are
422 reserved words such as 'class'. In C++, 'class' is a reserved
423 word. In Objective-C++ it is too. In Objective-C, it is a
424 reserved word too, but only if it follows an '@' sign.
425 */
427 {
588 /* These Objective-C keywords are recognized only immediately after
589 an '@'. */
606 /* These are recognized only in protocol-qualifier context
607 (see above) */
615 /* UPC keywords */
627 /* These are recognized inside a property attribute list */
636 };
641 /* Table of machine-independent attributes common to all C-like languages. */
643 {
644 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
645 affects_type_identity } */
652 /* FIXME: logically, noreturn attributes should be listed as
653 "false, true, true" and apply to function types. But implementing this
654 would require all the places in the compiler that use TREE_THIS_VOLATILE
655 on a decl to identify non-returning functions to be located and fixed
656 to check the function type instead. */
681 /* The same comments as for noreturn attributes apply to const ones. */
705 handle_no_instrument_function_attribute,
723 /* ??? These two attributes didn't make the transition from the
724 Intel language document to the multi-vendor language document. */
729 /* For internal use (marking of builtins) only. The name contains space
730 to prevent its usage in source code. */
752 /* For internal use (marking of builtins) only. The name contains space
753 to prevent its usage in source code. */
764 handle_no_address_safety_analysis_attribute,
767 handle_no_sanitize_address_attribute,
770 handle_no_sanitize_undefined_attribute,
780 /* For internal use only. The leading '*' both prevents its usage in
781 source code and signals that it may be overridden by machine tables. */
786 /* For internal use (marking of builtins and runtime functions) only.
787 The name contains space to prevent its usage in source code. */
805 };
807 /* Give the specifications for the format attributes, used by C and all
808 descendants. */
811 {
812 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
813 affects_type_identity } */
819 };
821 /* Return identifier for address space AS. */
825 {
829 }
831 /* Push current bindings for the function name VAR_DECLS. */
833 void
835 {
840 {
844 {
846 saved);
848 }
849 }
851 /* Normally they'll have been NULL, so only push if we've got a
852 stack, or they are non-NULL. */
854 saved_function_name_decls);
855 }
857 /* Finish up the current bindings, adding them into the current function's
858 statement tree. This must be done _before_ finish_stmt_tree is called.
859 If there is no current function, we must be at file scope and no statements
860 are involved. Pop the previous bindings. */
862 void
864 {
873 {
881 }
887 {
888 /* We had saved values, restore them. */
889 tree saved;
892 {
897 }
899 }
901 }
903 /* Return the text name of the current function, suitably prettified
904 by PRETTY_P. Return string must be freed by caller. */
908 {
915 {
918 }
931 {
934 }
937 }
939 /* Return the VAR_DECL for a const char array naming the current
940 function. If the VAR_DECL has not yet been created, create it
941 now. RID indicates how it should be formatted and IDENTIFIER_NODE
942 ID is its name (unfortunately C and C++ hold the RID values of
943 keywords in different places, so we can't derive RID from ID in
944 this language independent code. LOC is the location of the
945 function. */
947 tree
949 {
959 {
960 /* If a tree is built here, it would normally have the lineno of
961 the current statement. Later this tree will be moved to the
962 beginning of the function and this line number will be wrong.
963 To avoid this problem set the lineno to 0 here; that prevents
964 it from appearing in the RTL. */
965 tree stmts;
973 saved_function_name_decls
977 }
982 }
984 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
986 tree
988 {
993 /* Compute the number of elements, for the array type. */
995 {
998 }
1000 {
1003 }
1005 {
1008 }
1009 else
1010 {
1013 }
1015 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1016 limit in C++98 Annex B is very large (65536) and is not normative,
1017 so we do not diagnose it (warn_overlength_strings is forced off
1018 in c_common_post_options). */
1020 {
1024 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1025 separate the %d from the 'C'. 'ISO' should not be
1026 translated, but it may be moved after 'C%d' in languages
1027 where modifiers follow nouns. */
1029 "string length %qd is greater than the length %qd "
1032 }
1034 /* Create the array type for the string constant. The ISO C++
1035 standard says that a string literal has type `const char[N]' or
1036 `const wchar_t[N]'. We use the same logic when invoked as a C
1037 front-end with -Wwrite-strings.
1038 ??? We should change the type of an expression depending on the
1039 state of a warning flag. We should just be warning -- see how
1040 this is handled in the C++ front-end for the deprecated implicit
1041 conversion from string literals to `char*' or `wchar_t*'.
1043 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1044 array type being the unqualified version of that type.
1045 Therefore, if we are constructing an array of const char, we must
1046 construct the matching unqualified array type first. The C front
1047 end does not require this, but it does no harm, so we do it
1048 unconditionally. */
1059 }
1060 \f
1061 /* If DISABLE is true, stop issuing warnings. This is used when
1062 parsing code that we know will not be executed. This function may
1063 be called multiple times, and works as a stack. */
1065 static void
1067 {
1069 {
1072 }
1073 }
1075 /* If ENABLE is true, reenable issuing warnings. */
1077 static void
1079 {
1081 {
1084 }
1085 }
1087 /* Fully fold EXPR, an expression that was not folded (beyond integer
1088 constant expressions and null pointer constants) when being built
1089 up. If IN_INIT, this is in a static initializer and certain
1090 changes are made to the folding done. Clear *MAYBE_CONST if
1091 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1092 expression because it contains an evaluated operator (in C99) or an
1093 operator outside of sizeof returning an integer constant (in C90)
1094 not permitted in constant expressions, or because it contains an
1095 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1096 set to true by callers before calling this function.) Return the
1097 folded expression. Function arguments have already been folded
1098 before calling this function, as have the contents of SAVE_EXPR,
1099 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1100 C_MAYBE_CONST_EXPR. */
1102 tree
1104 {
1105 tree ret;
1111 /* This function is not relevant to C++ because C++ folds while
1112 parsing, and may need changes to be correct for C++ when C++
1113 stops folding while parsing. */
1120 {
1123 }
1130 }
1132 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1133 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1134 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1135 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1136 both evaluated and unevaluated subexpressions while
1137 *MAYBE_CONST_ITSELF is carried from only evaluated
1138 subexpressions). */
1140 static tree
1143 {
1155 /* This function is not relevant to C++ because C++ folds while
1156 parsing, and may need changes to be correct for C++ when C++
1157 stops folding while parsing. */
1161 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1162 anything else not counted as an expression cannot usefully be
1163 folded further at this point. */
1169 /* Operands of variable-length expressions (function calls) have
1170 already been folded, as have __builtin_* function calls, and such
1171 expressions cannot occur in constant expressions. */
1173 {
1177 }
1180 {
1189 else
1192 }
1194 /* Assignment, increment, decrement, function call and comma
1195 operators, and statement expressions, cannot occur in constant
1196 expressions if evaluated / outside of sizeof. (Function calls
1197 were handled above, though VA_ARG_EXPR is treated like a function
1198 call here, and statement expressions are handled through
1199 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1201 {
1221 }
1223 /* Fold individual tree codes as appropriate. */
1225 {
1227 /* Any non-constancy will have been marked in a containing
1228 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1236 maybe_const_itself);
1241 {
1244 }
1253 maybe_const_itself);
1256 maybe_const_itself);
1262 {
1266 }
1308 /* Binary operations evaluating both arguments (increment and
1309 decrement are binary internally in GCC). */
1313 maybe_const_itself);
1321 /* The RHS of a MODIFY_EXPR was fully folded when building that
1322 expression for the sake of conversion warnings. */
1325 maybe_const_itself);
1329 ret = in_init
1332 else
1345 {
1356 }
1362 CASE_CONVERT:
1373 /* Unary operations. */
1376 maybe_const_itself);
1380 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1381 not prepared to deal with them if they occur in initializers.
1382 Avoid attempts to fold references to UPC shared components
1383 due to the complexities of UPC pointer-to-shared arithmetic. */
1392 ret = in_init
1395 else
1400 {
1404 }
1406 {
1409 CASE_CONVERT:
1410 /* Don't warn about explicit conversions. We will already
1411 have warned about suspect implicit conversions. */
1418 }
1423 /* Binary operations not necessarily evaluating both
1424 arguments. */
1431 ? truthvalue_false_node
1439 ret = in_init
1442 else
1447 && op0_const
1448 && op0_const_self
1454 && op0_const_self
1480 else
1485 && op0_const
1486 && op0_const_self
1490 && op0_const_self
1494 && op0_const
1495 && op0_const_self
1499 && op0_const_self
1505 /* Each case where an operand with excess precision may be
1506 encountered must remove the EXCESS_PRECISION_EXPR around
1507 inner operands and possibly put one around the whole
1508 expression or possibly convert to the semantic type (which
1509 c_fully_fold does); we cannot tell at this stage which is
1510 appropriate in any particular case. */
1514 /* Various codes may appear through folding built-in functions
1515 and their arguments. */
1517 }
1519 out:
1520 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1521 have been done by this point, so remove them again. */
1525 {
1529 }
1533 }
1535 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1536 return EXP. Otherwise, return either EXP or its known constant
1537 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1538 Is the BLKmode test appropriate? */
1540 tree
1542 {
1543 tree ret;
1545 /* This function is only used by C, for c_fully_fold and other
1546 optimization, and may not be correct for C++. */
1557 /* Avoid unwanted tree sharing between the initializer and current
1558 function's body where the tree can be modified e.g. by the
1559 gimplifier. */
1563 }
1565 /* Print a warning if a constant expression had overflow in folding.
1566 Invoke this function on every expression that the language
1567 requires to be a constant expression.
1568 Note the ANSI C standard says it is erroneous for a
1569 constant expression to overflow. */
1571 void
1573 {
1581 }
1583 /* The same as above but print an unconditional error. */
1584 void
1586 {
1593 }
1595 /* Print a warning if an expression had overflow in folding and its
1596 operands hadn't.
1598 Invoke this function on every expression that
1599 (1) appears in the source code, and
1600 (2) is a constant expression that overflowed, and
1601 (3) is not already checked by convert_and_check;
1602 however, do not invoke this function on operands of explicit casts
1603 or when the expression is the result of an operator and any operand
1604 already overflowed. */
1606 void
1608 {
1613 {
1642 }
1643 }
1645 /* Warn about uses of logical || / && operator in a context where it
1646 is likely that the bitwise equivalent was intended by the
1647 programmer. We have seen an expression in which CODE is a binary
1648 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1649 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1650 void
1654 {
1666 /* Warn if &&/|| are being used in a context where it is
1667 likely that the bitwise equivalent was intended by the
1668 programmer. That is, an expression such as op && MASK
1669 where op should not be any boolean expression, nor a
1670 constant, and mask seems to be a non-boolean integer constant. */
1678 {
1682 else
1687 }
1689 /* We do not warn for constants because they are typical of macro
1690 expansions that test for features. */
1694 /* This warning only makes sense with logical operands. */
1702 /* We first test whether either side separately is trivially true
1703 (with OR) or trivially false (with AND). If so, do not warn.
1704 This is a common idiom for testing ranges of data types in
1705 portable code. */
1712 /* If this is an OR operation, invert both sides; now, the result
1713 should be always false to get a warning. */
1727 /* If this is an OR operation, invert both sides; now, the result
1728 should be always false to get a warning. */
1736 /* If both expressions have the same operand, if we can merge the
1737 ranges, and if the range test is always false, then warn. */
1744 {
1747 "logical %<or%> "
1749 else
1751 "logical %<and%> "
1753 }
1754 }
1757 /* Warn if EXP contains any computations whose results are not used.
1758 Return true if a warning is printed; false otherwise. LOCUS is the
1759 (potential) location of the expression. */
1761 bool
1763 {
1764 restart:
1768 /* Don't warn about void constructs. This includes casting to void,
1769 void function calls, and statement expressions with a final cast
1770 to void. */
1778 {
1794 /* For a binding, warn if no side effect within it. */
1806 /* In && or ||, warn if 2nd operand has no side effect. */
1813 /* Let people do `(foo (), 0)' without a warning. */
1820 /* If this is an expression with side effects, don't warn; this
1821 case commonly appears in macro expansions. */
1827 /* Don't warn about automatic dereferencing of references, since
1828 the user cannot control it. */
1830 {
1833 }
1834 /* Fall through. */
1837 /* Referencing a volatile value is a side effect, so don't warn. */
1842 /* If this is an expression which has no operands, there is no value
1843 to be unused. There are no such language-independent codes,
1844 but front ends may define such. */
1848 warn:
1850 }
1851 }
1854 /* Print a warning about casts that might indicate violation
1855 of strict aliasing rules if -Wstrict-aliasing is used and
1856 strict aliasing mode is in effect. OTYPE is the original
1857 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1859 bool
1861 {
1862 /* Strip pointer conversion chains and get to the correct original type. */
1870 /* If the type we are casting to is a ref-all pointer
1871 dereferencing it is always valid. */
1878 {
1879 /* Casting the address of an object to non void pointer. Warn
1880 if the cast breaks type based aliasing. */
1882 {
1886 }
1887 else
1888 {
1889 /* warn_strict_aliasing >= 3. This includes the default (3).
1890 Only warn if the cast is dereferenced immediately. */
1891 alias_set_type set1 =
1897 {
1901 }
1904 {
1908 }
1909 }
1910 }
1911 else
1913 {
1914 /* At this level, warn for any conversions, even if an address is
1915 not taken in the same statement. This will likely produce many
1916 false positives, but could be useful to pinpoint problems that
1917 are not revealed at higher levels. */
1922 {
1926 }
1927 }
1930 }
1932 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1933 sizeof as last operand of certain builtins. */
1935 void
1939 {
1943 location_t loc;
1951 {
1955 /* FALLTHRU */
1963 /* FALLTHRU */
2022 }
2050 {
2054 {
2057 "argument to %<sizeof%> in %qD call is the same "
2058 "expression as the destination; did you mean to "
2064 "argument to %<sizeof%> in %qD call is the same "
2065 "expression as the destination; did you mean to "
2067 else
2069 "argument to %<sizeof%> in %qD call is the same "
2070 "expression as the destination; did you mean to "
2073 }
2076 && !strop
2079 {
2081 "argument to %<sizeof%> in %qD call is the same "
2082 "pointer type %qT as the destination; expected %qT "
2086 }
2087 }
2090 {
2094 {
2097 "argument to %<sizeof%> in %qD call is the same "
2098 "expression as the source; did you mean to "
2104 "argument to %<sizeof%> in %qD call is the same "
2105 "expression as the source; did you mean to "
2107 else
2109 "argument to %<sizeof%> in %qD call is the same "
2110 "expression as the source; did you mean to "
2113 }
2116 && !strop
2119 {
2121 "argument to %<sizeof%> in %qD call is the same "
2122 "pointer type %qT as the source; expected %qT "
2126 }
2127 }
2130 {
2134 {
2137 "argument to %<sizeof%> in %qD call is the same "
2138 "expression as the first source; did you mean to "
2144 "argument to %<sizeof%> in %qD call is the same "
2145 "expression as the first source; did you mean to "
2147 else
2149 "argument to %<sizeof%> in %qD call is the same "
2150 "expression as the first source; did you mean to "
2153 }
2156 && !strop
2159 {
2161 "argument to %<sizeof%> in %qD call is the same "
2162 "pointer type %qT as the first source; expected %qT "
2166 }
2167 }
2170 {
2174 {
2177 "argument to %<sizeof%> in %qD call is the same "
2178 "expression as the second source; did you mean to "
2184 "argument to %<sizeof%> in %qD call is the same "
2185 "expression as the second source; did you mean to "
2187 else
2189 "argument to %<sizeof%> in %qD call is the same "
2190 "expression as the second source; did you mean to "
2193 }
2196 && !strop
2199 {
2201 "argument to %<sizeof%> in %qD call is the same "
2202 "pointer type %qT as the second source; expected %qT "
2206 }
2207 }
2209 }
2211 /* Warn for unlikely, improbable, or stupid DECL declarations
2212 of `main'. */
2214 void
2216 {
2217 function_args_iterator iter;
2218 tree type;
2222 {
2223 /* XXX void_type_node belies the abstraction. */
2229 {
2251 "third argument of %q+D should probably be "
2254 }
2255 }
2257 /* It is intentional that this message does not mention the third
2258 argument because it's only mentioned in an appendix of the
2259 standard. */
2263 }
2265 /* vector_targets_convertible_p is used for vector pointer types. The
2266 callers perform various checks that the qualifiers are satisfactory,
2267 while OTOH vector_targets_convertible_p ignores the number of elements
2268 in the vectors. That's fine with vector pointers as we can consider,
2269 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2270 and that does not require and conversion of the pointer values.
2271 In contrast, vector_types_convertible_p and
2272 vector_types_compatible_elements_p are used for vector value types. */
2273 /* True if pointers to distinct types T1 and T2 can be converted to
2274 each other without an explicit cast. Only returns true for opaque
2275 vector types. */
2276 bool
2278 {
2285 }
2287 /* vector_types_convertible_p is used for vector value types.
2288 It could in principle call vector_targets_convertible_p as a subroutine,
2289 but then the check for vector type would be duplicated with its callers,
2290 and also the purpose of vector_targets_convertible_p would become
2291 muddled.
2292 Where vector_types_convertible_p returns true, a conversion might still be
2293 needed to make the types match.
2294 In contrast, vector_targets_convertible_p is used for vector pointer
2295 values, and vector_types_compatible_elements_p is used specifically
2296 in the context for binary operators, as a check if use is possible without
2297 conversion. */
2298 /* True if vector types T1 and T2 can be converted to each other
2299 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2300 can only be converted with -flax-vector-conversions yet that is not
2301 in effect, emit a note telling the user about that option if such
2302 a note has not previously been emitted. */
2303 bool
2305 {
2313 convertible_lax =
2328 {
2331 "conversions between vectors with differing "
2333 }
2336 }
2338 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2339 and have vector types, V0 has the same type as V1, and the number of
2340 elements of V0, V1, MASK is the same.
2342 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2343 called with two arguments. In this case implementation passes the
2344 first argument twice in order to share the same tree code. This fact
2345 could enable the mask-values being twice the vector length. This is
2346 an implementation accident and this semantics is not guaranteed to
2347 the user. */
2348 tree
2351 {
2352 tree ret;
2358 {
2361 }
2369 {
2374 }
2378 {
2382 }
2385 {
2390 }
2396 {
2399 "argument vector(s) and the mask vector should "
2402 }
2406 {
2411 }
2414 {
2415 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2421 else
2422 {
2425 }
2429 }
2439 }
2441 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2442 to integral type. */
2444 static tree
2446 {
2451 {
2452 /* C++0x scoped enumerations don't implicitly convert to integral
2453 type; if we stripped an explicit conversion to a larger type we
2454 need to replace it so common_type will still work. */
2458 }
2460 }
2462 /* This is a helper function of build_binary_op.
2464 For certain operations if both args were extended from the same
2465 smaller type, do the arithmetic in that type and then extend.
2467 BITWISE indicates a bitwise operation.
2468 For them, this optimization is safe only if
2469 both args are zero-extended or both are sign-extended.
2470 Otherwise, we might change the result.
2471 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2472 but calculated in (unsigned short) it would be (unsigned short)-1.
2473 */
2474 tree
2476 {
2480 tree type;
2482 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2483 excessive narrowing when we call get_narrower below. For
2484 example, suppose that OP0 is of unsigned int extended
2485 from signed char and that RESULT_TYPE is long long int.
2486 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2487 like
2489 (long long int) (unsigned int) signed_char
2491 which get_narrower would narrow down to
2493 (unsigned int) signed char
2495 If we do not cast OP0 first, get_narrower would return
2496 signed_char, which is inconsistent with the case of the
2497 explicit cast. */
2504 /* UNS is 1 if the operation to be done is an unsigned one. */
2507 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2508 but it *requires* conversion to FINAL_TYPE. */
2519 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2521 /* For bitwise operations, signedness of nominal type
2522 does not matter. Consider only how operands were extended. */
2526 /* Note that in all three cases below we refrain from optimizing
2527 an unsigned operation on sign-extended args.
2528 That would not be valid. */
2530 /* Both args variable: if both extended in same way
2531 from same width, do it in that width.
2532 Do it unsigned if args were zero-extended. */
2539 return c_common_signed_or_unsigned_type
2546 && (type
2557 && (type
2565 }
2567 /* Checks if expression EXPR of real/integer type cannot be converted
2568 to the real/integer type TYPE. Function returns non-zero when:
2569 * EXPR is a constant which cannot be exactly converted to TYPE.
2570 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2571 for EXPR type and TYPE being both integers or both real.
2572 * EXPR is not a constant of real type and TYPE is an integer.
2573 * EXPR is not a constant of integer type which cannot be
2574 exactly converted to real type.
2575 Function allows conversions between types of different signedness and
2576 can return SAFE_CONVERSION (zero) in that case. Function can produce
2577 signedness warnings if PRODUCE_WARNS is true. */
2579 enum conversion_safety
2581 {
2587 {
2588 /* Warn for real constant that is not an exact integer converted
2589 to integer type. */
2592 {
2595 }
2596 /* Warn for an integer constant that does not fit into integer type. */
2600 {
2603 {
2607 }
2609 {
2613 }
2614 else
2616 }
2618 {
2619 /* Warn for an integer constant that does not fit into real type. */
2621 {
2625 }
2626 /* Warn for a real constant that does not fit into a smaller
2627 real type. */
2630 {
2634 }
2635 }
2636 }
2637 else
2638 {
2639 /* Warn for real types converted to integer types. */
2646 {
2647 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2651 /* Don't warn for short y; short x = ((int)y & 0xff); */
2655 {
2656 /* If both args were extended from a shortest type,
2657 use that type if that is safe. */
2664 {
2670 /* If one of the operands is a non-negative constant
2671 that fits in the target type, then the type of the
2672 other operand does not matter. */
2681 /* If constant is unsigned and fits in the target
2682 type, then the result will also fit. */
2684 && unsigned0
2687 && unsigned1
2690 }
2691 }
2692 /* Warn for integer types converted to smaller integer types. */
2696 /* When they are the same width but different signedness,
2697 then the value may change. */
2700 /* Even when converted to a bigger type, if the type is
2701 unsigned but expr is signed, then negative values
2702 will be changed. */
2708 }
2710 /* Warn for integer types converted to real types if and only if
2711 all the range of values of the integer type cannot be
2712 represented by the real type. */
2715 {
2719 /* Don't warn about char y = 0xff; float x = (int) y; */
2731 }
2733 /* Warn for real types converted to smaller real types. */
2738 }
2741 }
2743 /* Warns if the conversion of EXPR to TYPE may alter a value.
2744 This is a helper function for warnings_for_convert_and_check. */
2746 static void
2748 {
2755 /* This may happen, because for LHS op= RHS we preevaluate
2756 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2757 means we could no longer see the code of the EXPR. */
2764 {
2777 /* Conversion from boolean to a signed:1 bit-field (which only
2778 can hold the values 0 and -1) doesn't lose information - but
2779 it does change the value. */
2799 {
2800 /* In case of COND_EXPR, we do not care about the type of
2801 COND_EXPR, only about the conversion of each operand. */
2808 }
2820 }
2821 }
2823 /* Produce warnings after a conversion. RESULT is the result of
2824 converting EXPR to TYPE. This is a helper function for
2825 convert_and_check and cp_convert_and_check. */
2827 void
2829 tree result)
2830 {
2837 {
2838 /* Do not diagnose overflow in a constant expression merely
2839 because a conversion overflowed. */
2844 {
2845 /* This detects cases like converting -129 or 256 to
2846 unsigned char. */
2850 else
2852 }
2856 /* No warning for converting 0x80000000 to int. */
2864 else
2866 }
2871 else
2873 }
2876 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2877 Invoke this function on every expression that is converted implicitly,
2878 i.e. because of language rules and not because of an explicit cast. */
2880 tree
2882 {
2883 tree result;
2884 tree expr_for_warning;
2886 /* Convert from a value with possible excess precision rather than
2887 via the semantic type, but do not warn about values not fitting
2888 exactly in the semantic type. */
2890 {
2896 }
2897 else
2911 }
2912 \f
2913 /* A node in a list that describes references to variables (EXPR), which are
2914 either read accesses if WRITER is zero, or write accesses, in which case
2915 WRITER is the parent of EXPR. */
2916 struct tlist
2917 {
2920 };
2922 /* Used to implement a cache the results of a call to verify_tree. We only
2923 use this for SAVE_EXPRs. */
2924 struct tlist_cache
2925 {
2929 tree expr;
2930 };
2932 /* Obstack to use when allocating tlist structures, and corresponding
2933 firstobj. */
2937 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2938 warnings. */
2940 /* SAVE_EXPRs need special treatment. We process them only once and then
2941 cache the results. */
2953 /* Create a new struct tlist and fill in its fields. */
2956 {
2963 }
2965 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2966 is nonnull, we ignore any node we find which has a writer equal to it. */
2968 static void
2970 {
2972 {
2979 }
2980 }
2982 /* Merge the nodes of ADD into TO. This merging process is done so that for
2983 each variable that already exists in TO, no new node is added; however if
2984 there is a write access recorded in ADD, and an occurrence on TO is only
2985 a read access, then the occurrence in TO will be modified to record the
2986 write. */
2988 static void
2990 {
2997 {
3004 {
3008 }
3010 {
3014 }
3016 }
3017 }
3019 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
3020 references in list LIST conflict with it, excluding reads if ONLY writers
3021 is nonzero. */
3023 static void
3026 {
3029 /* Avoid duplicate warnings. */
3035 {
3039 {
3044 }
3046 }
3047 }
3049 /* Given a list LIST of references to variables, find whether any of these
3050 can cause conflicts due to missing sequence points. */
3052 static void
3054 {
3058 {
3061 }
3062 }
3064 /* Return nonzero if X is a tree that can be verified by the sequence point
3065 warnings. */
3066 static int
3068 {
3075 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3076 (lvalue_p) crash on TRY/CATCH. */
3083 /* No point to track non-const calls, they will never satisfy
3084 operand_equal_p. */
3092 }
3094 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3095 static bool
3097 {
3099 }
3101 /* Walk the tree X, and record accesses to variables. If X is written by the
3102 parent tree, WRITER is the parent.
3103 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3104 expression or its only operand forces a sequence point, then everything up
3105 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3106 in PNO_SP.
3107 Once we return, we will have emitted warnings if any subexpression before
3108 such a sequence point could be undefined. On a higher level, however, the
3109 sequence point may not be relevant, and we'll merge the two lists.
3111 Example: (b++, a) + b;
3112 The call that processes the COMPOUND_EXPR will store the increment of B
3113 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3114 processes the PLUS_EXPR will need to merge the two lists so that
3115 eventually, all accesses end up on the same list (and we'll warn about the
3116 unordered subexpressions b++ and b.
3118 A note on merging. If we modify the former example so that our expression
3119 becomes
3120 (b++, b) + a
3121 care must be taken not simply to add all three expressions into the final
3122 PNO_SP list. The function merge_tlist takes care of that by merging the
3123 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3124 way, so that no more than one access to B is recorded. */
3126 static void
3128 tree writer)
3129 {
3134 /* X may be NULL if it is the operand of an empty statement expression
3135 ({ }). */
3139 restart:
3147 {
3180 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3181 two first, to avoid warning for (a ? b++ : b++). */
3197 /* Expressions inside the LHS are not ordered wrt. the sequence points
3198 in the RHS. Example:
3199 *a = (a++, 2)
3200 Despite the fact that the modification of "a" is in the before_sp
3201 list (tmp_before), it conflicts with the use of "a" in the LHS.
3202 We can handle this by adding the contents of tmp_list3
3203 to those of tmp_before, and redoing the collision warnings for that
3204 list. */
3207 /* Exclude the LHS itself here; we first have to merge it into the
3208 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3209 didn't exclude the LHS, we'd get it twice, once as a read and once
3210 as a write. */
3221 /* We need to warn about conflicts among arguments and conflicts between
3222 args and the function address. Side effects of the function address,
3223 however, are not ordered by the sequence point of the call. */
3224 {
3225 call_expr_arg_iterator iter;
3226 tree arg;
3230 {
3235 }
3240 }
3243 /* Scan all the list, e.g. indices of multi dimensional array. */
3245 {
3251 }
3255 {
3262 {
3276 }
3280 }
3290 /* For other expressions, simply recurse on their operands.
3291 Manual tail recursion for unary expressions.
3292 Other non-expressions need not be processed. */
3294 {
3298 }
3300 {
3304 {
3309 }
3310 }
3312 }
3313 }
3315 /* Try to warn for undefined behavior in EXPR due to missing sequence
3316 points. */
3318 DEBUG_FUNCTION void
3320 {
3326 {
3329 }
3334 }
3335 \f
3336 /* Validate the expression after `case' and apply default promotions. */
3338 static tree
3340 {
3345 /* Promote char or short to int. */
3348 {
3351 }
3356 }
3357 \f
3358 /* See if the case values LOW and HIGH are in the range of the original
3359 type (i.e. before the default conversion to int) of the switch testing
3360 expression.
3361 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3362 the type before promoting it. CASE_LOW_P is a pointer to the lower
3363 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3364 if the case is not a case range.
3365 The caller has to make sure that we are not called with NULL for
3366 CASE_LOW_P (i.e. the default case).
3367 Returns true if the case label is in range of ORIG_TYPE (saturated or
3368 untouched) or false if the label is out of range. */
3370 static bool
3373 {
3378 /* If there was a problem with the original type, do nothing. */
3385 /* Case label is less than minimum for type. */
3388 {
3391 }
3393 /* Case value is greater than maximum for type. */
3396 {
3399 }
3401 /* Saturate lower case label value to minimum. */
3404 {
3408 }
3410 /* Saturate upper case label value to maximum. */
3413 {
3417 }
3425 }
3426 \f
3427 /* Return an integer type with BITS bits of precision,
3428 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3430 tree
3432 {
3471 }
3473 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3474 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3475 and saturating if SATP is nonzero, otherwise not saturating. */
3477 tree
3480 {
3484 else
3492 {
3494 "fixed-point types that have too many integral and "
3497 }
3500 }
3502 /* Used for communication between c_common_type_for_mode and
3503 c_register_builtin_type. */
3506 /* Return a data type that has machine mode MODE.
3507 If the mode is an integer,
3508 then UNSIGNEDP selects between signed and unsigned types.
3509 If the mode is a fixed-point mode,
3510 then UNSIGNEDP selects between saturating and nonsaturating types. */
3512 tree
3514 {
3515 tree t;
3552 #if HOST_BITS_PER_WIDE_INT >= 64
3555 #endif
3580 {
3582 tree inner_type;
3598 }
3600 {
3605 }
3615 {
3701 }
3709 }
3711 tree
3713 {
3715 }
3717 /* Return a signed type the same as TYPE in other respects. */
3719 tree
3721 {
3723 }
3725 /* Return a type the same as TYPE except unsigned or
3726 signed according to UNSIGNEDP. */
3728 tree
3730 {
3731 tree type1;
3733 /* This block of code emulates the behavior of the old
3734 c_common_unsigned_type. In particular, it returns
3735 long_unsigned_type_node if passed a long, even when a int would
3736 have the same size. This is necessary for warnings to work
3737 correctly in archs where sizeof(int) == sizeof(long) */
3740 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3756 #if HOST_BITS_PER_WIDE_INT >= 64
3759 #endif
3769 #define C_COMMON_FIXED_TYPES(NAME) \
3770 if (type1 == short_ ## NAME ## _type_node \
3771 || type1 == unsigned_short_ ## NAME ## _type_node) \
3772 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3773 : short_ ## NAME ## _type_node; \
3774 if (type1 == NAME ## _type_node \
3775 || type1 == unsigned_ ## NAME ## _type_node) \
3776 return unsignedp ? unsigned_ ## NAME ## _type_node \
3777 : NAME ## _type_node; \
3778 if (type1 == long_ ## NAME ## _type_node \
3779 || type1 == unsigned_long_ ## NAME ## _type_node) \
3780 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3781 : long_ ## NAME ## _type_node; \
3782 if (type1 == long_long_ ## NAME ## _type_node \
3783 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3784 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3785 : long_long_ ## NAME ## _type_node;
3787 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3788 if (type1 == NAME ## _type_node \
3789 || type1 == u ## NAME ## _type_node) \
3790 return unsignedp ? u ## NAME ## _type_node \
3791 : NAME ## _type_node;
3793 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3794 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3795 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3796 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3797 : sat_ ## short_ ## NAME ## _type_node; \
3798 if (type1 == sat_ ## NAME ## _type_node \
3799 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3800 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3801 : sat_ ## NAME ## _type_node; \
3802 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3803 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3804 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3805 : sat_ ## long_ ## NAME ## _type_node; \
3806 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3807 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3808 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3809 : sat_ ## long_long_ ## NAME ## _type_node;
3811 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3812 if (type1 == sat_ ## NAME ## _type_node \
3813 || type1 == sat_ ## u ## NAME ## _type_node) \
3814 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3815 : sat_ ## NAME ## _type_node;
3841 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3842 the precision; they have precision set to match their range, but
3843 may use a wider mode to match an ABI. If we change modes, we may
3844 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3845 the precision as well, so as to yield correct results for
3846 bit-field types. C++ does not have these separate bit-field
3847 types, and producing a signed or unsigned variant of an
3848 ENUMERAL_TYPE may cause other problems as well. */
3854 #define TYPE_OK(node) \
3855 (TYPE_MODE (type) == TYPE_MODE (node) \
3856 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3875 #if HOST_BITS_PER_WIDE_INT >= 64
3878 #endif
3887 #undef TYPE_OK
3890 }
3892 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3894 tree
3896 {
3897 /* Extended integer types of the same width as a standard type have
3898 lesser rank, so those of the same width as int promote to int or
3899 unsigned int and are valid for printf formats expecting int or
3900 unsigned int. To avoid such special cases, avoid creating
3901 extended integer types for bit-fields if a standard integer type
3902 is available. */
3919 }
3921 /* The C version of the register_builtin_type langhook. */
3923 void
3925 {
3926 tree decl;
3936 }
3937 \f
3938 /* Print an error message for invalid operands to arith operation
3939 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3940 LOCATION is the location of the message. */
3942 void
3945 {
3949 {
3994 }
3998 }
3999 \f
4000 /* Given an expression as a tree, return its original type. Do this
4001 by stripping any conversion that preserves the sign and precision. */
4002 static tree
4004 {
4007 }
4009 /* Subroutine of build_binary_op, used for comparison operations.
4010 See if the operands have both been converted from subword integer types
4011 and, if so, perhaps change them both back to their original type.
4012 This function is also responsible for converting the two operands
4013 to the proper common type for comparison.
4015 The arguments of this function are all pointers to local variables
4016 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4017 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4019 LOC is the location of the comparison.
4021 If this function returns nonzero, it means that the comparison has
4022 a constant value. What this function returns is an expression for
4023 that value. */
4025 tree
4028 {
4029 tree type;
4037 /* Throw away any conversions to wider types
4038 already present in the operands. */
4043 /* If primopN is first sign-extended from primopN's precision to opN's
4044 precision, then zero-extended from opN's precision to
4045 *restype_ptr precision, shortenings might be invalid. */
4048 && !unsignedp0
4053 && !unsignedp1
4057 /* Handle the case that OP0 does not *contain* a conversion
4058 but it *requires* conversion to FINAL_TYPE. */
4065 /* If one of the operands must be floated, we cannot optimize. */
4069 /* If first arg is constant, swap the args (changing operation
4070 so value is preserved), for canonicalization. Don't do this if
4071 the second arg is 0. */
4076 {
4093 {
4108 }
4110 }
4112 /* If comparing an integer against a constant more bits wide,
4113 maybe we can deduce a value of 1 or 0 independent of the data.
4114 Or else truncate the constant now
4115 rather than extend the variable at run time.
4117 This is only interesting if the constant is the wider arg.
4118 Also, it is not safe if the constant is unsigned and the
4119 variable arg is signed, since in this case the variable
4120 would be sign-extended and then regarded as unsigned.
4121 Our technique fails in this case because the lowest/highest
4122 possible unsigned results don't follow naturally from the
4123 lowest/highest possible values of the variable operand.
4124 For just EQ_EXPR and NE_EXPR there is another technique that
4125 could be used: see if the constant can be faithfully represented
4126 in the other operand's type, by truncating it and reextending it
4127 and see if that preserves the constant's value. */
4133 {
4136 /* 1 if comparison is nominally unsigned. */
4138 tree val;
4150 {
4151 /* Convert primop1 to target type, but do not introduce
4152 additional overflow. We know primop1 is an int_cst. */
4156 }
4158 {
4161 }
4164 {
4169 }
4170 else
4171 {
4176 }
4179 /* This used to be a switch, but Genix compiler can't handle that. */
4181 {
4184 }
4186 {
4189 }
4191 {
4196 }
4198 {
4203 }
4205 {
4210 }
4212 {
4217 }
4219 /* If primop0 was sign-extended and unsigned comparison specd,
4220 we did a signed comparison above using the signed type bounds.
4221 But the comparison we output must be unsigned.
4223 Also, for inequalities, VAL is no good; but if the signed
4224 comparison had *any* fixed result, it follows that the
4225 unsigned comparison just tests the sign in reverse
4226 (positive values are LE, negative ones GE).
4227 So we can generate an unsigned comparison
4228 against an extreme value of the signed type. */
4231 {
4234 {
4249 }
4251 }
4254 {
4261 }
4264 {
4265 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4269 }
4271 /* Value is not predetermined, but do the comparison
4272 in the type of the operand that is not constant.
4273 TYPE is already properly set. */
4274 }
4276 /* If either arg is decimal float and the other is float, find the
4277 proper common type to use for comparison. */
4288 /* If args' natural types are both narrower than nominal type
4289 and both extend in the same manner, compare them
4290 in the type of the wider arg.
4291 Otherwise must actually extend both to the nominal
4292 common type lest different ways of extending
4293 alter the result.
4294 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4299 {
4303 type);
4304 /* Make sure shorter operand is extended the right way
4305 to match the longer operand. */
4306 primop0
4309 primop0);
4310 primop1
4313 primop1);
4314 }
4315 else
4316 {
4317 /* Here we must do the comparison on the nominal type
4318 using the args exactly as we received them. */
4325 {
4327 /* All unsigned values are >= 0, so we warn. However,
4328 if OP0 is a constant that is >= 0, the signedness of
4329 the comparison isn't an issue, so suppress the
4330 warning. */
4335 primop0)))
4336 /* Do not warn for enumeration types. */
4340 {
4357 }
4360 {
4361 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4366 }
4367 }
4368 }
4376 }
4377 \f
4378 /* Return a tree for the sum or difference (RESULTCODE says which)
4379 of pointer PTROP and integer INTOP. */
4381 tree
4384 {
4387 /* The result is a pointer of the same type that is being added. */
4390 /* If the pointer lives in UPC shared memory, then
4391 drop the 'shared' qualifier. */
4396 {
4403 }
4405 {
4412 }
4413 else
4416 /* We are manipulating pointer values, so we don't need to warn
4417 about relying on undefined signed overflow. We disable the
4418 warning here because we use integer types so fold won't know that
4419 they are really pointers. */
4422 /* If what we are about to multiply by the size of the elements
4423 contains a constant term, apply distributive law
4424 and multiply that constant term separately.
4425 This helps produce common subexpressions. */
4430 /* If the constant comes from pointer subtraction,
4431 skip this optimization--it would cause an error. */
4433 /* If the constant is unsigned, and smaller than the pointer size,
4434 then we must skip this optimization. This is because it could cause
4435 an overflow error if the constant is negative but INTOP is not. */
4439 {
4444 /* Convert both subexpression types to the type of intop,
4445 because weird cases involving pointer arithmetic
4446 can result in a sum or difference with different type args. */
4451 }
4453 /* Convert the integer argument to a type the same size as sizetype
4454 so the multiply won't overflow spuriously. */
4460 /* Replace the integer argument with a suitable product by the object size.
4461 Do this multiplication as signed, then convert to the appropriate type
4462 for the pointer operation and disregard an overflow that occurred only
4463 because of the sign-extension change in the latter conversion. */
4464 {
4472 }
4474 /* Create the sum or difference. */
4483 }
4484 \f
4485 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4486 and if NON_CONST is known not to be permitted in an evaluated part
4487 of a constant expression. */
4489 tree
4491 {
4495 /* This should never be called for C++. */
4499 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4508 }
4510 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4511 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4512 around the SAVE_EXPR if needed so that c_fully_fold does not need
4513 to look inside SAVE_EXPRs. */
4515 tree
4517 {
4526 }
4528 /* Return whether EXPR is a declaration whose address can never be
4529 NULL. */
4531 bool
4533 {
4538 }
4540 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4541 or for an `if' or `while' statement or ?..: exp. It should already
4542 have been validated to be of suitable type; otherwise, a bad
4543 diagnostic may result.
4545 The EXPR is located at LOCATION.
4547 This preparation consists of taking the ordinary
4548 representation of an expression expr and producing a valid tree
4549 boolean expression describing whether expr is nonzero. We could
4550 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4551 but we optimize comparisons, &&, ||, and !.
4553 The resulting type should always be `truthvalue_type_node'. */
4555 tree
4557 {
4559 {
4601 ? truthvalue_true_node
4607 ? truthvalue_true_node
4612 /* Fall through. */
4615 {
4618 {
4619 /* Common Ada/Pascal programmer's mistake. */
4621 OPT_Waddress,
4623 inner);
4625 }
4627 }
4644 /* These don't change whether an object is nonzero or zero. */
4649 /* These don't change whether an object is zero or nonzero, but
4650 we can't ignore them if their second arg has side-effects. */
4652 {
4655 c_common_truthvalue_conversion
4658 }
4659 else
4664 /* Distribute the conversion into the arms of a COND_EXPR. */
4666 {
4669 /* In C++ one of the arms might have void type if it is throw. */
4677 }
4678 else
4679 {
4680 /* Folding will happen later for C. */
4688 }
4690 CASE_CONVERT:
4691 {
4695 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4696 since that affects how `default_conversion' will behave. */
4700 /* Don't strip a conversion from C++0x scoped enum, since they
4701 don't implicitly convert to other types. */
4705 /* If this isn't narrowing the argument, we can ignore it. */
4709 }
4715 {
4719 }
4724 }
4727 {
4729 expr = (build_binary_op
4733 c_common_truthvalue_conversion
4736 c_common_truthvalue_conversion
4741 }
4744 {
4749 }
4750 else
4753 ret:
4756 }
4757 \f
4766 /* Apply the TYPE_QUALS to the new DECL. */
4768 void
4770 {
4778 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4779 constructor can produce constant init, so rely on cp_finish_decl to
4780 clear TREE_READONLY if the variable has non-constant init. */
4783 {
4786 }
4788 {
4790 /* Allow 'restrict' on arrays of pointers.
4791 FIXME currently we just ignore it. */
4797 }
4799 {
4805 /* The declaration's type should have been previously defined
4806 as a UPC shared type. */
4808 }
4809 }
4811 /* Hash function for the problem of multiple type definitions in
4812 different files. This must hash all types that will compare
4813 equal via comptypes to the same value. In practice it hashes
4814 on some of the simple stuff and leaves the details to comptypes. */
4816 static hashval_t
4818 {
4822 tree t2;
4824 {
4825 /* For pointers, hash on pointee type plus some swizzling. */
4828 /* Hash on number of elements and total size. */
4847 }
4848 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4849 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4851 /* We might have a VLA here. */
4854 else
4857 }
4861 /* Return the typed-based alias set for T, which may be an expression
4862 or a type. Return -1 if we don't do anything special. */
4864 alias_set_type
4866 {
4867 tree u;
4870 /* For VLAs, use the alias set of the element type rather than the
4871 default of alias set 0 for types compared structurally. */
4873 {
4877 }
4879 /* Permit type-punning when accessing a union, provided the access
4880 is directly through the union. For example, this code does not
4881 permit taking the address of a union member and then storing
4882 through it. Even the type-punning allowed here is a GCC
4883 extension, albeit a common and useful one; the C standard says
4884 that such accesses have implementation-defined behavior. */
4892 /* That's all the expressions we handle specially. */
4896 /* The C standard guarantees that any object may be accessed via an
4897 lvalue that has character type. */
4903 /* The C standard specifically allows aliasing between signed and
4904 unsigned variants of the same type. We treat the signed
4905 variant as canonical. */
4907 {
4910 /* t1 == t can happen for boolean nodes which are always unsigned. */
4913 }
4915 /* For the time being, make UPC pointers-to-shared conflict
4916 with everything else. Ideally, UPC pointers-to-shared should
4917 only conflict with the internal type used to represent
4918 the UPC pointer-to-shared (i.e., upc_pts_rep_type_node). */
4927 /* Handle the case of multiple type nodes referring to "the same" type,
4928 which occurs with IMA. These share an alias set. FIXME: Currently only
4929 C90 is handled. (In C99 type compatibility is not transitive, which
4930 complicates things mightily. The alias set splay trees can theoretically
4931 represent this, but insertion is tricky when you consider all the
4932 different orders things might arrive in.) */
4937 /* Save time if there's only one input file. */
4941 /* Pointers need special handling if they point to any type that
4942 needs special handling (below). */
4944 {
4945 tree t2;
4946 /* Find bottom type under any nested POINTERs. */
4950 ;
4958 }
4959 /* These are the only cases that need special handling. */
4966 /* Undefined? */
4970 /* Look up t in hash table. Only one of the compatible types within each
4971 alias set is recorded in the table. */
4975 NULL);
4978 {
4981 }
4982 else
4983 /* Our caller will assign and record (in t) a new alias set; all we need
4984 to do is remember t in the hash table. */
4988 }
4989 \f
4990 /* Return the value of THREADS.
4992 UPC defines a reserved variable, THREADS, which returns the
4993 number of threads that will be created when the UPC program
4994 executes. The value of threads can be specified at runtime via
4995 the -fupc-threads=N switch, where N is an integer specifying
4996 the number of threads. When the value of THREADS is specified
4997 at compile-time, this is called the "static threads compilation
4998 environment".
5000 In the static threads compilation environment, THREADS is a
5001 pre-defined preprocessor macro with the value, N.
5003 If no value for threads is given at compile-time, then the value
5004 must be specified when the application program is executed.
5005 This method of establishing the value of THREADS is called
5006 the "dynamic threads compilation environment". */
5008 tree
5010 {
5011 tree n;
5016 {
5018 "when compiling pre-processed source, "
5019 "all -fupc-* switches must be passed on the command line, "
5020 "asserting the same values as supplied when the "
5023 }
5026 }
5027 \f
5028 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
5029 the IS_SIZEOF parameter indicates which operator is being applied.
5030 The COMPLAIN flag controls whether we should diagnose possibly
5031 ill-formed constructs or not. LOC is the location of the SIZEOF or
5032 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
5033 a type in any context should be returned, rather than the normal
5034 alignment for that type. */
5036 tree
5040 {
5048 {
5050 {
5057 }
5058 else
5059 {
5061 {
5065 else
5068 }
5070 }
5071 }
5073 {
5075 {
5082 }
5083 else
5086 }
5089 {
5094 }
5097 {
5102 }
5103 else
5104 {
5106 /* Convert in case a char is more than one unit. */
5111 {
5114 #ifdef BIGGEST_FIELD_ALIGNMENT
5116 #endif
5118 #ifdef ADJUST_FIELD_ALIGN
5120 type);
5122 #endif
5125 }
5126 else
5128 }
5133 {
5136 }
5138 /* VALUE will have the middle-end integer type sizetype.
5139 However, we should really return a value of type `size_t',
5140 which is just a typedef for an ordinary integer type. */
5144 }
5146 /* Implement the __alignof keyword: Return the minimum required
5147 alignment of EXPR, measured in bytes. For VAR_DECLs,
5148 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5149 from an "aligned" __attribute__ specification). LOC is the
5150 location of the ALIGNOF operator. */
5152 tree
5154 {
5155 tree t;
5162 {
5165 }
5171 {
5178 {
5185 }
5187 }
5188 else
5192 }
5193 \f
5194 /* Handle C and C++ default attributes. */
5196 enum built_in_attribute
5197 {
5198 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5199 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5200 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5201 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5202 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5204 #undef DEF_ATTR_NULL_TREE
5205 #undef DEF_ATTR_INT
5206 #undef DEF_ATTR_STRING
5207 #undef DEF_ATTR_IDENT
5208 #undef DEF_ATTR_TREE_LIST
5209 ATTR_LAST
5210 };
5216 enum c_builtin_type
5217 {
5218 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5219 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5220 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5221 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5222 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5223 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5224 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5225 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5226 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5227 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5228 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5229 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5230 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5231 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5232 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5233 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5234 NAME,
5235 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5237 #undef DEF_PRIMITIVE_TYPE
5238 #undef DEF_FUNCTION_TYPE_0
5239 #undef DEF_FUNCTION_TYPE_1
5240 #undef DEF_FUNCTION_TYPE_2
5241 #undef DEF_FUNCTION_TYPE_3
5242 #undef DEF_FUNCTION_TYPE_4
5243 #undef DEF_FUNCTION_TYPE_5
5244 #undef DEF_FUNCTION_TYPE_6
5245 #undef DEF_FUNCTION_TYPE_7
5246 #undef DEF_FUNCTION_TYPE_8
5247 #undef DEF_FUNCTION_TYPE_VAR_0
5248 #undef DEF_FUNCTION_TYPE_VAR_1
5249 #undef DEF_FUNCTION_TYPE_VAR_2
5250 #undef DEF_FUNCTION_TYPE_VAR_3
5251 #undef DEF_FUNCTION_TYPE_VAR_4
5252 #undef DEF_FUNCTION_TYPE_VAR_5
5253 #undef DEF_POINTER_TYPE
5254 BT_LAST
5255 };
5259 /* A temporary array for c_common_nodes_and_builtins. Used in
5260 communication with def_fn_type. */
5263 /* A helper function for c_common_nodes_and_builtins. Build function type
5264 for DEF with return type RET and N arguments. If VAR is true, then the
5265 function should be variadic after those N arguments.
5267 Takes special care not to ICE if any of the types involved are
5268 error_mark_node, which indicates that said type is not in fact available
5269 (see builtin_type_for_size). In which case the function type as a whole
5270 should be error_mark_node. */
5272 static void
5274 {
5275 tree t;
5282 {
5288 }
5295 else
5298 egress:
5301 }
5303 /* Build builtin functions common to both C and C++ language
5304 frontends. */
5306 static void
5308 {
5309 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5310 builtin_types[ENUM] = VALUE;
5311 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5312 def_fn_type (ENUM, RETURN, 0, 0);
5313 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5314 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5315 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5316 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5317 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5318 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5319 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5320 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5321 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5322 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5323 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5324 ARG6) \
5325 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5326 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5327 ARG6, ARG7) \
5328 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5329 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5330 ARG6, ARG7, ARG8) \
5331 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5332 ARG7, ARG8);
5333 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5334 def_fn_type (ENUM, RETURN, 1, 0);
5335 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5336 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5337 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5338 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5339 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5340 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5341 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5342 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5343 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5344 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5345 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5346 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5350 #undef DEF_PRIMITIVE_TYPE
5351 #undef DEF_FUNCTION_TYPE_1
5352 #undef DEF_FUNCTION_TYPE_2
5353 #undef DEF_FUNCTION_TYPE_3
5354 #undef DEF_FUNCTION_TYPE_4
5355 #undef DEF_FUNCTION_TYPE_5
5356 #undef DEF_FUNCTION_TYPE_6
5357 #undef DEF_FUNCTION_TYPE_VAR_0
5358 #undef DEF_FUNCTION_TYPE_VAR_1
5359 #undef DEF_FUNCTION_TYPE_VAR_2
5360 #undef DEF_FUNCTION_TYPE_VAR_3
5361 #undef DEF_FUNCTION_TYPE_VAR_4
5362 #undef DEF_FUNCTION_TYPE_VAR_5
5363 #undef DEF_POINTER_TYPE
5368 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5369 NONANSI_P, ATTRS, IMPLICIT, COND) \
5370 if (NAME && COND) \
5371 def_builtin_1 (ENUM, NAME, CLASS, \
5372 builtin_types[(int) TYPE], \
5373 builtin_types[(int) LIBTYPE], \
5374 BOTH_P, FALLBACK_P, NONANSI_P, \
5375 built_in_attributes[(int) ATTRS], IMPLICIT);
5377 #undef DEF_BUILTIN
5385 }
5387 /* Like get_identifier, but avoid warnings about null arguments when
5388 the argument may be NULL for targets where GCC lacks stdint.h type
5389 information. */
5393 {
5395 }
5397 /* Build tree nodes and builtin functions common to both C and C++ language
5398 frontends. */
5400 void
5402 {
5406 tree array_domain_type;
5407 tree va_list_ref_type_node;
5408 tree va_list_arg_type_node;
5412 /* Define `int' and `char' first so that dbx will output them first. */
5416 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5417 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5418 but not C. Are the conditionals here needed? */
5424 long_unsigned_type_node);
5426 {
5428 int128_integer_type_node);
5430 int128_unsigned_type_node);
5431 }
5435 long_long_integer_type_node);
5437 long_long_unsigned_type_node);
5440 long_long_unsigned_type_node);
5443 short_unsigned_type_node);
5446 short_unsigned_type_node);
5448 /* Define both `signed char' and `unsigned char'. */
5452 /* These are types that c_common_type_for_size and
5453 c_common_type_for_mode use. */
5456 intQI_type_node));
5459 intHI_type_node));
5462 intSI_type_node));
5465 intDI_type_node));
5466 #if HOST_BITS_PER_WIDE_INT >= 64
5469 TYPE_DECL,
5471 intTI_type_node));
5472 #endif
5475 unsigned_intQI_type_node));
5478 unsigned_intHI_type_node));
5481 unsigned_intSI_type_node));
5484 unsigned_intDI_type_node));
5485 #if HOST_BITS_PER_WIDE_INT >= 64
5488 TYPE_DECL,
5490 unsigned_intTI_type_node));
5491 #endif
5493 /* Create the widest literal types. */
5494 widest_integer_literal_type_node
5498 widest_integer_literal_type_node));
5500 widest_unsigned_literal_type_node
5504 widest_unsigned_literal_type_node));
5508 pid_type_node =
5515 /* Only supported decimal floating point extension if the target
5516 actually supports underlying modes. */
5520 {
5524 }
5527 {
5532 long_long_fract_type_node);
5534 unsigned_short_fract_type_node);
5536 unsigned_fract_type_node);
5538 unsigned_long_fract_type_node);
5540 unsigned_long_long_fract_type_node);
5542 sat_short_fract_type_node);
5545 sat_long_fract_type_node);
5547 sat_long_long_fract_type_node);
5549 sat_unsigned_short_fract_type_node);
5551 sat_unsigned_fract_type_node);
5553 sat_unsigned_long_fract_type_node);
5555 sat_unsigned_long_long_fract_type_node);
5560 long_long_accum_type_node);
5562 unsigned_short_accum_type_node);
5564 unsigned_accum_type_node);
5566 unsigned_long_accum_type_node);
5568 unsigned_long_long_accum_type_node);
5570 sat_short_accum_type_node);
5573 sat_long_accum_type_node);
5575 sat_long_long_accum_type_node);
5577 sat_unsigned_short_accum_type_node);
5579 sat_unsigned_accum_type_node);
5581 sat_unsigned_long_accum_type_node);
5583 sat_unsigned_long_long_accum_type_node);
5585 }
5588 TYPE_DECL,
5590 complex_integer_type_node));
5592 TYPE_DECL,
5594 complex_float_type_node));
5596 TYPE_DECL,
5598 complex_double_type_node));
5602 complex_long_double_type_node));
5605 /* For C++, make fileptr_type_node a distinct void * type until
5606 FILE type is defined. */
5611 /* Set the TYPE_NAME for any variants that were built before
5612 record_builtin_type gave names to the built-in types. */
5613 {
5619 }
5621 /* This node must not be shared. */
5627 /* Make a type to be the domain of a few array types
5628 whose domains don't really matter.
5629 200 is small enough that it always fits in size_t
5630 and large enough that it can hold most function names for the
5631 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5634 /* Make a type for arrays of characters.
5635 With luck nothing will ever really depend on the length of this
5636 array type. */
5637 char_array_type_node
5641 const_string_type_node
5645 /* This is special for C++ so functions can be overloaded. */
5651 {
5654 else
5657 }
5659 /* This is for wide string constants. */
5660 wchar_array_type_node
5663 /* Define 'char16_t'. */
5668 {
5673 }
5675 /* This is for UTF-16 string constants. */
5676 char16_array_type_node
5679 /* Define 'char32_t'. */
5684 {
5689 }
5691 /* This is for UTF-32 string constants. */
5692 char32_array_type_node
5695 wint_type_node =
5698 intmax_type_node =
5700 uintmax_type_node =
5704 sig_atomic_type_node =
5707 int8_type_node =
5710 int16_type_node =
5713 int32_type_node =
5716 int64_type_node =
5719 uint8_type_node =
5731 int_least8_type_node =
5734 int_least16_type_node =
5737 int_least32_type_node =
5740 int_least64_type_node =
5743 uint_least8_type_node =
5746 uint_least16_type_node =
5749 uint_least32_type_node =
5752 uint_least64_type_node =
5755 int_fast8_type_node =
5758 int_fast16_type_node =
5761 int_fast32_type_node =
5764 int_fast64_type_node =
5767 uint_fast8_type_node =
5770 uint_fast16_type_node =
5773 uint_fast32_type_node =
5776 uint_fast64_type_node =
5779 intptr_type_node =
5782 uintptr_type_node =
5785 default_function_type
5787 ptrdiff_type_node
5794 va_list_type_node));
5796 {
5799 tree ptype;
5802 {
5806 ptype));
5808 }
5809 }
5812 {
5815 }
5816 else
5817 {
5820 }
5827 /* Create the built-in __null node. It is important that this is
5828 not shared. */
5832 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5834 }
5836 /* The number of named compound-literals generated thus far. */
5839 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5841 void
5843 {
5846 compound_literal_number);
5847 compound_literal_number++;
5849 }
5851 tree
5853 {
5857 }
5860 /* Linked list of disabled built-in functions. */
5863 {
5871 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5872 begins with "__builtin_", give an error. */
5874 void
5876 {
5879 else
5880 {
5885 }
5886 }
5889 /* Return true if the built-in function NAME has been disabled, false
5890 otherwise. */
5892 static bool
5894 {
5897 {
5900 }
5902 }
5905 /* Worker for DEF_BUILTIN.
5906 Possibly define a builtin function with one or two names.
5907 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5908 nonansi_p and flag_no_nonansi_builtin. */
5910 static void
5917 {
5918 tree decl;
5931 fnattrs);
5940 }
5941 \f
5942 /* Nonzero if the type T promotes to int. This is (nearly) the
5943 integral promotions defined in ISO C99 6.3.1.1/2. */
5945 bool
5947 {
5949 {
5959 /* ??? Technically all enumerations not larger than an int
5960 promote to an int. But this is used along code paths
5961 that only want to notice a size change. */
5969 }
5970 }
5972 /* Return 1 if PARMS specifies a fixed number of parameters
5973 and none of their types is affected by default promotions. */
5975 int
5977 {
5978 const_tree t;
5980 {
5997 }
5999 }
6001 /* Recursively remove any '*' or '&' operator from TYPE. */
6002 tree
6004 {
6008 }
6010 /* Recursively remove pointer or array type from TYPE. */
6011 tree
6013 {
6017 }
6019 /* Used to compare case labels. K1 and K2 are actually tree nodes
6020 representing case labels, or NULL_TREE for a `default' label.
6021 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6022 K2, and 0 if K1 and K2 are equal. */
6024 int
6026 {
6027 /* Consider a NULL key (such as arises with a `default' label) to be
6028 smaller than anything else. */
6035 }
6037 /* Process a case label, located at LOC, for the range LOW_VALUE
6038 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6039 then this case label is actually a `default' label. If only
6040 HIGH_VALUE is NULL_TREE, then case label was declared using the
6041 usual C/C++ syntax, rather than the GNU case range extension.
6042 CASES is a tree containing all the case ranges processed so far;
6043 COND is the condition for the switch-statement itself. Returns the
6044 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
6045 is created. */
6047 tree
6050 {
6051 tree type;
6052 tree label;
6053 tree case_label;
6054 splay_tree_node node;
6056 /* Create the LABEL_DECL itself. */
6059 /* If there was an error processing the switch condition, bail now
6060 before we get more confused. */
6068 {
6071 }
6073 /* Case ranges are a GNU extension. */
6080 {
6085 }
6087 {
6092 }
6095 {
6096 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6097 really a case range, even though it was written that way.
6098 Remove the HIGH_VALUE to simplify later processing. */
6103 }
6105 /* See if the case is in range of the type of the original testing
6106 expression. If both low_value and high_value are out of range,
6107 don't insert the case label and return NULL_TREE. */
6113 /* Look up the LOW_VALUE in the table of case labels we already
6114 have. */
6116 /* If there was not an exact match, check for overlapping ranges.
6117 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6118 that's a `default' label and the only overlap is an exact match. */
6120 {
6121 splay_tree_node low_bound;
6122 splay_tree_node high_bound;
6124 /* Even though there wasn't an exact match, there might be an
6125 overlap between this case range and another case range.
6126 Since we've (inductively) not allowed any overlapping case
6127 ranges, we simply need to find the greatest low case label
6128 that is smaller that LOW_VALUE, and the smallest low case
6129 label that is greater than LOW_VALUE. If there is an overlap
6130 it will occur in one of these two ranges. */
6136 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6137 the LOW_VALUE, so there is no need to check unless the
6138 LOW_BOUND is in fact itself a case range. */
6144 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6145 range is bigger than the low end of the current range, so we
6146 are only interested if the current range is a real range, and
6147 not an ordinary case label. */
6149 && high_value
6151 high_value)
6154 }
6155 /* If there was an overlap, issue an error. */
6157 {
6161 {
6165 }
6167 {
6170 }
6171 else
6172 {
6176 }
6178 }
6180 /* Add a CASE_LABEL to the statement-tree. */
6182 /* Register this case label in the splay tree. */
6189 error_out:
6190 /* Add a label so that the back-end doesn't think that the beginning of
6191 the switch is unreachable. Note that we do not add a case label, as
6192 that just leads to duplicates and thence to failure later on. */
6194 {
6197 }
6199 }
6201 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6202 Used to verify that case values match up with enumerator values. */
6204 static void
6206 {
6209 /* ??? Not working too hard to print the double-word value.
6210 Should perhaps be done with %lwd in the diagnostic routines? */
6219 else
6228 buf);
6229 else
6234 }
6236 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6237 Used to verify that case values match up with enumerator values. */
6239 static int
6241 {
6245 /* Skip default case. */
6249 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6250 when we did our enum->case scan. Reset our scratch bit after. */
6253 else
6256 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6257 not set, that means that CASE_HIGH did not appear when we did our
6258 enum->case scan. Reset our scratch bit after. */
6260 {
6263 else
6265 }
6268 }
6270 /* Handle -Wswitch*. Called from the front end after parsing the
6271 switch construct. */
6272 /* ??? Should probably be somewhere generic, since other languages
6273 besides C and C++ would want this. At the moment, however, C/C++
6274 are the only tree-ssa languages that support enumerations at all,
6275 so the point is moot. */
6277 void
6280 {
6281 splay_tree_node default_node;
6282 splay_tree_node node;
6283 tree chain;
6293 /* From here on, we only care about about enumerated types. */
6297 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6301 /* Check the cases. Warn about case values which are not members of
6302 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6303 there is no default case, check that exactly all enumeration
6304 literals are covered by the cases. */
6306 /* Clearing COND if it is not an integer constant simplifies
6307 the tests inside the loop below. */
6311 /* The time complexity here is O(N*lg(N)) worst case, but for the
6312 common case of monotonically increasing enumerators, it is
6313 O(N), since the nature of the splay tree will keep the next
6314 element adjacent to the root at all times. */
6317 {
6323 {
6324 /* Mark the CASE_LOW part of the case entry as seen. */
6328 }
6330 /* Even though there wasn't an exact match, there might be a
6331 case range which includes the enumerator's value. */
6334 {
6338 {
6339 /* If we match the upper bound exactly, mark the CASE_HIGH
6340 part of the case entry as seen. */
6344 }
6345 }
6347 /* We've now determined that this enumerated literal isn't
6348 handled by the case labels of the switch statement. */
6350 /* If the switch expression is a constant, we only really care
6351 about whether that constant is handled by the switch. */
6355 /* If there is a default_node, the only relevant option is
6356 Wswitch-enum. Otherwise, if both are enabled then we prefer
6357 to warn using -Wswitch because -Wswitch is enabled by -Wall
6358 while -Wswitch-enum is explicit. */
6361 ? OPT_Wswitch_enum
6365 }
6367 /* Warn if there are case expressions that don't correspond to
6368 enumerators. This can occur since C and C++ don't enforce
6369 type-checking of assignments to enumeration variables.
6371 The time complexity here is now always O(N) worst case, since
6372 we should have marked both the lower bound and upper bound of
6373 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6374 above. This scan also resets those fields. */
6377 }
6379 /* Finish an expression taking the address of LABEL (an
6380 IDENTIFIER_NODE). Returns an expression for the address.
6382 LOC is the location for the expression returned. */
6384 tree
6386 {
6387 tree result;
6397 else
6398 {
6401 /* The current function is not necessarily uninlinable.
6402 Computed gotos are incompatible with inlining, but the value
6403 here could be used only in a diagnostic, for example. */
6405 }
6408 }
6409 \f
6411 /* Given a boolean expression ARG, return a tree representing an increment
6412 or decrement (as indicated by CODE) of ARG. The front end must check for
6413 invalid cases (e.g., decrement in C++). */
6414 tree
6416 {
6417 tree val;
6422 {
6445 }
6448 }
6449 \f
6450 /* Built-in macros for stddef.h and stdint.h, that require macros
6451 defined in this file. */
6452 void
6454 {
6517 }
6519 static void
6521 {
6522 /* Fill in the built_in_attributes array. */
6523 #define DEF_ATTR_NULL_TREE(ENUM) \
6524 built_in_attributes[(int) ENUM] = NULL_TREE;
6525 #define DEF_ATTR_INT(ENUM, VALUE) \
6526 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6527 #define DEF_ATTR_STRING(ENUM, VALUE) \
6528 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6529 #define DEF_ATTR_IDENT(ENUM, STRING) \
6530 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6531 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6532 built_in_attributes[(int) ENUM] \
6533 = tree_cons (built_in_attributes[(int) PURPOSE], \
6534 built_in_attributes[(int) VALUE], \
6535 built_in_attributes[(int) CHAIN]);
6537 #undef DEF_ATTR_NULL_TREE
6538 #undef DEF_ATTR_INT
6539 #undef DEF_ATTR_IDENT
6540 #undef DEF_ATTR_TREE_LIST
6541 }
6543 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6544 identifier as an argument, so the front end shouldn't look it up. */
6546 bool
6548 {
6551 /* Unknown attribute that we'll end up ignoring, return true so we
6552 don't complain about an identifier argument. */
6558 else
6560 }
6562 /* Attribute handlers common to C front ends. */
6564 /* Handle a "packed" attribute; arguments as in
6565 struct attribute_spec.handler. */
6567 static tree
6570 {
6572 {
6576 }
6578 {
6580 /* Still pack bitfields. */
6585 else
6587 }
6588 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6589 used for DECL_REGISTER. It wouldn't mean anything anyway.
6590 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6591 that changes what the typedef is typing. */
6592 else
6593 {
6596 }
6599 }
6601 /* Handle a "nocommon" attribute; arguments as in
6602 struct attribute_spec.handler. */
6604 static tree
6608 {
6611 else
6612 {
6615 }
6618 }
6620 /* Handle a "common" attribute; arguments as in
6621 struct attribute_spec.handler. */
6623 static tree
6626 {
6629 else
6630 {
6633 }
6636 }
6638 /* Handle a "noreturn" attribute; arguments as in
6639 struct attribute_spec.handler. */
6641 static tree
6644 {
6647 /* See FIXME comment in c_common_attribute_table. */
6654 = build_pointer_type
6657 else
6658 {
6661 }
6664 }
6666 /* Handle a "hot" and attribute; arguments as in
6667 struct attribute_spec.handler. */
6669 static tree
6672 {
6675 {
6677 {
6681 }
6682 /* Most of the rest of the hot processing is done later with
6683 lookup_attribute. */
6684 }
6685 else
6686 {
6689 }
6692 }
6694 /* Handle a "cold" and attribute; arguments as in
6695 struct attribute_spec.handler. */
6697 static tree
6700 {
6703 {
6705 {
6709 }
6710 /* Most of the rest of the cold processing is done later with
6711 lookup_attribute. */
6712 }
6713 else
6714 {
6717 }
6720 }
6722 /* Handle a "no_sanitize_address" attribute; arguments as in
6723 struct attribute_spec.handler. */
6725 static tree
6728 {
6730 {
6733 }
6736 }
6738 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6744 {
6753 }
6755 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6756 struct attribute_spec.handler. */
6758 static tree
6761 {
6763 {
6766 }
6769 }
6771 /* Handle a "noinline" attribute; arguments as in
6772 struct attribute_spec.handler. */
6774 static tree
6778 {
6781 else
6782 {
6785 }
6788 }
6790 /* Handle a "noclone" attribute; arguments as in
6791 struct attribute_spec.handler. */
6793 static tree
6797 {
6799 {
6802 }
6805 }
6807 /* Handle a "always_inline" attribute; arguments as in
6808 struct attribute_spec.handler. */
6810 static tree
6815 {
6817 {
6818 /* Set the attribute and mark it for disregarding inline
6819 limits. */
6821 }
6822 else
6823 {
6826 }
6829 }
6831 /* Handle a "gnu_inline" attribute; arguments as in
6832 struct attribute_spec.handler. */
6834 static tree
6839 {
6841 {
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 "leaf" attribute; arguments as in
6855 struct attribute_spec.handler. */
6857 static tree
6861 {
6863 {
6866 }
6868 {
6871 }
6874 }
6876 /* Handle an "artificial" attribute; arguments as in
6877 struct attribute_spec.handler. */
6879 static tree
6884 {
6886 {
6887 /* Do nothing else, just set the attribute. We'll get at
6888 it later with lookup_attribute. */
6889 }
6890 else
6891 {
6894 }
6897 }
6899 /* Handle a "flatten" attribute; arguments as in
6900 struct attribute_spec.handler. */
6902 static tree
6904 tree args ATTRIBUTE_UNUSED,
6906 {
6908 /* Do nothing else, just set the attribute. We'll get at
6909 it later with lookup_attribute. */
6910 ;
6911 else
6912 {
6915 }
6918 }
6920 /* Handle a "warning" or "error" attribute; arguments as in
6921 struct attribute_spec.handler. */
6923 static tree
6926 {
6929 /* Do nothing else, just set the attribute. We'll get at
6930 it later with lookup_attribute. */
6931 ;
6932 else
6933 {
6936 }
6939 }
6941 /* Handle a "used" attribute; arguments as in
6942 struct attribute_spec.handler. */
6944 static tree
6947 {
6953 {
6958 }
6959 else
6960 {
6963 }
6966 }
6968 /* Handle a "unused" attribute; arguments as in
6969 struct attribute_spec.handler. */
6971 static tree
6974 {
6976 {
6984 {
6989 }
6990 else
6991 {
6994 }
6995 }
6996 else
6997 {
7001 }
7004 }
7006 /* Handle a "externally_visible" attribute; arguments as in
7007 struct attribute_spec.handler. */
7009 static tree
7014 {
7018 {
7021 {
7025 }
7026 }
7027 else
7028 {
7031 }
7034 }
7036 /* Handle a "const" attribute; arguments as in
7037 struct attribute_spec.handler. */
7039 static tree
7042 {
7045 /* See FIXME comment on noreturn in c_common_attribute_table. */
7051 = build_pointer_type
7054 else
7055 {
7058 }
7061 }
7063 /* Handle a "transparent_union" attribute; arguments as in
7064 struct attribute_spec.handler. */
7066 static tree
7070 {
7071 tree type;
7082 {
7083 /* Make sure that the first field will work for a transparent union.
7084 If the type isn't complete yet, leave the check to the code in
7085 finish_struct. */
7087 {
7093 }
7096 {
7097 /* If the type isn't complete yet, setting the flag
7098 on a variant wouldn't ever be checked. */
7102 /* build_duplicate_type doesn't work for C++. */
7106 /* A type variant isn't good enough, since we don't a cast
7107 to such a type removed as a no-op. */
7109 }
7113 }
7115 ignored:
7118 }
7120 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7121 get the requested priority for a constructor or destructor,
7122 possibly issuing diagnostics for invalid or reserved
7123 priorities. */
7125 static priority_type
7127 {
7128 HOST_WIDE_INT pri;
7129 tree arg;
7135 {
7138 else
7141 }
7158 {
7161 "destructor priorities from 0 to %d are reserved "
7163 MAX_RESERVED_INIT_PRIORITY);
7164 else
7166 "constructor priorities from 0 to %d are reserved "
7168 MAX_RESERVED_INIT_PRIORITY);
7169 }
7172 invalid:
7175 MAX_INIT_PRIORITY);
7176 else
7178 MAX_INIT_PRIORITY);
7180 }
7182 /* Handle a "constructor" attribute; arguments as in
7183 struct attribute_spec.handler. */
7185 static tree
7189 {
7196 {
7197 priority_type priority;
7202 }
7203 else
7204 {
7207 }
7210 }
7212 /* Handle a "destructor" attribute; arguments as in
7213 struct attribute_spec.handler. */
7215 static tree
7219 {
7226 {
7227 priority_type priority;
7232 }
7233 else
7234 {
7237 }
7240 }
7242 /* Nonzero if the mode is a valid vector mode for this architecture.
7243 This returns nonzero even if there is no hardware support for the
7244 vector mode, but we can emulate with narrower modes. */
7246 static int
7248 {
7252 /* Doh! What's going on? */
7261 /* Hardware support. Woo hoo! */
7267 /* We should probably return 1 if requesting V4DI and we have no DI,
7268 but we have V2DI, but this is probably very unlikely. */
7270 /* If we have support for the inner mode, we can safely emulate it.
7271 We may not have V2DI, but me can emulate with a pair of DIs. */
7273 }
7276 /* Handle a "mode" attribute; arguments as in
7277 struct attribute_spec.handler. */
7279 static tree
7282 {
7290 else
7291 {
7296 tree typefm;
7301 {
7307 }
7309 /* Change this type to have a type with the specified mode.
7310 First check for the special modes. */
7323 else
7326 {
7329 }
7332 {
7335 }
7339 {
7371 }
7373 {
7376 }
7379 {
7384 {
7387 }
7391 else
7394 }
7395 else
7396 {
7397 /* For fixed-point modes, we need to test if the signness of type
7398 and the machine mode are consistent. */
7401 {
7404 }
7405 /* For fixed-point modes, we need to pass saturating info. */
7409 }
7412 {
7415 }
7417 {
7418 /* For enumeral types, copy the precision from the integer
7419 type returned above. If not an INTEGER_TYPE, we can't use
7420 this mode for this type. */
7422 {
7425 }
7428 {
7431 }
7432 else
7433 {
7434 /* We cannot build a type variant, as there's code that assumes
7435 that TYPE_MAIN_VARIANT has the same mode. This includes the
7436 debug generators. Instead, create a subrange type. This
7437 results in all of the enumeral values being emitted only once
7438 in the original, and the subtype gets them by reference. */
7441 else
7444 }
7445 }
7449 {
7452 }
7455 }
7458 }
7460 /* Handle a "section" attribute; arguments as in
7461 struct attribute_spec.handler. */
7463 static tree
7466 {
7470 {
7476 {
7480 {
7482 "section attribute cannot be specified for "
7485 }
7487 /* The decl may have already been given a section attribute
7488 from a previous declaration. Ensure they match. */
7492 {
7496 }
7500 {
7503 }
7504 else
7506 }
7507 else
7508 {
7511 }
7512 }
7513 else
7514 {
7518 }
7521 }
7523 /* Check whether ALIGN is a valid user-specified alignment. If so,
7524 return its base-2 log; if not, output an error and return -1. If
7525 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7526 no error. */
7527 int
7529 {
7534 {
7537 }
7542 {
7545 }
7547 {
7550 }
7552 }
7554 /*
7555 If in c++-11, check if the c++-11 alignment constraint with respect
7556 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7557 c++-11 mode, does nothing.
7559 [dcl.align]2/ says:
7561 [* if the constant expression evaluates to a fundamental alignment,
7562 the alignment requirement of the declared entity shall be the
7563 specified fundamental alignment.
7565 * if the constant expression evaluates to an extended alignment
7566 and the implementation supports that alignment in the context
7567 of the declaration, the alignment of the declared entity shall
7568 be that alignment
7570 * if the constant expression evaluates to an extended alignment
7571 and the implementation does not support that alignment in the
7572 context of the declaration, the program is ill-formed]. */
7574 static bool
7578 {
7591 {
7593 {
7594 /* For file scope variables and static members, the target
7595 supports alignments that are at most
7596 MAX_OFILE_ALIGNMENT. */
7599 }
7600 else
7601 {
7602 #ifdef BIGGEST_FIELD_ALIGNMENT
7603 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7604 #else
7605 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7606 #endif
7607 /* For non-static members, the target supports either
7608 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7609 if it is defined or BIGGEST_ALIGNMENT. */
7614 #undef MAX_TARGET_FIELD_ALIGNMENT
7615 /* For stack variables, the target supports at most
7616 MAX_STACK_ALIGNMENT. */
7620 }
7621 }
7623 {
7624 /* Let's be liberal for types. */
7627 }
7635 }
7637 /* Handle a "aligned" attribute; arguments as in
7638 struct attribute_spec.handler. */
7640 static tree
7643 {
7647 tree align_expr;
7651 {
7655 }
7656 else
7660 {
7664 }
7672 {
7675 /* If we have a TYPE_DECL, then copy the type, so that we
7676 don't accidentally modify a builtin type. See pushdecl. */
7679 {
7686 }
7687 else
7692 }
7695 {
7698 }
7701 /* C++-11 [dcl.align/4]:
7703 When multiple alignment-specifiers are specified for an
7704 entity, the alignment requirement shall be set to the
7705 strictest specified alignment.
7707 This formally comes from the c++11 specification but we are
7708 doing it for the GNU attribute syntax as well. */
7712 {
7717 else
7721 }
7722 else
7723 {
7726 }
7729 }
7731 /* Handle a "weak" attribute; arguments as in
7732 struct attribute_spec.handler. */
7734 static tree
7739 {
7742 {
7745 }
7747 {
7751 }
7755 else
7759 }
7761 /* Handle an "alias" or "ifunc" attribute; arguments as in
7762 struct attribute_spec.handler, except that IS_ALIAS tells us
7763 whether this is an alias as opposed to ifunc attribute. */
7765 static tree
7768 {
7773 {
7776 }
7780 /* A static variable declaration is always a tentative definition,
7781 but the alias is a non-tentative definition which overrides. */
7784 {
7788 }
7792 {
7796 }
7798 /* Note that the very first time we process a nested declaration,
7799 decl_function_context will not be set. Indeed, *would* never
7800 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7801 we do below. After such frobbery, pushdecl would set the context.
7802 In any case, this is never what we want. */
7804 {
7805 tree id;
7809 {
7813 }
7815 /* This counts as a use of the object pointed to. */
7820 else
7824 /* ifuncs are also aliases, so set that attribute too. */
7827 }
7828 else
7829 {
7832 }
7835 }
7837 /* Handle an "alias" or "ifunc" attribute; arguments as in
7838 struct attribute_spec.handler. */
7840 static tree
7843 {
7845 }
7847 /* Handle an "alias" or "ifunc" attribute; arguments as in
7848 struct attribute_spec.handler. */
7850 static tree
7853 {
7855 }
7857 /* Handle a "weakref" attribute; arguments as in struct
7858 attribute_spec.handler. */
7860 static tree
7863 {
7866 /* We must ignore the attribute when it is associated with
7867 local-scoped decls, since attribute alias is ignored and many
7868 such symbols do not even have a DECL_WEAK field. */
7870 || current_function_decl
7872 {
7876 }
7879 {
7883 }
7885 /* The idea here is that `weakref("name")' mutates into `weakref,
7886 alias("name")', and weakref without arguments, in turn,
7887 implicitly adds weak. */
7890 {
7897 }
7898 else
7899 {
7904 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7905 and that isn't supported; and because it wants to add it to
7906 the list of weak decls, which isn't helpful. */
7908 }
7911 }
7913 /* Handle an "visibility" attribute; arguments as in
7914 struct attribute_spec.handler. */
7916 static tree
7920 {
7926 {
7930 {
7932 name);
7934 }
7936 {
7940 }
7941 }
7943 {
7946 }
7949 {
7952 }
7954 /* If this is a type, set the visibility on the type decl. */
7956 {
7961 {
7963 name);
7965 }
7966 }
7976 else
7977 {
7978 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7980 }
7984 {
7998 }
8003 /* Go ahead and attach the attribute to the node as well. This is needed
8004 so we can determine whether we have VISIBILITY_DEFAULT because the
8005 visibility was not specified, or because it was explicitly overridden
8006 from the containing scope. */
8009 }
8011 /* Determine the ELF symbol visibility for DECL, which is either a
8012 variable or a function. It is an error to use this function if a
8013 definition of DECL is not available in this translation unit.
8014 Returns true if the final visibility has been determined by this
8015 function; false if the caller is free to make additional
8016 modifications. */
8018 bool
8020 {
8024 /* If the user explicitly specified the visibility with an
8025 attribute, honor that. DECL_VISIBILITY will have been set during
8026 the processing of the attribute. We check for an explicit
8027 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8028 to distinguish the use of an attribute from the use of a "#pragma
8029 GCC visibility push(...)"; in the latter case we still want other
8030 considerations to be able to overrule the #pragma. */
8032 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8037 /* Set default visibility to whatever the user supplied with
8038 visibility_specified depending on #pragma GCC visibility. */
8040 {
8043 {
8046 /* If visibility changed and DECL already has DECL_RTL, ensure
8047 symbol flags are updated. */
8052 }
8053 }
8055 }
8057 /* Handle an "tls_model" attribute; arguments as in
8058 struct attribute_spec.handler. */
8060 static tree
8063 {
8064 tree id;
8071 {
8074 }
8079 {
8082 }
8092 else
8093 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8097 }
8099 /* Handle a "no_instrument_function" attribute; arguments as in
8100 struct attribute_spec.handler. */
8102 static tree
8107 {
8111 {
8115 }
8116 else
8120 }
8122 /* Handle a "malloc" attribute; arguments as in
8123 struct attribute_spec.handler. */
8125 static tree
8128 {
8132 else
8133 {
8136 }
8139 }
8141 /* Handle a "alloc_size" attribute; arguments as in
8142 struct attribute_spec.handler. */
8144 static tree
8147 {
8150 {
8157 || !arg_count
8159 {
8164 }
8165 }
8167 }
8169 /* Handle a "alloc_align" attribute; arguments as in
8170 struct attribute_spec.handler. */
8172 static tree
8175 {
8182 || !arg_count
8184 {
8189 }
8191 }
8193 /* Handle a "assume_aligned" attribute; arguments as in
8194 struct attribute_spec.handler. */
8196 static tree
8199 {
8201 {
8208 {
8213 }
8214 }
8216 }
8218 /* Handle a "fn spec" attribute; arguments as in
8219 struct attribute_spec.handler. */
8221 static tree
8225 {
8230 }
8232 /* Handle a "warn_unused" attribute; arguments as in
8233 struct attribute_spec.handler. */
8235 static tree
8237 tree args ATTRIBUTE_UNUSED,
8239 {
8241 /* Do nothing else, just set the attribute. We'll get at
8242 it later with lookup_attribute. */
8243 ;
8244 else
8245 {
8248 }
8251 }
8253 /* Handle an "omp declare simd" attribute; arguments as in
8254 struct attribute_spec.handler. */
8256 static tree
8258 {
8260 }
8262 /* Handle an "omp declare target" attribute; arguments as in
8263 struct attribute_spec.handler. */
8265 static tree
8267 {
8269 }
8271 /* Handle a "returns_twice" attribute; arguments as in
8272 struct attribute_spec.handler. */
8274 static tree
8277 {
8280 else
8281 {
8284 }
8287 }
8289 /* Handle a "no_limit_stack" attribute; arguments as in
8290 struct attribute_spec.handler. */
8292 static tree
8297 {
8301 {
8305 }
8307 {
8311 }
8312 else
8316 }
8318 /* Handle a "pure" attribute; arguments as in
8319 struct attribute_spec.handler. */
8321 static tree
8324 {
8327 /* ??? TODO: Support types. */
8328 else
8329 {
8332 }
8335 }
8337 /* Digest an attribute list destined for a transactional memory statement.
8338 ALLOWED is the set of attributes that are allowed for this statement;
8339 return the attribute we parsed. Multiple attributes are never allowed. */
8341 int
8343 {
8348 {
8356 {
8359 }
8362 {
8365 }
8368 else
8370 }
8373 }
8375 /* Transform a TM attribute name into a maskable integer and back.
8376 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8377 to how the lack of an attribute is treated. */
8379 int
8381 {
8395 }
8397 tree
8399 {
8402 {
8420 }
8422 }
8424 /* Return the first TM attribute seen in LIST. */
8426 tree
8428 {
8430 {
8434 }
8436 }
8438 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8439 Here we accept only function types, and verify that none of the other
8440 function TM attributes are also applied. */
8441 /* ??? We need to accept class types for C++, but not C. This greatly
8442 complicates this function, since we can no longer rely on the extra
8443 processing given by function_type_required. */
8445 static tree
8448 {
8449 /* Only one path adds the attribute; others don't. */
8453 {
8456 /* Only tm_callable and tm_safe apply to classes. */
8459 /* FALLTHRU */
8463 {
8466 ;
8469 else
8471 }
8475 {
8478 {
8483 }
8484 }
8485 /* FALLTHRU */
8488 /* If a function is next, pass it on to be tried next. */
8492 ignored:
8495 }
8498 }
8500 /* Handle the TM_WRAP attribute; arguments as in
8501 struct attribute_spec.handler. */
8503 static tree
8506 {
8509 /* We don't need the attribute even on success, since we
8510 record the entry in an external table. */
8515 else
8516 {
8522 else
8523 {
8527 {
8531 else
8533 }
8534 else
8536 }
8537 }
8540 }
8542 /* Ignore the given attribute. Used when this attribute may be usefully
8543 overridden by the target, but is not used generically. */
8545 static tree
8549 {
8552 }
8554 /* Handle a "no vops" attribute; arguments as in
8555 struct attribute_spec.handler. */
8557 static tree
8561 {
8565 }
8567 /* Handle a "deprecated" attribute; arguments as in
8568 struct attribute_spec.handler. */
8570 static tree
8574 {
8582 {
8585 }
8588 {
8599 else
8601 }
8603 {
8608 }
8609 else
8613 {
8616 {
8622 }
8625 else
8627 }
8630 }
8632 /* Handle a "vector_size" attribute; arguments as in
8633 struct attribute_spec.handler. */
8635 static tree
8639 {
8651 {
8654 }
8656 /* Get the vector size (in bytes). */
8659 /* We need to provide for vector pointers, vector arrays, and
8660 functions returning vectors. For example:
8662 __attribute__((vector_size(16))) short *foo;
8664 In this case, the mode is SI, but the type being modified is
8665 HI, so we need to look further. */
8674 /* Get the mode of the type being modified. */
8685 {
8688 }
8691 {
8694 }
8697 {
8700 }
8702 /* Calculate how many units fit in the vector. */
8705 {
8708 }
8712 /* Build back pointers if needed. */
8716 }
8718 /* Handle the "nonnull" attribute. */
8719 static tree
8723 {
8727 /* If no arguments are specified, all pointer arguments should be
8728 non-null. Verify a full prototype is given so that the arguments
8729 will have the correct types when we actually check them later. */
8731 {
8733 {
8736 }
8738 }
8740 /* Argument list specified. Verify that each argument number references
8741 a pointer argument. */
8743 {
8752 {
8757 }
8760 {
8761 function_args_iterator iter;
8762 tree argument;
8766 {
8770 }
8774 {
8779 }
8782 {
8787 }
8788 }
8789 }
8792 }
8794 /* Check the argument list of a function call for null in argument slots
8795 that are marked as requiring a non-null pointer argument. The NARGS
8796 arguments are passed in the array ARGARRAY.
8797 */
8799 static void
8801 {
8802 tree a;
8810 /* See if any of the nonnull attributes has no arguments. If so,
8811 then every pointer argument is checked (in which case the check
8812 for pointer type is done in check_nonnull_arg). */
8814 do
8822 else
8823 {
8824 /* Walk the argument list. If we encounter an argument number we
8825 should check for non-null, do it. */
8827 {
8829 {
8833 }
8838 }
8839 }
8840 }
8842 /* Check that the Nth argument of a function call (counting backwards
8843 from the end) is a (pointer)0. The NARGS arguments are passed in the
8844 array ARGARRAY. */
8846 static void
8848 {
8852 {
8855 tree sentinel;
8856 function_args_iterator iter;
8857 tree t;
8859 /* Skip over the named arguments. */
8861 {
8864 len++;
8865 }
8868 {
8871 }
8873 /* The sentinel must be one of the varargs, i.e.
8874 in position >= the number of fixed arguments. */
8876 {
8880 }
8882 /* Validate the sentinel. */
8886 /* Although __null (in C++) is only an integer we allow it
8887 nevertheless, as we are guaranteed that it's exactly
8888 as wide as a pointer, and we don't want to force
8889 users to cast the NULL they have written there.
8890 We warn with -Wstrict-null-sentinel, though. */
8893 }
8894 }
8896 /* Helper for check_function_nonnull; given a list of operands which
8897 must be non-null in ARGS, determine if operand PARAM_NUM should be
8898 checked. */
8900 static bool
8902 {
8906 {
8913 }
8915 }
8917 /* Check that the function argument PARAM (which is operand number
8918 PARAM_NUM) is non-null. This is called by check_function_nonnull
8919 via check_function_arguments_recurse. */
8921 static void
8924 {
8925 /* Just skip checking the argument if it's not a pointer. This can
8926 happen if the "nonnull" attribute was given without an operand
8927 list (which means to check every pointer argument). */
8935 }
8937 /* Helper for nonnull attribute handling; fetch the operand number
8938 from the attribute argument list. */
8940 static bool
8942 {
8943 /* Verify the arg number is a constant. */
8950 }
8952 /* Handle a "nothrow" attribute; arguments as in
8953 struct attribute_spec.handler. */
8955 static tree
8958 {
8961 /* ??? TODO: Support types. */
8962 else
8963 {
8966 }
8969 }
8971 /* Handle a "cleanup" attribute; arguments as in
8972 struct attribute_spec.handler. */
8974 static tree
8977 {
8981 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8982 for global destructors in C++. This requires infrastructure that
8983 we don't have generically at the moment. It's also not a feature
8984 we'd be missing too much, since we do have attribute constructor. */
8986 {
8990 }
8992 /* Verify that the argument is a function in scope. */
8993 /* ??? We could support pointers to functions here as well, if
8994 that was considered desirable. */
8997 {
9001 }
9004 {
9008 }
9010 /* That the function has proper type is checked with the
9011 eventual call to build_function_call. */
9014 }
9016 /* Handle a "warn_unused_result" attribute. No special handling. */
9018 static tree
9022 {
9023 /* Ignore the attribute for functions not returning any value. */
9025 {
9028 }
9031 }
9033 /* Handle a "sentinel" attribute. */
9035 static tree
9038 {
9040 {
9044 }
9045 else
9046 {
9048 {
9052 }
9053 }
9056 {
9060 {
9064 }
9065 else
9066 {
9068 {
9072 }
9073 }
9074 }
9077 }
9079 /* Handle a "type_generic" attribute. */
9081 static tree
9085 {
9086 /* Ensure we have a function type. */
9089 /* Ensure we have a variadic function. */
9093 }
9095 /* Handle a "target" attribute. */
9097 static tree
9100 {
9101 /* Ensure we have a function type. */
9103 {
9106 }
9108 flags))
9112 }
9114 /* Arguments being collected for optimization. */
9119 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9120 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9121 false for #pragma GCC optimize. */
9123 bool
9125 {
9133 tree ap;
9135 /* Build up argv vector. Just in case the string is stored away, use garbage
9136 collected strings. */
9141 {
9145 {
9149 }
9152 {
9153 /* Split string into multiple substrings. */
9161 {
9168 {
9172 }
9173 else
9174 {
9177 }
9181 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9182 options. */
9184 {
9189 else
9193 }
9196 {
9199 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9200 itself is -Os, and any other switch begins with a -f. */
9206 }
9211 }
9213 }
9214 }
9224 /* Now parse the options. */
9234 /* Don't allow changing -fstrict-aliasing. */
9239 }
9241 /* For handling "optimize" attribute. arguments as in
9242 struct attribute_spec.handler. */
9244 static tree
9247 {
9248 /* Ensure we have a function type. */
9250 {
9253 }
9254 else
9255 {
9259 /* Save current options. */
9262 /* If we previously had some optimization options, use them as the
9263 default. */
9268 /* Parse options, and update the vector. */
9273 /* Restore current options. */
9275 }
9278 }
9280 /* Handle a "no_split_stack" attribute. */
9282 static tree
9287 {
9291 {
9295 }
9297 {
9301 }
9304 }
9306 /* Handle a "returns_nonnull" attribute; arguments as in
9307 struct attribute_spec.handler. */
9309 static tree
9312 {
9313 // Even without a prototype we still have a return type we can check.
9315 {
9318 }
9320 }
9322 \f
9323 /* Check for valid arguments being passed to a function with FNTYPE.
9324 There are NARGS arguments in the array ARGARRAY. */
9325 void
9327 {
9328 /* Check for null being passed in a pointer argument that must be
9329 non-null. We also need to do this if format checking is enabled. */
9334 /* Check for errors in format strings. */
9341 }
9343 /* Generic argument checking recursion routine. PARAM is the argument to
9344 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9345 once the argument is resolved. CTX is context for the callback. */
9346 void
9351 {
9355 {
9356 /* Strip coercion. */
9360 }
9363 {
9365 tree attrs;
9368 /* See if this is a call to a known internationalization function
9369 that modifies a format arg. Such a function may have multiple
9370 format_arg attributes (for example, ngettext). */
9373 attrs;
9376 {
9377 tree inner_arg;
9378 tree format_num_expr;
9381 call_expr_arg_iterator iter;
9383 /* Extract the argument number, which was previously checked
9384 to be valid. */
9393 {
9398 }
9399 }
9401 /* If we found a format_arg attribute and did a recursive check,
9402 we are done with checking this argument. Otherwise, we continue
9403 and this will be considered a non-literal. */
9406 }
9409 {
9410 /* Check both halves of the conditional expression. */
9416 }
9419 }
9421 /* Checks for a builtin function FNDECL that the number of arguments
9422 NARGS against the required number REQUIRED and issues an error if
9423 there is a mismatch. Returns true if the number of arguments is
9424 correct, otherwise false. */
9426 static bool
9428 {
9430 {
9434 }
9436 {
9440 }
9442 }
9444 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9445 Returns false if there was an error, otherwise true. */
9447 bool
9449 {
9455 {
9465 {
9467 {
9471 }
9473 }
9483 {
9490 {
9494 }
9496 }
9501 {
9506 {
9510 }
9513 {
9515 fndecl);
9517 }
9519 }
9524 {
9526 {
9529 }
9531 }
9536 }
9537 }
9539 /* Function to help qsort sort FIELD_DECLs by name order. */
9541 int
9543 {
9548 /* A nontype is "greater" than a type. */
9557 }
9560 gt_pointer_operator new_value;
9564 /* This routine compares two fields like field_decl_cmp but using the
9565 pointer operator in resort_data. */
9567 static int
9569 {
9574 /* A nontype is "greater" than a type. */
9580 {
9587 }
9589 }
9591 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9593 void
9596 gt_pointer_operator new_value,
9598 {
9603 resort_field_decl_cmp);
9604 }
9606 /* Subroutine of c_parse_error.
9607 Return the result of concatenating LHS and RHS. RHS is really
9608 a string literal, its first character is indicated by RHS_START and
9609 RHS_SIZE is its length (including the terminating NUL character).
9611 The caller is responsible for deleting the returned pointer. */
9615 {
9621 }
9623 /* Issue the error given by GMSGID, indicating that it occurred before
9624 TOKEN, which had the associated VALUE. */
9626 void
9629 {
9630 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9640 {
9645 {
9658 }
9662 else
9668 }
9690 {
9695 }
9703 {
9708 }
9709 else
9713 {
9716 }
9717 #undef catenate_messages
9718 }
9720 /* Mapping for cpp message reasons to the options that enable them. */
9722 struct reason_option_codes_t
9723 {
9726 };
9747 };
9749 /* Return the gcc option code associated with the reason for a cpp
9750 message, or 0 if none. */
9752 static int
9754 {
9758 {
9761 }
9763 }
9765 /* Callback from cpp_error for PFILE to print diagnostics from the
9766 preprocessor. The diagnostic is of type LEVEL, with REASON set
9767 to the reason code if LEVEL is represents a warning, at location
9768 LOCATION unless this is after lexing and the compiler's location
9769 should be used instead, with column number possibly overridden by
9770 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9771 the arguments. Returns true if a diagnostic was emitted, false
9772 otherwise. */
9774 bool
9778 {
9779 diagnostic_info diagnostic;
9780 diagnostic_t dlevel;
9785 {
9790 /* Fall through. */
9815 }
9828 }
9830 /* Convert a character from the host to the target execution character
9831 set. cpplib handles this, mostly. */
9833 HOST_WIDE_INT
9835 {
9836 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9837 zero-extended under -fno-signed-char. cpplib insists that characters
9838 and character constants are always unsigned. Hence we must convert
9839 back and forth. */
9847 else
9849 }
9851 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9852 references with an INDIRECT_REF of a constant at the bottom; much like the
9853 traditional rendering of offsetof as a macro. Return the folded result. */
9855 tree
9857 {
9861 {
9877 {
9880 }
9890 {
9894 }
9907 /* Check if the offset goes beyond the upper bound of the array. */
9909 {
9915 {
9919 {
9920 tree v;
9927 {
9935 }
9936 /* Don't warn if the array might be considered a poor
9937 man's flexible array member with a very permissive
9938 definition thereof. */
9942 "index %E denotes an offset "
9945 }
9946 }
9947 }
9954 /* Handle static members of volatile structs. */
9961 }
9964 }
9966 /* Likewise, but convert it to the return type of offsetof. */
9968 tree
9970 {
9972 }
9974 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9975 expression, because B will always be true. */
9977 void
9979 {
9982 "the omitted middle operand in ?: will always be %<true%>, "
9984 }
9986 /* Give an error for storing into ARG, which is 'const'. USE indicates
9987 how ARG was being used. */
9989 void
9991 {
9994 /* Using this macro rather than (for example) arrays of messages
9995 ensures that all the format strings are checked at compile
9996 time. */
9997 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9998 : (use == lv_increment ? (I) \
9999 : (use == lv_decrement ? (D) : (AS))))
10001 {
10012 else
10018 }
10024 arg);
10030 arg);
10032 {
10042 arg);
10043 }
10049 arg);
10050 else
10055 arg);
10056 }
10058 /* Print an error message for an invalid lvalue. USE says
10059 how the lvalue is being used and so selects the error message. LOC
10060 is the location for the error. */
10062 void
10064 {
10066 {
10084 }
10085 }
10087 /* Print an error message for an invalid indirection of type TYPE.
10088 ERRSTRING is the name of the operator for the indirection. */
10090 void
10092 {
10094 {
10102 type);
10107 type);
10112 type);
10117 type);
10122 type);
10126 }
10127 }
10128 \f
10129 /* *PTYPE is an incomplete array. Complete it with a domain based on
10130 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10131 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10132 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10134 int
10136 {
10144 {
10146 {
10147 int eltsize
10150 }
10152 {
10156 {
10160 }
10161 else
10162 {
10163 tree curindex;
10174 {
10178 else
10179 {
10181 {
10182 /* Since we treat size types now as ordinary
10183 unsigned types, we need an explicit overflow
10184 check. */
10188 }
10190 size_one_node);
10191 }
10194 }
10196 {
10200 }
10201 }
10202 }
10203 else
10204 {
10205 /* Make an error message unless that happened already. */
10208 }
10209 }
10210 else
10211 {
10215 }
10218 /* Force an indefinite layout factor. */
10225 else
10228 /* Using build_distinct_type_copy and modifying things afterward instead
10229 of using build_array_type to create a new type preserves all of the
10230 TYPE_LANG_FLAG_? bits that the front end may have set. */
10238 /* Make sure we have the canonical MAIN_TYPE. */
10241 hashcode);
10244 /* Fix the canonical type. */
10254 else
10259 else
10265 {
10267 /* If we proceed with the array type as it is, we'll eventually
10268 crash in tree_to_[su]hwi(). */
10270 }
10274 }
10276 /* Like c_mark_addressable but don't check register qualifier. */
10277 void
10279 {
10285 }
10288 \f
10289 /* Used to help initialize the builtin-types.def table. When a type of
10290 the correct size doesn't exist, use error_mark_node instead of NULL.
10291 The later results in segfaults even when a decl using the type doesn't
10292 get invoked. */
10294 tree
10296 {
10299 }
10301 /* A helper function for resolve_overloaded_builtin in resolving the
10302 overloaded __sync_ builtins. Returns a positive power of 2 if the
10303 first operand of PARAMS is a pointer to a supported data type.
10304 Returns 0 if an error is encountered. */
10306 static int
10308 {
10309 tree type;
10313 {
10316 }
10330 incompatible:
10333 }
10335 /* A helper function for resolve_overloaded_builtin. Adds casts to
10336 PARAMS to make arguments match up with those of FUNCTION. Drops
10337 the variadic arguments at the end. Returns false if some error
10338 was encountered; true on success. */
10340 static bool
10343 {
10344 function_args_iterator iter;
10345 tree ptype;
10349 /* We've declared the implementation functions to use "volatile void *"
10350 as the pointer parameter, so we shouldn't get any complaints from the
10351 call to check_function_arguments what ever type the user used. */
10356 /* For the rest of the values, we need to cast these to FTYPE, so that we
10357 don't get warnings for passing pointer types, etc. */
10360 {
10364 /* XXX void_type_node belies the abstraction. */
10370 {
10373 }
10375 /* Only convert parameters if arg_type is unsigned integer type with
10376 new format sync routines, i.e. don't attempt to convert pointer
10377 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10378 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10379 kinds). */
10381 {
10382 /* Ideally for the first conversion we'd use convert_for_assignment
10383 so that we get warnings for anything that doesn't match the pointer
10384 type. This isn't portable across the C and C++ front ends atm. */
10389 }
10392 }
10394 /* __atomic routines are not variadic. */
10396 {
10399 }
10401 /* The definition of these primitives is variadic, with the remaining
10402 being "an optional list of variables protected by the memory barrier".
10403 No clue what that's supposed to mean, precisely, but we consider all
10404 call-clobbered variables to be protected so we're safe. */
10408 }
10410 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10411 RESULT to make it match the type of the first pointer argument in
10412 PARAMS. */
10414 static tree
10416 {
10421 /* New format doesn't require casting unless the types are the same size. */
10424 else
10426 }
10428 /* This function verifies the PARAMS to generic atomic FUNCTION.
10429 It returns the size if all the parameters are the same size, otherwise
10430 0 is returned if the parameters are invalid. */
10432 static int
10435 {
10440 tree type_0;
10442 /* Determine the parameter makeup. */
10444 {
10460 }
10463 {
10466 }
10468 /* Get type of first parameter, and determine its size. */
10471 {
10473 function);
10475 }
10477 /* Types must be compile time constant sizes. */
10479 {
10482 function);
10484 }
10488 /* Zero size objects are not allowed. */
10490 {
10493 function);
10495 }
10497 /* Check each other parameter is a pointer and the same size. */
10499 {
10502 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10506 {
10508 function);
10510 }
10513 {
10515 function);
10517 }
10518 }
10520 /* Check memory model parameters for validity. */
10522 {
10525 {
10528 {
10531 function);
10532 }
10533 }
10534 else
10536 {
10538 function);
10540 }
10541 }
10544 }
10547 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10548 at the beginning of the parameter list PARAMS representing the size of the
10549 objects. This is to match the library ABI requirement. LOC is the location
10550 of the function call.
10551 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10552 returned to allow the external call to be constructed. */
10554 static tree
10557 {
10558 tree size_node;
10560 /* Insert a SIZE_T parameter as the first param. If there isn't
10561 enough space, allocate a new vector and recursively re-build with that. */
10563 {
10566 tree f;
10576 }
10578 /* Add the size parameter and leave as a function call for processing. */
10582 }
10585 /* Return whether atomic operations for naturally aligned N-byte
10586 arguments are supported, whether inline or through libatomic. */
10587 static bool
10589 {
10591 {
10603 }
10604 }
10606 /* This will process an __atomic_exchange function call, determine whether it
10607 needs to be mapped to the _N variation, or turned into a library call.
10608 LOC is the location of the builtin call.
10609 FUNCTION is the DECL that has been invoked;
10610 PARAMS is the argument list for the call. The return value is non-null
10611 TRUE is returned if it is translated into the proper format for a call to the
10612 external library, and NEW_RETURN is set the tree for that function.
10613 FALSE is returned if processing for the _N variation is required, and
10614 NEW_RETURN is set to the the return value the result is copied into. */
10615 static bool
10618 {
10623 /* Size of 0 is an error condition. */
10625 {
10628 }
10630 /* If not a lock-free size, change to the library generic format. */
10632 {
10635 }
10637 /* Otherwise there is a lockfree match, transform the call from:
10638 void fn(T* mem, T* desired, T* return, model)
10639 into
10640 *return = (T) (fn (In* mem, (In) *desired, model)) */
10647 /* Create pointer to appropriate size. */
10651 /* Convert object pointer to required type. */
10654 /* Convert new value to required type, and dereference it. */
10659 /* Move memory model to the 3rd position, and end param list. */
10663 /* Convert return pointer and dereference it for later assignment. */
10667 }
10670 /* This will process an __atomic_compare_exchange function call, determine
10671 whether it needs to be mapped to the _N variation, or turned into a lib call.
10672 LOC is the location of the builtin call.
10673 FUNCTION is the DECL that has been invoked;
10674 PARAMS is the argument list for the call. The return value is non-null
10675 TRUE is returned if it is translated into the proper format for a call to the
10676 external library, and NEW_RETURN is set the tree for that function.
10677 FALSE is returned if processing for the _N variation is required. */
10679 static bool
10683 {
10688 /* Size of 0 is an error condition. */
10690 {
10693 }
10695 /* If not a lock-free size, change to the library generic format. */
10697 {
10698 /* The library generic format does not have the weak parameter, so
10699 remove it from the param list. Since a parameter has been removed,
10700 we can be sure that there is room for the SIZE_T parameter, meaning
10701 there will not be a recursive rebuilding of the parameter list, so
10702 there is no danger this will be done twice. */
10704 {
10708 }
10711 }
10713 /* Otherwise, there is a match, so the call needs to be transformed from:
10714 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10715 into
10716 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10722 /* Create pointer to appropriate size. */
10726 /* Convert object pointer to required type. */
10730 /* Convert expected pointer to required type. */
10734 /* Convert desired value to required type, and dereference it. */
10739 /* The rest of the parameters are fine. NULL means no special return value
10740 processing.*/
10743 }
10746 /* This will process an __atomic_load function call, determine whether it
10747 needs to be mapped to the _N variation, or turned into a library call.
10748 LOC is the location of the builtin call.
10749 FUNCTION is the DECL that has been invoked;
10750 PARAMS is the argument list for the call. The return value is non-null
10751 TRUE is returned if it is translated into the proper format for a call to the
10752 external library, and NEW_RETURN is set the tree for that function.
10753 FALSE is returned if processing for the _N variation is required, and
10754 NEW_RETURN is set to the the return value the result is copied into. */
10756 static bool
10759 {
10764 /* Size of 0 is an error condition. */
10766 {
10769 }
10771 /* If not a lock-free size, change to the library generic format. */
10773 {
10776 }
10778 /* Otherwise, there is a match, so the call needs to be transformed from:
10779 void fn(T* mem, T* return, model)
10780 into
10781 *return = (T) (fn ((In *) mem, model)) */
10787 /* Create pointer to appropriate size. */
10791 /* Convert object pointer to required type. */
10795 /* Move memory model to the 2nd position, and end param list. */
10799 /* Convert return pointer and dereference it for later assignment. */
10803 }
10806 /* This will process an __atomic_store function call, determine whether it
10807 needs to be mapped to the _N variation, or turned into a library call.
10808 LOC is the location of the builtin call.
10809 FUNCTION is the DECL that has been invoked;
10810 PARAMS is the argument list for the call. The return value is non-null
10811 TRUE is returned if it is translated into the proper format for a call to the
10812 external library, and NEW_RETURN is set the tree for that function.
10813 FALSE is returned if processing for the _N variation is required, and
10814 NEW_RETURN is set to the the return value the result is copied into. */
10816 static bool
10819 {
10824 /* Size of 0 is an error condition. */
10826 {
10829 }
10831 /* If not a lock-free size, change to the library generic format. */
10833 {
10836 }
10838 /* Otherwise, there is a match, so the call needs to be transformed from:
10839 void fn(T* mem, T* value, model)
10840 into
10841 fn ((In *) mem, (In) *value, model) */
10846 /* Create pointer to appropriate size. */
10850 /* Convert object pointer to required type. */
10854 /* Convert new value to required type, and dereference it. */
10859 /* The memory model is in the right spot already. Return is void. */
10863 }
10866 /* Some builtin functions are placeholders for other expressions. This
10867 function should be called immediately after parsing the call expression
10868 before surrounding code has committed to the type of the expression.
10870 LOC is the location of the builtin call.
10872 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10873 PARAMS is the argument list for the call. The return value is non-null
10874 when expansion is complete, and null if normal processing should
10875 continue. */
10877 tree
10880 {
10886 {
10892 else
10896 }
10898 /* Handle BUILT_IN_NORMAL here. */
10900 {
10905 {
10906 /* Handle these 4 together so that they can fall through to the next
10907 case if the call is transformed to an _N variant. */
10909 {
10911 {
10915 /* Change to the _N variant. */
10918 }
10921 {
10923 params,
10926 /* Change to the _N variant. */
10929 }
10931 {
10935 /* Change to the _N variant. */
10938 }
10940 {
10944 /* Change to the _N variant. */
10947 }
10950 }
10951 /* Fallthrough to the normal processing. */
10952 }
10969 {
10971 /* Fallthru for parameter processing. */
10972 }
10989 {
11000 orig_format))
11005 NULL);
11013 /* If new_return is set, assign function to that expr and cast the
11014 result to void since the generic interface returned void. */
11016 {
11017 /* Cast function result from I{1,2,4,8,16} to the required type. */
11020 result);
11024 }
11026 }
11030 }
11031 }
11033 /* vector_types_compatible_elements_p is used in type checks of vectors
11034 values used as operands of binary operators. Where it returns true, and
11035 the other checks of the caller succeed (being vector types in he first
11036 place, and matching number of elements), we can just treat the types
11037 as essentially the same.
11038 Contrast with vector_targets_convertible_p, which is used for vector
11039 pointer types, and vector_types_convertible_p, which will allow
11040 language-specific matches under the control of flag_lax_vector_conversions,
11041 and might still require a conversion. */
11042 /* True if vector types T1 and T2 can be inputs to the same binary
11043 operator without conversion.
11044 We don't check the overall vector size here because some of our callers
11045 want to give different error messages when the vectors are compatible
11046 except for the element count. */
11048 bool
11050 {
11063 /* Equality works here because c_common_signed_type uses
11064 TYPE_MAIN_VARIANT. */
11072 }
11074 /* Check for missing format attributes on function pointers. LTYPE is
11075 the new type or left-hand side type. RTYPE is the old type or
11076 right-hand side type. Returns TRUE if LTYPE is missing the desired
11077 attribute. */
11079 bool
11081 {
11083 tree ra;
11089 {
11090 tree la;
11095 }
11096 else
11098 }
11100 /* Subscripting with type char is likely to lose on a machine where
11101 chars are signed. So warn on any machine, but optionally. Don't
11102 warn for unsigned char since that type is safe. Don't warn for
11103 signed char because anyone who uses that must have done so
11104 deliberately. Furthermore, we reduce the false positive load by
11105 warning only for non-constant value of type char. */
11107 void
11109 {
11113 }
11115 /* Implement -Wparentheses for the unexpected C precedence rules, to
11116 cover cases like x + y << z which readers are likely to
11117 misinterpret. We have seen an expression in which CODE is a binary
11118 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11119 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11120 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11121 expression was not formed using a binary or unary operator, or it
11122 was enclosed in parentheses. */
11124 void
11128 {
11132 /* This macro tests that the expression ARG with original tree code
11133 CODE appears to be a boolean expression. or the result of folding a
11134 boolean expression. */
11135 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11136 (truth_value_p (TREE_CODE (ARG)) \
11137 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11139 || ((CODE) != INTEGER_CST \
11140 && (integer_onep (ARG) || integer_zerop (ARG))))
11143 {
11192 /* Check cases like x|y==z */
11199 /* Check cases like !x | y */
11203 "suggest parentheses around operand of "
11216 /* Check cases like x^y==z */
11238 /* Check cases like x&y==z */
11245 /* Check cases like !x & y */
11249 "suggest parentheses around operand of "
11272 {
11277 "comparisons like %<X<=Y<=Z%> do not "
11283 "comparisons like %<X<=Y<=Z%> do not "
11285 }
11287 }
11288 #undef NOT_A_BOOLEAN_EXPR_P
11289 }
11291 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11293 void
11295 {
11297 {
11300 else
11302 }
11303 }
11305 /* Warn for division by zero according to the value of DIVISOR. LOC
11306 is the location of the division operator. */
11308 void
11310 {
11311 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11312 about division by zero. Do not issue a warning if DIVISOR has a
11313 floating-point type, since we consider 0.0/0.0 a valid way of
11314 generating a NaN. */
11318 }
11320 /* Subroutine of build_binary_op. Give warnings for comparisons
11321 between signed and unsigned quantities that may fail. Do the
11322 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11323 so that casts will be considered, but default promotions won't
11324 be.
11326 LOCATION is the location of the comparison operator.
11328 The arguments of this function map directly to local variables
11329 of build_binary_op. */
11331 void
11336 {
11341 /* In C++, check for comparison of different enum types. */
11347 {
11351 }
11353 /* Do not warn if the comparison is being done in a signed type,
11354 since the signed type will only be chosen if it can represent
11355 all the values of the unsigned type. */
11358 /* Do not warn if both operands are unsigned. */
11361 else
11362 {
11368 else
11376 /* Do not warn if the signed quantity is an unsuffixed integer
11377 literal (or some static constant expression involving such
11378 literals or a conditional expression involving such literals)
11379 and it is non-negative. */
11382 /* Do not warn if the comparison is an equality operation, the
11383 unsigned quantity is an integral constant, and it would fit
11384 in the result if the result were signed. */
11389 /* In C, do not warn if the unsigned quantity is an enumeration
11390 constant and its maximum value would fit in the result if the
11391 result were signed. */
11397 else
11399 OPT_Wsign_compare,
11401 }
11403 /* Warn if two unsigned values are being compared in a size larger
11404 than their original size, and one (and only one) is the result of
11405 a `~' operator. This comparison will always fail.
11407 Also warn if one operand is a constant, and the constant does not
11408 have all bits set that are set in the ~ operand when it is
11409 extended. */
11416 {
11423 {
11424 tree primop;
11430 {
11434 }
11435 else
11436 {
11440 }
11445 {
11448 {
11452 else
11455 }
11456 }
11457 }
11465 }
11466 }
11468 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11469 type via c_common_type. If -Wdouble-promotion is in use, and the
11470 conditions for warning have been met, issue a warning. GMSGID is
11471 the warning message. It must have two %T specifiers for the type
11472 that was converted (generally "float") and the type to which it was
11473 converted (generally "double), respectively. LOC is the location
11474 to which the awrning should refer. */
11476 void
11479 {
11480 tree source_type;
11484 /* If the conversion will not occur at run-time, there is no need to
11485 warn about it. */
11497 else
11500 }
11502 /* Setup a TYPE_DECL node as a typedef representation.
11504 X is a TYPE_DECL for a typedef statement. Create a brand new
11505 ..._TYPE node (which will be just a variant of the existing
11506 ..._TYPE node with identical properties) and then install X
11507 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11509 The whole point here is to end up with a situation where each
11510 and every ..._TYPE node the compiler creates will be uniquely
11511 associated with AT MOST one node representing a typedef name.
11512 This way, even though the compiler substitutes corresponding
11513 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11514 early on, later parts of the compiler can always do the reverse
11515 translation and get back the corresponding typedef name. For
11516 example, given:
11518 typedef struct S MY_TYPE;
11519 MY_TYPE object;
11521 Later parts of the compiler might only know that `object' was of
11522 type `struct S' if it were not for code just below. With this
11523 code however, later parts of the compiler see something like:
11525 struct S' == struct S
11526 typedef struct S' MY_TYPE;
11527 struct S' object;
11529 And they can then deduce (from the node for type struct S') that
11530 the original object declaration was:
11532 MY_TYPE object;
11534 Being able to do this is important for proper support of protoize,
11535 and also for generating precise symbolic debugging information
11536 which takes full account of the programmer's (typedef) vocabulary.
11538 Obviously, we don't want to generate a duplicate ..._TYPE node if
11539 the TYPE_DECL node that we are now processing really represents a
11540 standard built-in type. */
11542 void
11544 {
11548 {
11551 }
11554 {
11562 }
11563 }
11565 /* Record the types used by the current global variable declaration
11566 being parsed, so that we can decide later to emit their debug info.
11567 Those types are in types_used_by_cur_var_decl, and we are going to
11568 store them in the types_used_by_vars_hash hash table.
11569 DECL is the declaration of the global variable that has been parsed. */
11571 void
11573 {
11577 {
11580 }
11581 }
11583 /* If DECL is a typedef that is declared in the current function,
11584 record it for the purpose of -Wunused-local-typedefs. */
11586 void
11588 {
11593 /* if this is not a locally defined typedef then we are not
11594 interested. */
11601 }
11603 /* If T is a TYPE_DECL declared locally, mark it as used. */
11605 void
11607 {
11612 }
11614 /* Warn if there are some unused locally defined typedefs in the
11615 current function. */
11617 void
11619 {
11621 tree decl;
11622 /* The number of times we have emitted -Wunused-local-typedefs
11623 warnings. If this is different from errorcount, that means some
11624 unrelated errors have been issued. In which case, we'll avoid
11625 emitting "unused-local-typedefs" warnings. */
11637 {
11641 OPT_Wunused_local_typedefs,
11644 }
11647 }
11649 /* The C and C++ parsers both use vectors to hold function arguments.
11650 For efficiency, we keep a cache of unused vectors. This is the
11651 cache. */
11656 /* Return a new vector from the cache. If the cache is empty,
11657 allocate a new vector. These vectors are GC'ed, so it is OK if the
11658 pointer is not released.. */
11662 {
11665 else
11666 {
11667 /* Passing 0 to vec::alloc returns NULL, and our callers require
11668 that we always return a non-NULL value. The vector code uses
11669 4 when growing a NULL vector, so we do too. */
11673 }
11674 }
11676 /* Release a vector of trees back to the cache. */
11678 void
11680 {
11682 {
11685 }
11686 }
11688 /* Get a new tree vector holding a single tree. */
11692 {
11696 }
11698 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11702 {
11707 }
11709 /* Get a new tree vector which is a copy of an existing one. */
11713 {
11716 tree t;
11723 }
11725 /* Return true if KEYWORD starts a type specifier. */
11727 bool
11729 {
11731 {
11762 }
11763 }
11765 /* Return true if KEYWORD names a type qualifier. */
11767 bool
11769 {
11771 {
11779 }
11780 }
11782 /* Return true if KEYWORD names a storage class specifier.
11784 RID_TYPEDEF is not included in this list despite `typedef' being
11785 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11786 such for syntactic convenience only. */
11788 bool
11790 {
11792 {
11802 }
11803 }
11805 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11807 static bool
11809 {
11811 {
11819 }
11820 }
11822 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11823 declaration-specifier (C99 6.7). */
11825 bool
11827 {
11834 {
11841 }
11842 }
11844 /* Initialize language-specific-bits of tree_contains_struct. */
11846 void
11848 {
11854 }
11856 /* Build a user-defined numeric literal out of an integer constant type VALUE
11857 with identifier SUFFIX. */
11859 tree
11862 {
11869 }
11871 /* For vector[index], convert the vector to a
11872 pointer of the underlying type. */
11873 void
11876 {
11878 {
11880 tree type1;
11893 }
11894 }
11896 /* Determine which of the operands, if any, is a scalar that needs to be
11897 converted to a vector, for the range of operations. */
11898 enum stv_conv
11901 {
11910 {
11911 /* Most GENERIC binary expressions require homogeneous arguments.
11912 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11913 argument that is a vector and a second one that is a scalar, so
11914 we never return stv_secondarg for them. */
11919 {
11921 {
11926 }
11927 else
11929 }
11936 /* ... fall through ... */
11957 /* What about UNLT_EXPR? */
11959 {
11960 tree tmp;
11962 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11965 }
11969 {
11971 {
11976 }
11978 }
11980 /* Allow integer --> real conversion if safe. */
11984 {
11986 {
11991 }
11993 }
11996 }
11999 }
12001 /* Return true iff ALIGN is an integral constant that is a fundamental
12002 alignment, as defined by [basic.align] in the c++-11
12003 specifications.
12005 That is:
12007 [A fundamental alignment is represented by an alignment less than or
12008 equal to the greatest alignment supported by the implementation
12009 in all contexts, which is equal to
12010 alignof(max_align_t)]. */
12012 bool
12014 {
12017 }
12019 /* Return true if T is a pointer to a zero-sized aggregate. */
12021 bool
12023 {
12028 }