| blob | 0329bc7e01cb58456095b663971e4cbc3325305f |
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
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 C1X) dialect of C. */
223 /* Nonzero means use the ISO C1X 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. */
384 /* Reserved words. The third field is a mask: keywords are disabled
385 if they match the mask.
387 Masks for languages:
388 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
389 C --std=c99: D_CXXONLY | D_OBJC
390 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
391 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
392 C++ --std=c0x: D_CONLY | D_OBJC
393 ObjC++ is like C++ except that D_OBJC is not set
395 If -fno-asm is used, D_ASM is added to the mask. If
396 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
397 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
398 In C with -Wc++-compat, we warn if D_CXXWARN is set.
400 Note the complication of the D_CXX_OBJC keywords. These are
401 reserved words such as 'class'. In C++, 'class' is a reserved
402 word. In Objective-C++ it is too. In Objective-C, it is a
403 reserved word too, but only if it follows an '@' sign.
404 */
406 {
555 /* These Objective-C keywords are recognized only immediately after
556 an '@'. */
573 /* These are recognized only in protocol-qualifier context
574 (see above) */
581 /* These are recognized inside a property attribute list */
590 };
595 /* Table of machine-independent attributes common to all C-like languages. */
597 {
598 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
599 affects_type_identity } */
606 /* FIXME: logically, noreturn attributes should be listed as
607 "false, true, true" and apply to function types. But implementing this
608 would require all the places in the compiler that use TREE_THIS_VOLATILE
609 on a decl to identify non-returning functions to be located and fixed
610 to check the function type instead. */
635 /* The same comments as for noreturn attributes apply to const ones. */
659 handle_no_instrument_function_attribute,
669 /* For internal use (marking of builtins) only. The name contains space
670 to prevent its usage in source code. */
692 /* For internal use (marking of builtins) only. The name contains space
693 to prevent its usage in source code. */
712 /* For internal use (marking of builtins and runtime functions) only.
713 The name contains space to prevent its usage in source code. */
717 };
719 /* Give the specifications for the format attributes, used by C and all
720 descendants. */
723 {
724 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
725 affects_type_identity } */
731 };
733 /* Return identifier for address space AS. */
737 {
741 }
743 /* Push current bindings for the function name VAR_DECLS. */
745 void
747 {
752 {
756 {
758 saved);
760 }
761 }
763 /* Normally they'll have been NULL, so only push if we've got a
764 stack, or they are non-NULL. */
766 saved_function_name_decls);
767 }
769 /* Finish up the current bindings, adding them into the current function's
770 statement tree. This must be done _before_ finish_stmt_tree is called.
771 If there is no current function, we must be at file scope and no statements
772 are involved. Pop the previous bindings. */
774 void
776 {
785 {
793 }
799 {
800 /* We had saved values, restore them. */
801 tree saved;
804 {
809 }
811 }
813 }
815 /* Return the text name of the current function, suitably prettified
816 by PRETTY_P. Return string must be freed by caller. */
820 {
827 {
830 }
843 {
846 }
849 }
851 /* Return the VAR_DECL for a const char array naming the current
852 function. If the VAR_DECL has not yet been created, create it
853 now. RID indicates how it should be formatted and IDENTIFIER_NODE
854 ID is its name (unfortunately C and C++ hold the RID values of
855 keywords in different places, so we can't derive RID from ID in
856 this language independent code. LOC is the location of the
857 function. */
859 tree
861 {
871 {
872 /* If a tree is built here, it would normally have the lineno of
873 the current statement. Later this tree will be moved to the
874 beginning of the function and this line number will be wrong.
875 To avoid this problem set the lineno to 0 here; that prevents
876 it from appearing in the RTL. */
877 tree stmts;
885 saved_function_name_decls
889 }
894 }
896 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
898 tree
900 {
905 /* Compute the number of elements, for the array type. */
907 {
910 }
912 {
915 }
917 {
920 }
921 else
922 {
925 }
927 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
928 limit in C++98 Annex B is very large (65536) and is not normative,
929 so we do not diagnose it (warn_overlength_strings is forced off
930 in c_common_post_options). */
932 {
936 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
937 separate the %d from the 'C'. 'ISO' should not be
938 translated, but it may be moved after 'C%d' in languages
939 where modifiers follow nouns. */
941 "string length %qd is greater than the length %qd "
944 }
946 /* Create the array type for the string constant. The ISO C++
947 standard says that a string literal has type `const char[N]' or
948 `const wchar_t[N]'. We use the same logic when invoked as a C
949 front-end with -Wwrite-strings.
950 ??? We should change the type of an expression depending on the
951 state of a warning flag. We should just be warning -- see how
952 this is handled in the C++ front-end for the deprecated implicit
953 conversion from string literals to `char*' or `wchar_t*'.
955 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
956 array type being the unqualified version of that type.
957 Therefore, if we are constructing an array of const char, we must
958 construct the matching unqualified array type first. The C front
959 end does not require this, but it does no harm, so we do it
960 unconditionally. */
971 }
972 \f
973 /* If DISABLE is true, stop issuing warnings. This is used when
974 parsing code that we know will not be executed. This function may
975 be called multiple times, and works as a stack. */
977 static void
979 {
981 {
984 }
985 }
987 /* If ENABLE is true, reenable issuing warnings. */
989 static void
991 {
993 {
996 }
997 }
999 /* Fully fold EXPR, an expression that was not folded (beyond integer
1000 constant expressions and null pointer constants) when being built
1001 up. If IN_INIT, this is in a static initializer and certain
1002 changes are made to the folding done. Clear *MAYBE_CONST if
1003 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1004 expression because it contains an evaluated operator (in C99) or an
1005 operator outside of sizeof returning an integer constant (in C90)
1006 not permitted in constant expressions, or because it contains an
1007 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1008 set to true by callers before calling this function.) Return the
1009 folded expression. Function arguments have already been folded
1010 before calling this function, as have the contents of SAVE_EXPR,
1011 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1012 C_MAYBE_CONST_EXPR. */
1014 tree
1016 {
1017 tree ret;
1023 /* This function is not relevant to C++ because C++ folds while
1024 parsing, and may need changes to be correct for C++ when C++
1025 stops folding while parsing. */
1032 {
1035 }
1042 }
1044 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1045 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1046 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1047 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1048 both evaluated and unevaluated subexpressions while
1049 *MAYBE_CONST_ITSELF is carried from only evaluated
1050 subexpressions). */
1052 static tree
1055 {
1067 /* This function is not relevant to C++ because C++ folds while
1068 parsing, and may need changes to be correct for C++ when C++
1069 stops folding while parsing. */
1073 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1074 anything else not counted as an expression cannot usefully be
1075 folded further at this point. */
1081 /* Operands of variable-length expressions (function calls) have
1082 already been folded, as have __builtin_* function calls, and such
1083 expressions cannot occur in constant expressions. */
1085 {
1089 }
1092 {
1101 else
1104 }
1106 /* Assignment, increment, decrement, function call and comma
1107 operators, and statement expressions, cannot occur in constant
1108 expressions if evaluated / outside of sizeof. (Function calls
1109 were handled above, though VA_ARG_EXPR is treated like a function
1110 call here, and statement expressions are handled through
1111 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1113 {
1133 }
1135 /* Fold individual tree codes as appropriate. */
1137 {
1139 /* Any non-constancy will have been marked in a containing
1140 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1148 maybe_const_itself);
1153 {
1156 }
1165 maybe_const_itself);
1168 maybe_const_itself);
1174 {
1178 }
1220 /* Binary operations evaluating both arguments (increment and
1221 decrement are binary internally in GCC). */
1225 maybe_const_itself);
1233 /* The RHS of a MODIFY_EXPR was fully folded when building that
1234 expression for the sake of conversion warnings. */
1237 maybe_const_itself);
1241 ret = in_init
1244 else
1255 CASE_CONVERT:
1265 /* Unary operations. */
1268 maybe_const_itself);
1272 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1273 not prepared to deal with them if they occur in initializers. */
1281 ret = in_init
1284 else
1289 {
1293 }
1295 {
1298 CASE_CONVERT:
1299 /* Don't warn about explicit conversions. We will already
1300 have warned about suspect implicit conversions. */
1307 }
1312 /* Binary operations not necessarily evaluating both
1313 arguments. */
1320 ? truthvalue_false_node
1328 ret = in_init
1331 else
1336 && op0_const
1337 && op0_const_self
1343 && op0_const_self
1369 else
1374 && op0_const
1375 && op0_const_self
1379 && op0_const_self
1383 && op0_const
1384 && op0_const_self
1388 && op0_const_self
1394 /* Each case where an operand with excess precision may be
1395 encountered must remove the EXCESS_PRECISION_EXPR around
1396 inner operands and possibly put one around the whole
1397 expression or possibly convert to the semantic type (which
1398 c_fully_fold does); we cannot tell at this stage which is
1399 appropriate in any particular case. */
1403 /* Various codes may appear through folding built-in functions
1404 and their arguments. */
1406 }
1408 out:
1409 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1410 have been done by this point, so remove them again. */
1414 {
1418 }
1422 }
1424 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1425 return EXP. Otherwise, return either EXP or its known constant
1426 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1427 Is the BLKmode test appropriate? */
1429 tree
1431 {
1432 tree ret;
1434 /* This function is only used by C, for c_fully_fold and other
1435 optimization, and may not be correct for C++. */
1446 /* Avoid unwanted tree sharing between the initializer and current
1447 function's body where the tree can be modified e.g. by the
1448 gimplifier. */
1452 }
1454 /* Print a warning if a constant expression had overflow in folding.
1455 Invoke this function on every expression that the language
1456 requires to be a constant expression.
1457 Note the ANSI C standard says it is erroneous for a
1458 constant expression to overflow. */
1460 void
1462 {
1470 }
1472 /* The same as above but print an unconditional error. */
1473 void
1475 {
1482 }
1484 /* Print a warning if an expression had overflow in folding and its
1485 operands hadn't.
1487 Invoke this function on every expression that
1488 (1) appears in the source code, and
1489 (2) is a constant expression that overflowed, and
1490 (3) is not already checked by convert_and_check;
1491 however, do not invoke this function on operands of explicit casts
1492 or when the expression is the result of an operator and any operand
1493 already overflowed. */
1495 void
1497 {
1502 {
1531 }
1532 }
1534 /* Warn about uses of logical || / && operator in a context where it
1535 is likely that the bitwise equivalent was intended by the
1536 programmer. We have seen an expression in which CODE is a binary
1537 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1538 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1539 void
1543 {
1555 /* Warn if &&/|| are being used in a context where it is
1556 likely that the bitwise equivalent was intended by the
1557 programmer. That is, an expression such as op && MASK
1558 where op should not be any boolean expression, nor a
1559 constant, and mask seems to be a non-boolean integer constant. */
1567 {
1571 else
1576 }
1578 /* We do not warn for constants because they are typical of macro
1579 expansions that test for features. */
1583 /* This warning only makes sense with logical operands. */
1599 /* If this is an OR operation, invert both sides; we will invert
1600 again at the end. */
1604 /* If both expressions are the same, if we can merge the ranges, and we
1605 can build the range test, return it or it inverted. */
1611 {
1617 "logical %<or%> "
1619 else
1621 "logical %<and%> "
1623 }
1624 }
1627 /* Print a warning about casts that might indicate violation
1628 of strict aliasing rules if -Wstrict-aliasing is used and
1629 strict aliasing mode is in effect. OTYPE is the original
1630 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1632 bool
1634 {
1635 /* Strip pointer conversion chains and get to the correct original type. */
1643 /* If the type we are casting to is a ref-all pointer
1644 dereferencing it is always valid. */
1651 {
1652 /* Casting the address of an object to non void pointer. Warn
1653 if the cast breaks type based aliasing. */
1655 {
1659 }
1660 else
1661 {
1662 /* warn_strict_aliasing >= 3. This includes the default (3).
1663 Only warn if the cast is dereferenced immediately. */
1664 alias_set_type set1 =
1670 {
1674 }
1677 {
1681 }
1682 }
1683 }
1684 else
1686 {
1687 /* At this level, warn for any conversions, even if an address is
1688 not taken in the same statement. This will likely produce many
1689 false positives, but could be useful to pinpoint problems that
1690 are not revealed at higher levels. */
1695 {
1699 }
1700 }
1703 }
1705 /* Warn for unlikely, improbable, or stupid DECL declarations
1706 of `main'. */
1708 void
1710 {
1711 function_args_iterator iter;
1712 tree type;
1716 {
1717 /* XXX void_type_node belies the abstraction. */
1723 {
1745 "third argument of %q+D should probably be "
1748 }
1749 }
1751 /* It is intentional that this message does not mention the third
1752 argument because it's only mentioned in an appendix of the
1753 standard. */
1757 }
1759 /* True if pointers to distinct types T1 and T2 can be converted to
1760 each other without an explicit cast. Only returns true for opaque
1761 vector types. */
1762 bool
1764 {
1771 }
1773 /* True if vector types T1 and T2 can be converted to each other
1774 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1775 can only be converted with -flax-vector-conversions yet that is not
1776 in effect, emit a note telling the user about that option if such
1777 a note has not previously been emitted. */
1778 bool
1780 {
1788 convertible_lax =
1803 {
1806 "conversions between vectors with differing "
1808 }
1811 }
1813 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1814 to integral type. */
1816 static tree
1818 {
1823 {
1824 /* C++0x scoped enumerations don't implicitly convert to integral
1825 type; if we stripped an explicit conversion to a larger type we
1826 need to replace it so common_type will still work. */
1831 }
1833 }
1835 /* This is a helper function of build_binary_op.
1837 For certain operations if both args were extended from the same
1838 smaller type, do the arithmetic in that type and then extend.
1840 BITWISE indicates a bitwise operation.
1841 For them, this optimization is safe only if
1842 both args are zero-extended or both are sign-extended.
1843 Otherwise, we might change the result.
1844 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1845 but calculated in (unsigned short) it would be (unsigned short)-1.
1846 */
1847 tree
1849 {
1853 tree type;
1855 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1856 excessive narrowing when we call get_narrower below. For
1857 example, suppose that OP0 is of unsigned int extended
1858 from signed char and that RESULT_TYPE is long long int.
1859 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1860 like
1862 (long long int) (unsigned int) signed_char
1864 which get_narrower would narrow down to
1866 (unsigned int) signed char
1868 If we do not cast OP0 first, get_narrower would return
1869 signed_char, which is inconsistent with the case of the
1870 explicit cast. */
1877 /* UNS is 1 if the operation to be done is an unsigned one. */
1880 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1881 but it *requires* conversion to FINAL_TYPE. */
1892 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1894 /* For bitwise operations, signedness of nominal type
1895 does not matter. Consider only how operands were extended. */
1899 /* Note that in all three cases below we refrain from optimizing
1900 an unsigned operation on sign-extended args.
1901 That would not be valid. */
1903 /* Both args variable: if both extended in same way
1904 from same width, do it in that width.
1905 Do it unsigned if args were zero-extended. */
1912 return c_common_signed_or_unsigned_type
1919 && (type
1930 && (type
1938 }
1940 /* Checks if expression EXPR of real/integer type cannot be converted
1941 to the real/integer type TYPE. Function returns true when:
1942 * EXPR is a constant which cannot be exactly converted to TYPE
1943 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1944 for EXPR type and TYPE being both integers or both real.
1945 * EXPR is not a constant of real type and TYPE is an integer.
1946 * EXPR is not a constant of integer type which cannot be
1947 exactly converted to real type.
1948 Function allows conversions between types of different signedness and
1949 does not return true in that case. Function can produce signedness
1950 warnings if PRODUCE_WARNS is true. */
1951 bool
1953 {
1959 {
1960 /* Warn for real constant that is not an exact integer converted
1961 to integer type. */
1964 {
1967 }
1968 /* Warn for an integer constant that does not fit into integer type. */
1972 {
1975 {
1979 }
1981 {
1985 }
1986 else
1988 }
1990 {
1991 /* Warn for an integer constant that does not fit into real type. */
1993 {
1997 }
1998 /* Warn for a real constant that does not fit into a smaller
1999 real type. */
2002 {
2006 }
2007 }
2008 }
2009 else
2010 {
2011 /* Warn for real types converted to integer types. */
2018 {
2019 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2023 /* Don't warn for short y; short x = ((int)y & 0xff); */
2027 {
2028 /* If both args were extended from a shortest type,
2029 use that type if that is safe. */
2036 {
2042 /* If one of the operands is a non-negative constant
2043 that fits in the target type, then the type of the
2044 other operand does not matter. */
2053 /* If constant is unsigned and fits in the target
2054 type, then the result will also fit. */
2056 && unsigned0
2059 && unsigned1
2062 }
2063 }
2064 /* Warn for integer types converted to smaller integer types. */
2068 /* When they are the same width but different signedness,
2069 then the value may change. */
2072 /* Even when converted to a bigger type, if the type is
2073 unsigned but expr is signed, then negative values
2074 will be changed. */
2080 }
2082 /* Warn for integer types converted to real types if and only if
2083 all the range of values of the integer type cannot be
2084 represented by the real type. */
2087 {
2091 /* Don't warn about char y = 0xff; float x = (int) y; */
2103 }
2105 /* Warn for real types converted to smaller real types. */
2110 }
2113 }
2115 /* Warns if the conversion of EXPR to TYPE may alter a value.
2116 This is a helper function for warnings_for_convert_and_check. */
2118 static void
2120 {
2128 {
2141 /* Conversion from boolean to a signed:1 bit-field (which only
2142 can hold the values 0 and -1) doesn't lose information - but
2143 it does change the value. */
2158 {
2159 /* In case of COND_EXPR, if both operands are constants or
2160 COND_EXPR, then we do not care about the type of COND_EXPR,
2161 only about the conversion of each operand. */
2169 {
2173 }
2174 /* Fall through. */
2175 }
2182 }
2183 }
2185 /* Produce warnings after a conversion. RESULT is the result of
2186 converting EXPR to TYPE. This is a helper function for
2187 convert_and_check and cp_convert_and_check. */
2189 void
2191 {
2196 {
2197 /* Do not diagnose overflow in a constant expression merely
2198 because a conversion overflowed. */
2203 {
2204 /* This detects cases like converting -129 or 256 to
2205 unsigned char. */
2209 else
2211 }
2215 /* No warning for converting 0x80000000 to int. */
2223 else
2225 }
2230 else
2232 }
2235 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2236 Invoke this function on every expression that is converted implicitly,
2237 i.e. because of language rules and not because of an explicit cast. */
2239 tree
2241 {
2242 tree result;
2243 tree expr_for_warning;
2245 /* Convert from a value with possible excess precision rather than
2246 via the semantic type, but do not warn about values not fitting
2247 exactly in the semantic type. */
2249 {
2255 }
2256 else
2270 }
2271 \f
2272 /* A node in a list that describes references to variables (EXPR), which are
2273 either read accesses if WRITER is zero, or write accesses, in which case
2274 WRITER is the parent of EXPR. */
2275 struct tlist
2276 {
2279 };
2281 /* Used to implement a cache the results of a call to verify_tree. We only
2282 use this for SAVE_EXPRs. */
2283 struct tlist_cache
2284 {
2288 tree expr;
2289 };
2291 /* Obstack to use when allocating tlist structures, and corresponding
2292 firstobj. */
2296 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2297 warnings. */
2299 /* SAVE_EXPRs need special treatment. We process them only once and then
2300 cache the results. */
2312 /* Create a new struct tlist and fill in its fields. */
2315 {
2322 }
2324 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2325 is nonnull, we ignore any node we find which has a writer equal to it. */
2327 static void
2329 {
2331 {
2338 }
2339 }
2341 /* Merge the nodes of ADD into TO. This merging process is done so that for
2342 each variable that already exists in TO, no new node is added; however if
2343 there is a write access recorded in ADD, and an occurrence on TO is only
2344 a read access, then the occurrence in TO will be modified to record the
2345 write. */
2347 static void
2349 {
2356 {
2363 {
2367 }
2369 {
2373 }
2375 }
2376 }
2378 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2379 references in list LIST conflict with it, excluding reads if ONLY writers
2380 is nonzero. */
2382 static void
2385 {
2388 /* Avoid duplicate warnings. */
2394 {
2398 {
2403 }
2405 }
2406 }
2408 /* Given a list LIST of references to variables, find whether any of these
2409 can cause conflicts due to missing sequence points. */
2411 static void
2413 {
2417 {
2420 }
2421 }
2423 /* Return nonzero if X is a tree that can be verified by the sequence point
2424 warnings. */
2425 static int
2427 {
2434 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2435 (lvalue_p) crash on TRY/CATCH. */
2442 /* No point to track non-const calls, they will never satisfy
2443 operand_equal_p. */
2451 }
2453 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2454 static bool
2456 {
2458 }
2460 /* Walk the tree X, and record accesses to variables. If X is written by the
2461 parent tree, WRITER is the parent.
2462 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2463 expression or its only operand forces a sequence point, then everything up
2464 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2465 in PNO_SP.
2466 Once we return, we will have emitted warnings if any subexpression before
2467 such a sequence point could be undefined. On a higher level, however, the
2468 sequence point may not be relevant, and we'll merge the two lists.
2470 Example: (b++, a) + b;
2471 The call that processes the COMPOUND_EXPR will store the increment of B
2472 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2473 processes the PLUS_EXPR will need to merge the two lists so that
2474 eventually, all accesses end up on the same list (and we'll warn about the
2475 unordered subexpressions b++ and b.
2477 A note on merging. If we modify the former example so that our expression
2478 becomes
2479 (b++, b) + a
2480 care must be taken not simply to add all three expressions into the final
2481 PNO_SP list. The function merge_tlist takes care of that by merging the
2482 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2483 way, so that no more than one access to B is recorded. */
2485 static void
2487 tree writer)
2488 {
2493 /* X may be NULL if it is the operand of an empty statement expression
2494 ({ }). */
2498 restart:
2506 {
2538 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2539 two first, to avoid warning for (a ? b++ : b++). */
2555 /* Expressions inside the LHS are not ordered wrt. the sequence points
2556 in the RHS. Example:
2557 *a = (a++, 2)
2558 Despite the fact that the modification of "a" is in the before_sp
2559 list (tmp_before), it conflicts with the use of "a" in the LHS.
2560 We can handle this by adding the contents of tmp_list3
2561 to those of tmp_before, and redoing the collision warnings for that
2562 list. */
2565 /* Exclude the LHS itself here; we first have to merge it into the
2566 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2567 didn't exclude the LHS, we'd get it twice, once as a read and once
2568 as a write. */
2579 /* We need to warn about conflicts among arguments and conflicts between
2580 args and the function address. Side effects of the function address,
2581 however, are not ordered by the sequence point of the call. */
2582 {
2583 call_expr_arg_iterator iter;
2584 tree arg;
2588 {
2593 }
2598 }
2601 /* Scan all the list, e.g. indices of multi dimensional array. */
2603 {
2609 }
2613 {
2620 {
2632 {
2636 }
2639 }
2643 }
2653 /* For other expressions, simply recurse on their operands.
2654 Manual tail recursion for unary expressions.
2655 Other non-expressions need not be processed. */
2657 {
2661 }
2663 {
2667 {
2672 }
2673 }
2675 }
2676 }
2678 /* Try to warn for undefined behavior in EXPR due to missing sequence
2679 points. */
2681 DEBUG_FUNCTION void
2683 {
2689 {
2692 }
2697 }
2698 \f
2699 /* Validate the expression after `case' and apply default promotions. */
2701 static tree
2703 {
2708 /* Promote char or short to int. */
2711 {
2714 }
2719 }
2720 \f
2721 /* See if the case values LOW and HIGH are in the range of the original
2722 type (i.e. before the default conversion to int) of the switch testing
2723 expression.
2724 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2725 the type before promoting it. CASE_LOW_P is a pointer to the lower
2726 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2727 if the case is not a case range.
2728 The caller has to make sure that we are not called with NULL for
2729 CASE_LOW_P (i.e. the default case).
2730 Returns true if the case label is in range of ORIG_TYPE (saturated or
2731 untouched) or false if the label is out of range. */
2733 static bool
2736 {
2741 /* If there was a problem with the original type, do nothing. */
2748 /* Case label is less than minimum for type. */
2751 {
2754 }
2756 /* Case value is greater than maximum for type. */
2759 {
2762 }
2764 /* Saturate lower case label value to minimum. */
2767 {
2771 }
2773 /* Saturate upper case label value to maximum. */
2776 {
2780 }
2788 }
2789 \f
2790 /* Return an integer type with BITS bits of precision,
2791 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2793 tree
2795 {
2834 }
2836 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2837 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2838 and saturating if SATP is nonzero, otherwise not saturating. */
2840 tree
2843 {
2847 else
2855 {
2857 "fixed-point types that have too many integral and "
2860 }
2863 }
2865 /* Used for communication between c_common_type_for_mode and
2866 c_register_builtin_type. */
2869 /* Return a data type that has machine mode MODE.
2870 If the mode is an integer,
2871 then UNSIGNEDP selects between signed and unsigned types.
2872 If the mode is a fixed-point mode,
2873 then UNSIGNEDP selects between saturating and nonsaturating types. */
2875 tree
2877 {
2878 tree t;
2915 #if HOST_BITS_PER_WIDE_INT >= 64
2918 #endif
2943 {
2945 tree inner_type;
2961 }
2963 {
2968 }
2978 {
3064 }
3071 }
3073 tree
3075 {
3077 }
3079 /* Return a signed type the same as TYPE in other respects. */
3081 tree
3083 {
3085 }
3087 /* Return a type the same as TYPE except unsigned or
3088 signed according to UNSIGNEDP. */
3090 tree
3092 {
3093 tree type1;
3095 /* This block of code emulates the behavior of the old
3096 c_common_unsigned_type. In particular, it returns
3097 long_unsigned_type_node if passed a long, even when a int would
3098 have the same size. This is necessary for warnings to work
3099 correctly in archs where sizeof(int) == sizeof(long) */
3102 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3118 #if HOST_BITS_PER_WIDE_INT >= 64
3121 #endif
3131 #define C_COMMON_FIXED_TYPES(NAME) \
3132 if (type1 == short_ ## NAME ## _type_node \
3133 || type1 == unsigned_short_ ## NAME ## _type_node) \
3134 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3135 : short_ ## NAME ## _type_node; \
3136 if (type1 == NAME ## _type_node \
3137 || type1 == unsigned_ ## NAME ## _type_node) \
3138 return unsignedp ? unsigned_ ## NAME ## _type_node \
3139 : NAME ## _type_node; \
3140 if (type1 == long_ ## NAME ## _type_node \
3141 || type1 == unsigned_long_ ## NAME ## _type_node) \
3142 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3143 : long_ ## NAME ## _type_node; \
3144 if (type1 == long_long_ ## NAME ## _type_node \
3145 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3146 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3147 : long_long_ ## NAME ## _type_node;
3149 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3150 if (type1 == NAME ## _type_node \
3151 || type1 == u ## NAME ## _type_node) \
3152 return unsignedp ? u ## NAME ## _type_node \
3153 : NAME ## _type_node;
3155 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3156 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3157 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3158 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3159 : sat_ ## short_ ## NAME ## _type_node; \
3160 if (type1 == sat_ ## NAME ## _type_node \
3161 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3162 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3163 : sat_ ## NAME ## _type_node; \
3164 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3165 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3166 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3167 : sat_ ## long_ ## NAME ## _type_node; \
3168 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3169 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3170 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3171 : sat_ ## long_long_ ## NAME ## _type_node;
3173 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3174 if (type1 == sat_ ## NAME ## _type_node \
3175 || type1 == sat_ ## u ## NAME ## _type_node) \
3176 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3177 : sat_ ## NAME ## _type_node;
3203 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3204 the precision; they have precision set to match their range, but
3205 may use a wider mode to match an ABI. If we change modes, we may
3206 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3207 the precision as well, so as to yield correct results for
3208 bit-field types. C++ does not have these separate bit-field
3209 types, and producing a signed or unsigned variant of an
3210 ENUMERAL_TYPE may cause other problems as well. */
3216 #define TYPE_OK(node) \
3217 (TYPE_MODE (type) == TYPE_MODE (node) \
3218 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3237 #if HOST_BITS_PER_WIDE_INT >= 64
3240 #endif
3249 #undef TYPE_OK
3252 }
3254 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3256 tree
3258 {
3259 /* Extended integer types of the same width as a standard type have
3260 lesser rank, so those of the same width as int promote to int or
3261 unsigned int and are valid for printf formats expecting int or
3262 unsigned int. To avoid such special cases, avoid creating
3263 extended integer types for bit-fields if a standard integer type
3264 is available. */
3281 }
3283 /* The C version of the register_builtin_type langhook. */
3285 void
3287 {
3288 tree decl;
3298 }
3299 \f
3300 /* Print an error message for invalid operands to arith operation
3301 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3302 LOCATION is the location of the message. */
3304 void
3307 {
3311 {
3356 }
3360 }
3361 \f
3362 /* Subroutine of build_binary_op, used for comparison operations.
3363 See if the operands have both been converted from subword integer types
3364 and, if so, perhaps change them both back to their original type.
3365 This function is also responsible for converting the two operands
3366 to the proper common type for comparison.
3368 The arguments of this function are all pointers to local variables
3369 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3370 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3372 If this function returns nonzero, it means that the comparison has
3373 a constant value. What this function returns is an expression for
3374 that value. */
3376 tree
3379 {
3380 tree type;
3388 /* Throw away any conversions to wider types
3389 already present in the operands. */
3394 /* If primopN is first sign-extended from primopN's precision to opN's
3395 precision, then zero-extended from opN's precision to
3396 *restype_ptr precision, shortenings might be invalid. */
3399 && !unsignedp0
3404 && !unsignedp1
3408 /* Handle the case that OP0 does not *contain* a conversion
3409 but it *requires* conversion to FINAL_TYPE. */
3416 /* If one of the operands must be floated, we cannot optimize. */
3420 /* If first arg is constant, swap the args (changing operation
3421 so value is preserved), for canonicalization. Don't do this if
3422 the second arg is 0. */
3427 {
3444 {
3459 }
3461 }
3463 /* If comparing an integer against a constant more bits wide,
3464 maybe we can deduce a value of 1 or 0 independent of the data.
3465 Or else truncate the constant now
3466 rather than extend the variable at run time.
3468 This is only interesting if the constant is the wider arg.
3469 Also, it is not safe if the constant is unsigned and the
3470 variable arg is signed, since in this case the variable
3471 would be sign-extended and then regarded as unsigned.
3472 Our technique fails in this case because the lowest/highest
3473 possible unsigned results don't follow naturally from the
3474 lowest/highest possible values of the variable operand.
3475 For just EQ_EXPR and NE_EXPR there is another technique that
3476 could be used: see if the constant can be faithfully represented
3477 in the other operand's type, by truncating it and reextending it
3478 and see if that preserves the constant's value. */
3484 {
3487 /* 1 if comparison is nominally unsigned. */
3489 tree val;
3501 {
3502 /* Convert primop1 to target type, but do not introduce
3503 additional overflow. We know primop1 is an int_cst. */
3507 }
3509 {
3512 }
3515 {
3520 }
3521 else
3522 {
3527 }
3530 /* This used to be a switch, but Genix compiler can't handle that. */
3532 {
3535 }
3537 {
3540 }
3542 {
3547 }
3549 {
3554 }
3556 {
3561 }
3563 {
3568 }
3570 /* If primop0 was sign-extended and unsigned comparison specd,
3571 we did a signed comparison above using the signed type bounds.
3572 But the comparison we output must be unsigned.
3574 Also, for inequalities, VAL is no good; but if the signed
3575 comparison had *any* fixed result, it follows that the
3576 unsigned comparison just tests the sign in reverse
3577 (positive values are LE, negative ones GE).
3578 So we can generate an unsigned comparison
3579 against an extreme value of the signed type. */
3582 {
3585 {
3600 }
3602 }
3605 {
3610 }
3613 {
3614 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3618 }
3620 /* Value is not predetermined, but do the comparison
3621 in the type of the operand that is not constant.
3622 TYPE is already properly set. */
3623 }
3625 /* If either arg is decimal float and the other is float, find the
3626 proper common type to use for comparison. */
3637 /* If args' natural types are both narrower than nominal type
3638 and both extend in the same manner, compare them
3639 in the type of the wider arg.
3640 Otherwise must actually extend both to the nominal
3641 common type lest different ways of extending
3642 alter the result.
3643 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3648 {
3652 type);
3653 /* Make sure shorter operand is extended the right way
3654 to match the longer operand. */
3655 primop0
3658 primop0);
3659 primop1
3662 primop1);
3663 }
3664 else
3665 {
3666 /* Here we must do the comparison on the nominal type
3667 using the args exactly as we received them. */
3674 {
3677 {
3679 /* All unsigned values are >= 0, so we warn. However,
3680 if OP0 is a constant that is >= 0, the signedness of
3681 the comparison isn't an issue, so suppress the
3682 warning. */
3686 primop0))))
3696 primop0))))
3704 }
3707 {
3708 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3713 }
3714 }
3715 }
3723 }
3724 \f
3725 /* Return a tree for the sum or difference (RESULTCODE says which)
3726 of pointer PTROP and integer INTOP. */
3728 tree
3731 {
3734 /* The result is a pointer of the same type that is being added. */
3738 {
3742 }
3744 {
3748 }
3750 {
3754 }
3755 else
3758 /* We are manipulating pointer values, so we don't need to warn
3759 about relying on undefined signed overflow. We disable the
3760 warning here because we use integer types so fold won't know that
3761 they are really pointers. */
3764 /* If what we are about to multiply by the size of the elements
3765 contains a constant term, apply distributive law
3766 and multiply that constant term separately.
3767 This helps produce common subexpressions. */
3772 /* If the constant comes from pointer subtraction,
3773 skip this optimization--it would cause an error. */
3775 /* If the constant is unsigned, and smaller than the pointer size,
3776 then we must skip this optimization. This is because it could cause
3777 an overflow error if the constant is negative but INTOP is not. */
3781 {
3786 /* Convert both subexpression types to the type of intop,
3787 because weird cases involving pointer arithmetic
3788 can result in a sum or difference with different type args. */
3793 }
3795 /* Convert the integer argument to a type the same size as sizetype
3796 so the multiply won't overflow spuriously. */
3802 /* Replace the integer argument with a suitable product by the object size.
3803 Do this multiplication as signed, then convert to the appropriate type
3804 for the pointer operation and disregard an overflow that occured only
3805 because of the sign-extension change in the latter conversion. */
3806 {
3814 }
3816 /* Create the sum or difference. */
3825 }
3826 \f
3827 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3828 and if NON_CONST is known not to be permitted in an evaluated part
3829 of a constant expression. */
3831 tree
3833 {
3837 /* This should never be called for C++. */
3841 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3850 }
3852 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3853 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3854 around the SAVE_EXPR if needed so that c_fully_fold does not need
3855 to look inside SAVE_EXPRs. */
3857 tree
3859 {
3868 }
3870 /* Return whether EXPR is a declaration whose address can never be
3871 NULL. */
3873 bool
3875 {
3880 }
3882 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3883 or for an `if' or `while' statement or ?..: exp. It should already
3884 have been validated to be of suitable type; otherwise, a bad
3885 diagnostic may result.
3887 The EXPR is located at LOCATION.
3889 This preparation consists of taking the ordinary
3890 representation of an expression expr and producing a valid tree
3891 boolean expression describing whether expr is nonzero. We could
3892 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3893 but we optimize comparisons, &&, ||, and !.
3895 The resulting type should always be `truthvalue_type_node'. */
3897 tree
3899 {
3901 {
3943 ? truthvalue_true_node
3949 ? truthvalue_true_node
3954 /* Fall through. */
3957 {
3960 {
3961 /* Common Ada/Pascal programmer's mistake. */
3963 OPT_Waddress,
3965 inner);
3967 }
3969 }
3986 /* These don't change whether an object is nonzero or zero. */
3991 /* These don't change whether an object is zero or nonzero, but
3992 we can't ignore them if their second arg has side-effects. */
3994 {
3997 c_common_truthvalue_conversion
4000 }
4001 else
4006 /* Distribute the conversion into the arms of a COND_EXPR. */
4008 {
4011 /* In C++ one of the arms might have void type if it is throw. */
4019 }
4020 else
4021 {
4022 /* Folding will happen later for C. */
4030 }
4032 CASE_CONVERT:
4033 {
4037 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4038 since that affects how `default_conversion' will behave. */
4042 /* Don't strip a conversion from C++0x scoped enum, since they
4043 don't implicitly convert to other types. */
4047 /* If this isn't narrowing the argument, we can ignore it. */
4051 }
4057 {
4061 }
4066 }
4069 {
4071 expr = (build_binary_op
4075 c_common_truthvalue_conversion
4078 c_common_truthvalue_conversion
4083 }
4086 {
4091 }
4092 else
4095 ret:
4098 }
4099 \f
4108 /* Apply the TYPE_QUALS to the new DECL. */
4110 void
4112 {
4120 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4121 constructor can produce constant init, so rely on cp_finish_decl to
4122 clear TREE_READONLY if the variable has non-constant init. */
4125 {
4128 }
4130 {
4132 /* Allow 'restrict' on arrays of pointers.
4133 FIXME currently we just ignore it. */
4139 }
4140 }
4142 /* Hash function for the problem of multiple type definitions in
4143 different files. This must hash all types that will compare
4144 equal via comptypes to the same value. In practice it hashes
4145 on some of the simple stuff and leaves the details to comptypes. */
4147 static hashval_t
4149 {
4153 tree t2;
4155 {
4156 /* For pointers, hash on pointee type plus some swizzling. */
4159 /* Hash on number of elements and total size. */
4178 }
4179 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4180 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4182 /* We might have a VLA here. */
4185 else
4188 }
4192 /* Return the typed-based alias set for T, which may be an expression
4193 or a type. Return -1 if we don't do anything special. */
4195 alias_set_type
4197 {
4198 tree u;
4201 /* For VLAs, use the alias set of the element type rather than the
4202 default of alias set 0 for types compared structurally. */
4204 {
4208 }
4210 /* Permit type-punning when accessing a union, provided the access
4211 is directly through the union. For example, this code does not
4212 permit taking the address of a union member and then storing
4213 through it. Even the type-punning allowed here is a GCC
4214 extension, albeit a common and useful one; the C standard says
4215 that such accesses have implementation-defined behavior. */
4223 /* That's all the expressions we handle specially. */
4227 /* The C standard guarantees that any object may be accessed via an
4228 lvalue that has character type. */
4234 /* The C standard specifically allows aliasing between signed and
4235 unsigned variants of the same type. We treat the signed
4236 variant as canonical. */
4238 {
4241 /* t1 == t can happen for boolean nodes which are always unsigned. */
4244 }
4246 /* Handle the case of multiple type nodes referring to "the same" type,
4247 which occurs with IMA. These share an alias set. FIXME: Currently only
4248 C90 is handled. (In C99 type compatibility is not transitive, which
4249 complicates things mightily. The alias set splay trees can theoretically
4250 represent this, but insertion is tricky when you consider all the
4251 different orders things might arrive in.) */
4256 /* Save time if there's only one input file. */
4260 /* Pointers need special handling if they point to any type that
4261 needs special handling (below). */
4263 {
4264 tree t2;
4265 /* Find bottom type under any nested POINTERs. */
4269 ;
4277 }
4278 /* These are the only cases that need special handling. */
4285 /* Undefined? */
4289 /* Look up t in hash table. Only one of the compatible types within each
4290 alias set is recorded in the table. */
4294 NULL);
4297 {
4300 }
4301 else
4302 /* Our caller will assign and record (in t) a new alias set; all we need
4303 to do is remember t in the hash table. */
4307 }
4308 \f
4309 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4310 the second parameter indicates which OPERATOR is being applied.
4311 The COMPLAIN flag controls whether we should diagnose possibly
4312 ill-formed constructs or not. LOC is the location of the SIZEOF or
4313 TYPEOF operator. */
4315 tree
4318 {
4326 {
4328 {
4335 }
4336 else
4337 {
4339 {
4343 else
4346 }
4348 }
4349 }
4351 {
4359 }
4361 {
4366 }
4367 else
4368 {
4370 /* Convert in case a char is more than one unit. */
4374 else
4376 }
4378 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4379 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4380 never happen. However, this node should really have type
4381 `size_t', which is just a typedef for an ordinary integer type. */
4386 }
4388 /* Implement the __alignof keyword: Return the minimum required
4389 alignment of EXPR, measured in bytes. For VAR_DECLs,
4390 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4391 from an "aligned" __attribute__ specification). LOC is the
4392 location of the ALIGNOF operator. */
4394 tree
4396 {
4397 tree t;
4404 {
4407 }
4413 {
4420 {
4427 }
4429 }
4430 else
4434 }
4435 \f
4436 /* Handle C and C++ default attributes. */
4438 enum built_in_attribute
4439 {
4440 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4441 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4442 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4443 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4445 #undef DEF_ATTR_NULL_TREE
4446 #undef DEF_ATTR_INT
4447 #undef DEF_ATTR_IDENT
4448 #undef DEF_ATTR_TREE_LIST
4449 ATTR_LAST
4450 };
4456 enum c_builtin_type
4457 {
4458 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4459 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4460 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4461 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4462 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4463 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4464 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4465 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4466 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4467 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4468 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4469 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4470 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4471 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4472 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4473 NAME,
4474 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4476 #undef DEF_PRIMITIVE_TYPE
4477 #undef DEF_FUNCTION_TYPE_0
4478 #undef DEF_FUNCTION_TYPE_1
4479 #undef DEF_FUNCTION_TYPE_2
4480 #undef DEF_FUNCTION_TYPE_3
4481 #undef DEF_FUNCTION_TYPE_4
4482 #undef DEF_FUNCTION_TYPE_5
4483 #undef DEF_FUNCTION_TYPE_6
4484 #undef DEF_FUNCTION_TYPE_7
4485 #undef DEF_FUNCTION_TYPE_VAR_0
4486 #undef DEF_FUNCTION_TYPE_VAR_1
4487 #undef DEF_FUNCTION_TYPE_VAR_2
4488 #undef DEF_FUNCTION_TYPE_VAR_3
4489 #undef DEF_FUNCTION_TYPE_VAR_4
4490 #undef DEF_FUNCTION_TYPE_VAR_5
4491 #undef DEF_POINTER_TYPE
4492 BT_LAST
4493 };
4497 /* A temporary array for c_common_nodes_and_builtins. Used in
4498 communication with def_fn_type. */
4501 /* A helper function for c_common_nodes_and_builtins. Build function type
4502 for DEF with return type RET and N arguments. If VAR is true, then the
4503 function should be variadic after those N arguments.
4505 Takes special care not to ICE if any of the types involved are
4506 error_mark_node, which indicates that said type is not in fact available
4507 (see builtin_type_for_size). In which case the function type as a whole
4508 should be error_mark_node. */
4510 static void
4512 {
4513 tree t;
4520 {
4526 }
4533 else
4536 egress:
4539 }
4541 /* Build builtin functions common to both C and C++ language
4542 frontends. */
4544 static void
4546 {
4547 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4548 builtin_types[ENUM] = VALUE;
4549 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4550 def_fn_type (ENUM, RETURN, 0, 0);
4551 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4552 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4553 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4554 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4555 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4556 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4557 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4558 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4559 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4560 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4561 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4562 ARG6) \
4563 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4564 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4565 ARG6, ARG7) \
4566 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4567 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4568 def_fn_type (ENUM, RETURN, 1, 0);
4569 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4570 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4571 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4572 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4573 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4574 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4575 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4576 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4577 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4578 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4579 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4580 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4584 #undef DEF_PRIMITIVE_TYPE
4585 #undef DEF_FUNCTION_TYPE_1
4586 #undef DEF_FUNCTION_TYPE_2
4587 #undef DEF_FUNCTION_TYPE_3
4588 #undef DEF_FUNCTION_TYPE_4
4589 #undef DEF_FUNCTION_TYPE_5
4590 #undef DEF_FUNCTION_TYPE_6
4591 #undef DEF_FUNCTION_TYPE_VAR_0
4592 #undef DEF_FUNCTION_TYPE_VAR_1
4593 #undef DEF_FUNCTION_TYPE_VAR_2
4594 #undef DEF_FUNCTION_TYPE_VAR_3
4595 #undef DEF_FUNCTION_TYPE_VAR_4
4596 #undef DEF_FUNCTION_TYPE_VAR_5
4597 #undef DEF_POINTER_TYPE
4602 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4603 NONANSI_P, ATTRS, IMPLICIT, COND) \
4604 if (NAME && COND) \
4605 def_builtin_1 (ENUM, NAME, CLASS, \
4606 builtin_types[(int) TYPE], \
4607 builtin_types[(int) LIBTYPE], \
4608 BOTH_P, FALLBACK_P, NONANSI_P, \
4609 built_in_attributes[(int) ATTRS], IMPLICIT);
4611 #undef DEF_BUILTIN
4619 }
4621 /* Like get_identifier, but avoid warnings about null arguments when
4622 the argument may be NULL for targets where GCC lacks stdint.h type
4623 information. */
4627 {
4629 }
4631 /* Build tree nodes and builtin functions common to both C and C++ language
4632 frontends. */
4634 void
4636 {
4640 tree array_domain_type;
4641 tree va_list_ref_type_node;
4642 tree va_list_arg_type_node;
4646 /* Define `int' and `char' first so that dbx will output them first. */
4650 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4651 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4652 but not C. Are the conditionals here needed? */
4658 long_unsigned_type_node);
4660 {
4662 int128_integer_type_node);
4664 int128_unsigned_type_node);
4665 }
4669 long_long_integer_type_node);
4671 long_long_unsigned_type_node);
4674 long_long_unsigned_type_node);
4677 short_unsigned_type_node);
4680 short_unsigned_type_node);
4682 /* Define both `signed char' and `unsigned char'. */
4686 /* These are types that c_common_type_for_size and
4687 c_common_type_for_mode use. */
4690 intQI_type_node));
4693 intHI_type_node));
4696 intSI_type_node));
4699 intDI_type_node));
4700 #if HOST_BITS_PER_WIDE_INT >= 64
4703 TYPE_DECL,
4705 intTI_type_node));
4706 #endif
4709 unsigned_intQI_type_node));
4712 unsigned_intHI_type_node));
4715 unsigned_intSI_type_node));
4718 unsigned_intDI_type_node));
4719 #if HOST_BITS_PER_WIDE_INT >= 64
4722 TYPE_DECL,
4724 unsigned_intTI_type_node));
4725 #endif
4727 /* Create the widest literal types. */
4728 widest_integer_literal_type_node
4732 widest_integer_literal_type_node));
4734 widest_unsigned_literal_type_node
4738 widest_unsigned_literal_type_node));
4742 pid_type_node =
4749 /* Only supported decimal floating point extension if the target
4750 actually supports underlying modes. */
4754 {
4758 }
4761 {
4766 long_long_fract_type_node);
4768 unsigned_short_fract_type_node);
4770 unsigned_fract_type_node);
4772 unsigned_long_fract_type_node);
4774 unsigned_long_long_fract_type_node);
4776 sat_short_fract_type_node);
4779 sat_long_fract_type_node);
4781 sat_long_long_fract_type_node);
4783 sat_unsigned_short_fract_type_node);
4785 sat_unsigned_fract_type_node);
4787 sat_unsigned_long_fract_type_node);
4789 sat_unsigned_long_long_fract_type_node);
4794 long_long_accum_type_node);
4796 unsigned_short_accum_type_node);
4798 unsigned_accum_type_node);
4800 unsigned_long_accum_type_node);
4802 unsigned_long_long_accum_type_node);
4804 sat_short_accum_type_node);
4807 sat_long_accum_type_node);
4809 sat_long_long_accum_type_node);
4811 sat_unsigned_short_accum_type_node);
4813 sat_unsigned_accum_type_node);
4815 sat_unsigned_long_accum_type_node);
4817 sat_unsigned_long_long_accum_type_node);
4819 }
4822 TYPE_DECL,
4824 complex_integer_type_node));
4826 TYPE_DECL,
4828 complex_float_type_node));
4830 TYPE_DECL,
4832 complex_double_type_node));
4836 complex_long_double_type_node));
4839 /* For C++, make fileptr_type_node a distinct void * type until
4840 FILE type is defined. */
4845 /* Set the TYPE_NAME for any variants that were built before
4846 record_builtin_type gave names to the built-in types. */
4847 {
4853 }
4855 /* This node must not be shared. */
4861 /* Make a type to be the domain of a few array types
4862 whose domains don't really matter.
4863 200 is small enough that it always fits in size_t
4864 and large enough that it can hold most function names for the
4865 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4868 /* Make a type for arrays of characters.
4869 With luck nothing will ever really depend on the length of this
4870 array type. */
4871 char_array_type_node
4874 /* Likewise for arrays of ints. */
4875 int_array_type_node
4879 const_string_type_node
4883 /* This is special for C++ so functions can be overloaded. */
4889 {
4892 else
4895 }
4897 /* This is for wide string constants. */
4898 wchar_array_type_node
4901 /* Define 'char16_t'. */
4906 {
4911 }
4913 /* This is for UTF-16 string constants. */
4914 char16_array_type_node
4917 /* Define 'char32_t'. */
4922 {
4927 }
4929 /* This is for UTF-32 string constants. */
4930 char32_array_type_node
4933 wint_type_node =
4936 intmax_type_node =
4938 uintmax_type_node =
4942 sig_atomic_type_node =
4945 int8_type_node =
4948 int16_type_node =
4951 int32_type_node =
4954 int64_type_node =
4957 uint8_type_node =
4960 uint16_type_node =
4963 c_uint32_type_node =
4966 c_uint64_type_node =
4969 int_least8_type_node =
4972 int_least16_type_node =
4975 int_least32_type_node =
4978 int_least64_type_node =
4981 uint_least8_type_node =
4984 uint_least16_type_node =
4987 uint_least32_type_node =
4990 uint_least64_type_node =
4993 int_fast8_type_node =
4996 int_fast16_type_node =
4999 int_fast32_type_node =
5002 int_fast64_type_node =
5005 uint_fast8_type_node =
5008 uint_fast16_type_node =
5011 uint_fast32_type_node =
5014 uint_fast64_type_node =
5017 intptr_type_node =
5020 uintptr_type_node =
5023 default_function_type
5025 ptrdiff_type_node
5032 va_list_type_node));
5034 {
5037 tree ptype;
5040 {
5044 ptype));
5046 }
5047 }
5050 {
5053 }
5054 else
5055 {
5058 }
5065 /* Create the built-in __null node. It is important that this is
5066 not shared. */
5070 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5072 }
5074 /* The number of named compound-literals generated thus far. */
5077 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5079 void
5081 {
5084 compound_literal_number);
5085 compound_literal_number++;
5087 }
5089 tree
5091 {
5095 }
5098 /* Linked list of disabled built-in functions. */
5101 {
5109 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5110 begins with "__builtin_", give an error. */
5112 void
5114 {
5117 else
5118 {
5123 }
5124 }
5127 /* Return true if the built-in function NAME has been disabled, false
5128 otherwise. */
5130 static bool
5132 {
5135 {
5138 }
5140 }
5143 /* Worker for DEF_BUILTIN.
5144 Possibly define a builtin function with one or two names.
5145 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5146 nonansi_p and flag_no_nonansi_builtin. */
5148 static void
5155 {
5156 tree decl;
5169 fnattrs);
5178 }
5179 \f
5180 /* Nonzero if the type T promotes to int. This is (nearly) the
5181 integral promotions defined in ISO C99 6.3.1.1/2. */
5183 bool
5185 {
5187 {
5197 /* ??? Technically all enumerations not larger than an int
5198 promote to an int. But this is used along code paths
5199 that only want to notice a size change. */
5207 }
5208 }
5210 /* Return 1 if PARMS specifies a fixed number of parameters
5211 and none of their types is affected by default promotions. */
5213 int
5215 {
5216 const_tree t;
5218 {
5235 }
5237 }
5239 /* Recursively remove any '*' or '&' operator from TYPE. */
5240 tree
5242 {
5246 }
5248 /* Recursively remove pointer or array type from TYPE. */
5249 tree
5251 {
5255 }
5257 /* Used to compare case labels. K1 and K2 are actually tree nodes
5258 representing case labels, or NULL_TREE for a `default' label.
5259 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5260 K2, and 0 if K1 and K2 are equal. */
5262 int
5264 {
5265 /* Consider a NULL key (such as arises with a `default' label) to be
5266 smaller than anything else. */
5273 }
5275 /* Process a case label, located at LOC, for the range LOW_VALUE
5276 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5277 then this case label is actually a `default' label. If only
5278 HIGH_VALUE is NULL_TREE, then case label was declared using the
5279 usual C/C++ syntax, rather than the GNU case range extension.
5280 CASES is a tree containing all the case ranges processed so far;
5281 COND is the condition for the switch-statement itself. Returns the
5282 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5283 is created. */
5285 tree
5288 {
5289 tree type;
5290 tree label;
5291 tree case_label;
5292 splay_tree_node node;
5294 /* Create the LABEL_DECL itself. */
5297 /* If there was an error processing the switch condition, bail now
5298 before we get more confused. */
5306 {
5309 }
5311 /* Case ranges are a GNU extension. */
5318 {
5323 }
5325 {
5330 }
5333 {
5334 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5335 really a case range, even though it was written that way.
5336 Remove the HIGH_VALUE to simplify later processing. */
5341 }
5343 /* See if the case is in range of the type of the original testing
5344 expression. If both low_value and high_value are out of range,
5345 don't insert the case label and return NULL_TREE. */
5351 /* Look up the LOW_VALUE in the table of case labels we already
5352 have. */
5354 /* If there was not an exact match, check for overlapping ranges.
5355 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5356 that's a `default' label and the only overlap is an exact match. */
5358 {
5359 splay_tree_node low_bound;
5360 splay_tree_node high_bound;
5362 /* Even though there wasn't an exact match, there might be an
5363 overlap between this case range and another case range.
5364 Since we've (inductively) not allowed any overlapping case
5365 ranges, we simply need to find the greatest low case label
5366 that is smaller that LOW_VALUE, and the smallest low case
5367 label that is greater than LOW_VALUE. If there is an overlap
5368 it will occur in one of these two ranges. */
5374 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5375 the LOW_VALUE, so there is no need to check unless the
5376 LOW_BOUND is in fact itself a case range. */
5382 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5383 range is bigger than the low end of the current range, so we
5384 are only interested if the current range is a real range, and
5385 not an ordinary case label. */
5387 && high_value
5389 high_value)
5392 }
5393 /* If there was an overlap, issue an error. */
5395 {
5399 {
5403 }
5405 {
5408 }
5409 else
5410 {
5414 }
5416 }
5418 /* Add a CASE_LABEL to the statement-tree. */
5420 /* Register this case label in the splay tree. */
5427 error_out:
5428 /* Add a label so that the back-end doesn't think that the beginning of
5429 the switch is unreachable. Note that we do not add a case label, as
5430 that just leads to duplicates and thence to failure later on. */
5432 {
5435 }
5437 }
5439 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5440 Used to verify that case values match up with enumerator values. */
5442 static void
5444 {
5447 /* ??? Not working too hard to print the double-word value.
5448 Should perhaps be done with %lwd in the diagnostic routines? */
5457 else
5466 buf);
5467 else
5472 }
5474 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5475 Used to verify that case values match up with enumerator values. */
5477 static int
5479 {
5483 /* Skip default case. */
5487 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5488 when we did our enum->case scan. Reset our scratch bit after. */
5491 else
5494 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5495 not set, that means that CASE_HIGH did not appear when we did our
5496 enum->case scan. Reset our scratch bit after. */
5498 {
5501 else
5503 }
5506 }
5508 /* Handle -Wswitch*. Called from the front end after parsing the
5509 switch construct. */
5510 /* ??? Should probably be somewhere generic, since other languages
5511 besides C and C++ would want this. At the moment, however, C/C++
5512 are the only tree-ssa languages that support enumerations at all,
5513 so the point is moot. */
5515 void
5518 {
5519 splay_tree_node default_node;
5520 splay_tree_node node;
5521 tree chain;
5531 /* From here on, we only care about about enumerated types. */
5535 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5539 /* Check the cases. Warn about case values which are not members of
5540 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5541 there is no default case, check that exactly all enumeration
5542 literals are covered by the cases. */
5544 /* Clearing COND if it is not an integer constant simplifies
5545 the tests inside the loop below. */
5549 /* The time complexity here is O(N*lg(N)) worst case, but for the
5550 common case of monotonically increasing enumerators, it is
5551 O(N), since the nature of the splay tree will keep the next
5552 element adjacent to the root at all times. */
5555 {
5561 {
5562 /* Mark the CASE_LOW part of the case entry as seen. */
5566 }
5568 /* Even though there wasn't an exact match, there might be a
5569 case range which includes the enumerator's value. */
5572 {
5576 {
5577 /* If we match the upper bound exactly, mark the CASE_HIGH
5578 part of the case entry as seen. */
5582 }
5583 }
5585 /* We've now determined that this enumerated literal isn't
5586 handled by the case labels of the switch statement. */
5588 /* If the switch expression is a constant, we only really care
5589 about whether that constant is handled by the switch. */
5593 /* If there is a default_node, the only relevant option is
5594 Wswitch-enum. Otherwise, if both are enabled then we prefer
5595 to warn using -Wswitch because -Wswitch is enabled by -Wall
5596 while -Wswitch-enum is explicit. */
5599 ? OPT_Wswitch_enum
5603 }
5605 /* Warn if there are case expressions that don't correspond to
5606 enumerators. This can occur since C and C++ don't enforce
5607 type-checking of assignments to enumeration variables.
5609 The time complexity here is now always O(N) worst case, since
5610 we should have marked both the lower bound and upper bound of
5611 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5612 above. This scan also resets those fields. */
5615 }
5617 /* Finish an expression taking the address of LABEL (an
5618 IDENTIFIER_NODE). Returns an expression for the address.
5620 LOC is the location for the expression returned. */
5622 tree
5624 {
5625 tree result;
5635 else
5636 {
5639 /* The current function is not necessarily uninlinable.
5640 Computed gotos are incompatible with inlining, but the value
5641 here could be used only in a diagnostic, for example. */
5643 }
5646 }
5647 \f
5649 /* Given a boolean expression ARG, return a tree representing an increment
5650 or decrement (as indicated by CODE) of ARG. The front end must check for
5651 invalid cases (e.g., decrement in C++). */
5652 tree
5654 {
5655 tree val;
5660 {
5683 }
5686 }
5687 \f
5688 /* Built-in macros for stddef.h and stdint.h, that require macros
5689 defined in this file. */
5690 void
5692 {
5755 }
5757 static void
5759 {
5760 /* Fill in the built_in_attributes array. */
5761 #define DEF_ATTR_NULL_TREE(ENUM) \
5762 built_in_attributes[(int) ENUM] = NULL_TREE;
5763 #define DEF_ATTR_INT(ENUM, VALUE) \
5764 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5765 #define DEF_ATTR_IDENT(ENUM, STRING) \
5766 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5767 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5768 built_in_attributes[(int) ENUM] \
5769 = tree_cons (built_in_attributes[(int) PURPOSE], \
5770 built_in_attributes[(int) VALUE], \
5771 built_in_attributes[(int) CHAIN]);
5773 #undef DEF_ATTR_NULL_TREE
5774 #undef DEF_ATTR_INT
5775 #undef DEF_ATTR_IDENT
5776 #undef DEF_ATTR_TREE_LIST
5777 }
5779 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5780 identifier as an argument, so the front end shouldn't look it up. */
5782 bool
5784 {
5787 /* Unknown attribute that we'll end up ignoring, return true so we
5788 don't complain about an identifier argument. */
5794 else
5796 }
5798 /* Attribute handlers common to C front ends. */
5800 /* Handle a "packed" attribute; arguments as in
5801 struct attribute_spec.handler. */
5803 static tree
5806 {
5808 {
5812 }
5814 {
5816 /* Still pack bitfields. */
5821 else
5823 }
5824 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5825 used for DECL_REGISTER. It wouldn't mean anything anyway.
5826 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5827 that changes what the typedef is typing. */
5828 else
5829 {
5832 }
5835 }
5837 /* Handle a "nocommon" attribute; arguments as in
5838 struct attribute_spec.handler. */
5840 static tree
5844 {
5847 else
5848 {
5851 }
5854 }
5856 /* Handle a "common" attribute; arguments as in
5857 struct attribute_spec.handler. */
5859 static tree
5862 {
5865 else
5866 {
5869 }
5872 }
5874 /* Handle a "noreturn" attribute; arguments as in
5875 struct attribute_spec.handler. */
5877 static tree
5880 {
5883 /* See FIXME comment in c_common_attribute_table. */
5890 = build_pointer_type
5893 else
5894 {
5897 }
5900 }
5902 /* Handle a "hot" and attribute; arguments as in
5903 struct attribute_spec.handler. */
5905 static tree
5908 {
5910 {
5912 {
5916 }
5917 /* Most of the rest of the hot processing is done later with
5918 lookup_attribute. */
5919 }
5920 else
5921 {
5924 }
5927 }
5928 /* Handle a "cold" and attribute; arguments as in
5929 struct attribute_spec.handler. */
5931 static tree
5934 {
5936 {
5938 {
5942 }
5943 /* Most of the rest of the cold processing is done later with
5944 lookup_attribute. */
5945 }
5946 else
5947 {
5950 }
5953 }
5955 /* Handle a "noinline" attribute; arguments as in
5956 struct attribute_spec.handler. */
5958 static tree
5962 {
5965 else
5966 {
5969 }
5972 }
5974 /* Handle a "noclone" attribute; arguments as in
5975 struct attribute_spec.handler. */
5977 static tree
5981 {
5983 {
5986 }
5989 }
5991 /* Handle a "always_inline" attribute; arguments as in
5992 struct attribute_spec.handler. */
5994 static tree
5999 {
6001 {
6002 /* Set the attribute and mark it for disregarding inline
6003 limits. */
6005 }
6006 else
6007 {
6010 }
6013 }
6015 /* Handle a "gnu_inline" attribute; arguments as in
6016 struct attribute_spec.handler. */
6018 static tree
6023 {
6025 {
6026 /* Do nothing else, just set the attribute. We'll get at
6027 it later with lookup_attribute. */
6028 }
6029 else
6030 {
6033 }
6036 }
6038 /* Handle a "leaf" attribute; arguments as in
6039 struct attribute_spec.handler. */
6041 static tree
6045 {
6047 {
6050 }
6052 {
6055 }
6058 }
6060 /* Handle an "artificial" attribute; arguments as in
6061 struct attribute_spec.handler. */
6063 static tree
6068 {
6070 {
6071 /* Do nothing else, just set the attribute. We'll get at
6072 it later with lookup_attribute. */
6073 }
6074 else
6075 {
6078 }
6081 }
6083 /* Handle a "flatten" attribute; arguments as in
6084 struct attribute_spec.handler. */
6086 static tree
6088 tree args ATTRIBUTE_UNUSED,
6090 {
6092 /* Do nothing else, just set the attribute. We'll get at
6093 it later with lookup_attribute. */
6094 ;
6095 else
6096 {
6099 }
6102 }
6104 /* Handle a "warning" or "error" attribute; arguments as in
6105 struct attribute_spec.handler. */
6107 static tree
6110 {
6113 /* Do nothing else, just set the attribute. We'll get at
6114 it later with lookup_attribute. */
6115 ;
6116 else
6117 {
6120 }
6123 }
6125 /* Handle a "used" attribute; arguments as in
6126 struct attribute_spec.handler. */
6128 static tree
6131 {
6137 {
6142 }
6143 else
6144 {
6147 }
6150 }
6152 /* Handle a "unused" attribute; arguments as in
6153 struct attribute_spec.handler. */
6155 static tree
6158 {
6160 {
6168 {
6173 }
6174 else
6175 {
6178 }
6179 }
6180 else
6181 {
6185 }
6188 }
6190 /* Handle a "externally_visible" attribute; arguments as in
6191 struct attribute_spec.handler. */
6193 static tree
6198 {
6202 {
6205 {
6209 }
6210 }
6211 else
6212 {
6215 }
6218 }
6220 /* Handle a "const" attribute; arguments as in
6221 struct attribute_spec.handler. */
6223 static tree
6226 {
6229 /* See FIXME comment on noreturn in c_common_attribute_table. */
6235 = build_pointer_type
6238 else
6239 {
6242 }
6245 }
6247 /* Handle a "transparent_union" attribute; arguments as in
6248 struct attribute_spec.handler. */
6250 static tree
6254 {
6255 tree type;
6264 {
6265 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6266 the code in finish_struct. */
6268 {
6274 /* A type variant isn't good enough, since we don't a cast
6275 to such a type removed as a no-op. */
6277 }
6281 }
6283 ignored:
6286 }
6288 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6289 get the requested priority for a constructor or destructor,
6290 possibly issuing diagnostics for invalid or reserved
6291 priorities. */
6293 static priority_type
6295 {
6296 HOST_WIDE_INT pri;
6297 tree arg;
6303 {
6306 else
6309 }
6321 {
6324 "destructor priorities from 0 to %d are reserved "
6326 MAX_RESERVED_INIT_PRIORITY);
6327 else
6329 "constructor priorities from 0 to %d are reserved "
6331 MAX_RESERVED_INIT_PRIORITY);
6332 }
6335 invalid:
6338 MAX_INIT_PRIORITY);
6339 else
6341 MAX_INIT_PRIORITY);
6343 }
6345 /* Handle a "constructor" attribute; arguments as in
6346 struct attribute_spec.handler. */
6348 static tree
6352 {
6359 {
6360 priority_type priority;
6365 }
6366 else
6367 {
6370 }
6373 }
6375 /* Handle a "destructor" attribute; arguments as in
6376 struct attribute_spec.handler. */
6378 static tree
6382 {
6389 {
6390 priority_type priority;
6395 }
6396 else
6397 {
6400 }
6403 }
6405 /* Nonzero if the mode is a valid vector mode for this architecture.
6406 This returns nonzero even if there is no hardware support for the
6407 vector mode, but we can emulate with narrower modes. */
6409 static int
6411 {
6415 /* Doh! What's going on? */
6424 /* Hardware support. Woo hoo! */
6430 /* We should probably return 1 if requesting V4DI and we have no DI,
6431 but we have V2DI, but this is probably very unlikely. */
6433 /* If we have support for the inner mode, we can safely emulate it.
6434 We may not have V2DI, but me can emulate with a pair of DIs. */
6436 }
6439 /* Handle a "mode" attribute; arguments as in
6440 struct attribute_spec.handler. */
6442 static tree
6445 {
6453 else
6454 {
6459 tree typefm;
6464 {
6470 }
6472 /* Change this type to have a type with the specified mode.
6473 First check for the special modes. */
6486 else
6489 {
6492 }
6495 {
6498 }
6502 {
6534 }
6536 {
6539 }
6542 {
6547 {
6550 }
6554 else
6557 }
6558 else
6559 {
6560 /* For fixed-point modes, we need to test if the signness of type
6561 and the machine mode are consistent. */
6564 {
6567 }
6568 /* For fixed-point modes, we need to pass saturating info. */
6572 }
6575 {
6578 }
6580 {
6581 /* For enumeral types, copy the precision from the integer
6582 type returned above. If not an INTEGER_TYPE, we can't use
6583 this mode for this type. */
6585 {
6588 }
6591 {
6594 }
6595 else
6596 {
6597 /* We cannot build a type variant, as there's code that assumes
6598 that TYPE_MAIN_VARIANT has the same mode. This includes the
6599 debug generators. Instead, create a subrange type. This
6600 results in all of the enumeral values being emitted only once
6601 in the original, and the subtype gets them by reference. */
6604 else
6607 }
6608 }
6612 {
6615 }
6618 }
6621 }
6623 /* Handle a "section" attribute; arguments as in
6624 struct attribute_spec.handler. */
6626 static tree
6629 {
6633 {
6639 {
6643 {
6645 "section attribute cannot be specified for "
6648 }
6650 /* The decl may have already been given a section attribute
6651 from a previous declaration. Ensure they match. */
6655 {
6659 }
6663 {
6666 }
6667 else
6669 }
6670 else
6671 {
6674 }
6675 }
6676 else
6677 {
6681 }
6684 }
6686 /* Check whether ALIGN is a valid user-specified alignment. If so,
6687 return its base-2 log; if not, output an error and return -1. If
6688 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
6689 no error. */
6690 int
6692 {
6697 {
6700 }
6704 {
6707 }
6709 {
6712 }
6714 }
6716 /* Handle a "aligned" attribute; arguments as in
6717 struct attribute_spec.handler. */
6719 static tree
6722 {
6731 {
6735 }
6742 {
6745 /* If we have a TYPE_DECL, then copy the type, so that we
6746 don't accidentally modify a builtin type. See pushdecl. */
6749 {
6756 }
6757 else
6762 }
6765 {
6768 }
6771 {
6776 else
6780 }
6781 else
6782 {
6785 }
6788 }
6790 /* Handle a "weak" attribute; arguments as in
6791 struct attribute_spec.handler. */
6793 static tree
6798 {
6801 {
6804 }
6806 {
6810 }
6814 else
6818 }
6820 /* Handle an "alias" or "ifunc" attribute; arguments as in
6821 struct attribute_spec.handler, except that IS_ALIAS tells us
6822 whether this is an alias as opposed to ifunc attribute. */
6824 static tree
6827 {
6832 {
6835 }
6839 /* A static variable declaration is always a tentative definition,
6840 but the alias is a non-tentative definition which overrides. */
6843 {
6847 }
6851 {
6855 }
6857 /* Note that the very first time we process a nested declaration,
6858 decl_function_context will not be set. Indeed, *would* never
6859 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6860 we do below. After such frobbery, pushdecl would set the context.
6861 In any case, this is never what we want. */
6863 {
6864 tree id;
6868 {
6872 }
6874 /* This counts as a use of the object pointed to. */
6879 else
6880 {
6883 else
6886 }
6889 /* ifuncs are also aliases, so set that attribute too. */
6892 }
6893 else
6894 {
6897 }
6900 }
6902 /* Handle an "alias" or "ifunc" attribute; arguments as in
6903 struct attribute_spec.handler. */
6905 static tree
6908 {
6910 }
6912 /* Handle an "alias" or "ifunc" attribute; arguments as in
6913 struct attribute_spec.handler. */
6915 static tree
6918 {
6920 }
6922 /* Handle a "weakref" attribute; arguments as in struct
6923 attribute_spec.handler. */
6925 static tree
6928 {
6931 /* We must ignore the attribute when it is associated with
6932 local-scoped decls, since attribute alias is ignored and many
6933 such symbols do not even have a DECL_WEAK field. */
6935 || current_function_decl
6937 {
6941 }
6944 {
6948 }
6950 /* The idea here is that `weakref("name")' mutates into `weakref,
6951 alias("name")', and weakref without arguments, in turn,
6952 implicitly adds weak. */
6955 {
6962 }
6963 else
6964 {
6969 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6970 and that isn't supported; and because it wants to add it to
6971 the list of weak decls, which isn't helpful. */
6973 }
6976 }
6978 /* Handle an "visibility" attribute; arguments as in
6979 struct attribute_spec.handler. */
6981 static tree
6985 {
6991 {
6995 {
6997 name);
6999 }
7001 {
7005 }
7006 }
7008 {
7011 }
7014 {
7017 }
7019 /* If this is a type, set the visibility on the type decl. */
7021 {
7026 {
7028 name);
7030 }
7031 }
7041 else
7042 {
7043 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7045 }
7049 {
7063 }
7068 /* Go ahead and attach the attribute to the node as well. This is needed
7069 so we can determine whether we have VISIBILITY_DEFAULT because the
7070 visibility was not specified, or because it was explicitly overridden
7071 from the containing scope. */
7074 }
7076 /* Determine the ELF symbol visibility for DECL, which is either a
7077 variable or a function. It is an error to use this function if a
7078 definition of DECL is not available in this translation unit.
7079 Returns true if the final visibility has been determined by this
7080 function; false if the caller is free to make additional
7081 modifications. */
7083 bool
7085 {
7089 /* If the user explicitly specified the visibility with an
7090 attribute, honor that. DECL_VISIBILITY will have been set during
7091 the processing of the attribute. We check for an explicit
7092 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7093 to distinguish the use of an attribute from the use of a "#pragma
7094 GCC visibility push(...)"; in the latter case we still want other
7095 considerations to be able to overrule the #pragma. */
7097 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7102 /* Set default visibility to whatever the user supplied with
7103 visibility_specified depending on #pragma GCC visibility. */
7105 {
7108 {
7111 /* If visibility changed and DECL already has DECL_RTL, ensure
7112 symbol flags are updated. */
7117 }
7118 }
7120 }
7122 /* Handle an "tls_model" attribute; arguments as in
7123 struct attribute_spec.handler. */
7125 static tree
7128 {
7129 tree id;
7136 {
7139 }
7144 {
7147 }
7157 else
7158 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7162 }
7164 /* Handle a "no_instrument_function" attribute; arguments as in
7165 struct attribute_spec.handler. */
7167 static tree
7172 {
7176 {
7180 }
7182 {
7186 }
7187 else
7191 }
7193 /* Handle a "malloc" attribute; arguments as in
7194 struct attribute_spec.handler. */
7196 static tree
7199 {
7203 else
7204 {
7207 }
7210 }
7212 /* Handle a "alloc_size" attribute; arguments as in
7213 struct attribute_spec.handler. */
7215 static tree
7218 {
7221 {
7228 {
7233 }
7234 }
7236 }
7238 /* Handle a "fn spec" attribute; arguments as in
7239 struct attribute_spec.handler. */
7241 static tree
7245 {
7250 }
7252 /* Handle a "returns_twice" attribute; arguments as in
7253 struct attribute_spec.handler. */
7255 static tree
7258 {
7261 else
7262 {
7265 }
7268 }
7270 /* Handle a "no_limit_stack" attribute; arguments as in
7271 struct attribute_spec.handler. */
7273 static tree
7278 {
7282 {
7286 }
7288 {
7292 }
7293 else
7297 }
7299 /* Handle a "pure" attribute; arguments as in
7300 struct attribute_spec.handler. */
7302 static tree
7305 {
7308 /* ??? TODO: Support types. */
7309 else
7310 {
7313 }
7316 }
7318 /* Handle a "no vops" attribute; arguments as in
7319 struct attribute_spec.handler. */
7321 static tree
7325 {
7329 }
7331 /* Handle a "deprecated" attribute; arguments as in
7332 struct attribute_spec.handler. */
7334 static tree
7338 {
7346 {
7349 }
7352 {
7363 else
7365 }
7367 {
7372 }
7373 else
7377 {
7380 {
7386 }
7389 else
7391 }
7394 }
7396 /* Handle a "vector_size" attribute; arguments as in
7397 struct attribute_spec.handler. */
7399 static tree
7403 {
7413 {
7416 }
7418 /* Get the vector size (in bytes). */
7421 /* We need to provide for vector pointers, vector arrays, and
7422 functions returning vectors. For example:
7424 __attribute__((vector_size(16))) short *foo;
7426 In this case, the mode is SI, but the type being modified is
7427 HI, so we need to look further. */
7436 /* Get the mode of the type being modified. */
7447 {
7450 }
7453 {
7456 }
7459 {
7462 }
7464 /* Calculate how many units fit in the vector. */
7467 {
7470 }
7474 /* Build back pointers if needed. */
7478 }
7480 /* Handle the "nonnull" attribute. */
7481 static tree
7485 {
7489 /* If no arguments are specified, all pointer arguments should be
7490 non-null. Verify a full prototype is given so that the arguments
7491 will have the correct types when we actually check them later. */
7493 {
7495 {
7498 }
7500 }
7502 /* Argument list specified. Verify that each argument number references
7503 a pointer argument. */
7505 {
7509 {
7514 }
7517 {
7518 function_args_iterator iter;
7519 tree argument;
7523 {
7527 }
7531 {
7536 }
7539 {
7544 }
7545 }
7546 }
7549 }
7551 /* Check the argument list of a function call for null in argument slots
7552 that are marked as requiring a non-null pointer argument. The NARGS
7553 arguments are passed in the array ARGARRAY.
7554 */
7556 static void
7558 {
7563 {
7565 {
7568 /* Walk the argument list. If we encounter an argument number we
7569 should check for non-null, do it. If the attribute has no args,
7570 then every pointer argument is checked (in which case the check
7571 for pointer type is done in check_nonnull_arg). */
7573 {
7578 }
7579 }
7580 }
7581 }
7583 /* Check that the Nth argument of a function call (counting backwards
7584 from the end) is a (pointer)0. The NARGS arguments are passed in the
7585 array ARGARRAY. */
7587 static void
7589 {
7593 {
7596 tree sentinel;
7597 function_args_iterator iter;
7598 tree t;
7600 /* Skip over the named arguments. */
7602 {
7605 len++;
7606 }
7609 {
7612 }
7614 /* The sentinel must be one of the varargs, i.e.
7615 in position >= the number of fixed arguments. */
7617 {
7621 }
7623 /* Validate the sentinel. */
7627 /* Although __null (in C++) is only an integer we allow it
7628 nevertheless, as we are guaranteed that it's exactly
7629 as wide as a pointer, and we don't want to force
7630 users to cast the NULL they have written there.
7631 We warn with -Wstrict-null-sentinel, though. */
7634 }
7635 }
7637 /* Helper for check_function_nonnull; given a list of operands which
7638 must be non-null in ARGS, determine if operand PARAM_NUM should be
7639 checked. */
7641 static bool
7643 {
7647 {
7654 }
7656 }
7658 /* Check that the function argument PARAM (which is operand number
7659 PARAM_NUM) is non-null. This is called by check_function_nonnull
7660 via check_function_arguments_recurse. */
7662 static void
7665 {
7666 /* Just skip checking the argument if it's not a pointer. This can
7667 happen if the "nonnull" attribute was given without an operand
7668 list (which means to check every pointer argument). */
7676 }
7678 /* Helper for nonnull attribute handling; fetch the operand number
7679 from the attribute argument list. */
7681 static bool
7683 {
7684 /* Verify the arg number is a constant. */
7691 }
7693 /* Handle a "nothrow" attribute; arguments as in
7694 struct attribute_spec.handler. */
7696 static tree
7699 {
7702 /* ??? TODO: Support types. */
7703 else
7704 {
7707 }
7710 }
7712 /* Handle a "cleanup" attribute; arguments as in
7713 struct attribute_spec.handler. */
7715 static tree
7718 {
7722 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7723 for global destructors in C++. This requires infrastructure that
7724 we don't have generically at the moment. It's also not a feature
7725 we'd be missing too much, since we do have attribute constructor. */
7727 {
7731 }
7733 /* Verify that the argument is a function in scope. */
7734 /* ??? We could support pointers to functions here as well, if
7735 that was considered desirable. */
7738 {
7742 }
7745 {
7749 }
7751 /* That the function has proper type is checked with the
7752 eventual call to build_function_call. */
7755 }
7757 /* Handle a "warn_unused_result" attribute. No special handling. */
7759 static tree
7763 {
7764 /* Ignore the attribute for functions not returning any value. */
7766 {
7769 }
7772 }
7774 /* Handle a "sentinel" attribute. */
7776 static tree
7779 {
7781 {
7785 }
7786 else
7787 {
7789 {
7793 }
7794 }
7797 {
7801 {
7805 }
7806 else
7807 {
7809 {
7813 }
7814 }
7815 }
7818 }
7820 /* Handle a "type_generic" attribute. */
7822 static tree
7826 {
7827 /* Ensure we have a function type. */
7830 /* Ensure we have a variadic function. */
7834 }
7836 /* Handle a "target" attribute. */
7838 static tree
7841 {
7842 /* Ensure we have a function type. */
7844 {
7847 }
7849 flags))
7853 }
7855 /* Arguments being collected for optimization. */
7862 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7863 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7864 false for #pragma GCC optimize. */
7866 bool
7868 {
7876 tree ap;
7878 /* Build up argv vector. Just in case the string is stored away, use garbage
7879 collected strings. */
7884 {
7888 {
7892 }
7895 {
7896 /* Split string into multiple substrings. */
7904 {
7911 {
7915 }
7916 else
7917 {
7920 }
7924 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7925 options. */
7927 {
7932 else
7936 }
7939 {
7942 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7943 itself is -Os, and any other switch begins with a -f. */
7949 }
7954 }
7956 }
7957 }
7967 /* Now parse the options. */
7977 /* Don't allow changing -fstrict-aliasing. */
7982 }
7984 /* For handling "optimize" attribute. arguments as in
7985 struct attribute_spec.handler. */
7987 static tree
7990 {
7991 /* Ensure we have a function type. */
7993 {
7996 }
7997 else
7998 {
8002 /* Save current options. */
8005 /* If we previously had some optimization options, use them as the
8006 default. */
8011 /* Parse options, and update the vector. */
8016 /* Restore current options. */
8018 }
8021 }
8023 /* Handle a "no_split_stack" attribute. */
8025 static tree
8030 {
8034 {
8038 }
8040 {
8044 }
8047 }
8048 \f
8049 /* Check for valid arguments being passed to a function with FNTYPE.
8050 There are NARGS arguments in the array ARGARRAY. */
8051 void
8053 {
8054 /* Check for null being passed in a pointer argument that must be
8055 non-null. We also need to do this if format checking is enabled. */
8060 /* Check for errors in format strings. */
8067 }
8069 /* Generic argument checking recursion routine. PARAM is the argument to
8070 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8071 once the argument is resolved. CTX is context for the callback. */
8072 void
8077 {
8081 {
8082 /* Strip coercion. */
8086 }
8089 {
8091 tree attrs;
8094 /* See if this is a call to a known internationalization function
8095 that modifies a format arg. Such a function may have multiple
8096 format_arg attributes (for example, ngettext). */
8099 attrs;
8102 {
8103 tree inner_arg;
8104 tree format_num_expr;
8107 call_expr_arg_iterator iter;
8109 /* Extract the argument number, which was previously checked
8110 to be valid. */
8122 {
8127 }
8128 }
8130 /* If we found a format_arg attribute and did a recursive check,
8131 we are done with checking this argument. Otherwise, we continue
8132 and this will be considered a non-literal. */
8135 }
8138 {
8139 /* Check both halves of the conditional expression. */
8145 }
8148 }
8150 /* Checks for a builtin function FNDECL that the number of arguments
8151 NARGS against the required number REQUIRED and issues an error if
8152 there is a mismatch. Returns true if the number of arguments is
8153 correct, otherwise false. */
8155 static bool
8157 {
8159 {
8163 }
8165 {
8169 }
8171 }
8173 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8174 Returns false if there was an error, otherwise true. */
8176 bool
8178 {
8184 {
8194 {
8196 {
8200 }
8202 }
8212 {
8219 {
8223 }
8225 }
8230 {
8235 {
8239 }
8242 {
8244 fndecl);
8246 }
8248 }
8253 {
8255 {
8258 }
8260 }
8265 }
8266 }
8268 /* Function to help qsort sort FIELD_DECLs by name order. */
8270 int
8272 {
8277 /* A nontype is "greater" than a type. */
8286 }
8289 gt_pointer_operator new_value;
8293 /* This routine compares two fields like field_decl_cmp but using the
8294 pointer operator in resort_data. */
8296 static int
8298 {
8303 /* A nontype is "greater" than a type. */
8309 {
8316 }
8318 }
8320 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8322 void
8325 gt_pointer_operator new_value,
8327 {
8332 resort_field_decl_cmp);
8333 }
8335 /* Subroutine of c_parse_error.
8336 Return the result of concatenating LHS and RHS. RHS is really
8337 a string literal, its first character is indicated by RHS_START and
8338 RHS_SIZE is its length (including the terminating NUL character).
8340 The caller is responsible for deleting the returned pointer. */
8344 {
8350 }
8352 /* Issue the error given by GMSGID, indicating that it occurred before
8353 TOKEN, which had the associated VALUE. */
8355 void
8358 {
8359 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8369 {
8374 {
8387 }
8391 else
8397 }
8407 {
8412 }
8420 {
8425 }
8426 else
8430 {
8433 }
8434 #undef catenate_messages
8435 }
8437 /* Mapping for cpp message reasons to the options that enable them. */
8439 struct reason_option_codes_t
8440 {
8443 };
8462 };
8464 /* Return the gcc option code associated with the reason for a cpp
8465 message, or 0 if none. */
8467 static int
8469 {
8473 {
8476 }
8478 }
8480 /* Callback from cpp_error for PFILE to print diagnostics from the
8481 preprocessor. The diagnostic is of type LEVEL, with REASON set
8482 to the reason code if LEVEL is represents a warning, at location
8483 LOCATION unless this is after lexing and the compiler's location
8484 should be used instead, with column number possibly overridden by
8485 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8486 the arguments. Returns true if a diagnostic was emitted, false
8487 otherwise. */
8489 bool
8493 {
8494 diagnostic_info diagnostic;
8495 diagnostic_t dlevel;
8500 {
8505 /* Fall through. */
8530 }
8543 }
8545 /* Convert a character from the host to the target execution character
8546 set. cpplib handles this, mostly. */
8548 HOST_WIDE_INT
8550 {
8551 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8552 zero-extended under -fno-signed-char. cpplib insists that characters
8553 and character constants are always unsigned. Hence we must convert
8554 back and forth. */
8562 else
8564 }
8566 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
8567 references with an INDIRECT_REF of a constant at the bottom; much like the
8568 traditional rendering of offsetof as a macro. Return the folded result. */
8570 tree
8572 {
8576 {
8592 {
8595 }
8605 {
8609 }
8623 /* Check if the offset goes beyond the upper bound of the array. */
8625 {
8631 {
8635 {
8636 tree v;
8643 {
8651 }
8652 /* Don't warn if the array might be considered a poor
8653 man's flexible array member with a very permissive
8654 definition thereof. */
8658 "index %E denotes an offset "
8661 }
8662 }
8663 }
8670 /* Handle static members of volatile structs. */
8677 }
8680 }
8682 /* Likewise, but convert it to the return type of offsetof. */
8684 tree
8686 {
8688 }
8690 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
8691 expression, because B will always be true. */
8693 void
8695 {
8698 "the omitted middle operand in ?: will always be %<true%>, "
8700 }
8702 /* Give an error for storing into ARG, which is 'const'. USE indicates
8703 how ARG was being used. */
8705 void
8707 {
8710 /* Using this macro rather than (for example) arrays of messages
8711 ensures that all the format strings are checked at compile
8712 time. */
8713 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
8714 : (use == lv_increment ? (I) \
8715 : (use == lv_decrement ? (D) : (AS))))
8717 {
8728 else
8734 }
8740 arg);
8746 arg);
8748 {
8758 arg);
8759 }
8765 arg);
8766 else
8771 arg);
8772 }
8774 /* Print an error message for an invalid lvalue. USE says
8775 how the lvalue is being used and so selects the error message. LOC
8776 is the location for the error. */
8778 void
8780 {
8782 {
8800 }
8801 }
8803 /* Print an error message for an invalid indirection of type TYPE.
8804 ERRSTRING is the name of the operator for the indirection. */
8806 void
8808 {
8810 {
8818 type);
8823 type);
8828 type);
8833 type);
8837 }
8838 }
8839 \f
8840 /* *PTYPE is an incomplete array. Complete it with a domain based on
8841 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8842 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8843 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8845 int
8847 {
8854 {
8856 {
8857 int eltsize
8860 }
8862 {
8866 {
8870 }
8871 else
8872 {
8873 tree curindex;
8886 cnt++)
8887 {
8891 else
8892 {
8896 size_one_node);
8897 }
8900 }
8903 }
8904 }
8905 else
8906 {
8907 /* Make an error message unless that happened already. */
8910 }
8911 }
8912 else
8913 {
8917 }
8924 else
8927 /* Using build_distinct_type_copy and modifying things afterward instead
8928 of using build_array_type to create a new type preserves all of the
8929 TYPE_LANG_FLAG_? bits that the front end may have set. */
8937 /* Make sure we have the canonical MAIN_TYPE. */
8940 hashcode);
8943 /* Fix the canonical type. */
8953 else
8958 else
8964 {
8966 /* If we proceed with the array type as it is, we'll eventually
8967 crash in tree_low_cst(). */
8969 }
8973 }
8975 /* Like c_mark_addressable but don't check register qualifier. */
8976 void
8978 {
8984 }
8987 \f
8988 /* Used to help initialize the builtin-types.def table. When a type of
8989 the correct size doesn't exist, use error_mark_node instead of NULL.
8990 The later results in segfaults even when a decl using the type doesn't
8991 get invoked. */
8993 tree
8995 {
8998 }
9000 /* A helper function for resolve_overloaded_builtin in resolving the
9001 overloaded __sync_ builtins. Returns a positive power of 2 if the
9002 first operand of PARAMS is a pointer to a supported data type.
9003 Returns 0 if an error is encountered. */
9005 static int
9007 {
9008 tree type;
9012 {
9015 }
9029 incompatible:
9032 }
9034 /* A helper function for resolve_overloaded_builtin. Adds casts to
9035 PARAMS to make arguments match up with those of FUNCTION. Drops
9036 the variadic arguments at the end. Returns false if some error
9037 was encountered; true on success. */
9039 static bool
9042 {
9043 function_args_iterator iter;
9044 tree ptype;
9048 /* We've declared the implementation functions to use "volatile void *"
9049 as the pointer parameter, so we shouldn't get any complaints from the
9050 call to check_function_arguments what ever type the user used. */
9054 /* For the rest of the values, we need to cast these to FTYPE, so that we
9055 don't get warnings for passing pointer types, etc. */
9058 {
9062 /* XXX void_type_node belies the abstraction. */
9068 {
9071 }
9073 /* Only convert parameters if the size is appropriate with new format
9074 sync routines. */
9077 {
9078 /* Ideally for the first conversion we'd use convert_for_assignment
9079 so that we get warnings for anything that doesn't match the pointer
9080 type. This isn't portable across the C and C++ front ends atm. */
9085 }
9088 }
9090 /* __atomic routines are not variadic. */
9092 {
9095 }
9097 /* The definition of these primitives is variadic, with the remaining
9098 being "an optional list of variables protected by the memory barrier".
9099 No clue what that's supposed to mean, precisely, but we consider all
9100 call-clobbered variables to be protected so we're safe. */
9104 }
9106 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9107 RESULT to make it match the type of the first pointer argument in
9108 PARAMS. */
9110 static tree
9112 {
9117 /* New format doesn't require casting unless the types are the same size. */
9120 else
9122 }
9124 /* This function verifies the PARAMS to generic atomic FUNCTION.
9125 It returns the size if all the parameters are the same size, otherwise
9126 0 is returned if the parameters are invalid. */
9128 static int
9130 {
9135 tree type_0;
9137 /* Determine the parameter makeup. */
9139 {
9155 }
9158 {
9161 }
9163 /* Get type of first parameter, and determine its size. */
9166 {
9169 }
9172 /* Check each other parameter is a pointer and the same size. */
9174 {
9177 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
9181 {
9183 function);
9185 }
9188 {
9190 function);
9192 }
9193 }
9195 /* Check memory model parameters for validity. */
9197 {
9200 {
9203 {
9206 function);
9208 }
9209 }
9210 else
9212 {
9214 function);
9216 }
9217 }
9220 }
9223 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
9224 at the beginning of the parameter list PARAMS representing the size of the
9225 objects. This is to match the library ABI requirement. LOC is the location
9226 of the function call.
9227 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
9228 returned to allow the external call to be constructed. */
9230 static tree
9233 {
9234 tree size_node;
9236 /* Insert a SIZE_T parameter as the first param. If there isn't
9237 enough space, allocate a new vector and recursively re-build with that. */
9239 {
9242 tree f;
9251 }
9253 /* Add the size parameter and leave as a function call for processing. */
9257 }
9260 /* This will process an __atomic_exchange function call, determine whether it
9261 needs to be mapped to the _N variation, or turned into a library call.
9262 LOC is the location of the builtin call.
9263 FUNCTION is the DECL that has been invoked;
9264 PARAMS is the argument list for the call. The return value is non-null
9265 TRUE is returned if it is translated into the proper format for a call to the
9266 external library, and NEW_RETURN is set the tree for that function.
9267 FALSE is returned if processing for the _N variation is required, and
9268 NEW_RETURN is set to the the return value the result is copied into. */
9269 static bool
9272 {
9277 /* If not a lock-free size, change to the library generic format. */
9279 {
9282 }
9284 /* Otherwise there is a lockfree match, transform the call from:
9285 void fn(T* mem, T* desired, T* return, model)
9286 into
9287 *return = (T) (fn (In* mem, (In) *desired, model)) */
9294 /* Create pointer to appropriate size. */
9298 /* Convert object pointer to required type. */
9302 /* Convert new value to required type, and dereference it. */
9307 /* Move memory model to the 3rd position, and end param list. */
9311 /* Convert return pointer and dereference it for later assignment. */
9315 }
9318 /* This will process an __atomic_compare_exchange function call, determine
9319 whether it needs to be mapped to the _N variation, or turned into a lib call.
9320 LOC is the location of the builtin call.
9321 FUNCTION is the DECL that has been invoked;
9322 PARAMS is the argument list for the call. The return value is non-null
9323 TRUE is returned if it is translated into the proper format for a call to the
9324 external library, and NEW_RETURN is set the tree for that function.
9325 FALSE is returned if processing for the _N variation is required. */
9327 static bool
9331 {
9336 /* If not a lock-free size, change to the library generic format. */
9338 {
9339 /* The library generic format does not have the weak parameter, so
9340 remove it from the param list. Since a parameter has been removed,
9341 we can be sure that there is room for the SIZE_T parameter, meaning
9342 there will not be a recursive rebuilding of the parameter list, so
9343 there is no danger this will be done twice. */
9345 {
9349 }
9352 }
9354 /* Otherwise, there is a match, so the call needs to be transformed from:
9355 bool fn(T* mem, T* desired, T* return, weak, success, failure)
9356 into
9357 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
9363 /* Create pointer to appropriate size. */
9367 /* Convert object pointer to required type. */
9371 /* Convert expected pointer to required type. */
9375 /* Convert desired value to required type, and dereference it. */
9380 /* The rest of the parameters are fine. NULL means no special return value
9381 processing.*/
9384 }
9387 /* This will process an __atomic_load function call, determine whether it
9388 needs to be mapped to the _N variation, or turned into a library call.
9389 LOC is the location of the builtin call.
9390 FUNCTION is the DECL that has been invoked;
9391 PARAMS is the argument list for the call. The return value is non-null
9392 TRUE is returned if it is translated into the proper format for a call to the
9393 external library, and NEW_RETURN is set the tree for that function.
9394 FALSE is returned if processing for the _N variation is required, and
9395 NEW_RETURN is set to the the return value the result is copied into. */
9397 static bool
9400 {
9405 /* If not a lock-free size, change to the library generic format. */
9407 {
9410 }
9412 /* Otherwise, there is a match, so the call needs to be transformed from:
9413 void fn(T* mem, T* return, model)
9414 into
9415 *return = (T) (fn ((In *) mem, model)) */
9421 /* Create pointer to appropriate size. */
9425 /* Convert object pointer to required type. */
9429 /* Move memory model to the 2nd position, and end param list. */
9433 /* Convert return pointer and dereference it for later assignment. */
9437 }
9440 /* This will process an __atomic_store function call, determine whether it
9441 needs to be mapped to the _N variation, or turned into a library call.
9442 LOC is the location of the builtin call.
9443 FUNCTION is the DECL that has been invoked;
9444 PARAMS is the argument list for the call. The return value is non-null
9445 TRUE is returned if it is translated into the proper format for a call to the
9446 external library, and NEW_RETURN is set the tree for that function.
9447 FALSE is returned if processing for the _N variation is required, and
9448 NEW_RETURN is set to the the return value the result is copied into. */
9450 static bool
9453 {
9458 /* If not a lock-free size, change to the library generic format. */
9460 {
9463 }
9465 /* Otherwise, there is a match, so the call needs to be transformed from:
9466 void fn(T* mem, T* value, model)
9467 into
9468 fn ((In *) mem, (In) *value, model) */
9473 /* Create pointer to appropriate size. */
9477 /* Convert object pointer to required type. */
9481 /* Convert new value to required type, and dereference it. */
9486 /* The memory model is in the right spot already. Return is void. */
9490 }
9493 /* Some builtin functions are placeholders for other expressions. This
9494 function should be called immediately after parsing the call expression
9495 before surrounding code has committed to the type of the expression.
9497 LOC is the location of the builtin call.
9499 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
9500 PARAMS is the argument list for the call. The return value is non-null
9501 when expansion is complete, and null if normal processing should
9502 continue. */
9504 tree
9506 {
9512 {
9518 else
9522 }
9524 /* Handle BUILT_IN_NORMAL here. */
9526 {
9531 {
9532 /* Handle these 4 together so that they can fall through to the next
9533 case if the call is transformed to an _N variant. */
9535 {
9537 {
9541 /* Change to the _N variant. */
9544 }
9547 {
9549 params,
9552 /* Change to the _N variant. */
9555 }
9557 {
9561 /* Change to the _N variant. */
9564 }
9566 {
9570 /* Change to the _N variant. */
9573 }
9576 }
9577 /* Fallthrough to the normal processing. */
9578 }
9595 {
9597 /* Fallthru for parameter processing. */
9598 }
9615 {
9626 orig_format))
9638 /* If new_return is set, assign function to that expr and cast the
9639 result to void since the generic interface returned void. */
9641 {
9642 /* Cast function result from I{1,2,4,8,16} to the required type. */
9645 result);
9649 }
9651 }
9655 }
9656 }
9658 /* Ignoring their sign, return true if two scalar types are the same. */
9659 bool
9661 {
9668 /* Equality works here because c_common_signed_type uses
9669 TYPE_MAIN_VARIANT. */
9672 }
9674 /* Check for missing format attributes on function pointers. LTYPE is
9675 the new type or left-hand side type. RTYPE is the old type or
9676 right-hand side type. Returns TRUE if LTYPE is missing the desired
9677 attribute. */
9679 bool
9681 {
9683 tree ra;
9689 {
9690 tree la;
9695 }
9696 else
9698 }
9700 /* Subscripting with type char is likely to lose on a machine where
9701 chars are signed. So warn on any machine, but optionally. Don't
9702 warn for unsigned char since that type is safe. Don't warn for
9703 signed char because anyone who uses that must have done so
9704 deliberately. Furthermore, we reduce the false positive load by
9705 warning only for non-constant value of type char. */
9707 void
9709 {
9713 }
9715 /* Implement -Wparentheses for the unexpected C precedence rules, to
9716 cover cases like x + y << z which readers are likely to
9717 misinterpret. We have seen an expression in which CODE is a binary
9718 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
9719 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
9720 CODE_RIGHT may be ERROR_MARK, which means that that side of the
9721 expression was not formed using a binary or unary operator, or it
9722 was enclosed in parentheses. */
9724 void
9728 {
9732 /* This macro tests that the expression ARG with original tree code
9733 CODE appears to be a boolean expression. or the result of folding a
9734 boolean expression. */
9735 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
9736 (truth_value_p (TREE_CODE (ARG)) \
9737 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
9739 || ((CODE) != INTEGER_CST \
9740 && (integer_onep (ARG) || integer_zerop (ARG))))
9743 {
9775 /* Check cases like x|y==z */
9780 /* Check cases like !x | y */
9794 /* Check cases like x^y==z */
9808 /* Check cases like x&y==z */
9813 /* Check cases like !x & y */
9844 }
9845 #undef NOT_A_BOOLEAN_EXPR_P
9846 }
9848 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9850 void
9852 {
9854 {
9857 else
9859 }
9860 }
9862 /* Warn for division by zero according to the value of DIVISOR. LOC
9863 is the location of the division operator. */
9865 void
9867 {
9868 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9869 about division by zero. Do not issue a warning if DIVISOR has a
9870 floating-point type, since we consider 0.0/0.0 a valid way of
9871 generating a NaN. */
9875 }
9877 /* Subroutine of build_binary_op. Give warnings for comparisons
9878 between signed and unsigned quantities that may fail. Do the
9879 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9880 so that casts will be considered, but default promotions won't
9881 be.
9883 LOCATION is the location of the comparison operator.
9885 The arguments of this function map directly to local variables
9886 of build_binary_op. */
9888 void
9893 {
9898 /* In C++, check for comparison of different enum types. */
9904 {
9908 }
9910 /* Do not warn if the comparison is being done in a signed type,
9911 since the signed type will only be chosen if it can represent
9912 all the values of the unsigned type. */
9915 /* Do not warn if both operands are unsigned. */
9918 else
9919 {
9925 else
9933 /* Do not warn if the signed quantity is an unsuffixed integer
9934 literal (or some static constant expression involving such
9935 literals or a conditional expression involving such literals)
9936 and it is non-negative. */
9939 /* Do not warn if the comparison is an equality operation, the
9940 unsigned quantity is an integral constant, and it would fit
9941 in the result if the result were signed. */
9946 /* In C, do not warn if the unsigned quantity is an enumeration
9947 constant and its maximum value would fit in the result if the
9948 result were signed. */
9954 else
9956 OPT_Wsign_compare,
9958 }
9960 /* Warn if two unsigned values are being compared in a size larger
9961 than their original size, and one (and only one) is the result of
9962 a `~' operator. This comparison will always fail.
9964 Also warn if one operand is a constant, and the constant does not
9965 have all bits set that are set in the ~ operand when it is
9966 extended. */
9973 {
9980 {
9981 tree primop;
9987 {
9991 }
9992 else
9993 {
9997 }
10002 {
10005 {
10009 else
10012 }
10013 }
10014 }
10022 }
10023 }
10025 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
10026 type via c_common_type. If -Wdouble-promotion is in use, and the
10027 conditions for warning have been met, issue a warning. GMSGID is
10028 the warning message. It must have two %T specifiers for the type
10029 that was converted (generally "float") and the type to which it was
10030 converted (generally "double), respectively. LOC is the location
10031 to which the awrning should refer. */
10033 void
10036 {
10037 tree source_type;
10041 /* If the conversion will not occur at run-time, there is no need to
10042 warn about it. */
10054 else
10057 }
10059 /* Setup a TYPE_DECL node as a typedef representation.
10061 X is a TYPE_DECL for a typedef statement. Create a brand new
10062 ..._TYPE node (which will be just a variant of the existing
10063 ..._TYPE node with identical properties) and then install X
10064 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
10066 The whole point here is to end up with a situation where each
10067 and every ..._TYPE node the compiler creates will be uniquely
10068 associated with AT MOST one node representing a typedef name.
10069 This way, even though the compiler substitutes corresponding
10070 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
10071 early on, later parts of the compiler can always do the reverse
10072 translation and get back the corresponding typedef name. For
10073 example, given:
10075 typedef struct S MY_TYPE;
10076 MY_TYPE object;
10078 Later parts of the compiler might only know that `object' was of
10079 type `struct S' if it were not for code just below. With this
10080 code however, later parts of the compiler see something like:
10082 struct S' == struct S
10083 typedef struct S' MY_TYPE;
10084 struct S' object;
10086 And they can then deduce (from the node for type struct S') that
10087 the original object declaration was:
10089 MY_TYPE object;
10091 Being able to do this is important for proper support of protoize,
10092 and also for generating precise symbolic debugging information
10093 which takes full account of the programmer's (typedef) vocabulary.
10095 Obviously, we don't want to generate a duplicate ..._TYPE node if
10096 the TYPE_DECL node that we are now processing really represents a
10097 standard built-in type. */
10099 void
10101 {
10105 {
10108 }
10111 {
10119 }
10120 }
10122 /* Record the types used by the current global variable declaration
10123 being parsed, so that we can decide later to emit their debug info.
10124 Those types are in types_used_by_cur_var_decl, and we are going to
10125 store them in the types_used_by_vars_hash hash table.
10126 DECL is the declaration of the global variable that has been parsed. */
10128 void
10130 {
10134 {
10137 }
10138 }
10140 /* If DECL is a typedef that is declared in the current function,
10141 record it for the purpose of -Wunused-local-typedefs. */
10143 void
10145 {
10150 /* if this is not a locally defined typedef then we are not
10151 interested. */
10158 }
10160 /* If T is a TYPE_DECL declared locally, mark it as used. */
10162 void
10164 {
10169 }
10171 /* Warn if there are some unused locally defined typedefs in the
10172 current function. */
10174 void
10176 {
10178 tree decl;
10179 /* The number of times we have emitted -Wunused-local-typedefs
10180 warnings. If this is different from errorcount, that means some
10181 unrelated errors have been issued. In which case, we'll avoid
10182 emitting "unused-local-typedefs" warnings. */
10194 {
10198 OPT_Wunused_local_typedefs,
10201 }
10204 {
10207 }
10208 }
10210 /* The C and C++ parsers both use vectors to hold function arguments.
10211 For efficiency, we keep a cache of unused vectors. This is the
10212 cache. */
10219 /* Return a new vector from the cache. If the cache is empty,
10220 allocate a new vector. These vectors are GC'ed, so it is OK if the
10221 pointer is not released.. */
10225 {
10228 else
10229 {
10230 /* Passing 0 to VEC_alloc returns NULL, and our callers require
10231 that we always return a non-NULL value. The vector code uses
10232 4 when growing a NULL vector, so we do too. */
10234 }
10235 }
10237 /* Release a vector of trees back to the cache. */
10239 void
10241 {
10243 {
10246 }
10247 }
10249 /* Get a new tree vector holding a single tree. */
10253 {
10257 }
10259 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
10263 {
10268 }
10270 /* Get a new tree vector which is a copy of an existing one. */
10274 {
10277 tree t;
10284 }
10286 /* Return true if KEYWORD starts a type specifier. */
10288 bool
10290 {
10292 {
10322 }
10323 }
10325 /* Return true if KEYWORD names a type qualifier. */
10327 bool
10329 {
10331 {
10338 }
10339 }
10341 /* Return true if KEYWORD names a storage class specifier.
10343 RID_TYPEDEF is not included in this list despite `typedef' being
10344 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
10345 such for syntactic convenience only. */
10347 bool
10349 {
10351 {
10361 }
10362 }
10364 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
10366 static bool
10368 {
10370 {
10378 }
10379 }
10381 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
10382 declaration-specifier (C99 6.7). */
10384 bool
10386 {
10393 {
10400 }
10401 }
10403 /* Initialize language-specific-bits of tree_contains_struct. */
10405 void
10407 {
10410 }
10412 /* Build a user-defined numeric literal out of an integer constant type VALUE
10413 with identifier SUFFIX. */
10415 tree
10417 {
10423 }