| blob | 3a1bbd253473407f241a199be5234000b910b6b6 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
53 /* The following symbols are subsumed in the c_global_trees array, and
54 listed here individually for documentation purposes.
56 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
58 tree short_integer_type_node;
59 tree long_integer_type_node;
60 tree long_long_integer_type_node;
61 tree int128_integer_type_node;
63 tree short_unsigned_type_node;
64 tree long_unsigned_type_node;
65 tree long_long_unsigned_type_node;
66 tree int128_unsigned_type_node;
68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
72 tree ptrdiff_type_node;
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
76 tree wchar_type_node;
78 tree char16_type_node;
79 tree char32_type_node;
81 tree float_type_node;
82 tree double_type_node;
83 tree long_double_type_node;
85 tree complex_integer_type_node;
86 tree complex_float_type_node;
87 tree complex_double_type_node;
88 tree complex_long_double_type_node;
90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
94 tree intQI_type_node;
95 tree intHI_type_node;
96 tree intSI_type_node;
97 tree intDI_type_node;
98 tree intTI_type_node;
100 tree unsigned_intQI_type_node;
101 tree unsigned_intHI_type_node;
102 tree unsigned_intSI_type_node;
103 tree unsigned_intDI_type_node;
104 tree unsigned_intTI_type_node;
106 tree widest_integer_literal_type_node;
107 tree widest_unsigned_literal_type_node;
109 Nodes for types `void *' and `const void *'.
111 tree ptr_type_node, const_ptr_type_node;
113 Nodes for types `char *' and `const char *'.
115 tree string_type_node, const_string_type_node;
117 Type `char[SOMENUMBER]'.
118 Used when an array of char is needed and the size is irrelevant.
120 tree char_array_type_node;
122 Type `int[SOMENUMBER]' or something like it.
123 Used when an array of int needed and the size is irrelevant.
125 tree int_array_type_node;
127 Type `wchar_t[SOMENUMBER]' or something like it.
128 Used when a wide string literal is created.
130 tree wchar_array_type_node;
132 Type `char16_t[SOMENUMBER]' or something like it.
133 Used when a UTF-16 string literal is created.
135 tree char16_array_type_node;
137 Type `char32_t[SOMENUMBER]' or something like it.
138 Used when a UTF-32 string literal is created.
140 tree char32_array_type_node;
142 Type `int ()' -- used for implicit declaration of functions.
144 tree default_function_type;
146 A VOID_TYPE node, packaged in a TREE_LIST.
148 tree void_list_node;
150 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
151 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
152 VAR_DECLS, but C++ does.)
154 tree function_name_decl_node;
155 tree pretty_function_name_decl_node;
156 tree c99_function_name_decl_node;
158 Stack of nested function name VAR_DECLs.
160 tree saved_function_name_decls;
162 */
165 \f
166 /* Switches common to the C front ends. */
168 /* Nonzero means don't output line number information. */
172 /* Nonzero causes -E output not to be done, but directives such as
173 #define that have side effects are still obeyed. */
177 /* Nonzero means dump macros in some fashion. */
181 /* Nonzero means pass #include lines through to the output. */
185 /* Nonzero means process PCH files while preprocessing. */
189 /* The file name to which we should write a precompiled header, or
190 NULL if no header will be written in this compile. */
194 /* Nonzero if an ISO standard was selected. It rejects macros in the
195 user's namespace. */
198 /* Warn about #pragma directives that are not recognized. */
202 /* Warn about format/argument anomalies in calls to formatted I/O functions
203 (*printf, *scanf, strftime, strfmon, etc.). */
207 /* C/ObjC language option variables. */
210 /* Nonzero means allow type mismatches in conditional expressions;
211 just make their values `void'. */
215 /* Nonzero means enable C89 Amendment 1 features. */
219 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
223 /* Nonzero means use the ISO C11 dialect of C. */
227 /* Nonzero means that we have builtin functions, and main is an int. */
232 /* ObjC language option variables. */
235 /* Tells the compiler that this is a special run. Do not perform any
236 compiling, instead we are to test some platform dependent features
237 and output a C header file with appropriate definitions. */
241 /* Tells the compiler what is the constant string class for ObjC. */
246 /* C++ language option variables. */
249 /* Nonzero means generate separate instantiation control files and
250 juggle them at link time. */
254 /* The C++ dialect being used. C++98 is the default. */
258 /* Maximum template instantiation depth. This limit exists to limit the
259 time it takes to notice excessively recursive template instantiations.
261 The default is lower than the 1024 recommended by the C++0x standard
262 because G++ runs out of stack before 1024 with highly recursive template
263 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
267 /* The elements of `ridpointers' are identifier nodes for the reserved
268 type names and storage classes. It is indexed by a RID_... value. */
273 /* Nonzero means don't warn about problems that occur when the code is
274 executed. */
277 /* Whether we are building a boolean conversion inside
278 convert_for_assignment, or some other late binary operation. If
279 build_binary_op is called for C (from code shared by C and C++) in
280 this case, then the operands have already been folded and the
281 result will not be folded again, so C_MAYBE_CONST_EXPR should not
282 be generated. */
285 /* Whether lexing has been completed, so subsequent preprocessor
286 errors should use the compiler's input_location. */
289 /* Information about how a function name is generated. */
290 struct fname_var_t
291 {
295 };
297 /* The three ways of getting then name of the current function. */
300 {
301 /* C99 compliant __func__, must be first. */
303 /* GCC __FUNCTION__ compliant. */
305 /* GCC __PRETTY_FUNCTION__ compliant. */
308 };
310 /* Global visibility options. */
387 /* Reserved words. The third field is a mask: keywords are disabled
388 if they match the mask.
390 Masks for languages:
391 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
392 C --std=c99: D_CXXONLY | D_OBJC
393 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
394 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
395 C++ --std=c0x: D_CONLY | D_OBJC
396 ObjC++ is like C++ except that D_OBJC is not set
398 If -fno-asm is used, D_ASM is added to the mask. If
399 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
400 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
401 In C with -Wc++-compat, we warn if D_CXXWARN is set.
403 Note the complication of the D_CXX_OBJC keywords. These are
404 reserved words such as 'class'. In C++, 'class' is a reserved
405 word. In Objective-C++ it is too. In Objective-C, it is a
406 reserved word too, but only if it follows an '@' sign.
407 */
409 {
562 /* These Objective-C keywords are recognized only immediately after
563 an '@'. */
580 /* These are recognized only in protocol-qualifier context
581 (see above) */
588 /* These are recognized inside a property attribute list */
597 };
602 /* Table of machine-independent attributes common to all C-like languages. */
604 {
605 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
606 affects_type_identity } */
613 /* FIXME: logically, noreturn attributes should be listed as
614 "false, true, true" and apply to function types. But implementing this
615 would require all the places in the compiler that use TREE_THIS_VOLATILE
616 on a decl to identify non-returning functions to be located and fixed
617 to check the function type instead. */
642 /* The same comments as for noreturn attributes apply to const ones. */
666 handle_no_instrument_function_attribute,
684 /* ??? These two attributes didn't make the transition from the
685 Intel language document to the multi-vendor language document. */
690 /* For internal use (marking of builtins) only. The name contains space
691 to prevent its usage in source code. */
713 /* For internal use (marking of builtins) only. The name contains space
714 to prevent its usage in source code. */
731 /* For internal use only. The leading '*' both prevents its usage in
732 source code and signals that it may be overridden by machine tables. */
737 /* For internal use (marking of builtins and runtime functions) only.
738 The name contains space to prevent its usage in source code. */
742 };
744 /* Give the specifications for the format attributes, used by C and all
745 descendants. */
748 {
749 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
750 affects_type_identity } */
756 };
758 /* Return identifier for address space AS. */
762 {
766 }
768 /* Push current bindings for the function name VAR_DECLS. */
770 void
772 {
777 {
781 {
783 saved);
785 }
786 }
788 /* Normally they'll have been NULL, so only push if we've got a
789 stack, or they are non-NULL. */
791 saved_function_name_decls);
792 }
794 /* Finish up the current bindings, adding them into the current function's
795 statement tree. This must be done _before_ finish_stmt_tree is called.
796 If there is no current function, we must be at file scope and no statements
797 are involved. Pop the previous bindings. */
799 void
801 {
810 {
818 }
824 {
825 /* We had saved values, restore them. */
826 tree saved;
829 {
834 }
836 }
838 }
840 /* Return the text name of the current function, suitably prettified
841 by PRETTY_P. Return string must be freed by caller. */
845 {
852 {
855 }
868 {
871 }
874 }
876 /* Return the VAR_DECL for a const char array naming the current
877 function. If the VAR_DECL has not yet been created, create it
878 now. RID indicates how it should be formatted and IDENTIFIER_NODE
879 ID is its name (unfortunately C and C++ hold the RID values of
880 keywords in different places, so we can't derive RID from ID in
881 this language independent code. LOC is the location of the
882 function. */
884 tree
886 {
896 {
897 /* If a tree is built here, it would normally have the lineno of
898 the current statement. Later this tree will be moved to the
899 beginning of the function and this line number will be wrong.
900 To avoid this problem set the lineno to 0 here; that prevents
901 it from appearing in the RTL. */
902 tree stmts;
910 saved_function_name_decls
914 }
919 }
921 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
923 tree
925 {
930 /* Compute the number of elements, for the array type. */
932 {
935 }
937 {
940 }
942 {
945 }
946 else
947 {
950 }
952 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
953 limit in C++98 Annex B is very large (65536) and is not normative,
954 so we do not diagnose it (warn_overlength_strings is forced off
955 in c_common_post_options). */
957 {
961 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
962 separate the %d from the 'C'. 'ISO' should not be
963 translated, but it may be moved after 'C%d' in languages
964 where modifiers follow nouns. */
966 "string length %qd is greater than the length %qd "
969 }
971 /* Create the array type for the string constant. The ISO C++
972 standard says that a string literal has type `const char[N]' or
973 `const wchar_t[N]'. We use the same logic when invoked as a C
974 front-end with -Wwrite-strings.
975 ??? We should change the type of an expression depending on the
976 state of a warning flag. We should just be warning -- see how
977 this is handled in the C++ front-end for the deprecated implicit
978 conversion from string literals to `char*' or `wchar_t*'.
980 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
981 array type being the unqualified version of that type.
982 Therefore, if we are constructing an array of const char, we must
983 construct the matching unqualified array type first. The C front
984 end does not require this, but it does no harm, so we do it
985 unconditionally. */
996 }
997 \f
998 /* If DISABLE is true, stop issuing warnings. This is used when
999 parsing code that we know will not be executed. This function may
1000 be called multiple times, and works as a stack. */
1002 static void
1004 {
1006 {
1009 }
1010 }
1012 /* If ENABLE is true, reenable issuing warnings. */
1014 static void
1016 {
1018 {
1021 }
1022 }
1024 /* Fully fold EXPR, an expression that was not folded (beyond integer
1025 constant expressions and null pointer constants) when being built
1026 up. If IN_INIT, this is in a static initializer and certain
1027 changes are made to the folding done. Clear *MAYBE_CONST if
1028 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1029 expression because it contains an evaluated operator (in C99) or an
1030 operator outside of sizeof returning an integer constant (in C90)
1031 not permitted in constant expressions, or because it contains an
1032 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1033 set to true by callers before calling this function.) Return the
1034 folded expression. Function arguments have already been folded
1035 before calling this function, as have the contents of SAVE_EXPR,
1036 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1037 C_MAYBE_CONST_EXPR. */
1039 tree
1041 {
1042 tree ret;
1048 /* This function is not relevant to C++ because C++ folds while
1049 parsing, and may need changes to be correct for C++ when C++
1050 stops folding while parsing. */
1057 {
1060 }
1067 }
1069 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1070 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1071 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1072 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1073 both evaluated and unevaluated subexpressions while
1074 *MAYBE_CONST_ITSELF is carried from only evaluated
1075 subexpressions). */
1077 static tree
1080 {
1092 /* This function is not relevant to C++ because C++ folds while
1093 parsing, and may need changes to be correct for C++ when C++
1094 stops folding while parsing. */
1098 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1099 anything else not counted as an expression cannot usefully be
1100 folded further at this point. */
1106 /* Operands of variable-length expressions (function calls) have
1107 already been folded, as have __builtin_* function calls, and such
1108 expressions cannot occur in constant expressions. */
1110 {
1114 }
1117 {
1126 else
1129 }
1131 /* Assignment, increment, decrement, function call and comma
1132 operators, and statement expressions, cannot occur in constant
1133 expressions if evaluated / outside of sizeof. (Function calls
1134 were handled above, though VA_ARG_EXPR is treated like a function
1135 call here, and statement expressions are handled through
1136 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1138 {
1158 }
1160 /* Fold individual tree codes as appropriate. */
1162 {
1164 /* Any non-constancy will have been marked in a containing
1165 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1173 maybe_const_itself);
1178 {
1181 }
1190 maybe_const_itself);
1193 maybe_const_itself);
1199 {
1203 }
1245 /* Binary operations evaluating both arguments (increment and
1246 decrement are binary internally in GCC). */
1250 maybe_const_itself);
1258 /* The RHS of a MODIFY_EXPR was fully folded when building that
1259 expression for the sake of conversion warnings. */
1262 maybe_const_itself);
1266 ret = in_init
1269 else
1280 CASE_CONVERT:
1290 /* Unary operations. */
1293 maybe_const_itself);
1297 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1298 not prepared to deal with them if they occur in initializers. */
1306 ret = in_init
1309 else
1314 {
1318 }
1320 {
1323 CASE_CONVERT:
1324 /* Don't warn about explicit conversions. We will already
1325 have warned about suspect implicit conversions. */
1332 }
1337 /* Binary operations not necessarily evaluating both
1338 arguments. */
1345 ? truthvalue_false_node
1353 ret = in_init
1356 else
1361 && op0_const
1362 && op0_const_self
1368 && op0_const_self
1394 else
1399 && op0_const
1400 && op0_const_self
1404 && op0_const_self
1408 && op0_const
1409 && op0_const_self
1413 && op0_const_self
1419 /* Each case where an operand with excess precision may be
1420 encountered must remove the EXCESS_PRECISION_EXPR around
1421 inner operands and possibly put one around the whole
1422 expression or possibly convert to the semantic type (which
1423 c_fully_fold does); we cannot tell at this stage which is
1424 appropriate in any particular case. */
1428 /* Various codes may appear through folding built-in functions
1429 and their arguments. */
1431 }
1433 out:
1434 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1435 have been done by this point, so remove them again. */
1439 {
1443 }
1447 }
1449 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1450 return EXP. Otherwise, return either EXP or its known constant
1451 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1452 Is the BLKmode test appropriate? */
1454 tree
1456 {
1457 tree ret;
1459 /* This function is only used by C, for c_fully_fold and other
1460 optimization, and may not be correct for C++. */
1471 /* Avoid unwanted tree sharing between the initializer and current
1472 function's body where the tree can be modified e.g. by the
1473 gimplifier. */
1477 }
1479 /* Print a warning if a constant expression had overflow in folding.
1480 Invoke this function on every expression that the language
1481 requires to be a constant expression.
1482 Note the ANSI C standard says it is erroneous for a
1483 constant expression to overflow. */
1485 void
1487 {
1495 }
1497 /* The same as above but print an unconditional error. */
1498 void
1500 {
1507 }
1509 /* Print a warning if an expression had overflow in folding and its
1510 operands hadn't.
1512 Invoke this function on every expression that
1513 (1) appears in the source code, and
1514 (2) is a constant expression that overflowed, and
1515 (3) is not already checked by convert_and_check;
1516 however, do not invoke this function on operands of explicit casts
1517 or when the expression is the result of an operator and any operand
1518 already overflowed. */
1520 void
1522 {
1527 {
1556 }
1557 }
1559 /* Warn about uses of logical || / && operator in a context where it
1560 is likely that the bitwise equivalent was intended by the
1561 programmer. We have seen an expression in which CODE is a binary
1562 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1563 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1564 void
1568 {
1580 /* Warn if &&/|| are being used in a context where it is
1581 likely that the bitwise equivalent was intended by the
1582 programmer. That is, an expression such as op && MASK
1583 where op should not be any boolean expression, nor a
1584 constant, and mask seems to be a non-boolean integer constant. */
1592 {
1596 else
1601 }
1603 /* We do not warn for constants because they are typical of macro
1604 expansions that test for features. */
1608 /* This warning only makes sense with logical operands. */
1616 /* We first test whether either side separately is trivially true
1617 (with OR) or trivially false (with AND). If so, do not warn.
1618 This is a common idiom for testing ranges of data types in
1619 portable code. */
1626 /* If this is an OR operation, invert both sides; now, the result
1627 should be always false to get a warning. */
1641 /* If this is an OR operation, invert both sides; now, the result
1642 should be always false to get a warning. */
1650 /* If both expressions have the same operand, if we can merge the
1651 ranges, and if the range test is always false, then warn. */
1658 {
1661 "logical %<or%> "
1663 else
1665 "logical %<and%> "
1667 }
1668 }
1671 /* Warn if EXP contains any computations whose results are not used.
1672 Return true if a warning is printed; false otherwise. LOCUS is the
1673 (potential) location of the expression. */
1675 bool
1677 {
1678 restart:
1682 /* Don't warn about void constructs. This includes casting to void,
1683 void function calls, and statement expressions with a final cast
1684 to void. */
1692 {
1708 /* For a binding, warn if no side effect within it. */
1720 /* In && or ||, warn if 2nd operand has no side effect. */
1727 /* Let people do `(foo (), 0)' without a warning. */
1734 /* If this is an expression with side effects, don't warn; this
1735 case commonly appears in macro expansions. */
1741 /* Don't warn about automatic dereferencing of references, since
1742 the user cannot control it. */
1744 {
1747 }
1748 /* Fall through. */
1751 /* Referencing a volatile value is a side effect, so don't warn. */
1756 /* If this is an expression which has no operands, there is no value
1757 to be unused. There are no such language-independent codes,
1758 but front ends may define such. */
1762 warn:
1764 }
1765 }
1768 /* Print a warning about casts that might indicate violation
1769 of strict aliasing rules if -Wstrict-aliasing is used and
1770 strict aliasing mode is in effect. OTYPE is the original
1771 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1773 bool
1775 {
1776 /* Strip pointer conversion chains and get to the correct original type. */
1784 /* If the type we are casting to is a ref-all pointer
1785 dereferencing it is always valid. */
1792 {
1793 /* Casting the address of an object to non void pointer. Warn
1794 if the cast breaks type based aliasing. */
1796 {
1800 }
1801 else
1802 {
1803 /* warn_strict_aliasing >= 3. This includes the default (3).
1804 Only warn if the cast is dereferenced immediately. */
1805 alias_set_type set1 =
1811 {
1815 }
1818 {
1822 }
1823 }
1824 }
1825 else
1827 {
1828 /* At this level, warn for any conversions, even if an address is
1829 not taken in the same statement. This will likely produce many
1830 false positives, but could be useful to pinpoint problems that
1831 are not revealed at higher levels. */
1836 {
1840 }
1841 }
1844 }
1846 /* Warn for unlikely, improbable, or stupid DECL declarations
1847 of `main'. */
1849 void
1851 {
1852 function_args_iterator iter;
1853 tree type;
1857 {
1858 /* XXX void_type_node belies the abstraction. */
1864 {
1886 "third argument of %q+D should probably be "
1889 }
1890 }
1892 /* It is intentional that this message does not mention the third
1893 argument because it's only mentioned in an appendix of the
1894 standard. */
1898 }
1900 /* True if pointers to distinct types T1 and T2 can be converted to
1901 each other without an explicit cast. Only returns true for opaque
1902 vector types. */
1903 bool
1905 {
1912 }
1914 /* True if vector types T1 and T2 can be converted to each other
1915 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1916 can only be converted with -flax-vector-conversions yet that is not
1917 in effect, emit a note telling the user about that option if such
1918 a note has not previously been emitted. */
1919 bool
1921 {
1929 convertible_lax =
1944 {
1947 "conversions between vectors with differing "
1949 }
1952 }
1954 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1955 to integral type. */
1957 static tree
1959 {
1964 {
1965 /* C++0x scoped enumerations don't implicitly convert to integral
1966 type; if we stripped an explicit conversion to a larger type we
1967 need to replace it so common_type will still work. */
1971 }
1973 }
1975 /* This is a helper function of build_binary_op.
1977 For certain operations if both args were extended from the same
1978 smaller type, do the arithmetic in that type and then extend.
1980 BITWISE indicates a bitwise operation.
1981 For them, this optimization is safe only if
1982 both args are zero-extended or both are sign-extended.
1983 Otherwise, we might change the result.
1984 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1985 but calculated in (unsigned short) it would be (unsigned short)-1.
1986 */
1987 tree
1989 {
1993 tree type;
1995 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1996 excessive narrowing when we call get_narrower below. For
1997 example, suppose that OP0 is of unsigned int extended
1998 from signed char and that RESULT_TYPE is long long int.
1999 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2000 like
2002 (long long int) (unsigned int) signed_char
2004 which get_narrower would narrow down to
2006 (unsigned int) signed char
2008 If we do not cast OP0 first, get_narrower would return
2009 signed_char, which is inconsistent with the case of the
2010 explicit cast. */
2017 /* UNS is 1 if the operation to be done is an unsigned one. */
2020 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2021 but it *requires* conversion to FINAL_TYPE. */
2032 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2034 /* For bitwise operations, signedness of nominal type
2035 does not matter. Consider only how operands were extended. */
2039 /* Note that in all three cases below we refrain from optimizing
2040 an unsigned operation on sign-extended args.
2041 That would not be valid. */
2043 /* Both args variable: if both extended in same way
2044 from same width, do it in that width.
2045 Do it unsigned if args were zero-extended. */
2052 return c_common_signed_or_unsigned_type
2059 && (type
2070 && (type
2078 }
2080 /* Checks if expression EXPR of real/integer type cannot be converted
2081 to the real/integer type TYPE. Function returns true when:
2082 * EXPR is a constant which cannot be exactly converted to TYPE
2083 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2084 for EXPR type and TYPE being both integers or both real.
2085 * EXPR is not a constant of real type and TYPE is an integer.
2086 * EXPR is not a constant of integer type which cannot be
2087 exactly converted to real type.
2088 Function allows conversions between types of different signedness and
2089 does not return true in that case. Function can produce signedness
2090 warnings if PRODUCE_WARNS is true. */
2091 bool
2093 {
2099 {
2100 /* Warn for real constant that is not an exact integer converted
2101 to integer type. */
2104 {
2107 }
2108 /* Warn for an integer constant that does not fit into integer type. */
2112 {
2115 {
2119 }
2121 {
2125 }
2126 else
2128 }
2130 {
2131 /* Warn for an integer constant that does not fit into real type. */
2133 {
2137 }
2138 /* Warn for a real constant that does not fit into a smaller
2139 real type. */
2142 {
2146 }
2147 }
2148 }
2149 else
2150 {
2151 /* Warn for real types converted to integer types. */
2158 {
2159 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2163 /* Don't warn for short y; short x = ((int)y & 0xff); */
2167 {
2168 /* If both args were extended from a shortest type,
2169 use that type if that is safe. */
2176 {
2182 /* If one of the operands is a non-negative constant
2183 that fits in the target type, then the type of the
2184 other operand does not matter. */
2193 /* If constant is unsigned and fits in the target
2194 type, then the result will also fit. */
2196 && unsigned0
2199 && unsigned1
2202 }
2203 }
2204 /* Warn for integer types converted to smaller integer types. */
2208 /* When they are the same width but different signedness,
2209 then the value may change. */
2212 /* Even when converted to a bigger type, if the type is
2213 unsigned but expr is signed, then negative values
2214 will be changed. */
2220 }
2222 /* Warn for integer types converted to real types if and only if
2223 all the range of values of the integer type cannot be
2224 represented by the real type. */
2227 {
2231 /* Don't warn about char y = 0xff; float x = (int) y; */
2243 }
2245 /* Warn for real types converted to smaller real types. */
2250 }
2253 }
2255 /* Warns if the conversion of EXPR to TYPE may alter a value.
2256 This is a helper function for warnings_for_convert_and_check. */
2258 static void
2260 {
2268 {
2281 /* Conversion from boolean to a signed:1 bit-field (which only
2282 can hold the values 0 and -1) doesn't lose information - but
2283 it does change the value. */
2298 {
2299 /* In case of COND_EXPR, if both operands are constants or
2300 COND_EXPR, then we do not care about the type of COND_EXPR,
2301 only about the conversion of each operand. */
2309 {
2313 }
2314 /* Fall through. */
2315 }
2322 }
2323 }
2325 /* Produce warnings after a conversion. RESULT is the result of
2326 converting EXPR to TYPE. This is a helper function for
2327 convert_and_check and cp_convert_and_check. */
2329 void
2331 {
2338 {
2339 /* Do not diagnose overflow in a constant expression merely
2340 because a conversion overflowed. */
2345 {
2346 /* This detects cases like converting -129 or 256 to
2347 unsigned char. */
2351 else
2353 }
2357 /* No warning for converting 0x80000000 to int. */
2365 else
2367 }
2372 else
2374 }
2377 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2378 Invoke this function on every expression that is converted implicitly,
2379 i.e. because of language rules and not because of an explicit cast. */
2381 tree
2383 {
2384 tree result;
2385 tree expr_for_warning;
2387 /* Convert from a value with possible excess precision rather than
2388 via the semantic type, but do not warn about values not fitting
2389 exactly in the semantic type. */
2391 {
2397 }
2398 else
2412 }
2413 \f
2414 /* A node in a list that describes references to variables (EXPR), which are
2415 either read accesses if WRITER is zero, or write accesses, in which case
2416 WRITER is the parent of EXPR. */
2417 struct tlist
2418 {
2421 };
2423 /* Used to implement a cache the results of a call to verify_tree. We only
2424 use this for SAVE_EXPRs. */
2425 struct tlist_cache
2426 {
2430 tree expr;
2431 };
2433 /* Obstack to use when allocating tlist structures, and corresponding
2434 firstobj. */
2438 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2439 warnings. */
2441 /* SAVE_EXPRs need special treatment. We process them only once and then
2442 cache the results. */
2454 /* Create a new struct tlist and fill in its fields. */
2457 {
2464 }
2466 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2467 is nonnull, we ignore any node we find which has a writer equal to it. */
2469 static void
2471 {
2473 {
2480 }
2481 }
2483 /* Merge the nodes of ADD into TO. This merging process is done so that for
2484 each variable that already exists in TO, no new node is added; however if
2485 there is a write access recorded in ADD, and an occurrence on TO is only
2486 a read access, then the occurrence in TO will be modified to record the
2487 write. */
2489 static void
2491 {
2498 {
2505 {
2509 }
2511 {
2515 }
2517 }
2518 }
2520 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2521 references in list LIST conflict with it, excluding reads if ONLY writers
2522 is nonzero. */
2524 static void
2527 {
2530 /* Avoid duplicate warnings. */
2536 {
2540 {
2545 }
2547 }
2548 }
2550 /* Given a list LIST of references to variables, find whether any of these
2551 can cause conflicts due to missing sequence points. */
2553 static void
2555 {
2559 {
2562 }
2563 }
2565 /* Return nonzero if X is a tree that can be verified by the sequence point
2566 warnings. */
2567 static int
2569 {
2576 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2577 (lvalue_p) crash on TRY/CATCH. */
2584 /* No point to track non-const calls, they will never satisfy
2585 operand_equal_p. */
2593 }
2595 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2596 static bool
2598 {
2600 }
2602 /* Walk the tree X, and record accesses to variables. If X is written by the
2603 parent tree, WRITER is the parent.
2604 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2605 expression or its only operand forces a sequence point, then everything up
2606 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2607 in PNO_SP.
2608 Once we return, we will have emitted warnings if any subexpression before
2609 such a sequence point could be undefined. On a higher level, however, the
2610 sequence point may not be relevant, and we'll merge the two lists.
2612 Example: (b++, a) + b;
2613 The call that processes the COMPOUND_EXPR will store the increment of B
2614 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2615 processes the PLUS_EXPR will need to merge the two lists so that
2616 eventually, all accesses end up on the same list (and we'll warn about the
2617 unordered subexpressions b++ and b.
2619 A note on merging. If we modify the former example so that our expression
2620 becomes
2621 (b++, b) + a
2622 care must be taken not simply to add all three expressions into the final
2623 PNO_SP list. The function merge_tlist takes care of that by merging the
2624 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2625 way, so that no more than one access to B is recorded. */
2627 static void
2629 tree writer)
2630 {
2635 /* X may be NULL if it is the operand of an empty statement expression
2636 ({ }). */
2640 restart:
2648 {
2680 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2681 two first, to avoid warning for (a ? b++ : b++). */
2697 /* Expressions inside the LHS are not ordered wrt. the sequence points
2698 in the RHS. Example:
2699 *a = (a++, 2)
2700 Despite the fact that the modification of "a" is in the before_sp
2701 list (tmp_before), it conflicts with the use of "a" in the LHS.
2702 We can handle this by adding the contents of tmp_list3
2703 to those of tmp_before, and redoing the collision warnings for that
2704 list. */
2707 /* Exclude the LHS itself here; we first have to merge it into the
2708 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2709 didn't exclude the LHS, we'd get it twice, once as a read and once
2710 as a write. */
2721 /* We need to warn about conflicts among arguments and conflicts between
2722 args and the function address. Side effects of the function address,
2723 however, are not ordered by the sequence point of the call. */
2724 {
2725 call_expr_arg_iterator iter;
2726 tree arg;
2730 {
2735 }
2740 }
2743 /* Scan all the list, e.g. indices of multi dimensional array. */
2745 {
2751 }
2755 {
2762 {
2774 {
2778 }
2781 }
2785 }
2795 /* For other expressions, simply recurse on their operands.
2796 Manual tail recursion for unary expressions.
2797 Other non-expressions need not be processed. */
2799 {
2803 }
2805 {
2809 {
2814 }
2815 }
2817 }
2818 }
2820 /* Try to warn for undefined behavior in EXPR due to missing sequence
2821 points. */
2823 DEBUG_FUNCTION void
2825 {
2831 {
2834 }
2839 }
2840 \f
2841 /* Validate the expression after `case' and apply default promotions. */
2843 static tree
2845 {
2850 /* Promote char or short to int. */
2853 {
2856 }
2861 }
2862 \f
2863 /* See if the case values LOW and HIGH are in the range of the original
2864 type (i.e. before the default conversion to int) of the switch testing
2865 expression.
2866 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2867 the type before promoting it. CASE_LOW_P is a pointer to the lower
2868 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2869 if the case is not a case range.
2870 The caller has to make sure that we are not called with NULL for
2871 CASE_LOW_P (i.e. the default case).
2872 Returns true if the case label is in range of ORIG_TYPE (saturated or
2873 untouched) or false if the label is out of range. */
2875 static bool
2878 {
2883 /* If there was a problem with the original type, do nothing. */
2890 /* Case label is less than minimum for type. */
2893 {
2896 }
2898 /* Case value is greater than maximum for type. */
2901 {
2904 }
2906 /* Saturate lower case label value to minimum. */
2909 {
2913 }
2915 /* Saturate upper case label value to maximum. */
2918 {
2922 }
2930 }
2931 \f
2932 /* Return an integer type with BITS bits of precision,
2933 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2935 tree
2937 {
2976 }
2978 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2979 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2980 and saturating if SATP is nonzero, otherwise not saturating. */
2982 tree
2985 {
2989 else
2997 {
2999 "fixed-point types that have too many integral and "
3002 }
3005 }
3007 /* Used for communication between c_common_type_for_mode and
3008 c_register_builtin_type. */
3011 /* Return a data type that has machine mode MODE.
3012 If the mode is an integer,
3013 then UNSIGNEDP selects between signed and unsigned types.
3014 If the mode is a fixed-point mode,
3015 then UNSIGNEDP selects between saturating and nonsaturating types. */
3017 tree
3019 {
3020 tree t;
3057 #if HOST_BITS_PER_WIDE_INT >= 64
3060 #endif
3085 {
3087 tree inner_type;
3103 }
3105 {
3110 }
3120 {
3206 }
3214 }
3216 tree
3218 {
3220 }
3222 /* Return a signed type the same as TYPE in other respects. */
3224 tree
3226 {
3228 }
3230 /* Return a type the same as TYPE except unsigned or
3231 signed according to UNSIGNEDP. */
3233 tree
3235 {
3236 tree type1;
3238 /* This block of code emulates the behavior of the old
3239 c_common_unsigned_type. In particular, it returns
3240 long_unsigned_type_node if passed a long, even when a int would
3241 have the same size. This is necessary for warnings to work
3242 correctly in archs where sizeof(int) == sizeof(long) */
3245 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3261 #if HOST_BITS_PER_WIDE_INT >= 64
3264 #endif
3274 #define C_COMMON_FIXED_TYPES(NAME) \
3275 if (type1 == short_ ## NAME ## _type_node \
3276 || type1 == unsigned_short_ ## NAME ## _type_node) \
3277 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3278 : short_ ## NAME ## _type_node; \
3279 if (type1 == NAME ## _type_node \
3280 || type1 == unsigned_ ## NAME ## _type_node) \
3281 return unsignedp ? unsigned_ ## NAME ## _type_node \
3282 : NAME ## _type_node; \
3283 if (type1 == long_ ## NAME ## _type_node \
3284 || type1 == unsigned_long_ ## NAME ## _type_node) \
3285 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3286 : long_ ## NAME ## _type_node; \
3287 if (type1 == long_long_ ## NAME ## _type_node \
3288 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3289 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3290 : long_long_ ## NAME ## _type_node;
3292 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3293 if (type1 == NAME ## _type_node \
3294 || type1 == u ## NAME ## _type_node) \
3295 return unsignedp ? u ## NAME ## _type_node \
3296 : NAME ## _type_node;
3298 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3299 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3300 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3301 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3302 : sat_ ## short_ ## NAME ## _type_node; \
3303 if (type1 == sat_ ## NAME ## _type_node \
3304 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3305 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3306 : sat_ ## NAME ## _type_node; \
3307 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3308 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3309 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3310 : sat_ ## long_ ## NAME ## _type_node; \
3311 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3312 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3313 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3314 : sat_ ## long_long_ ## NAME ## _type_node;
3316 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3317 if (type1 == sat_ ## NAME ## _type_node \
3318 || type1 == sat_ ## u ## NAME ## _type_node) \
3319 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3320 : sat_ ## NAME ## _type_node;
3346 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3347 the precision; they have precision set to match their range, but
3348 may use a wider mode to match an ABI. If we change modes, we may
3349 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3350 the precision as well, so as to yield correct results for
3351 bit-field types. C++ does not have these separate bit-field
3352 types, and producing a signed or unsigned variant of an
3353 ENUMERAL_TYPE may cause other problems as well. */
3359 #define TYPE_OK(node) \
3360 (TYPE_MODE (type) == TYPE_MODE (node) \
3361 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3380 #if HOST_BITS_PER_WIDE_INT >= 64
3383 #endif
3392 #undef TYPE_OK
3395 }
3397 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3399 tree
3401 {
3402 /* Extended integer types of the same width as a standard type have
3403 lesser rank, so those of the same width as int promote to int or
3404 unsigned int and are valid for printf formats expecting int or
3405 unsigned int. To avoid such special cases, avoid creating
3406 extended integer types for bit-fields if a standard integer type
3407 is available. */
3424 }
3426 /* The C version of the register_builtin_type langhook. */
3428 void
3430 {
3431 tree decl;
3441 }
3442 \f
3443 /* Print an error message for invalid operands to arith operation
3444 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3445 LOCATION is the location of the message. */
3447 void
3450 {
3454 {
3499 }
3503 }
3504 \f
3505 /* Given an expression as a tree, return its original type. Do this
3506 by stripping any conversion that preserves the sign and precision. */
3507 static tree
3509 {
3512 }
3514 /* Subroutine of build_binary_op, used for comparison operations.
3515 See if the operands have both been converted from subword integer types
3516 and, if so, perhaps change them both back to their original type.
3517 This function is also responsible for converting the two operands
3518 to the proper common type for comparison.
3520 The arguments of this function are all pointers to local variables
3521 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3522 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3524 If this function returns nonzero, it means that the comparison has
3525 a constant value. What this function returns is an expression for
3526 that value. */
3528 tree
3531 {
3532 tree type;
3541 /* Throw away any conversions to wider types
3542 already present in the operands. */
3547 /* If primopN is first sign-extended from primopN's precision to opN's
3548 precision, then zero-extended from opN's precision to
3549 *restype_ptr precision, shortenings might be invalid. */
3552 && !unsignedp0
3557 && !unsignedp1
3561 /* Handle the case that OP0 does not *contain* a conversion
3562 but it *requires* conversion to FINAL_TYPE. */
3569 /* If one of the operands must be floated, we cannot optimize. */
3573 /* If first arg is constant, swap the args (changing operation
3574 so value is preserved), for canonicalization. Don't do this if
3575 the second arg is 0. */
3580 {
3597 {
3612 }
3614 }
3616 /* If comparing an integer against a constant more bits wide,
3617 maybe we can deduce a value of 1 or 0 independent of the data.
3618 Or else truncate the constant now
3619 rather than extend the variable at run time.
3621 This is only interesting if the constant is the wider arg.
3622 Also, it is not safe if the constant is unsigned and the
3623 variable arg is signed, since in this case the variable
3624 would be sign-extended and then regarded as unsigned.
3625 Our technique fails in this case because the lowest/highest
3626 possible unsigned results don't follow naturally from the
3627 lowest/highest possible values of the variable operand.
3628 For just EQ_EXPR and NE_EXPR there is another technique that
3629 could be used: see if the constant can be faithfully represented
3630 in the other operand's type, by truncating it and reextending it
3631 and see if that preserves the constant's value. */
3637 {
3640 /* 1 if comparison is nominally unsigned. */
3642 tree val;
3654 {
3655 /* Convert primop1 to target type, but do not introduce
3656 additional overflow. We know primop1 is an int_cst. */
3660 }
3662 {
3665 }
3668 {
3673 }
3674 else
3675 {
3680 }
3683 /* This used to be a switch, but Genix compiler can't handle that. */
3685 {
3688 }
3690 {
3693 }
3695 {
3700 }
3702 {
3707 }
3709 {
3714 }
3716 {
3721 }
3723 /* If primop0 was sign-extended and unsigned comparison specd,
3724 we did a signed comparison above using the signed type bounds.
3725 But the comparison we output must be unsigned.
3727 Also, for inequalities, VAL is no good; but if the signed
3728 comparison had *any* fixed result, it follows that the
3729 unsigned comparison just tests the sign in reverse
3730 (positive values are LE, negative ones GE).
3731 So we can generate an unsigned comparison
3732 against an extreme value of the signed type. */
3735 {
3738 {
3753 }
3755 }
3759 {
3766 }
3769 {
3770 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3774 }
3776 /* Value is not predetermined, but do the comparison
3777 in the type of the operand that is not constant.
3778 TYPE is already properly set. */
3779 }
3781 /* If either arg is decimal float and the other is float, find the
3782 proper common type to use for comparison. */
3793 /* If args' natural types are both narrower than nominal type
3794 and both extend in the same manner, compare them
3795 in the type of the wider arg.
3796 Otherwise must actually extend both to the nominal
3797 common type lest different ways of extending
3798 alter the result.
3799 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3804 {
3808 type);
3809 /* Make sure shorter operand is extended the right way
3810 to match the longer operand. */
3811 primop0
3814 primop0);
3815 primop1
3818 primop1);
3819 }
3820 else
3821 {
3822 /* Here we must do the comparison on the nominal type
3823 using the args exactly as we received them. */
3830 {
3832 /* All unsigned values are >= 0, so we warn. However,
3833 if OP0 is a constant that is >= 0, the signedness of
3834 the comparison isn't an issue, so suppress the
3835 warning. */
3837 warn_type_limits && !in_system_header
3841 primop0)))
3842 /* Do not warn for enumeration types. */
3846 {
3863 }
3866 {
3867 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3872 }
3873 }
3874 }
3882 }
3883 \f
3884 /* Return a tree for the sum or difference (RESULTCODE says which)
3885 of pointer PTROP and integer INTOP. */
3887 tree
3890 {
3893 /* The result is a pointer of the same type that is being added. */
3897 {
3901 }
3903 {
3907 }
3909 {
3913 }
3914 else
3917 /* We are manipulating pointer values, so we don't need to warn
3918 about relying on undefined signed overflow. We disable the
3919 warning here because we use integer types so fold won't know that
3920 they are really pointers. */
3923 /* If what we are about to multiply by the size of the elements
3924 contains a constant term, apply distributive law
3925 and multiply that constant term separately.
3926 This helps produce common subexpressions. */
3931 /* If the constant comes from pointer subtraction,
3932 skip this optimization--it would cause an error. */
3934 /* If the constant is unsigned, and smaller than the pointer size,
3935 then we must skip this optimization. This is because it could cause
3936 an overflow error if the constant is negative but INTOP is not. */
3940 {
3945 /* Convert both subexpression types to the type of intop,
3946 because weird cases involving pointer arithmetic
3947 can result in a sum or difference with different type args. */
3952 }
3954 /* Convert the integer argument to a type the same size as sizetype
3955 so the multiply won't overflow spuriously. */
3961 /* Replace the integer argument with a suitable product by the object size.
3962 Do this multiplication as signed, then convert to the appropriate type
3963 for the pointer operation and disregard an overflow that occurred only
3964 because of the sign-extension change in the latter conversion. */
3965 {
3973 }
3975 /* Create the sum or difference. */
3984 }
3985 \f
3986 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3987 and if NON_CONST is known not to be permitted in an evaluated part
3988 of a constant expression. */
3990 tree
3992 {
3996 /* This should never be called for C++. */
4000 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4009 }
4011 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4012 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4013 around the SAVE_EXPR if needed so that c_fully_fold does not need
4014 to look inside SAVE_EXPRs. */
4016 tree
4018 {
4027 }
4029 /* Return whether EXPR is a declaration whose address can never be
4030 NULL. */
4032 bool
4034 {
4039 }
4041 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4042 or for an `if' or `while' statement or ?..: exp. It should already
4043 have been validated to be of suitable type; otherwise, a bad
4044 diagnostic may result.
4046 The EXPR is located at LOCATION.
4048 This preparation consists of taking the ordinary
4049 representation of an expression expr and producing a valid tree
4050 boolean expression describing whether expr is nonzero. We could
4051 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4052 but we optimize comparisons, &&, ||, and !.
4054 The resulting type should always be `truthvalue_type_node'. */
4056 tree
4058 {
4060 {
4102 ? truthvalue_true_node
4108 ? truthvalue_true_node
4113 /* Fall through. */
4116 {
4119 {
4120 /* Common Ada/Pascal programmer's mistake. */
4122 OPT_Waddress,
4124 inner);
4126 }
4128 }
4145 /* These don't change whether an object is nonzero or zero. */
4150 /* These don't change whether an object is zero or nonzero, but
4151 we can't ignore them if their second arg has side-effects. */
4153 {
4156 c_common_truthvalue_conversion
4159 }
4160 else
4165 /* Distribute the conversion into the arms of a COND_EXPR. */
4167 {
4170 /* In C++ one of the arms might have void type if it is throw. */
4178 }
4179 else
4180 {
4181 /* Folding will happen later for C. */
4189 }
4191 CASE_CONVERT:
4192 {
4196 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4197 since that affects how `default_conversion' will behave. */
4201 /* Don't strip a conversion from C++0x scoped enum, since they
4202 don't implicitly convert to other types. */
4206 /* If this isn't narrowing the argument, we can ignore it. */
4210 }
4216 {
4220 }
4225 }
4228 {
4230 expr = (build_binary_op
4234 c_common_truthvalue_conversion
4237 c_common_truthvalue_conversion
4242 }
4245 {
4250 }
4251 else
4254 ret:
4257 }
4258 \f
4267 /* Apply the TYPE_QUALS to the new DECL. */
4269 void
4271 {
4279 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4280 constructor can produce constant init, so rely on cp_finish_decl to
4281 clear TREE_READONLY if the variable has non-constant init. */
4284 {
4287 }
4289 {
4291 /* Allow 'restrict' on arrays of pointers.
4292 FIXME currently we just ignore it. */
4298 }
4299 }
4301 /* Hash function for the problem of multiple type definitions in
4302 different files. This must hash all types that will compare
4303 equal via comptypes to the same value. In practice it hashes
4304 on some of the simple stuff and leaves the details to comptypes. */
4306 static hashval_t
4308 {
4312 tree t2;
4314 {
4315 /* For pointers, hash on pointee type plus some swizzling. */
4318 /* Hash on number of elements and total size. */
4337 }
4338 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4339 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4341 /* We might have a VLA here. */
4344 else
4347 }
4351 /* Return the typed-based alias set for T, which may be an expression
4352 or a type. Return -1 if we don't do anything special. */
4354 alias_set_type
4356 {
4357 tree u;
4360 /* For VLAs, use the alias set of the element type rather than the
4361 default of alias set 0 for types compared structurally. */
4363 {
4367 }
4369 /* Permit type-punning when accessing a union, provided the access
4370 is directly through the union. For example, this code does not
4371 permit taking the address of a union member and then storing
4372 through it. Even the type-punning allowed here is a GCC
4373 extension, albeit a common and useful one; the C standard says
4374 that such accesses have implementation-defined behavior. */
4382 /* That's all the expressions we handle specially. */
4386 /* The C standard guarantees that any object may be accessed via an
4387 lvalue that has character type. */
4393 /* The C standard specifically allows aliasing between signed and
4394 unsigned variants of the same type. We treat the signed
4395 variant as canonical. */
4397 {
4400 /* t1 == t can happen for boolean nodes which are always unsigned. */
4403 }
4405 /* Handle the case of multiple type nodes referring to "the same" type,
4406 which occurs with IMA. These share an alias set. FIXME: Currently only
4407 C90 is handled. (In C99 type compatibility is not transitive, which
4408 complicates things mightily. The alias set splay trees can theoretically
4409 represent this, but insertion is tricky when you consider all the
4410 different orders things might arrive in.) */
4415 /* Save time if there's only one input file. */
4419 /* Pointers need special handling if they point to any type that
4420 needs special handling (below). */
4422 {
4423 tree t2;
4424 /* Find bottom type under any nested POINTERs. */
4428 ;
4436 }
4437 /* These are the only cases that need special handling. */
4444 /* Undefined? */
4448 /* Look up t in hash table. Only one of the compatible types within each
4449 alias set is recorded in the table. */
4453 NULL);
4456 {
4459 }
4460 else
4461 /* Our caller will assign and record (in t) a new alias set; all we need
4462 to do is remember t in the hash table. */
4466 }
4467 \f
4468 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4469 the second parameter indicates which OPERATOR is being applied.
4470 The COMPLAIN flag controls whether we should diagnose possibly
4471 ill-formed constructs or not. LOC is the location of the SIZEOF or
4472 TYPEOF operator. */
4474 tree
4477 {
4485 {
4487 {
4494 }
4495 else
4496 {
4498 {
4502 else
4505 }
4507 }
4508 }
4510 {
4518 }
4521 {
4526 }
4529 {
4534 }
4535 else
4536 {
4538 /* Convert in case a char is more than one unit. */
4542 else
4544 }
4546 /* VALUE will have the middle-end integer type sizetype.
4547 However, we should really return a value of type `size_t',
4548 which is just a typedef for an ordinary integer type. */
4552 }
4554 /* Implement the __alignof keyword: Return the minimum required
4555 alignment of EXPR, measured in bytes. For VAR_DECLs,
4556 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4557 from an "aligned" __attribute__ specification). LOC is the
4558 location of the ALIGNOF operator. */
4560 tree
4562 {
4563 tree t;
4570 {
4573 }
4579 {
4586 {
4593 }
4595 }
4596 else
4600 }
4601 \f
4602 /* Handle C and C++ default attributes. */
4604 enum built_in_attribute
4605 {
4606 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4607 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4608 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4609 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4610 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4612 #undef DEF_ATTR_NULL_TREE
4613 #undef DEF_ATTR_INT
4614 #undef DEF_ATTR_STRING
4615 #undef DEF_ATTR_IDENT
4616 #undef DEF_ATTR_TREE_LIST
4617 ATTR_LAST
4618 };
4624 enum c_builtin_type
4625 {
4626 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4627 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4628 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4629 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4630 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4631 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4632 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4633 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4634 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4635 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4636 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4637 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4638 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4639 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4640 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4641 NAME,
4642 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4644 #undef DEF_PRIMITIVE_TYPE
4645 #undef DEF_FUNCTION_TYPE_0
4646 #undef DEF_FUNCTION_TYPE_1
4647 #undef DEF_FUNCTION_TYPE_2
4648 #undef DEF_FUNCTION_TYPE_3
4649 #undef DEF_FUNCTION_TYPE_4
4650 #undef DEF_FUNCTION_TYPE_5
4651 #undef DEF_FUNCTION_TYPE_6
4652 #undef DEF_FUNCTION_TYPE_7
4653 #undef DEF_FUNCTION_TYPE_VAR_0
4654 #undef DEF_FUNCTION_TYPE_VAR_1
4655 #undef DEF_FUNCTION_TYPE_VAR_2
4656 #undef DEF_FUNCTION_TYPE_VAR_3
4657 #undef DEF_FUNCTION_TYPE_VAR_4
4658 #undef DEF_FUNCTION_TYPE_VAR_5
4659 #undef DEF_POINTER_TYPE
4660 BT_LAST
4661 };
4665 /* A temporary array for c_common_nodes_and_builtins. Used in
4666 communication with def_fn_type. */
4669 /* A helper function for c_common_nodes_and_builtins. Build function type
4670 for DEF with return type RET and N arguments. If VAR is true, then the
4671 function should be variadic after those N arguments.
4673 Takes special care not to ICE if any of the types involved are
4674 error_mark_node, which indicates that said type is not in fact available
4675 (see builtin_type_for_size). In which case the function type as a whole
4676 should be error_mark_node. */
4678 static void
4680 {
4681 tree t;
4688 {
4694 }
4701 else
4704 egress:
4707 }
4709 /* Build builtin functions common to both C and C++ language
4710 frontends. */
4712 static void
4714 {
4715 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4716 builtin_types[ENUM] = VALUE;
4717 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4718 def_fn_type (ENUM, RETURN, 0, 0);
4719 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4720 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4721 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4722 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4723 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4724 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4725 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4726 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4727 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4728 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4729 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4730 ARG6) \
4731 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4732 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4733 ARG6, ARG7) \
4734 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4735 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4736 def_fn_type (ENUM, RETURN, 1, 0);
4737 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4738 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4739 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4740 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4741 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4742 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4743 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4744 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4745 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4746 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4747 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4748 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4752 #undef DEF_PRIMITIVE_TYPE
4753 #undef DEF_FUNCTION_TYPE_1
4754 #undef DEF_FUNCTION_TYPE_2
4755 #undef DEF_FUNCTION_TYPE_3
4756 #undef DEF_FUNCTION_TYPE_4
4757 #undef DEF_FUNCTION_TYPE_5
4758 #undef DEF_FUNCTION_TYPE_6
4759 #undef DEF_FUNCTION_TYPE_VAR_0
4760 #undef DEF_FUNCTION_TYPE_VAR_1
4761 #undef DEF_FUNCTION_TYPE_VAR_2
4762 #undef DEF_FUNCTION_TYPE_VAR_3
4763 #undef DEF_FUNCTION_TYPE_VAR_4
4764 #undef DEF_FUNCTION_TYPE_VAR_5
4765 #undef DEF_POINTER_TYPE
4770 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4771 NONANSI_P, ATTRS, IMPLICIT, COND) \
4772 if (NAME && COND) \
4773 def_builtin_1 (ENUM, NAME, CLASS, \
4774 builtin_types[(int) TYPE], \
4775 builtin_types[(int) LIBTYPE], \
4776 BOTH_P, FALLBACK_P, NONANSI_P, \
4777 built_in_attributes[(int) ATTRS], IMPLICIT);
4779 #undef DEF_BUILTIN
4787 }
4789 /* Like get_identifier, but avoid warnings about null arguments when
4790 the argument may be NULL for targets where GCC lacks stdint.h type
4791 information. */
4795 {
4797 }
4799 /* Build tree nodes and builtin functions common to both C and C++ language
4800 frontends. */
4802 void
4804 {
4808 tree array_domain_type;
4809 tree va_list_ref_type_node;
4810 tree va_list_arg_type_node;
4814 /* Define `int' and `char' first so that dbx will output them first. */
4818 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4819 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4820 but not C. Are the conditionals here needed? */
4826 long_unsigned_type_node);
4828 {
4830 int128_integer_type_node);
4832 int128_unsigned_type_node);
4833 }
4837 long_long_integer_type_node);
4839 long_long_unsigned_type_node);
4842 long_long_unsigned_type_node);
4845 short_unsigned_type_node);
4848 short_unsigned_type_node);
4850 /* Define both `signed char' and `unsigned char'. */
4854 /* These are types that c_common_type_for_size and
4855 c_common_type_for_mode use. */
4858 intQI_type_node));
4861 intHI_type_node));
4864 intSI_type_node));
4867 intDI_type_node));
4868 #if HOST_BITS_PER_WIDE_INT >= 64
4871 TYPE_DECL,
4873 intTI_type_node));
4874 #endif
4877 unsigned_intQI_type_node));
4880 unsigned_intHI_type_node));
4883 unsigned_intSI_type_node));
4886 unsigned_intDI_type_node));
4887 #if HOST_BITS_PER_WIDE_INT >= 64
4890 TYPE_DECL,
4892 unsigned_intTI_type_node));
4893 #endif
4895 /* Create the widest literal types. */
4896 widest_integer_literal_type_node
4900 widest_integer_literal_type_node));
4902 widest_unsigned_literal_type_node
4906 widest_unsigned_literal_type_node));
4910 pid_type_node =
4917 /* Only supported decimal floating point extension if the target
4918 actually supports underlying modes. */
4922 {
4926 }
4929 {
4934 long_long_fract_type_node);
4936 unsigned_short_fract_type_node);
4938 unsigned_fract_type_node);
4940 unsigned_long_fract_type_node);
4942 unsigned_long_long_fract_type_node);
4944 sat_short_fract_type_node);
4947 sat_long_fract_type_node);
4949 sat_long_long_fract_type_node);
4951 sat_unsigned_short_fract_type_node);
4953 sat_unsigned_fract_type_node);
4955 sat_unsigned_long_fract_type_node);
4957 sat_unsigned_long_long_fract_type_node);
4962 long_long_accum_type_node);
4964 unsigned_short_accum_type_node);
4966 unsigned_accum_type_node);
4968 unsigned_long_accum_type_node);
4970 unsigned_long_long_accum_type_node);
4972 sat_short_accum_type_node);
4975 sat_long_accum_type_node);
4977 sat_long_long_accum_type_node);
4979 sat_unsigned_short_accum_type_node);
4981 sat_unsigned_accum_type_node);
4983 sat_unsigned_long_accum_type_node);
4985 sat_unsigned_long_long_accum_type_node);
4987 }
4990 TYPE_DECL,
4992 complex_integer_type_node));
4994 TYPE_DECL,
4996 complex_float_type_node));
4998 TYPE_DECL,
5000 complex_double_type_node));
5004 complex_long_double_type_node));
5007 /* For C++, make fileptr_type_node a distinct void * type until
5008 FILE type is defined. */
5013 /* Set the TYPE_NAME for any variants that were built before
5014 record_builtin_type gave names to the built-in types. */
5015 {
5021 }
5023 /* This node must not be shared. */
5029 /* Make a type to be the domain of a few array types
5030 whose domains don't really matter.
5031 200 is small enough that it always fits in size_t
5032 and large enough that it can hold most function names for the
5033 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5036 /* Make a type for arrays of characters.
5037 With luck nothing will ever really depend on the length of this
5038 array type. */
5039 char_array_type_node
5042 /* Likewise for arrays of ints. */
5043 int_array_type_node
5047 const_string_type_node
5051 /* This is special for C++ so functions can be overloaded. */
5057 {
5060 else
5063 }
5065 /* This is for wide string constants. */
5066 wchar_array_type_node
5069 /* Define 'char16_t'. */
5074 {
5079 }
5081 /* This is for UTF-16 string constants. */
5082 char16_array_type_node
5085 /* Define 'char32_t'. */
5090 {
5095 }
5097 /* This is for UTF-32 string constants. */
5098 char32_array_type_node
5101 wint_type_node =
5104 intmax_type_node =
5106 uintmax_type_node =
5110 sig_atomic_type_node =
5113 int8_type_node =
5116 int16_type_node =
5119 int32_type_node =
5122 int64_type_node =
5125 uint8_type_node =
5128 c_uint16_type_node =
5131 c_uint32_type_node =
5134 c_uint64_type_node =
5137 int_least8_type_node =
5140 int_least16_type_node =
5143 int_least32_type_node =
5146 int_least64_type_node =
5149 uint_least8_type_node =
5152 uint_least16_type_node =
5155 uint_least32_type_node =
5158 uint_least64_type_node =
5161 int_fast8_type_node =
5164 int_fast16_type_node =
5167 int_fast32_type_node =
5170 int_fast64_type_node =
5173 uint_fast8_type_node =
5176 uint_fast16_type_node =
5179 uint_fast32_type_node =
5182 uint_fast64_type_node =
5185 intptr_type_node =
5188 uintptr_type_node =
5191 default_function_type
5193 ptrdiff_type_node
5200 va_list_type_node));
5202 {
5205 tree ptype;
5208 {
5212 ptype));
5214 }
5215 }
5218 {
5221 }
5222 else
5223 {
5226 }
5233 /* Create the built-in __null node. It is important that this is
5234 not shared. */
5238 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5240 }
5242 /* The number of named compound-literals generated thus far. */
5245 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5247 void
5249 {
5252 compound_literal_number);
5253 compound_literal_number++;
5255 }
5257 tree
5259 {
5263 }
5266 /* Linked list of disabled built-in functions. */
5269 {
5277 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5278 begins with "__builtin_", give an error. */
5280 void
5282 {
5285 else
5286 {
5291 }
5292 }
5295 /* Return true if the built-in function NAME has been disabled, false
5296 otherwise. */
5298 static bool
5300 {
5303 {
5306 }
5308 }
5311 /* Worker for DEF_BUILTIN.
5312 Possibly define a builtin function with one or two names.
5313 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5314 nonansi_p and flag_no_nonansi_builtin. */
5316 static void
5323 {
5324 tree decl;
5337 fnattrs);
5346 }
5347 \f
5348 /* Nonzero if the type T promotes to int. This is (nearly) the
5349 integral promotions defined in ISO C99 6.3.1.1/2. */
5351 bool
5353 {
5355 {
5365 /* ??? Technically all enumerations not larger than an int
5366 promote to an int. But this is used along code paths
5367 that only want to notice a size change. */
5375 }
5376 }
5378 /* Return 1 if PARMS specifies a fixed number of parameters
5379 and none of their types is affected by default promotions. */
5381 int
5383 {
5384 const_tree t;
5386 {
5403 }
5405 }
5407 /* Recursively remove any '*' or '&' operator from TYPE. */
5408 tree
5410 {
5414 }
5416 /* Recursively remove pointer or array type from TYPE. */
5417 tree
5419 {
5423 }
5425 /* Used to compare case labels. K1 and K2 are actually tree nodes
5426 representing case labels, or NULL_TREE for a `default' label.
5427 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5428 K2, and 0 if K1 and K2 are equal. */
5430 int
5432 {
5433 /* Consider a NULL key (such as arises with a `default' label) to be
5434 smaller than anything else. */
5441 }
5443 /* Process a case label, located at LOC, for the range LOW_VALUE
5444 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5445 then this case label is actually a `default' label. If only
5446 HIGH_VALUE is NULL_TREE, then case label was declared using the
5447 usual C/C++ syntax, rather than the GNU case range extension.
5448 CASES is a tree containing all the case ranges processed so far;
5449 COND is the condition for the switch-statement itself. Returns the
5450 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5451 is created. */
5453 tree
5456 {
5457 tree type;
5458 tree label;
5459 tree case_label;
5460 splay_tree_node node;
5462 /* Create the LABEL_DECL itself. */
5465 /* If there was an error processing the switch condition, bail now
5466 before we get more confused. */
5474 {
5477 }
5479 /* Case ranges are a GNU extension. */
5486 {
5491 }
5493 {
5498 }
5501 {
5502 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5503 really a case range, even though it was written that way.
5504 Remove the HIGH_VALUE to simplify later processing. */
5509 }
5511 /* See if the case is in range of the type of the original testing
5512 expression. If both low_value and high_value are out of range,
5513 don't insert the case label and return NULL_TREE. */
5519 /* Look up the LOW_VALUE in the table of case labels we already
5520 have. */
5522 /* If there was not an exact match, check for overlapping ranges.
5523 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5524 that's a `default' label and the only overlap is an exact match. */
5526 {
5527 splay_tree_node low_bound;
5528 splay_tree_node high_bound;
5530 /* Even though there wasn't an exact match, there might be an
5531 overlap between this case range and another case range.
5532 Since we've (inductively) not allowed any overlapping case
5533 ranges, we simply need to find the greatest low case label
5534 that is smaller that LOW_VALUE, and the smallest low case
5535 label that is greater than LOW_VALUE. If there is an overlap
5536 it will occur in one of these two ranges. */
5542 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5543 the LOW_VALUE, so there is no need to check unless the
5544 LOW_BOUND is in fact itself a case range. */
5550 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5551 range is bigger than the low end of the current range, so we
5552 are only interested if the current range is a real range, and
5553 not an ordinary case label. */
5555 && high_value
5557 high_value)
5560 }
5561 /* If there was an overlap, issue an error. */
5563 {
5567 {
5571 }
5573 {
5576 }
5577 else
5578 {
5582 }
5584 }
5586 /* Add a CASE_LABEL to the statement-tree. */
5588 /* Register this case label in the splay tree. */
5595 error_out:
5596 /* Add a label so that the back-end doesn't think that the beginning of
5597 the switch is unreachable. Note that we do not add a case label, as
5598 that just leads to duplicates and thence to failure later on. */
5600 {
5603 }
5605 }
5607 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5608 Used to verify that case values match up with enumerator values. */
5610 static void
5612 {
5615 /* ??? Not working too hard to print the double-word value.
5616 Should perhaps be done with %lwd in the diagnostic routines? */
5625 else
5634 buf);
5635 else
5640 }
5642 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5643 Used to verify that case values match up with enumerator values. */
5645 static int
5647 {
5651 /* Skip default case. */
5655 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5656 when we did our enum->case scan. Reset our scratch bit after. */
5659 else
5662 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5663 not set, that means that CASE_HIGH did not appear when we did our
5664 enum->case scan. Reset our scratch bit after. */
5666 {
5669 else
5671 }
5674 }
5676 /* Handle -Wswitch*. Called from the front end after parsing the
5677 switch construct. */
5678 /* ??? Should probably be somewhere generic, since other languages
5679 besides C and C++ would want this. At the moment, however, C/C++
5680 are the only tree-ssa languages that support enumerations at all,
5681 so the point is moot. */
5683 void
5686 {
5687 splay_tree_node default_node;
5688 splay_tree_node node;
5689 tree chain;
5699 /* From here on, we only care about about enumerated types. */
5703 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5707 /* Check the cases. Warn about case values which are not members of
5708 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5709 there is no default case, check that exactly all enumeration
5710 literals are covered by the cases. */
5712 /* Clearing COND if it is not an integer constant simplifies
5713 the tests inside the loop below. */
5717 /* The time complexity here is O(N*lg(N)) worst case, but for the
5718 common case of monotonically increasing enumerators, it is
5719 O(N), since the nature of the splay tree will keep the next
5720 element adjacent to the root at all times. */
5723 {
5729 {
5730 /* Mark the CASE_LOW part of the case entry as seen. */
5734 }
5736 /* Even though there wasn't an exact match, there might be a
5737 case range which includes the enumerator's value. */
5740 {
5744 {
5745 /* If we match the upper bound exactly, mark the CASE_HIGH
5746 part of the case entry as seen. */
5750 }
5751 }
5753 /* We've now determined that this enumerated literal isn't
5754 handled by the case labels of the switch statement. */
5756 /* If the switch expression is a constant, we only really care
5757 about whether that constant is handled by the switch. */
5761 /* If there is a default_node, the only relevant option is
5762 Wswitch-enum. Otherwise, if both are enabled then we prefer
5763 to warn using -Wswitch because -Wswitch is enabled by -Wall
5764 while -Wswitch-enum is explicit. */
5767 ? OPT_Wswitch_enum
5771 }
5773 /* Warn if there are case expressions that don't correspond to
5774 enumerators. This can occur since C and C++ don't enforce
5775 type-checking of assignments to enumeration variables.
5777 The time complexity here is now always O(N) worst case, since
5778 we should have marked both the lower bound and upper bound of
5779 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5780 above. This scan also resets those fields. */
5783 }
5785 /* Finish an expression taking the address of LABEL (an
5786 IDENTIFIER_NODE). Returns an expression for the address.
5788 LOC is the location for the expression returned. */
5790 tree
5792 {
5793 tree result;
5803 else
5804 {
5807 /* The current function is not necessarily uninlinable.
5808 Computed gotos are incompatible with inlining, but the value
5809 here could be used only in a diagnostic, for example. */
5811 }
5814 }
5815 \f
5817 /* Given a boolean expression ARG, return a tree representing an increment
5818 or decrement (as indicated by CODE) of ARG. The front end must check for
5819 invalid cases (e.g., decrement in C++). */
5820 tree
5822 {
5823 tree val;
5828 {
5851 }
5854 }
5855 \f
5856 /* Built-in macros for stddef.h and stdint.h, that require macros
5857 defined in this file. */
5858 void
5860 {
5923 }
5925 static void
5927 {
5928 /* Fill in the built_in_attributes array. */
5929 #define DEF_ATTR_NULL_TREE(ENUM) \
5930 built_in_attributes[(int) ENUM] = NULL_TREE;
5931 #define DEF_ATTR_INT(ENUM, VALUE) \
5932 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5933 #define DEF_ATTR_STRING(ENUM, VALUE) \
5934 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
5935 #define DEF_ATTR_IDENT(ENUM, STRING) \
5936 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5937 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5938 built_in_attributes[(int) ENUM] \
5939 = tree_cons (built_in_attributes[(int) PURPOSE], \
5940 built_in_attributes[(int) VALUE], \
5941 built_in_attributes[(int) CHAIN]);
5943 #undef DEF_ATTR_NULL_TREE
5944 #undef DEF_ATTR_INT
5945 #undef DEF_ATTR_IDENT
5946 #undef DEF_ATTR_TREE_LIST
5947 }
5949 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5950 identifier as an argument, so the front end shouldn't look it up. */
5952 bool
5954 {
5957 /* Unknown attribute that we'll end up ignoring, return true so we
5958 don't complain about an identifier argument. */
5964 else
5966 }
5968 /* Attribute handlers common to C front ends. */
5970 /* Handle a "packed" attribute; arguments as in
5971 struct attribute_spec.handler. */
5973 static tree
5976 {
5978 {
5982 }
5984 {
5986 /* Still pack bitfields. */
5991 else
5993 }
5994 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5995 used for DECL_REGISTER. It wouldn't mean anything anyway.
5996 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5997 that changes what the typedef is typing. */
5998 else
5999 {
6002 }
6005 }
6007 /* Handle a "nocommon" attribute; arguments as in
6008 struct attribute_spec.handler. */
6010 static tree
6014 {
6017 else
6018 {
6021 }
6024 }
6026 /* Handle a "common" attribute; arguments as in
6027 struct attribute_spec.handler. */
6029 static tree
6032 {
6035 else
6036 {
6039 }
6042 }
6044 /* Handle a "noreturn" attribute; arguments as in
6045 struct attribute_spec.handler. */
6047 static tree
6050 {
6053 /* See FIXME comment in c_common_attribute_table. */
6060 = build_pointer_type
6063 else
6064 {
6067 }
6070 }
6072 /* Handle a "hot" and attribute; arguments as in
6073 struct attribute_spec.handler. */
6075 static tree
6078 {
6080 {
6082 {
6086 }
6087 /* Most of the rest of the hot processing is done later with
6088 lookup_attribute. */
6089 }
6090 else
6091 {
6094 }
6097 }
6098 /* Handle a "cold" and attribute; arguments as in
6099 struct attribute_spec.handler. */
6101 static tree
6104 {
6106 {
6108 {
6112 }
6113 /* Most of the rest of the cold processing is done later with
6114 lookup_attribute. */
6115 }
6116 else
6117 {
6120 }
6123 }
6125 /* Handle a "noinline" attribute; arguments as in
6126 struct attribute_spec.handler. */
6128 static tree
6132 {
6135 else
6136 {
6139 }
6142 }
6144 /* Handle a "noclone" attribute; arguments as in
6145 struct attribute_spec.handler. */
6147 static tree
6151 {
6153 {
6156 }
6159 }
6161 /* Handle a "always_inline" attribute; arguments as in
6162 struct attribute_spec.handler. */
6164 static tree
6169 {
6171 {
6172 /* Set the attribute and mark it for disregarding inline
6173 limits. */
6175 }
6176 else
6177 {
6180 }
6183 }
6185 /* Handle a "gnu_inline" attribute; arguments as in
6186 struct attribute_spec.handler. */
6188 static tree
6193 {
6195 {
6196 /* Do nothing else, just set the attribute. We'll get at
6197 it later with lookup_attribute. */
6198 }
6199 else
6200 {
6203 }
6206 }
6208 /* Handle a "leaf" attribute; arguments as in
6209 struct attribute_spec.handler. */
6211 static tree
6215 {
6217 {
6220 }
6222 {
6225 }
6228 }
6230 /* Handle an "artificial" attribute; arguments as in
6231 struct attribute_spec.handler. */
6233 static tree
6238 {
6240 {
6241 /* Do nothing else, just set the attribute. We'll get at
6242 it later with lookup_attribute. */
6243 }
6244 else
6245 {
6248 }
6251 }
6253 /* Handle a "flatten" attribute; arguments as in
6254 struct attribute_spec.handler. */
6256 static tree
6258 tree args ATTRIBUTE_UNUSED,
6260 {
6262 /* Do nothing else, just set the attribute. We'll get at
6263 it later with lookup_attribute. */
6264 ;
6265 else
6266 {
6269 }
6272 }
6274 /* Handle a "warning" or "error" attribute; arguments as in
6275 struct attribute_spec.handler. */
6277 static tree
6280 {
6283 /* Do nothing else, just set the attribute. We'll get at
6284 it later with lookup_attribute. */
6285 ;
6286 else
6287 {
6290 }
6293 }
6295 /* Handle a "used" attribute; arguments as in
6296 struct attribute_spec.handler. */
6298 static tree
6301 {
6307 {
6312 }
6313 else
6314 {
6317 }
6320 }
6322 /* Handle a "unused" attribute; arguments as in
6323 struct attribute_spec.handler. */
6325 static tree
6328 {
6330 {
6338 {
6343 }
6344 else
6345 {
6348 }
6349 }
6350 else
6351 {
6355 }
6358 }
6360 /* Handle a "externally_visible" attribute; arguments as in
6361 struct attribute_spec.handler. */
6363 static tree
6368 {
6372 {
6375 {
6379 }
6380 }
6381 else
6382 {
6385 }
6388 }
6390 /* Handle a "const" attribute; arguments as in
6391 struct attribute_spec.handler. */
6393 static tree
6396 {
6399 /* See FIXME comment on noreturn in c_common_attribute_table. */
6405 = build_pointer_type
6408 else
6409 {
6412 }
6415 }
6417 /* Handle a "transparent_union" attribute; arguments as in
6418 struct attribute_spec.handler. */
6420 static tree
6424 {
6425 tree type;
6434 {
6435 /* Make sure that the first field will work for a transparent union.
6436 If the type isn't complete yet, leave the check to the code in
6437 finish_struct. */
6439 {
6445 }
6448 {
6449 /* If the type isn't complete yet, setting the flag
6450 on a variant wouldn't ever be checked. */
6454 /* build_duplicate_type doesn't work for C++. */
6458 /* A type variant isn't good enough, since we don't a cast
6459 to such a type removed as a no-op. */
6461 }
6465 }
6467 ignored:
6470 }
6472 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6473 get the requested priority for a constructor or destructor,
6474 possibly issuing diagnostics for invalid or reserved
6475 priorities. */
6477 static priority_type
6479 {
6480 HOST_WIDE_INT pri;
6481 tree arg;
6487 {
6490 else
6493 }
6505 {
6508 "destructor priorities from 0 to %d are reserved "
6510 MAX_RESERVED_INIT_PRIORITY);
6511 else
6513 "constructor priorities from 0 to %d are reserved "
6515 MAX_RESERVED_INIT_PRIORITY);
6516 }
6519 invalid:
6522 MAX_INIT_PRIORITY);
6523 else
6525 MAX_INIT_PRIORITY);
6527 }
6529 /* Handle a "constructor" attribute; arguments as in
6530 struct attribute_spec.handler. */
6532 static tree
6536 {
6543 {
6544 priority_type priority;
6549 }
6550 else
6551 {
6554 }
6557 }
6559 /* Handle a "destructor" attribute; arguments as in
6560 struct attribute_spec.handler. */
6562 static tree
6566 {
6573 {
6574 priority_type priority;
6579 }
6580 else
6581 {
6584 }
6587 }
6589 /* Nonzero if the mode is a valid vector mode for this architecture.
6590 This returns nonzero even if there is no hardware support for the
6591 vector mode, but we can emulate with narrower modes. */
6593 static int
6595 {
6599 /* Doh! What's going on? */
6608 /* Hardware support. Woo hoo! */
6614 /* We should probably return 1 if requesting V4DI and we have no DI,
6615 but we have V2DI, but this is probably very unlikely. */
6617 /* If we have support for the inner mode, we can safely emulate it.
6618 We may not have V2DI, but me can emulate with a pair of DIs. */
6620 }
6623 /* Handle a "mode" attribute; arguments as in
6624 struct attribute_spec.handler. */
6626 static tree
6629 {
6637 else
6638 {
6643 tree typefm;
6648 {
6654 }
6656 /* Change this type to have a type with the specified mode.
6657 First check for the special modes. */
6670 else
6673 {
6676 }
6679 {
6682 }
6686 {
6718 }
6720 {
6723 }
6726 {
6731 {
6734 }
6738 else
6741 }
6742 else
6743 {
6744 /* For fixed-point modes, we need to test if the signness of type
6745 and the machine mode are consistent. */
6748 {
6751 }
6752 /* For fixed-point modes, we need to pass saturating info. */
6756 }
6759 {
6762 }
6764 {
6765 /* For enumeral types, copy the precision from the integer
6766 type returned above. If not an INTEGER_TYPE, we can't use
6767 this mode for this type. */
6769 {
6772 }
6775 {
6778 }
6779 else
6780 {
6781 /* We cannot build a type variant, as there's code that assumes
6782 that TYPE_MAIN_VARIANT has the same mode. This includes the
6783 debug generators. Instead, create a subrange type. This
6784 results in all of the enumeral values being emitted only once
6785 in the original, and the subtype gets them by reference. */
6788 else
6791 }
6792 }
6796 {
6799 }
6802 }
6805 }
6807 /* Handle a "section" attribute; arguments as in
6808 struct attribute_spec.handler. */
6810 static tree
6813 {
6817 {
6823 {
6827 {
6829 "section attribute cannot be specified for "
6832 }
6834 /* The decl may have already been given a section attribute
6835 from a previous declaration. Ensure they match. */
6839 {
6843 }
6847 {
6850 }
6851 else
6853 }
6854 else
6855 {
6858 }
6859 }
6860 else
6861 {
6865 }
6868 }
6870 /* Check whether ALIGN is a valid user-specified alignment. If so,
6871 return its base-2 log; if not, output an error and return -1. If
6872 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
6873 no error. */
6874 int
6876 {
6881 {
6884 }
6888 {
6891 }
6893 {
6896 }
6898 }
6900 /* Handle a "aligned" attribute; arguments as in
6901 struct attribute_spec.handler. */
6903 static tree
6906 {
6915 {
6919 }
6926 {
6929 /* If we have a TYPE_DECL, then copy the type, so that we
6930 don't accidentally modify a builtin type. See pushdecl. */
6933 {
6940 }
6941 else
6946 }
6949 {
6952 }
6955 {
6960 else
6964 }
6965 else
6966 {
6969 }
6972 }
6974 /* Handle a "weak" attribute; arguments as in
6975 struct attribute_spec.handler. */
6977 static tree
6982 {
6985 {
6988 }
6990 {
6994 }
6998 else
7002 }
7004 /* Handle an "alias" or "ifunc" attribute; arguments as in
7005 struct attribute_spec.handler, except that IS_ALIAS tells us
7006 whether this is an alias as opposed to ifunc attribute. */
7008 static tree
7011 {
7016 {
7019 }
7023 /* A static variable declaration is always a tentative definition,
7024 but the alias is a non-tentative definition which overrides. */
7027 {
7031 }
7035 {
7039 }
7041 /* Note that the very first time we process a nested declaration,
7042 decl_function_context will not be set. Indeed, *would* never
7043 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7044 we do below. After such frobbery, pushdecl would set the context.
7045 In any case, this is never what we want. */
7047 {
7048 tree id;
7052 {
7056 }
7058 /* This counts as a use of the object pointed to. */
7063 else
7064 {
7067 else
7070 }
7073 /* ifuncs are also aliases, so set that attribute too. */
7076 }
7077 else
7078 {
7081 }
7084 }
7086 /* Handle an "alias" or "ifunc" attribute; arguments as in
7087 struct attribute_spec.handler. */
7089 static tree
7092 {
7094 }
7096 /* Handle an "alias" or "ifunc" attribute; arguments as in
7097 struct attribute_spec.handler. */
7099 static tree
7102 {
7104 }
7106 /* Handle a "weakref" attribute; arguments as in struct
7107 attribute_spec.handler. */
7109 static tree
7112 {
7115 /* We must ignore the attribute when it is associated with
7116 local-scoped decls, since attribute alias is ignored and many
7117 such symbols do not even have a DECL_WEAK field. */
7119 || current_function_decl
7121 {
7125 }
7128 {
7132 }
7134 /* The idea here is that `weakref("name")' mutates into `weakref,
7135 alias("name")', and weakref without arguments, in turn,
7136 implicitly adds weak. */
7139 {
7146 }
7147 else
7148 {
7153 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7154 and that isn't supported; and because it wants to add it to
7155 the list of weak decls, which isn't helpful. */
7157 }
7160 }
7162 /* Handle an "visibility" attribute; arguments as in
7163 struct attribute_spec.handler. */
7165 static tree
7169 {
7175 {
7179 {
7181 name);
7183 }
7185 {
7189 }
7190 }
7192 {
7195 }
7198 {
7201 }
7203 /* If this is a type, set the visibility on the type decl. */
7205 {
7210 {
7212 name);
7214 }
7215 }
7225 else
7226 {
7227 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7229 }
7233 {
7247 }
7252 /* Go ahead and attach the attribute to the node as well. This is needed
7253 so we can determine whether we have VISIBILITY_DEFAULT because the
7254 visibility was not specified, or because it was explicitly overridden
7255 from the containing scope. */
7258 }
7260 /* Determine the ELF symbol visibility for DECL, which is either a
7261 variable or a function. It is an error to use this function if a
7262 definition of DECL is not available in this translation unit.
7263 Returns true if the final visibility has been determined by this
7264 function; false if the caller is free to make additional
7265 modifications. */
7267 bool
7269 {
7273 /* If the user explicitly specified the visibility with an
7274 attribute, honor that. DECL_VISIBILITY will have been set during
7275 the processing of the attribute. We check for an explicit
7276 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7277 to distinguish the use of an attribute from the use of a "#pragma
7278 GCC visibility push(...)"; in the latter case we still want other
7279 considerations to be able to overrule the #pragma. */
7281 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7286 /* Set default visibility to whatever the user supplied with
7287 visibility_specified depending on #pragma GCC visibility. */
7289 {
7292 {
7295 /* If visibility changed and DECL already has DECL_RTL, ensure
7296 symbol flags are updated. */
7301 }
7302 }
7304 }
7306 /* Handle an "tls_model" attribute; arguments as in
7307 struct attribute_spec.handler. */
7309 static tree
7312 {
7313 tree id;
7320 {
7323 }
7328 {
7331 }
7341 else
7342 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7346 }
7348 /* Handle a "no_instrument_function" attribute; arguments as in
7349 struct attribute_spec.handler. */
7351 static tree
7356 {
7360 {
7364 }
7366 {
7370 }
7371 else
7375 }
7377 /* Handle a "malloc" attribute; arguments as in
7378 struct attribute_spec.handler. */
7380 static tree
7383 {
7387 else
7388 {
7391 }
7394 }
7396 /* Handle a "alloc_size" attribute; arguments as in
7397 struct attribute_spec.handler. */
7399 static tree
7402 {
7405 {
7412 {
7417 }
7418 }
7420 }
7422 /* Handle a "fn spec" attribute; arguments as in
7423 struct attribute_spec.handler. */
7425 static tree
7429 {
7434 }
7436 /* Handle a "returns_twice" attribute; arguments as in
7437 struct attribute_spec.handler. */
7439 static tree
7442 {
7445 else
7446 {
7449 }
7452 }
7454 /* Handle a "no_limit_stack" attribute; arguments as in
7455 struct attribute_spec.handler. */
7457 static tree
7462 {
7466 {
7470 }
7472 {
7476 }
7477 else
7481 }
7483 /* Handle a "pure" attribute; arguments as in
7484 struct attribute_spec.handler. */
7486 static tree
7489 {
7492 /* ??? TODO: Support types. */
7493 else
7494 {
7497 }
7500 }
7502 /* Digest an attribute list destined for a transactional memory statement.
7503 ALLOWED is the set of attributes that are allowed for this statement;
7504 return the attribute we parsed. Multiple attributes are never allowed. */
7506 int
7508 {
7513 {
7521 {
7524 }
7527 {
7530 }
7533 else
7535 }
7538 }
7540 /* Transform a TM attribute name into a maskable integer and back.
7541 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
7542 to how the lack of an attribute is treated. */
7544 int
7546 {
7560 }
7562 tree
7564 {
7567 {
7585 }
7587 }
7589 /* Return the first TM attribute seen in LIST. */
7591 tree
7593 {
7595 {
7599 }
7601 }
7603 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
7604 Here we accept only function types, and verify that none of the other
7605 function TM attributes are also applied. */
7606 /* ??? We need to accept class types for C++, but not C. This greatly
7607 complicates this function, since we can no longer rely on the extra
7608 processing given by function_type_required. */
7610 static tree
7613 {
7614 /* Only one path adds the attribute; others don't. */
7618 {
7621 /* Only tm_callable and tm_safe apply to classes. */
7624 /* FALLTHRU */
7628 {
7631 ;
7634 else
7636 }
7640 {
7643 {
7648 }
7649 }
7650 /* FALLTHRU */
7653 /* If a function is next, pass it on to be tried next. */
7657 ignored:
7660 }
7663 }
7665 /* Handle the TM_WRAP attribute; arguments as in
7666 struct attribute_spec.handler. */
7668 static tree
7671 {
7674 /* We don't need the attribute even on success, since we
7675 record the entry in an external table. */
7680 else
7681 {
7687 else
7688 {
7692 {
7696 else
7698 }
7699 else
7701 }
7702 }
7705 }
7707 /* Ignore the given attribute. Used when this attribute may be usefully
7708 overridden by the target, but is not used generically. */
7710 static tree
7714 {
7717 }
7719 /* Handle a "no vops" attribute; arguments as in
7720 struct attribute_spec.handler. */
7722 static tree
7726 {
7730 }
7732 /* Handle a "deprecated" attribute; arguments as in
7733 struct attribute_spec.handler. */
7735 static tree
7739 {
7747 {
7750 }
7753 {
7764 else
7766 }
7768 {
7773 }
7774 else
7778 {
7781 {
7787 }
7790 else
7792 }
7795 }
7797 /* Handle a "vector_size" attribute; arguments as in
7798 struct attribute_spec.handler. */
7800 static tree
7804 {
7814 {
7817 }
7819 /* Get the vector size (in bytes). */
7822 /* We need to provide for vector pointers, vector arrays, and
7823 functions returning vectors. For example:
7825 __attribute__((vector_size(16))) short *foo;
7827 In this case, the mode is SI, but the type being modified is
7828 HI, so we need to look further. */
7837 /* Get the mode of the type being modified. */
7848 {
7851 }
7854 {
7857 }
7860 {
7863 }
7865 /* Calculate how many units fit in the vector. */
7868 {
7871 }
7875 /* Build back pointers if needed. */
7879 }
7881 /* Handle the "nonnull" attribute. */
7882 static tree
7886 {
7890 /* If no arguments are specified, all pointer arguments should be
7891 non-null. Verify a full prototype is given so that the arguments
7892 will have the correct types when we actually check them later. */
7894 {
7896 {
7899 }
7901 }
7903 /* Argument list specified. Verify that each argument number references
7904 a pointer argument. */
7906 {
7910 {
7915 }
7918 {
7919 function_args_iterator iter;
7920 tree argument;
7924 {
7928 }
7932 {
7937 }
7940 {
7945 }
7946 }
7947 }
7950 }
7952 /* Check the argument list of a function call for null in argument slots
7953 that are marked as requiring a non-null pointer argument. The NARGS
7954 arguments are passed in the array ARGARRAY.
7955 */
7957 static void
7959 {
7964 {
7966 {
7969 /* Walk the argument list. If we encounter an argument number we
7970 should check for non-null, do it. If the attribute has no args,
7971 then every pointer argument is checked (in which case the check
7972 for pointer type is done in check_nonnull_arg). */
7974 {
7979 }
7980 }
7981 }
7982 }
7984 /* Check that the Nth argument of a function call (counting backwards
7985 from the end) is a (pointer)0. The NARGS arguments are passed in the
7986 array ARGARRAY. */
7988 static void
7990 {
7994 {
7997 tree sentinel;
7998 function_args_iterator iter;
7999 tree t;
8001 /* Skip over the named arguments. */
8003 {
8006 len++;
8007 }
8010 {
8013 }
8015 /* The sentinel must be one of the varargs, i.e.
8016 in position >= the number of fixed arguments. */
8018 {
8022 }
8024 /* Validate the sentinel. */
8028 /* Although __null (in C++) is only an integer we allow it
8029 nevertheless, as we are guaranteed that it's exactly
8030 as wide as a pointer, and we don't want to force
8031 users to cast the NULL they have written there.
8032 We warn with -Wstrict-null-sentinel, though. */
8035 }
8036 }
8038 /* Helper for check_function_nonnull; given a list of operands which
8039 must be non-null in ARGS, determine if operand PARAM_NUM should be
8040 checked. */
8042 static bool
8044 {
8048 {
8055 }
8057 }
8059 /* Check that the function argument PARAM (which is operand number
8060 PARAM_NUM) is non-null. This is called by check_function_nonnull
8061 via check_function_arguments_recurse. */
8063 static void
8066 {
8067 /* Just skip checking the argument if it's not a pointer. This can
8068 happen if the "nonnull" attribute was given without an operand
8069 list (which means to check every pointer argument). */
8077 }
8079 /* Helper for nonnull attribute handling; fetch the operand number
8080 from the attribute argument list. */
8082 static bool
8084 {
8085 /* Verify the arg number is a constant. */
8092 }
8094 /* Handle a "nothrow" attribute; arguments as in
8095 struct attribute_spec.handler. */
8097 static tree
8100 {
8103 /* ??? TODO: Support types. */
8104 else
8105 {
8108 }
8111 }
8113 /* Handle a "cleanup" attribute; arguments as in
8114 struct attribute_spec.handler. */
8116 static tree
8119 {
8123 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8124 for global destructors in C++. This requires infrastructure that
8125 we don't have generically at the moment. It's also not a feature
8126 we'd be missing too much, since we do have attribute constructor. */
8128 {
8132 }
8134 /* Verify that the argument is a function in scope. */
8135 /* ??? We could support pointers to functions here as well, if
8136 that was considered desirable. */
8139 {
8143 }
8146 {
8150 }
8152 /* That the function has proper type is checked with the
8153 eventual call to build_function_call. */
8156 }
8158 /* Handle a "warn_unused_result" attribute. No special handling. */
8160 static tree
8164 {
8165 /* Ignore the attribute for functions not returning any value. */
8167 {
8170 }
8173 }
8175 /* Handle a "sentinel" attribute. */
8177 static tree
8180 {
8182 {
8186 }
8187 else
8188 {
8190 {
8194 }
8195 }
8198 {
8202 {
8206 }
8207 else
8208 {
8210 {
8214 }
8215 }
8216 }
8219 }
8221 /* Handle a "type_generic" attribute. */
8223 static tree
8227 {
8228 /* Ensure we have a function type. */
8231 /* Ensure we have a variadic function. */
8235 }
8237 /* Handle a "target" attribute. */
8239 static tree
8242 {
8243 /* Ensure we have a function type. */
8245 {
8248 }
8250 flags))
8254 }
8256 /* Arguments being collected for optimization. */
8263 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8264 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8265 false for #pragma GCC optimize. */
8267 bool
8269 {
8277 tree ap;
8279 /* Build up argv vector. Just in case the string is stored away, use garbage
8280 collected strings. */
8285 {
8289 {
8293 }
8296 {
8297 /* Split string into multiple substrings. */
8305 {
8312 {
8316 }
8317 else
8318 {
8321 }
8325 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8326 options. */
8328 {
8333 else
8337 }
8340 {
8343 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8344 itself is -Os, and any other switch begins with a -f. */
8350 }
8355 }
8357 }
8358 }
8368 /* Now parse the options. */
8378 /* Don't allow changing -fstrict-aliasing. */
8383 }
8385 /* For handling "optimize" attribute. arguments as in
8386 struct attribute_spec.handler. */
8388 static tree
8391 {
8392 /* Ensure we have a function type. */
8394 {
8397 }
8398 else
8399 {
8403 /* Save current options. */
8406 /* If we previously had some optimization options, use them as the
8407 default. */
8412 /* Parse options, and update the vector. */
8417 /* Restore current options. */
8419 }
8422 }
8424 /* Handle a "no_split_stack" attribute. */
8426 static tree
8431 {
8435 {
8439 }
8441 {
8445 }
8448 }
8449 \f
8450 /* Check for valid arguments being passed to a function with FNTYPE.
8451 There are NARGS arguments in the array ARGARRAY. */
8452 void
8454 {
8455 /* Check for null being passed in a pointer argument that must be
8456 non-null. We also need to do this if format checking is enabled. */
8461 /* Check for errors in format strings. */
8468 }
8470 /* Generic argument checking recursion routine. PARAM is the argument to
8471 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8472 once the argument is resolved. CTX is context for the callback. */
8473 void
8478 {
8482 {
8483 /* Strip coercion. */
8487 }
8490 {
8492 tree attrs;
8495 /* See if this is a call to a known internationalization function
8496 that modifies a format arg. Such a function may have multiple
8497 format_arg attributes (for example, ngettext). */
8500 attrs;
8503 {
8504 tree inner_arg;
8505 tree format_num_expr;
8508 call_expr_arg_iterator iter;
8510 /* Extract the argument number, which was previously checked
8511 to be valid. */
8523 {
8528 }
8529 }
8531 /* If we found a format_arg attribute and did a recursive check,
8532 we are done with checking this argument. Otherwise, we continue
8533 and this will be considered a non-literal. */
8536 }
8539 {
8540 /* Check both halves of the conditional expression. */
8546 }
8549 }
8551 /* Checks for a builtin function FNDECL that the number of arguments
8552 NARGS against the required number REQUIRED and issues an error if
8553 there is a mismatch. Returns true if the number of arguments is
8554 correct, otherwise false. */
8556 static bool
8558 {
8560 {
8564 }
8566 {
8570 }
8572 }
8574 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8575 Returns false if there was an error, otherwise true. */
8577 bool
8579 {
8585 {
8595 {
8597 {
8601 }
8603 }
8613 {
8620 {
8624 }
8626 }
8631 {
8636 {
8640 }
8643 {
8645 fndecl);
8647 }
8649 }
8654 {
8656 {
8659 }
8661 }
8666 }
8667 }
8669 /* Function to help qsort sort FIELD_DECLs by name order. */
8671 int
8673 {
8678 /* A nontype is "greater" than a type. */
8687 }
8690 gt_pointer_operator new_value;
8694 /* This routine compares two fields like field_decl_cmp but using the
8695 pointer operator in resort_data. */
8697 static int
8699 {
8704 /* A nontype is "greater" than a type. */
8710 {
8717 }
8719 }
8721 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8723 void
8726 gt_pointer_operator new_value,
8728 {
8733 resort_field_decl_cmp);
8734 }
8736 /* Subroutine of c_parse_error.
8737 Return the result of concatenating LHS and RHS. RHS is really
8738 a string literal, its first character is indicated by RHS_START and
8739 RHS_SIZE is its length (including the terminating NUL character).
8741 The caller is responsible for deleting the returned pointer. */
8745 {
8751 }
8753 /* Issue the error given by GMSGID, indicating that it occurred before
8754 TOKEN, which had the associated VALUE. */
8756 void
8759 {
8760 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8770 {
8775 {
8788 }
8792 else
8798 }
8808 {
8813 }
8821 {
8826 }
8827 else
8831 {
8834 }
8835 #undef catenate_messages
8836 }
8838 /* Mapping for cpp message reasons to the options that enable them. */
8840 struct reason_option_codes_t
8841 {
8844 };
8864 };
8866 /* Return the gcc option code associated with the reason for a cpp
8867 message, or 0 if none. */
8869 static int
8871 {
8875 {
8878 }
8880 }
8882 /* Callback from cpp_error for PFILE to print diagnostics from the
8883 preprocessor. The diagnostic is of type LEVEL, with REASON set
8884 to the reason code if LEVEL is represents a warning, at location
8885 LOCATION unless this is after lexing and the compiler's location
8886 should be used instead, with column number possibly overridden by
8887 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8888 the arguments. Returns true if a diagnostic was emitted, false
8889 otherwise. */
8891 bool
8895 {
8896 diagnostic_info diagnostic;
8897 diagnostic_t dlevel;
8902 {
8907 /* Fall through. */
8932 }
8945 }
8947 /* Convert a character from the host to the target execution character
8948 set. cpplib handles this, mostly. */
8950 HOST_WIDE_INT
8952 {
8953 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8954 zero-extended under -fno-signed-char. cpplib insists that characters
8955 and character constants are always unsigned. Hence we must convert
8956 back and forth. */
8964 else
8966 }
8968 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
8969 references with an INDIRECT_REF of a constant at the bottom; much like the
8970 traditional rendering of offsetof as a macro. Return the folded result. */
8972 tree
8974 {
8978 {
8994 {
8997 }
9007 {
9011 }
9025 /* Check if the offset goes beyond the upper bound of the array. */
9027 {
9033 {
9037 {
9038 tree v;
9045 {
9053 }
9054 /* Don't warn if the array might be considered a poor
9055 man's flexible array member with a very permissive
9056 definition thereof. */
9060 "index %E denotes an offset "
9063 }
9064 }
9065 }
9072 /* Handle static members of volatile structs. */
9079 }
9082 }
9084 /* Likewise, but convert it to the return type of offsetof. */
9086 tree
9088 {
9090 }
9092 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9093 expression, because B will always be true. */
9095 void
9097 {
9100 "the omitted middle operand in ?: will always be %<true%>, "
9102 }
9104 /* Give an error for storing into ARG, which is 'const'. USE indicates
9105 how ARG was being used. */
9107 void
9109 {
9112 /* Using this macro rather than (for example) arrays of messages
9113 ensures that all the format strings are checked at compile
9114 time. */
9115 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9116 : (use == lv_increment ? (I) \
9117 : (use == lv_decrement ? (D) : (AS))))
9119 {
9130 else
9136 }
9142 arg);
9148 arg);
9150 {
9160 arg);
9161 }
9167 arg);
9168 else
9173 arg);
9174 }
9176 /* Print an error message for an invalid lvalue. USE says
9177 how the lvalue is being used and so selects the error message. LOC
9178 is the location for the error. */
9180 void
9182 {
9184 {
9202 }
9203 }
9205 /* Print an error message for an invalid indirection of type TYPE.
9206 ERRSTRING is the name of the operator for the indirection. */
9208 void
9210 {
9212 {
9220 type);
9225 type);
9230 type);
9235 type);
9239 }
9240 }
9241 \f
9242 /* *PTYPE is an incomplete array. Complete it with a domain based on
9243 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9244 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9245 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9247 int
9249 {
9256 {
9258 {
9259 int eltsize
9262 }
9264 {
9268 {
9272 }
9273 else
9274 {
9275 tree curindex;
9288 cnt++)
9289 {
9293 else
9294 {
9298 size_one_node);
9299 }
9302 }
9305 }
9306 }
9307 else
9308 {
9309 /* Make an error message unless that happened already. */
9312 }
9313 }
9314 else
9315 {
9319 }
9326 else
9329 /* Using build_distinct_type_copy and modifying things afterward instead
9330 of using build_array_type to create a new type preserves all of the
9331 TYPE_LANG_FLAG_? bits that the front end may have set. */
9339 /* Make sure we have the canonical MAIN_TYPE. */
9342 hashcode);
9345 /* Fix the canonical type. */
9355 else
9360 else
9366 {
9368 /* If we proceed with the array type as it is, we'll eventually
9369 crash in tree_low_cst(). */
9371 }
9375 }
9377 /* Like c_mark_addressable but don't check register qualifier. */
9378 void
9380 {
9386 }
9389 \f
9390 /* Used to help initialize the builtin-types.def table. When a type of
9391 the correct size doesn't exist, use error_mark_node instead of NULL.
9392 The later results in segfaults even when a decl using the type doesn't
9393 get invoked. */
9395 tree
9397 {
9400 }
9402 /* A helper function for resolve_overloaded_builtin in resolving the
9403 overloaded __sync_ builtins. Returns a positive power of 2 if the
9404 first operand of PARAMS is a pointer to a supported data type.
9405 Returns 0 if an error is encountered. */
9407 static int
9409 {
9410 tree type;
9414 {
9417 }
9431 incompatible:
9434 }
9436 /* A helper function for resolve_overloaded_builtin. Adds casts to
9437 PARAMS to make arguments match up with those of FUNCTION. Drops
9438 the variadic arguments at the end. Returns false if some error
9439 was encountered; true on success. */
9441 static bool
9444 {
9445 function_args_iterator iter;
9446 tree ptype;
9450 /* We've declared the implementation functions to use "volatile void *"
9451 as the pointer parameter, so we shouldn't get any complaints from the
9452 call to check_function_arguments what ever type the user used. */
9456 /* For the rest of the values, we need to cast these to FTYPE, so that we
9457 don't get warnings for passing pointer types, etc. */
9460 {
9464 /* XXX void_type_node belies the abstraction. */
9470 {
9473 }
9475 /* Only convert parameters if arg_type is unsigned integer type with
9476 new format sync routines, i.e. don't attempt to convert pointer
9477 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9478 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9479 kinds). */
9481 {
9482 /* Ideally for the first conversion we'd use convert_for_assignment
9483 so that we get warnings for anything that doesn't match the pointer
9484 type. This isn't portable across the C and C++ front ends atm. */
9489 }
9492 }
9494 /* __atomic routines are not variadic. */
9496 {
9499 }
9501 /* The definition of these primitives is variadic, with the remaining
9502 being "an optional list of variables protected by the memory barrier".
9503 No clue what that's supposed to mean, precisely, but we consider all
9504 call-clobbered variables to be protected so we're safe. */
9508 }
9510 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9511 RESULT to make it match the type of the first pointer argument in
9512 PARAMS. */
9514 static tree
9516 {
9521 /* New format doesn't require casting unless the types are the same size. */
9524 else
9526 }
9528 /* This function verifies the PARAMS to generic atomic FUNCTION.
9529 It returns the size if all the parameters are the same size, otherwise
9530 0 is returned if the parameters are invalid. */
9532 static int
9534 {
9539 tree type_0;
9541 /* Determine the parameter makeup. */
9543 {
9559 }
9562 {
9565 }
9567 /* Get type of first parameter, and determine its size. */
9570 {
9572 function);
9574 }
9576 /* Types must be compile time constant sizes. */
9578 {
9581 function);
9583 }
9587 /* Zero size objects are not allowed. */
9589 {
9592 function);
9594 }
9596 /* Check each other parameter is a pointer and the same size. */
9598 {
9601 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
9605 {
9607 function);
9609 }
9612 {
9614 function);
9616 }
9617 }
9619 /* Check memory model parameters for validity. */
9621 {
9624 {
9627 {
9630 function);
9631 }
9632 }
9633 else
9635 {
9637 function);
9639 }
9640 }
9643 }
9646 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
9647 at the beginning of the parameter list PARAMS representing the size of the
9648 objects. This is to match the library ABI requirement. LOC is the location
9649 of the function call.
9650 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
9651 returned to allow the external call to be constructed. */
9653 static tree
9656 {
9657 tree size_node;
9659 /* Insert a SIZE_T parameter as the first param. If there isn't
9660 enough space, allocate a new vector and recursively re-build with that. */
9662 {
9665 tree f;
9674 }
9676 /* Add the size parameter and leave as a function call for processing. */
9680 }
9683 /* This will process an __atomic_exchange function call, determine whether it
9684 needs to be mapped to the _N variation, or turned into a library call.
9685 LOC is the location of the builtin call.
9686 FUNCTION is the DECL that has been invoked;
9687 PARAMS is the argument list for the call. The return value is non-null
9688 TRUE is returned if it is translated into the proper format for a call to the
9689 external library, and NEW_RETURN is set the tree for that function.
9690 FALSE is returned if processing for the _N variation is required, and
9691 NEW_RETURN is set to the the return value the result is copied into. */
9692 static bool
9695 {
9700 /* Size of 0 is an error condition. */
9702 {
9705 }
9707 /* If not a lock-free size, change to the library generic format. */
9709 {
9712 }
9714 /* Otherwise there is a lockfree match, transform the call from:
9715 void fn(T* mem, T* desired, T* return, model)
9716 into
9717 *return = (T) (fn (In* mem, (In) *desired, model)) */
9724 /* Create pointer to appropriate size. */
9728 /* Convert object pointer to required type. */
9731 /* Convert new value to required type, and dereference it. */
9736 /* Move memory model to the 3rd position, and end param list. */
9740 /* Convert return pointer and dereference it for later assignment. */
9744 }
9747 /* This will process an __atomic_compare_exchange function call, determine
9748 whether it needs to be mapped to the _N variation, or turned into a lib call.
9749 LOC is the location of the builtin call.
9750 FUNCTION is the DECL that has been invoked;
9751 PARAMS is the argument list for the call. The return value is non-null
9752 TRUE is returned if it is translated into the proper format for a call to the
9753 external library, and NEW_RETURN is set the tree for that function.
9754 FALSE is returned if processing for the _N variation is required. */
9756 static bool
9760 {
9765 /* Size of 0 is an error condition. */
9767 {
9770 }
9772 /* If not a lock-free size, change to the library generic format. */
9774 {
9775 /* The library generic format does not have the weak parameter, so
9776 remove it from the param list. Since a parameter has been removed,
9777 we can be sure that there is room for the SIZE_T parameter, meaning
9778 there will not be a recursive rebuilding of the parameter list, so
9779 there is no danger this will be done twice. */
9781 {
9785 }
9788 }
9790 /* Otherwise, there is a match, so the call needs to be transformed from:
9791 bool fn(T* mem, T* desired, T* return, weak, success, failure)
9792 into
9793 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
9799 /* Create pointer to appropriate size. */
9803 /* Convert object pointer to required type. */
9807 /* Convert expected pointer to required type. */
9811 /* Convert desired value to required type, and dereference it. */
9816 /* The rest of the parameters are fine. NULL means no special return value
9817 processing.*/
9820 }
9823 /* This will process an __atomic_load function call, determine whether it
9824 needs to be mapped to the _N variation, or turned into a library call.
9825 LOC is the location of the builtin call.
9826 FUNCTION is the DECL that has been invoked;
9827 PARAMS is the argument list for the call. The return value is non-null
9828 TRUE is returned if it is translated into the proper format for a call to the
9829 external library, and NEW_RETURN is set the tree for that function.
9830 FALSE is returned if processing for the _N variation is required, and
9831 NEW_RETURN is set to the the return value the result is copied into. */
9833 static bool
9836 {
9841 /* Size of 0 is an error condition. */
9843 {
9846 }
9848 /* If not a lock-free size, change to the library generic format. */
9850 {
9853 }
9855 /* Otherwise, there is a match, so the call needs to be transformed from:
9856 void fn(T* mem, T* return, model)
9857 into
9858 *return = (T) (fn ((In *) mem, model)) */
9864 /* Create pointer to appropriate size. */
9868 /* Convert object pointer to required type. */
9872 /* Move memory model to the 2nd position, and end param list. */
9876 /* Convert return pointer and dereference it for later assignment. */
9880 }
9883 /* This will process an __atomic_store function call, determine whether it
9884 needs to be mapped to the _N variation, or turned into a library call.
9885 LOC is the location of the builtin call.
9886 FUNCTION is the DECL that has been invoked;
9887 PARAMS is the argument list for the call. The return value is non-null
9888 TRUE is returned if it is translated into the proper format for a call to the
9889 external library, and NEW_RETURN is set the tree for that function.
9890 FALSE is returned if processing for the _N variation is required, and
9891 NEW_RETURN is set to the the return value the result is copied into. */
9893 static bool
9896 {
9901 /* Size of 0 is an error condition. */
9903 {
9906 }
9908 /* If not a lock-free size, change to the library generic format. */
9910 {
9913 }
9915 /* Otherwise, there is a match, so the call needs to be transformed from:
9916 void fn(T* mem, T* value, model)
9917 into
9918 fn ((In *) mem, (In) *value, model) */
9923 /* Create pointer to appropriate size. */
9927 /* Convert object pointer to required type. */
9931 /* Convert new value to required type, and dereference it. */
9936 /* The memory model is in the right spot already. Return is void. */
9940 }
9943 /* Some builtin functions are placeholders for other expressions. This
9944 function should be called immediately after parsing the call expression
9945 before surrounding code has committed to the type of the expression.
9947 LOC is the location of the builtin call.
9949 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
9950 PARAMS is the argument list for the call. The return value is non-null
9951 when expansion is complete, and null if normal processing should
9952 continue. */
9954 tree
9956 {
9962 {
9968 else
9972 }
9974 /* Handle BUILT_IN_NORMAL here. */
9976 {
9981 {
9982 /* Handle these 4 together so that they can fall through to the next
9983 case if the call is transformed to an _N variant. */
9985 {
9987 {
9991 /* Change to the _N variant. */
9994 }
9997 {
9999 params,
10002 /* Change to the _N variant. */
10005 }
10007 {
10011 /* Change to the _N variant. */
10014 }
10016 {
10020 /* Change to the _N variant. */
10023 }
10026 }
10027 /* Fallthrough to the normal processing. */
10028 }
10045 {
10047 /* Fallthru for parameter processing. */
10048 }
10065 {
10076 orig_format))
10088 /* If new_return is set, assign function to that expr and cast the
10089 result to void since the generic interface returned void. */
10091 {
10092 /* Cast function result from I{1,2,4,8,16} to the required type. */
10095 result);
10099 }
10101 }
10105 }
10106 }
10108 /* Ignoring their sign, return true if two scalar types are the same. */
10109 bool
10111 {
10118 /* Equality works here because c_common_signed_type uses
10119 TYPE_MAIN_VARIANT. */
10122 }
10124 /* Check for missing format attributes on function pointers. LTYPE is
10125 the new type or left-hand side type. RTYPE is the old type or
10126 right-hand side type. Returns TRUE if LTYPE is missing the desired
10127 attribute. */
10129 bool
10131 {
10133 tree ra;
10139 {
10140 tree la;
10145 }
10146 else
10148 }
10150 /* Subscripting with type char is likely to lose on a machine where
10151 chars are signed. So warn on any machine, but optionally. Don't
10152 warn for unsigned char since that type is safe. Don't warn for
10153 signed char because anyone who uses that must have done so
10154 deliberately. Furthermore, we reduce the false positive load by
10155 warning only for non-constant value of type char. */
10157 void
10159 {
10163 }
10165 /* Implement -Wparentheses for the unexpected C precedence rules, to
10166 cover cases like x + y << z which readers are likely to
10167 misinterpret. We have seen an expression in which CODE is a binary
10168 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10169 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10170 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10171 expression was not formed using a binary or unary operator, or it
10172 was enclosed in parentheses. */
10174 void
10178 {
10182 /* This macro tests that the expression ARG with original tree code
10183 CODE appears to be a boolean expression. or the result of folding a
10184 boolean expression. */
10185 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10186 (truth_value_p (TREE_CODE (ARG)) \
10187 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10189 || ((CODE) != INTEGER_CST \
10190 && (integer_onep (ARG) || integer_zerop (ARG))))
10193 {
10225 /* Check cases like x|y==z */
10230 /* Check cases like !x | y */
10244 /* Check cases like x^y==z */
10258 /* Check cases like x&y==z */
10263 /* Check cases like !x & y */
10294 }
10295 #undef NOT_A_BOOLEAN_EXPR_P
10296 }
10298 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10300 void
10302 {
10304 {
10307 else
10309 }
10310 }
10312 /* Warn for division by zero according to the value of DIVISOR. LOC
10313 is the location of the division operator. */
10315 void
10317 {
10318 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10319 about division by zero. Do not issue a warning if DIVISOR has a
10320 floating-point type, since we consider 0.0/0.0 a valid way of
10321 generating a NaN. */
10325 }
10327 /* Subroutine of build_binary_op. Give warnings for comparisons
10328 between signed and unsigned quantities that may fail. Do the
10329 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10330 so that casts will be considered, but default promotions won't
10331 be.
10333 LOCATION is the location of the comparison operator.
10335 The arguments of this function map directly to local variables
10336 of build_binary_op. */
10338 void
10343 {
10348 /* In C++, check for comparison of different enum types. */
10354 {
10358 }
10360 /* Do not warn if the comparison is being done in a signed type,
10361 since the signed type will only be chosen if it can represent
10362 all the values of the unsigned type. */
10365 /* Do not warn if both operands are unsigned. */
10368 else
10369 {
10375 else
10383 /* Do not warn if the signed quantity is an unsuffixed integer
10384 literal (or some static constant expression involving such
10385 literals or a conditional expression involving such literals)
10386 and it is non-negative. */
10389 /* Do not warn if the comparison is an equality operation, the
10390 unsigned quantity is an integral constant, and it would fit
10391 in the result if the result were signed. */
10396 /* In C, do not warn if the unsigned quantity is an enumeration
10397 constant and its maximum value would fit in the result if the
10398 result were signed. */
10404 else
10406 OPT_Wsign_compare,
10408 }
10410 /* Warn if two unsigned values are being compared in a size larger
10411 than their original size, and one (and only one) is the result of
10412 a `~' operator. This comparison will always fail.
10414 Also warn if one operand is a constant, and the constant does not
10415 have all bits set that are set in the ~ operand when it is
10416 extended. */
10423 {
10430 {
10431 tree primop;
10437 {
10441 }
10442 else
10443 {
10447 }
10452 {
10455 {
10459 else
10462 }
10463 }
10464 }
10472 }
10473 }
10475 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
10476 type via c_common_type. If -Wdouble-promotion is in use, and the
10477 conditions for warning have been met, issue a warning. GMSGID is
10478 the warning message. It must have two %T specifiers for the type
10479 that was converted (generally "float") and the type to which it was
10480 converted (generally "double), respectively. LOC is the location
10481 to which the awrning should refer. */
10483 void
10486 {
10487 tree source_type;
10491 /* If the conversion will not occur at run-time, there is no need to
10492 warn about it. */
10504 else
10507 }
10509 /* Setup a TYPE_DECL node as a typedef representation.
10511 X is a TYPE_DECL for a typedef statement. Create a brand new
10512 ..._TYPE node (which will be just a variant of the existing
10513 ..._TYPE node with identical properties) and then install X
10514 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
10516 The whole point here is to end up with a situation where each
10517 and every ..._TYPE node the compiler creates will be uniquely
10518 associated with AT MOST one node representing a typedef name.
10519 This way, even though the compiler substitutes corresponding
10520 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
10521 early on, later parts of the compiler can always do the reverse
10522 translation and get back the corresponding typedef name. For
10523 example, given:
10525 typedef struct S MY_TYPE;
10526 MY_TYPE object;
10528 Later parts of the compiler might only know that `object' was of
10529 type `struct S' if it were not for code just below. With this
10530 code however, later parts of the compiler see something like:
10532 struct S' == struct S
10533 typedef struct S' MY_TYPE;
10534 struct S' object;
10536 And they can then deduce (from the node for type struct S') that
10537 the original object declaration was:
10539 MY_TYPE object;
10541 Being able to do this is important for proper support of protoize,
10542 and also for generating precise symbolic debugging information
10543 which takes full account of the programmer's (typedef) vocabulary.
10545 Obviously, we don't want to generate a duplicate ..._TYPE node if
10546 the TYPE_DECL node that we are now processing really represents a
10547 standard built-in type. */
10549 void
10551 {
10555 {
10558 }
10561 {
10569 }
10570 }
10572 /* Record the types used by the current global variable declaration
10573 being parsed, so that we can decide later to emit their debug info.
10574 Those types are in types_used_by_cur_var_decl, and we are going to
10575 store them in the types_used_by_vars_hash hash table.
10576 DECL is the declaration of the global variable that has been parsed. */
10578 void
10580 {
10584 {
10587 }
10588 }
10590 /* If DECL is a typedef that is declared in the current function,
10591 record it for the purpose of -Wunused-local-typedefs. */
10593 void
10595 {
10600 /* if this is not a locally defined typedef then we are not
10601 interested. */
10608 }
10610 /* If T is a TYPE_DECL declared locally, mark it as used. */
10612 void
10614 {
10619 }
10621 /* Warn if there are some unused locally defined typedefs in the
10622 current function. */
10624 void
10626 {
10628 tree decl;
10629 /* The number of times we have emitted -Wunused-local-typedefs
10630 warnings. If this is different from errorcount, that means some
10631 unrelated errors have been issued. In which case, we'll avoid
10632 emitting "unused-local-typedefs" warnings. */
10644 {
10648 OPT_Wunused_local_typedefs,
10651 }
10654 {
10657 }
10658 }
10660 /* The C and C++ parsers both use vectors to hold function arguments.
10661 For efficiency, we keep a cache of unused vectors. This is the
10662 cache. */
10669 /* Return a new vector from the cache. If the cache is empty,
10670 allocate a new vector. These vectors are GC'ed, so it is OK if the
10671 pointer is not released.. */
10675 {
10678 else
10679 {
10680 /* Passing 0 to VEC_alloc returns NULL, and our callers require
10681 that we always return a non-NULL value. The vector code uses
10682 4 when growing a NULL vector, so we do too. */
10684 }
10685 }
10687 /* Release a vector of trees back to the cache. */
10689 void
10691 {
10693 {
10696 }
10697 }
10699 /* Get a new tree vector holding a single tree. */
10703 {
10707 }
10709 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
10713 {
10718 }
10720 /* Get a new tree vector which is a copy of an existing one. */
10724 {
10727 tree t;
10734 }
10736 /* Return true if KEYWORD starts a type specifier. */
10738 bool
10740 {
10742 {
10772 }
10773 }
10775 /* Return true if KEYWORD names a type qualifier. */
10777 bool
10779 {
10781 {
10788 }
10789 }
10791 /* Return true if KEYWORD names a storage class specifier.
10793 RID_TYPEDEF is not included in this list despite `typedef' being
10794 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
10795 such for syntactic convenience only. */
10797 bool
10799 {
10801 {
10811 }
10812 }
10814 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
10816 static bool
10818 {
10820 {
10828 }
10829 }
10831 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
10832 declaration-specifier (C99 6.7). */
10834 bool
10836 {
10843 {
10850 }
10851 }
10853 /* Initialize language-specific-bits of tree_contains_struct. */
10855 void
10857 {
10860 }
10862 /* Build a user-defined numeric literal out of an integer constant type VALUE
10863 with identifier SUFFIX. */
10865 tree
10867 {
10873 }
10875 /* For vector[index], convert the vector to a
10876 pointer of the underlying type. */
10877 void
10880 {
10882 {
10884 tree type1;
10898 }
10899 }