| blob | 82a2b8d6cd22b19f130a329c2bbeb48abe81430e |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
53 /* The following symbols are subsumed in the c_global_trees array, and
54 listed here individually for documentation purposes.
56 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
58 tree short_integer_type_node;
59 tree long_integer_type_node;
60 tree long_long_integer_type_node;
61 tree int128_integer_type_node;
63 tree short_unsigned_type_node;
64 tree long_unsigned_type_node;
65 tree long_long_unsigned_type_node;
66 tree int128_unsigned_type_node;
68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
72 tree ptrdiff_type_node;
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
76 tree wchar_type_node;
78 tree char16_type_node;
79 tree char32_type_node;
81 tree float_type_node;
82 tree double_type_node;
83 tree long_double_type_node;
85 tree complex_integer_type_node;
86 tree complex_float_type_node;
87 tree complex_double_type_node;
88 tree complex_long_double_type_node;
90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
94 tree intQI_type_node;
95 tree intHI_type_node;
96 tree intSI_type_node;
97 tree intDI_type_node;
98 tree intTI_type_node;
100 tree unsigned_intQI_type_node;
101 tree unsigned_intHI_type_node;
102 tree unsigned_intSI_type_node;
103 tree unsigned_intDI_type_node;
104 tree unsigned_intTI_type_node;
106 tree widest_integer_literal_type_node;
107 tree widest_unsigned_literal_type_node;
109 Nodes for types `void *' and `const void *'.
111 tree ptr_type_node, const_ptr_type_node;
113 Nodes for types `char *' and `const char *'.
115 tree string_type_node, const_string_type_node;
117 Type `char[SOMENUMBER]'.
118 Used when an array of char is needed and the size is irrelevant.
120 tree char_array_type_node;
122 Type `int[SOMENUMBER]' or something like it.
123 Used when an array of int needed and the size is irrelevant.
125 tree int_array_type_node;
127 Type `wchar_t[SOMENUMBER]' or something like it.
128 Used when a wide string literal is created.
130 tree wchar_array_type_node;
132 Type `char16_t[SOMENUMBER]' or something like it.
133 Used when a UTF-16 string literal is created.
135 tree char16_array_type_node;
137 Type `char32_t[SOMENUMBER]' or something like it.
138 Used when a UTF-32 string literal is created.
140 tree char32_array_type_node;
142 Type `int ()' -- used for implicit declaration of functions.
144 tree default_function_type;
146 A VOID_TYPE node, packaged in a TREE_LIST.
148 tree void_list_node;
150 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
151 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
152 VAR_DECLS, but C++ does.)
154 tree function_name_decl_node;
155 tree pretty_function_name_decl_node;
156 tree c99_function_name_decl_node;
158 Stack of nested function name VAR_DECLs.
160 tree saved_function_name_decls;
162 */
165 \f
166 /* Switches common to the C front ends. */
168 /* Nonzero means don't output line number information. */
172 /* Nonzero causes -E output not to be done, but directives such as
173 #define that have side effects are still obeyed. */
177 /* Nonzero means dump macros in some fashion. */
181 /* Nonzero means pass #include lines through to the output. */
185 /* Nonzero means process PCH files while preprocessing. */
189 /* The file name to which we should write a precompiled header, or
190 NULL if no header will be written in this compile. */
194 /* Nonzero if an ISO standard was selected. It rejects macros in the
195 user's namespace. */
198 /* Warn about #pragma directives that are not recognized. */
202 /* Warn about format/argument anomalies in calls to formatted I/O functions
203 (*printf, *scanf, strftime, strfmon, etc.). */
207 /* C/ObjC language option variables. */
210 /* Nonzero means allow type mismatches in conditional expressions;
211 just make their values `void'. */
215 /* Nonzero means enable C89 Amendment 1 features. */
219 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
223 /* Nonzero means use the ISO C11 dialect of C. */
227 /* Nonzero means that we have builtin functions, and main is an int. */
232 /* ObjC language option variables. */
235 /* Tells the compiler that this is a special run. Do not perform any
236 compiling, instead we are to test some platform dependent features
237 and output a C header file with appropriate definitions. */
241 /* Tells the compiler what is the constant string class for ObjC. */
246 /* C++ language option variables. */
249 /* Nonzero means generate separate instantiation control files and
250 juggle them at link time. */
254 /* The C++ dialect being used. C++98 is the default. */
258 /* Maximum template instantiation depth. This limit exists to limit the
259 time it takes to notice excessively recursive template instantiations.
261 The default is lower than the 1024 recommended by the C++0x standard
262 because G++ runs out of stack before 1024 with highly recursive template
263 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
267 /* The elements of `ridpointers' are identifier nodes for the reserved
268 type names and storage classes. It is indexed by a RID_... value. */
273 /* Nonzero means don't warn about problems that occur when the code is
274 executed. */
277 /* Whether we are building a boolean conversion inside
278 convert_for_assignment, or some other late binary operation. If
279 build_binary_op is called for C (from code shared by C and C++) in
280 this case, then the operands have already been folded and the
281 result will not be folded again, so C_MAYBE_CONST_EXPR should not
282 be generated. */
285 /* Whether lexing has been completed, so subsequent preprocessor
286 errors should use the compiler's input_location. */
289 /* Information about how a function name is generated. */
290 struct fname_var_t
291 {
295 };
297 /* The three ways of getting then name of the current function. */
300 {
301 /* C99 compliant __func__, must be first. */
303 /* GCC __FUNCTION__ compliant. */
305 /* GCC __PRETTY_FUNCTION__ compliant. */
308 };
310 /* Global visibility options. */
387 /* Reserved words. The third field is a mask: keywords are disabled
388 if they match the mask.
390 Masks for languages:
391 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
392 C --std=c99: D_CXXONLY | D_OBJC
393 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
394 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
395 C++ --std=c0x: D_CONLY | D_OBJC
396 ObjC++ is like C++ except that D_OBJC is not set
398 If -fno-asm is used, D_ASM is added to the mask. If
399 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
400 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
401 In C with -Wc++-compat, we warn if D_CXXWARN is set.
403 Note the complication of the D_CXX_OBJC keywords. These are
404 reserved words such as 'class'. In C++, 'class' is a reserved
405 word. In Objective-C++ it is too. In Objective-C, it is a
406 reserved word too, but only if it follows an '@' sign.
407 */
409 {
562 /* These Objective-C keywords are recognized only immediately after
563 an '@'. */
580 /* These are recognized only in protocol-qualifier context
581 (see above) */
588 /* These are recognized inside a property attribute list */
597 };
602 /* Table of machine-independent attributes common to all C-like languages. */
604 {
605 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
606 affects_type_identity } */
613 /* FIXME: logically, noreturn attributes should be listed as
614 "false, true, true" and apply to function types. But implementing this
615 would require all the places in the compiler that use TREE_THIS_VOLATILE
616 on a decl to identify non-returning functions to be located and fixed
617 to check the function type instead. */
642 /* The same comments as for noreturn attributes apply to const ones. */
666 handle_no_instrument_function_attribute,
684 /* ??? These two attributes didn't make the transition from the
685 Intel language document to the multi-vendor language document. */
690 /* For internal use (marking of builtins) only. The name contains space
691 to prevent its usage in source code. */
713 /* For internal use (marking of builtins) only. The name contains space
714 to prevent its usage in source code. */
731 /* For internal use only. The leading '*' both prevents its usage in
732 source code and signals that it may be overridden by machine tables. */
737 /* For internal use (marking of builtins and runtime functions) only.
738 The name contains space to prevent its usage in source code. */
742 };
744 /* Give the specifications for the format attributes, used by C and all
745 descendants. */
748 {
749 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
750 affects_type_identity } */
756 };
758 /* Return identifier for address space AS. */
762 {
766 }
768 /* Push current bindings for the function name VAR_DECLS. */
770 void
772 {
777 {
781 {
783 saved);
785 }
786 }
788 /* Normally they'll have been NULL, so only push if we've got a
789 stack, or they are non-NULL. */
791 saved_function_name_decls);
792 }
794 /* Finish up the current bindings, adding them into the current function's
795 statement tree. This must be done _before_ finish_stmt_tree is called.
796 If there is no current function, we must be at file scope and no statements
797 are involved. Pop the previous bindings. */
799 void
801 {
810 {
818 }
824 {
825 /* We had saved values, restore them. */
826 tree saved;
829 {
834 }
836 }
838 }
840 /* Return the text name of the current function, suitably prettified
841 by PRETTY_P. Return string must be freed by caller. */
845 {
852 {
855 }
868 {
871 }
874 }
876 /* Return the VAR_DECL for a const char array naming the current
877 function. If the VAR_DECL has not yet been created, create it
878 now. RID indicates how it should be formatted and IDENTIFIER_NODE
879 ID is its name (unfortunately C and C++ hold the RID values of
880 keywords in different places, so we can't derive RID from ID in
881 this language independent code. LOC is the location of the
882 function. */
884 tree
886 {
896 {
897 /* If a tree is built here, it would normally have the lineno of
898 the current statement. Later this tree will be moved to the
899 beginning of the function and this line number will be wrong.
900 To avoid this problem set the lineno to 0 here; that prevents
901 it from appearing in the RTL. */
902 tree stmts;
910 saved_function_name_decls
914 }
919 }
921 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
923 tree
925 {
930 /* Compute the number of elements, for the array type. */
932 {
935 }
937 {
940 }
942 {
945 }
946 else
947 {
950 }
952 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
953 limit in C++98 Annex B is very large (65536) and is not normative,
954 so we do not diagnose it (warn_overlength_strings is forced off
955 in c_common_post_options). */
957 {
961 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
962 separate the %d from the 'C'. 'ISO' should not be
963 translated, but it may be moved after 'C%d' in languages
964 where modifiers follow nouns. */
966 "string length %qd is greater than the length %qd "
969 }
971 /* Create the array type for the string constant. The ISO C++
972 standard says that a string literal has type `const char[N]' or
973 `const wchar_t[N]'. We use the same logic when invoked as a C
974 front-end with -Wwrite-strings.
975 ??? We should change the type of an expression depending on the
976 state of a warning flag. We should just be warning -- see how
977 this is handled in the C++ front-end for the deprecated implicit
978 conversion from string literals to `char*' or `wchar_t*'.
980 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
981 array type being the unqualified version of that type.
982 Therefore, if we are constructing an array of const char, we must
983 construct the matching unqualified array type first. The C front
984 end does not require this, but it does no harm, so we do it
985 unconditionally. */
996 }
997 \f
998 /* If DISABLE is true, stop issuing warnings. This is used when
999 parsing code that we know will not be executed. This function may
1000 be called multiple times, and works as a stack. */
1002 static void
1004 {
1006 {
1009 }
1010 }
1012 /* If ENABLE is true, reenable issuing warnings. */
1014 static void
1016 {
1018 {
1021 }
1022 }
1024 /* Fully fold EXPR, an expression that was not folded (beyond integer
1025 constant expressions and null pointer constants) when being built
1026 up. If IN_INIT, this is in a static initializer and certain
1027 changes are made to the folding done. Clear *MAYBE_CONST if
1028 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1029 expression because it contains an evaluated operator (in C99) or an
1030 operator outside of sizeof returning an integer constant (in C90)
1031 not permitted in constant expressions, or because it contains an
1032 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1033 set to true by callers before calling this function.) Return the
1034 folded expression. Function arguments have already been folded
1035 before calling this function, as have the contents of SAVE_EXPR,
1036 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1037 C_MAYBE_CONST_EXPR. */
1039 tree
1041 {
1042 tree ret;
1048 /* This function is not relevant to C++ because C++ folds while
1049 parsing, and may need changes to be correct for C++ when C++
1050 stops folding while parsing. */
1057 {
1060 }
1067 }
1069 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1070 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1071 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1072 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1073 both evaluated and unevaluated subexpressions while
1074 *MAYBE_CONST_ITSELF is carried from only evaluated
1075 subexpressions). */
1077 static tree
1080 {
1092 /* This function is not relevant to C++ because C++ folds while
1093 parsing, and may need changes to be correct for C++ when C++
1094 stops folding while parsing. */
1098 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1099 anything else not counted as an expression cannot usefully be
1100 folded further at this point. */
1106 /* Operands of variable-length expressions (function calls) have
1107 already been folded, as have __builtin_* function calls, and such
1108 expressions cannot occur in constant expressions. */
1110 {
1114 }
1117 {
1126 else
1129 }
1131 /* Assignment, increment, decrement, function call and comma
1132 operators, and statement expressions, cannot occur in constant
1133 expressions if evaluated / outside of sizeof. (Function calls
1134 were handled above, though VA_ARG_EXPR is treated like a function
1135 call here, and statement expressions are handled through
1136 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1138 {
1158 }
1160 /* Fold individual tree codes as appropriate. */
1162 {
1164 /* Any non-constancy will have been marked in a containing
1165 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1173 maybe_const_itself);
1178 {
1181 }
1190 maybe_const_itself);
1193 maybe_const_itself);
1199 {
1203 }
1245 /* Binary operations evaluating both arguments (increment and
1246 decrement are binary internally in GCC). */
1250 maybe_const_itself);
1258 /* The RHS of a MODIFY_EXPR was fully folded when building that
1259 expression for the sake of conversion warnings. */
1262 maybe_const_itself);
1266 ret = in_init
1269 else
1280 CASE_CONVERT:
1290 /* Unary operations. */
1293 maybe_const_itself);
1297 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1298 not prepared to deal with them if they occur in initializers. */
1306 ret = in_init
1309 else
1314 {
1318 }
1320 {
1323 CASE_CONVERT:
1324 /* Don't warn about explicit conversions. We will already
1325 have warned about suspect implicit conversions. */
1332 }
1337 /* Binary operations not necessarily evaluating both
1338 arguments. */
1345 ? truthvalue_false_node
1353 ret = in_init
1356 else
1361 && op0_const
1362 && op0_const_self
1368 && op0_const_self
1394 else
1399 && op0_const
1400 && op0_const_self
1404 && op0_const_self
1408 && op0_const
1409 && op0_const_self
1413 && op0_const_self
1419 /* Each case where an operand with excess precision may be
1420 encountered must remove the EXCESS_PRECISION_EXPR around
1421 inner operands and possibly put one around the whole
1422 expression or possibly convert to the semantic type (which
1423 c_fully_fold does); we cannot tell at this stage which is
1424 appropriate in any particular case. */
1428 /* Various codes may appear through folding built-in functions
1429 and their arguments. */
1431 }
1433 out:
1434 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1435 have been done by this point, so remove them again. */
1439 {
1443 }
1447 }
1449 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1450 return EXP. Otherwise, return either EXP or its known constant
1451 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1452 Is the BLKmode test appropriate? */
1454 tree
1456 {
1457 tree ret;
1459 /* This function is only used by C, for c_fully_fold and other
1460 optimization, and may not be correct for C++. */
1471 /* Avoid unwanted tree sharing between the initializer and current
1472 function's body where the tree can be modified e.g. by the
1473 gimplifier. */
1477 }
1479 /* Print a warning if a constant expression had overflow in folding.
1480 Invoke this function on every expression that the language
1481 requires to be a constant expression.
1482 Note the ANSI C standard says it is erroneous for a
1483 constant expression to overflow. */
1485 void
1487 {
1495 }
1497 /* The same as above but print an unconditional error. */
1498 void
1500 {
1507 }
1509 /* Print a warning if an expression had overflow in folding and its
1510 operands hadn't.
1512 Invoke this function on every expression that
1513 (1) appears in the source code, and
1514 (2) is a constant expression that overflowed, and
1515 (3) is not already checked by convert_and_check;
1516 however, do not invoke this function on operands of explicit casts
1517 or when the expression is the result of an operator and any operand
1518 already overflowed. */
1520 void
1522 {
1527 {
1556 }
1557 }
1559 /* Warn about uses of logical || / && operator in a context where it
1560 is likely that the bitwise equivalent was intended by the
1561 programmer. We have seen an expression in which CODE is a binary
1562 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1563 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1564 void
1568 {
1580 /* Warn if &&/|| are being used in a context where it is
1581 likely that the bitwise equivalent was intended by the
1582 programmer. That is, an expression such as op && MASK
1583 where op should not be any boolean expression, nor a
1584 constant, and mask seems to be a non-boolean integer constant. */
1592 {
1596 else
1601 }
1603 /* We do not warn for constants because they are typical of macro
1604 expansions that test for features. */
1608 /* This warning only makes sense with logical operands. */
1624 /* If this is an OR operation, invert both sides; we will invert
1625 again at the end. */
1629 /* If both expressions are the same, if we can merge the ranges, and we
1630 can build the range test, return it or it inverted. */
1636 {
1642 "logical %<or%> "
1644 else
1646 "logical %<and%> "
1648 }
1649 }
1652 /* Print a warning about casts that might indicate violation
1653 of strict aliasing rules if -Wstrict-aliasing is used and
1654 strict aliasing mode is in effect. OTYPE is the original
1655 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1657 bool
1659 {
1660 /* Strip pointer conversion chains and get to the correct original type. */
1668 /* If the type we are casting to is a ref-all pointer
1669 dereferencing it is always valid. */
1676 {
1677 /* Casting the address of an object to non void pointer. Warn
1678 if the cast breaks type based aliasing. */
1680 {
1684 }
1685 else
1686 {
1687 /* warn_strict_aliasing >= 3. This includes the default (3).
1688 Only warn if the cast is dereferenced immediately. */
1689 alias_set_type set1 =
1695 {
1699 }
1702 {
1706 }
1707 }
1708 }
1709 else
1711 {
1712 /* At this level, warn for any conversions, even if an address is
1713 not taken in the same statement. This will likely produce many
1714 false positives, but could be useful to pinpoint problems that
1715 are not revealed at higher levels. */
1720 {
1724 }
1725 }
1728 }
1730 /* Warn for unlikely, improbable, or stupid DECL declarations
1731 of `main'. */
1733 void
1735 {
1736 function_args_iterator iter;
1737 tree type;
1741 {
1742 /* XXX void_type_node belies the abstraction. */
1748 {
1770 "third argument of %q+D should probably be "
1773 }
1774 }
1776 /* It is intentional that this message does not mention the third
1777 argument because it's only mentioned in an appendix of the
1778 standard. */
1782 }
1784 /* True if pointers to distinct types T1 and T2 can be converted to
1785 each other without an explicit cast. Only returns true for opaque
1786 vector types. */
1787 bool
1789 {
1796 }
1798 /* True if vector types T1 and T2 can be converted to each other
1799 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1800 can only be converted with -flax-vector-conversions yet that is not
1801 in effect, emit a note telling the user about that option if such
1802 a note has not previously been emitted. */
1803 bool
1805 {
1813 convertible_lax =
1828 {
1831 "conversions between vectors with differing "
1833 }
1836 }
1838 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1839 to integral type. */
1841 static tree
1843 {
1848 {
1849 /* C++0x scoped enumerations don't implicitly convert to integral
1850 type; if we stripped an explicit conversion to a larger type we
1851 need to replace it so common_type will still work. */
1856 }
1858 }
1860 /* This is a helper function of build_binary_op.
1862 For certain operations if both args were extended from the same
1863 smaller type, do the arithmetic in that type and then extend.
1865 BITWISE indicates a bitwise operation.
1866 For them, this optimization is safe only if
1867 both args are zero-extended or both are sign-extended.
1868 Otherwise, we might change the result.
1869 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1870 but calculated in (unsigned short) it would be (unsigned short)-1.
1871 */
1872 tree
1874 {
1878 tree type;
1880 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1881 excessive narrowing when we call get_narrower below. For
1882 example, suppose that OP0 is of unsigned int extended
1883 from signed char and that RESULT_TYPE is long long int.
1884 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1885 like
1887 (long long int) (unsigned int) signed_char
1889 which get_narrower would narrow down to
1891 (unsigned int) signed char
1893 If we do not cast OP0 first, get_narrower would return
1894 signed_char, which is inconsistent with the case of the
1895 explicit cast. */
1902 /* UNS is 1 if the operation to be done is an unsigned one. */
1905 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1906 but it *requires* conversion to FINAL_TYPE. */
1917 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1919 /* For bitwise operations, signedness of nominal type
1920 does not matter. Consider only how operands were extended. */
1924 /* Note that in all three cases below we refrain from optimizing
1925 an unsigned operation on sign-extended args.
1926 That would not be valid. */
1928 /* Both args variable: if both extended in same way
1929 from same width, do it in that width.
1930 Do it unsigned if args were zero-extended. */
1937 return c_common_signed_or_unsigned_type
1944 && (type
1955 && (type
1963 }
1965 /* Checks if expression EXPR of real/integer type cannot be converted
1966 to the real/integer type TYPE. Function returns true when:
1967 * EXPR is a constant which cannot be exactly converted to TYPE
1968 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1969 for EXPR type and TYPE being both integers or both real.
1970 * EXPR is not a constant of real type and TYPE is an integer.
1971 * EXPR is not a constant of integer type which cannot be
1972 exactly converted to real type.
1973 Function allows conversions between types of different signedness and
1974 does not return true in that case. Function can produce signedness
1975 warnings if PRODUCE_WARNS is true. */
1976 bool
1978 {
1984 {
1985 /* Warn for real constant that is not an exact integer converted
1986 to integer type. */
1989 {
1992 }
1993 /* Warn for an integer constant that does not fit into integer type. */
1997 {
2000 {
2004 }
2006 {
2010 }
2011 else
2013 }
2015 {
2016 /* Warn for an integer constant that does not fit into real type. */
2018 {
2022 }
2023 /* Warn for a real constant that does not fit into a smaller
2024 real type. */
2027 {
2031 }
2032 }
2033 }
2034 else
2035 {
2036 /* Warn for real types converted to integer types. */
2043 {
2044 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2048 /* Don't warn for short y; short x = ((int)y & 0xff); */
2052 {
2053 /* If both args were extended from a shortest type,
2054 use that type if that is safe. */
2061 {
2067 /* If one of the operands is a non-negative constant
2068 that fits in the target type, then the type of the
2069 other operand does not matter. */
2078 /* If constant is unsigned and fits in the target
2079 type, then the result will also fit. */
2081 && unsigned0
2084 && unsigned1
2087 }
2088 }
2089 /* Warn for integer types converted to smaller integer types. */
2093 /* When they are the same width but different signedness,
2094 then the value may change. */
2097 /* Even when converted to a bigger type, if the type is
2098 unsigned but expr is signed, then negative values
2099 will be changed. */
2105 }
2107 /* Warn for integer types converted to real types if and only if
2108 all the range of values of the integer type cannot be
2109 represented by the real type. */
2112 {
2116 /* Don't warn about char y = 0xff; float x = (int) y; */
2128 }
2130 /* Warn for real types converted to smaller real types. */
2135 }
2138 }
2140 /* Warns if the conversion of EXPR to TYPE may alter a value.
2141 This is a helper function for warnings_for_convert_and_check. */
2143 static void
2145 {
2153 {
2166 /* Conversion from boolean to a signed:1 bit-field (which only
2167 can hold the values 0 and -1) doesn't lose information - but
2168 it does change the value. */
2183 {
2184 /* In case of COND_EXPR, if both operands are constants or
2185 COND_EXPR, then we do not care about the type of COND_EXPR,
2186 only about the conversion of each operand. */
2194 {
2198 }
2199 /* Fall through. */
2200 }
2207 }
2208 }
2210 /* Produce warnings after a conversion. RESULT is the result of
2211 converting EXPR to TYPE. This is a helper function for
2212 convert_and_check and cp_convert_and_check. */
2214 void
2216 {
2221 {
2222 /* Do not diagnose overflow in a constant expression merely
2223 because a conversion overflowed. */
2228 {
2229 /* This detects cases like converting -129 or 256 to
2230 unsigned char. */
2234 else
2236 }
2240 /* No warning for converting 0x80000000 to int. */
2248 else
2250 }
2255 else
2257 }
2260 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2261 Invoke this function on every expression that is converted implicitly,
2262 i.e. because of language rules and not because of an explicit cast. */
2264 tree
2266 {
2267 tree result;
2268 tree expr_for_warning;
2270 /* Convert from a value with possible excess precision rather than
2271 via the semantic type, but do not warn about values not fitting
2272 exactly in the semantic type. */
2274 {
2280 }
2281 else
2295 }
2296 \f
2297 /* A node in a list that describes references to variables (EXPR), which are
2298 either read accesses if WRITER is zero, or write accesses, in which case
2299 WRITER is the parent of EXPR. */
2300 struct tlist
2301 {
2304 };
2306 /* Used to implement a cache the results of a call to verify_tree. We only
2307 use this for SAVE_EXPRs. */
2308 struct tlist_cache
2309 {
2313 tree expr;
2314 };
2316 /* Obstack to use when allocating tlist structures, and corresponding
2317 firstobj. */
2321 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2322 warnings. */
2324 /* SAVE_EXPRs need special treatment. We process them only once and then
2325 cache the results. */
2337 /* Create a new struct tlist and fill in its fields. */
2340 {
2347 }
2349 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2350 is nonnull, we ignore any node we find which has a writer equal to it. */
2352 static void
2354 {
2356 {
2363 }
2364 }
2366 /* Merge the nodes of ADD into TO. This merging process is done so that for
2367 each variable that already exists in TO, no new node is added; however if
2368 there is a write access recorded in ADD, and an occurrence on TO is only
2369 a read access, then the occurrence in TO will be modified to record the
2370 write. */
2372 static void
2374 {
2381 {
2388 {
2392 }
2394 {
2398 }
2400 }
2401 }
2403 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2404 references in list LIST conflict with it, excluding reads if ONLY writers
2405 is nonzero. */
2407 static void
2410 {
2413 /* Avoid duplicate warnings. */
2419 {
2423 {
2428 }
2430 }
2431 }
2433 /* Given a list LIST of references to variables, find whether any of these
2434 can cause conflicts due to missing sequence points. */
2436 static void
2438 {
2442 {
2445 }
2446 }
2448 /* Return nonzero if X is a tree that can be verified by the sequence point
2449 warnings. */
2450 static int
2452 {
2459 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2460 (lvalue_p) crash on TRY/CATCH. */
2467 /* No point to track non-const calls, they will never satisfy
2468 operand_equal_p. */
2476 }
2478 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2479 static bool
2481 {
2483 }
2485 /* Walk the tree X, and record accesses to variables. If X is written by the
2486 parent tree, WRITER is the parent.
2487 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2488 expression or its only operand forces a sequence point, then everything up
2489 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2490 in PNO_SP.
2491 Once we return, we will have emitted warnings if any subexpression before
2492 such a sequence point could be undefined. On a higher level, however, the
2493 sequence point may not be relevant, and we'll merge the two lists.
2495 Example: (b++, a) + b;
2496 The call that processes the COMPOUND_EXPR will store the increment of B
2497 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2498 processes the PLUS_EXPR will need to merge the two lists so that
2499 eventually, all accesses end up on the same list (and we'll warn about the
2500 unordered subexpressions b++ and b.
2502 A note on merging. If we modify the former example so that our expression
2503 becomes
2504 (b++, b) + a
2505 care must be taken not simply to add all three expressions into the final
2506 PNO_SP list. The function merge_tlist takes care of that by merging the
2507 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2508 way, so that no more than one access to B is recorded. */
2510 static void
2512 tree writer)
2513 {
2518 /* X may be NULL if it is the operand of an empty statement expression
2519 ({ }). */
2523 restart:
2531 {
2563 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2564 two first, to avoid warning for (a ? b++ : b++). */
2580 /* Expressions inside the LHS are not ordered wrt. the sequence points
2581 in the RHS. Example:
2582 *a = (a++, 2)
2583 Despite the fact that the modification of "a" is in the before_sp
2584 list (tmp_before), it conflicts with the use of "a" in the LHS.
2585 We can handle this by adding the contents of tmp_list3
2586 to those of tmp_before, and redoing the collision warnings for that
2587 list. */
2590 /* Exclude the LHS itself here; we first have to merge it into the
2591 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2592 didn't exclude the LHS, we'd get it twice, once as a read and once
2593 as a write. */
2604 /* We need to warn about conflicts among arguments and conflicts between
2605 args and the function address. Side effects of the function address,
2606 however, are not ordered by the sequence point of the call. */
2607 {
2608 call_expr_arg_iterator iter;
2609 tree arg;
2613 {
2618 }
2623 }
2626 /* Scan all the list, e.g. indices of multi dimensional array. */
2628 {
2634 }
2638 {
2645 {
2657 {
2661 }
2664 }
2668 }
2678 /* For other expressions, simply recurse on their operands.
2679 Manual tail recursion for unary expressions.
2680 Other non-expressions need not be processed. */
2682 {
2686 }
2688 {
2692 {
2697 }
2698 }
2700 }
2701 }
2703 /* Try to warn for undefined behavior in EXPR due to missing sequence
2704 points. */
2706 DEBUG_FUNCTION void
2708 {
2714 {
2717 }
2722 }
2723 \f
2724 /* Validate the expression after `case' and apply default promotions. */
2726 static tree
2728 {
2733 /* Promote char or short to int. */
2736 {
2739 }
2744 }
2745 \f
2746 /* See if the case values LOW and HIGH are in the range of the original
2747 type (i.e. before the default conversion to int) of the switch testing
2748 expression.
2749 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2750 the type before promoting it. CASE_LOW_P is a pointer to the lower
2751 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2752 if the case is not a case range.
2753 The caller has to make sure that we are not called with NULL for
2754 CASE_LOW_P (i.e. the default case).
2755 Returns true if the case label is in range of ORIG_TYPE (saturated or
2756 untouched) or false if the label is out of range. */
2758 static bool
2761 {
2766 /* If there was a problem with the original type, do nothing. */
2773 /* Case label is less than minimum for type. */
2776 {
2779 }
2781 /* Case value is greater than maximum for type. */
2784 {
2787 }
2789 /* Saturate lower case label value to minimum. */
2792 {
2796 }
2798 /* Saturate upper case label value to maximum. */
2801 {
2805 }
2813 }
2814 \f
2815 /* Return an integer type with BITS bits of precision,
2816 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2818 tree
2820 {
2859 }
2861 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2862 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2863 and saturating if SATP is nonzero, otherwise not saturating. */
2865 tree
2868 {
2872 else
2880 {
2882 "fixed-point types that have too many integral and "
2885 }
2888 }
2890 /* Used for communication between c_common_type_for_mode and
2891 c_register_builtin_type. */
2894 /* Return a data type that has machine mode MODE.
2895 If the mode is an integer,
2896 then UNSIGNEDP selects between signed and unsigned types.
2897 If the mode is a fixed-point mode,
2898 then UNSIGNEDP selects between saturating and nonsaturating types. */
2900 tree
2902 {
2903 tree t;
2940 #if HOST_BITS_PER_WIDE_INT >= 64
2943 #endif
2968 {
2970 tree inner_type;
2986 }
2988 {
2993 }
3003 {
3089 }
3097 }
3099 tree
3101 {
3103 }
3105 /* Return a signed type the same as TYPE in other respects. */
3107 tree
3109 {
3111 }
3113 /* Return a type the same as TYPE except unsigned or
3114 signed according to UNSIGNEDP. */
3116 tree
3118 {
3119 tree type1;
3121 /* This block of code emulates the behavior of the old
3122 c_common_unsigned_type. In particular, it returns
3123 long_unsigned_type_node if passed a long, even when a int would
3124 have the same size. This is necessary for warnings to work
3125 correctly in archs where sizeof(int) == sizeof(long) */
3128 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3144 #if HOST_BITS_PER_WIDE_INT >= 64
3147 #endif
3157 #define C_COMMON_FIXED_TYPES(NAME) \
3158 if (type1 == short_ ## NAME ## _type_node \
3159 || type1 == unsigned_short_ ## NAME ## _type_node) \
3160 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3161 : short_ ## NAME ## _type_node; \
3162 if (type1 == NAME ## _type_node \
3163 || type1 == unsigned_ ## NAME ## _type_node) \
3164 return unsignedp ? unsigned_ ## NAME ## _type_node \
3165 : NAME ## _type_node; \
3166 if (type1 == long_ ## NAME ## _type_node \
3167 || type1 == unsigned_long_ ## NAME ## _type_node) \
3168 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3169 : long_ ## NAME ## _type_node; \
3170 if (type1 == long_long_ ## NAME ## _type_node \
3171 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3172 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3173 : long_long_ ## NAME ## _type_node;
3175 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3176 if (type1 == NAME ## _type_node \
3177 || type1 == u ## NAME ## _type_node) \
3178 return unsignedp ? u ## NAME ## _type_node \
3179 : NAME ## _type_node;
3181 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3182 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3183 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3184 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3185 : sat_ ## short_ ## NAME ## _type_node; \
3186 if (type1 == sat_ ## NAME ## _type_node \
3187 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3188 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3189 : sat_ ## NAME ## _type_node; \
3190 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3191 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3192 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3193 : sat_ ## long_ ## NAME ## _type_node; \
3194 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3195 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3196 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3197 : sat_ ## long_long_ ## NAME ## _type_node;
3199 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3200 if (type1 == sat_ ## NAME ## _type_node \
3201 || type1 == sat_ ## u ## NAME ## _type_node) \
3202 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3203 : sat_ ## NAME ## _type_node;
3229 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3230 the precision; they have precision set to match their range, but
3231 may use a wider mode to match an ABI. If we change modes, we may
3232 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3233 the precision as well, so as to yield correct results for
3234 bit-field types. C++ does not have these separate bit-field
3235 types, and producing a signed or unsigned variant of an
3236 ENUMERAL_TYPE may cause other problems as well. */
3242 #define TYPE_OK(node) \
3243 (TYPE_MODE (type) == TYPE_MODE (node) \
3244 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3263 #if HOST_BITS_PER_WIDE_INT >= 64
3266 #endif
3275 #undef TYPE_OK
3278 }
3280 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3282 tree
3284 {
3285 /* Extended integer types of the same width as a standard type have
3286 lesser rank, so those of the same width as int promote to int or
3287 unsigned int and are valid for printf formats expecting int or
3288 unsigned int. To avoid such special cases, avoid creating
3289 extended integer types for bit-fields if a standard integer type
3290 is available. */
3307 }
3309 /* The C version of the register_builtin_type langhook. */
3311 void
3313 {
3314 tree decl;
3324 }
3325 \f
3326 /* Print an error message for invalid operands to arith operation
3327 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3328 LOCATION is the location of the message. */
3330 void
3333 {
3337 {
3382 }
3386 }
3387 \f
3388 /* Subroutine of build_binary_op, used for comparison operations.
3389 See if the operands have both been converted from subword integer types
3390 and, if so, perhaps change them both back to their original type.
3391 This function is also responsible for converting the two operands
3392 to the proper common type for comparison.
3394 The arguments of this function are all pointers to local variables
3395 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3396 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3398 If this function returns nonzero, it means that the comparison has
3399 a constant value. What this function returns is an expression for
3400 that value. */
3402 tree
3405 {
3406 tree type;
3414 /* Throw away any conversions to wider types
3415 already present in the operands. */
3420 /* If primopN is first sign-extended from primopN's precision to opN's
3421 precision, then zero-extended from opN's precision to
3422 *restype_ptr precision, shortenings might be invalid. */
3425 && !unsignedp0
3430 && !unsignedp1
3434 /* Handle the case that OP0 does not *contain* a conversion
3435 but it *requires* conversion to FINAL_TYPE. */
3442 /* If one of the operands must be floated, we cannot optimize. */
3446 /* If first arg is constant, swap the args (changing operation
3447 so value is preserved), for canonicalization. Don't do this if
3448 the second arg is 0. */
3453 {
3470 {
3485 }
3487 }
3489 /* If comparing an integer against a constant more bits wide,
3490 maybe we can deduce a value of 1 or 0 independent of the data.
3491 Or else truncate the constant now
3492 rather than extend the variable at run time.
3494 This is only interesting if the constant is the wider arg.
3495 Also, it is not safe if the constant is unsigned and the
3496 variable arg is signed, since in this case the variable
3497 would be sign-extended and then regarded as unsigned.
3498 Our technique fails in this case because the lowest/highest
3499 possible unsigned results don't follow naturally from the
3500 lowest/highest possible values of the variable operand.
3501 For just EQ_EXPR and NE_EXPR there is another technique that
3502 could be used: see if the constant can be faithfully represented
3503 in the other operand's type, by truncating it and reextending it
3504 and see if that preserves the constant's value. */
3510 {
3513 /* 1 if comparison is nominally unsigned. */
3515 tree val;
3527 {
3528 /* Convert primop1 to target type, but do not introduce
3529 additional overflow. We know primop1 is an int_cst. */
3533 }
3535 {
3538 }
3541 {
3546 }
3547 else
3548 {
3553 }
3556 /* This used to be a switch, but Genix compiler can't handle that. */
3558 {
3561 }
3563 {
3566 }
3568 {
3573 }
3575 {
3580 }
3582 {
3587 }
3589 {
3594 }
3596 /* If primop0 was sign-extended and unsigned comparison specd,
3597 we did a signed comparison above using the signed type bounds.
3598 But the comparison we output must be unsigned.
3600 Also, for inequalities, VAL is no good; but if the signed
3601 comparison had *any* fixed result, it follows that the
3602 unsigned comparison just tests the sign in reverse
3603 (positive values are LE, negative ones GE).
3604 So we can generate an unsigned comparison
3605 against an extreme value of the signed type. */
3608 {
3611 {
3626 }
3628 }
3631 {
3636 }
3639 {
3640 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3644 }
3646 /* Value is not predetermined, but do the comparison
3647 in the type of the operand that is not constant.
3648 TYPE is already properly set. */
3649 }
3651 /* If either arg is decimal float and the other is float, find the
3652 proper common type to use for comparison. */
3663 /* If args' natural types are both narrower than nominal type
3664 and both extend in the same manner, compare them
3665 in the type of the wider arg.
3666 Otherwise must actually extend both to the nominal
3667 common type lest different ways of extending
3668 alter the result.
3669 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3674 {
3678 type);
3679 /* Make sure shorter operand is extended the right way
3680 to match the longer operand. */
3681 primop0
3684 primop0);
3685 primop1
3688 primop1);
3689 }
3690 else
3691 {
3692 /* Here we must do the comparison on the nominal type
3693 using the args exactly as we received them. */
3700 {
3703 {
3705 /* All unsigned values are >= 0, so we warn. However,
3706 if OP0 is a constant that is >= 0, the signedness of
3707 the comparison isn't an issue, so suppress the
3708 warning. */
3712 primop0))))
3722 primop0))))
3730 }
3733 {
3734 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3739 }
3740 }
3741 }
3749 }
3750 \f
3751 /* Return a tree for the sum or difference (RESULTCODE says which)
3752 of pointer PTROP and integer INTOP. */
3754 tree
3757 {
3760 /* The result is a pointer of the same type that is being added. */
3764 {
3768 }
3770 {
3774 }
3776 {
3780 }
3781 else
3784 /* We are manipulating pointer values, so we don't need to warn
3785 about relying on undefined signed overflow. We disable the
3786 warning here because we use integer types so fold won't know that
3787 they are really pointers. */
3790 /* If what we are about to multiply by the size of the elements
3791 contains a constant term, apply distributive law
3792 and multiply that constant term separately.
3793 This helps produce common subexpressions. */
3798 /* If the constant comes from pointer subtraction,
3799 skip this optimization--it would cause an error. */
3801 /* If the constant is unsigned, and smaller than the pointer size,
3802 then we must skip this optimization. This is because it could cause
3803 an overflow error if the constant is negative but INTOP is not. */
3807 {
3812 /* Convert both subexpression types to the type of intop,
3813 because weird cases involving pointer arithmetic
3814 can result in a sum or difference with different type args. */
3819 }
3821 /* Convert the integer argument to a type the same size as sizetype
3822 so the multiply won't overflow spuriously. */
3828 /* Replace the integer argument with a suitable product by the object size.
3829 Do this multiplication as signed, then convert to the appropriate type
3830 for the pointer operation and disregard an overflow that occured only
3831 because of the sign-extension change in the latter conversion. */
3832 {
3840 }
3842 /* Create the sum or difference. */
3851 }
3852 \f
3853 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3854 and if NON_CONST is known not to be permitted in an evaluated part
3855 of a constant expression. */
3857 tree
3859 {
3863 /* This should never be called for C++. */
3867 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3876 }
3878 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3879 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3880 around the SAVE_EXPR if needed so that c_fully_fold does not need
3881 to look inside SAVE_EXPRs. */
3883 tree
3885 {
3894 }
3896 /* Return whether EXPR is a declaration whose address can never be
3897 NULL. */
3899 bool
3901 {
3906 }
3908 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3909 or for an `if' or `while' statement or ?..: exp. It should already
3910 have been validated to be of suitable type; otherwise, a bad
3911 diagnostic may result.
3913 The EXPR is located at LOCATION.
3915 This preparation consists of taking the ordinary
3916 representation of an expression expr and producing a valid tree
3917 boolean expression describing whether expr is nonzero. We could
3918 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3919 but we optimize comparisons, &&, ||, and !.
3921 The resulting type should always be `truthvalue_type_node'. */
3923 tree
3925 {
3927 {
3969 ? truthvalue_true_node
3975 ? truthvalue_true_node
3980 /* Fall through. */
3983 {
3986 {
3987 /* Common Ada/Pascal programmer's mistake. */
3989 OPT_Waddress,
3991 inner);
3993 }
3995 }
4012 /* These don't change whether an object is nonzero or zero. */
4017 /* These don't change whether an object is zero or nonzero, but
4018 we can't ignore them if their second arg has side-effects. */
4020 {
4023 c_common_truthvalue_conversion
4026 }
4027 else
4032 /* Distribute the conversion into the arms of a COND_EXPR. */
4034 {
4037 /* In C++ one of the arms might have void type if it is throw. */
4045 }
4046 else
4047 {
4048 /* Folding will happen later for C. */
4056 }
4058 CASE_CONVERT:
4059 {
4063 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4064 since that affects how `default_conversion' will behave. */
4068 /* Don't strip a conversion from C++0x scoped enum, since they
4069 don't implicitly convert to other types. */
4073 /* If this isn't narrowing the argument, we can ignore it. */
4077 }
4083 {
4087 }
4092 }
4095 {
4097 expr = (build_binary_op
4101 c_common_truthvalue_conversion
4104 c_common_truthvalue_conversion
4109 }
4112 {
4117 }
4118 else
4121 ret:
4124 }
4125 \f
4134 /* Apply the TYPE_QUALS to the new DECL. */
4136 void
4138 {
4146 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4147 constructor can produce constant init, so rely on cp_finish_decl to
4148 clear TREE_READONLY if the variable has non-constant init. */
4151 {
4154 }
4156 {
4158 /* Allow 'restrict' on arrays of pointers.
4159 FIXME currently we just ignore it. */
4165 }
4166 }
4168 /* Hash function for the problem of multiple type definitions in
4169 different files. This must hash all types that will compare
4170 equal via comptypes to the same value. In practice it hashes
4171 on some of the simple stuff and leaves the details to comptypes. */
4173 static hashval_t
4175 {
4179 tree t2;
4181 {
4182 /* For pointers, hash on pointee type plus some swizzling. */
4185 /* Hash on number of elements and total size. */
4204 }
4205 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4206 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4208 /* We might have a VLA here. */
4211 else
4214 }
4218 /* Return the typed-based alias set for T, which may be an expression
4219 or a type. Return -1 if we don't do anything special. */
4221 alias_set_type
4223 {
4224 tree u;
4227 /* For VLAs, use the alias set of the element type rather than the
4228 default of alias set 0 for types compared structurally. */
4230 {
4234 }
4236 /* Permit type-punning when accessing a union, provided the access
4237 is directly through the union. For example, this code does not
4238 permit taking the address of a union member and then storing
4239 through it. Even the type-punning allowed here is a GCC
4240 extension, albeit a common and useful one; the C standard says
4241 that such accesses have implementation-defined behavior. */
4249 /* That's all the expressions we handle specially. */
4253 /* The C standard guarantees that any object may be accessed via an
4254 lvalue that has character type. */
4260 /* The C standard specifically allows aliasing between signed and
4261 unsigned variants of the same type. We treat the signed
4262 variant as canonical. */
4264 {
4267 /* t1 == t can happen for boolean nodes which are always unsigned. */
4270 }
4272 /* Handle the case of multiple type nodes referring to "the same" type,
4273 which occurs with IMA. These share an alias set. FIXME: Currently only
4274 C90 is handled. (In C99 type compatibility is not transitive, which
4275 complicates things mightily. The alias set splay trees can theoretically
4276 represent this, but insertion is tricky when you consider all the
4277 different orders things might arrive in.) */
4282 /* Save time if there's only one input file. */
4286 /* Pointers need special handling if they point to any type that
4287 needs special handling (below). */
4289 {
4290 tree t2;
4291 /* Find bottom type under any nested POINTERs. */
4295 ;
4303 }
4304 /* These are the only cases that need special handling. */
4311 /* Undefined? */
4315 /* Look up t in hash table. Only one of the compatible types within each
4316 alias set is recorded in the table. */
4320 NULL);
4323 {
4326 }
4327 else
4328 /* Our caller will assign and record (in t) a new alias set; all we need
4329 to do is remember t in the hash table. */
4333 }
4334 \f
4335 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4336 the second parameter indicates which OPERATOR is being applied.
4337 The COMPLAIN flag controls whether we should diagnose possibly
4338 ill-formed constructs or not. LOC is the location of the SIZEOF or
4339 TYPEOF operator. */
4341 tree
4344 {
4352 {
4354 {
4361 }
4362 else
4363 {
4365 {
4369 else
4372 }
4374 }
4375 }
4377 {
4385 }
4388 {
4393 }
4396 {
4401 }
4402 else
4403 {
4405 /* Convert in case a char is more than one unit. */
4409 else
4411 }
4413 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4414 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4415 never happen. However, this node should really have type
4416 `size_t', which is just a typedef for an ordinary integer type. */
4421 }
4423 /* Implement the __alignof keyword: Return the minimum required
4424 alignment of EXPR, measured in bytes. For VAR_DECLs,
4425 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4426 from an "aligned" __attribute__ specification). LOC is the
4427 location of the ALIGNOF operator. */
4429 tree
4431 {
4432 tree t;
4439 {
4442 }
4448 {
4455 {
4462 }
4464 }
4465 else
4469 }
4470 \f
4471 /* Handle C and C++ default attributes. */
4473 enum built_in_attribute
4474 {
4475 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4476 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4477 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4478 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4480 #undef DEF_ATTR_NULL_TREE
4481 #undef DEF_ATTR_INT
4482 #undef DEF_ATTR_IDENT
4483 #undef DEF_ATTR_TREE_LIST
4484 ATTR_LAST
4485 };
4491 enum c_builtin_type
4492 {
4493 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4494 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4495 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4496 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4497 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4498 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4499 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4500 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4501 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4502 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4503 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4504 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4505 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4506 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4507 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4508 NAME,
4509 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4511 #undef DEF_PRIMITIVE_TYPE
4512 #undef DEF_FUNCTION_TYPE_0
4513 #undef DEF_FUNCTION_TYPE_1
4514 #undef DEF_FUNCTION_TYPE_2
4515 #undef DEF_FUNCTION_TYPE_3
4516 #undef DEF_FUNCTION_TYPE_4
4517 #undef DEF_FUNCTION_TYPE_5
4518 #undef DEF_FUNCTION_TYPE_6
4519 #undef DEF_FUNCTION_TYPE_7
4520 #undef DEF_FUNCTION_TYPE_VAR_0
4521 #undef DEF_FUNCTION_TYPE_VAR_1
4522 #undef DEF_FUNCTION_TYPE_VAR_2
4523 #undef DEF_FUNCTION_TYPE_VAR_3
4524 #undef DEF_FUNCTION_TYPE_VAR_4
4525 #undef DEF_FUNCTION_TYPE_VAR_5
4526 #undef DEF_POINTER_TYPE
4527 BT_LAST
4528 };
4532 /* A temporary array for c_common_nodes_and_builtins. Used in
4533 communication with def_fn_type. */
4536 /* A helper function for c_common_nodes_and_builtins. Build function type
4537 for DEF with return type RET and N arguments. If VAR is true, then the
4538 function should be variadic after those N arguments.
4540 Takes special care not to ICE if any of the types involved are
4541 error_mark_node, which indicates that said type is not in fact available
4542 (see builtin_type_for_size). In which case the function type as a whole
4543 should be error_mark_node. */
4545 static void
4547 {
4548 tree t;
4555 {
4561 }
4568 else
4571 egress:
4574 }
4576 /* Build builtin functions common to both C and C++ language
4577 frontends. */
4579 static void
4581 {
4582 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4583 builtin_types[ENUM] = VALUE;
4584 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4585 def_fn_type (ENUM, RETURN, 0, 0);
4586 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4587 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4588 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4589 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4590 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4591 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4592 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4593 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4594 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4595 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4596 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4597 ARG6) \
4598 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4599 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4600 ARG6, ARG7) \
4601 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4602 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4603 def_fn_type (ENUM, RETURN, 1, 0);
4604 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4605 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4606 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4607 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4608 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4609 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4610 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4611 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4612 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4613 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4614 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4615 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4619 #undef DEF_PRIMITIVE_TYPE
4620 #undef DEF_FUNCTION_TYPE_1
4621 #undef DEF_FUNCTION_TYPE_2
4622 #undef DEF_FUNCTION_TYPE_3
4623 #undef DEF_FUNCTION_TYPE_4
4624 #undef DEF_FUNCTION_TYPE_5
4625 #undef DEF_FUNCTION_TYPE_6
4626 #undef DEF_FUNCTION_TYPE_VAR_0
4627 #undef DEF_FUNCTION_TYPE_VAR_1
4628 #undef DEF_FUNCTION_TYPE_VAR_2
4629 #undef DEF_FUNCTION_TYPE_VAR_3
4630 #undef DEF_FUNCTION_TYPE_VAR_4
4631 #undef DEF_FUNCTION_TYPE_VAR_5
4632 #undef DEF_POINTER_TYPE
4637 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4638 NONANSI_P, ATTRS, IMPLICIT, COND) \
4639 if (NAME && COND) \
4640 def_builtin_1 (ENUM, NAME, CLASS, \
4641 builtin_types[(int) TYPE], \
4642 builtin_types[(int) LIBTYPE], \
4643 BOTH_P, FALLBACK_P, NONANSI_P, \
4644 built_in_attributes[(int) ATTRS], IMPLICIT);
4646 #undef DEF_BUILTIN
4654 }
4656 /* Like get_identifier, but avoid warnings about null arguments when
4657 the argument may be NULL for targets where GCC lacks stdint.h type
4658 information. */
4662 {
4664 }
4666 /* Build tree nodes and builtin functions common to both C and C++ language
4667 frontends. */
4669 void
4671 {
4675 tree array_domain_type;
4676 tree va_list_ref_type_node;
4677 tree va_list_arg_type_node;
4681 /* Define `int' and `char' first so that dbx will output them first. */
4685 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4686 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4687 but not C. Are the conditionals here needed? */
4693 long_unsigned_type_node);
4695 {
4697 int128_integer_type_node);
4699 int128_unsigned_type_node);
4700 }
4704 long_long_integer_type_node);
4706 long_long_unsigned_type_node);
4709 long_long_unsigned_type_node);
4712 short_unsigned_type_node);
4715 short_unsigned_type_node);
4717 /* Define both `signed char' and `unsigned char'. */
4721 /* These are types that c_common_type_for_size and
4722 c_common_type_for_mode use. */
4725 intQI_type_node));
4728 intHI_type_node));
4731 intSI_type_node));
4734 intDI_type_node));
4735 #if HOST_BITS_PER_WIDE_INT >= 64
4738 TYPE_DECL,
4740 intTI_type_node));
4741 #endif
4744 unsigned_intQI_type_node));
4747 unsigned_intHI_type_node));
4750 unsigned_intSI_type_node));
4753 unsigned_intDI_type_node));
4754 #if HOST_BITS_PER_WIDE_INT >= 64
4757 TYPE_DECL,
4759 unsigned_intTI_type_node));
4760 #endif
4762 /* Create the widest literal types. */
4763 widest_integer_literal_type_node
4767 widest_integer_literal_type_node));
4769 widest_unsigned_literal_type_node
4773 widest_unsigned_literal_type_node));
4777 pid_type_node =
4784 /* Only supported decimal floating point extension if the target
4785 actually supports underlying modes. */
4789 {
4793 }
4796 {
4801 long_long_fract_type_node);
4803 unsigned_short_fract_type_node);
4805 unsigned_fract_type_node);
4807 unsigned_long_fract_type_node);
4809 unsigned_long_long_fract_type_node);
4811 sat_short_fract_type_node);
4814 sat_long_fract_type_node);
4816 sat_long_long_fract_type_node);
4818 sat_unsigned_short_fract_type_node);
4820 sat_unsigned_fract_type_node);
4822 sat_unsigned_long_fract_type_node);
4824 sat_unsigned_long_long_fract_type_node);
4829 long_long_accum_type_node);
4831 unsigned_short_accum_type_node);
4833 unsigned_accum_type_node);
4835 unsigned_long_accum_type_node);
4837 unsigned_long_long_accum_type_node);
4839 sat_short_accum_type_node);
4842 sat_long_accum_type_node);
4844 sat_long_long_accum_type_node);
4846 sat_unsigned_short_accum_type_node);
4848 sat_unsigned_accum_type_node);
4850 sat_unsigned_long_accum_type_node);
4852 sat_unsigned_long_long_accum_type_node);
4854 }
4857 TYPE_DECL,
4859 complex_integer_type_node));
4861 TYPE_DECL,
4863 complex_float_type_node));
4865 TYPE_DECL,
4867 complex_double_type_node));
4871 complex_long_double_type_node));
4874 /* For C++, make fileptr_type_node a distinct void * type until
4875 FILE type is defined. */
4880 /* Set the TYPE_NAME for any variants that were built before
4881 record_builtin_type gave names to the built-in types. */
4882 {
4888 }
4890 /* This node must not be shared. */
4896 /* Make a type to be the domain of a few array types
4897 whose domains don't really matter.
4898 200 is small enough that it always fits in size_t
4899 and large enough that it can hold most function names for the
4900 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4903 /* Make a type for arrays of characters.
4904 With luck nothing will ever really depend on the length of this
4905 array type. */
4906 char_array_type_node
4909 /* Likewise for arrays of ints. */
4910 int_array_type_node
4914 const_string_type_node
4918 /* This is special for C++ so functions can be overloaded. */
4924 {
4927 else
4930 }
4932 /* This is for wide string constants. */
4933 wchar_array_type_node
4936 /* Define 'char16_t'. */
4941 {
4946 }
4948 /* This is for UTF-16 string constants. */
4949 char16_array_type_node
4952 /* Define 'char32_t'. */
4957 {
4962 }
4964 /* This is for UTF-32 string constants. */
4965 char32_array_type_node
4968 wint_type_node =
4971 intmax_type_node =
4973 uintmax_type_node =
4977 sig_atomic_type_node =
4980 int8_type_node =
4983 int16_type_node =
4986 int32_type_node =
4989 int64_type_node =
4992 uint8_type_node =
4995 uint16_type_node =
4998 c_uint32_type_node =
5001 c_uint64_type_node =
5004 int_least8_type_node =
5007 int_least16_type_node =
5010 int_least32_type_node =
5013 int_least64_type_node =
5016 uint_least8_type_node =
5019 uint_least16_type_node =
5022 uint_least32_type_node =
5025 uint_least64_type_node =
5028 int_fast8_type_node =
5031 int_fast16_type_node =
5034 int_fast32_type_node =
5037 int_fast64_type_node =
5040 uint_fast8_type_node =
5043 uint_fast16_type_node =
5046 uint_fast32_type_node =
5049 uint_fast64_type_node =
5052 intptr_type_node =
5055 uintptr_type_node =
5058 default_function_type
5060 ptrdiff_type_node
5067 va_list_type_node));
5069 {
5072 tree ptype;
5075 {
5079 ptype));
5081 }
5082 }
5085 {
5088 }
5089 else
5090 {
5093 }
5100 /* Create the built-in __null node. It is important that this is
5101 not shared. */
5105 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5107 }
5109 /* The number of named compound-literals generated thus far. */
5112 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5114 void
5116 {
5119 compound_literal_number);
5120 compound_literal_number++;
5122 }
5124 tree
5126 {
5130 }
5133 /* Linked list of disabled built-in functions. */
5136 {
5144 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5145 begins with "__builtin_", give an error. */
5147 void
5149 {
5152 else
5153 {
5158 }
5159 }
5162 /* Return true if the built-in function NAME has been disabled, false
5163 otherwise. */
5165 static bool
5167 {
5170 {
5173 }
5175 }
5178 /* Worker for DEF_BUILTIN.
5179 Possibly define a builtin function with one or two names.
5180 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5181 nonansi_p and flag_no_nonansi_builtin. */
5183 static void
5190 {
5191 tree decl;
5204 fnattrs);
5213 }
5214 \f
5215 /* Nonzero if the type T promotes to int. This is (nearly) the
5216 integral promotions defined in ISO C99 6.3.1.1/2. */
5218 bool
5220 {
5222 {
5232 /* ??? Technically all enumerations not larger than an int
5233 promote to an int. But this is used along code paths
5234 that only want to notice a size change. */
5242 }
5243 }
5245 /* Return 1 if PARMS specifies a fixed number of parameters
5246 and none of their types is affected by default promotions. */
5248 int
5250 {
5251 const_tree t;
5253 {
5270 }
5272 }
5274 /* Recursively remove any '*' or '&' operator from TYPE. */
5275 tree
5277 {
5281 }
5283 /* Recursively remove pointer or array type from TYPE. */
5284 tree
5286 {
5290 }
5292 /* Used to compare case labels. K1 and K2 are actually tree nodes
5293 representing case labels, or NULL_TREE for a `default' label.
5294 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5295 K2, and 0 if K1 and K2 are equal. */
5297 int
5299 {
5300 /* Consider a NULL key (such as arises with a `default' label) to be
5301 smaller than anything else. */
5308 }
5310 /* Process a case label, located at LOC, for the range LOW_VALUE
5311 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5312 then this case label is actually a `default' label. If only
5313 HIGH_VALUE is NULL_TREE, then case label was declared using the
5314 usual C/C++ syntax, rather than the GNU case range extension.
5315 CASES is a tree containing all the case ranges processed so far;
5316 COND is the condition for the switch-statement itself. Returns the
5317 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5318 is created. */
5320 tree
5323 {
5324 tree type;
5325 tree label;
5326 tree case_label;
5327 splay_tree_node node;
5329 /* Create the LABEL_DECL itself. */
5332 /* If there was an error processing the switch condition, bail now
5333 before we get more confused. */
5341 {
5344 }
5346 /* Case ranges are a GNU extension. */
5353 {
5358 }
5360 {
5365 }
5368 {
5369 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5370 really a case range, even though it was written that way.
5371 Remove the HIGH_VALUE to simplify later processing. */
5376 }
5378 /* See if the case is in range of the type of the original testing
5379 expression. If both low_value and high_value are out of range,
5380 don't insert the case label and return NULL_TREE. */
5386 /* Look up the LOW_VALUE in the table of case labels we already
5387 have. */
5389 /* If there was not an exact match, check for overlapping ranges.
5390 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5391 that's a `default' label and the only overlap is an exact match. */
5393 {
5394 splay_tree_node low_bound;
5395 splay_tree_node high_bound;
5397 /* Even though there wasn't an exact match, there might be an
5398 overlap between this case range and another case range.
5399 Since we've (inductively) not allowed any overlapping case
5400 ranges, we simply need to find the greatest low case label
5401 that is smaller that LOW_VALUE, and the smallest low case
5402 label that is greater than LOW_VALUE. If there is an overlap
5403 it will occur in one of these two ranges. */
5409 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5410 the LOW_VALUE, so there is no need to check unless the
5411 LOW_BOUND is in fact itself a case range. */
5417 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5418 range is bigger than the low end of the current range, so we
5419 are only interested if the current range is a real range, and
5420 not an ordinary case label. */
5422 && high_value
5424 high_value)
5427 }
5428 /* If there was an overlap, issue an error. */
5430 {
5434 {
5438 }
5440 {
5443 }
5444 else
5445 {
5449 }
5451 }
5453 /* Add a CASE_LABEL to the statement-tree. */
5455 /* Register this case label in the splay tree. */
5462 error_out:
5463 /* Add a label so that the back-end doesn't think that the beginning of
5464 the switch is unreachable. Note that we do not add a case label, as
5465 that just leads to duplicates and thence to failure later on. */
5467 {
5470 }
5472 }
5474 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5475 Used to verify that case values match up with enumerator values. */
5477 static void
5479 {
5482 /* ??? Not working too hard to print the double-word value.
5483 Should perhaps be done with %lwd in the diagnostic routines? */
5492 else
5501 buf);
5502 else
5507 }
5509 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5510 Used to verify that case values match up with enumerator values. */
5512 static int
5514 {
5518 /* Skip default case. */
5522 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5523 when we did our enum->case scan. Reset our scratch bit after. */
5526 else
5529 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5530 not set, that means that CASE_HIGH did not appear when we did our
5531 enum->case scan. Reset our scratch bit after. */
5533 {
5536 else
5538 }
5541 }
5543 /* Handle -Wswitch*. Called from the front end after parsing the
5544 switch construct. */
5545 /* ??? Should probably be somewhere generic, since other languages
5546 besides C and C++ would want this. At the moment, however, C/C++
5547 are the only tree-ssa languages that support enumerations at all,
5548 so the point is moot. */
5550 void
5553 {
5554 splay_tree_node default_node;
5555 splay_tree_node node;
5556 tree chain;
5566 /* From here on, we only care about about enumerated types. */
5570 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5574 /* Check the cases. Warn about case values which are not members of
5575 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5576 there is no default case, check that exactly all enumeration
5577 literals are covered by the cases. */
5579 /* Clearing COND if it is not an integer constant simplifies
5580 the tests inside the loop below. */
5584 /* The time complexity here is O(N*lg(N)) worst case, but for the
5585 common case of monotonically increasing enumerators, it is
5586 O(N), since the nature of the splay tree will keep the next
5587 element adjacent to the root at all times. */
5590 {
5596 {
5597 /* Mark the CASE_LOW part of the case entry as seen. */
5601 }
5603 /* Even though there wasn't an exact match, there might be a
5604 case range which includes the enumerator's value. */
5607 {
5611 {
5612 /* If we match the upper bound exactly, mark the CASE_HIGH
5613 part of the case entry as seen. */
5617 }
5618 }
5620 /* We've now determined that this enumerated literal isn't
5621 handled by the case labels of the switch statement. */
5623 /* If the switch expression is a constant, we only really care
5624 about whether that constant is handled by the switch. */
5628 /* If there is a default_node, the only relevant option is
5629 Wswitch-enum. Otherwise, if both are enabled then we prefer
5630 to warn using -Wswitch because -Wswitch is enabled by -Wall
5631 while -Wswitch-enum is explicit. */
5634 ? OPT_Wswitch_enum
5638 }
5640 /* Warn if there are case expressions that don't correspond to
5641 enumerators. This can occur since C and C++ don't enforce
5642 type-checking of assignments to enumeration variables.
5644 The time complexity here is now always O(N) worst case, since
5645 we should have marked both the lower bound and upper bound of
5646 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5647 above. This scan also resets those fields. */
5650 }
5652 /* Finish an expression taking the address of LABEL (an
5653 IDENTIFIER_NODE). Returns an expression for the address.
5655 LOC is the location for the expression returned. */
5657 tree
5659 {
5660 tree result;
5670 else
5671 {
5674 /* The current function is not necessarily uninlinable.
5675 Computed gotos are incompatible with inlining, but the value
5676 here could be used only in a diagnostic, for example. */
5678 }
5681 }
5682 \f
5684 /* Given a boolean expression ARG, return a tree representing an increment
5685 or decrement (as indicated by CODE) of ARG. The front end must check for
5686 invalid cases (e.g., decrement in C++). */
5687 tree
5689 {
5690 tree val;
5695 {
5718 }
5721 }
5722 \f
5723 /* Built-in macros for stddef.h and stdint.h, that require macros
5724 defined in this file. */
5725 void
5727 {
5790 }
5792 static void
5794 {
5795 /* Fill in the built_in_attributes array. */
5796 #define DEF_ATTR_NULL_TREE(ENUM) \
5797 built_in_attributes[(int) ENUM] = NULL_TREE;
5798 #define DEF_ATTR_INT(ENUM, VALUE) \
5799 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5800 #define DEF_ATTR_IDENT(ENUM, STRING) \
5801 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5802 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5803 built_in_attributes[(int) ENUM] \
5804 = tree_cons (built_in_attributes[(int) PURPOSE], \
5805 built_in_attributes[(int) VALUE], \
5806 built_in_attributes[(int) CHAIN]);
5808 #undef DEF_ATTR_NULL_TREE
5809 #undef DEF_ATTR_INT
5810 #undef DEF_ATTR_IDENT
5811 #undef DEF_ATTR_TREE_LIST
5812 }
5814 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5815 identifier as an argument, so the front end shouldn't look it up. */
5817 bool
5819 {
5822 /* Unknown attribute that we'll end up ignoring, return true so we
5823 don't complain about an identifier argument. */
5829 else
5831 }
5833 /* Attribute handlers common to C front ends. */
5835 /* Handle a "packed" attribute; arguments as in
5836 struct attribute_spec.handler. */
5838 static tree
5841 {
5843 {
5847 }
5849 {
5851 /* Still pack bitfields. */
5856 else
5858 }
5859 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5860 used for DECL_REGISTER. It wouldn't mean anything anyway.
5861 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5862 that changes what the typedef is typing. */
5863 else
5864 {
5867 }
5870 }
5872 /* Handle a "nocommon" attribute; arguments as in
5873 struct attribute_spec.handler. */
5875 static tree
5879 {
5882 else
5883 {
5886 }
5889 }
5891 /* Handle a "common" attribute; arguments as in
5892 struct attribute_spec.handler. */
5894 static tree
5897 {
5900 else
5901 {
5904 }
5907 }
5909 /* Handle a "noreturn" attribute; arguments as in
5910 struct attribute_spec.handler. */
5912 static tree
5915 {
5918 /* See FIXME comment in c_common_attribute_table. */
5925 = build_pointer_type
5928 else
5929 {
5932 }
5935 }
5937 /* Handle a "hot" and attribute; arguments as in
5938 struct attribute_spec.handler. */
5940 static tree
5943 {
5945 {
5947 {
5951 }
5952 /* Most of the rest of the hot processing is done later with
5953 lookup_attribute. */
5954 }
5955 else
5956 {
5959 }
5962 }
5963 /* Handle a "cold" and attribute; arguments as in
5964 struct attribute_spec.handler. */
5966 static tree
5969 {
5971 {
5973 {
5977 }
5978 /* Most of the rest of the cold processing is done later with
5979 lookup_attribute. */
5980 }
5981 else
5982 {
5985 }
5988 }
5990 /* Handle a "noinline" attribute; arguments as in
5991 struct attribute_spec.handler. */
5993 static tree
5997 {
6000 else
6001 {
6004 }
6007 }
6009 /* Handle a "noclone" attribute; arguments as in
6010 struct attribute_spec.handler. */
6012 static tree
6016 {
6018 {
6021 }
6024 }
6026 /* Handle a "always_inline" attribute; arguments as in
6027 struct attribute_spec.handler. */
6029 static tree
6034 {
6036 {
6037 /* Set the attribute and mark it for disregarding inline
6038 limits. */
6040 }
6041 else
6042 {
6045 }
6048 }
6050 /* Handle a "gnu_inline" attribute; arguments as in
6051 struct attribute_spec.handler. */
6053 static tree
6058 {
6060 {
6061 /* Do nothing else, just set the attribute. We'll get at
6062 it later with lookup_attribute. */
6063 }
6064 else
6065 {
6068 }
6071 }
6073 /* Handle a "leaf" attribute; arguments as in
6074 struct attribute_spec.handler. */
6076 static tree
6080 {
6082 {
6085 }
6087 {
6090 }
6093 }
6095 /* Handle an "artificial" attribute; arguments as in
6096 struct attribute_spec.handler. */
6098 static tree
6103 {
6105 {
6106 /* Do nothing else, just set the attribute. We'll get at
6107 it later with lookup_attribute. */
6108 }
6109 else
6110 {
6113 }
6116 }
6118 /* Handle a "flatten" attribute; arguments as in
6119 struct attribute_spec.handler. */
6121 static tree
6123 tree args ATTRIBUTE_UNUSED,
6125 {
6127 /* Do nothing else, just set the attribute. We'll get at
6128 it later with lookup_attribute. */
6129 ;
6130 else
6131 {
6134 }
6137 }
6139 /* Handle a "warning" or "error" attribute; arguments as in
6140 struct attribute_spec.handler. */
6142 static tree
6145 {
6148 /* Do nothing else, just set the attribute. We'll get at
6149 it later with lookup_attribute. */
6150 ;
6151 else
6152 {
6155 }
6158 }
6160 /* Handle a "used" attribute; arguments as in
6161 struct attribute_spec.handler. */
6163 static tree
6166 {
6172 {
6177 }
6178 else
6179 {
6182 }
6185 }
6187 /* Handle a "unused" attribute; arguments as in
6188 struct attribute_spec.handler. */
6190 static tree
6193 {
6195 {
6203 {
6208 }
6209 else
6210 {
6213 }
6214 }
6215 else
6216 {
6220 }
6223 }
6225 /* Handle a "externally_visible" attribute; arguments as in
6226 struct attribute_spec.handler. */
6228 static tree
6233 {
6237 {
6240 {
6244 }
6245 }
6246 else
6247 {
6250 }
6253 }
6255 /* Handle a "const" attribute; arguments as in
6256 struct attribute_spec.handler. */
6258 static tree
6261 {
6264 /* See FIXME comment on noreturn in c_common_attribute_table. */
6270 = build_pointer_type
6273 else
6274 {
6277 }
6280 }
6282 /* Handle a "transparent_union" attribute; arguments as in
6283 struct attribute_spec.handler. */
6285 static tree
6289 {
6290 tree type;
6299 {
6300 /* Make sure that the first field will work for a transparent union.
6301 If the type isn't complete yet, leave the check to the code in
6302 finish_struct. */
6304 {
6310 }
6313 {
6314 /* If the type isn't complete yet, setting the flag
6315 on a variant wouldn't ever be checked. */
6319 /* build_duplicate_type doesn't work for C++. */
6323 /* A type variant isn't good enough, since we don't a cast
6324 to such a type removed as a no-op. */
6326 }
6330 }
6332 ignored:
6335 }
6337 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6338 get the requested priority for a constructor or destructor,
6339 possibly issuing diagnostics for invalid or reserved
6340 priorities. */
6342 static priority_type
6344 {
6345 HOST_WIDE_INT pri;
6346 tree arg;
6352 {
6355 else
6358 }
6370 {
6373 "destructor priorities from 0 to %d are reserved "
6375 MAX_RESERVED_INIT_PRIORITY);
6376 else
6378 "constructor priorities from 0 to %d are reserved "
6380 MAX_RESERVED_INIT_PRIORITY);
6381 }
6384 invalid:
6387 MAX_INIT_PRIORITY);
6388 else
6390 MAX_INIT_PRIORITY);
6392 }
6394 /* Handle a "constructor" attribute; arguments as in
6395 struct attribute_spec.handler. */
6397 static tree
6401 {
6408 {
6409 priority_type priority;
6414 }
6415 else
6416 {
6419 }
6422 }
6424 /* Handle a "destructor" attribute; arguments as in
6425 struct attribute_spec.handler. */
6427 static tree
6431 {
6438 {
6439 priority_type priority;
6444 }
6445 else
6446 {
6449 }
6452 }
6454 /* Nonzero if the mode is a valid vector mode for this architecture.
6455 This returns nonzero even if there is no hardware support for the
6456 vector mode, but we can emulate with narrower modes. */
6458 static int
6460 {
6464 /* Doh! What's going on? */
6473 /* Hardware support. Woo hoo! */
6479 /* We should probably return 1 if requesting V4DI and we have no DI,
6480 but we have V2DI, but this is probably very unlikely. */
6482 /* If we have support for the inner mode, we can safely emulate it.
6483 We may not have V2DI, but me can emulate with a pair of DIs. */
6485 }
6488 /* Handle a "mode" attribute; arguments as in
6489 struct attribute_spec.handler. */
6491 static tree
6494 {
6502 else
6503 {
6508 tree typefm;
6513 {
6519 }
6521 /* Change this type to have a type with the specified mode.
6522 First check for the special modes. */
6535 else
6538 {
6541 }
6544 {
6547 }
6551 {
6583 }
6585 {
6588 }
6591 {
6596 {
6599 }
6603 else
6606 }
6607 else
6608 {
6609 /* For fixed-point modes, we need to test if the signness of type
6610 and the machine mode are consistent. */
6613 {
6616 }
6617 /* For fixed-point modes, we need to pass saturating info. */
6621 }
6624 {
6627 }
6629 {
6630 /* For enumeral types, copy the precision from the integer
6631 type returned above. If not an INTEGER_TYPE, we can't use
6632 this mode for this type. */
6634 {
6637 }
6640 {
6643 }
6644 else
6645 {
6646 /* We cannot build a type variant, as there's code that assumes
6647 that TYPE_MAIN_VARIANT has the same mode. This includes the
6648 debug generators. Instead, create a subrange type. This
6649 results in all of the enumeral values being emitted only once
6650 in the original, and the subtype gets them by reference. */
6653 else
6656 }
6657 }
6661 {
6664 }
6667 }
6670 }
6672 /* Handle a "section" attribute; arguments as in
6673 struct attribute_spec.handler. */
6675 static tree
6678 {
6682 {
6688 {
6692 {
6694 "section attribute cannot be specified for "
6697 }
6699 /* The decl may have already been given a section attribute
6700 from a previous declaration. Ensure they match. */
6704 {
6708 }
6712 {
6715 }
6716 else
6718 }
6719 else
6720 {
6723 }
6724 }
6725 else
6726 {
6730 }
6733 }
6735 /* Check whether ALIGN is a valid user-specified alignment. If so,
6736 return its base-2 log; if not, output an error and return -1. If
6737 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
6738 no error. */
6739 int
6741 {
6746 {
6749 }
6753 {
6756 }
6758 {
6761 }
6763 }
6765 /* Handle a "aligned" attribute; arguments as in
6766 struct attribute_spec.handler. */
6768 static tree
6771 {
6780 {
6784 }
6791 {
6794 /* If we have a TYPE_DECL, then copy the type, so that we
6795 don't accidentally modify a builtin type. See pushdecl. */
6798 {
6805 }
6806 else
6811 }
6814 {
6817 }
6820 {
6825 else
6829 }
6830 else
6831 {
6834 }
6837 }
6839 /* Handle a "weak" attribute; arguments as in
6840 struct attribute_spec.handler. */
6842 static tree
6847 {
6850 {
6853 }
6855 {
6859 }
6863 else
6867 }
6869 /* Handle an "alias" or "ifunc" attribute; arguments as in
6870 struct attribute_spec.handler, except that IS_ALIAS tells us
6871 whether this is an alias as opposed to ifunc attribute. */
6873 static tree
6876 {
6881 {
6884 }
6888 /* A static variable declaration is always a tentative definition,
6889 but the alias is a non-tentative definition which overrides. */
6892 {
6896 }
6900 {
6904 }
6906 /* Note that the very first time we process a nested declaration,
6907 decl_function_context will not be set. Indeed, *would* never
6908 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6909 we do below. After such frobbery, pushdecl would set the context.
6910 In any case, this is never what we want. */
6912 {
6913 tree id;
6917 {
6921 }
6923 /* This counts as a use of the object pointed to. */
6928 else
6929 {
6932 else
6935 }
6938 /* ifuncs are also aliases, so set that attribute too. */
6941 }
6942 else
6943 {
6946 }
6949 }
6951 /* Handle an "alias" or "ifunc" attribute; arguments as in
6952 struct attribute_spec.handler. */
6954 static tree
6957 {
6959 }
6961 /* Handle an "alias" or "ifunc" attribute; arguments as in
6962 struct attribute_spec.handler. */
6964 static tree
6967 {
6969 }
6971 /* Handle a "weakref" attribute; arguments as in struct
6972 attribute_spec.handler. */
6974 static tree
6977 {
6980 /* We must ignore the attribute when it is associated with
6981 local-scoped decls, since attribute alias is ignored and many
6982 such symbols do not even have a DECL_WEAK field. */
6984 || current_function_decl
6986 {
6990 }
6993 {
6997 }
6999 /* The idea here is that `weakref("name")' mutates into `weakref,
7000 alias("name")', and weakref without arguments, in turn,
7001 implicitly adds weak. */
7004 {
7011 }
7012 else
7013 {
7018 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7019 and that isn't supported; and because it wants to add it to
7020 the list of weak decls, which isn't helpful. */
7022 }
7025 }
7027 /* Handle an "visibility" attribute; arguments as in
7028 struct attribute_spec.handler. */
7030 static tree
7034 {
7040 {
7044 {
7046 name);
7048 }
7050 {
7054 }
7055 }
7057 {
7060 }
7063 {
7066 }
7068 /* If this is a type, set the visibility on the type decl. */
7070 {
7075 {
7077 name);
7079 }
7080 }
7090 else
7091 {
7092 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7094 }
7098 {
7112 }
7117 /* Go ahead and attach the attribute to the node as well. This is needed
7118 so we can determine whether we have VISIBILITY_DEFAULT because the
7119 visibility was not specified, or because it was explicitly overridden
7120 from the containing scope. */
7123 }
7125 /* Determine the ELF symbol visibility for DECL, which is either a
7126 variable or a function. It is an error to use this function if a
7127 definition of DECL is not available in this translation unit.
7128 Returns true if the final visibility has been determined by this
7129 function; false if the caller is free to make additional
7130 modifications. */
7132 bool
7134 {
7138 /* If the user explicitly specified the visibility with an
7139 attribute, honor that. DECL_VISIBILITY will have been set during
7140 the processing of the attribute. We check for an explicit
7141 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7142 to distinguish the use of an attribute from the use of a "#pragma
7143 GCC visibility push(...)"; in the latter case we still want other
7144 considerations to be able to overrule the #pragma. */
7146 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7151 /* Set default visibility to whatever the user supplied with
7152 visibility_specified depending on #pragma GCC visibility. */
7154 {
7157 {
7160 /* If visibility changed and DECL already has DECL_RTL, ensure
7161 symbol flags are updated. */
7166 }
7167 }
7169 }
7171 /* Handle an "tls_model" attribute; arguments as in
7172 struct attribute_spec.handler. */
7174 static tree
7177 {
7178 tree id;
7185 {
7188 }
7193 {
7196 }
7206 else
7207 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7211 }
7213 /* Handle a "no_instrument_function" attribute; arguments as in
7214 struct attribute_spec.handler. */
7216 static tree
7221 {
7225 {
7229 }
7231 {
7235 }
7236 else
7240 }
7242 /* Handle a "malloc" attribute; arguments as in
7243 struct attribute_spec.handler. */
7245 static tree
7248 {
7252 else
7253 {
7256 }
7259 }
7261 /* Handle a "alloc_size" attribute; arguments as in
7262 struct attribute_spec.handler. */
7264 static tree
7267 {
7270 {
7277 {
7282 }
7283 }
7285 }
7287 /* Handle a "fn spec" attribute; arguments as in
7288 struct attribute_spec.handler. */
7290 static tree
7294 {
7299 }
7301 /* Handle a "returns_twice" attribute; arguments as in
7302 struct attribute_spec.handler. */
7304 static tree
7307 {
7310 else
7311 {
7314 }
7317 }
7319 /* Handle a "no_limit_stack" attribute; arguments as in
7320 struct attribute_spec.handler. */
7322 static tree
7327 {
7331 {
7335 }
7337 {
7341 }
7342 else
7346 }
7348 /* Handle a "pure" attribute; arguments as in
7349 struct attribute_spec.handler. */
7351 static tree
7354 {
7357 /* ??? TODO: Support types. */
7358 else
7359 {
7362 }
7365 }
7367 /* Digest an attribute list destined for a transactional memory statement.
7368 ALLOWED is the set of attributes that are allowed for this statement;
7369 return the attribute we parsed. Multiple attributes are never allowed. */
7371 int
7373 {
7378 {
7386 {
7389 }
7392 {
7395 }
7398 else
7400 }
7403 }
7405 /* Transform a TM attribute name into a maskable integer and back.
7406 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
7407 to how the lack of an attribute is treated. */
7409 int
7411 {
7425 }
7427 tree
7429 {
7432 {
7450 }
7452 }
7454 /* Return the first TM attribute seen in LIST. */
7456 tree
7458 {
7460 {
7464 }
7466 }
7468 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
7469 Here we accept only function types, and verify that none of the other
7470 function TM attributes are also applied. */
7471 /* ??? We need to accept class types for C++, but not C. This greatly
7472 complicates this function, since we can no longer rely on the extra
7473 processing given by function_type_required. */
7475 static tree
7478 {
7479 /* Only one path adds the attribute; others don't. */
7483 {
7486 /* Only tm_callable and tm_safe apply to classes. */
7489 /* FALLTHRU */
7493 {
7496 ;
7499 else
7501 }
7505 {
7508 {
7513 }
7514 }
7515 /* FALLTHRU */
7518 /* If a function is next, pass it on to be tried next. */
7522 ignored:
7525 }
7528 }
7530 /* Handle the TM_WRAP attribute; arguments as in
7531 struct attribute_spec.handler. */
7533 static tree
7536 {
7539 /* We don't need the attribute even on success, since we
7540 record the entry in an external table. */
7545 else
7546 {
7552 else
7553 {
7557 {
7561 else
7563 }
7564 else
7566 }
7567 }
7570 }
7572 /* Ignore the given attribute. Used when this attribute may be usefully
7573 overridden by the target, but is not used generically. */
7575 static tree
7579 {
7582 }
7584 /* Handle a "no vops" attribute; arguments as in
7585 struct attribute_spec.handler. */
7587 static tree
7591 {
7595 }
7597 /* Handle a "deprecated" attribute; arguments as in
7598 struct attribute_spec.handler. */
7600 static tree
7604 {
7612 {
7615 }
7618 {
7629 else
7631 }
7633 {
7638 }
7639 else
7643 {
7646 {
7652 }
7655 else
7657 }
7660 }
7662 /* Handle a "vector_size" attribute; arguments as in
7663 struct attribute_spec.handler. */
7665 static tree
7669 {
7679 {
7682 }
7684 /* Get the vector size (in bytes). */
7687 /* We need to provide for vector pointers, vector arrays, and
7688 functions returning vectors. For example:
7690 __attribute__((vector_size(16))) short *foo;
7692 In this case, the mode is SI, but the type being modified is
7693 HI, so we need to look further. */
7702 /* Get the mode of the type being modified. */
7713 {
7716 }
7719 {
7722 }
7725 {
7728 }
7730 /* Calculate how many units fit in the vector. */
7733 {
7736 }
7740 /* Build back pointers if needed. */
7744 }
7746 /* Handle the "nonnull" attribute. */
7747 static tree
7751 {
7755 /* If no arguments are specified, all pointer arguments should be
7756 non-null. Verify a full prototype is given so that the arguments
7757 will have the correct types when we actually check them later. */
7759 {
7761 {
7764 }
7766 }
7768 /* Argument list specified. Verify that each argument number references
7769 a pointer argument. */
7771 {
7775 {
7780 }
7783 {
7784 function_args_iterator iter;
7785 tree argument;
7789 {
7793 }
7797 {
7802 }
7805 {
7810 }
7811 }
7812 }
7815 }
7817 /* Check the argument list of a function call for null in argument slots
7818 that are marked as requiring a non-null pointer argument. The NARGS
7819 arguments are passed in the array ARGARRAY.
7820 */
7822 static void
7824 {
7829 {
7831 {
7834 /* Walk the argument list. If we encounter an argument number we
7835 should check for non-null, do it. If the attribute has no args,
7836 then every pointer argument is checked (in which case the check
7837 for pointer type is done in check_nonnull_arg). */
7839 {
7844 }
7845 }
7846 }
7847 }
7849 /* Check that the Nth argument of a function call (counting backwards
7850 from the end) is a (pointer)0. The NARGS arguments are passed in the
7851 array ARGARRAY. */
7853 static void
7855 {
7859 {
7862 tree sentinel;
7863 function_args_iterator iter;
7864 tree t;
7866 /* Skip over the named arguments. */
7868 {
7871 len++;
7872 }
7875 {
7878 }
7880 /* The sentinel must be one of the varargs, i.e.
7881 in position >= the number of fixed arguments. */
7883 {
7887 }
7889 /* Validate the sentinel. */
7893 /* Although __null (in C++) is only an integer we allow it
7894 nevertheless, as we are guaranteed that it's exactly
7895 as wide as a pointer, and we don't want to force
7896 users to cast the NULL they have written there.
7897 We warn with -Wstrict-null-sentinel, though. */
7900 }
7901 }
7903 /* Helper for check_function_nonnull; given a list of operands which
7904 must be non-null in ARGS, determine if operand PARAM_NUM should be
7905 checked. */
7907 static bool
7909 {
7913 {
7920 }
7922 }
7924 /* Check that the function argument PARAM (which is operand number
7925 PARAM_NUM) is non-null. This is called by check_function_nonnull
7926 via check_function_arguments_recurse. */
7928 static void
7931 {
7932 /* Just skip checking the argument if it's not a pointer. This can
7933 happen if the "nonnull" attribute was given without an operand
7934 list (which means to check every pointer argument). */
7942 }
7944 /* Helper for nonnull attribute handling; fetch the operand number
7945 from the attribute argument list. */
7947 static bool
7949 {
7950 /* Verify the arg number is a constant. */
7957 }
7959 /* Handle a "nothrow" attribute; arguments as in
7960 struct attribute_spec.handler. */
7962 static tree
7965 {
7968 /* ??? TODO: Support types. */
7969 else
7970 {
7973 }
7976 }
7978 /* Handle a "cleanup" attribute; arguments as in
7979 struct attribute_spec.handler. */
7981 static tree
7984 {
7988 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7989 for global destructors in C++. This requires infrastructure that
7990 we don't have generically at the moment. It's also not a feature
7991 we'd be missing too much, since we do have attribute constructor. */
7993 {
7997 }
7999 /* Verify that the argument is a function in scope. */
8000 /* ??? We could support pointers to functions here as well, if
8001 that was considered desirable. */
8004 {
8008 }
8011 {
8015 }
8017 /* That the function has proper type is checked with the
8018 eventual call to build_function_call. */
8021 }
8023 /* Handle a "warn_unused_result" attribute. No special handling. */
8025 static tree
8029 {
8030 /* Ignore the attribute for functions not returning any value. */
8032 {
8035 }
8038 }
8040 /* Handle a "sentinel" attribute. */
8042 static tree
8045 {
8047 {
8051 }
8052 else
8053 {
8055 {
8059 }
8060 }
8063 {
8067 {
8071 }
8072 else
8073 {
8075 {
8079 }
8080 }
8081 }
8084 }
8086 /* Handle a "type_generic" attribute. */
8088 static tree
8092 {
8093 /* Ensure we have a function type. */
8096 /* Ensure we have a variadic function. */
8100 }
8102 /* Handle a "target" attribute. */
8104 static tree
8107 {
8108 /* Ensure we have a function type. */
8110 {
8113 }
8115 flags))
8119 }
8121 /* Arguments being collected for optimization. */
8128 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8129 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8130 false for #pragma GCC optimize. */
8132 bool
8134 {
8142 tree ap;
8144 /* Build up argv vector. Just in case the string is stored away, use garbage
8145 collected strings. */
8150 {
8154 {
8158 }
8161 {
8162 /* Split string into multiple substrings. */
8170 {
8177 {
8181 }
8182 else
8183 {
8186 }
8190 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8191 options. */
8193 {
8198 else
8202 }
8205 {
8208 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8209 itself is -Os, and any other switch begins with a -f. */
8215 }
8220 }
8222 }
8223 }
8233 /* Now parse the options. */
8243 /* Don't allow changing -fstrict-aliasing. */
8248 }
8250 /* For handling "optimize" attribute. arguments as in
8251 struct attribute_spec.handler. */
8253 static tree
8256 {
8257 /* Ensure we have a function type. */
8259 {
8262 }
8263 else
8264 {
8268 /* Save current options. */
8271 /* If we previously had some optimization options, use them as the
8272 default. */
8277 /* Parse options, and update the vector. */
8282 /* Restore current options. */
8284 }
8287 }
8289 /* Handle a "no_split_stack" attribute. */
8291 static tree
8296 {
8300 {
8304 }
8306 {
8310 }
8313 }
8314 \f
8315 /* Check for valid arguments being passed to a function with FNTYPE.
8316 There are NARGS arguments in the array ARGARRAY. */
8317 void
8319 {
8320 /* Check for null being passed in a pointer argument that must be
8321 non-null. We also need to do this if format checking is enabled. */
8326 /* Check for errors in format strings. */
8333 }
8335 /* Generic argument checking recursion routine. PARAM is the argument to
8336 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8337 once the argument is resolved. CTX is context for the callback. */
8338 void
8343 {
8347 {
8348 /* Strip coercion. */
8352 }
8355 {
8357 tree attrs;
8360 /* See if this is a call to a known internationalization function
8361 that modifies a format arg. Such a function may have multiple
8362 format_arg attributes (for example, ngettext). */
8365 attrs;
8368 {
8369 tree inner_arg;
8370 tree format_num_expr;
8373 call_expr_arg_iterator iter;
8375 /* Extract the argument number, which was previously checked
8376 to be valid. */
8388 {
8393 }
8394 }
8396 /* If we found a format_arg attribute and did a recursive check,
8397 we are done with checking this argument. Otherwise, we continue
8398 and this will be considered a non-literal. */
8401 }
8404 {
8405 /* Check both halves of the conditional expression. */
8411 }
8414 }
8416 /* Checks for a builtin function FNDECL that the number of arguments
8417 NARGS against the required number REQUIRED and issues an error if
8418 there is a mismatch. Returns true if the number of arguments is
8419 correct, otherwise false. */
8421 static bool
8423 {
8425 {
8429 }
8431 {
8435 }
8437 }
8439 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8440 Returns false if there was an error, otherwise true. */
8442 bool
8444 {
8450 {
8460 {
8462 {
8466 }
8468 }
8478 {
8485 {
8489 }
8491 }
8496 {
8501 {
8505 }
8508 {
8510 fndecl);
8512 }
8514 }
8519 {
8521 {
8524 }
8526 }
8531 }
8532 }
8534 /* Function to help qsort sort FIELD_DECLs by name order. */
8536 int
8538 {
8543 /* A nontype is "greater" than a type. */
8552 }
8555 gt_pointer_operator new_value;
8559 /* This routine compares two fields like field_decl_cmp but using the
8560 pointer operator in resort_data. */
8562 static int
8564 {
8569 /* A nontype is "greater" than a type. */
8575 {
8582 }
8584 }
8586 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8588 void
8591 gt_pointer_operator new_value,
8593 {
8598 resort_field_decl_cmp);
8599 }
8601 /* Subroutine of c_parse_error.
8602 Return the result of concatenating LHS and RHS. RHS is really
8603 a string literal, its first character is indicated by RHS_START and
8604 RHS_SIZE is its length (including the terminating NUL character).
8606 The caller is responsible for deleting the returned pointer. */
8610 {
8616 }
8618 /* Issue the error given by GMSGID, indicating that it occurred before
8619 TOKEN, which had the associated VALUE. */
8621 void
8624 {
8625 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8635 {
8640 {
8653 }
8657 else
8663 }
8673 {
8678 }
8686 {
8691 }
8692 else
8696 {
8699 }
8700 #undef catenate_messages
8701 }
8703 /* Mapping for cpp message reasons to the options that enable them. */
8705 struct reason_option_codes_t
8706 {
8709 };
8728 };
8730 /* Return the gcc option code associated with the reason for a cpp
8731 message, or 0 if none. */
8733 static int
8735 {
8739 {
8742 }
8744 }
8746 /* Callback from cpp_error for PFILE to print diagnostics from the
8747 preprocessor. The diagnostic is of type LEVEL, with REASON set
8748 to the reason code if LEVEL is represents a warning, at location
8749 LOCATION unless this is after lexing and the compiler's location
8750 should be used instead, with column number possibly overridden by
8751 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8752 the arguments. Returns true if a diagnostic was emitted, false
8753 otherwise. */
8755 bool
8759 {
8760 diagnostic_info diagnostic;
8761 diagnostic_t dlevel;
8766 {
8771 /* Fall through. */
8796 }
8809 }
8811 /* Convert a character from the host to the target execution character
8812 set. cpplib handles this, mostly. */
8814 HOST_WIDE_INT
8816 {
8817 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8818 zero-extended under -fno-signed-char. cpplib insists that characters
8819 and character constants are always unsigned. Hence we must convert
8820 back and forth. */
8828 else
8830 }
8832 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
8833 references with an INDIRECT_REF of a constant at the bottom; much like the
8834 traditional rendering of offsetof as a macro. Return the folded result. */
8836 tree
8838 {
8842 {
8858 {
8861 }
8871 {
8875 }
8889 /* Check if the offset goes beyond the upper bound of the array. */
8891 {
8897 {
8901 {
8902 tree v;
8909 {
8917 }
8918 /* Don't warn if the array might be considered a poor
8919 man's flexible array member with a very permissive
8920 definition thereof. */
8924 "index %E denotes an offset "
8927 }
8928 }
8929 }
8936 /* Handle static members of volatile structs. */
8943 }
8946 }
8948 /* Likewise, but convert it to the return type of offsetof. */
8950 tree
8952 {
8954 }
8956 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
8957 expression, because B will always be true. */
8959 void
8961 {
8964 "the omitted middle operand in ?: will always be %<true%>, "
8966 }
8968 /* Give an error for storing into ARG, which is 'const'. USE indicates
8969 how ARG was being used. */
8971 void
8973 {
8976 /* Using this macro rather than (for example) arrays of messages
8977 ensures that all the format strings are checked at compile
8978 time. */
8979 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
8980 : (use == lv_increment ? (I) \
8981 : (use == lv_decrement ? (D) : (AS))))
8983 {
8994 else
9000 }
9006 arg);
9012 arg);
9014 {
9024 arg);
9025 }
9031 arg);
9032 else
9037 arg);
9038 }
9040 /* Print an error message for an invalid lvalue. USE says
9041 how the lvalue is being used and so selects the error message. LOC
9042 is the location for the error. */
9044 void
9046 {
9048 {
9066 }
9067 }
9069 /* Print an error message for an invalid indirection of type TYPE.
9070 ERRSTRING is the name of the operator for the indirection. */
9072 void
9074 {
9076 {
9084 type);
9089 type);
9094 type);
9099 type);
9103 }
9104 }
9105 \f
9106 /* *PTYPE is an incomplete array. Complete it with a domain based on
9107 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9108 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9109 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9111 int
9113 {
9120 {
9122 {
9123 int eltsize
9126 }
9128 {
9132 {
9136 }
9137 else
9138 {
9139 tree curindex;
9152 cnt++)
9153 {
9157 else
9158 {
9162 size_one_node);
9163 }
9166 }
9169 }
9170 }
9171 else
9172 {
9173 /* Make an error message unless that happened already. */
9176 }
9177 }
9178 else
9179 {
9183 }
9190 else
9193 /* Using build_distinct_type_copy and modifying things afterward instead
9194 of using build_array_type to create a new type preserves all of the
9195 TYPE_LANG_FLAG_? bits that the front end may have set. */
9203 /* Make sure we have the canonical MAIN_TYPE. */
9206 hashcode);
9209 /* Fix the canonical type. */
9219 else
9224 else
9230 {
9232 /* If we proceed with the array type as it is, we'll eventually
9233 crash in tree_low_cst(). */
9235 }
9239 }
9241 /* Like c_mark_addressable but don't check register qualifier. */
9242 void
9244 {
9250 }
9253 \f
9254 /* Used to help initialize the builtin-types.def table. When a type of
9255 the correct size doesn't exist, use error_mark_node instead of NULL.
9256 The later results in segfaults even when a decl using the type doesn't
9257 get invoked. */
9259 tree
9261 {
9264 }
9266 /* A helper function for resolve_overloaded_builtin in resolving the
9267 overloaded __sync_ builtins. Returns a positive power of 2 if the
9268 first operand of PARAMS is a pointer to a supported data type.
9269 Returns 0 if an error is encountered. */
9271 static int
9273 {
9274 tree type;
9278 {
9281 }
9295 incompatible:
9298 }
9300 /* A helper function for resolve_overloaded_builtin. Adds casts to
9301 PARAMS to make arguments match up with those of FUNCTION. Drops
9302 the variadic arguments at the end. Returns false if some error
9303 was encountered; true on success. */
9305 static bool
9308 {
9309 function_args_iterator iter;
9310 tree ptype;
9314 /* We've declared the implementation functions to use "volatile void *"
9315 as the pointer parameter, so we shouldn't get any complaints from the
9316 call to check_function_arguments what ever type the user used. */
9320 /* For the rest of the values, we need to cast these to FTYPE, so that we
9321 don't get warnings for passing pointer types, etc. */
9324 {
9328 /* XXX void_type_node belies the abstraction. */
9334 {
9337 }
9339 /* Only convert parameters if arg_type is unsigned integer type with
9340 new format sync routines, i.e. don't attempt to convert pointer
9341 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9342 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9343 kinds). */
9345 {
9346 /* Ideally for the first conversion we'd use convert_for_assignment
9347 so that we get warnings for anything that doesn't match the pointer
9348 type. This isn't portable across the C and C++ front ends atm. */
9353 }
9356 }
9358 /* __atomic routines are not variadic. */
9360 {
9363 }
9365 /* The definition of these primitives is variadic, with the remaining
9366 being "an optional list of variables protected by the memory barrier".
9367 No clue what that's supposed to mean, precisely, but we consider all
9368 call-clobbered variables to be protected so we're safe. */
9372 }
9374 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9375 RESULT to make it match the type of the first pointer argument in
9376 PARAMS. */
9378 static tree
9380 {
9385 /* New format doesn't require casting unless the types are the same size. */
9388 else
9390 }
9392 /* This function verifies the PARAMS to generic atomic FUNCTION.
9393 It returns the size if all the parameters are the same size, otherwise
9394 0 is returned if the parameters are invalid. */
9396 static int
9398 {
9403 tree type_0;
9405 /* Determine the parameter makeup. */
9407 {
9423 }
9426 {
9429 }
9431 /* Get type of first parameter, and determine its size. */
9434 {
9436 function);
9438 }
9440 /* Types must be compile time constant sizes. */
9442 {
9445 function);
9447 }
9451 /* Zero size objects are not allowed. */
9453 {
9456 function);
9458 }
9460 /* Check each other parameter is a pointer and the same size. */
9462 {
9465 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
9469 {
9471 function);
9473 }
9476 {
9478 function);
9480 }
9481 }
9483 /* Check memory model parameters for validity. */
9485 {
9488 {
9491 {
9494 function);
9495 }
9496 }
9497 else
9499 {
9501 function);
9503 }
9504 }
9507 }
9510 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
9511 at the beginning of the parameter list PARAMS representing the size of the
9512 objects. This is to match the library ABI requirement. LOC is the location
9513 of the function call.
9514 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
9515 returned to allow the external call to be constructed. */
9517 static tree
9520 {
9521 tree size_node;
9523 /* Insert a SIZE_T parameter as the first param. If there isn't
9524 enough space, allocate a new vector and recursively re-build with that. */
9526 {
9529 tree f;
9538 }
9540 /* Add the size parameter and leave as a function call for processing. */
9544 }
9547 /* This will process an __atomic_exchange function call, determine whether it
9548 needs to be mapped to the _N variation, or turned into a library call.
9549 LOC is the location of the builtin call.
9550 FUNCTION is the DECL that has been invoked;
9551 PARAMS is the argument list for the call. The return value is non-null
9552 TRUE is returned if it is translated into the proper format for a call to the
9553 external library, and NEW_RETURN is set the tree for that function.
9554 FALSE is returned if processing for the _N variation is required, and
9555 NEW_RETURN is set to the the return value the result is copied into. */
9556 static bool
9559 {
9564 /* Size of 0 is an error condition. */
9566 {
9569 }
9571 /* If not a lock-free size, change to the library generic format. */
9573 {
9576 }
9578 /* Otherwise there is a lockfree match, transform the call from:
9579 void fn(T* mem, T* desired, T* return, model)
9580 into
9581 *return = (T) (fn (In* mem, (In) *desired, model)) */
9588 /* Create pointer to appropriate size. */
9592 /* Convert object pointer to required type. */
9595 /* Convert new value to required type, and dereference it. */
9600 /* Move memory model to the 3rd position, and end param list. */
9604 /* Convert return pointer and dereference it for later assignment. */
9608 }
9611 /* This will process an __atomic_compare_exchange function call, determine
9612 whether it needs to be mapped to the _N variation, or turned into a lib call.
9613 LOC is the location of the builtin call.
9614 FUNCTION is the DECL that has been invoked;
9615 PARAMS is the argument list for the call. The return value is non-null
9616 TRUE is returned if it is translated into the proper format for a call to the
9617 external library, and NEW_RETURN is set the tree for that function.
9618 FALSE is returned if processing for the _N variation is required. */
9620 static bool
9624 {
9629 /* Size of 0 is an error condition. */
9631 {
9634 }
9636 /* If not a lock-free size, change to the library generic format. */
9638 {
9639 /* The library generic format does not have the weak parameter, so
9640 remove it from the param list. Since a parameter has been removed,
9641 we can be sure that there is room for the SIZE_T parameter, meaning
9642 there will not be a recursive rebuilding of the parameter list, so
9643 there is no danger this will be done twice. */
9645 {
9649 }
9652 }
9654 /* Otherwise, there is a match, so the call needs to be transformed from:
9655 bool fn(T* mem, T* desired, T* return, weak, success, failure)
9656 into
9657 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
9663 /* Create pointer to appropriate size. */
9667 /* Convert object pointer to required type. */
9671 /* Convert expected pointer to required type. */
9675 /* Convert desired value to required type, and dereference it. */
9680 /* The rest of the parameters are fine. NULL means no special return value
9681 processing.*/
9684 }
9687 /* This will process an __atomic_load function call, determine whether it
9688 needs to be mapped to the _N variation, or turned into a library call.
9689 LOC is the location of the builtin call.
9690 FUNCTION is the DECL that has been invoked;
9691 PARAMS is the argument list for the call. The return value is non-null
9692 TRUE is returned if it is translated into the proper format for a call to the
9693 external library, and NEW_RETURN is set the tree for that function.
9694 FALSE is returned if processing for the _N variation is required, and
9695 NEW_RETURN is set to the the return value the result is copied into. */
9697 static bool
9700 {
9705 /* Size of 0 is an error condition. */
9707 {
9710 }
9712 /* If not a lock-free size, change to the library generic format. */
9714 {
9717 }
9719 /* Otherwise, there is a match, so the call needs to be transformed from:
9720 void fn(T* mem, T* return, model)
9721 into
9722 *return = (T) (fn ((In *) mem, model)) */
9728 /* Create pointer to appropriate size. */
9732 /* Convert object pointer to required type. */
9736 /* Move memory model to the 2nd position, and end param list. */
9740 /* Convert return pointer and dereference it for later assignment. */
9744 }
9747 /* This will process an __atomic_store function call, determine whether it
9748 needs to be mapped to the _N variation, or turned into a library call.
9749 LOC is the location of the builtin call.
9750 FUNCTION is the DECL that has been invoked;
9751 PARAMS is the argument list for the call. The return value is non-null
9752 TRUE is returned if it is translated into the proper format for a call to the
9753 external library, and NEW_RETURN is set the tree for that function.
9754 FALSE is returned if processing for the _N variation is required, and
9755 NEW_RETURN is set to the the return value the result is copied into. */
9757 static bool
9760 {
9765 /* Size of 0 is an error condition. */
9767 {
9770 }
9772 /* If not a lock-free size, change to the library generic format. */
9774 {
9777 }
9779 /* Otherwise, there is a match, so the call needs to be transformed from:
9780 void fn(T* mem, T* value, model)
9781 into
9782 fn ((In *) mem, (In) *value, model) */
9787 /* Create pointer to appropriate size. */
9791 /* Convert object pointer to required type. */
9795 /* Convert new value to required type, and dereference it. */
9800 /* The memory model is in the right spot already. Return is void. */
9804 }
9807 /* Some builtin functions are placeholders for other expressions. This
9808 function should be called immediately after parsing the call expression
9809 before surrounding code has committed to the type of the expression.
9811 LOC is the location of the builtin call.
9813 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
9814 PARAMS is the argument list for the call. The return value is non-null
9815 when expansion is complete, and null if normal processing should
9816 continue. */
9818 tree
9820 {
9826 {
9832 else
9836 }
9838 /* Handle BUILT_IN_NORMAL here. */
9840 {
9845 {
9846 /* Handle these 4 together so that they can fall through to the next
9847 case if the call is transformed to an _N variant. */
9849 {
9851 {
9855 /* Change to the _N variant. */
9858 }
9861 {
9863 params,
9866 /* Change to the _N variant. */
9869 }
9871 {
9875 /* Change to the _N variant. */
9878 }
9880 {
9884 /* Change to the _N variant. */
9887 }
9890 }
9891 /* Fallthrough to the normal processing. */
9892 }
9909 {
9911 /* Fallthru for parameter processing. */
9912 }
9929 {
9940 orig_format))
9952 /* If new_return is set, assign function to that expr and cast the
9953 result to void since the generic interface returned void. */
9955 {
9956 /* Cast function result from I{1,2,4,8,16} to the required type. */
9959 result);
9963 }
9965 }
9969 }
9970 }
9972 /* Ignoring their sign, return true if two scalar types are the same. */
9973 bool
9975 {
9982 /* Equality works here because c_common_signed_type uses
9983 TYPE_MAIN_VARIANT. */
9986 }
9988 /* Check for missing format attributes on function pointers. LTYPE is
9989 the new type or left-hand side type. RTYPE is the old type or
9990 right-hand side type. Returns TRUE if LTYPE is missing the desired
9991 attribute. */
9993 bool
9995 {
9997 tree ra;
10003 {
10004 tree la;
10009 }
10010 else
10012 }
10014 /* Subscripting with type char is likely to lose on a machine where
10015 chars are signed. So warn on any machine, but optionally. Don't
10016 warn for unsigned char since that type is safe. Don't warn for
10017 signed char because anyone who uses that must have done so
10018 deliberately. Furthermore, we reduce the false positive load by
10019 warning only for non-constant value of type char. */
10021 void
10023 {
10027 }
10029 /* Implement -Wparentheses for the unexpected C precedence rules, to
10030 cover cases like x + y << z which readers are likely to
10031 misinterpret. We have seen an expression in which CODE is a binary
10032 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10033 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10034 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10035 expression was not formed using a binary or unary operator, or it
10036 was enclosed in parentheses. */
10038 void
10042 {
10046 /* This macro tests that the expression ARG with original tree code
10047 CODE appears to be a boolean expression. or the result of folding a
10048 boolean expression. */
10049 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10050 (truth_value_p (TREE_CODE (ARG)) \
10051 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10053 || ((CODE) != INTEGER_CST \
10054 && (integer_onep (ARG) || integer_zerop (ARG))))
10057 {
10089 /* Check cases like x|y==z */
10094 /* Check cases like !x | y */
10108 /* Check cases like x^y==z */
10122 /* Check cases like x&y==z */
10127 /* Check cases like !x & y */
10158 }
10159 #undef NOT_A_BOOLEAN_EXPR_P
10160 }
10162 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10164 void
10166 {
10168 {
10171 else
10173 }
10174 }
10176 /* Warn for division by zero according to the value of DIVISOR. LOC
10177 is the location of the division operator. */
10179 void
10181 {
10182 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10183 about division by zero. Do not issue a warning if DIVISOR has a
10184 floating-point type, since we consider 0.0/0.0 a valid way of
10185 generating a NaN. */
10189 }
10191 /* Subroutine of build_binary_op. Give warnings for comparisons
10192 between signed and unsigned quantities that may fail. Do the
10193 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10194 so that casts will be considered, but default promotions won't
10195 be.
10197 LOCATION is the location of the comparison operator.
10199 The arguments of this function map directly to local variables
10200 of build_binary_op. */
10202 void
10207 {
10212 /* In C++, check for comparison of different enum types. */
10218 {
10222 }
10224 /* Do not warn if the comparison is being done in a signed type,
10225 since the signed type will only be chosen if it can represent
10226 all the values of the unsigned type. */
10229 /* Do not warn if both operands are unsigned. */
10232 else
10233 {
10239 else
10247 /* Do not warn if the signed quantity is an unsuffixed integer
10248 literal (or some static constant expression involving such
10249 literals or a conditional expression involving such literals)
10250 and it is non-negative. */
10253 /* Do not warn if the comparison is an equality operation, the
10254 unsigned quantity is an integral constant, and it would fit
10255 in the result if the result were signed. */
10260 /* In C, do not warn if the unsigned quantity is an enumeration
10261 constant and its maximum value would fit in the result if the
10262 result were signed. */
10268 else
10270 OPT_Wsign_compare,
10272 }
10274 /* Warn if two unsigned values are being compared in a size larger
10275 than their original size, and one (and only one) is the result of
10276 a `~' operator. This comparison will always fail.
10278 Also warn if one operand is a constant, and the constant does not
10279 have all bits set that are set in the ~ operand when it is
10280 extended. */
10287 {
10294 {
10295 tree primop;
10301 {
10305 }
10306 else
10307 {
10311 }
10316 {
10319 {
10323 else
10326 }
10327 }
10328 }
10336 }
10337 }
10339 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
10340 type via c_common_type. If -Wdouble-promotion is in use, and the
10341 conditions for warning have been met, issue a warning. GMSGID is
10342 the warning message. It must have two %T specifiers for the type
10343 that was converted (generally "float") and the type to which it was
10344 converted (generally "double), respectively. LOC is the location
10345 to which the awrning should refer. */
10347 void
10350 {
10351 tree source_type;
10355 /* If the conversion will not occur at run-time, there is no need to
10356 warn about it. */
10368 else
10371 }
10373 /* Setup a TYPE_DECL node as a typedef representation.
10375 X is a TYPE_DECL for a typedef statement. Create a brand new
10376 ..._TYPE node (which will be just a variant of the existing
10377 ..._TYPE node with identical properties) and then install X
10378 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
10380 The whole point here is to end up with a situation where each
10381 and every ..._TYPE node the compiler creates will be uniquely
10382 associated with AT MOST one node representing a typedef name.
10383 This way, even though the compiler substitutes corresponding
10384 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
10385 early on, later parts of the compiler can always do the reverse
10386 translation and get back the corresponding typedef name. For
10387 example, given:
10389 typedef struct S MY_TYPE;
10390 MY_TYPE object;
10392 Later parts of the compiler might only know that `object' was of
10393 type `struct S' if it were not for code just below. With this
10394 code however, later parts of the compiler see something like:
10396 struct S' == struct S
10397 typedef struct S' MY_TYPE;
10398 struct S' object;
10400 And they can then deduce (from the node for type struct S') that
10401 the original object declaration was:
10403 MY_TYPE object;
10405 Being able to do this is important for proper support of protoize,
10406 and also for generating precise symbolic debugging information
10407 which takes full account of the programmer's (typedef) vocabulary.
10409 Obviously, we don't want to generate a duplicate ..._TYPE node if
10410 the TYPE_DECL node that we are now processing really represents a
10411 standard built-in type. */
10413 void
10415 {
10419 {
10422 }
10425 {
10433 }
10434 }
10436 /* Record the types used by the current global variable declaration
10437 being parsed, so that we can decide later to emit their debug info.
10438 Those types are in types_used_by_cur_var_decl, and we are going to
10439 store them in the types_used_by_vars_hash hash table.
10440 DECL is the declaration of the global variable that has been parsed. */
10442 void
10444 {
10448 {
10451 }
10452 }
10454 /* If DECL is a typedef that is declared in the current function,
10455 record it for the purpose of -Wunused-local-typedefs. */
10457 void
10459 {
10464 /* if this is not a locally defined typedef then we are not
10465 interested. */
10472 }
10474 /* If T is a TYPE_DECL declared locally, mark it as used. */
10476 void
10478 {
10483 }
10485 /* Warn if there are some unused locally defined typedefs in the
10486 current function. */
10488 void
10490 {
10492 tree decl;
10493 /* The number of times we have emitted -Wunused-local-typedefs
10494 warnings. If this is different from errorcount, that means some
10495 unrelated errors have been issued. In which case, we'll avoid
10496 emitting "unused-local-typedefs" warnings. */
10508 {
10512 OPT_Wunused_local_typedefs,
10515 }
10518 {
10521 }
10522 }
10524 /* The C and C++ parsers both use vectors to hold function arguments.
10525 For efficiency, we keep a cache of unused vectors. This is the
10526 cache. */
10533 /* Return a new vector from the cache. If the cache is empty,
10534 allocate a new vector. These vectors are GC'ed, so it is OK if the
10535 pointer is not released.. */
10539 {
10542 else
10543 {
10544 /* Passing 0 to VEC_alloc returns NULL, and our callers require
10545 that we always return a non-NULL value. The vector code uses
10546 4 when growing a NULL vector, so we do too. */
10548 }
10549 }
10551 /* Release a vector of trees back to the cache. */
10553 void
10555 {
10557 {
10560 }
10561 }
10563 /* Get a new tree vector holding a single tree. */
10567 {
10571 }
10573 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
10577 {
10582 }
10584 /* Get a new tree vector which is a copy of an existing one. */
10588 {
10591 tree t;
10598 }
10600 /* Return true if KEYWORD starts a type specifier. */
10602 bool
10604 {
10606 {
10636 }
10637 }
10639 /* Return true if KEYWORD names a type qualifier. */
10641 bool
10643 {
10645 {
10652 }
10653 }
10655 /* Return true if KEYWORD names a storage class specifier.
10657 RID_TYPEDEF is not included in this list despite `typedef' being
10658 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
10659 such for syntactic convenience only. */
10661 bool
10663 {
10665 {
10675 }
10676 }
10678 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
10680 static bool
10682 {
10684 {
10692 }
10693 }
10695 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
10696 declaration-specifier (C99 6.7). */
10698 bool
10700 {
10707 {
10714 }
10715 }
10717 /* Initialize language-specific-bits of tree_contains_struct. */
10719 void
10721 {
10724 }
10726 /* Build a user-defined numeric literal out of an integer constant type VALUE
10727 with identifier SUFFIX. */
10729 tree
10731 {
10737 }