| blob | 9f8e8eed2ee22d0921ddc44ad3696376e5de7383 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
50 /* The following symbols are subsumed in the c_global_trees array, and
51 listed here individually for documentation purposes.
53 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
55 tree short_integer_type_node;
56 tree long_integer_type_node;
57 tree long_long_integer_type_node;
58 tree int128_integer_type_node;
60 tree short_unsigned_type_node;
61 tree long_unsigned_type_node;
62 tree long_long_unsigned_type_node;
63 tree int128_unsigned_type_node;
65 tree truthvalue_type_node;
66 tree truthvalue_false_node;
67 tree truthvalue_true_node;
69 tree ptrdiff_type_node;
71 tree unsigned_char_type_node;
72 tree signed_char_type_node;
73 tree wchar_type_node;
75 tree char16_type_node;
76 tree char32_type_node;
78 tree float_type_node;
79 tree double_type_node;
80 tree long_double_type_node;
82 tree complex_integer_type_node;
83 tree complex_float_type_node;
84 tree complex_double_type_node;
85 tree complex_long_double_type_node;
87 tree dfloat32_type_node;
88 tree dfloat64_type_node;
89 tree_dfloat128_type_node;
91 tree intQI_type_node;
92 tree intHI_type_node;
93 tree intSI_type_node;
94 tree intDI_type_node;
95 tree intTI_type_node;
97 tree unsigned_intQI_type_node;
98 tree unsigned_intHI_type_node;
99 tree unsigned_intSI_type_node;
100 tree unsigned_intDI_type_node;
101 tree unsigned_intTI_type_node;
103 tree widest_integer_literal_type_node;
104 tree widest_unsigned_literal_type_node;
106 Nodes for types `void *' and `const void *'.
108 tree ptr_type_node, const_ptr_type_node;
110 Nodes for types `char *' and `const char *'.
112 tree string_type_node, const_string_type_node;
114 Type `char[SOMENUMBER]'.
115 Used when an array of char is needed and the size is irrelevant.
117 tree char_array_type_node;
119 Type `int[SOMENUMBER]' or something like it.
120 Used when an array of int needed and the size is irrelevant.
122 tree int_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
195 /* Nonzero whenever UPC -fupc-threads-N is asserted.
196 The value N gives the number of UPC threads to be
197 defined at compile-time. */
200 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
203 /* The implementation model for UPC threads that
204 are mapped to POSIX threads, specified at compilation
205 time by the -fupc-pthreads-model-* switch. */
206 upc_pthreads_model_kind upc_pthreads_model;
208 /* C/ObjC language option variables. */
211 /* Nonzero means allow type mismatches in conditional expressions;
212 just make their values `void'. */
216 /* Nonzero means enable C89 Amendment 1 features. */
220 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
224 /* Nonzero means use the ISO C11 dialect of C. */
228 /* Nonzero means that we have builtin functions, and main is an int. */
233 /* ObjC language option variables. */
236 /* Tells the compiler that this is a special run. Do not perform any
237 compiling, instead we are to test some platform dependent features
238 and output a C header file with appropriate definitions. */
242 /* Tells the compiler what is the constant string class for ObjC. */
247 /* C++ language option variables. */
250 /* Nonzero means generate separate instantiation control files and
251 juggle them at link time. */
255 /* The C++ dialect being used. C++98 is the default. */
259 /* Maximum template instantiation depth. This limit exists to limit the
260 time it takes to notice excessively recursive template instantiations.
262 The default is lower than the 1024 recommended by the C++0x standard
263 because G++ runs out of stack before 1024 with highly recursive template
264 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
268 /* The elements of `ridpointers' are identifier nodes for the reserved
269 type names and storage classes. It is indexed by a RID_... value. */
274 /* Nonzero means don't warn about problems that occur when the code is
275 executed. */
278 /* Whether we are building a boolean conversion inside
279 convert_for_assignment, or some other late binary operation. If
280 build_binary_op is called for C (from code shared by C and C++) in
281 this case, then the operands have already been folded and the
282 result will not be folded again, so C_MAYBE_CONST_EXPR should not
283 be generated. */
286 /* Whether lexing has been completed, so subsequent preprocessor
287 errors should use the compiler's input_location. */
290 /* Information about how a function name is generated. */
291 struct fname_var_t
292 {
296 };
298 /* The three ways of getting then name of the current function. */
301 {
302 /* C99 compliant __func__, must be first. */
304 /* GCC __FUNCTION__ compliant. */
306 /* GCC __PRETTY_FUNCTION__ compliant. */
309 };
311 /* Global visibility options. */
392 /* Reserved words. The third field is a mask: keywords are disabled
393 if they match the mask.
395 Masks for languages:
396 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
397 C --std=c99: D_CXXONLY | D_OBJC
398 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
399 UPC is like C except that D_UPC is not set
400 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
401 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
402 ObjC++ is like C++ except that D_OBJC is not set
404 If -fno-asm is used, D_ASM is added to the mask. If
405 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
406 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
407 In C with -Wc++-compat, we warn if D_CXXWARN is set.
409 Note the complication of the D_CXX_OBJC keywords. These are
410 reserved words such as 'class'. In C++, 'class' is a reserved
411 word. In Objective-C++ it is too. In Objective-C, it is a
412 reserved word too, but only if it follows an '@' sign.
413 */
415 {
570 /* These Objective-C keywords are recognized only immediately after
571 an '@'. */
588 /* These are recognized only in protocol-qualifier context
589 (see above) */
597 /* UPC keywords */
609 /* These are recognized inside a property attribute list */
618 };
623 /* Table of machine-independent attributes common to all C-like languages. */
625 {
626 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
627 affects_type_identity } */
634 /* FIXME: logically, noreturn attributes should be listed as
635 "false, true, true" and apply to function types. But implementing this
636 would require all the places in the compiler that use TREE_THIS_VOLATILE
637 on a decl to identify non-returning functions to be located and fixed
638 to check the function type instead. */
663 /* The same comments as for noreturn attributes apply to const ones. */
687 handle_no_instrument_function_attribute,
705 /* ??? These two attributes didn't make the transition from the
706 Intel language document to the multi-vendor language document. */
711 /* For internal use (marking of builtins) only. The name contains space
712 to prevent its usage in source code. */
734 /* For internal use (marking of builtins) only. The name contains space
735 to prevent its usage in source code. */
746 handle_no_address_safety_analysis_attribute,
749 handle_no_sanitize_address_attribute,
759 /* For internal use only. The leading '*' both prevents its usage in
760 source code and signals that it may be overridden by machine tables. */
765 /* For internal use (marking of builtins and runtime functions) only.
766 The name contains space to prevent its usage in source code. */
770 };
772 /* Give the specifications for the format attributes, used by C and all
773 descendants. */
776 {
777 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
778 affects_type_identity } */
784 };
786 /* Return identifier for address space AS. */
790 {
794 }
796 /* Push current bindings for the function name VAR_DECLS. */
798 void
800 {
805 {
809 {
811 saved);
813 }
814 }
816 /* Normally they'll have been NULL, so only push if we've got a
817 stack, or they are non-NULL. */
819 saved_function_name_decls);
820 }
822 /* Finish up the current bindings, adding them into the current function's
823 statement tree. This must be done _before_ finish_stmt_tree is called.
824 If there is no current function, we must be at file scope and no statements
825 are involved. Pop the previous bindings. */
827 void
829 {
838 {
846 }
852 {
853 /* We had saved values, restore them. */
854 tree saved;
857 {
862 }
864 }
866 }
868 /* Return the text name of the current function, suitably prettified
869 by PRETTY_P. Return string must be freed by caller. */
873 {
880 {
883 }
896 {
899 }
902 }
904 /* Return the VAR_DECL for a const char array naming the current
905 function. If the VAR_DECL has not yet been created, create it
906 now. RID indicates how it should be formatted and IDENTIFIER_NODE
907 ID is its name (unfortunately C and C++ hold the RID values of
908 keywords in different places, so we can't derive RID from ID in
909 this language independent code. LOC is the location of the
910 function. */
912 tree
914 {
924 {
925 /* If a tree is built here, it would normally have the lineno of
926 the current statement. Later this tree will be moved to the
927 beginning of the function and this line number will be wrong.
928 To avoid this problem set the lineno to 0 here; that prevents
929 it from appearing in the RTL. */
930 tree stmts;
938 saved_function_name_decls
942 }
947 }
949 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
951 tree
953 {
958 /* Compute the number of elements, for the array type. */
960 {
963 }
965 {
968 }
970 {
973 }
974 else
975 {
978 }
980 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
981 limit in C++98 Annex B is very large (65536) and is not normative,
982 so we do not diagnose it (warn_overlength_strings is forced off
983 in c_common_post_options). */
985 {
989 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
990 separate the %d from the 'C'. 'ISO' should not be
991 translated, but it may be moved after 'C%d' in languages
992 where modifiers follow nouns. */
994 "string length %qd is greater than the length %qd "
997 }
999 /* Create the array type for the string constant. The ISO C++
1000 standard says that a string literal has type `const char[N]' or
1001 `const wchar_t[N]'. We use the same logic when invoked as a C
1002 front-end with -Wwrite-strings.
1003 ??? We should change the type of an expression depending on the
1004 state of a warning flag. We should just be warning -- see how
1005 this is handled in the C++ front-end for the deprecated implicit
1006 conversion from string literals to `char*' or `wchar_t*'.
1008 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1009 array type being the unqualified version of that type.
1010 Therefore, if we are constructing an array of const char, we must
1011 construct the matching unqualified array type first. The C front
1012 end does not require this, but it does no harm, so we do it
1013 unconditionally. */
1024 }
1025 \f
1026 /* If DISABLE is true, stop issuing warnings. This is used when
1027 parsing code that we know will not be executed. This function may
1028 be called multiple times, and works as a stack. */
1030 static void
1032 {
1034 {
1037 }
1038 }
1040 /* If ENABLE is true, reenable issuing warnings. */
1042 static void
1044 {
1046 {
1049 }
1050 }
1052 /* Fully fold EXPR, an expression that was not folded (beyond integer
1053 constant expressions and null pointer constants) when being built
1054 up. If IN_INIT, this is in a static initializer and certain
1055 changes are made to the folding done. Clear *MAYBE_CONST if
1056 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1057 expression because it contains an evaluated operator (in C99) or an
1058 operator outside of sizeof returning an integer constant (in C90)
1059 not permitted in constant expressions, or because it contains an
1060 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1061 set to true by callers before calling this function.) Return the
1062 folded expression. Function arguments have already been folded
1063 before calling this function, as have the contents of SAVE_EXPR,
1064 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1065 C_MAYBE_CONST_EXPR. */
1067 tree
1069 {
1070 tree ret;
1076 /* This function is not relevant to C++ because C++ folds while
1077 parsing, and may need changes to be correct for C++ when C++
1078 stops folding while parsing. */
1085 {
1088 }
1095 }
1097 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1098 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1099 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1100 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1101 both evaluated and unevaluated subexpressions while
1102 *MAYBE_CONST_ITSELF is carried from only evaluated
1103 subexpressions). */
1105 static tree
1108 {
1120 /* This function is not relevant to C++ because C++ folds while
1121 parsing, and may need changes to be correct for C++ when C++
1122 stops folding while parsing. */
1126 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1127 anything else not counted as an expression cannot usefully be
1128 folded further at this point. */
1134 /* Operands of variable-length expressions (function calls) have
1135 already been folded, as have __builtin_* function calls, and such
1136 expressions cannot occur in constant expressions. */
1138 {
1142 }
1145 {
1154 else
1157 }
1159 /* Assignment, increment, decrement, function call and comma
1160 operators, and statement expressions, cannot occur in constant
1161 expressions if evaluated / outside of sizeof. (Function calls
1162 were handled above, though VA_ARG_EXPR is treated like a function
1163 call here, and statement expressions are handled through
1164 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1166 {
1186 }
1188 /* Fold individual tree codes as appropriate. */
1190 {
1192 /* Any non-constancy will have been marked in a containing
1193 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1201 maybe_const_itself);
1206 {
1209 }
1218 maybe_const_itself);
1221 maybe_const_itself);
1227 {
1231 }
1273 /* Binary operations evaluating both arguments (increment and
1274 decrement are binary internally in GCC). */
1278 maybe_const_itself);
1286 /* The RHS of a MODIFY_EXPR was fully folded when building that
1287 expression for the sake of conversion warnings. */
1290 maybe_const_itself);
1294 ret = in_init
1297 else
1310 {
1321 }
1327 CASE_CONVERT:
1337 /* Unary operations. */
1340 maybe_const_itself);
1344 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1345 not prepared to deal with them if they occur in initializers.
1346 Avoid attempts to fold references to UPC shared components
1347 due to the complexities of UPC pointer-to-shared arithmetic. */
1356 ret = in_init
1359 else
1364 {
1368 }
1370 {
1373 CASE_CONVERT:
1374 /* Don't warn about explicit conversions. We will already
1375 have warned about suspect implicit conversions. */
1382 }
1387 /* Binary operations not necessarily evaluating both
1388 arguments. */
1395 ? truthvalue_false_node
1403 ret = in_init
1406 else
1411 && op0_const
1412 && op0_const_self
1418 && op0_const_self
1444 else
1449 && op0_const
1450 && op0_const_self
1454 && op0_const_self
1458 && op0_const
1459 && op0_const_self
1463 && op0_const_self
1469 /* Each case where an operand with excess precision may be
1470 encountered must remove the EXCESS_PRECISION_EXPR around
1471 inner operands and possibly put one around the whole
1472 expression or possibly convert to the semantic type (which
1473 c_fully_fold does); we cannot tell at this stage which is
1474 appropriate in any particular case. */
1478 /* Various codes may appear through folding built-in functions
1479 and their arguments. */
1481 }
1483 out:
1484 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1485 have been done by this point, so remove them again. */
1489 {
1493 }
1497 }
1499 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1500 return EXP. Otherwise, return either EXP or its known constant
1501 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1502 Is the BLKmode test appropriate? */
1504 tree
1506 {
1507 tree ret;
1509 /* This function is only used by C, for c_fully_fold and other
1510 optimization, and may not be correct for C++. */
1521 /* Avoid unwanted tree sharing between the initializer and current
1522 function's body where the tree can be modified e.g. by the
1523 gimplifier. */
1527 }
1529 /* Print a warning if a constant expression had overflow in folding.
1530 Invoke this function on every expression that the language
1531 requires to be a constant expression.
1532 Note the ANSI C standard says it is erroneous for a
1533 constant expression to overflow. */
1535 void
1537 {
1545 }
1547 /* The same as above but print an unconditional error. */
1548 void
1550 {
1557 }
1559 /* Print a warning if an expression had overflow in folding and its
1560 operands hadn't.
1562 Invoke this function on every expression that
1563 (1) appears in the source code, and
1564 (2) is a constant expression that overflowed, and
1565 (3) is not already checked by convert_and_check;
1566 however, do not invoke this function on operands of explicit casts
1567 or when the expression is the result of an operator and any operand
1568 already overflowed. */
1570 void
1572 {
1577 {
1606 }
1607 }
1609 /* Warn about uses of logical || / && operator in a context where it
1610 is likely that the bitwise equivalent was intended by the
1611 programmer. We have seen an expression in which CODE is a binary
1612 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1613 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1614 void
1618 {
1630 /* Warn if &&/|| are being used in a context where it is
1631 likely that the bitwise equivalent was intended by the
1632 programmer. That is, an expression such as op && MASK
1633 where op should not be any boolean expression, nor a
1634 constant, and mask seems to be a non-boolean integer constant. */
1642 {
1646 else
1651 }
1653 /* We do not warn for constants because they are typical of macro
1654 expansions that test for features. */
1658 /* This warning only makes sense with logical operands. */
1666 /* We first test whether either side separately is trivially true
1667 (with OR) or trivially false (with AND). If so, do not warn.
1668 This is a common idiom for testing ranges of data types in
1669 portable code. */
1676 /* If this is an OR operation, invert both sides; now, the result
1677 should be always false to get a warning. */
1691 /* If this is an OR operation, invert both sides; now, the result
1692 should be always false to get a warning. */
1700 /* If both expressions have the same operand, if we can merge the
1701 ranges, and if the range test is always false, then warn. */
1708 {
1711 "logical %<or%> "
1713 else
1715 "logical %<and%> "
1717 }
1718 }
1721 /* Warn if EXP contains any computations whose results are not used.
1722 Return true if a warning is printed; false otherwise. LOCUS is the
1723 (potential) location of the expression. */
1725 bool
1727 {
1728 restart:
1732 /* Don't warn about void constructs. This includes casting to void,
1733 void function calls, and statement expressions with a final cast
1734 to void. */
1742 {
1758 /* For a binding, warn if no side effect within it. */
1770 /* In && or ||, warn if 2nd operand has no side effect. */
1777 /* Let people do `(foo (), 0)' without a warning. */
1784 /* If this is an expression with side effects, don't warn; this
1785 case commonly appears in macro expansions. */
1791 /* Don't warn about automatic dereferencing of references, since
1792 the user cannot control it. */
1794 {
1797 }
1798 /* Fall through. */
1801 /* Referencing a volatile value is a side effect, so don't warn. */
1806 /* If this is an expression which has no operands, there is no value
1807 to be unused. There are no such language-independent codes,
1808 but front ends may define such. */
1812 warn:
1814 }
1815 }
1818 /* Print a warning about casts that might indicate violation
1819 of strict aliasing rules if -Wstrict-aliasing is used and
1820 strict aliasing mode is in effect. OTYPE is the original
1821 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1823 bool
1825 {
1826 /* Strip pointer conversion chains and get to the correct original type. */
1834 /* If the type we are casting to is a ref-all pointer
1835 dereferencing it is always valid. */
1842 {
1843 /* Casting the address of an object to non void pointer. Warn
1844 if the cast breaks type based aliasing. */
1846 {
1850 }
1851 else
1852 {
1853 /* warn_strict_aliasing >= 3. This includes the default (3).
1854 Only warn if the cast is dereferenced immediately. */
1855 alias_set_type set1 =
1861 {
1865 }
1868 {
1872 }
1873 }
1874 }
1875 else
1877 {
1878 /* At this level, warn for any conversions, even if an address is
1879 not taken in the same statement. This will likely produce many
1880 false positives, but could be useful to pinpoint problems that
1881 are not revealed at higher levels. */
1886 {
1890 }
1891 }
1894 }
1896 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1897 sizeof as last operand of certain builtins. */
1899 void
1903 {
1907 location_t loc;
1915 {
1919 /* FALLTHRU */
1927 /* FALLTHRU */
1986 }
2014 {
2018 {
2021 "argument to %<sizeof%> in %qD call is the same "
2022 "expression as the destination; did you mean to "
2028 "argument to %<sizeof%> in %qD call is the same "
2029 "expression as the destination; did you mean to "
2031 else
2033 "argument to %<sizeof%> in %qD call is the same "
2034 "expression as the destination; did you mean to "
2037 }
2040 && !strop
2043 {
2045 "argument to %<sizeof%> in %qD call is the same "
2046 "pointer type %qT as the destination; expected %qT "
2050 }
2051 }
2054 {
2058 {
2061 "argument to %<sizeof%> in %qD call is the same "
2062 "expression as the source; did you mean to "
2068 "argument to %<sizeof%> in %qD call is the same "
2069 "expression as the source; did you mean to "
2071 else
2073 "argument to %<sizeof%> in %qD call is the same "
2074 "expression as the source; did you mean to "
2077 }
2080 && !strop
2083 {
2085 "argument to %<sizeof%> in %qD call is the same "
2086 "pointer type %qT as the source; expected %qT "
2090 }
2091 }
2094 {
2098 {
2101 "argument to %<sizeof%> in %qD call is the same "
2102 "expression as the first source; did you mean to "
2108 "argument to %<sizeof%> in %qD call is the same "
2109 "expression as the first source; did you mean to "
2111 else
2113 "argument to %<sizeof%> in %qD call is the same "
2114 "expression as the first source; did you mean to "
2117 }
2120 && !strop
2123 {
2125 "argument to %<sizeof%> in %qD call is the same "
2126 "pointer type %qT as the first source; expected %qT "
2130 }
2131 }
2134 {
2138 {
2141 "argument to %<sizeof%> in %qD call is the same "
2142 "expression as the second source; did you mean to "
2148 "argument to %<sizeof%> in %qD call is the same "
2149 "expression as the second source; did you mean to "
2151 else
2153 "argument to %<sizeof%> in %qD call is the same "
2154 "expression as the second source; did you mean to "
2157 }
2160 && !strop
2163 {
2165 "argument to %<sizeof%> in %qD call is the same "
2166 "pointer type %qT as the second source; expected %qT "
2170 }
2171 }
2173 }
2175 /* Warn for unlikely, improbable, or stupid DECL declarations
2176 of `main'. */
2178 void
2180 {
2181 function_args_iterator iter;
2182 tree type;
2186 {
2187 /* XXX void_type_node belies the abstraction. */
2193 {
2215 "third argument of %q+D should probably be "
2218 }
2219 }
2221 /* It is intentional that this message does not mention the third
2222 argument because it's only mentioned in an appendix of the
2223 standard. */
2227 }
2229 /* True if pointers to distinct types T1 and T2 can be converted to
2230 each other without an explicit cast. Only returns true for opaque
2231 vector types. */
2232 bool
2234 {
2241 }
2243 /* True if vector types T1 and T2 can be converted to each other
2244 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2245 can only be converted with -flax-vector-conversions yet that is not
2246 in effect, emit a note telling the user about that option if such
2247 a note has not previously been emitted. */
2248 bool
2250 {
2258 convertible_lax =
2273 {
2276 "conversions between vectors with differing "
2278 }
2281 }
2283 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2284 and have vector types, V0 has the same type as V1, and the number of
2285 elements of V0, V1, MASK is the same.
2287 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2288 called with two arguments. In this case implementation passes the
2289 first argument twice in order to share the same tree code. This fact
2290 could enable the mask-values being twice the vector length. This is
2291 an implementation accident and this semantics is not guaranteed to
2292 the user. */
2293 tree
2295 {
2296 tree ret;
2302 {
2305 }
2313 {
2317 }
2321 {
2324 }
2327 {
2331 }
2337 {
2339 "argument vector(s) and the mask vector should "
2342 }
2346 {
2350 }
2353 {
2354 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2360 else
2361 {
2364 }
2368 }
2376 }
2378 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2379 to integral type. */
2381 static tree
2383 {
2388 {
2389 /* C++0x scoped enumerations don't implicitly convert to integral
2390 type; if we stripped an explicit conversion to a larger type we
2391 need to replace it so common_type will still work. */
2395 }
2397 }
2399 /* This is a helper function of build_binary_op.
2401 For certain operations if both args were extended from the same
2402 smaller type, do the arithmetic in that type and then extend.
2404 BITWISE indicates a bitwise operation.
2405 For them, this optimization is safe only if
2406 both args are zero-extended or both are sign-extended.
2407 Otherwise, we might change the result.
2408 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2409 but calculated in (unsigned short) it would be (unsigned short)-1.
2410 */
2411 tree
2413 {
2417 tree type;
2419 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2420 excessive narrowing when we call get_narrower below. For
2421 example, suppose that OP0 is of unsigned int extended
2422 from signed char and that RESULT_TYPE is long long int.
2423 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2424 like
2426 (long long int) (unsigned int) signed_char
2428 which get_narrower would narrow down to
2430 (unsigned int) signed char
2432 If we do not cast OP0 first, get_narrower would return
2433 signed_char, which is inconsistent with the case of the
2434 explicit cast. */
2441 /* UNS is 1 if the operation to be done is an unsigned one. */
2444 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2445 but it *requires* conversion to FINAL_TYPE. */
2456 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2458 /* For bitwise operations, signedness of nominal type
2459 does not matter. Consider only how operands were extended. */
2463 /* Note that in all three cases below we refrain from optimizing
2464 an unsigned operation on sign-extended args.
2465 That would not be valid. */
2467 /* Both args variable: if both extended in same way
2468 from same width, do it in that width.
2469 Do it unsigned if args were zero-extended. */
2476 return c_common_signed_or_unsigned_type
2483 && (type
2494 && (type
2502 }
2504 /* Checks if expression EXPR of real/integer type cannot be converted
2505 to the real/integer type TYPE. Function returns true when:
2506 * EXPR is a constant which cannot be exactly converted to TYPE
2507 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2508 for EXPR type and TYPE being both integers or both real.
2509 * EXPR is not a constant of real type and TYPE is an integer.
2510 * EXPR is not a constant of integer type which cannot be
2511 exactly converted to real type.
2512 Function allows conversions between types of different signedness and
2513 does not return true in that case. Function can produce signedness
2514 warnings if PRODUCE_WARNS is true. */
2515 bool
2517 {
2523 {
2524 /* Warn for real constant that is not an exact integer converted
2525 to integer type. */
2528 {
2531 }
2532 /* Warn for an integer constant that does not fit into integer type. */
2536 {
2539 {
2543 }
2545 {
2549 }
2550 else
2552 }
2554 {
2555 /* Warn for an integer constant that does not fit into real type. */
2557 {
2561 }
2562 /* Warn for a real constant that does not fit into a smaller
2563 real type. */
2566 {
2570 }
2571 }
2572 }
2573 else
2574 {
2575 /* Warn for real types converted to integer types. */
2582 {
2583 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2587 /* Don't warn for short y; short x = ((int)y & 0xff); */
2591 {
2592 /* If both args were extended from a shortest type,
2593 use that type if that is safe. */
2600 {
2606 /* If one of the operands is a non-negative constant
2607 that fits in the target type, then the type of the
2608 other operand does not matter. */
2617 /* If constant is unsigned and fits in the target
2618 type, then the result will also fit. */
2620 && unsigned0
2623 && unsigned1
2626 }
2627 }
2628 /* Warn for integer types converted to smaller integer types. */
2632 /* When they are the same width but different signedness,
2633 then the value may change. */
2636 /* Even when converted to a bigger type, if the type is
2637 unsigned but expr is signed, then negative values
2638 will be changed. */
2644 }
2646 /* Warn for integer types converted to real types if and only if
2647 all the range of values of the integer type cannot be
2648 represented by the real type. */
2651 {
2655 /* Don't warn about char y = 0xff; float x = (int) y; */
2667 }
2669 /* Warn for real types converted to smaller real types. */
2674 }
2677 }
2679 /* Warns if the conversion of EXPR to TYPE may alter a value.
2680 This is a helper function for warnings_for_convert_and_check. */
2682 static void
2684 {
2692 {
2705 /* Conversion from boolean to a signed:1 bit-field (which only
2706 can hold the values 0 and -1) doesn't lose information - but
2707 it does change the value. */
2722 {
2723 /* In case of COND_EXPR, we do not care about the type of
2724 COND_EXPR, only about the conversion of each operand. */
2731 }
2738 }
2739 }
2741 /* Produce warnings after a conversion. RESULT is the result of
2742 converting EXPR to TYPE. This is a helper function for
2743 convert_and_check and cp_convert_and_check. */
2745 void
2747 {
2754 {
2755 /* Do not diagnose overflow in a constant expression merely
2756 because a conversion overflowed. */
2761 {
2762 /* This detects cases like converting -129 or 256 to
2763 unsigned char. */
2767 else
2769 }
2773 /* No warning for converting 0x80000000 to int. */
2781 else
2783 }
2788 else
2790 }
2793 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2794 Invoke this function on every expression that is converted implicitly,
2795 i.e. because of language rules and not because of an explicit cast. */
2797 tree
2799 {
2800 tree result;
2801 tree expr_for_warning;
2803 /* Convert from a value with possible excess precision rather than
2804 via the semantic type, but do not warn about values not fitting
2805 exactly in the semantic type. */
2807 {
2813 }
2814 else
2828 }
2829 \f
2830 /* A node in a list that describes references to variables (EXPR), which are
2831 either read accesses if WRITER is zero, or write accesses, in which case
2832 WRITER is the parent of EXPR. */
2833 struct tlist
2834 {
2837 };
2839 /* Used to implement a cache the results of a call to verify_tree. We only
2840 use this for SAVE_EXPRs. */
2841 struct tlist_cache
2842 {
2846 tree expr;
2847 };
2849 /* Obstack to use when allocating tlist structures, and corresponding
2850 firstobj. */
2854 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2855 warnings. */
2857 /* SAVE_EXPRs need special treatment. We process them only once and then
2858 cache the results. */
2870 /* Create a new struct tlist and fill in its fields. */
2873 {
2880 }
2882 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2883 is nonnull, we ignore any node we find which has a writer equal to it. */
2885 static void
2887 {
2889 {
2896 }
2897 }
2899 /* Merge the nodes of ADD into TO. This merging process is done so that for
2900 each variable that already exists in TO, no new node is added; however if
2901 there is a write access recorded in ADD, and an occurrence on TO is only
2902 a read access, then the occurrence in TO will be modified to record the
2903 write. */
2905 static void
2907 {
2914 {
2921 {
2925 }
2927 {
2931 }
2933 }
2934 }
2936 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2937 references in list LIST conflict with it, excluding reads if ONLY writers
2938 is nonzero. */
2940 static void
2943 {
2946 /* Avoid duplicate warnings. */
2952 {
2956 {
2961 }
2963 }
2964 }
2966 /* Given a list LIST of references to variables, find whether any of these
2967 can cause conflicts due to missing sequence points. */
2969 static void
2971 {
2975 {
2978 }
2979 }
2981 /* Return nonzero if X is a tree that can be verified by the sequence point
2982 warnings. */
2983 static int
2985 {
2992 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2993 (lvalue_p) crash on TRY/CATCH. */
3000 /* No point to track non-const calls, they will never satisfy
3001 operand_equal_p. */
3009 }
3011 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3012 static bool
3014 {
3016 }
3018 /* Walk the tree X, and record accesses to variables. If X is written by the
3019 parent tree, WRITER is the parent.
3020 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3021 expression or its only operand forces a sequence point, then everything up
3022 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3023 in PNO_SP.
3024 Once we return, we will have emitted warnings if any subexpression before
3025 such a sequence point could be undefined. On a higher level, however, the
3026 sequence point may not be relevant, and we'll merge the two lists.
3028 Example: (b++, a) + b;
3029 The call that processes the COMPOUND_EXPR will store the increment of B
3030 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3031 processes the PLUS_EXPR will need to merge the two lists so that
3032 eventually, all accesses end up on the same list (and we'll warn about the
3033 unordered subexpressions b++ and b.
3035 A note on merging. If we modify the former example so that our expression
3036 becomes
3037 (b++, b) + a
3038 care must be taken not simply to add all three expressions into the final
3039 PNO_SP list. The function merge_tlist takes care of that by merging the
3040 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3041 way, so that no more than one access to B is recorded. */
3043 static void
3045 tree writer)
3046 {
3051 /* X may be NULL if it is the operand of an empty statement expression
3052 ({ }). */
3056 restart:
3064 {
3096 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3097 two first, to avoid warning for (a ? b++ : b++). */
3113 /* Expressions inside the LHS are not ordered wrt. the sequence points
3114 in the RHS. Example:
3115 *a = (a++, 2)
3116 Despite the fact that the modification of "a" is in the before_sp
3117 list (tmp_before), it conflicts with the use of "a" in the LHS.
3118 We can handle this by adding the contents of tmp_list3
3119 to those of tmp_before, and redoing the collision warnings for that
3120 list. */
3123 /* Exclude the LHS itself here; we first have to merge it into the
3124 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3125 didn't exclude the LHS, we'd get it twice, once as a read and once
3126 as a write. */
3137 /* We need to warn about conflicts among arguments and conflicts between
3138 args and the function address. Side effects of the function address,
3139 however, are not ordered by the sequence point of the call. */
3140 {
3141 call_expr_arg_iterator iter;
3142 tree arg;
3146 {
3151 }
3156 }
3159 /* Scan all the list, e.g. indices of multi dimensional array. */
3161 {
3167 }
3171 {
3178 {
3190 {
3194 }
3197 }
3201 }
3211 /* For other expressions, simply recurse on their operands.
3212 Manual tail recursion for unary expressions.
3213 Other non-expressions need not be processed. */
3215 {
3219 }
3221 {
3225 {
3230 }
3231 }
3233 }
3234 }
3236 /* Try to warn for undefined behavior in EXPR due to missing sequence
3237 points. */
3239 DEBUG_FUNCTION void
3241 {
3247 {
3250 }
3255 }
3256 \f
3257 /* Validate the expression after `case' and apply default promotions. */
3259 static tree
3261 {
3266 /* Promote char or short to int. */
3269 {
3272 }
3277 }
3278 \f
3279 /* See if the case values LOW and HIGH are in the range of the original
3280 type (i.e. before the default conversion to int) of the switch testing
3281 expression.
3282 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3283 the type before promoting it. CASE_LOW_P is a pointer to the lower
3284 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3285 if the case is not a case range.
3286 The caller has to make sure that we are not called with NULL for
3287 CASE_LOW_P (i.e. the default case).
3288 Returns true if the case label is in range of ORIG_TYPE (saturated or
3289 untouched) or false if the label is out of range. */
3291 static bool
3294 {
3299 /* If there was a problem with the original type, do nothing. */
3306 /* Case label is less than minimum for type. */
3309 {
3312 }
3314 /* Case value is greater than maximum for type. */
3317 {
3320 }
3322 /* Saturate lower case label value to minimum. */
3325 {
3329 }
3331 /* Saturate upper case label value to maximum. */
3334 {
3338 }
3346 }
3347 \f
3348 /* Return an integer type with BITS bits of precision,
3349 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3351 tree
3353 {
3392 }
3394 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3395 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3396 and saturating if SATP is nonzero, otherwise not saturating. */
3398 tree
3401 {
3405 else
3413 {
3415 "fixed-point types that have too many integral and "
3418 }
3421 }
3423 /* Used for communication between c_common_type_for_mode and
3424 c_register_builtin_type. */
3427 /* Return a data type that has machine mode MODE.
3428 If the mode is an integer,
3429 then UNSIGNEDP selects between signed and unsigned types.
3430 If the mode is a fixed-point mode,
3431 then UNSIGNEDP selects between saturating and nonsaturating types. */
3433 tree
3435 {
3436 tree t;
3473 #if HOST_BITS_PER_WIDE_INT >= 64
3476 #endif
3501 {
3503 tree inner_type;
3519 }
3521 {
3526 }
3536 {
3622 }
3630 }
3632 tree
3634 {
3636 }
3638 /* Return a signed type the same as TYPE in other respects. */
3640 tree
3642 {
3644 }
3646 /* Return a type the same as TYPE except unsigned or
3647 signed according to UNSIGNEDP. */
3649 tree
3651 {
3652 tree type1;
3654 /* This block of code emulates the behavior of the old
3655 c_common_unsigned_type. In particular, it returns
3656 long_unsigned_type_node if passed a long, even when a int would
3657 have the same size. This is necessary for warnings to work
3658 correctly in archs where sizeof(int) == sizeof(long) */
3661 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3677 #if HOST_BITS_PER_WIDE_INT >= 64
3680 #endif
3690 #define C_COMMON_FIXED_TYPES(NAME) \
3691 if (type1 == short_ ## NAME ## _type_node \
3692 || type1 == unsigned_short_ ## NAME ## _type_node) \
3693 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3694 : short_ ## NAME ## _type_node; \
3695 if (type1 == NAME ## _type_node \
3696 || type1 == unsigned_ ## NAME ## _type_node) \
3697 return unsignedp ? unsigned_ ## NAME ## _type_node \
3698 : NAME ## _type_node; \
3699 if (type1 == long_ ## NAME ## _type_node \
3700 || type1 == unsigned_long_ ## NAME ## _type_node) \
3701 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3702 : long_ ## NAME ## _type_node; \
3703 if (type1 == long_long_ ## NAME ## _type_node \
3704 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3705 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3706 : long_long_ ## NAME ## _type_node;
3708 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3709 if (type1 == NAME ## _type_node \
3710 || type1 == u ## NAME ## _type_node) \
3711 return unsignedp ? u ## NAME ## _type_node \
3712 : NAME ## _type_node;
3714 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3715 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3716 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3717 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3718 : sat_ ## short_ ## NAME ## _type_node; \
3719 if (type1 == sat_ ## NAME ## _type_node \
3720 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3721 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3722 : sat_ ## NAME ## _type_node; \
3723 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3724 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3725 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3726 : sat_ ## long_ ## NAME ## _type_node; \
3727 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3728 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3729 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3730 : sat_ ## long_long_ ## NAME ## _type_node;
3732 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3733 if (type1 == sat_ ## NAME ## _type_node \
3734 || type1 == sat_ ## u ## NAME ## _type_node) \
3735 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3736 : sat_ ## NAME ## _type_node;
3762 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3763 the precision; they have precision set to match their range, but
3764 may use a wider mode to match an ABI. If we change modes, we may
3765 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3766 the precision as well, so as to yield correct results for
3767 bit-field types. C++ does not have these separate bit-field
3768 types, and producing a signed or unsigned variant of an
3769 ENUMERAL_TYPE may cause other problems as well. */
3775 #define TYPE_OK(node) \
3776 (TYPE_MODE (type) == TYPE_MODE (node) \
3777 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3796 #if HOST_BITS_PER_WIDE_INT >= 64
3799 #endif
3808 #undef TYPE_OK
3811 }
3813 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3815 tree
3817 {
3818 /* Extended integer types of the same width as a standard type have
3819 lesser rank, so those of the same width as int promote to int or
3820 unsigned int and are valid for printf formats expecting int or
3821 unsigned int. To avoid such special cases, avoid creating
3822 extended integer types for bit-fields if a standard integer type
3823 is available. */
3840 }
3842 /* The C version of the register_builtin_type langhook. */
3844 void
3846 {
3847 tree decl;
3857 }
3858 \f
3859 /* Print an error message for invalid operands to arith operation
3860 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3861 LOCATION is the location of the message. */
3863 void
3866 {
3870 {
3915 }
3919 }
3920 \f
3921 /* Given an expression as a tree, return its original type. Do this
3922 by stripping any conversion that preserves the sign and precision. */
3923 static tree
3925 {
3928 }
3930 /* Subroutine of build_binary_op, used for comparison operations.
3931 See if the operands have both been converted from subword integer types
3932 and, if so, perhaps change them both back to their original type.
3933 This function is also responsible for converting the two operands
3934 to the proper common type for comparison.
3936 The arguments of this function are all pointers to local variables
3937 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3938 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3940 If this function returns nonzero, it means that the comparison has
3941 a constant value. What this function returns is an expression for
3942 that value. */
3944 tree
3947 {
3948 tree type;
3957 /* Throw away any conversions to wider types
3958 already present in the operands. */
3963 /* If primopN is first sign-extended from primopN's precision to opN's
3964 precision, then zero-extended from opN's precision to
3965 *restype_ptr precision, shortenings might be invalid. */
3968 && !unsignedp0
3973 && !unsignedp1
3977 /* Handle the case that OP0 does not *contain* a conversion
3978 but it *requires* conversion to FINAL_TYPE. */
3985 /* If one of the operands must be floated, we cannot optimize. */
3989 /* If first arg is constant, swap the args (changing operation
3990 so value is preserved), for canonicalization. Don't do this if
3991 the second arg is 0. */
3996 {
4013 {
4028 }
4030 }
4032 /* If comparing an integer against a constant more bits wide,
4033 maybe we can deduce a value of 1 or 0 independent of the data.
4034 Or else truncate the constant now
4035 rather than extend the variable at run time.
4037 This is only interesting if the constant is the wider arg.
4038 Also, it is not safe if the constant is unsigned and the
4039 variable arg is signed, since in this case the variable
4040 would be sign-extended and then regarded as unsigned.
4041 Our technique fails in this case because the lowest/highest
4042 possible unsigned results don't follow naturally from the
4043 lowest/highest possible values of the variable operand.
4044 For just EQ_EXPR and NE_EXPR there is another technique that
4045 could be used: see if the constant can be faithfully represented
4046 in the other operand's type, by truncating it and reextending it
4047 and see if that preserves the constant's value. */
4053 {
4056 /* 1 if comparison is nominally unsigned. */
4058 tree val;
4070 {
4071 /* Convert primop1 to target type, but do not introduce
4072 additional overflow. We know primop1 is an int_cst. */
4076 }
4078 {
4081 }
4084 {
4089 }
4090 else
4091 {
4096 }
4099 /* This used to be a switch, but Genix compiler can't handle that. */
4101 {
4104 }
4106 {
4109 }
4111 {
4116 }
4118 {
4123 }
4125 {
4130 }
4132 {
4137 }
4139 /* If primop0 was sign-extended and unsigned comparison specd,
4140 we did a signed comparison above using the signed type bounds.
4141 But the comparison we output must be unsigned.
4143 Also, for inequalities, VAL is no good; but if the signed
4144 comparison had *any* fixed result, it follows that the
4145 unsigned comparison just tests the sign in reverse
4146 (positive values are LE, negative ones GE).
4147 So we can generate an unsigned comparison
4148 against an extreme value of the signed type. */
4151 {
4154 {
4169 }
4171 }
4175 {
4182 }
4185 {
4186 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4190 }
4192 /* Value is not predetermined, but do the comparison
4193 in the type of the operand that is not constant.
4194 TYPE is already properly set. */
4195 }
4197 /* If either arg is decimal float and the other is float, find the
4198 proper common type to use for comparison. */
4209 /* If args' natural types are both narrower than nominal type
4210 and both extend in the same manner, compare them
4211 in the type of the wider arg.
4212 Otherwise must actually extend both to the nominal
4213 common type lest different ways of extending
4214 alter the result.
4215 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4220 {
4224 type);
4225 /* Make sure shorter operand is extended the right way
4226 to match the longer operand. */
4227 primop0
4230 primop0);
4231 primop1
4234 primop1);
4235 }
4236 else
4237 {
4238 /* Here we must do the comparison on the nominal type
4239 using the args exactly as we received them. */
4246 {
4248 /* All unsigned values are >= 0, so we warn. However,
4249 if OP0 is a constant that is >= 0, the signedness of
4250 the comparison isn't an issue, so suppress the
4251 warning. */
4253 warn_type_limits && !in_system_header
4257 primop0)))
4258 /* Do not warn for enumeration types. */
4262 {
4279 }
4282 {
4283 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4288 }
4289 }
4290 }
4298 }
4299 \f
4300 /* Return a tree for the sum or difference (RESULTCODE says which)
4301 of pointer PTROP and integer INTOP. */
4303 tree
4306 {
4309 /* The result is a pointer of the same type that is being added. */
4312 /* If the pointer lives in UPC shared memory, then
4313 drop the 'shared' qualifier. */
4318 {
4322 }
4324 {
4328 }
4329 else
4332 /* We are manipulating pointer values, so we don't need to warn
4333 about relying on undefined signed overflow. We disable the
4334 warning here because we use integer types so fold won't know that
4335 they are really pointers. */
4338 /* If what we are about to multiply by the size of the elements
4339 contains a constant term, apply distributive law
4340 and multiply that constant term separately.
4341 This helps produce common subexpressions. */
4346 /* If the constant comes from pointer subtraction,
4347 skip this optimization--it would cause an error. */
4349 /* If the constant is unsigned, and smaller than the pointer size,
4350 then we must skip this optimization. This is because it could cause
4351 an overflow error if the constant is negative but INTOP is not. */
4355 {
4360 /* Convert both subexpression types to the type of intop,
4361 because weird cases involving pointer arithmetic
4362 can result in a sum or difference with different type args. */
4367 }
4369 /* Convert the integer argument to a type the same size as sizetype
4370 so the multiply won't overflow spuriously. */
4376 /* Replace the integer argument with a suitable product by the object size.
4377 Do this multiplication as signed, then convert to the appropriate type
4378 for the pointer operation and disregard an overflow that occurred only
4379 because of the sign-extension change in the latter conversion. */
4380 {
4388 }
4390 /* Create the sum or difference. */
4399 }
4400 \f
4401 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4402 and if NON_CONST is known not to be permitted in an evaluated part
4403 of a constant expression. */
4405 tree
4407 {
4411 /* This should never be called for C++. */
4415 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4424 }
4426 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4427 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4428 around the SAVE_EXPR if needed so that c_fully_fold does not need
4429 to look inside SAVE_EXPRs. */
4431 tree
4433 {
4442 }
4444 /* Return whether EXPR is a declaration whose address can never be
4445 NULL. */
4447 bool
4449 {
4454 }
4456 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4457 or for an `if' or `while' statement or ?..: exp. It should already
4458 have been validated to be of suitable type; otherwise, a bad
4459 diagnostic may result.
4461 The EXPR is located at LOCATION.
4463 This preparation consists of taking the ordinary
4464 representation of an expression expr and producing a valid tree
4465 boolean expression describing whether expr is nonzero. We could
4466 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4467 but we optimize comparisons, &&, ||, and !.
4469 The resulting type should always be `truthvalue_type_node'. */
4471 tree
4473 {
4475 {
4517 ? truthvalue_true_node
4523 ? truthvalue_true_node
4528 /* Fall through. */
4531 {
4534 {
4535 /* Common Ada/Pascal programmer's mistake. */
4537 OPT_Waddress,
4539 inner);
4541 }
4543 }
4560 /* These don't change whether an object is nonzero or zero. */
4565 /* These don't change whether an object is zero or nonzero, but
4566 we can't ignore them if their second arg has side-effects. */
4568 {
4571 c_common_truthvalue_conversion
4574 }
4575 else
4580 /* Distribute the conversion into the arms of a COND_EXPR. */
4582 {
4585 /* In C++ one of the arms might have void type if it is throw. */
4593 }
4594 else
4595 {
4596 /* Folding will happen later for C. */
4604 }
4606 CASE_CONVERT:
4607 {
4611 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4612 since that affects how `default_conversion' will behave. */
4616 /* Don't strip a conversion from C++0x scoped enum, since they
4617 don't implicitly convert to other types. */
4621 /* If this isn't narrowing the argument, we can ignore it. */
4625 }
4631 {
4635 }
4640 }
4643 {
4645 expr = (build_binary_op
4649 c_common_truthvalue_conversion
4652 c_common_truthvalue_conversion
4657 }
4660 {
4665 }
4666 else
4669 ret:
4672 }
4673 \f
4682 /* Apply the TYPE_QUALS to the new DECL. */
4684 void
4686 {
4694 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4695 constructor can produce constant init, so rely on cp_finish_decl to
4696 clear TREE_READONLY if the variable has non-constant init. */
4699 {
4702 }
4704 {
4706 /* Allow 'restrict' on arrays of pointers.
4707 FIXME currently we just ignore it. */
4713 }
4715 {
4721 /* The declaration's type should have been previously defined
4722 as a UPC shared type. */
4724 }
4725 }
4727 /* Hash function for the problem of multiple type definitions in
4728 different files. This must hash all types that will compare
4729 equal via comptypes to the same value. In practice it hashes
4730 on some of the simple stuff and leaves the details to comptypes. */
4732 static hashval_t
4734 {
4738 tree t2;
4740 {
4741 /* For pointers, hash on pointee type plus some swizzling. */
4744 /* Hash on number of elements and total size. */
4763 }
4764 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4765 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4767 /* We might have a VLA here. */
4770 else
4773 }
4777 /* Return the typed-based alias set for T, which may be an expression
4778 or a type. Return -1 if we don't do anything special. */
4780 alias_set_type
4782 {
4783 tree u;
4786 /* For VLAs, use the alias set of the element type rather than the
4787 default of alias set 0 for types compared structurally. */
4789 {
4793 }
4795 /* Permit type-punning when accessing a union, provided the access
4796 is directly through the union. For example, this code does not
4797 permit taking the address of a union member and then storing
4798 through it. Even the type-punning allowed here is a GCC
4799 extension, albeit a common and useful one; the C standard says
4800 that such accesses have implementation-defined behavior. */
4808 /* That's all the expressions we handle specially. */
4812 /* The C standard guarantees that any object may be accessed via an
4813 lvalue that has character type. */
4819 /* The C standard specifically allows aliasing between signed and
4820 unsigned variants of the same type. We treat the signed
4821 variant as canonical. */
4823 {
4826 /* t1 == t can happen for boolean nodes which are always unsigned. */
4829 }
4831 /* Handle the case of multiple type nodes referring to "the same" type,
4832 which occurs with IMA. These share an alias set. FIXME: Currently only
4833 C90 is handled. (In C99 type compatibility is not transitive, which
4834 complicates things mightily. The alias set splay trees can theoretically
4835 represent this, but insertion is tricky when you consider all the
4836 different orders things might arrive in.) */
4841 /* Save time if there's only one input file. */
4845 /* Pointers need special handling if they point to any type that
4846 needs special handling (below). */
4848 {
4849 tree t2;
4850 /* Find bottom type under any nested POINTERs. */
4854 ;
4862 }
4863 /* These are the only cases that need special handling. */
4870 /* Undefined? */
4874 /* Look up t in hash table. Only one of the compatible types within each
4875 alias set is recorded in the table. */
4879 NULL);
4882 {
4885 }
4886 else
4887 /* Our caller will assign and record (in t) a new alias set; all we need
4888 to do is remember t in the hash table. */
4892 }
4893 \f
4894 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4895 the second parameter indicates which OPERATOR is being applied.
4896 The COMPLAIN flag controls whether we should diagnose possibly
4897 ill-formed constructs or not. LOC is the location of the SIZEOF or
4898 TYPEOF operator. */
4900 tree
4903 {
4911 {
4913 {
4920 }
4921 else
4922 {
4924 {
4928 else
4931 }
4933 }
4934 }
4936 {
4938 {
4945 }
4946 else
4949 }
4952 {
4957 }
4960 {
4965 }
4966 else
4967 {
4969 /* Convert in case a char is more than one unit. */
4973 else
4975 }
4980 {
4983 }
4985 /* VALUE will have the middle-end integer type sizetype.
4986 However, we should really return a value of type `size_t',
4987 which is just a typedef for an ordinary integer type. */
4991 }
4993 /* Implement the __alignof keyword: Return the minimum required
4994 alignment of EXPR, measured in bytes. For VAR_DECLs,
4995 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4996 from an "aligned" __attribute__ specification). LOC is the
4997 location of the ALIGNOF operator. */
4999 tree
5001 {
5002 tree t;
5009 {
5012 }
5018 {
5025 {
5032 }
5034 }
5035 else
5039 }
5040 \f
5041 /* Handle C and C++ default attributes. */
5043 enum built_in_attribute
5044 {
5045 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5046 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5047 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5048 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5049 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5051 #undef DEF_ATTR_NULL_TREE
5052 #undef DEF_ATTR_INT
5053 #undef DEF_ATTR_STRING
5054 #undef DEF_ATTR_IDENT
5055 #undef DEF_ATTR_TREE_LIST
5056 ATTR_LAST
5057 };
5063 enum c_builtin_type
5064 {
5065 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5066 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5067 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5068 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5069 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5070 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5071 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5072 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5073 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5074 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5075 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5076 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5077 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5078 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5079 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5080 NAME,
5081 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5083 #undef DEF_PRIMITIVE_TYPE
5084 #undef DEF_FUNCTION_TYPE_0
5085 #undef DEF_FUNCTION_TYPE_1
5086 #undef DEF_FUNCTION_TYPE_2
5087 #undef DEF_FUNCTION_TYPE_3
5088 #undef DEF_FUNCTION_TYPE_4
5089 #undef DEF_FUNCTION_TYPE_5
5090 #undef DEF_FUNCTION_TYPE_6
5091 #undef DEF_FUNCTION_TYPE_7
5092 #undef DEF_FUNCTION_TYPE_VAR_0
5093 #undef DEF_FUNCTION_TYPE_VAR_1
5094 #undef DEF_FUNCTION_TYPE_VAR_2
5095 #undef DEF_FUNCTION_TYPE_VAR_3
5096 #undef DEF_FUNCTION_TYPE_VAR_4
5097 #undef DEF_FUNCTION_TYPE_VAR_5
5098 #undef DEF_POINTER_TYPE
5099 BT_LAST
5100 };
5104 /* A temporary array for c_common_nodes_and_builtins. Used in
5105 communication with def_fn_type. */
5108 /* A helper function for c_common_nodes_and_builtins. Build function type
5109 for DEF with return type RET and N arguments. If VAR is true, then the
5110 function should be variadic after those N arguments.
5112 Takes special care not to ICE if any of the types involved are
5113 error_mark_node, which indicates that said type is not in fact available
5114 (see builtin_type_for_size). In which case the function type as a whole
5115 should be error_mark_node. */
5117 static void
5119 {
5120 tree t;
5127 {
5133 }
5140 else
5143 egress:
5146 }
5148 /* Build builtin functions common to both C and C++ language
5149 frontends. */
5151 static void
5153 {
5154 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5155 builtin_types[ENUM] = VALUE;
5156 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5157 def_fn_type (ENUM, RETURN, 0, 0);
5158 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5159 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5160 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5161 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5162 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5163 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5164 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5165 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5166 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5167 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5168 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5169 ARG6) \
5170 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5171 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5172 ARG6, ARG7) \
5173 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5174 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5175 def_fn_type (ENUM, RETURN, 1, 0);
5176 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5177 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5178 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5179 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5180 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5181 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5182 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5183 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5184 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5185 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5186 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5187 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5191 #undef DEF_PRIMITIVE_TYPE
5192 #undef DEF_FUNCTION_TYPE_1
5193 #undef DEF_FUNCTION_TYPE_2
5194 #undef DEF_FUNCTION_TYPE_3
5195 #undef DEF_FUNCTION_TYPE_4
5196 #undef DEF_FUNCTION_TYPE_5
5197 #undef DEF_FUNCTION_TYPE_6
5198 #undef DEF_FUNCTION_TYPE_VAR_0
5199 #undef DEF_FUNCTION_TYPE_VAR_1
5200 #undef DEF_FUNCTION_TYPE_VAR_2
5201 #undef DEF_FUNCTION_TYPE_VAR_3
5202 #undef DEF_FUNCTION_TYPE_VAR_4
5203 #undef DEF_FUNCTION_TYPE_VAR_5
5204 #undef DEF_POINTER_TYPE
5209 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5210 NONANSI_P, ATTRS, IMPLICIT, COND) \
5211 if (NAME && COND) \
5212 def_builtin_1 (ENUM, NAME, CLASS, \
5213 builtin_types[(int) TYPE], \
5214 builtin_types[(int) LIBTYPE], \
5215 BOTH_P, FALLBACK_P, NONANSI_P, \
5216 built_in_attributes[(int) ATTRS], IMPLICIT);
5218 #undef DEF_BUILTIN
5226 }
5228 /* Like get_identifier, but avoid warnings about null arguments when
5229 the argument may be NULL for targets where GCC lacks stdint.h type
5230 information. */
5234 {
5236 }
5238 /* Build tree nodes and builtin functions common to both C and C++ language
5239 frontends. */
5241 void
5243 {
5247 tree array_domain_type;
5248 tree va_list_ref_type_node;
5249 tree va_list_arg_type_node;
5253 /* Define `int' and `char' first so that dbx will output them first. */
5257 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5258 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5259 but not C. Are the conditionals here needed? */
5265 long_unsigned_type_node);
5267 {
5269 int128_integer_type_node);
5271 int128_unsigned_type_node);
5272 }
5276 long_long_integer_type_node);
5278 long_long_unsigned_type_node);
5281 long_long_unsigned_type_node);
5284 short_unsigned_type_node);
5287 short_unsigned_type_node);
5289 /* Define both `signed char' and `unsigned char'. */
5293 /* These are types that c_common_type_for_size and
5294 c_common_type_for_mode use. */
5297 intQI_type_node));
5300 intHI_type_node));
5303 intSI_type_node));
5306 intDI_type_node));
5307 #if HOST_BITS_PER_WIDE_INT >= 64
5310 TYPE_DECL,
5312 intTI_type_node));
5313 #endif
5316 unsigned_intQI_type_node));
5319 unsigned_intHI_type_node));
5322 unsigned_intSI_type_node));
5325 unsigned_intDI_type_node));
5326 #if HOST_BITS_PER_WIDE_INT >= 64
5329 TYPE_DECL,
5331 unsigned_intTI_type_node));
5332 #endif
5334 /* Create the widest literal types. */
5335 widest_integer_literal_type_node
5339 widest_integer_literal_type_node));
5341 widest_unsigned_literal_type_node
5345 widest_unsigned_literal_type_node));
5349 pid_type_node =
5356 /* Only supported decimal floating point extension if the target
5357 actually supports underlying modes. */
5361 {
5365 }
5368 {
5373 long_long_fract_type_node);
5375 unsigned_short_fract_type_node);
5377 unsigned_fract_type_node);
5379 unsigned_long_fract_type_node);
5381 unsigned_long_long_fract_type_node);
5383 sat_short_fract_type_node);
5386 sat_long_fract_type_node);
5388 sat_long_long_fract_type_node);
5390 sat_unsigned_short_fract_type_node);
5392 sat_unsigned_fract_type_node);
5394 sat_unsigned_long_fract_type_node);
5396 sat_unsigned_long_long_fract_type_node);
5401 long_long_accum_type_node);
5403 unsigned_short_accum_type_node);
5405 unsigned_accum_type_node);
5407 unsigned_long_accum_type_node);
5409 unsigned_long_long_accum_type_node);
5411 sat_short_accum_type_node);
5414 sat_long_accum_type_node);
5416 sat_long_long_accum_type_node);
5418 sat_unsigned_short_accum_type_node);
5420 sat_unsigned_accum_type_node);
5422 sat_unsigned_long_accum_type_node);
5424 sat_unsigned_long_long_accum_type_node);
5426 }
5429 TYPE_DECL,
5431 complex_integer_type_node));
5433 TYPE_DECL,
5435 complex_float_type_node));
5437 TYPE_DECL,
5439 complex_double_type_node));
5443 complex_long_double_type_node));
5446 /* For C++, make fileptr_type_node a distinct void * type until
5447 FILE type is defined. */
5452 /* Set the TYPE_NAME for any variants that were built before
5453 record_builtin_type gave names to the built-in types. */
5454 {
5460 }
5462 /* This node must not be shared. */
5468 /* Make a type to be the domain of a few array types
5469 whose domains don't really matter.
5470 200 is small enough that it always fits in size_t
5471 and large enough that it can hold most function names for the
5472 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5475 /* Make a type for arrays of characters.
5476 With luck nothing will ever really depend on the length of this
5477 array type. */
5478 char_array_type_node
5481 /* Likewise for arrays of ints. */
5482 int_array_type_node
5486 const_string_type_node
5490 /* This is special for C++ so functions can be overloaded. */
5496 {
5499 else
5502 }
5504 /* This is for wide string constants. */
5505 wchar_array_type_node
5508 /* Define 'char16_t'. */
5513 {
5518 }
5520 /* This is for UTF-16 string constants. */
5521 char16_array_type_node
5524 /* Define 'char32_t'. */
5529 {
5534 }
5536 /* This is for UTF-32 string constants. */
5537 char32_array_type_node
5540 wint_type_node =
5543 intmax_type_node =
5545 uintmax_type_node =
5549 sig_atomic_type_node =
5552 int8_type_node =
5555 int16_type_node =
5558 int32_type_node =
5561 int64_type_node =
5564 uint8_type_node =
5567 c_uint16_type_node =
5570 c_uint32_type_node =
5573 c_uint64_type_node =
5576 int_least8_type_node =
5579 int_least16_type_node =
5582 int_least32_type_node =
5585 int_least64_type_node =
5588 uint_least8_type_node =
5591 uint_least16_type_node =
5594 uint_least32_type_node =
5597 uint_least64_type_node =
5600 int_fast8_type_node =
5603 int_fast16_type_node =
5606 int_fast32_type_node =
5609 int_fast64_type_node =
5612 uint_fast8_type_node =
5615 uint_fast16_type_node =
5618 uint_fast32_type_node =
5621 uint_fast64_type_node =
5624 intptr_type_node =
5627 uintptr_type_node =
5630 default_function_type
5632 ptrdiff_type_node
5639 va_list_type_node));
5641 {
5644 tree ptype;
5647 {
5651 ptype));
5653 }
5654 }
5657 {
5660 }
5661 else
5662 {
5665 }
5672 /* Create the built-in __null node. It is important that this is
5673 not shared. */
5677 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5679 }
5681 /* The number of named compound-literals generated thus far. */
5684 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5686 void
5688 {
5691 compound_literal_number);
5692 compound_literal_number++;
5694 }
5696 tree
5698 {
5702 }
5705 /* Linked list of disabled built-in functions. */
5708 {
5716 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5717 begins with "__builtin_", give an error. */
5719 void
5721 {
5724 else
5725 {
5730 }
5731 }
5734 /* Return true if the built-in function NAME has been disabled, false
5735 otherwise. */
5737 static bool
5739 {
5742 {
5745 }
5747 }
5750 /* Worker for DEF_BUILTIN.
5751 Possibly define a builtin function with one or two names.
5752 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5753 nonansi_p and flag_no_nonansi_builtin. */
5755 static void
5762 {
5763 tree decl;
5776 fnattrs);
5785 }
5786 \f
5787 /* Nonzero if the type T promotes to int. This is (nearly) the
5788 integral promotions defined in ISO C99 6.3.1.1/2. */
5790 bool
5792 {
5794 {
5804 /* ??? Technically all enumerations not larger than an int
5805 promote to an int. But this is used along code paths
5806 that only want to notice a size change. */
5814 }
5815 }
5817 /* Return 1 if PARMS specifies a fixed number of parameters
5818 and none of their types is affected by default promotions. */
5820 int
5822 {
5823 const_tree t;
5825 {
5842 }
5844 }
5846 /* Recursively remove any '*' or '&' operator from TYPE. */
5847 tree
5849 {
5853 }
5855 /* Recursively remove pointer or array type from TYPE. */
5856 tree
5858 {
5862 }
5864 /* Used to compare case labels. K1 and K2 are actually tree nodes
5865 representing case labels, or NULL_TREE for a `default' label.
5866 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5867 K2, and 0 if K1 and K2 are equal. */
5869 int
5871 {
5872 /* Consider a NULL key (such as arises with a `default' label) to be
5873 smaller than anything else. */
5880 }
5882 /* Process a case label, located at LOC, for the range LOW_VALUE
5883 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5884 then this case label is actually a `default' label. If only
5885 HIGH_VALUE is NULL_TREE, then case label was declared using the
5886 usual C/C++ syntax, rather than the GNU case range extension.
5887 CASES is a tree containing all the case ranges processed so far;
5888 COND is the condition for the switch-statement itself. Returns the
5889 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5890 is created. */
5892 tree
5895 {
5896 tree type;
5897 tree label;
5898 tree case_label;
5899 splay_tree_node node;
5901 /* Create the LABEL_DECL itself. */
5904 /* If there was an error processing the switch condition, bail now
5905 before we get more confused. */
5913 {
5916 }
5918 /* Case ranges are a GNU extension. */
5925 {
5930 }
5932 {
5937 }
5940 {
5941 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5942 really a case range, even though it was written that way.
5943 Remove the HIGH_VALUE to simplify later processing. */
5948 }
5950 /* See if the case is in range of the type of the original testing
5951 expression. If both low_value and high_value are out of range,
5952 don't insert the case label and return NULL_TREE. */
5958 /* Look up the LOW_VALUE in the table of case labels we already
5959 have. */
5961 /* If there was not an exact match, check for overlapping ranges.
5962 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5963 that's a `default' label and the only overlap is an exact match. */
5965 {
5966 splay_tree_node low_bound;
5967 splay_tree_node high_bound;
5969 /* Even though there wasn't an exact match, there might be an
5970 overlap between this case range and another case range.
5971 Since we've (inductively) not allowed any overlapping case
5972 ranges, we simply need to find the greatest low case label
5973 that is smaller that LOW_VALUE, and the smallest low case
5974 label that is greater than LOW_VALUE. If there is an overlap
5975 it will occur in one of these two ranges. */
5981 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5982 the LOW_VALUE, so there is no need to check unless the
5983 LOW_BOUND is in fact itself a case range. */
5989 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5990 range is bigger than the low end of the current range, so we
5991 are only interested if the current range is a real range, and
5992 not an ordinary case label. */
5994 && high_value
5996 high_value)
5999 }
6000 /* If there was an overlap, issue an error. */
6002 {
6006 {
6010 }
6012 {
6015 }
6016 else
6017 {
6021 }
6023 }
6025 /* Add a CASE_LABEL to the statement-tree. */
6027 /* Register this case label in the splay tree. */
6034 error_out:
6035 /* Add a label so that the back-end doesn't think that the beginning of
6036 the switch is unreachable. Note that we do not add a case label, as
6037 that just leads to duplicates and thence to failure later on. */
6039 {
6042 }
6044 }
6046 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6047 Used to verify that case values match up with enumerator values. */
6049 static void
6051 {
6054 /* ??? Not working too hard to print the double-word value.
6055 Should perhaps be done with %lwd in the diagnostic routines? */
6064 else
6073 buf);
6074 else
6079 }
6081 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6082 Used to verify that case values match up with enumerator values. */
6084 static int
6086 {
6090 /* Skip default case. */
6094 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6095 when we did our enum->case scan. Reset our scratch bit after. */
6098 else
6101 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6102 not set, that means that CASE_HIGH did not appear when we did our
6103 enum->case scan. Reset our scratch bit after. */
6105 {
6108 else
6110 }
6113 }
6115 /* Handle -Wswitch*. Called from the front end after parsing the
6116 switch construct. */
6117 /* ??? Should probably be somewhere generic, since other languages
6118 besides C and C++ would want this. At the moment, however, C/C++
6119 are the only tree-ssa languages that support enumerations at all,
6120 so the point is moot. */
6122 void
6125 {
6126 splay_tree_node default_node;
6127 splay_tree_node node;
6128 tree chain;
6138 /* From here on, we only care about about enumerated types. */
6142 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6146 /* Check the cases. Warn about case values which are not members of
6147 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6148 there is no default case, check that exactly all enumeration
6149 literals are covered by the cases. */
6151 /* Clearing COND if it is not an integer constant simplifies
6152 the tests inside the loop below. */
6156 /* The time complexity here is O(N*lg(N)) worst case, but for the
6157 common case of monotonically increasing enumerators, it is
6158 O(N), since the nature of the splay tree will keep the next
6159 element adjacent to the root at all times. */
6162 {
6168 {
6169 /* Mark the CASE_LOW part of the case entry as seen. */
6173 }
6175 /* Even though there wasn't an exact match, there might be a
6176 case range which includes the enumerator's value. */
6179 {
6183 {
6184 /* If we match the upper bound exactly, mark the CASE_HIGH
6185 part of the case entry as seen. */
6189 }
6190 }
6192 /* We've now determined that this enumerated literal isn't
6193 handled by the case labels of the switch statement. */
6195 /* If the switch expression is a constant, we only really care
6196 about whether that constant is handled by the switch. */
6200 /* If there is a default_node, the only relevant option is
6201 Wswitch-enum. Otherwise, if both are enabled then we prefer
6202 to warn using -Wswitch because -Wswitch is enabled by -Wall
6203 while -Wswitch-enum is explicit. */
6206 ? OPT_Wswitch_enum
6210 }
6212 /* Warn if there are case expressions that don't correspond to
6213 enumerators. This can occur since C and C++ don't enforce
6214 type-checking of assignments to enumeration variables.
6216 The time complexity here is now always O(N) worst case, since
6217 we should have marked both the lower bound and upper bound of
6218 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6219 above. This scan also resets those fields. */
6222 }
6224 /* Finish an expression taking the address of LABEL (an
6225 IDENTIFIER_NODE). Returns an expression for the address.
6227 LOC is the location for the expression returned. */
6229 tree
6231 {
6232 tree result;
6242 else
6243 {
6246 /* The current function is not necessarily uninlinable.
6247 Computed gotos are incompatible with inlining, but the value
6248 here could be used only in a diagnostic, for example. */
6250 }
6253 }
6254 \f
6256 /* Given a boolean expression ARG, return a tree representing an increment
6257 or decrement (as indicated by CODE) of ARG. The front end must check for
6258 invalid cases (e.g., decrement in C++). */
6259 tree
6261 {
6262 tree val;
6267 {
6290 }
6293 }
6294 \f
6295 /* Built-in macros for stddef.h and stdint.h, that require macros
6296 defined in this file. */
6297 void
6299 {
6362 }
6364 static void
6366 {
6367 /* Fill in the built_in_attributes array. */
6368 #define DEF_ATTR_NULL_TREE(ENUM) \
6369 built_in_attributes[(int) ENUM] = NULL_TREE;
6370 #define DEF_ATTR_INT(ENUM, VALUE) \
6371 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6372 #define DEF_ATTR_STRING(ENUM, VALUE) \
6373 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6374 #define DEF_ATTR_IDENT(ENUM, STRING) \
6375 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6376 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6377 built_in_attributes[(int) ENUM] \
6378 = tree_cons (built_in_attributes[(int) PURPOSE], \
6379 built_in_attributes[(int) VALUE], \
6380 built_in_attributes[(int) CHAIN]);
6382 #undef DEF_ATTR_NULL_TREE
6383 #undef DEF_ATTR_INT
6384 #undef DEF_ATTR_IDENT
6385 #undef DEF_ATTR_TREE_LIST
6386 }
6388 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6389 identifier as an argument, so the front end shouldn't look it up. */
6391 bool
6393 {
6396 /* Unknown attribute that we'll end up ignoring, return true so we
6397 don't complain about an identifier argument. */
6403 else
6405 }
6407 /* Attribute handlers common to C front ends. */
6409 /* Handle a "packed" attribute; arguments as in
6410 struct attribute_spec.handler. */
6412 static tree
6415 {
6417 {
6421 }
6423 {
6425 /* Still pack bitfields. */
6430 else
6432 }
6433 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6434 used for DECL_REGISTER. It wouldn't mean anything anyway.
6435 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6436 that changes what the typedef is typing. */
6437 else
6438 {
6441 }
6444 }
6446 /* Handle a "nocommon" attribute; arguments as in
6447 struct attribute_spec.handler. */
6449 static tree
6453 {
6456 else
6457 {
6460 }
6463 }
6465 /* Handle a "common" attribute; arguments as in
6466 struct attribute_spec.handler. */
6468 static tree
6471 {
6474 else
6475 {
6478 }
6481 }
6483 /* Handle a "noreturn" attribute; arguments as in
6484 struct attribute_spec.handler. */
6486 static tree
6489 {
6492 /* See FIXME comment in c_common_attribute_table. */
6499 = build_pointer_type
6502 else
6503 {
6506 }
6509 }
6511 /* Handle a "hot" and attribute; arguments as in
6512 struct attribute_spec.handler. */
6514 static tree
6517 {
6520 {
6522 {
6526 }
6527 /* Most of the rest of the hot processing is done later with
6528 lookup_attribute. */
6529 }
6530 else
6531 {
6534 }
6537 }
6539 /* Handle a "cold" and attribute; arguments as in
6540 struct attribute_spec.handler. */
6542 static tree
6545 {
6548 {
6550 {
6554 }
6555 /* Most of the rest of the cold processing is done later with
6556 lookup_attribute. */
6557 }
6558 else
6559 {
6562 }
6565 }
6567 /* Handle a "no_sanitize_address" attribute; arguments as in
6568 struct attribute_spec.handler. */
6570 static tree
6573 {
6575 {
6578 }
6581 }
6583 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6584 struct attribute_spec.handler. */
6586 static tree
6589 {
6598 }
6600 /* Handle a "noinline" attribute; arguments as in
6601 struct attribute_spec.handler. */
6603 static tree
6607 {
6610 else
6611 {
6614 }
6617 }
6619 /* Handle a "noclone" attribute; arguments as in
6620 struct attribute_spec.handler. */
6622 static tree
6626 {
6628 {
6631 }
6634 }
6636 /* Handle a "always_inline" attribute; arguments as in
6637 struct attribute_spec.handler. */
6639 static tree
6644 {
6646 {
6647 /* Set the attribute and mark it for disregarding inline
6648 limits. */
6650 }
6651 else
6652 {
6655 }
6658 }
6660 /* Handle a "gnu_inline" attribute; arguments as in
6661 struct attribute_spec.handler. */
6663 static tree
6668 {
6670 {
6671 /* Do nothing else, just set the attribute. We'll get at
6672 it later with lookup_attribute. */
6673 }
6674 else
6675 {
6678 }
6681 }
6683 /* Handle a "leaf" attribute; arguments as in
6684 struct attribute_spec.handler. */
6686 static tree
6690 {
6692 {
6695 }
6697 {
6700 }
6703 }
6705 /* Handle an "artificial" attribute; arguments as in
6706 struct attribute_spec.handler. */
6708 static tree
6713 {
6715 {
6716 /* Do nothing else, just set the attribute. We'll get at
6717 it later with lookup_attribute. */
6718 }
6719 else
6720 {
6723 }
6726 }
6728 /* Handle a "flatten" attribute; arguments as in
6729 struct attribute_spec.handler. */
6731 static tree
6733 tree args ATTRIBUTE_UNUSED,
6735 {
6737 /* Do nothing else, just set the attribute. We'll get at
6738 it later with lookup_attribute. */
6739 ;
6740 else
6741 {
6744 }
6747 }
6749 /* Handle a "warning" or "error" attribute; arguments as in
6750 struct attribute_spec.handler. */
6752 static tree
6755 {
6758 /* Do nothing else, just set the attribute. We'll get at
6759 it later with lookup_attribute. */
6760 ;
6761 else
6762 {
6765 }
6768 }
6770 /* Handle a "used" attribute; arguments as in
6771 struct attribute_spec.handler. */
6773 static tree
6776 {
6782 {
6787 }
6788 else
6789 {
6792 }
6795 }
6797 /* Handle a "unused" attribute; arguments as in
6798 struct attribute_spec.handler. */
6800 static tree
6803 {
6805 {
6813 {
6818 }
6819 else
6820 {
6823 }
6824 }
6825 else
6826 {
6830 }
6833 }
6835 /* Handle a "externally_visible" attribute; arguments as in
6836 struct attribute_spec.handler. */
6838 static tree
6843 {
6847 {
6850 {
6854 }
6855 }
6856 else
6857 {
6860 }
6863 }
6865 /* Handle a "const" attribute; arguments as in
6866 struct attribute_spec.handler. */
6868 static tree
6871 {
6874 /* See FIXME comment on noreturn in c_common_attribute_table. */
6880 = build_pointer_type
6883 else
6884 {
6887 }
6890 }
6892 /* Handle a "transparent_union" attribute; arguments as in
6893 struct attribute_spec.handler. */
6895 static tree
6899 {
6900 tree type;
6911 {
6912 /* Make sure that the first field will work for a transparent union.
6913 If the type isn't complete yet, leave the check to the code in
6914 finish_struct. */
6916 {
6922 }
6925 {
6926 /* If the type isn't complete yet, setting the flag
6927 on a variant wouldn't ever be checked. */
6931 /* build_duplicate_type doesn't work for C++. */
6935 /* A type variant isn't good enough, since we don't a cast
6936 to such a type removed as a no-op. */
6938 }
6942 }
6944 ignored:
6947 }
6949 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6950 get the requested priority for a constructor or destructor,
6951 possibly issuing diagnostics for invalid or reserved
6952 priorities. */
6954 static priority_type
6956 {
6957 HOST_WIDE_INT pri;
6958 tree arg;
6964 {
6967 else
6970 }
6983 {
6986 "destructor priorities from 0 to %d are reserved "
6988 MAX_RESERVED_INIT_PRIORITY);
6989 else
6991 "constructor priorities from 0 to %d are reserved "
6993 MAX_RESERVED_INIT_PRIORITY);
6994 }
6997 invalid:
7000 MAX_INIT_PRIORITY);
7001 else
7003 MAX_INIT_PRIORITY);
7005 }
7007 /* Handle a "constructor" attribute; arguments as in
7008 struct attribute_spec.handler. */
7010 static tree
7014 {
7021 {
7022 priority_type priority;
7027 }
7028 else
7029 {
7032 }
7035 }
7037 /* Handle a "destructor" attribute; arguments as in
7038 struct attribute_spec.handler. */
7040 static tree
7044 {
7051 {
7052 priority_type priority;
7057 }
7058 else
7059 {
7062 }
7065 }
7067 /* Nonzero if the mode is a valid vector mode for this architecture.
7068 This returns nonzero even if there is no hardware support for the
7069 vector mode, but we can emulate with narrower modes. */
7071 static int
7073 {
7077 /* Doh! What's going on? */
7086 /* Hardware support. Woo hoo! */
7092 /* We should probably return 1 if requesting V4DI and we have no DI,
7093 but we have V2DI, but this is probably very unlikely. */
7095 /* If we have support for the inner mode, we can safely emulate it.
7096 We may not have V2DI, but me can emulate with a pair of DIs. */
7098 }
7101 /* Handle a "mode" attribute; arguments as in
7102 struct attribute_spec.handler. */
7104 static tree
7107 {
7115 else
7116 {
7121 tree typefm;
7126 {
7132 }
7134 /* Change this type to have a type with the specified mode.
7135 First check for the special modes. */
7148 else
7151 {
7154 }
7157 {
7160 }
7164 {
7196 }
7198 {
7201 }
7204 {
7209 {
7212 }
7216 else
7219 }
7220 else
7221 {
7222 /* For fixed-point modes, we need to test if the signness of type
7223 and the machine mode are consistent. */
7226 {
7229 }
7230 /* For fixed-point modes, we need to pass saturating info. */
7234 }
7237 {
7240 }
7242 {
7243 /* For enumeral types, copy the precision from the integer
7244 type returned above. If not an INTEGER_TYPE, we can't use
7245 this mode for this type. */
7247 {
7250 }
7253 {
7256 }
7257 else
7258 {
7259 /* We cannot build a type variant, as there's code that assumes
7260 that TYPE_MAIN_VARIANT has the same mode. This includes the
7261 debug generators. Instead, create a subrange type. This
7262 results in all of the enumeral values being emitted only once
7263 in the original, and the subtype gets them by reference. */
7266 else
7269 }
7270 }
7274 {
7277 }
7280 }
7283 }
7285 /* Handle a "section" attribute; arguments as in
7286 struct attribute_spec.handler. */
7288 static tree
7291 {
7295 {
7301 {
7305 {
7307 "section attribute cannot be specified for "
7310 }
7312 /* The decl may have already been given a section attribute
7313 from a previous declaration. Ensure they match. */
7317 {
7321 }
7325 {
7328 }
7329 else
7331 }
7332 else
7333 {
7336 }
7337 }
7338 else
7339 {
7343 }
7346 }
7348 /* Check whether ALIGN is a valid user-specified alignment. If so,
7349 return its base-2 log; if not, output an error and return -1. If
7350 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7351 no error. */
7352 int
7354 {
7359 {
7362 }
7367 {
7370 }
7372 {
7375 }
7377 }
7379 /*
7380 If in c++-11, check if the c++-11 alignment constraint with respect
7381 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7382 c++-11 mode, does nothing.
7384 [dcl.align]2/ says:
7386 [* if the constant expression evaluates to a fundamental alignment,
7387 the alignment requirement of the declared entity shall be the
7388 specified fundamental alignment.
7390 * if the constant expression evaluates to an extended alignment
7391 and the implementation supports that alignment in the context
7392 of the declaration, the alignment of the declared entity shall
7393 be that alignment
7395 * if the constant expression evaluates to an extended alignment
7396 and the implementation does not support that alignment in the
7397 context of the declaration, the program is ill-formed]. */
7399 static bool
7403 {
7416 {
7418 {
7419 /* For file scope variables and static members, the target
7420 supports alignments that are at most
7421 MAX_OFILE_ALIGNMENT. */
7424 }
7425 else
7426 {
7427 #ifdef BIGGEST_FIELD_ALIGNMENT
7428 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7429 #else
7430 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7431 #endif
7432 /* For non-static members, the target supports either
7433 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7434 if it is defined or BIGGEST_ALIGNMENT. */
7439 #undef MAX_TARGET_FIELD_ALIGNMENT
7440 /* For stack variables, the target supports at most
7441 MAX_STACK_ALIGNMENT. */
7445 }
7446 }
7448 {
7449 /* Let's be liberal for types. */
7452 }
7460 }
7462 /* Handle a "aligned" attribute; arguments as in
7463 struct attribute_spec.handler. */
7465 static tree
7468 {
7477 {
7481 }
7489 {
7492 /* If we have a TYPE_DECL, then copy the type, so that we
7493 don't accidentally modify a builtin type. See pushdecl. */
7496 {
7503 }
7504 else
7509 }
7512 {
7515 }
7518 /* C++-11 [dcl.align/4]:
7520 When multiple alignment-specifiers are specified for an
7521 entity, the alignment requirement shall be set to the
7522 strictest specified alignment.
7524 This formally comes from the c++11 specification but we are
7525 doing it for the GNU attribute syntax as well. */
7529 {
7534 else
7538 }
7539 else
7540 {
7543 }
7546 }
7548 /* Handle a "weak" attribute; arguments as in
7549 struct attribute_spec.handler. */
7551 static tree
7556 {
7559 {
7562 }
7564 {
7568 }
7572 else
7576 }
7578 /* Handle an "alias" or "ifunc" attribute; arguments as in
7579 struct attribute_spec.handler, except that IS_ALIAS tells us
7580 whether this is an alias as opposed to ifunc attribute. */
7582 static tree
7585 {
7590 {
7593 }
7597 /* A static variable declaration is always a tentative definition,
7598 but the alias is a non-tentative definition which overrides. */
7601 {
7605 }
7609 {
7613 }
7615 /* Note that the very first time we process a nested declaration,
7616 decl_function_context will not be set. Indeed, *would* never
7617 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7618 we do below. After such frobbery, pushdecl would set the context.
7619 In any case, this is never what we want. */
7621 {
7622 tree id;
7626 {
7630 }
7632 /* This counts as a use of the object pointed to. */
7637 else
7638 {
7641 else
7644 }
7647 /* ifuncs are also aliases, so set that attribute too. */
7650 }
7651 else
7652 {
7655 }
7658 }
7660 /* Handle an "alias" or "ifunc" attribute; arguments as in
7661 struct attribute_spec.handler. */
7663 static tree
7666 {
7668 }
7670 /* Handle an "alias" or "ifunc" attribute; arguments as in
7671 struct attribute_spec.handler. */
7673 static tree
7676 {
7678 }
7680 /* Handle a "weakref" attribute; arguments as in struct
7681 attribute_spec.handler. */
7683 static tree
7686 {
7689 /* We must ignore the attribute when it is associated with
7690 local-scoped decls, since attribute alias is ignored and many
7691 such symbols do not even have a DECL_WEAK field. */
7693 || current_function_decl
7695 {
7699 }
7702 {
7706 }
7708 /* The idea here is that `weakref("name")' mutates into `weakref,
7709 alias("name")', and weakref without arguments, in turn,
7710 implicitly adds weak. */
7713 {
7720 }
7721 else
7722 {
7727 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7728 and that isn't supported; and because it wants to add it to
7729 the list of weak decls, which isn't helpful. */
7731 }
7734 }
7736 /* Handle an "visibility" attribute; arguments as in
7737 struct attribute_spec.handler. */
7739 static tree
7743 {
7749 {
7753 {
7755 name);
7757 }
7759 {
7763 }
7764 }
7766 {
7769 }
7772 {
7775 }
7777 /* If this is a type, set the visibility on the type decl. */
7779 {
7784 {
7786 name);
7788 }
7789 }
7799 else
7800 {
7801 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7803 }
7807 {
7821 }
7826 /* Go ahead and attach the attribute to the node as well. This is needed
7827 so we can determine whether we have VISIBILITY_DEFAULT because the
7828 visibility was not specified, or because it was explicitly overridden
7829 from the containing scope. */
7832 }
7834 /* Determine the ELF symbol visibility for DECL, which is either a
7835 variable or a function. It is an error to use this function if a
7836 definition of DECL is not available in this translation unit.
7837 Returns true if the final visibility has been determined by this
7838 function; false if the caller is free to make additional
7839 modifications. */
7841 bool
7843 {
7847 /* If the user explicitly specified the visibility with an
7848 attribute, honor that. DECL_VISIBILITY will have been set during
7849 the processing of the attribute. We check for an explicit
7850 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7851 to distinguish the use of an attribute from the use of a "#pragma
7852 GCC visibility push(...)"; in the latter case we still want other
7853 considerations to be able to overrule the #pragma. */
7855 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7860 /* Set default visibility to whatever the user supplied with
7861 visibility_specified depending on #pragma GCC visibility. */
7863 {
7866 {
7869 /* If visibility changed and DECL already has DECL_RTL, ensure
7870 symbol flags are updated. */
7875 }
7876 }
7878 }
7880 /* Handle an "tls_model" attribute; arguments as in
7881 struct attribute_spec.handler. */
7883 static tree
7886 {
7887 tree id;
7894 {
7897 }
7902 {
7905 }
7915 else
7916 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7920 }
7922 /* Handle a "no_instrument_function" attribute; arguments as in
7923 struct attribute_spec.handler. */
7925 static tree
7930 {
7934 {
7938 }
7940 {
7944 }
7945 else
7949 }
7951 /* Handle a "malloc" attribute; arguments as in
7952 struct attribute_spec.handler. */
7954 static tree
7957 {
7961 else
7962 {
7965 }
7968 }
7970 /* Handle a "alloc_size" attribute; arguments as in
7971 struct attribute_spec.handler. */
7973 static tree
7976 {
7979 {
7986 {
7991 }
7992 }
7994 }
7996 /* Handle a "fn spec" attribute; arguments as in
7997 struct attribute_spec.handler. */
7999 static tree
8003 {
8008 }
8010 /* Handle a "returns_twice" attribute; arguments as in
8011 struct attribute_spec.handler. */
8013 static tree
8016 {
8019 else
8020 {
8023 }
8026 }
8028 /* Handle a "no_limit_stack" attribute; arguments as in
8029 struct attribute_spec.handler. */
8031 static tree
8036 {
8040 {
8044 }
8046 {
8050 }
8051 else
8055 }
8057 /* Handle a "pure" attribute; arguments as in
8058 struct attribute_spec.handler. */
8060 static tree
8063 {
8066 /* ??? TODO: Support types. */
8067 else
8068 {
8071 }
8074 }
8076 /* Digest an attribute list destined for a transactional memory statement.
8077 ALLOWED is the set of attributes that are allowed for this statement;
8078 return the attribute we parsed. Multiple attributes are never allowed. */
8080 int
8082 {
8087 {
8095 {
8098 }
8101 {
8104 }
8107 else
8109 }
8112 }
8114 /* Transform a TM attribute name into a maskable integer and back.
8115 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8116 to how the lack of an attribute is treated. */
8118 int
8120 {
8134 }
8136 tree
8138 {
8141 {
8159 }
8161 }
8163 /* Return the first TM attribute seen in LIST. */
8165 tree
8167 {
8169 {
8173 }
8175 }
8177 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8178 Here we accept only function types, and verify that none of the other
8179 function TM attributes are also applied. */
8180 /* ??? We need to accept class types for C++, but not C. This greatly
8181 complicates this function, since we can no longer rely on the extra
8182 processing given by function_type_required. */
8184 static tree
8187 {
8188 /* Only one path adds the attribute; others don't. */
8192 {
8195 /* Only tm_callable and tm_safe apply to classes. */
8198 /* FALLTHRU */
8202 {
8205 ;
8208 else
8210 }
8214 {
8217 {
8222 }
8223 }
8224 /* FALLTHRU */
8227 /* If a function is next, pass it on to be tried next. */
8231 ignored:
8234 }
8237 }
8239 /* Handle the TM_WRAP attribute; arguments as in
8240 struct attribute_spec.handler. */
8242 static tree
8245 {
8248 /* We don't need the attribute even on success, since we
8249 record the entry in an external table. */
8254 else
8255 {
8261 else
8262 {
8266 {
8270 else
8272 }
8273 else
8275 }
8276 }
8279 }
8281 /* Ignore the given attribute. Used when this attribute may be usefully
8282 overridden by the target, but is not used generically. */
8284 static tree
8288 {
8291 }
8293 /* Handle a "no vops" attribute; arguments as in
8294 struct attribute_spec.handler. */
8296 static tree
8300 {
8304 }
8306 /* Handle a "deprecated" attribute; arguments as in
8307 struct attribute_spec.handler. */
8309 static tree
8313 {
8321 {
8324 }
8327 {
8338 else
8340 }
8342 {
8347 }
8348 else
8352 {
8355 {
8361 }
8364 else
8366 }
8369 }
8371 /* Handle a "vector_size" attribute; arguments as in
8372 struct attribute_spec.handler. */
8374 static tree
8378 {
8388 {
8391 }
8393 /* Get the vector size (in bytes). */
8396 /* We need to provide for vector pointers, vector arrays, and
8397 functions returning vectors. For example:
8399 __attribute__((vector_size(16))) short *foo;
8401 In this case, the mode is SI, but the type being modified is
8402 HI, so we need to look further. */
8411 /* Get the mode of the type being modified. */
8422 {
8425 }
8428 {
8431 }
8434 {
8437 }
8439 /* Calculate how many units fit in the vector. */
8442 {
8445 }
8449 /* Build back pointers if needed. */
8453 }
8455 /* Handle the "nonnull" attribute. */
8456 static tree
8460 {
8464 /* If no arguments are specified, all pointer arguments should be
8465 non-null. Verify a full prototype is given so that the arguments
8466 will have the correct types when we actually check them later. */
8468 {
8470 {
8473 }
8475 }
8477 /* Argument list specified. Verify that each argument number references
8478 a pointer argument. */
8480 {
8484 {
8489 }
8492 {
8493 function_args_iterator iter;
8494 tree argument;
8498 {
8502 }
8506 {
8511 }
8514 {
8519 }
8520 }
8521 }
8524 }
8526 /* Check the argument list of a function call for null in argument slots
8527 that are marked as requiring a non-null pointer argument. The NARGS
8528 arguments are passed in the array ARGARRAY.
8529 */
8531 static void
8533 {
8534 tree a;
8542 /* See if any of the nonnull attributes has no arguments. If so,
8543 then every pointer argument is checked (in which case the check
8544 for pointer type is done in check_nonnull_arg). */
8546 do
8554 else
8555 {
8556 /* Walk the argument list. If we encounter an argument number we
8557 should check for non-null, do it. */
8559 {
8561 {
8565 }
8570 }
8571 }
8572 }
8574 /* Check that the Nth argument of a function call (counting backwards
8575 from the end) is a (pointer)0. The NARGS arguments are passed in the
8576 array ARGARRAY. */
8578 static void
8580 {
8584 {
8587 tree sentinel;
8588 function_args_iterator iter;
8589 tree t;
8591 /* Skip over the named arguments. */
8593 {
8596 len++;
8597 }
8600 {
8603 }
8605 /* The sentinel must be one of the varargs, i.e.
8606 in position >= the number of fixed arguments. */
8608 {
8612 }
8614 /* Validate the sentinel. */
8618 /* Although __null (in C++) is only an integer we allow it
8619 nevertheless, as we are guaranteed that it's exactly
8620 as wide as a pointer, and we don't want to force
8621 users to cast the NULL they have written there.
8622 We warn with -Wstrict-null-sentinel, though. */
8625 }
8626 }
8628 /* Helper for check_function_nonnull; given a list of operands which
8629 must be non-null in ARGS, determine if operand PARAM_NUM should be
8630 checked. */
8632 static bool
8634 {
8638 {
8645 }
8647 }
8649 /* Check that the function argument PARAM (which is operand number
8650 PARAM_NUM) is non-null. This is called by check_function_nonnull
8651 via check_function_arguments_recurse. */
8653 static void
8656 {
8657 /* Just skip checking the argument if it's not a pointer. This can
8658 happen if the "nonnull" attribute was given without an operand
8659 list (which means to check every pointer argument). */
8667 }
8669 /* Helper for nonnull attribute handling; fetch the operand number
8670 from the attribute argument list. */
8672 static bool
8674 {
8675 /* Verify the arg number is a constant. */
8682 }
8684 /* Handle a "nothrow" attribute; arguments as in
8685 struct attribute_spec.handler. */
8687 static tree
8690 {
8693 /* ??? TODO: Support types. */
8694 else
8695 {
8698 }
8701 }
8703 /* Handle a "cleanup" attribute; arguments as in
8704 struct attribute_spec.handler. */
8706 static tree
8709 {
8713 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8714 for global destructors in C++. This requires infrastructure that
8715 we don't have generically at the moment. It's also not a feature
8716 we'd be missing too much, since we do have attribute constructor. */
8718 {
8722 }
8724 /* Verify that the argument is a function in scope. */
8725 /* ??? We could support pointers to functions here as well, if
8726 that was considered desirable. */
8729 {
8733 }
8736 {
8740 }
8742 /* That the function has proper type is checked with the
8743 eventual call to build_function_call. */
8746 }
8748 /* Handle a "warn_unused_result" attribute. No special handling. */
8750 static tree
8754 {
8755 /* Ignore the attribute for functions not returning any value. */
8757 {
8760 }
8763 }
8765 /* Handle a "sentinel" attribute. */
8767 static tree
8770 {
8772 {
8776 }
8777 else
8778 {
8780 {
8784 }
8785 }
8788 {
8792 {
8796 }
8797 else
8798 {
8800 {
8804 }
8805 }
8806 }
8809 }
8811 /* Handle a "type_generic" attribute. */
8813 static tree
8817 {
8818 /* Ensure we have a function type. */
8821 /* Ensure we have a variadic function. */
8825 }
8827 /* Handle a "target" attribute. */
8829 static tree
8832 {
8833 /* Ensure we have a function type. */
8835 {
8838 }
8840 flags))
8844 }
8846 /* Arguments being collected for optimization. */
8851 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8852 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8853 false for #pragma GCC optimize. */
8855 bool
8857 {
8865 tree ap;
8867 /* Build up argv vector. Just in case the string is stored away, use garbage
8868 collected strings. */
8873 {
8877 {
8881 }
8884 {
8885 /* Split string into multiple substrings. */
8893 {
8900 {
8904 }
8905 else
8906 {
8909 }
8913 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8914 options. */
8916 {
8921 else
8925 }
8928 {
8931 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8932 itself is -Os, and any other switch begins with a -f. */
8938 }
8943 }
8945 }
8946 }
8956 /* Now parse the options. */
8966 /* Don't allow changing -fstrict-aliasing. */
8971 }
8973 /* For handling "optimize" attribute. arguments as in
8974 struct attribute_spec.handler. */
8976 static tree
8979 {
8980 /* Ensure we have a function type. */
8982 {
8985 }
8986 else
8987 {
8991 /* Save current options. */
8994 /* If we previously had some optimization options, use them as the
8995 default. */
9000 /* Parse options, and update the vector. */
9005 /* Restore current options. */
9007 }
9010 }
9012 /* Handle a "no_split_stack" attribute. */
9014 static tree
9019 {
9023 {
9027 }
9029 {
9033 }
9036 }
9037 \f
9038 /* Check for valid arguments being passed to a function with FNTYPE.
9039 There are NARGS arguments in the array ARGARRAY. */
9040 void
9042 {
9043 /* Check for null being passed in a pointer argument that must be
9044 non-null. We also need to do this if format checking is enabled. */
9049 /* Check for errors in format strings. */
9056 }
9058 /* Generic argument checking recursion routine. PARAM is the argument to
9059 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9060 once the argument is resolved. CTX is context for the callback. */
9061 void
9066 {
9070 {
9071 /* Strip coercion. */
9075 }
9078 {
9080 tree attrs;
9083 /* See if this is a call to a known internationalization function
9084 that modifies a format arg. Such a function may have multiple
9085 format_arg attributes (for example, ngettext). */
9088 attrs;
9091 {
9092 tree inner_arg;
9093 tree format_num_expr;
9096 call_expr_arg_iterator iter;
9098 /* Extract the argument number, which was previously checked
9099 to be valid. */
9111 {
9116 }
9117 }
9119 /* If we found a format_arg attribute and did a recursive check,
9120 we are done with checking this argument. Otherwise, we continue
9121 and this will be considered a non-literal. */
9124 }
9127 {
9128 /* Check both halves of the conditional expression. */
9134 }
9137 }
9139 /* Checks for a builtin function FNDECL that the number of arguments
9140 NARGS against the required number REQUIRED and issues an error if
9141 there is a mismatch. Returns true if the number of arguments is
9142 correct, otherwise false. */
9144 static bool
9146 {
9148 {
9152 }
9154 {
9158 }
9160 }
9162 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9163 Returns false if there was an error, otherwise true. */
9165 bool
9167 {
9173 {
9183 {
9185 {
9189 }
9191 }
9201 {
9208 {
9212 }
9214 }
9219 {
9224 {
9228 }
9231 {
9233 fndecl);
9235 }
9237 }
9242 {
9244 {
9247 }
9249 }
9254 }
9255 }
9257 /* Function to help qsort sort FIELD_DECLs by name order. */
9259 int
9261 {
9266 /* A nontype is "greater" than a type. */
9275 }
9278 gt_pointer_operator new_value;
9282 /* This routine compares two fields like field_decl_cmp but using the
9283 pointer operator in resort_data. */
9285 static int
9287 {
9292 /* A nontype is "greater" than a type. */
9298 {
9305 }
9307 }
9309 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9311 void
9314 gt_pointer_operator new_value,
9316 {
9321 resort_field_decl_cmp);
9322 }
9324 /* Subroutine of c_parse_error.
9325 Return the result of concatenating LHS and RHS. RHS is really
9326 a string literal, its first character is indicated by RHS_START and
9327 RHS_SIZE is its length (including the terminating NUL character).
9329 The caller is responsible for deleting the returned pointer. */
9333 {
9339 }
9341 /* Issue the error given by GMSGID, indicating that it occurred before
9342 TOKEN, which had the associated VALUE. */
9344 void
9347 {
9348 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9358 {
9363 {
9376 }
9380 else
9386 }
9396 {
9401 }
9409 {
9414 }
9415 else
9419 {
9422 }
9423 #undef catenate_messages
9424 }
9426 /* Mapping for cpp message reasons to the options that enable them. */
9428 struct reason_option_codes_t
9429 {
9432 };
9452 };
9454 /* Return the gcc option code associated with the reason for a cpp
9455 message, or 0 if none. */
9457 static int
9459 {
9463 {
9466 }
9468 }
9470 /* Callback from cpp_error for PFILE to print diagnostics from the
9471 preprocessor. The diagnostic is of type LEVEL, with REASON set
9472 to the reason code if LEVEL is represents a warning, at location
9473 LOCATION unless this is after lexing and the compiler's location
9474 should be used instead, with column number possibly overridden by
9475 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9476 the arguments. Returns true if a diagnostic was emitted, false
9477 otherwise. */
9479 bool
9483 {
9484 diagnostic_info diagnostic;
9485 diagnostic_t dlevel;
9490 {
9495 /* Fall through. */
9520 }
9533 }
9535 /* Convert a character from the host to the target execution character
9536 set. cpplib handles this, mostly. */
9538 HOST_WIDE_INT
9540 {
9541 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9542 zero-extended under -fno-signed-char. cpplib insists that characters
9543 and character constants are always unsigned. Hence we must convert
9544 back and forth. */
9552 else
9554 }
9556 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9557 references with an INDIRECT_REF of a constant at the bottom; much like the
9558 traditional rendering of offsetof as a macro. Return the folded result. */
9560 tree
9562 {
9566 {
9582 {
9585 }
9595 {
9599 }
9613 /* Check if the offset goes beyond the upper bound of the array. */
9615 {
9621 {
9625 {
9626 tree v;
9633 {
9641 }
9642 /* Don't warn if the array might be considered a poor
9643 man's flexible array member with a very permissive
9644 definition thereof. */
9648 "index %E denotes an offset "
9651 }
9652 }
9653 }
9660 /* Handle static members of volatile structs. */
9667 }
9670 }
9672 /* Likewise, but convert it to the return type of offsetof. */
9674 tree
9676 {
9678 }
9680 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9681 expression, because B will always be true. */
9683 void
9685 {
9688 "the omitted middle operand in ?: will always be %<true%>, "
9690 }
9692 /* Give an error for storing into ARG, which is 'const'. USE indicates
9693 how ARG was being used. */
9695 void
9697 {
9700 /* Using this macro rather than (for example) arrays of messages
9701 ensures that all the format strings are checked at compile
9702 time. */
9703 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9704 : (use == lv_increment ? (I) \
9705 : (use == lv_decrement ? (D) : (AS))))
9707 {
9718 else
9724 }
9730 arg);
9736 arg);
9738 {
9748 arg);
9749 }
9755 arg);
9756 else
9761 arg);
9762 }
9764 /* Print an error message for an invalid lvalue. USE says
9765 how the lvalue is being used and so selects the error message. LOC
9766 is the location for the error. */
9768 void
9770 {
9772 {
9790 }
9791 }
9793 /* Print an error message for an invalid indirection of type TYPE.
9794 ERRSTRING is the name of the operator for the indirection. */
9796 void
9798 {
9800 {
9808 type);
9813 type);
9818 type);
9823 type);
9827 }
9828 }
9829 \f
9830 /* *PTYPE is an incomplete array. Complete it with a domain based on
9831 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9832 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9833 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9835 int
9837 {
9844 {
9846 {
9847 int eltsize
9850 }
9852 {
9856 {
9860 }
9861 else
9862 {
9863 tree curindex;
9874 {
9878 else
9879 {
9883 size_one_node);
9884 }
9887 }
9890 }
9891 }
9892 else
9893 {
9894 /* Make an error message unless that happened already. */
9897 }
9898 }
9899 else
9900 {
9904 }
9907 /* Force an indefinite layout factor. */
9914 else
9917 /* Using build_distinct_type_copy and modifying things afterward instead
9918 of using build_array_type to create a new type preserves all of the
9919 TYPE_LANG_FLAG_? bits that the front end may have set. */
9927 /* Make sure we have the canonical MAIN_TYPE. */
9930 hashcode);
9933 /* Fix the canonical type. */
9943 else
9948 else
9954 {
9956 /* If we proceed with the array type as it is, we'll eventually
9957 crash in tree_low_cst(). */
9959 }
9963 }
9965 /* Like c_mark_addressable but don't check register qualifier. */
9966 void
9968 {
9974 }
9977 \f
9978 /* Used to help initialize the builtin-types.def table. When a type of
9979 the correct size doesn't exist, use error_mark_node instead of NULL.
9980 The later results in segfaults even when a decl using the type doesn't
9981 get invoked. */
9983 tree
9985 {
9988 }
9990 /* A helper function for resolve_overloaded_builtin in resolving the
9991 overloaded __sync_ builtins. Returns a positive power of 2 if the
9992 first operand of PARAMS is a pointer to a supported data type.
9993 Returns 0 if an error is encountered. */
9995 static int
9997 {
9998 tree type;
10002 {
10005 }
10019 incompatible:
10022 }
10024 /* A helper function for resolve_overloaded_builtin. Adds casts to
10025 PARAMS to make arguments match up with those of FUNCTION. Drops
10026 the variadic arguments at the end. Returns false if some error
10027 was encountered; true on success. */
10029 static bool
10032 {
10033 function_args_iterator iter;
10034 tree ptype;
10038 /* We've declared the implementation functions to use "volatile void *"
10039 as the pointer parameter, so we shouldn't get any complaints from the
10040 call to check_function_arguments what ever type the user used. */
10044 /* For the rest of the values, we need to cast these to FTYPE, so that we
10045 don't get warnings for passing pointer types, etc. */
10048 {
10052 /* XXX void_type_node belies the abstraction. */
10058 {
10061 }
10063 /* Only convert parameters if arg_type is unsigned integer type with
10064 new format sync routines, i.e. don't attempt to convert pointer
10065 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10066 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10067 kinds). */
10069 {
10070 /* Ideally for the first conversion we'd use convert_for_assignment
10071 so that we get warnings for anything that doesn't match the pointer
10072 type. This isn't portable across the C and C++ front ends atm. */
10077 }
10080 }
10082 /* __atomic routines are not variadic. */
10084 {
10087 }
10089 /* The definition of these primitives is variadic, with the remaining
10090 being "an optional list of variables protected by the memory barrier".
10091 No clue what that's supposed to mean, precisely, but we consider all
10092 call-clobbered variables to be protected so we're safe. */
10096 }
10098 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10099 RESULT to make it match the type of the first pointer argument in
10100 PARAMS. */
10102 static tree
10104 {
10109 /* New format doesn't require casting unless the types are the same size. */
10112 else
10114 }
10116 /* This function verifies the PARAMS to generic atomic FUNCTION.
10117 It returns the size if all the parameters are the same size, otherwise
10118 0 is returned if the parameters are invalid. */
10120 static int
10123 {
10128 tree type_0;
10130 /* Determine the parameter makeup. */
10132 {
10148 }
10151 {
10154 }
10156 /* Get type of first parameter, and determine its size. */
10159 {
10161 function);
10163 }
10165 /* Types must be compile time constant sizes. */
10167 {
10170 function);
10172 }
10176 /* Zero size objects are not allowed. */
10178 {
10181 function);
10183 }
10185 /* Check each other parameter is a pointer and the same size. */
10187 {
10190 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
10194 {
10196 function);
10198 }
10201 {
10203 function);
10205 }
10206 }
10208 /* Check memory model parameters for validity. */
10210 {
10213 {
10216 {
10219 function);
10220 }
10221 }
10222 else
10224 {
10226 function);
10228 }
10229 }
10232 }
10235 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10236 at the beginning of the parameter list PARAMS representing the size of the
10237 objects. This is to match the library ABI requirement. LOC is the location
10238 of the function call.
10239 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10240 returned to allow the external call to be constructed. */
10242 static tree
10245 {
10246 tree size_node;
10248 /* Insert a SIZE_T parameter as the first param. If there isn't
10249 enough space, allocate a new vector and recursively re-build with that. */
10251 {
10254 tree f;
10263 }
10265 /* Add the size parameter and leave as a function call for processing. */
10269 }
10272 /* This will process an __atomic_exchange function call, determine whether it
10273 needs to be mapped to the _N variation, or turned into a library call.
10274 LOC is the location of the builtin call.
10275 FUNCTION is the DECL that has been invoked;
10276 PARAMS is the argument list for the call. The return value is non-null
10277 TRUE is returned if it is translated into the proper format for a call to the
10278 external library, and NEW_RETURN is set the tree for that function.
10279 FALSE is returned if processing for the _N variation is required, and
10280 NEW_RETURN is set to the the return value the result is copied into. */
10281 static bool
10284 {
10289 /* Size of 0 is an error condition. */
10291 {
10294 }
10296 /* If not a lock-free size, change to the library generic format. */
10298 {
10301 }
10303 /* Otherwise there is a lockfree match, transform the call from:
10304 void fn(T* mem, T* desired, T* return, model)
10305 into
10306 *return = (T) (fn (In* mem, (In) *desired, model)) */
10313 /* Create pointer to appropriate size. */
10317 /* Convert object pointer to required type. */
10320 /* Convert new value to required type, and dereference it. */
10325 /* Move memory model to the 3rd position, and end param list. */
10329 /* Convert return pointer and dereference it for later assignment. */
10333 }
10336 /* This will process an __atomic_compare_exchange function call, determine
10337 whether it needs to be mapped to the _N variation, or turned into a lib call.
10338 LOC is the location of the builtin call.
10339 FUNCTION is the DECL that has been invoked;
10340 PARAMS is the argument list for the call. The return value is non-null
10341 TRUE is returned if it is translated into the proper format for a call to the
10342 external library, and NEW_RETURN is set the tree for that function.
10343 FALSE is returned if processing for the _N variation is required. */
10345 static bool
10349 {
10354 /* Size of 0 is an error condition. */
10356 {
10359 }
10361 /* If not a lock-free size, change to the library generic format. */
10363 {
10364 /* The library generic format does not have the weak parameter, so
10365 remove it from the param list. Since a parameter has been removed,
10366 we can be sure that there is room for the SIZE_T parameter, meaning
10367 there will not be a recursive rebuilding of the parameter list, so
10368 there is no danger this will be done twice. */
10370 {
10374 }
10377 }
10379 /* Otherwise, there is a match, so the call needs to be transformed from:
10380 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10381 into
10382 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10388 /* Create pointer to appropriate size. */
10392 /* Convert object pointer to required type. */
10396 /* Convert expected pointer to required type. */
10400 /* Convert desired value to required type, and dereference it. */
10405 /* The rest of the parameters are fine. NULL means no special return value
10406 processing.*/
10409 }
10412 /* This will process an __atomic_load function call, determine whether it
10413 needs to be mapped to the _N variation, or turned into a library call.
10414 LOC is the location of the builtin call.
10415 FUNCTION is the DECL that has been invoked;
10416 PARAMS is the argument list for the call. The return value is non-null
10417 TRUE is returned if it is translated into the proper format for a call to the
10418 external library, and NEW_RETURN is set the tree for that function.
10419 FALSE is returned if processing for the _N variation is required, and
10420 NEW_RETURN is set to the the return value the result is copied into. */
10422 static bool
10425 {
10430 /* Size of 0 is an error condition. */
10432 {
10435 }
10437 /* If not a lock-free size, change to the library generic format. */
10439 {
10442 }
10444 /* Otherwise, there is a match, so the call needs to be transformed from:
10445 void fn(T* mem, T* return, model)
10446 into
10447 *return = (T) (fn ((In *) mem, model)) */
10453 /* Create pointer to appropriate size. */
10457 /* Convert object pointer to required type. */
10461 /* Move memory model to the 2nd position, and end param list. */
10465 /* Convert return pointer and dereference it for later assignment. */
10469 }
10472 /* This will process an __atomic_store function call, determine whether it
10473 needs to be mapped to the _N variation, or turned into a library call.
10474 LOC is the location of the builtin call.
10475 FUNCTION is the DECL that has been invoked;
10476 PARAMS is the argument list for the call. The return value is non-null
10477 TRUE is returned if it is translated into the proper format for a call to the
10478 external library, and NEW_RETURN is set the tree for that function.
10479 FALSE is returned if processing for the _N variation is required, and
10480 NEW_RETURN is set to the the return value the result is copied into. */
10482 static bool
10485 {
10490 /* Size of 0 is an error condition. */
10492 {
10495 }
10497 /* If not a lock-free size, change to the library generic format. */
10499 {
10502 }
10504 /* Otherwise, there is a match, so the call needs to be transformed from:
10505 void fn(T* mem, T* value, model)
10506 into
10507 fn ((In *) mem, (In) *value, model) */
10512 /* Create pointer to appropriate size. */
10516 /* Convert object pointer to required type. */
10520 /* Convert new value to required type, and dereference it. */
10525 /* The memory model is in the right spot already. Return is void. */
10529 }
10532 /* Some builtin functions are placeholders for other expressions. This
10533 function should be called immediately after parsing the call expression
10534 before surrounding code has committed to the type of the expression.
10536 LOC is the location of the builtin call.
10538 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10539 PARAMS is the argument list for the call. The return value is non-null
10540 when expansion is complete, and null if normal processing should
10541 continue. */
10543 tree
10546 {
10552 {
10558 else
10562 }
10564 /* Handle BUILT_IN_NORMAL here. */
10566 {
10571 {
10572 /* Handle these 4 together so that they can fall through to the next
10573 case if the call is transformed to an _N variant. */
10575 {
10577 {
10581 /* Change to the _N variant. */
10584 }
10587 {
10589 params,
10592 /* Change to the _N variant. */
10595 }
10597 {
10601 /* Change to the _N variant. */
10604 }
10606 {
10610 /* Change to the _N variant. */
10613 }
10616 }
10617 /* Fallthrough to the normal processing. */
10618 }
10635 {
10637 /* Fallthru for parameter processing. */
10638 }
10655 {
10666 orig_format))
10678 /* If new_return is set, assign function to that expr and cast the
10679 result to void since the generic interface returned void. */
10681 {
10682 /* Cast function result from I{1,2,4,8,16} to the required type. */
10685 result);
10689 }
10691 }
10695 }
10696 }
10698 /* Ignoring their sign, return true if two scalar types are the same. */
10699 bool
10701 {
10708 /* Equality works here because c_common_signed_type uses
10709 TYPE_MAIN_VARIANT. */
10712 }
10714 /* Check for missing format attributes on function pointers. LTYPE is
10715 the new type or left-hand side type. RTYPE is the old type or
10716 right-hand side type. Returns TRUE if LTYPE is missing the desired
10717 attribute. */
10719 bool
10721 {
10723 tree ra;
10729 {
10730 tree la;
10735 }
10736 else
10738 }
10740 /* Subscripting with type char is likely to lose on a machine where
10741 chars are signed. So warn on any machine, but optionally. Don't
10742 warn for unsigned char since that type is safe. Don't warn for
10743 signed char because anyone who uses that must have done so
10744 deliberately. Furthermore, we reduce the false positive load by
10745 warning only for non-constant value of type char. */
10747 void
10749 {
10753 }
10755 /* Implement -Wparentheses for the unexpected C precedence rules, to
10756 cover cases like x + y << z which readers are likely to
10757 misinterpret. We have seen an expression in which CODE is a binary
10758 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10759 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10760 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10761 expression was not formed using a binary or unary operator, or it
10762 was enclosed in parentheses. */
10764 void
10768 {
10772 /* This macro tests that the expression ARG with original tree code
10773 CODE appears to be a boolean expression. or the result of folding a
10774 boolean expression. */
10775 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10776 (truth_value_p (TREE_CODE (ARG)) \
10777 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10779 || ((CODE) != INTEGER_CST \
10780 && (integer_onep (ARG) || integer_zerop (ARG))))
10783 {
10832 /* Check cases like x|y==z */
10839 /* Check cases like !x | y */
10843 "suggest parentheses around operand of "
10856 /* Check cases like x^y==z */
10878 /* Check cases like x&y==z */
10885 /* Check cases like !x & y */
10889 "suggest parentheses around operand of "
10912 {
10917 "comparisons like %<X<=Y<=Z%> do not "
10923 "comparisons like %<X<=Y<=Z%> do not "
10925 }
10927 }
10928 #undef NOT_A_BOOLEAN_EXPR_P
10929 }
10931 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10933 void
10935 {
10937 {
10940 else
10942 }
10943 }
10945 /* Warn for division by zero according to the value of DIVISOR. LOC
10946 is the location of the division operator. */
10948 void
10950 {
10951 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10952 about division by zero. Do not issue a warning if DIVISOR has a
10953 floating-point type, since we consider 0.0/0.0 a valid way of
10954 generating a NaN. */
10958 }
10960 /* Subroutine of build_binary_op. Give warnings for comparisons
10961 between signed and unsigned quantities that may fail. Do the
10962 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10963 so that casts will be considered, but default promotions won't
10964 be.
10966 LOCATION is the location of the comparison operator.
10968 The arguments of this function map directly to local variables
10969 of build_binary_op. */
10971 void
10976 {
10981 /* In C++, check for comparison of different enum types. */
10987 {
10991 }
10993 /* Do not warn if the comparison is being done in a signed type,
10994 since the signed type will only be chosen if it can represent
10995 all the values of the unsigned type. */
10998 /* Do not warn if both operands are unsigned. */
11001 else
11002 {
11008 else
11016 /* Do not warn if the signed quantity is an unsuffixed integer
11017 literal (or some static constant expression involving such
11018 literals or a conditional expression involving such literals)
11019 and it is non-negative. */
11022 /* Do not warn if the comparison is an equality operation, the
11023 unsigned quantity is an integral constant, and it would fit
11024 in the result if the result were signed. */
11029 /* In C, do not warn if the unsigned quantity is an enumeration
11030 constant and its maximum value would fit in the result if the
11031 result were signed. */
11037 else
11039 OPT_Wsign_compare,
11041 }
11043 /* Warn if two unsigned values are being compared in a size larger
11044 than their original size, and one (and only one) is the result of
11045 a `~' operator. This comparison will always fail.
11047 Also warn if one operand is a constant, and the constant does not
11048 have all bits set that are set in the ~ operand when it is
11049 extended. */
11056 {
11063 {
11064 tree primop;
11070 {
11074 }
11075 else
11076 {
11080 }
11085 {
11088 {
11092 else
11095 }
11096 }
11097 }
11105 }
11106 }
11108 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11109 type via c_common_type. If -Wdouble-promotion is in use, and the
11110 conditions for warning have been met, issue a warning. GMSGID is
11111 the warning message. It must have two %T specifiers for the type
11112 that was converted (generally "float") and the type to which it was
11113 converted (generally "double), respectively. LOC is the location
11114 to which the awrning should refer. */
11116 void
11119 {
11120 tree source_type;
11124 /* If the conversion will not occur at run-time, there is no need to
11125 warn about it. */
11137 else
11140 }
11142 /* Setup a TYPE_DECL node as a typedef representation.
11144 X is a TYPE_DECL for a typedef statement. Create a brand new
11145 ..._TYPE node (which will be just a variant of the existing
11146 ..._TYPE node with identical properties) and then install X
11147 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11149 The whole point here is to end up with a situation where each
11150 and every ..._TYPE node the compiler creates will be uniquely
11151 associated with AT MOST one node representing a typedef name.
11152 This way, even though the compiler substitutes corresponding
11153 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11154 early on, later parts of the compiler can always do the reverse
11155 translation and get back the corresponding typedef name. For
11156 example, given:
11158 typedef struct S MY_TYPE;
11159 MY_TYPE object;
11161 Later parts of the compiler might only know that `object' was of
11162 type `struct S' if it were not for code just below. With this
11163 code however, later parts of the compiler see something like:
11165 struct S' == struct S
11166 typedef struct S' MY_TYPE;
11167 struct S' object;
11169 And they can then deduce (from the node for type struct S') that
11170 the original object declaration was:
11172 MY_TYPE object;
11174 Being able to do this is important for proper support of protoize,
11175 and also for generating precise symbolic debugging information
11176 which takes full account of the programmer's (typedef) vocabulary.
11178 Obviously, we don't want to generate a duplicate ..._TYPE node if
11179 the TYPE_DECL node that we are now processing really represents a
11180 standard built-in type. */
11182 void
11184 {
11188 {
11191 }
11194 {
11202 }
11203 }
11205 /* Record the types used by the current global variable declaration
11206 being parsed, so that we can decide later to emit their debug info.
11207 Those types are in types_used_by_cur_var_decl, and we are going to
11208 store them in the types_used_by_vars_hash hash table.
11209 DECL is the declaration of the global variable that has been parsed. */
11211 void
11213 {
11217 {
11220 }
11221 }
11223 /* If DECL is a typedef that is declared in the current function,
11224 record it for the purpose of -Wunused-local-typedefs. */
11226 void
11228 {
11233 /* if this is not a locally defined typedef then we are not
11234 interested. */
11241 }
11243 /* If T is a TYPE_DECL declared locally, mark it as used. */
11245 void
11247 {
11252 }
11254 /* Warn if there are some unused locally defined typedefs in the
11255 current function. */
11257 void
11259 {
11261 tree decl;
11262 /* The number of times we have emitted -Wunused-local-typedefs
11263 warnings. If this is different from errorcount, that means some
11264 unrelated errors have been issued. In which case, we'll avoid
11265 emitting "unused-local-typedefs" warnings. */
11277 {
11281 OPT_Wunused_local_typedefs,
11284 }
11287 }
11289 /* The C and C++ parsers both use vectors to hold function arguments.
11290 For efficiency, we keep a cache of unused vectors. This is the
11291 cache. */
11296 /* Return a new vector from the cache. If the cache is empty,
11297 allocate a new vector. These vectors are GC'ed, so it is OK if the
11298 pointer is not released.. */
11302 {
11305 else
11306 {
11307 /* Passing 0 to vec::alloc returns NULL, and our callers require
11308 that we always return a non-NULL value. The vector code uses
11309 4 when growing a NULL vector, so we do too. */
11313 }
11314 }
11316 /* Release a vector of trees back to the cache. */
11318 void
11320 {
11322 {
11325 }
11326 }
11328 /* Get a new tree vector holding a single tree. */
11332 {
11336 }
11338 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11342 {
11347 }
11349 /* Get a new tree vector which is a copy of an existing one. */
11353 {
11356 tree t;
11363 }
11365 /* Return true if KEYWORD starts a type specifier. */
11367 bool
11369 {
11371 {
11401 }
11402 }
11404 /* Return true if KEYWORD names a type qualifier. */
11406 bool
11408 {
11410 {
11417 }
11418 }
11420 /* Return true if KEYWORD names a storage class specifier.
11422 RID_TYPEDEF is not included in this list despite `typedef' being
11423 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11424 such for syntactic convenience only. */
11426 bool
11428 {
11430 {
11440 }
11441 }
11443 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11445 static bool
11447 {
11449 {
11457 }
11458 }
11460 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11461 declaration-specifier (C99 6.7). */
11463 bool
11465 {
11472 {
11479 }
11480 }
11482 /* Initialize language-specific-bits of tree_contains_struct. */
11484 void
11486 {
11489 }
11491 /* Build a user-defined numeric literal out of an integer constant type VALUE
11492 with identifier SUFFIX. */
11494 tree
11497 {
11504 }
11506 /* For vector[index], convert the vector to a
11507 pointer of the underlying type. */
11508 void
11511 {
11513 {
11515 tree type1;
11529 }
11530 }
11532 /* Determine which of the operands, if any, is a scalar that needs to be
11533 converted to a vector, for the range of operations. */
11534 enum stv_conv
11537 {
11546 {
11547 /* Most GENERIC binary expressions require homogeneous arguments.
11548 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11549 argument that is a vector and a second one that is a scalar, so
11550 we never return stv_secondarg for them. */
11555 {
11557 {
11562 }
11563 else
11565 }
11572 /* ... fall through ... */
11593 /* What about UNLT_EXPR? */
11595 {
11596 tree tmp;
11598 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11601 }
11605 {
11607 {
11612 }
11614 }
11616 /* Allow integer --> real conversion if safe. */
11620 {
11622 {
11627 }
11629 }
11632 }
11635 }
11637 /* Return true iff ALIGN is an integral constant that is a fundamental
11638 alignment, as defined by [basic.align] in the c++-11
11639 specifications.
11641 That is:
11643 [A fundamental alignment is represented by an alignment less than or
11644 equal to the greatest alignment supported by the implementation
11645 in all contexts, which is equal to
11646 alignof(max_align_t)]. */
11648 bool
11650 {
11653 }