| blob | cf2fe17ee66f5ff42de1154d0b96da53defa5220 |
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
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/>. */
51 /* The following symbols are subsumed in the c_global_trees array, and
52 listed here individually for documentation purposes.
54 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
56 tree short_integer_type_node;
57 tree long_integer_type_node;
58 tree long_long_integer_type_node;
59 tree int128_integer_type_node;
61 tree short_unsigned_type_node;
62 tree long_unsigned_type_node;
63 tree long_long_unsigned_type_node;
64 tree int128_unsigned_type_node;
66 tree truthvalue_type_node;
67 tree truthvalue_false_node;
68 tree truthvalue_true_node;
70 tree ptrdiff_type_node;
72 tree unsigned_char_type_node;
73 tree signed_char_type_node;
74 tree wchar_type_node;
76 tree char16_type_node;
77 tree char32_type_node;
79 tree float_type_node;
80 tree double_type_node;
81 tree long_double_type_node;
83 tree complex_integer_type_node;
84 tree complex_float_type_node;
85 tree complex_double_type_node;
86 tree complex_long_double_type_node;
88 tree dfloat32_type_node;
89 tree dfloat64_type_node;
90 tree_dfloat128_type_node;
92 tree intQI_type_node;
93 tree intHI_type_node;
94 tree intSI_type_node;
95 tree intDI_type_node;
96 tree intTI_type_node;
98 tree unsigned_intQI_type_node;
99 tree unsigned_intHI_type_node;
100 tree unsigned_intSI_type_node;
101 tree unsigned_intDI_type_node;
102 tree unsigned_intTI_type_node;
104 tree widest_integer_literal_type_node;
105 tree widest_unsigned_literal_type_node;
107 Nodes for types `void *' and `const void *'.
109 tree ptr_type_node, const_ptr_type_node;
111 Nodes for types `char *' and `const char *'.
113 tree string_type_node, const_string_type_node;
115 Type `char[SOMENUMBER]'.
116 Used when an array of char is needed and the size is irrelevant.
118 tree char_array_type_node;
120 Type `int[SOMENUMBER]' or something like it.
121 Used when an array of int needed and the size is irrelevant.
123 tree int_array_type_node;
125 Type `wchar_t[SOMENUMBER]' or something like it.
126 Used when a wide string literal is created.
128 tree wchar_array_type_node;
130 Type `char16_t[SOMENUMBER]' or something like it.
131 Used when a UTF-16 string literal is created.
133 tree char16_array_type_node;
135 Type `char32_t[SOMENUMBER]' or something like it.
136 Used when a UTF-32 string literal is created.
138 tree char32_array_type_node;
140 Type `int ()' -- used for implicit declaration of functions.
142 tree default_function_type;
144 A VOID_TYPE node, packaged in a TREE_LIST.
146 tree void_list_node;
148 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
149 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
150 VAR_DECLS, but C++ does.)
152 tree function_name_decl_node;
153 tree pretty_function_name_decl_node;
154 tree c99_function_name_decl_node;
156 Stack of nested function name VAR_DECLs.
158 tree saved_function_name_decls;
160 */
163 \f
164 /* Switches common to the C front ends. */
166 /* Nonzero means don't output line number information. */
170 /* Nonzero causes -E output not to be done, but directives such as
171 #define that have side effects are still obeyed. */
175 /* Nonzero means dump macros in some fashion. */
179 /* Nonzero means pass #include lines through to the output. */
183 /* Nonzero means process PCH files while preprocessing. */
187 /* The file name to which we should write a precompiled header, or
188 NULL if no header will be written in this compile. */
192 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 user's namespace. */
196 /* Warn about #pragma directives that are not recognized. */
200 /* Warn about format/argument anomalies in calls to formatted I/O functions
201 (*printf, *scanf, strftime, strfmon, etc.). */
205 /* C/ObjC language option variables. */
208 /* Nonzero means allow type mismatches in conditional expressions;
209 just make their values `void'. */
213 /* Nonzero means enable C89 Amendment 1 features. */
217 /* Nonzero means use the ISO C99 (or C1X) dialect of C. */
221 /* Nonzero means use the ISO C1X dialect of C. */
225 /* Nonzero means that we have builtin functions, and main is an int. */
230 /* ObjC language option variables. */
233 /* Tells the compiler that this is a special run. Do not perform any
234 compiling, instead we are to test some platform dependent features
235 and output a C header file with appropriate definitions. */
239 /* Tells the compiler what is the constant string class for ObjC. */
244 /* C++ language option variables. */
247 /* Nonzero means generate separate instantiation control files and
248 juggle them at link time. */
252 /* The C++ dialect being used. C++98 is the default. */
256 /* Maximum template instantiation depth. This limit exists to limit the
257 time it takes to notice infinite template instantiations; the default
258 value of 1024 is likely to be in the next C++ standard. */
264 /* The elements of `ridpointers' are identifier nodes for the reserved
265 type names and storage classes. It is indexed by a RID_... value. */
270 /* Nonzero means don't warn about problems that occur when the code is
271 executed. */
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
278 /* Information about how a function name is generated. */
279 struct fname_var_t
280 {
284 };
286 /* The three ways of getting then name of the current function. */
289 {
290 /* C99 compliant __func__, must be first. */
292 /* GCC __FUNCTION__ compliant. */
294 /* GCC __PRETTY_FUNCTION__ compliant. */
297 };
368 /* Reserved words. The third field is a mask: keywords are disabled
369 if they match the mask.
371 Masks for languages:
372 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
373 C --std=c99: D_CXXONLY | D_OBJC
374 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
375 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
376 C++ --std=c0x: D_CONLY | D_OBJC
377 ObjC++ is like C++ except that D_OBJC is not set
379 If -fno-asm is used, D_ASM is added to the mask. If
380 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
381 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
382 In C with -Wc++-compat, we warn if D_CXXWARN is set. */
385 {
525 /* These Objective-C keywords are recognized only immediately after
526 an '@'. */
537 /* These are recognized only in protocol-qualifier context
538 (see above) */
545 };
550 /* Table of machine-independent attributes common to all C-like languages. */
552 {
553 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
555 handle_packed_attribute },
557 handle_nocommon_attribute },
559 handle_common_attribute },
560 /* FIXME: logically, noreturn attributes should be listed as
561 "false, true, true" and apply to function types. But implementing this
562 would require all the places in the compiler that use TREE_THIS_VOLATILE
563 on a decl to identify non-returning functions to be located and fixed
564 to check the function type instead. */
566 handle_noreturn_attribute },
568 handle_noreturn_attribute },
570 handle_noinline_attribute },
572 handle_noclone_attribute },
574 handle_always_inline_attribute },
576 handle_gnu_inline_attribute },
578 handle_artificial_attribute },
580 handle_flatten_attribute },
582 handle_used_attribute },
584 handle_unused_attribute },
586 handle_externally_visible_attribute },
587 /* The same comments as for noreturn attributes apply to const ones. */
589 handle_const_attribute },
591 handle_transparent_union_attribute },
593 handle_constructor_attribute },
595 handle_destructor_attribute },
597 handle_mode_attribute },
599 handle_section_attribute },
601 handle_aligned_attribute },
603 handle_weak_attribute },
605 handle_ifunc_attribute },
607 handle_alias_attribute },
609 handle_weakref_attribute },
611 handle_no_instrument_function_attribute },
613 handle_malloc_attribute },
615 handle_returns_twice_attribute },
617 handle_no_limit_stack_attribute },
619 handle_pure_attribute },
620 /* For internal use (marking of builtins) only. The name contains space
621 to prevent its usage in source code. */
623 handle_novops_attribute },
625 handle_deprecated_attribute },
627 handle_vector_size_attribute },
629 handle_visibility_attribute },
631 handle_tls_model_attribute },
633 handle_nonnull_attribute },
635 handle_nothrow_attribute },
638 handle_cleanup_attribute },
640 handle_warn_unused_result_attribute },
642 handle_sentinel_attribute },
643 /* For internal use (marking of builtins) only. The name contains space
644 to prevent its usage in source code. */
646 handle_type_generic_attribute },
648 handle_alloc_size_attribute },
650 handle_cold_attribute },
652 handle_hot_attribute },
654 handle_error_attribute },
656 handle_error_attribute },
658 handle_target_attribute },
660 handle_optimize_attribute },
661 /* For internal use (marking of builtins and runtime functions) only.
662 The name contains space to prevent its usage in source code. */
664 handle_fnspec_attribute },
666 };
668 /* Give the specifications for the format attributes, used by C and all
669 descendants. */
672 {
673 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
675 handle_format_attribute },
677 handle_format_arg_attribute },
679 };
681 /* Return identifier for address space AS. */
685 {
689 }
691 /* Push current bindings for the function name VAR_DECLS. */
693 void
695 {
700 {
704 {
707 }
708 }
710 /* Normally they'll have been NULL, so only push if we've got a
711 stack, or they are non-NULL. */
713 saved_function_name_decls);
714 }
716 /* Finish up the current bindings, adding them into the current function's
717 statement tree. This must be done _before_ finish_stmt_tree is called.
718 If there is no current function, we must be at file scope and no statements
719 are involved. Pop the previous bindings. */
721 void
723 {
732 {
740 }
746 {
747 /* We had saved values, restore them. */
748 tree saved;
751 {
756 }
758 }
760 }
762 /* Return the text name of the current function, suitably prettified
763 by PRETTY_P. Return string must be freed by caller. */
767 {
774 {
777 }
790 {
793 }
796 }
798 /* Return the VAR_DECL for a const char array naming the current
799 function. If the VAR_DECL has not yet been created, create it
800 now. RID indicates how it should be formatted and IDENTIFIER_NODE
801 ID is its name (unfortunately C and C++ hold the RID values of
802 keywords in different places, so we can't derive RID from ID in
803 this language independent code. LOC is the location of the
804 function. */
806 tree
808 {
818 {
819 /* If a tree is built here, it would normally have the lineno of
820 the current statement. Later this tree will be moved to the
821 beginning of the function and this line number will be wrong.
822 To avoid this problem set the lineno to 0 here; that prevents
823 it from appearing in the RTL. */
824 tree stmts;
832 saved_function_name_decls
836 }
841 }
843 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
845 tree
847 {
852 /* Compute the number of elements, for the array type. */
854 {
857 }
859 {
862 }
864 {
867 }
868 else
869 {
872 }
874 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
875 limit in C++98 Annex B is very large (65536) and is not normative,
876 so we do not diagnose it (warn_overlength_strings is forced off
877 in c_common_post_options). */
879 {
883 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
884 separate the %d from the 'C'. 'ISO' should not be
885 translated, but it may be moved after 'C%d' in languages
886 where modifiers follow nouns. */
888 "string length %qd is greater than the length %qd "
891 }
893 /* Create the array type for the string constant. The ISO C++
894 standard says that a string literal has type `const char[N]' or
895 `const wchar_t[N]'. We use the same logic when invoked as a C
896 front-end with -Wwrite-strings.
897 ??? We should change the type of an expression depending on the
898 state of a warning flag. We should just be warning -- see how
899 this is handled in the C++ front-end for the deprecated implicit
900 conversion from string literals to `char*' or `wchar_t*'.
902 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
903 array type being the unqualified version of that type.
904 Therefore, if we are constructing an array of const char, we must
905 construct the matching unqualified array type first. The C front
906 end does not require this, but it does no harm, so we do it
907 unconditionally. */
918 }
919 \f
920 /* Fully fold EXPR, an expression that was not folded (beyond integer
921 constant expressions and null pointer constants) when being built
922 up. If IN_INIT, this is in a static initializer and certain
923 changes are made to the folding done. Clear *MAYBE_CONST if
924 MAYBE_CONST is not NULL and EXPR is definitely not a constant
925 expression because it contains an evaluated operator (in C99) or an
926 operator outside of sizeof returning an integer constant (in C90)
927 not permitted in constant expressions, or because it contains an
928 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
929 set to true by callers before calling this function.) Return the
930 folded expression. Function arguments have already been folded
931 before calling this function, as have the contents of SAVE_EXPR,
932 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
933 C_MAYBE_CONST_EXPR. */
935 tree
937 {
938 tree ret;
944 /* This function is not relevant to C++ because C++ folds while
945 parsing, and may need changes to be correct for C++ when C++
946 stops folding while parsing. */
953 {
956 }
963 }
965 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
966 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
967 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
968 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
969 both evaluated and unevaluated subexpressions while
970 *MAYBE_CONST_ITSELF is carried from only evaluated
971 subexpressions). */
973 static tree
976 {
988 /* This function is not relevant to C++ because C++ folds while
989 parsing, and may need changes to be correct for C++ when C++
990 stops folding while parsing. */
994 /* Constants, declarations, statements, errors, SAVE_EXPRs and
995 anything else not counted as an expression cannot usefully be
996 folded further at this point. */
1002 /* Operands of variable-length expressions (function calls) have
1003 already been folded, as have __builtin_* function calls, and such
1004 expressions cannot occur in constant expressions. */
1006 {
1010 }
1013 {
1022 else
1025 }
1027 /* Assignment, increment, decrement, function call and comma
1028 operators, and statement expressions, cannot occur in constant
1029 expressions if evaluated / outside of sizeof. (Function calls
1030 were handled above, though VA_ARG_EXPR is treated like a function
1031 call here, and statement expressions are handled through
1032 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1034 {
1054 }
1056 /* Fold individual tree codes as appropriate. */
1058 {
1060 /* Any non-constancy will have been marked in a containing
1061 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1069 maybe_const_itself);
1074 {
1077 }
1086 maybe_const_itself);
1089 maybe_const_itself);
1095 {
1099 }
1141 /* Binary operations evaluating both arguments (increment and
1142 decrement are binary internally in GCC). */
1146 maybe_const_itself);
1154 /* The RHS of a MODIFY_EXPR was fully folded when building that
1155 expression for the sake of conversion warnings. */
1158 maybe_const_itself);
1162 ret = in_init
1165 else
1176 CASE_CONVERT:
1185 /* Unary operations. */
1188 maybe_const_itself);
1193 ret = in_init
1196 else
1201 {
1205 }
1207 {
1210 CASE_CONVERT:
1211 /* Don't warn about explicit conversions. We will already
1212 have warned about suspect implicit conversions. */
1219 }
1224 /* Binary operations not necessarily evaluating both
1225 arguments. */
1232 ? truthvalue_false_node
1240 ret = in_init
1243 else
1248 && op0_const
1249 && op0_const_self
1255 && op0_const_self
1281 else
1286 && op0_const
1287 && op0_const_self
1291 && op0_const_self
1295 && op0_const
1296 && op0_const_self
1300 && op0_const_self
1306 /* Each case where an operand with excess precision may be
1307 encountered must remove the EXCESS_PRECISION_EXPR around
1308 inner operands and possibly put one around the whole
1309 expression or possibly convert to the semantic type (which
1310 c_fully_fold does); we cannot tell at this stage which is
1311 appropriate in any particular case. */
1315 /* Various codes may appear through folding built-in functions
1316 and their arguments. */
1318 }
1320 out:
1321 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1322 have been done by this point, so remove them again. */
1326 {
1330 }
1334 }
1336 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1337 return EXP. Otherwise, return either EXP or its known constant
1338 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1339 Is the BLKmode test appropriate? */
1341 tree
1343 {
1344 tree ret;
1346 /* This function is only used by C, for c_fully_fold and other
1347 optimization, and may not be correct for C++. */
1358 /* Avoid unwanted tree sharing between the initializer and current
1359 function's body where the tree can be modified e.g. by the
1360 gimplifier. */
1364 }
1366 /* Print a warning if a constant expression had overflow in folding.
1367 Invoke this function on every expression that the language
1368 requires to be a constant expression.
1369 Note the ANSI C standard says it is erroneous for a
1370 constant expression to overflow. */
1372 void
1374 {
1382 }
1384 /* The same as above but print an unconditional error. */
1385 void
1387 {
1394 }
1396 /* Print a warning if an expression had overflow in folding and its
1397 operands hadn't.
1399 Invoke this function on every expression that
1400 (1) appears in the source code, and
1401 (2) is a constant expression that overflowed, and
1402 (3) is not already checked by convert_and_check;
1403 however, do not invoke this function on operands of explicit casts
1404 or when the expression is the result of an operator and any operand
1405 already overflowed. */
1407 void
1409 {
1414 {
1443 }
1444 }
1446 /* Warn about uses of logical || / && operator in a context where it
1447 is likely that the bitwise equivalent was intended by the
1448 programmer. We have seen an expression in which CODE is a binary
1449 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1450 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1451 void
1455 {
1467 /* Warn if &&/|| are being used in a context where it is
1468 likely that the bitwise equivalent was intended by the
1469 programmer. That is, an expression such as op && MASK
1470 where op should not be any boolean expression, nor a
1471 constant, and mask seems to be a non-boolean integer constant. */
1479 {
1483 else
1488 }
1490 /* We do not warn for constants because they are typical of macro
1491 expansions that test for features. */
1495 /* This warning only makes sense with logical operands. */
1511 /* If this is an OR operation, invert both sides; we will invert
1512 again at the end. */
1516 /* If both expressions are the same, if we can merge the ranges, and we
1517 can build the range test, return it or it inverted. */
1523 {
1529 "logical %<or%> "
1531 else
1533 "logical %<and%> "
1535 }
1536 }
1539 /* Print a warning about casts that might indicate violation
1540 of strict aliasing rules if -Wstrict-aliasing is used and
1541 strict aliasing mode is in effect. OTYPE is the original
1542 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1544 bool
1546 {
1547 /* Strip pointer conversion chains and get to the correct original type. */
1555 /* If the type we are casting to is a ref-all pointer
1556 dereferencing it is always valid. */
1563 {
1564 /* Casting the address of an object to non void pointer. Warn
1565 if the cast breaks type based aliasing. */
1567 {
1571 }
1572 else
1573 {
1574 /* warn_strict_aliasing >= 3. This includes the default (3).
1575 Only warn if the cast is dereferenced immediately. */
1576 alias_set_type set1 =
1582 {
1586 }
1589 {
1593 }
1594 }
1595 }
1596 else
1598 {
1599 /* At this level, warn for any conversions, even if an address is
1600 not taken in the same statement. This will likely produce many
1601 false positives, but could be useful to pinpoint problems that
1602 are not revealed at higher levels. */
1607 {
1611 }
1612 }
1615 }
1617 /* Warn for unlikely, improbable, or stupid DECL declarations
1618 of `main'. */
1620 void
1622 {
1623 tree args;
1628 {
1636 {
1640 decl);
1649 decl);
1660 }
1661 }
1663 /* It is intentional that this message does not mention the third
1664 argument because it's only mentioned in an appendix of the
1665 standard. */
1668 }
1670 /* True if pointers to distinct types T1 and T2 can be converted to
1671 each other without an explicit cast. Only returns true for opaque
1672 vector types. */
1673 bool
1675 {
1682 }
1684 /* True if vector types T1 and T2 can be converted to each other
1685 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1686 can only be converted with -flax-vector-conversions yet that is not
1687 in effect, emit a note telling the user about that option if such
1688 a note has not previously been emitted. */
1689 bool
1691 {
1699 convertible_lax =
1714 {
1717 "conversions between vectors with differing "
1719 }
1722 }
1724 /* This is a helper function of build_binary_op.
1726 For certain operations if both args were extended from the same
1727 smaller type, do the arithmetic in that type and then extend.
1729 BITWISE indicates a bitwise operation.
1730 For them, this optimization is safe only if
1731 both args are zero-extended or both are sign-extended.
1732 Otherwise, we might change the result.
1733 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1734 but calculated in (unsigned short) it would be (unsigned short)-1.
1735 */
1737 {
1741 tree type;
1743 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1744 excessive narrowing when we call get_narrower below. For
1745 example, suppose that OP0 is of unsigned int extended
1746 from signed char and that RESULT_TYPE is long long int.
1747 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1748 like
1750 (long long int) (unsigned int) signed_char
1752 which get_narrower would narrow down to
1754 (unsigned int) signed char
1756 If we do not cast OP0 first, get_narrower would return
1757 signed_char, which is inconsistent with the case of the
1758 explicit cast. */
1765 /* UNS is 1 if the operation to be done is an unsigned one. */
1768 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1769 but it *requires* conversion to FINAL_TYPE. */
1780 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1782 /* For bitwise operations, signedness of nominal type
1783 does not matter. Consider only how operands were extended. */
1787 /* Note that in all three cases below we refrain from optimizing
1788 an unsigned operation on sign-extended args.
1789 That would not be valid. */
1791 /* Both args variable: if both extended in same way
1792 from same width, do it in that width.
1793 Do it unsigned if args were zero-extended. */
1800 return c_common_signed_or_unsigned_type
1807 && (type
1818 && (type
1826 }
1828 /* Warns if the conversion of EXPR to TYPE may alter a value.
1829 This is a helper function for warnings_for_convert_and_check. */
1831 static void
1833 {
1845 /* If any operand is artificial, then this expression was generated
1846 by the compiler and we do not warn. */
1848 {
1852 }
1855 {
1868 /* Conversion from boolean to a signed:1 bit-field (which only
1869 can hold the values 0 and -1) doesn't lose information - but
1870 it does change the value. */
1879 /* Warn for real constant that is not an exact integer converted
1880 to integer type. */
1883 {
1886 }
1887 /* Warn for an integer constant that does not fit into integer type. */
1891 {
1899 else
1901 }
1903 {
1904 /* Warn for an integer constant that does not fit into real type. */
1906 {
1910 }
1911 /* Warn for a real constant that does not fit into a smaller
1912 real type. */
1915 {
1919 }
1920 }
1930 {
1931 /* In case of COND_EXPR, if both operands are constants or
1932 COND_EXPR, then we do not care about the type of COND_EXPR,
1933 only about the conversion of each operand. */
1941 {
1945 }
1946 /* Fall through. */
1947 }
1951 /* Warn for real types converted to integer types. */
1958 {
1959 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1963 /* Don't warn for short y; short x = ((int)y & 0xff); */
1967 {
1968 /* If both args were extended from a shortest type,
1969 use that type if that is safe. */
1976 {
1982 /* If one of the operands is a non-negative constant
1983 that fits in the target type, then the type of the
1984 other operand does not matter. */
1993 /* If constant is unsigned and fits in the target
1994 type, then the result will also fit. */
1996 && unsigned0
1999 && unsigned1
2002 }
2003 }
2004 /* Warn for integer types converted to smaller integer types. */
2008 /* When they are the same width but different signedness,
2009 then the value may change. */
2012 /* Even when converted to a bigger type, if the type is
2013 unsigned but expr is signed, then negative values
2014 will be changed. */
2019 }
2021 /* Warn for integer types converted to real types if and only if
2022 all the range of values of the integer type cannot be
2023 represented by the real type. */
2026 {
2030 /* Don't warn about char y = 0xff; float x = (int) y; */
2042 }
2044 /* Warn for real types converted to smaller real types. */
2055 }
2056 }
2058 /* Produce warnings after a conversion. RESULT is the result of
2059 converting EXPR to TYPE. This is a helper function for
2060 convert_and_check and cp_convert_and_check. */
2062 void
2064 {
2069 {
2070 /* Do not diagnose overflow in a constant expression merely
2071 because a conversion overflowed. */
2076 {
2077 /* This detects cases like converting -129 or 256 to
2078 unsigned char. */
2082 else
2084 }
2088 /* No warning for converting 0x80000000 to int. */
2096 else
2098 }
2103 else
2105 }
2108 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2109 Invoke this function on every expression that is converted implicitly,
2110 i.e. because of language rules and not because of an explicit cast. */
2112 tree
2114 {
2115 tree result;
2116 tree expr_for_warning;
2118 /* Convert from a value with possible excess precision rather than
2119 via the semantic type, but do not warn about values not fitting
2120 exactly in the semantic type. */
2122 {
2128 }
2129 else
2143 }
2144 \f
2145 /* A node in a list that describes references to variables (EXPR), which are
2146 either read accesses if WRITER is zero, or write accesses, in which case
2147 WRITER is the parent of EXPR. */
2148 struct tlist
2149 {
2152 };
2154 /* Used to implement a cache the results of a call to verify_tree. We only
2155 use this for SAVE_EXPRs. */
2156 struct tlist_cache
2157 {
2161 tree expr;
2162 };
2164 /* Obstack to use when allocating tlist structures, and corresponding
2165 firstobj. */
2169 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2170 warnings. */
2172 /* SAVE_EXPRs need special treatment. We process them only once and then
2173 cache the results. */
2185 /* Create a new struct tlist and fill in its fields. */
2188 {
2195 }
2197 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2198 is nonnull, we ignore any node we find which has a writer equal to it. */
2200 static void
2202 {
2204 {
2211 }
2212 }
2214 /* Merge the nodes of ADD into TO. This merging process is done so that for
2215 each variable that already exists in TO, no new node is added; however if
2216 there is a write access recorded in ADD, and an occurrence on TO is only
2217 a read access, then the occurrence in TO will be modified to record the
2218 write. */
2220 static void
2222 {
2229 {
2236 {
2240 }
2242 {
2246 }
2248 }
2249 }
2251 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2252 references in list LIST conflict with it, excluding reads if ONLY writers
2253 is nonzero. */
2255 static void
2258 {
2261 /* Avoid duplicate warnings. */
2267 {
2271 {
2277 }
2279 }
2280 }
2282 /* Given a list LIST of references to variables, find whether any of these
2283 can cause conflicts due to missing sequence points. */
2285 static void
2287 {
2291 {
2294 }
2295 }
2297 /* Return nonzero if X is a tree that can be verified by the sequence point
2298 warnings. */
2299 static int
2301 {
2302 /* !VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2303 (lvalue_p) crash on TRY/CATCH. */
2306 }
2308 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2309 static bool
2311 {
2313 }
2315 /* Walk the tree X, and record accesses to variables. If X is written by the
2316 parent tree, WRITER is the parent.
2317 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2318 expression or its only operand forces a sequence point, then everything up
2319 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2320 in PNO_SP.
2321 Once we return, we will have emitted warnings if any subexpression before
2322 such a sequence point could be undefined. On a higher level, however, the
2323 sequence point may not be relevant, and we'll merge the two lists.
2325 Example: (b++, a) + b;
2326 The call that processes the COMPOUND_EXPR will store the increment of B
2327 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2328 processes the PLUS_EXPR will need to merge the two lists so that
2329 eventually, all accesses end up on the same list (and we'll warn about the
2330 unordered subexpressions b++ and b.
2332 A note on merging. If we modify the former example so that our expression
2333 becomes
2334 (b++, b) + a
2335 care must be taken not simply to add all three expressions into the final
2336 PNO_SP list. The function merge_tlist takes care of that by merging the
2337 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2338 way, so that no more than one access to B is recorded. */
2340 static void
2342 tree writer)
2343 {
2348 /* X may be NULL if it is the operand of an empty statement expression
2349 ({ }). */
2353 restart:
2361 {
2393 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2394 two first, to avoid warning for (a ? b++ : b++). */
2410 /* Expressions inside the LHS are not ordered wrt. the sequence points
2411 in the RHS. Example:
2412 *a = (a++, 2)
2413 Despite the fact that the modification of "a" is in the before_sp
2414 list (tmp_before), it conflicts with the use of "a" in the LHS.
2415 We can handle this by adding the contents of tmp_list3
2416 to those of tmp_before, and redoing the collision warnings for that
2417 list. */
2420 /* Exclude the LHS itself here; we first have to merge it into the
2421 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2422 didn't exclude the LHS, we'd get it twice, once as a read and once
2423 as a write. */
2434 /* We need to warn about conflicts among arguments and conflicts between
2435 args and the function address. Side effects of the function address,
2436 however, are not ordered by the sequence point of the call. */
2437 {
2438 call_expr_arg_iterator iter;
2439 tree arg;
2443 {
2448 }
2453 }
2456 /* Scan all the list, e.g. indices of multi dimensional array. */
2458 {
2464 }
2468 {
2475 {
2487 {
2491 }
2494 }
2498 }
2508 /* For other expressions, simply recurse on their operands.
2509 Manual tail recursion for unary expressions.
2510 Other non-expressions need not be processed. */
2512 {
2516 }
2518 {
2522 {
2527 }
2528 }
2530 }
2531 }
2533 /* Try to warn for undefined behavior in EXPR due to missing sequence
2534 points. */
2536 DEBUG_FUNCTION void
2538 {
2544 {
2547 }
2552 }
2553 \f
2554 /* Validate the expression after `case' and apply default promotions. */
2556 static tree
2558 {
2562 /* ??? Can we ever get nops here for a valid case value? We
2563 shouldn't for C. */
2565 /* In C++, the following is allowed:
2567 const int i = 3;
2568 switch (...) { case i: ... }
2570 So, we try to reduce the VALUE to a constant that way. */
2572 {
2576 }
2579 /* Promote char or short to int. */
2582 {
2585 }
2590 }
2591 \f
2592 /* See if the case values LOW and HIGH are in the range of the original
2593 type (i.e. before the default conversion to int) of the switch testing
2594 expression.
2595 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2596 the type before promoting it. CASE_LOW_P is a pointer to the lower
2597 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2598 if the case is not a case range.
2599 The caller has to make sure that we are not called with NULL for
2600 CASE_LOW_P (i.e. the default case).
2601 Returns true if the case label is in range of ORIG_TYPE (saturated or
2602 untouched) or false if the label is out of range. */
2604 static bool
2607 {
2612 /* If there was a problem with the original type, do nothing. */
2619 /* Case label is less than minimum for type. */
2622 {
2625 }
2627 /* Case value is greater than maximum for type. */
2630 {
2633 }
2635 /* Saturate lower case label value to minimum. */
2638 {
2642 }
2644 /* Saturate upper case label value to maximum. */
2647 {
2651 }
2659 }
2660 \f
2661 /* Return an integer type with BITS bits of precision,
2662 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2664 tree
2666 {
2705 }
2707 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2708 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2709 and saturating if SATP is nonzero, otherwise not saturating. */
2711 tree
2714 {
2718 else
2726 {
2728 "fixed-point types that have too many integral and "
2731 }
2734 }
2736 /* Used for communication between c_common_type_for_mode and
2737 c_register_builtin_type. */
2740 /* Return a data type that has machine mode MODE.
2741 If the mode is an integer,
2742 then UNSIGNEDP selects between signed and unsigned types.
2743 If the mode is a fixed-point mode,
2744 then UNSIGNEDP selects between saturating and nonsaturating types. */
2746 tree
2748 {
2749 tree t;
2786 #if HOST_BITS_PER_WIDE_INT >= 64
2789 #endif
2814 {
2816 tree inner_type;
2832 }
2834 {
2839 }
2849 {
2935 }
2942 }
2944 tree
2946 {
2948 }
2950 /* Return a signed type the same as TYPE in other respects. */
2952 tree
2954 {
2956 }
2958 /* Return a type the same as TYPE except unsigned or
2959 signed according to UNSIGNEDP. */
2961 tree
2963 {
2964 tree type1;
2966 /* This block of code emulates the behavior of the old
2967 c_common_unsigned_type. In particular, it returns
2968 long_unsigned_type_node if passed a long, even when a int would
2969 have the same size. This is necessary for warnings to work
2970 correctly in archs where sizeof(int) == sizeof(long) */
2973 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
2989 #if HOST_BITS_PER_WIDE_INT >= 64
2992 #endif
3002 #define C_COMMON_FIXED_TYPES(NAME) \
3003 if (type1 == short_ ## NAME ## _type_node \
3004 || type1 == unsigned_short_ ## NAME ## _type_node) \
3005 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3006 : short_ ## NAME ## _type_node; \
3007 if (type1 == NAME ## _type_node \
3008 || type1 == unsigned_ ## NAME ## _type_node) \
3009 return unsignedp ? unsigned_ ## NAME ## _type_node \
3010 : NAME ## _type_node; \
3011 if (type1 == long_ ## NAME ## _type_node \
3012 || type1 == unsigned_long_ ## NAME ## _type_node) \
3013 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3014 : long_ ## NAME ## _type_node; \
3015 if (type1 == long_long_ ## NAME ## _type_node \
3016 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3017 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3018 : long_long_ ## NAME ## _type_node;
3020 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3021 if (type1 == NAME ## _type_node \
3022 || type1 == u ## NAME ## _type_node) \
3023 return unsignedp ? u ## NAME ## _type_node \
3024 : NAME ## _type_node;
3026 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3027 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3028 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3029 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3030 : sat_ ## short_ ## NAME ## _type_node; \
3031 if (type1 == sat_ ## NAME ## _type_node \
3032 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3033 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3034 : sat_ ## NAME ## _type_node; \
3035 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3036 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3037 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3038 : sat_ ## long_ ## NAME ## _type_node; \
3039 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3040 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3041 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3042 : sat_ ## long_long_ ## NAME ## _type_node;
3044 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3045 if (type1 == sat_ ## NAME ## _type_node \
3046 || type1 == sat_ ## u ## NAME ## _type_node) \
3047 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3048 : sat_ ## NAME ## _type_node;
3074 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3075 the precision; they have precision set to match their range, but
3076 may use a wider mode to match an ABI. If we change modes, we may
3077 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3078 the precision as well, so as to yield correct results for
3079 bit-field types. C++ does not have these separate bit-field
3080 types, and producing a signed or unsigned variant of an
3081 ENUMERAL_TYPE may cause other problems as well. */
3087 #define TYPE_OK(node) \
3088 (TYPE_MODE (type) == TYPE_MODE (node) \
3089 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3108 #if HOST_BITS_PER_WIDE_INT >= 64
3111 #endif
3120 #undef TYPE_OK
3123 }
3125 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3127 tree
3129 {
3130 /* Extended integer types of the same width as a standard type have
3131 lesser rank, so those of the same width as int promote to int or
3132 unsigned int and are valid for printf formats expecting int or
3133 unsigned int. To avoid such special cases, avoid creating
3134 extended integer types for bit-fields if a standard integer type
3135 is available. */
3152 }
3154 /* The C version of the register_builtin_type langhook. */
3156 void
3158 {
3159 tree decl;
3169 }
3170 \f
3171 /* Print an error message for invalid operands to arith operation
3172 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3173 LOCATION is the location of the message. */
3175 void
3178 {
3182 {
3227 }
3231 }
3232 \f
3233 /* Subroutine of build_binary_op, used for comparison operations.
3234 See if the operands have both been converted from subword integer types
3235 and, if so, perhaps change them both back to their original type.
3236 This function is also responsible for converting the two operands
3237 to the proper common type for comparison.
3239 The arguments of this function are all pointers to local variables
3240 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3241 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3243 If this function returns nonzero, it means that the comparison has
3244 a constant value. What this function returns is an expression for
3245 that value. */
3247 tree
3250 {
3251 tree type;
3259 /* Throw away any conversions to wider types
3260 already present in the operands. */
3265 /* Handle the case that OP0 does not *contain* a conversion
3266 but it *requires* conversion to FINAL_TYPE. */
3273 /* If one of the operands must be floated, we cannot optimize. */
3277 /* If first arg is constant, swap the args (changing operation
3278 so value is preserved), for canonicalization. Don't do this if
3279 the second arg is 0. */
3284 {
3301 {
3316 }
3318 }
3320 /* If comparing an integer against a constant more bits wide,
3321 maybe we can deduce a value of 1 or 0 independent of the data.
3322 Or else truncate the constant now
3323 rather than extend the variable at run time.
3325 This is only interesting if the constant is the wider arg.
3326 Also, it is not safe if the constant is unsigned and the
3327 variable arg is signed, since in this case the variable
3328 would be sign-extended and then regarded as unsigned.
3329 Our technique fails in this case because the lowest/highest
3330 possible unsigned results don't follow naturally from the
3331 lowest/highest possible values of the variable operand.
3332 For just EQ_EXPR and NE_EXPR there is another technique that
3333 could be used: see if the constant can be faithfully represented
3334 in the other operand's type, by truncating it and reextending it
3335 and see if that preserves the constant's value. */
3341 {
3344 /* 1 if comparison is nominally unsigned. */
3346 tree val;
3358 {
3359 /* Convert primop1 to target type, but do not introduce
3360 additional overflow. We know primop1 is an int_cst. */
3364 }
3366 {
3369 }
3372 {
3377 }
3378 else
3379 {
3384 }
3387 /* This used to be a switch, but Genix compiler can't handle that. */
3389 {
3392 }
3394 {
3397 }
3399 {
3404 }
3406 {
3411 }
3413 {
3418 }
3420 {
3425 }
3427 /* If primop0 was sign-extended and unsigned comparison specd,
3428 we did a signed comparison above using the signed type bounds.
3429 But the comparison we output must be unsigned.
3431 Also, for inequalities, VAL is no good; but if the signed
3432 comparison had *any* fixed result, it follows that the
3433 unsigned comparison just tests the sign in reverse
3434 (positive values are LE, negative ones GE).
3435 So we can generate an unsigned comparison
3436 against an extreme value of the signed type. */
3439 {
3442 {
3457 }
3459 }
3462 {
3467 }
3470 {
3471 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3475 }
3477 /* Value is not predetermined, but do the comparison
3478 in the type of the operand that is not constant.
3479 TYPE is already properly set. */
3480 }
3482 /* If either arg is decimal float and the other is float, find the
3483 proper common type to use for comparison. */
3494 /* If args' natural types are both narrower than nominal type
3495 and both extend in the same manner, compare them
3496 in the type of the wider arg.
3497 Otherwise must actually extend both to the nominal
3498 common type lest different ways of extending
3499 alter the result.
3500 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3505 {
3509 type);
3510 /* Make sure shorter operand is extended the right way
3511 to match the longer operand. */
3512 primop0
3515 primop0);
3516 primop1
3519 primop1);
3520 }
3521 else
3522 {
3523 /* Here we must do the comparison on the nominal type
3524 using the args exactly as we received them. */
3531 {
3534 {
3536 /* All unsigned values are >= 0, so we warn. However,
3537 if OP0 is a constant that is >= 0, the signedness of
3538 the comparison isn't an issue, so suppress the
3539 warning. */
3543 primop0))))
3553 primop0))))
3561 }
3564 {
3565 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3570 }
3571 }
3572 }
3580 }
3581 \f
3582 /* Return a tree for the sum or difference (RESULTCODE says which)
3583 of pointer PTROP and integer INTOP. */
3585 tree
3588 {
3591 /* The result is a pointer of the same type that is being added. */
3595 {
3599 }
3601 {
3605 }
3607 {
3611 }
3612 else
3615 /* We are manipulating pointer values, so we don't need to warn
3616 about relying on undefined signed overflow. We disable the
3617 warning here because we use integer types so fold won't know that
3618 they are really pointers. */
3621 /* If what we are about to multiply by the size of the elements
3622 contains a constant term, apply distributive law
3623 and multiply that constant term separately.
3624 This helps produce common subexpressions. */
3629 /* If the constant comes from pointer subtraction,
3630 skip this optimization--it would cause an error. */
3632 /* If the constant is unsigned, and smaller than the pointer size,
3633 then we must skip this optimization. This is because it could cause
3634 an overflow error if the constant is negative but INTOP is not. */
3638 {
3643 /* Convert both subexpression types to the type of intop,
3644 because weird cases involving pointer arithmetic
3645 can result in a sum or difference with different type args. */
3650 }
3652 /* Convert the integer argument to a type the same size as sizetype
3653 so the multiply won't overflow spuriously. */
3659 /* Replace the integer argument with a suitable product by the object size.
3660 Do this multiplication as signed, then convert to the appropriate type
3661 for the pointer operation and disregard an overflow that occured only
3662 because of the sign-extension change in the latter conversion. */
3663 {
3671 }
3673 /* Create the sum or difference. */
3682 }
3683 \f
3684 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3685 and if NON_CONST is known not to be permitted in an evaluated part
3686 of a constant expression. */
3688 tree
3690 {
3694 /* This should never be called for C++. */
3698 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3707 }
3709 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3710 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3711 around the SAVE_EXPR if needed so that c_fully_fold does not need
3712 to look inside SAVE_EXPRs. */
3714 tree
3716 {
3725 }
3727 /* Return whether EXPR is a declaration whose address can never be
3728 NULL. */
3730 bool
3732 {
3737 }
3739 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3740 or for an `if' or `while' statement or ?..: exp. It should already
3741 have been validated to be of suitable type; otherwise, a bad
3742 diagnostic may result.
3744 The EXPR is located at LOCATION.
3746 This preparation consists of taking the ordinary
3747 representation of an expression expr and producing a valid tree
3748 boolean expression describing whether expr is nonzero. We could
3749 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3750 but we optimize comparisons, &&, ||, and !.
3752 The resulting type should always be `truthvalue_type_node'. */
3754 tree
3756 {
3758 {
3800 ? truthvalue_true_node
3806 ? truthvalue_true_node
3811 /* Fall through. */
3814 {
3817 {
3818 /* Common Ada/Pascal programmer's mistake. */
3820 OPT_Waddress,
3822 inner);
3824 }
3826 }
3843 /* These don't change whether an object is nonzero or zero. */
3848 /* These don't change whether an object is zero or nonzero, but
3849 we can't ignore them if their second arg has side-effects. */
3851 {
3854 c_common_truthvalue_conversion
3857 }
3858 else
3863 /* Distribute the conversion into the arms of a COND_EXPR. */
3865 {
3875 }
3876 else
3877 {
3878 /* Folding will happen later for C. */
3886 }
3888 CASE_CONVERT:
3889 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3890 since that affects how `default_conversion' will behave. */
3894 /* If this is widening the argument, we can ignore it. */
3904 {
3908 }
3913 }
3916 {
3918 expr = (build_binary_op
3922 c_common_truthvalue_conversion
3925 c_common_truthvalue_conversion
3930 }
3933 {
3938 }
3939 else
3942 ret:
3945 }
3946 \f
3955 /* Apply the TYPE_QUALS to the new DECL. */
3957 void
3959 {
3967 /* An object declared 'const' is only readonly after it is
3968 initialized. We don't have any way of expressing this currently,
3969 so we need to be conservative and unset TREE_READONLY for types
3970 with constructors. Otherwise aliasing code will ignore stores in
3971 an inline constructor. */
3975 {
3978 }
3980 {
3982 /* Allow 'restrict' on arrays of pointers.
3983 FIXME currently we just ignore it. */
3989 }
3990 }
3992 /* Hash function for the problem of multiple type definitions in
3993 different files. This must hash all types that will compare
3994 equal via comptypes to the same value. In practice it hashes
3995 on some of the simple stuff and leaves the details to comptypes. */
3997 static hashval_t
3999 {
4003 tree t2;
4005 {
4006 /* For pointers, hash on pointee type plus some swizzling. */
4009 /* Hash on number of elements and total size. */
4028 }
4030 i++;
4031 /* We might have a VLA here. */
4034 else
4037 }
4041 /* Return the typed-based alias set for T, which may be an expression
4042 or a type. Return -1 if we don't do anything special. */
4044 alias_set_type
4046 {
4047 tree u;
4050 /* For VLAs, use the alias set of the element type rather than the
4051 default of alias set 0 for types compared structurally. */
4053 {
4057 }
4059 /* Permit type-punning when accessing a union, provided the access
4060 is directly through the union. For example, this code does not
4061 permit taking the address of a union member and then storing
4062 through it. Even the type-punning allowed here is a GCC
4063 extension, albeit a common and useful one; the C standard says
4064 that such accesses have implementation-defined behavior. */
4072 /* That's all the expressions we handle specially. */
4076 /* The C standard guarantees that any object may be accessed via an
4077 lvalue that has character type. */
4083 /* The C standard specifically allows aliasing between signed and
4084 unsigned variants of the same type. We treat the signed
4085 variant as canonical. */
4087 {
4090 /* t1 == t can happen for boolean nodes which are always unsigned. */
4093 }
4095 /* Handle the case of multiple type nodes referring to "the same" type,
4096 which occurs with IMA. These share an alias set. FIXME: Currently only
4097 C90 is handled. (In C99 type compatibility is not transitive, which
4098 complicates things mightily. The alias set splay trees can theoretically
4099 represent this, but insertion is tricky when you consider all the
4100 different orders things might arrive in.) */
4105 /* Save time if there's only one input file. */
4109 /* Pointers need special handling if they point to any type that
4110 needs special handling (below). */
4112 {
4113 tree t2;
4114 /* Find bottom type under any nested POINTERs. */
4118 ;
4126 }
4127 /* These are the only cases that need special handling. */
4134 /* Undefined? */
4138 /* Look up t in hash table. Only one of the compatible types within each
4139 alias set is recorded in the table. */
4143 NULL);
4146 {
4149 }
4150 else
4151 /* Our caller will assign and record (in t) a new alias set; all we need
4152 to do is remember t in the hash table. */
4156 }
4157 \f
4158 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4159 the second parameter indicates which OPERATOR is being applied.
4160 The COMPLAIN flag controls whether we should diagnose possibly
4161 ill-formed constructs or not. LOC is the location of the SIZEOF or
4162 TYPEOF operator. */
4164 tree
4167 {
4175 {
4177 {
4184 }
4185 else
4187 }
4189 {
4197 }
4199 {
4204 }
4205 else
4206 {
4208 /* Convert in case a char is more than one unit. */
4212 else
4214 }
4216 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4217 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4218 never happen. However, this node should really have type
4219 `size_t', which is just a typedef for an ordinary integer type. */
4224 }
4226 /* Implement the __alignof keyword: Return the minimum required
4227 alignment of EXPR, measured in bytes. For VAR_DECLs,
4228 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4229 from an "aligned" __attribute__ specification). LOC is the
4230 location of the ALIGNOF operator. */
4232 tree
4234 {
4235 tree t;
4242 {
4245 }
4251 {
4258 {
4265 }
4267 }
4268 else
4272 }
4273 \f
4274 /* Handle C and C++ default attributes. */
4276 enum built_in_attribute
4277 {
4278 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4279 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4280 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4281 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4283 #undef DEF_ATTR_NULL_TREE
4284 #undef DEF_ATTR_INT
4285 #undef DEF_ATTR_IDENT
4286 #undef DEF_ATTR_TREE_LIST
4287 ATTR_LAST
4288 };
4294 enum c_builtin_type
4295 {
4296 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4297 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4298 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4299 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4300 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4301 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4302 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4303 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4304 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4305 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4306 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4307 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4308 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4309 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4310 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4311 NAME,
4312 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4314 #undef DEF_PRIMITIVE_TYPE
4315 #undef DEF_FUNCTION_TYPE_0
4316 #undef DEF_FUNCTION_TYPE_1
4317 #undef DEF_FUNCTION_TYPE_2
4318 #undef DEF_FUNCTION_TYPE_3
4319 #undef DEF_FUNCTION_TYPE_4
4320 #undef DEF_FUNCTION_TYPE_5
4321 #undef DEF_FUNCTION_TYPE_6
4322 #undef DEF_FUNCTION_TYPE_7
4323 #undef DEF_FUNCTION_TYPE_VAR_0
4324 #undef DEF_FUNCTION_TYPE_VAR_1
4325 #undef DEF_FUNCTION_TYPE_VAR_2
4326 #undef DEF_FUNCTION_TYPE_VAR_3
4327 #undef DEF_FUNCTION_TYPE_VAR_4
4328 #undef DEF_FUNCTION_TYPE_VAR_5
4329 #undef DEF_POINTER_TYPE
4330 BT_LAST
4331 };
4335 /* A temporary array for c_common_nodes_and_builtins. Used in
4336 communication with def_fn_type. */
4339 /* A helper function for c_common_nodes_and_builtins. Build function type
4340 for DEF with return type RET and N arguments. If VAR is true, then the
4341 function should be variadic after those N arguments.
4343 Takes special care not to ICE if any of the types involved are
4344 error_mark_node, which indicates that said type is not in fact available
4345 (see builtin_type_for_size). In which case the function type as a whole
4346 should be error_mark_node. */
4348 static void
4350 {
4357 {
4363 }
4375 egress:
4377 }
4379 /* Build builtin functions common to both C and C++ language
4380 frontends. */
4382 static void
4384 {
4385 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4386 builtin_types[ENUM] = VALUE;
4387 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4388 def_fn_type (ENUM, RETURN, 0, 0);
4389 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4390 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4391 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4392 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4393 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4394 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4395 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4396 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4397 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4398 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4399 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4400 ARG6) \
4401 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4402 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4403 ARG6, ARG7) \
4404 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4405 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4406 def_fn_type (ENUM, RETURN, 1, 0);
4407 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4408 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4409 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4410 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4411 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4412 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4413 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4414 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4415 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4416 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4417 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4418 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4422 #undef DEF_PRIMITIVE_TYPE
4423 #undef DEF_FUNCTION_TYPE_1
4424 #undef DEF_FUNCTION_TYPE_2
4425 #undef DEF_FUNCTION_TYPE_3
4426 #undef DEF_FUNCTION_TYPE_4
4427 #undef DEF_FUNCTION_TYPE_5
4428 #undef DEF_FUNCTION_TYPE_6
4429 #undef DEF_FUNCTION_TYPE_VAR_0
4430 #undef DEF_FUNCTION_TYPE_VAR_1
4431 #undef DEF_FUNCTION_TYPE_VAR_2
4432 #undef DEF_FUNCTION_TYPE_VAR_3
4433 #undef DEF_FUNCTION_TYPE_VAR_4
4434 #undef DEF_FUNCTION_TYPE_VAR_5
4435 #undef DEF_POINTER_TYPE
4440 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4441 NONANSI_P, ATTRS, IMPLICIT, COND) \
4442 if (NAME && COND) \
4443 def_builtin_1 (ENUM, NAME, CLASS, \
4444 builtin_types[(int) TYPE], \
4445 builtin_types[(int) LIBTYPE], \
4446 BOTH_P, FALLBACK_P, NONANSI_P, \
4447 built_in_attributes[(int) ATTRS], IMPLICIT);
4449 #undef DEF_BUILTIN
4457 }
4459 /* Like get_identifier, but avoid warnings about null arguments when
4460 the argument may be NULL for targets where GCC lacks stdint.h type
4461 information. */
4465 {
4467 }
4469 /* Build tree nodes and builtin functions common to both C and C++ language
4470 frontends. */
4472 void
4474 {
4478 tree array_domain_type;
4479 tree va_list_ref_type_node;
4480 tree va_list_arg_type_node;
4482 /* Define `int' and `char' first so that dbx will output them first. */
4486 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4487 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4488 but not C. Are the conditionals here needed? */
4494 long_unsigned_type_node);
4496 {
4498 int128_integer_type_node);
4500 int128_unsigned_type_node);
4501 }
4505 long_long_integer_type_node);
4507 long_long_unsigned_type_node);
4510 long_long_unsigned_type_node);
4513 short_unsigned_type_node);
4516 short_unsigned_type_node);
4518 /* Define both `signed char' and `unsigned char'. */
4522 /* These are types that c_common_type_for_size and
4523 c_common_type_for_mode use. */
4526 intQI_type_node));
4529 intHI_type_node));
4532 intSI_type_node));
4535 intDI_type_node));
4536 #if HOST_BITS_PER_WIDE_INT >= 64
4539 TYPE_DECL,
4541 intTI_type_node));
4542 #endif
4545 unsigned_intQI_type_node));
4548 unsigned_intHI_type_node));
4551 unsigned_intSI_type_node));
4554 unsigned_intDI_type_node));
4555 #if HOST_BITS_PER_WIDE_INT >= 64
4558 TYPE_DECL,
4560 unsigned_intTI_type_node));
4561 #endif
4563 /* Create the widest literal types. */
4564 widest_integer_literal_type_node
4568 widest_integer_literal_type_node));
4570 widest_unsigned_literal_type_node
4574 widest_unsigned_literal_type_node));
4576 /* `unsigned long' is the standard type for sizeof.
4577 Note that stddef.h uses `unsigned long',
4578 and this must agree, even if long and int are the same size. */
4579 size_type_node =
4584 pid_type_node =
4593 /* Only supported decimal floating point extension if the target
4594 actually supports underlying modes. */
4598 {
4602 }
4605 {
4610 long_long_fract_type_node);
4612 unsigned_short_fract_type_node);
4614 unsigned_fract_type_node);
4616 unsigned_long_fract_type_node);
4618 unsigned_long_long_fract_type_node);
4620 sat_short_fract_type_node);
4623 sat_long_fract_type_node);
4625 sat_long_long_fract_type_node);
4627 sat_unsigned_short_fract_type_node);
4629 sat_unsigned_fract_type_node);
4631 sat_unsigned_long_fract_type_node);
4633 sat_unsigned_long_long_fract_type_node);
4638 long_long_accum_type_node);
4640 unsigned_short_accum_type_node);
4642 unsigned_accum_type_node);
4644 unsigned_long_accum_type_node);
4646 unsigned_long_long_accum_type_node);
4648 sat_short_accum_type_node);
4651 sat_long_accum_type_node);
4653 sat_long_long_accum_type_node);
4655 sat_unsigned_short_accum_type_node);
4657 sat_unsigned_accum_type_node);
4659 sat_unsigned_long_accum_type_node);
4661 sat_unsigned_long_long_accum_type_node);
4663 }
4666 TYPE_DECL,
4668 complex_integer_type_node));
4670 TYPE_DECL,
4672 complex_float_type_node));
4674 TYPE_DECL,
4676 complex_double_type_node));
4680 complex_long_double_type_node));
4683 /* For C++, make fileptr_type_node a distinct void * type until
4684 FILE type is defined. */
4689 /* Set the TYPE_NAME for any variants that were built before
4690 record_builtin_type gave names to the built-in types. */
4691 {
4697 }
4699 /* This node must not be shared. */
4705 /* Make a type to be the domain of a few array types
4706 whose domains don't really matter.
4707 200 is small enough that it always fits in size_t
4708 and large enough that it can hold most function names for the
4709 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4712 /* Make a type for arrays of characters.
4713 With luck nothing will ever really depend on the length of this
4714 array type. */
4715 char_array_type_node
4718 /* Likewise for arrays of ints. */
4719 int_array_type_node
4723 const_string_type_node
4727 /* This is special for C++ so functions can be overloaded. */
4733 {
4736 else
4739 }
4741 /* This is for wide string constants. */
4742 wchar_array_type_node
4745 /* Define 'char16_t'. */
4750 {
4755 }
4757 /* This is for UTF-16 string constants. */
4758 char16_array_type_node
4761 /* Define 'char32_t'. */
4766 {
4771 }
4773 /* This is for UTF-32 string constants. */
4774 char32_array_type_node
4777 wint_type_node =
4780 intmax_type_node =
4782 uintmax_type_node =
4786 sig_atomic_type_node =
4789 int8_type_node =
4792 int16_type_node =
4795 int32_type_node =
4798 int64_type_node =
4801 uint8_type_node =
4804 uint16_type_node =
4807 c_uint32_type_node =
4810 c_uint64_type_node =
4813 int_least8_type_node =
4816 int_least16_type_node =
4819 int_least32_type_node =
4822 int_least64_type_node =
4825 uint_least8_type_node =
4828 uint_least16_type_node =
4831 uint_least32_type_node =
4834 uint_least64_type_node =
4837 int_fast8_type_node =
4840 int_fast16_type_node =
4843 int_fast32_type_node =
4846 int_fast64_type_node =
4849 uint_fast8_type_node =
4852 uint_fast16_type_node =
4855 uint_fast32_type_node =
4858 uint_fast64_type_node =
4861 intptr_type_node =
4864 uintptr_type_node =
4868 ptrdiff_type_node
4875 va_list_type_node));
4877 {
4880 tree ptype;
4883 {
4887 ptype));
4889 }
4890 }
4893 {
4896 }
4897 else
4898 {
4901 }
4908 /* Create the built-in __null node. It is important that this is
4909 not shared. */
4913 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4915 }
4917 /* The number of named compound-literals generated thus far. */
4920 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4922 void
4924 {
4927 compound_literal_number);
4928 compound_literal_number++;
4930 }
4932 tree
4934 {
4938 }
4941 /* Linked list of disabled built-in functions. */
4944 {
4952 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4953 begins with "__builtin_", give an error. */
4955 void
4957 {
4960 else
4961 {
4966 }
4967 }
4970 /* Return true if the built-in function NAME has been disabled, false
4971 otherwise. */
4973 static bool
4975 {
4978 {
4981 }
4983 }
4986 /* Worker for DEF_BUILTIN.
4987 Possibly define a builtin function with one or two names.
4988 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4989 nonansi_p and flag_no_nonansi_builtin. */
4991 static void
4998 {
4999 tree decl;
5012 fnattrs);
5022 }
5023 \f
5024 /* Nonzero if the type T promotes to int. This is (nearly) the
5025 integral promotions defined in ISO C99 6.3.1.1/2. */
5027 bool
5029 {
5031 {
5041 /* ??? Technically all enumerations not larger than an int
5042 promote to an int. But this is used along code paths
5043 that only want to notice a size change. */
5051 }
5052 }
5054 /* Return 1 if PARMS specifies a fixed number of parameters
5055 and none of their types is affected by default promotions. */
5057 int
5059 {
5060 const_tree t;
5062 {
5079 }
5081 }
5083 /* Recursively remove any '*' or '&' operator from TYPE. */
5084 tree
5086 {
5090 }
5092 /* Recursively remove pointer or array type from TYPE. */
5093 tree
5095 {
5099 }
5101 /* Used to compare case labels. K1 and K2 are actually tree nodes
5102 representing case labels, or NULL_TREE for a `default' label.
5103 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5104 K2, and 0 if K1 and K2 are equal. */
5106 int
5108 {
5109 /* Consider a NULL key (such as arises with a `default' label) to be
5110 smaller than anything else. */
5117 }
5119 /* Process a case label, located at LOC, for the range LOW_VALUE
5120 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5121 then this case label is actually a `default' label. If only
5122 HIGH_VALUE is NULL_TREE, then case label was declared using the
5123 usual C/C++ syntax, rather than the GNU case range extension.
5124 CASES is a tree containing all the case ranges processed so far;
5125 COND is the condition for the switch-statement itself. Returns the
5126 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5127 is created. */
5129 tree
5132 {
5133 tree type;
5134 tree label;
5135 tree case_label;
5136 splay_tree_node node;
5138 /* Create the LABEL_DECL itself. */
5141 /* If there was an error processing the switch condition, bail now
5142 before we get more confused. */
5150 {
5153 }
5155 /* Case ranges are a GNU extension. */
5162 {
5167 }
5169 {
5174 }
5177 {
5178 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5179 really a case range, even though it was written that way.
5180 Remove the HIGH_VALUE to simplify later processing. */
5185 }
5187 /* See if the case is in range of the type of the original testing
5188 expression. If both low_value and high_value are out of range,
5189 don't insert the case label and return NULL_TREE. */
5195 /* Look up the LOW_VALUE in the table of case labels we already
5196 have. */
5198 /* If there was not an exact match, check for overlapping ranges.
5199 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5200 that's a `default' label and the only overlap is an exact match. */
5202 {
5203 splay_tree_node low_bound;
5204 splay_tree_node high_bound;
5206 /* Even though there wasn't an exact match, there might be an
5207 overlap between this case range and another case range.
5208 Since we've (inductively) not allowed any overlapping case
5209 ranges, we simply need to find the greatest low case label
5210 that is smaller that LOW_VALUE, and the smallest low case
5211 label that is greater than LOW_VALUE. If there is an overlap
5212 it will occur in one of these two ranges. */
5218 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5219 the LOW_VALUE, so there is no need to check unless the
5220 LOW_BOUND is in fact itself a case range. */
5226 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5227 range is bigger than the low end of the current range, so we
5228 are only interested if the current range is a real range, and
5229 not an ordinary case label. */
5231 && high_value
5233 high_value)
5236 }
5237 /* If there was an overlap, issue an error. */
5239 {
5243 {
5247 }
5249 {
5252 }
5253 else
5254 {
5258 }
5260 }
5262 /* Add a CASE_LABEL to the statement-tree. */
5264 /* Register this case label in the splay tree. */
5271 error_out:
5272 /* Add a label so that the back-end doesn't think that the beginning of
5273 the switch is unreachable. Note that we do not add a case label, as
5274 that just leads to duplicates and thence to failure later on. */
5276 {
5279 }
5281 }
5283 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5284 Used to verify that case values match up with enumerator values. */
5286 static void
5288 {
5291 /* ??? Not working too hard to print the double-word value.
5292 Should perhaps be done with %lwd in the diagnostic routines? */
5301 else
5310 buf);
5311 else
5316 }
5318 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5319 Used to verify that case values match up with enumerator values. */
5321 static int
5323 {
5327 /* Skip default case. */
5331 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5332 when we did our enum->case scan. Reset our scratch bit after. */
5335 else
5338 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5339 not set, that means that CASE_HIGH did not appear when we did our
5340 enum->case scan. Reset our scratch bit after. */
5342 {
5345 else
5347 }
5350 }
5352 /* Handle -Wswitch*. Called from the front end after parsing the
5353 switch construct. */
5354 /* ??? Should probably be somewhere generic, since other languages
5355 besides C and C++ would want this. At the moment, however, C/C++
5356 are the only tree-ssa languages that support enumerations at all,
5357 so the point is moot. */
5359 void
5362 {
5363 splay_tree_node default_node;
5364 splay_tree_node node;
5365 tree chain;
5375 /* From here on, we only care about about enumerated types. */
5379 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5383 /* Check the cases. Warn about case values which are not members of
5384 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5385 there is no default case, check that exactly all enumeration
5386 literals are covered by the cases. */
5388 /* Clearing COND if it is not an integer constant simplifies
5389 the tests inside the loop below. */
5393 /* The time complexity here is O(N*lg(N)) worst case, but for the
5394 common case of monotonically increasing enumerators, it is
5395 O(N), since the nature of the splay tree will keep the next
5396 element adjacent to the root at all times. */
5399 {
5405 {
5406 /* Mark the CASE_LOW part of the case entry as seen. */
5410 }
5412 /* Even though there wasn't an exact match, there might be a
5413 case range which includes the enumerator's value. */
5416 {
5420 {
5421 /* If we match the upper bound exactly, mark the CASE_HIGH
5422 part of the case entry as seen. */
5426 }
5427 }
5429 /* We've now determined that this enumerated literal isn't
5430 handled by the case labels of the switch statement. */
5432 /* If the switch expression is a constant, we only really care
5433 about whether that constant is handled by the switch. */
5437 /* If there is a default_node, the only relevant option is
5438 Wswitch-enum. Otherwise, if both are enabled then we prefer
5439 to warn using -Wswitch because -Wswitch is enabled by -Wall
5440 while -Wswitch-enum is explicit. */
5443 ? OPT_Wswitch_enum
5447 }
5449 /* Warn if there are case expressions that don't correspond to
5450 enumerators. This can occur since C and C++ don't enforce
5451 type-checking of assignments to enumeration variables.
5453 The time complexity here is now always O(N) worst case, since
5454 we should have marked both the lower bound and upper bound of
5455 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5456 above. This scan also resets those fields. */
5459 }
5461 /* Finish an expression taking the address of LABEL (an
5462 IDENTIFIER_NODE). Returns an expression for the address.
5464 LOC is the location for the expression returned. */
5466 tree
5468 {
5469 tree result;
5479 else
5480 {
5483 /* The current function is not necessarily uninlinable.
5484 Computed gotos are incompatible with inlining, but the value
5485 here could be used only in a diagnostic, for example. */
5487 }
5490 }
5491 \f
5493 /* Given a boolean expression ARG, return a tree representing an increment
5494 or decrement (as indicated by CODE) of ARG. The front end must check for
5495 invalid cases (e.g., decrement in C++). */
5496 tree
5498 {
5499 tree val;
5504 {
5527 }
5530 }
5531 \f
5532 /* Built-in macros for stddef.h and stdint.h, that require macros
5533 defined in this file. */
5534 void
5536 {
5599 }
5601 static void
5603 {
5604 /* Fill in the built_in_attributes array. */
5605 #define DEF_ATTR_NULL_TREE(ENUM) \
5606 built_in_attributes[(int) ENUM] = NULL_TREE;
5607 #define DEF_ATTR_INT(ENUM, VALUE) \
5608 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5609 #define DEF_ATTR_IDENT(ENUM, STRING) \
5610 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5611 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5612 built_in_attributes[(int) ENUM] \
5613 = tree_cons (built_in_attributes[(int) PURPOSE], \
5614 built_in_attributes[(int) VALUE], \
5615 built_in_attributes[(int) CHAIN]);
5617 #undef DEF_ATTR_NULL_TREE
5618 #undef DEF_ATTR_INT
5619 #undef DEF_ATTR_IDENT
5620 #undef DEF_ATTR_TREE_LIST
5621 }
5623 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5624 identifier as an argument, so the front end shouldn't look it up. */
5626 bool
5628 {
5633 else
5635 }
5637 /* Attribute handlers common to C front ends. */
5639 /* Handle a "packed" attribute; arguments as in
5640 struct attribute_spec.handler. */
5642 static tree
5645 {
5647 {
5651 }
5653 {
5655 /* Still pack bitfields. */
5660 else
5662 }
5663 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5664 used for DECL_REGISTER. It wouldn't mean anything anyway.
5665 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5666 that changes what the typedef is typing. */
5667 else
5668 {
5671 }
5674 }
5676 /* Handle a "nocommon" attribute; arguments as in
5677 struct attribute_spec.handler. */
5679 static tree
5683 {
5686 else
5687 {
5690 }
5693 }
5695 /* Handle a "common" attribute; arguments as in
5696 struct attribute_spec.handler. */
5698 static tree
5701 {
5704 else
5705 {
5708 }
5711 }
5713 /* Handle a "noreturn" attribute; arguments as in
5714 struct attribute_spec.handler. */
5716 static tree
5719 {
5722 /* See FIXME comment in c_common_attribute_table. */
5728 = build_pointer_type
5731 else
5732 {
5735 }
5738 }
5740 /* Handle a "hot" and attribute; arguments as in
5741 struct attribute_spec.handler. */
5743 static tree
5746 {
5748 {
5750 {
5754 }
5755 /* Most of the rest of the hot processing is done later with
5756 lookup_attribute. */
5757 }
5758 else
5759 {
5762 }
5765 }
5766 /* Handle a "cold" and attribute; arguments as in
5767 struct attribute_spec.handler. */
5769 static tree
5772 {
5774 {
5776 {
5780 }
5781 /* Most of the rest of the cold processing is done later with
5782 lookup_attribute. */
5783 }
5784 else
5785 {
5788 }
5791 }
5793 /* Handle a "noinline" attribute; arguments as in
5794 struct attribute_spec.handler. */
5796 static tree
5800 {
5803 else
5804 {
5807 }
5810 }
5812 /* Handle a "noclone" attribute; arguments as in
5813 struct attribute_spec.handler. */
5815 static tree
5819 {
5821 {
5824 }
5827 }
5829 /* Handle a "always_inline" attribute; arguments as in
5830 struct attribute_spec.handler. */
5832 static tree
5837 {
5839 {
5840 /* Set the attribute and mark it for disregarding inline
5841 limits. */
5843 }
5844 else
5845 {
5848 }
5851 }
5853 /* Handle a "gnu_inline" attribute; arguments as in
5854 struct attribute_spec.handler. */
5856 static tree
5861 {
5863 {
5864 /* Do nothing else, just set the attribute. We'll get at
5865 it later with lookup_attribute. */
5866 }
5867 else
5868 {
5871 }
5874 }
5876 /* Handle an "artificial" attribute; arguments as in
5877 struct attribute_spec.handler. */
5879 static tree
5884 {
5886 {
5887 /* Do nothing else, just set the attribute. We'll get at
5888 it later with lookup_attribute. */
5889 }
5890 else
5891 {
5894 }
5897 }
5899 /* Handle a "flatten" attribute; arguments as in
5900 struct attribute_spec.handler. */
5902 static tree
5904 tree args ATTRIBUTE_UNUSED,
5906 {
5908 /* Do nothing else, just set the attribute. We'll get at
5909 it later with lookup_attribute. */
5910 ;
5911 else
5912 {
5915 }
5918 }
5920 /* Handle a "warning" or "error" attribute; arguments as in
5921 struct attribute_spec.handler. */
5923 static tree
5926 {
5929 /* Do nothing else, just set the attribute. We'll get at
5930 it later with lookup_attribute. */
5931 ;
5932 else
5933 {
5936 }
5939 }
5941 /* Handle a "used" attribute; arguments as in
5942 struct attribute_spec.handler. */
5944 static tree
5947 {
5952 {
5957 }
5958 else
5959 {
5962 }
5965 }
5967 /* Handle a "unused" attribute; arguments as in
5968 struct attribute_spec.handler. */
5970 static tree
5973 {
5975 {
5983 {
5988 }
5989 else
5990 {
5993 }
5994 }
5995 else
5996 {
6000 }
6003 }
6005 /* Handle a "externally_visible" attribute; arguments as in
6006 struct attribute_spec.handler. */
6008 static tree
6013 {
6017 {
6020 {
6024 }
6025 }
6026 else
6027 {
6030 }
6033 }
6035 /* Handle a "const" attribute; arguments as in
6036 struct attribute_spec.handler. */
6038 static tree
6041 {
6044 /* See FIXME comment on noreturn in c_common_attribute_table. */
6050 = build_pointer_type
6053 else
6054 {
6057 }
6060 }
6062 /* Handle a "transparent_union" attribute; arguments as in
6063 struct attribute_spec.handler. */
6065 static tree
6069 {
6070 tree type;
6079 {
6080 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6081 the code in finish_struct. */
6083 {
6088 /* A type variant isn't good enough, since we don't a cast
6089 to such a type removed as a no-op. */
6091 }
6095 }
6097 ignored:
6100 }
6102 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6103 get the requested priority for a constructor or destructor,
6104 possibly issuing diagnostics for invalid or reserved
6105 priorities. */
6107 static priority_type
6109 {
6110 HOST_WIDE_INT pri;
6111 tree arg;
6117 {
6120 else
6123 }
6135 {
6138 "destructor priorities from 0 to %d are reserved "
6140 MAX_RESERVED_INIT_PRIORITY);
6141 else
6143 "constructor priorities from 0 to %d are reserved "
6145 MAX_RESERVED_INIT_PRIORITY);
6146 }
6149 invalid:
6152 MAX_INIT_PRIORITY);
6153 else
6155 MAX_INIT_PRIORITY);
6157 }
6159 /* Handle a "constructor" attribute; arguments as in
6160 struct attribute_spec.handler. */
6162 static tree
6166 {
6173 {
6174 priority_type priority;
6179 }
6180 else
6181 {
6184 }
6187 }
6189 /* Handle a "destructor" attribute; arguments as in
6190 struct attribute_spec.handler. */
6192 static tree
6196 {
6203 {
6204 priority_type priority;
6209 }
6210 else
6211 {
6214 }
6217 }
6219 /* Nonzero if the mode is a valid vector mode for this architecture.
6220 This returns nonzero even if there is no hardware support for the
6221 vector mode, but we can emulate with narrower modes. */
6223 static int
6225 {
6229 /* Doh! What's going on? */
6238 /* Hardware support. Woo hoo! */
6244 /* We should probably return 1 if requesting V4DI and we have no DI,
6245 but we have V2DI, but this is probably very unlikely. */
6247 /* If we have support for the inner mode, we can safely emulate it.
6248 We may not have V2DI, but me can emulate with a pair of DIs. */
6250 }
6253 /* Handle a "mode" attribute; arguments as in
6254 struct attribute_spec.handler. */
6256 static tree
6259 {
6267 else
6268 {
6273 tree typefm;
6278 {
6284 }
6286 /* Change this type to have a type with the specified mode.
6287 First check for the special modes. */
6300 else
6303 {
6306 }
6309 {
6312 }
6316 {
6348 }
6350 {
6353 }
6356 {
6361 {
6364 }
6368 else
6371 }
6372 else
6373 {
6374 /* For fixed-point modes, we need to test if the signness of type
6375 and the machine mode are consistent. */
6378 {
6381 }
6382 /* For fixed-point modes, we need to pass saturating info. */
6386 }
6389 {
6392 }
6394 {
6395 /* For enumeral types, copy the precision from the integer
6396 type returned above. If not an INTEGER_TYPE, we can't use
6397 this mode for this type. */
6399 {
6402 }
6405 {
6408 }
6409 else
6410 {
6411 /* We cannot build a type variant, as there's code that assumes
6412 that TYPE_MAIN_VARIANT has the same mode. This includes the
6413 debug generators. Instead, create a subrange type. This
6414 results in all of the enumeral values being emitted only once
6415 in the original, and the subtype gets them by reference. */
6418 else
6421 }
6422 }
6426 {
6429 }
6432 }
6435 }
6437 /* Handle a "section" attribute; arguments as in
6438 struct attribute_spec.handler. */
6440 static tree
6443 {
6447 {
6453 {
6457 {
6459 "section attribute cannot be specified for "
6462 }
6464 /* The decl may have already been given a section attribute
6465 from a previous declaration. Ensure they match. */
6469 {
6473 }
6477 {
6480 }
6481 else
6483 }
6484 else
6485 {
6488 }
6489 }
6490 else
6491 {
6495 }
6498 }
6500 /* Handle a "aligned" attribute; arguments as in
6501 struct attribute_spec.handler. */
6503 static tree
6506 {
6515 {
6519 }
6524 {
6527 }
6529 {
6532 }
6534 {
6537 }
6539 {
6542 /* If we have a TYPE_DECL, then copy the type, so that we
6543 don't accidentally modify a builtin type. See pushdecl. */
6546 {
6553 }
6554 else
6559 }
6562 {
6565 }
6568 {
6573 else
6577 }
6578 else
6579 {
6582 }
6585 }
6587 /* Handle a "weak" attribute; arguments as in
6588 struct attribute_spec.handler. */
6590 static tree
6595 {
6598 {
6601 }
6603 {
6607 }
6611 else
6615 }
6617 /* Handle an "alias" or "ifunc" attribute; arguments as in
6618 struct attribute_spec.handler, except that IS_ALIAS tells us
6619 whether this is an alias as opposed to ifunc attribute. */
6621 static tree
6624 {
6629 {
6632 }
6636 /* A static variable declaration is always a tentative definition,
6637 but the alias is a non-tentative definition which overrides. */
6640 {
6644 }
6648 {
6652 }
6654 /* Note that the very first time we process a nested declaration,
6655 decl_function_context will not be set. Indeed, *would* never
6656 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6657 we do below. After such frobbery, pushdecl would set the context.
6658 In any case, this is never what we want. */
6660 {
6661 tree id;
6665 {
6669 }
6671 /* This counts as a use of the object pointed to. */
6676 else
6677 {
6680 else
6683 }
6686 /* ifuncs are also aliases, so set that attribute too. */
6689 }
6690 else
6691 {
6694 }
6697 }
6699 /* Handle an "alias" or "ifunc" attribute; arguments as in
6700 struct attribute_spec.handler. */
6702 static tree
6705 {
6707 }
6709 /* Handle an "alias" or "ifunc" attribute; arguments as in
6710 struct attribute_spec.handler. */
6712 static tree
6715 {
6717 }
6719 /* Handle a "weakref" attribute; arguments as in struct
6720 attribute_spec.handler. */
6722 static tree
6725 {
6728 /* We must ignore the attribute when it is associated with
6729 local-scoped decls, since attribute alias is ignored and many
6730 such symbols do not even have a DECL_WEAK field. */
6732 || current_function_decl
6734 {
6738 }
6741 {
6745 }
6747 /* The idea here is that `weakref("name")' mutates into `weakref,
6748 alias("name")', and weakref without arguments, in turn,
6749 implicitly adds weak. */
6752 {
6759 }
6760 else
6761 {
6766 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6767 and that isn't supported; and because it wants to add it to
6768 the list of weak decls, which isn't helpful. */
6770 }
6773 }
6775 /* Handle an "visibility" attribute; arguments as in
6776 struct attribute_spec.handler. */
6778 static tree
6782 {
6788 {
6792 {
6794 name);
6796 }
6798 {
6802 }
6803 }
6805 {
6808 }
6811 {
6814 }
6816 /* If this is a type, set the visibility on the type decl. */
6818 {
6823 {
6825 name);
6827 }
6828 }
6838 else
6839 {
6840 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6842 }
6846 {
6860 }
6865 /* Go ahead and attach the attribute to the node as well. This is needed
6866 so we can determine whether we have VISIBILITY_DEFAULT because the
6867 visibility was not specified, or because it was explicitly overridden
6868 from the containing scope. */
6871 }
6873 /* Determine the ELF symbol visibility for DECL, which is either a
6874 variable or a function. It is an error to use this function if a
6875 definition of DECL is not available in this translation unit.
6876 Returns true if the final visibility has been determined by this
6877 function; false if the caller is free to make additional
6878 modifications. */
6880 bool
6882 {
6886 /* If the user explicitly specified the visibility with an
6887 attribute, honor that. DECL_VISIBILITY will have been set during
6888 the processing of the attribute. We check for an explicit
6889 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6890 to distinguish the use of an attribute from the use of a "#pragma
6891 GCC visibility push(...)"; in the latter case we still want other
6892 considerations to be able to overrule the #pragma. */
6894 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6899 /* Set default visibility to whatever the user supplied with
6900 visibility_specified depending on #pragma GCC visibility. */
6902 {
6905 {
6908 /* If visibility changed and DECL already has DECL_RTL, ensure
6909 symbol flags are updated. */
6914 }
6915 }
6917 }
6919 /* Handle an "tls_model" attribute; arguments as in
6920 struct attribute_spec.handler. */
6922 static tree
6925 {
6926 tree id;
6933 {
6936 }
6941 {
6944 }
6954 else
6955 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
6959 }
6961 /* Handle a "no_instrument_function" attribute; arguments as in
6962 struct attribute_spec.handler. */
6964 static tree
6969 {
6973 {
6977 }
6979 {
6983 }
6984 else
6988 }
6990 /* Handle a "malloc" attribute; arguments as in
6991 struct attribute_spec.handler. */
6993 static tree
6996 {
7000 else
7001 {
7004 }
7007 }
7009 /* Handle a "alloc_size" attribute; arguments as in
7010 struct attribute_spec.handler. */
7012 static tree
7015 {
7018 {
7025 {
7030 }
7031 }
7033 }
7035 /* Handle a "fn spec" attribute; arguments as in
7036 struct attribute_spec.handler. */
7038 static tree
7042 {
7047 }
7049 /* Handle a "returns_twice" attribute; arguments as in
7050 struct attribute_spec.handler. */
7052 static tree
7055 {
7058 else
7059 {
7062 }
7065 }
7067 /* Handle a "no_limit_stack" attribute; arguments as in
7068 struct attribute_spec.handler. */
7070 static tree
7075 {
7079 {
7083 }
7085 {
7089 }
7090 else
7094 }
7096 /* Handle a "pure" attribute; arguments as in
7097 struct attribute_spec.handler. */
7099 static tree
7102 {
7105 /* ??? TODO: Support types. */
7106 else
7107 {
7110 }
7113 }
7115 /* Handle a "no vops" attribute; arguments as in
7116 struct attribute_spec.handler. */
7118 static tree
7122 {
7126 }
7128 /* Handle a "deprecated" attribute; arguments as in
7129 struct attribute_spec.handler. */
7131 static tree
7135 {
7143 {
7146 }
7149 {
7159 else
7161 }
7163 {
7168 }
7169 else
7173 {
7176 {
7182 }
7185 else
7187 }
7190 }
7192 /* Handle a "vector_size" attribute; arguments as in
7193 struct attribute_spec.handler. */
7195 static tree
7199 {
7209 {
7212 }
7214 /* Get the vector size (in bytes). */
7217 /* We need to provide for vector pointers, vector arrays, and
7218 functions returning vectors. For example:
7220 __attribute__((vector_size(16))) short *foo;
7222 In this case, the mode is SI, but the type being modified is
7223 HI, so we need to look further. */
7232 /* Get the mode of the type being modified. */
7243 {
7246 }
7249 {
7252 }
7255 {
7258 }
7260 /* Calculate how many units fit in the vector. */
7263 {
7266 }
7270 /* Build back pointers if needed. */
7274 }
7276 /* Handle the "nonnull" attribute. */
7277 static tree
7281 {
7285 /* If no arguments are specified, all pointer arguments should be
7286 non-null. Verify a full prototype is given so that the arguments
7287 will have the correct types when we actually check them later. */
7289 {
7291 {
7294 }
7296 }
7298 /* Argument list specified. Verify that each argument number references
7299 a pointer argument. */
7301 {
7302 tree argument;
7306 {
7311 }
7315 {
7317 {
7321 }
7325 {
7330 }
7333 {
7338 }
7339 }
7340 }
7343 }
7345 /* Check the argument list of a function call for null in argument slots
7346 that are marked as requiring a non-null pointer argument. The NARGS
7347 arguments are passed in the array ARGARRAY.
7348 */
7350 static void
7352 {
7357 {
7359 {
7362 /* Walk the argument list. If we encounter an argument number we
7363 should check for non-null, do it. If the attribute has no args,
7364 then every pointer argument is checked (in which case the check
7365 for pointer type is done in check_nonnull_arg). */
7367 {
7372 }
7373 }
7374 }
7375 }
7377 /* Check that the Nth argument of a function call (counting backwards
7378 from the end) is a (pointer)0. The NARGS arguments are passed in the
7379 array ARGARRAY. */
7381 static void
7383 {
7387 {
7390 tree sentinel;
7392 /* Skip over the named arguments. */
7394 {
7396 len++;
7397 }
7400 {
7403 }
7405 /* The sentinel must be one of the varargs, i.e.
7406 in position >= the number of fixed arguments. */
7408 {
7412 }
7414 /* Validate the sentinel. */
7418 /* Although __null (in C++) is only an integer we allow it
7419 nevertheless, as we are guaranteed that it's exactly
7420 as wide as a pointer, and we don't want to force
7421 users to cast the NULL they have written there.
7422 We warn with -Wstrict-null-sentinel, though. */
7425 }
7426 }
7428 /* Helper for check_function_nonnull; given a list of operands which
7429 must be non-null in ARGS, determine if operand PARAM_NUM should be
7430 checked. */
7432 static bool
7434 {
7438 {
7445 }
7447 }
7449 /* Check that the function argument PARAM (which is operand number
7450 PARAM_NUM) is non-null. This is called by check_function_nonnull
7451 via check_function_arguments_recurse. */
7453 static void
7456 {
7457 /* Just skip checking the argument if it's not a pointer. This can
7458 happen if the "nonnull" attribute was given without an operand
7459 list (which means to check every pointer argument). */
7467 }
7469 /* Helper for nonnull attribute handling; fetch the operand number
7470 from the attribute argument list. */
7472 static bool
7474 {
7475 /* Verify the arg number is a constant. */
7482 }
7484 /* Handle a "nothrow" attribute; arguments as in
7485 struct attribute_spec.handler. */
7487 static tree
7490 {
7493 /* ??? TODO: Support types. */
7494 else
7495 {
7498 }
7501 }
7503 /* Handle a "cleanup" attribute; arguments as in
7504 struct attribute_spec.handler. */
7506 static tree
7509 {
7513 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7514 for global destructors in C++. This requires infrastructure that
7515 we don't have generically at the moment. It's also not a feature
7516 we'd be missing too much, since we do have attribute constructor. */
7518 {
7522 }
7524 /* Verify that the argument is a function in scope. */
7525 /* ??? We could support pointers to functions here as well, if
7526 that was considered desirable. */
7529 {
7533 }
7536 {
7540 }
7542 /* That the function has proper type is checked with the
7543 eventual call to build_function_call. */
7546 }
7548 /* Handle a "warn_unused_result" attribute. No special handling. */
7550 static tree
7554 {
7555 /* Ignore the attribute for functions not returning any value. */
7557 {
7560 }
7563 }
7565 /* Handle a "sentinel" attribute. */
7567 static tree
7570 {
7574 {
7578 }
7579 else
7580 {
7585 {
7589 }
7590 }
7593 {
7597 {
7601 }
7602 else
7603 {
7605 {
7609 }
7610 }
7611 }
7614 }
7616 /* Handle a "type_generic" attribute. */
7618 static tree
7622 {
7623 tree params;
7625 /* Ensure we have a function type. */
7632 /* Ensure we have a variadic function. */
7636 }
7638 /* Handle a "target" attribute. */
7640 static tree
7643 {
7644 /* Ensure we have a function type. */
7646 {
7649 }
7651 flags))
7655 }
7657 /* Arguments being collected for optimization. */
7664 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7665 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7666 false for #pragma GCC optimize. */
7668 bool
7670 {
7678 tree ap;
7680 /* Build up argv vector. Just in case the string is stored away, use garbage
7681 collected strings. */
7686 {
7690 {
7694 }
7697 {
7698 /* Split string into multiple substrings. */
7706 {
7713 {
7717 }
7718 else
7719 {
7722 }
7726 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7727 options. */
7729 {
7734 else
7738 }
7741 {
7744 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7745 itself is -Os, and any other switch begins with a -f. */
7751 }
7756 }
7758 }
7759 }
7769 /* Now parse the options. */
7775 /* Don't allow changing -fstrict-aliasing. */
7780 }
7782 /* For handling "optimize" attribute. arguments as in
7783 struct attribute_spec.handler. */
7785 static tree
7788 {
7789 /* Ensure we have a function type. */
7791 {
7794 }
7795 else
7796 {
7800 /* Save current options. */
7803 /* If we previously had some optimization options, use them as the
7804 default. */
7808 /* Parse options, and update the vector. */
7813 /* Restore current options. */
7815 }
7818 }
7819 \f
7820 /* Check for valid arguments being passed to a function.
7821 ATTRS is a list of attributes. There are NARGS arguments in the array
7822 ARGARRAY. TYPELIST is the list of argument types for the function.
7823 */
7824 void
7826 {
7827 /* Check for null being passed in a pointer argument that must be
7828 non-null. We also need to do this if format checking is enabled. */
7833 /* Check for errors in format strings. */
7840 }
7842 /* Generic argument checking recursion routine. PARAM is the argument to
7843 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7844 once the argument is resolved. CTX is context for the callback. */
7845 void
7850 {
7854 {
7855 /* Strip coercion. */
7859 }
7862 {
7864 tree attrs;
7867 /* See if this is a call to a known internationalization function
7868 that modifies a format arg. Such a function may have multiple
7869 format_arg attributes (for example, ngettext). */
7872 attrs;
7875 {
7876 tree inner_arg;
7877 tree format_num_expr;
7880 call_expr_arg_iterator iter;
7882 /* Extract the argument number, which was previously checked
7883 to be valid. */
7895 {
7900 }
7901 }
7903 /* If we found a format_arg attribute and did a recursive check,
7904 we are done with checking this argument. Otherwise, we continue
7905 and this will be considered a non-literal. */
7908 }
7911 {
7912 /* Check both halves of the conditional expression. */
7918 }
7921 }
7923 /* Checks for a builtin function FNDECL that the number of arguments
7924 NARGS against the required number REQUIRED and issues an error if
7925 there is a mismatch. Returns true if the number of arguments is
7926 correct, otherwise false. */
7928 static bool
7930 {
7932 {
7936 }
7938 {
7942 }
7944 }
7946 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
7947 Returns false if there was an error, otherwise true. */
7949 bool
7951 {
7957 {
7967 {
7969 {
7973 }
7975 }
7985 {
7992 {
7996 }
7998 }
8003 {
8008 {
8012 }
8015 {
8017 fndecl);
8019 }
8021 }
8026 }
8027 }
8029 /* Function to help qsort sort FIELD_DECLs by name order. */
8031 int
8033 {
8038 /* A nontype is "greater" than a type. */
8047 }
8050 gt_pointer_operator new_value;
8054 /* This routine compares two fields like field_decl_cmp but using the
8055 pointer operator in resort_data. */
8057 static int
8059 {
8064 /* A nontype is "greater" than a type. */
8070 {
8077 }
8079 }
8081 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8083 void
8086 gt_pointer_operator new_value,
8088 {
8093 resort_field_decl_cmp);
8094 }
8096 /* Subroutine of c_parse_error.
8097 Return the result of concatenating LHS and RHS. RHS is really
8098 a string literal, its first character is indicated by RHS_START and
8099 RHS_SIZE is its length (including the terminating NUL character).
8101 The caller is responsible for deleting the returned pointer. */
8105 {
8111 }
8113 /* Issue the error given by GMSGID, indicating that it occurred before
8114 TOKEN, which had the associated VALUE. */
8116 void
8119 {
8120 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8130 {
8135 {
8148 }
8152 else
8158 }
8168 {
8173 }
8179 {
8184 }
8185 else
8189 {
8192 }
8193 #undef catenate_messages
8194 }
8196 /* Mapping for cpp message reasons to the options that enable them. */
8198 struct reason_option_codes_t
8199 {
8202 };
8221 };
8223 /* Return the gcc option code associated with the reason for a cpp
8224 message, or 0 if none. */
8226 static int
8228 {
8232 {
8235 }
8237 }
8239 /* Callback from cpp_error for PFILE to print diagnostics from the
8240 preprocessor. The diagnostic is of type LEVEL, with REASON set
8241 to the reason code if LEVEL is represents a warning, at location
8242 LOCATION unless this is after lexing and the compiler's location
8243 should be used instead, with column number possibly overridden by
8244 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8245 the arguments. Returns true if a diagnostic was emitted, false
8246 otherwise. */
8248 bool
8252 {
8253 diagnostic_info diagnostic;
8254 diagnostic_t dlevel;
8259 {
8264 /* Fall through. */
8289 }
8302 }
8304 /* Convert a character from the host to the target execution character
8305 set. cpplib handles this, mostly. */
8307 HOST_WIDE_INT
8309 {
8310 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8311 zero-extended under -fno-signed-char. cpplib insists that characters
8312 and character constants are always unsigned. Hence we must convert
8313 back and forth. */
8321 else
8323 }
8325 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
8326 component references, with STOP_REF, or alternatively an INDIRECT_REF of
8327 NULL, at the bottom; much like the traditional rendering of offsetof as a
8328 macro. Returns the folded and properly cast result. */
8330 static tree
8332 {
8340 {
8356 {
8359 }
8369 {
8373 }
8387 {
8390 }
8394 /* Check if the offset goes beyond the upper bound of the array. */
8396 {
8402 {
8406 {
8407 tree v;
8414 {
8422 }
8423 /* Don't warn if the array might be considered a poor
8424 man's flexible array member with a very permissive
8425 definition thereof. */
8429 "index %E denotes an offset "
8432 }
8433 }
8434 }
8438 /* Handle static members of volatile structs. */
8445 }
8448 }
8450 tree
8452 {
8453 /* Convert back from the internal sizetype to size_t. */
8455 }
8457 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
8458 expression, because B will always be true. */
8460 void
8462 {
8465 "the omitted middle operand in ?: will always be %<true%>, "
8467 }
8469 /* Print an error message for an invalid lvalue. USE says
8470 how the lvalue is being used and so selects the error message. */
8472 void
8474 {
8476 {
8494 }
8495 }
8496 \f
8497 /* *PTYPE is an incomplete array. Complete it with a domain based on
8498 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8499 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8500 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8502 int
8504 {
8511 {
8513 {
8514 int eltsize
8517 }
8519 {
8523 {
8527 }
8528 else
8529 {
8530 tree curindex;
8543 cnt++)
8544 {
8548 else
8549 {
8553 size_one_node);
8554 }
8557 }
8560 }
8561 }
8562 else
8563 {
8564 /* Make an error message unless that happened already. */
8567 }
8568 }
8569 else
8570 {
8574 }
8581 else
8584 /* Using build_distinct_type_copy and modifying things afterward instead
8585 of using build_array_type to create a new type preserves all of the
8586 TYPE_LANG_FLAG_? bits that the front end may have set. */
8592 /* Make sure we have the canonical MAIN_TYPE. */
8595 hashcode);
8598 /* Fix the canonical type. */
8608 else
8613 else
8619 {
8621 /* If we proceed with the array type as it is, we'll eventually
8622 crash in tree_low_cst(). */
8624 }
8628 }
8630 \f
8631 /* Used to help initialize the builtin-types.def table. When a type of
8632 the correct size doesn't exist, use error_mark_node instead of NULL.
8633 The later results in segfaults even when a decl using the type doesn't
8634 get invoked. */
8636 tree
8638 {
8641 }
8643 /* A helper function for resolve_overloaded_builtin in resolving the
8644 overloaded __sync_ builtins. Returns a positive power of 2 if the
8645 first operand of PARAMS is a pointer to a supported data type.
8646 Returns 0 if an error is encountered. */
8648 static int
8650 {
8651 tree type;
8655 {
8658 }
8672 incompatible:
8675 }
8677 /* A helper function for resolve_overloaded_builtin. Adds casts to
8678 PARAMS to make arguments match up with those of FUNCTION. Drops
8679 the variadic arguments at the end. Returns false if some error
8680 was encountered; true on success. */
8682 static bool
8684 {
8686 tree ptype;
8689 /* We've declared the implementation functions to use "volatile void *"
8690 as the pointer parameter, so we shouldn't get any complaints from the
8691 call to check_function_arguments what ever type the user used. */
8695 /* For the rest of the values, we need to cast these to FTYPE, so that we
8696 don't get warnings for passing pointer types, etc. */
8699 {
8700 tree val;
8704 {
8707 }
8709 /* ??? Ideally for the first conversion we'd use convert_for_assignment
8710 so that we get warnings for anything that doesn't match the pointer
8711 type. This isn't portable across the C and C++ front ends atm. */
8718 }
8720 /* The definition of these primitives is variadic, with the remaining
8721 being "an optional list of variables protected by the memory barrier".
8722 No clue what that's supposed to mean, precisely, but we consider all
8723 call-clobbered variables to be protected so we're safe. */
8727 }
8729 /* A helper function for resolve_overloaded_builtin. Adds a cast to
8730 RESULT to make it match the type of the first pointer argument in
8731 PARAMS. */
8733 static tree
8735 {
8739 }
8741 /* Some builtin functions are placeholders for other expressions. This
8742 function should be called immediately after parsing the call expression
8743 before surrounding code has committed to the type of the expression.
8745 LOC is the location of the builtin call.
8747 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
8748 PARAMS is the argument list for the call. The return value is non-null
8749 when expansion is complete, and null if normal processing should
8750 continue. */
8752 tree
8754 {
8757 {
8763 else
8767 }
8769 /* Handle BUILT_IN_NORMAL here. */
8771 {
8788 {
8806 }
8810 }
8811 }
8813 /* Ignoring their sign, return true if two scalar types are the same. */
8814 bool
8816 {
8823 /* Equality works here because c_common_signed_type uses
8824 TYPE_MAIN_VARIANT. */
8827 }
8829 /* Check for missing format attributes on function pointers. LTYPE is
8830 the new type or left-hand side type. RTYPE is the old type or
8831 right-hand side type. Returns TRUE if LTYPE is missing the desired
8832 attribute. */
8834 bool
8836 {
8838 tree ra;
8844 {
8845 tree la;
8850 }
8851 else
8853 }
8855 /* Subscripting with type char is likely to lose on a machine where
8856 chars are signed. So warn on any machine, but optionally. Don't
8857 warn for unsigned char since that type is safe. Don't warn for
8858 signed char because anyone who uses that must have done so
8859 deliberately. Furthermore, we reduce the false positive load by
8860 warning only for non-constant value of type char. */
8862 void
8864 {
8868 }
8870 /* Implement -Wparentheses for the unexpected C precedence rules, to
8871 cover cases like x + y << z which readers are likely to
8872 misinterpret. We have seen an expression in which CODE is a binary
8873 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
8874 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
8875 CODE_RIGHT may be ERROR_MARK, which means that that side of the
8876 expression was not formed using a binary or unary operator, or it
8877 was enclosed in parentheses. */
8879 void
8883 {
8887 /* This macro tests that the expression ARG with original tree code
8888 CODE appears to be a boolean expression. or the result of folding a
8889 boolean expression. */
8890 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
8891 (truth_value_p (TREE_CODE (ARG)) \
8892 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
8894 || ((CODE) != INTEGER_CST \
8895 && (integer_onep (ARG) || integer_zerop (ARG))))
8898 {
8930 /* Check cases like x|y==z */
8935 /* Check cases like !x | y */
8949 /* Check cases like x^y==z */
8963 /* Check cases like x&y==z */
8968 /* Check cases like !x & y */
8999 }
9000 #undef NOT_A_BOOLEAN_EXPR_P
9001 }
9003 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9005 void
9007 {
9009 {
9012 else
9014 }
9015 }
9017 #ifndef TARGET_HAS_TARGETCM
9019 #endif
9021 /* Warn for division by zero according to the value of DIVISOR. LOC
9022 is the location of the division operator. */
9024 void
9026 {
9027 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9028 about division by zero. Do not issue a warning if DIVISOR has a
9029 floating-point type, since we consider 0.0/0.0 a valid way of
9030 generating a NaN. */
9034 }
9036 /* Subroutine of build_binary_op. Give warnings for comparisons
9037 between signed and unsigned quantities that may fail. Do the
9038 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9039 so that casts will be considered, but default promotions won't
9040 be.
9042 LOCATION is the location of the comparison operator.
9044 The arguments of this function map directly to local variables
9045 of build_binary_op. */
9047 void
9052 {
9057 /* In C++, check for comparison of different enum types. */
9063 {
9067 }
9069 /* Do not warn if the comparison is being done in a signed type,
9070 since the signed type will only be chosen if it can represent
9071 all the values of the unsigned type. */
9074 /* Do not warn if both operands are unsigned. */
9077 else
9078 {
9084 else
9092 /* Do not warn if the signed quantity is an unsuffixed integer
9093 literal (or some static constant expression involving such
9094 literals or a conditional expression involving such literals)
9095 and it is non-negative. */
9098 /* Do not warn if the comparison is an equality operation, the
9099 unsigned quantity is an integral constant, and it would fit
9100 in the result if the result were signed. */
9105 /* In C, do not warn if the unsigned quantity is an enumeration
9106 constant and its maximum value would fit in the result if the
9107 result were signed. */
9113 else
9115 OPT_Wsign_compare,
9117 }
9119 /* Warn if two unsigned values are being compared in a size larger
9120 than their original size, and one (and only one) is the result of
9121 a `~' operator. This comparison will always fail.
9123 Also warn if one operand is a constant, and the constant does not
9124 have all bits set that are set in the ~ operand when it is
9125 extended. */
9132 {
9139 {
9140 tree primop;
9146 {
9150 }
9151 else
9152 {
9156 }
9161 {
9164 {
9168 else
9171 }
9172 }
9173 }
9181 }
9182 }
9184 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
9185 type via c_common_type. If -Wdouble-promotion is in use, and the
9186 conditions for warning have been met, issue a warning. GMSGID is
9187 the warning message. It must have two %T specifiers for the type
9188 that was converted (generally "float") and the type to which it was
9189 converted (generally "double), respectively. LOC is the location
9190 to which the awrning should refer. */
9192 void
9195 {
9196 tree source_type;
9200 /* If the conversion will not occur at run-time, there is no need to
9201 warn about it. */
9213 else
9216 }
9218 /* Setup a TYPE_DECL node as a typedef representation.
9220 X is a TYPE_DECL for a typedef statement. Create a brand new
9221 ..._TYPE node (which will be just a variant of the existing
9222 ..._TYPE node with identical properties) and then install X
9223 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
9225 The whole point here is to end up with a situation where each
9226 and every ..._TYPE node the compiler creates will be uniquely
9227 associated with AT MOST one node representing a typedef name.
9228 This way, even though the compiler substitutes corresponding
9229 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
9230 early on, later parts of the compiler can always do the reverse
9231 translation and get back the corresponding typedef name. For
9232 example, given:
9234 typedef struct S MY_TYPE;
9235 MY_TYPE object;
9237 Later parts of the compiler might only know that `object' was of
9238 type `struct S' if it were not for code just below. With this
9239 code however, later parts of the compiler see something like:
9241 struct S' == struct S
9242 typedef struct S' MY_TYPE;
9243 struct S' object;
9245 And they can then deduce (from the node for type struct S') that
9246 the original object declaration was:
9248 MY_TYPE object;
9250 Being able to do this is important for proper support of protoize,
9251 and also for generating precise symbolic debugging information
9252 which takes full account of the programmer's (typedef) vocabulary.
9254 Obviously, we don't want to generate a duplicate ..._TYPE node if
9255 the TYPE_DECL node that we are now processing really represents a
9256 standard built-in type. */
9258 void
9260 {
9264 {
9267 }
9270 {
9278 }
9279 }
9281 /* Record the types used by the current global variable declaration
9282 being parsed, so that we can decide later to emit their debug info.
9283 Those types are in types_used_by_cur_var_decl, and we are going to
9284 store them in the types_used_by_vars_hash hash table.
9285 DECL is the declaration of the global variable that has been parsed. */
9287 void
9289 {
9293 {
9296 }
9297 }
9299 /* The C and C++ parsers both use vectors to hold function arguments.
9300 For efficiency, we keep a cache of unused vectors. This is the
9301 cache. */
9308 /* Return a new vector from the cache. If the cache is empty,
9309 allocate a new vector. These vectors are GC'ed, so it is OK if the
9310 pointer is not released.. */
9314 {
9317 else
9318 {
9319 /* Passing 0 to VEC_alloc returns NULL, and our callers require
9320 that we always return a non-NULL value. The vector code uses
9321 4 when growing a NULL vector, so we do too. */
9323 }
9324 }
9326 /* Release a vector of trees back to the cache. */
9328 void
9330 {
9332 {
9335 }
9336 }
9338 /* Get a new tree vector holding a single tree. */
9342 {
9346 }
9348 /* Get a new tree vector which is a copy of an existing one. */
9352 {
9355 tree t;
9362 }