| blob | 502613ae8df41de7c43647267358431142c0fd75 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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 C11) dialect of C. */
221 /* Nonzero means use the ISO C11 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 excessively recursive template instantiations.
259 The default is lower than the 1024 recommended by the C++0x standard
260 because G++ runs out of stack before 1024 with highly recursive template
261 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
265 /* The elements of `ridpointers' are identifier nodes for the reserved
266 type names and storage classes. It is indexed by a RID_... value. */
271 /* Nonzero means don't warn about problems that occur when the code is
272 executed. */
275 /* Whether we are building a boolean conversion inside
276 convert_for_assignment, or some other late binary operation. If
277 build_binary_op is called for C (from code shared by C and C++) in
278 this case, then the operands have already been folded and the
279 result will not be folded again, so C_MAYBE_CONST_EXPR should not
280 be generated. */
283 /* Whether lexing has been completed, so subsequent preprocessor
284 errors should use the compiler's input_location. */
287 /* Information about how a function name is generated. */
288 struct fname_var_t
289 {
293 };
295 /* The three ways of getting then name of the current function. */
298 {
299 /* C99 compliant __func__, must be first. */
301 /* GCC __FUNCTION__ compliant. */
303 /* GCC __PRETTY_FUNCTION__ compliant. */
306 };
308 /* Global visibility options. */
385 /* Reserved words. The third field is a mask: keywords are disabled
386 if they match the mask.
388 Masks for languages:
389 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
390 C --std=c99: D_CXXONLY | D_OBJC
391 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
392 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
393 C++ --std=c0x: D_CONLY | D_OBJC
394 ObjC++ is like C++ except that D_OBJC is not set
396 If -fno-asm is used, D_ASM is added to the mask. If
397 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
398 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
399 In C with -Wc++-compat, we warn if D_CXXWARN is set.
401 Note the complication of the D_CXX_OBJC keywords. These are
402 reserved words such as 'class'. In C++, 'class' is a reserved
403 word. In Objective-C++ it is too. In Objective-C, it is a
404 reserved word too, but only if it follows an '@' sign.
405 */
407 {
560 /* These Objective-C keywords are recognized only immediately after
561 an '@'. */
578 /* These are recognized only in protocol-qualifier context
579 (see above) */
586 /* These are recognized inside a property attribute list */
595 };
600 /* Table of machine-independent attributes common to all C-like languages. */
602 {
603 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
604 affects_type_identity } */
611 /* FIXME: logically, noreturn attributes should be listed as
612 "false, true, true" and apply to function types. But implementing this
613 would require all the places in the compiler that use TREE_THIS_VOLATILE
614 on a decl to identify non-returning functions to be located and fixed
615 to check the function type instead. */
640 /* The same comments as for noreturn attributes apply to const ones. */
664 handle_no_instrument_function_attribute,
682 /* ??? These two attributes didn't make the transition from the
683 Intel language document to the multi-vendor language document. */
688 /* For internal use (marking of builtins) only. The name contains space
689 to prevent its usage in source code. */
711 /* For internal use (marking of builtins) only. The name contains space
712 to prevent its usage in source code. */
729 /* For internal use only. The leading '*' both prevents its usage in
730 source code and signals that it may be overridden by machine tables. */
735 /* For internal use (marking of builtins and runtime functions) only.
736 The name contains space to prevent its usage in source code. */
740 };
742 /* Give the specifications for the format attributes, used by C and all
743 descendants. */
746 {
747 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
748 affects_type_identity } */
754 };
756 /* Return identifier for address space AS. */
760 {
764 }
766 /* Push current bindings for the function name VAR_DECLS. */
768 void
770 {
775 {
779 {
781 saved);
783 }
784 }
786 /* Normally they'll have been NULL, so only push if we've got a
787 stack, or they are non-NULL. */
789 saved_function_name_decls);
790 }
792 /* Finish up the current bindings, adding them into the current function's
793 statement tree. This must be done _before_ finish_stmt_tree is called.
794 If there is no current function, we must be at file scope and no statements
795 are involved. Pop the previous bindings. */
797 void
799 {
808 {
816 }
822 {
823 /* We had saved values, restore them. */
824 tree saved;
827 {
832 }
834 }
836 }
838 /* Return the text name of the current function, suitably prettified
839 by PRETTY_P. Return string must be freed by caller. */
843 {
850 {
853 }
866 {
869 }
872 }
874 /* Return the VAR_DECL for a const char array naming the current
875 function. If the VAR_DECL has not yet been created, create it
876 now. RID indicates how it should be formatted and IDENTIFIER_NODE
877 ID is its name (unfortunately C and C++ hold the RID values of
878 keywords in different places, so we can't derive RID from ID in
879 this language independent code. LOC is the location of the
880 function. */
882 tree
884 {
894 {
895 /* If a tree is built here, it would normally have the lineno of
896 the current statement. Later this tree will be moved to the
897 beginning of the function and this line number will be wrong.
898 To avoid this problem set the lineno to 0 here; that prevents
899 it from appearing in the RTL. */
900 tree stmts;
908 saved_function_name_decls
912 }
917 }
919 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
921 tree
923 {
928 /* Compute the number of elements, for the array type. */
930 {
933 }
935 {
938 }
940 {
943 }
944 else
945 {
948 }
950 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
951 limit in C++98 Annex B is very large (65536) and is not normative,
952 so we do not diagnose it (warn_overlength_strings is forced off
953 in c_common_post_options). */
955 {
959 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
960 separate the %d from the 'C'. 'ISO' should not be
961 translated, but it may be moved after 'C%d' in languages
962 where modifiers follow nouns. */
964 "string length %qd is greater than the length %qd "
967 }
969 /* Create the array type for the string constant. The ISO C++
970 standard says that a string literal has type `const char[N]' or
971 `const wchar_t[N]'. We use the same logic when invoked as a C
972 front-end with -Wwrite-strings.
973 ??? We should change the type of an expression depending on the
974 state of a warning flag. We should just be warning -- see how
975 this is handled in the C++ front-end for the deprecated implicit
976 conversion from string literals to `char*' or `wchar_t*'.
978 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
979 array type being the unqualified version of that type.
980 Therefore, if we are constructing an array of const char, we must
981 construct the matching unqualified array type first. The C front
982 end does not require this, but it does no harm, so we do it
983 unconditionally. */
994 }
995 \f
996 /* If DISABLE is true, stop issuing warnings. This is used when
997 parsing code that we know will not be executed. This function may
998 be called multiple times, and works as a stack. */
1000 static void
1002 {
1004 {
1007 }
1008 }
1010 /* If ENABLE is true, reenable issuing warnings. */
1012 static void
1014 {
1016 {
1019 }
1020 }
1022 /* Fully fold EXPR, an expression that was not folded (beyond integer
1023 constant expressions and null pointer constants) when being built
1024 up. If IN_INIT, this is in a static initializer and certain
1025 changes are made to the folding done. Clear *MAYBE_CONST if
1026 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1027 expression because it contains an evaluated operator (in C99) or an
1028 operator outside of sizeof returning an integer constant (in C90)
1029 not permitted in constant expressions, or because it contains an
1030 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1031 set to true by callers before calling this function.) Return the
1032 folded expression. Function arguments have already been folded
1033 before calling this function, as have the contents of SAVE_EXPR,
1034 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1035 C_MAYBE_CONST_EXPR. */
1037 tree
1039 {
1040 tree ret;
1046 /* This function is not relevant to C++ because C++ folds while
1047 parsing, and may need changes to be correct for C++ when C++
1048 stops folding while parsing. */
1055 {
1058 }
1065 }
1067 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1068 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1069 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1070 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1071 both evaluated and unevaluated subexpressions while
1072 *MAYBE_CONST_ITSELF is carried from only evaluated
1073 subexpressions). */
1075 static tree
1078 {
1090 /* This function is not relevant to C++ because C++ folds while
1091 parsing, and may need changes to be correct for C++ when C++
1092 stops folding while parsing. */
1096 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1097 anything else not counted as an expression cannot usefully be
1098 folded further at this point. */
1104 /* Operands of variable-length expressions (function calls) have
1105 already been folded, as have __builtin_* function calls, and such
1106 expressions cannot occur in constant expressions. */
1108 {
1112 }
1115 {
1124 else
1127 }
1129 /* Assignment, increment, decrement, function call and comma
1130 operators, and statement expressions, cannot occur in constant
1131 expressions if evaluated / outside of sizeof. (Function calls
1132 were handled above, though VA_ARG_EXPR is treated like a function
1133 call here, and statement expressions are handled through
1134 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1136 {
1156 }
1158 /* Fold individual tree codes as appropriate. */
1160 {
1162 /* Any non-constancy will have been marked in a containing
1163 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1171 maybe_const_itself);
1176 {
1179 }
1188 maybe_const_itself);
1191 maybe_const_itself);
1197 {
1201 }
1243 /* Binary operations evaluating both arguments (increment and
1244 decrement are binary internally in GCC). */
1248 maybe_const_itself);
1256 /* The RHS of a MODIFY_EXPR was fully folded when building that
1257 expression for the sake of conversion warnings. */
1260 maybe_const_itself);
1264 ret = in_init
1267 else
1278 CASE_CONVERT:
1288 /* Unary operations. */
1291 maybe_const_itself);
1295 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1296 not prepared to deal with them if they occur in initializers. */
1304 ret = in_init
1307 else
1312 {
1316 }
1318 {
1321 CASE_CONVERT:
1322 /* Don't warn about explicit conversions. We will already
1323 have warned about suspect implicit conversions. */
1330 }
1335 /* Binary operations not necessarily evaluating both
1336 arguments. */
1343 ? truthvalue_false_node
1351 ret = in_init
1354 else
1359 && op0_const
1360 && op0_const_self
1366 && op0_const_self
1392 else
1397 && op0_const
1398 && op0_const_self
1402 && op0_const_self
1406 && op0_const
1407 && op0_const_self
1411 && op0_const_self
1417 /* Each case where an operand with excess precision may be
1418 encountered must remove the EXCESS_PRECISION_EXPR around
1419 inner operands and possibly put one around the whole
1420 expression or possibly convert to the semantic type (which
1421 c_fully_fold does); we cannot tell at this stage which is
1422 appropriate in any particular case. */
1426 /* Various codes may appear through folding built-in functions
1427 and their arguments. */
1429 }
1431 out:
1432 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1433 have been done by this point, so remove them again. */
1437 {
1441 }
1445 }
1447 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1448 return EXP. Otherwise, return either EXP or its known constant
1449 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1450 Is the BLKmode test appropriate? */
1452 tree
1454 {
1455 tree ret;
1457 /* This function is only used by C, for c_fully_fold and other
1458 optimization, and may not be correct for C++. */
1469 /* Avoid unwanted tree sharing between the initializer and current
1470 function's body where the tree can be modified e.g. by the
1471 gimplifier. */
1475 }
1477 /* Print a warning if a constant expression had overflow in folding.
1478 Invoke this function on every expression that the language
1479 requires to be a constant expression.
1480 Note the ANSI C standard says it is erroneous for a
1481 constant expression to overflow. */
1483 void
1485 {
1493 }
1495 /* The same as above but print an unconditional error. */
1496 void
1498 {
1505 }
1507 /* Print a warning if an expression had overflow in folding and its
1508 operands hadn't.
1510 Invoke this function on every expression that
1511 (1) appears in the source code, and
1512 (2) is a constant expression that overflowed, and
1513 (3) is not already checked by convert_and_check;
1514 however, do not invoke this function on operands of explicit casts
1515 or when the expression is the result of an operator and any operand
1516 already overflowed. */
1518 void
1520 {
1525 {
1554 }
1555 }
1557 /* Warn about uses of logical || / && operator in a context where it
1558 is likely that the bitwise equivalent was intended by the
1559 programmer. We have seen an expression in which CODE is a binary
1560 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1561 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1562 void
1566 {
1578 /* Warn if &&/|| are being used in a context where it is
1579 likely that the bitwise equivalent was intended by the
1580 programmer. That is, an expression such as op && MASK
1581 where op should not be any boolean expression, nor a
1582 constant, and mask seems to be a non-boolean integer constant. */
1590 {
1594 else
1599 }
1601 /* We do not warn for constants because they are typical of macro
1602 expansions that test for features. */
1606 /* This warning only makes sense with logical operands. */
1614 /* We first test whether either side separately is trivially true
1615 (with OR) or trivially false (with AND). If so, do not warn.
1616 This is a common idiom for testing ranges of data types in
1617 portable code. */
1624 /* If this is an OR operation, invert both sides; now, the result
1625 should be always false to get a warning. */
1639 /* If this is an OR operation, invert both sides; now, the result
1640 should be always false to get a warning. */
1648 /* If both expressions have the same operand, if we can merge the
1649 ranges, and if the range test is always false, then warn. */
1656 {
1659 "logical %<or%> "
1661 else
1663 "logical %<and%> "
1665 }
1666 }
1669 /* Warn if EXP contains any computations whose results are not used.
1670 Return true if a warning is printed; false otherwise. LOCUS is the
1671 (potential) location of the expression. */
1673 bool
1675 {
1676 restart:
1680 /* Don't warn about void constructs. This includes casting to void,
1681 void function calls, and statement expressions with a final cast
1682 to void. */
1690 {
1706 /* For a binding, warn if no side effect within it. */
1718 /* In && or ||, warn if 2nd operand has no side effect. */
1725 /* Let people do `(foo (), 0)' without a warning. */
1732 /* If this is an expression with side effects, don't warn; this
1733 case commonly appears in macro expansions. */
1739 /* Don't warn about automatic dereferencing of references, since
1740 the user cannot control it. */
1742 {
1745 }
1746 /* Fall through. */
1749 /* Referencing a volatile value is a side effect, so don't warn. */
1754 /* If this is an expression which has no operands, there is no value
1755 to be unused. There are no such language-independent codes,
1756 but front ends may define such. */
1760 warn:
1762 }
1763 }
1766 /* Print a warning about casts that might indicate violation
1767 of strict aliasing rules if -Wstrict-aliasing is used and
1768 strict aliasing mode is in effect. OTYPE is the original
1769 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1771 bool
1773 {
1774 /* Strip pointer conversion chains and get to the correct original type. */
1782 /* If the type we are casting to is a ref-all pointer
1783 dereferencing it is always valid. */
1790 {
1791 /* Casting the address of an object to non void pointer. Warn
1792 if the cast breaks type based aliasing. */
1794 {
1798 }
1799 else
1800 {
1801 /* warn_strict_aliasing >= 3. This includes the default (3).
1802 Only warn if the cast is dereferenced immediately. */
1803 alias_set_type set1 =
1809 {
1813 }
1816 {
1820 }
1821 }
1822 }
1823 else
1825 {
1826 /* At this level, warn for any conversions, even if an address is
1827 not taken in the same statement. This will likely produce many
1828 false positives, but could be useful to pinpoint problems that
1829 are not revealed at higher levels. */
1834 {
1838 }
1839 }
1842 }
1844 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1845 sizeof as last operand of certain builtins. */
1847 void
1851 {
1866 {
1872 /* FALLTHRU */
1892 }
1907 {
1911 {
1914 "argument to %<sizeof%> in %qD call is the same "
1915 "expression as the destination; did you mean to "
1921 "argument to %<sizeof%> in %qD call is the same "
1922 "expression as the destination; did you mean to "
1924 else
1926 "argument to %<sizeof%> in %qD call is the same "
1927 "expression as the destination; did you mean to "
1930 }
1933 && !strop
1936 {
1938 "argument to %<sizeof%> in %qD call is the same "
1939 "pointer type %qT as the destination; expected %qT "
1943 }
1944 }
1947 {
1951 {
1954 "argument to %<sizeof%> in %qD call is the same "
1955 "expression as the source; did you mean to "
1961 "argument to %<sizeof%> in %qD call is the same "
1962 "expression as the source; did you mean to "
1964 else
1966 "argument to %<sizeof%> in %qD call is the same "
1967 "expression as the source; did you mean to "
1970 }
1973 && !strop
1976 {
1978 "argument to %<sizeof%> in %qD call is the same "
1979 "pointer type %qT as the source; expected %qT "
1983 }
1984 }
1985 }
1987 /* Warn for unlikely, improbable, or stupid DECL declarations
1988 of `main'. */
1990 void
1992 {
1993 function_args_iterator iter;
1994 tree type;
1998 {
1999 /* XXX void_type_node belies the abstraction. */
2005 {
2027 "third argument of %q+D should probably be "
2030 }
2031 }
2033 /* It is intentional that this message does not mention the third
2034 argument because it's only mentioned in an appendix of the
2035 standard. */
2039 }
2041 /* True if pointers to distinct types T1 and T2 can be converted to
2042 each other without an explicit cast. Only returns true for opaque
2043 vector types. */
2044 bool
2046 {
2053 }
2055 /* True if vector types T1 and T2 can be converted to each other
2056 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2057 can only be converted with -flax-vector-conversions yet that is not
2058 in effect, emit a note telling the user about that option if such
2059 a note has not previously been emitted. */
2060 bool
2062 {
2070 convertible_lax =
2085 {
2088 "conversions between vectors with differing "
2090 }
2093 }
2095 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2096 and have vector types, V0 has the same type as V1, and the number of
2097 elements of V0, V1, MASK is the same.
2099 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2100 called with two arguments. In this case implementation passes the
2101 first argument twice in order to share the same tree code. This fact
2102 could enable the mask-values being twice the vector length. This is
2103 an implementation accident and this semantics is not guaranteed to
2104 the user. */
2105 tree
2107 {
2108 tree ret;
2114 {
2117 }
2125 {
2129 }
2133 {
2136 }
2139 {
2143 }
2149 {
2151 "argument vector(s) and the mask vector should "
2154 }
2158 {
2162 }
2165 {
2166 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2172 else
2173 {
2176 }
2180 }
2188 }
2190 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2191 to integral type. */
2193 static tree
2195 {
2200 {
2201 /* C++0x scoped enumerations don't implicitly convert to integral
2202 type; if we stripped an explicit conversion to a larger type we
2203 need to replace it so common_type will still work. */
2207 }
2209 }
2211 /* This is a helper function of build_binary_op.
2213 For certain operations if both args were extended from the same
2214 smaller type, do the arithmetic in that type and then extend.
2216 BITWISE indicates a bitwise operation.
2217 For them, this optimization is safe only if
2218 both args are zero-extended or both are sign-extended.
2219 Otherwise, we might change the result.
2220 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2221 but calculated in (unsigned short) it would be (unsigned short)-1.
2222 */
2223 tree
2225 {
2229 tree type;
2231 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2232 excessive narrowing when we call get_narrower below. For
2233 example, suppose that OP0 is of unsigned int extended
2234 from signed char and that RESULT_TYPE is long long int.
2235 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2236 like
2238 (long long int) (unsigned int) signed_char
2240 which get_narrower would narrow down to
2242 (unsigned int) signed char
2244 If we do not cast OP0 first, get_narrower would return
2245 signed_char, which is inconsistent with the case of the
2246 explicit cast. */
2253 /* UNS is 1 if the operation to be done is an unsigned one. */
2256 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2257 but it *requires* conversion to FINAL_TYPE. */
2268 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2270 /* For bitwise operations, signedness of nominal type
2271 does not matter. Consider only how operands were extended. */
2275 /* Note that in all three cases below we refrain from optimizing
2276 an unsigned operation on sign-extended args.
2277 That would not be valid. */
2279 /* Both args variable: if both extended in same way
2280 from same width, do it in that width.
2281 Do it unsigned if args were zero-extended. */
2288 return c_common_signed_or_unsigned_type
2295 && (type
2306 && (type
2314 }
2316 /* Checks if expression EXPR of real/integer type cannot be converted
2317 to the real/integer type TYPE. Function returns true when:
2318 * EXPR is a constant which cannot be exactly converted to TYPE
2319 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2320 for EXPR type and TYPE being both integers or both real.
2321 * EXPR is not a constant of real type and TYPE is an integer.
2322 * EXPR is not a constant of integer type which cannot be
2323 exactly converted to real type.
2324 Function allows conversions between types of different signedness and
2325 does not return true in that case. Function can produce signedness
2326 warnings if PRODUCE_WARNS is true. */
2327 bool
2329 {
2335 {
2336 /* Warn for real constant that is not an exact integer converted
2337 to integer type. */
2340 {
2343 }
2344 /* Warn for an integer constant that does not fit into integer type. */
2348 {
2351 {
2355 }
2357 {
2361 }
2362 else
2364 }
2366 {
2367 /* Warn for an integer constant that does not fit into real type. */
2369 {
2373 }
2374 /* Warn for a real constant that does not fit into a smaller
2375 real type. */
2378 {
2382 }
2383 }
2384 }
2385 else
2386 {
2387 /* Warn for real types converted to integer types. */
2394 {
2395 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2399 /* Don't warn for short y; short x = ((int)y & 0xff); */
2403 {
2404 /* If both args were extended from a shortest type,
2405 use that type if that is safe. */
2412 {
2418 /* If one of the operands is a non-negative constant
2419 that fits in the target type, then the type of the
2420 other operand does not matter. */
2429 /* If constant is unsigned and fits in the target
2430 type, then the result will also fit. */
2432 && unsigned0
2435 && unsigned1
2438 }
2439 }
2440 /* Warn for integer types converted to smaller integer types. */
2444 /* When they are the same width but different signedness,
2445 then the value may change. */
2448 /* Even when converted to a bigger type, if the type is
2449 unsigned but expr is signed, then negative values
2450 will be changed. */
2456 }
2458 /* Warn for integer types converted to real types if and only if
2459 all the range of values of the integer type cannot be
2460 represented by the real type. */
2463 {
2467 /* Don't warn about char y = 0xff; float x = (int) y; */
2479 }
2481 /* Warn for real types converted to smaller real types. */
2486 }
2489 }
2491 /* Warns if the conversion of EXPR to TYPE may alter a value.
2492 This is a helper function for warnings_for_convert_and_check. */
2494 static void
2496 {
2504 {
2517 /* Conversion from boolean to a signed:1 bit-field (which only
2518 can hold the values 0 and -1) doesn't lose information - but
2519 it does change the value. */
2534 {
2535 /* In case of COND_EXPR, if both operands are constants or
2536 COND_EXPR, then we do not care about the type of COND_EXPR,
2537 only about the conversion of each operand. */
2545 {
2549 }
2550 /* Fall through. */
2551 }
2558 }
2559 }
2561 /* Produce warnings after a conversion. RESULT is the result of
2562 converting EXPR to TYPE. This is a helper function for
2563 convert_and_check and cp_convert_and_check. */
2565 void
2567 {
2574 {
2575 /* Do not diagnose overflow in a constant expression merely
2576 because a conversion overflowed. */
2581 {
2582 /* This detects cases like converting -129 or 256 to
2583 unsigned char. */
2587 else
2589 }
2593 /* No warning for converting 0x80000000 to int. */
2601 else
2603 }
2608 else
2610 }
2613 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2614 Invoke this function on every expression that is converted implicitly,
2615 i.e. because of language rules and not because of an explicit cast. */
2617 tree
2619 {
2620 tree result;
2621 tree expr_for_warning;
2623 /* Convert from a value with possible excess precision rather than
2624 via the semantic type, but do not warn about values not fitting
2625 exactly in the semantic type. */
2627 {
2633 }
2634 else
2648 }
2649 \f
2650 /* A node in a list that describes references to variables (EXPR), which are
2651 either read accesses if WRITER is zero, or write accesses, in which case
2652 WRITER is the parent of EXPR. */
2653 struct tlist
2654 {
2657 };
2659 /* Used to implement a cache the results of a call to verify_tree. We only
2660 use this for SAVE_EXPRs. */
2661 struct tlist_cache
2662 {
2666 tree expr;
2667 };
2669 /* Obstack to use when allocating tlist structures, and corresponding
2670 firstobj. */
2674 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2675 warnings. */
2677 /* SAVE_EXPRs need special treatment. We process them only once and then
2678 cache the results. */
2690 /* Create a new struct tlist and fill in its fields. */
2693 {
2700 }
2702 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2703 is nonnull, we ignore any node we find which has a writer equal to it. */
2705 static void
2707 {
2709 {
2716 }
2717 }
2719 /* Merge the nodes of ADD into TO. This merging process is done so that for
2720 each variable that already exists in TO, no new node is added; however if
2721 there is a write access recorded in ADD, and an occurrence on TO is only
2722 a read access, then the occurrence in TO will be modified to record the
2723 write. */
2725 static void
2727 {
2734 {
2741 {
2745 }
2747 {
2751 }
2753 }
2754 }
2756 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2757 references in list LIST conflict with it, excluding reads if ONLY writers
2758 is nonzero. */
2760 static void
2763 {
2766 /* Avoid duplicate warnings. */
2772 {
2776 {
2781 }
2783 }
2784 }
2786 /* Given a list LIST of references to variables, find whether any of these
2787 can cause conflicts due to missing sequence points. */
2789 static void
2791 {
2795 {
2798 }
2799 }
2801 /* Return nonzero if X is a tree that can be verified by the sequence point
2802 warnings. */
2803 static int
2805 {
2812 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2813 (lvalue_p) crash on TRY/CATCH. */
2820 /* No point to track non-const calls, they will never satisfy
2821 operand_equal_p. */
2829 }
2831 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2832 static bool
2834 {
2836 }
2838 /* Walk the tree X, and record accesses to variables. If X is written by the
2839 parent tree, WRITER is the parent.
2840 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2841 expression or its only operand forces a sequence point, then everything up
2842 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2843 in PNO_SP.
2844 Once we return, we will have emitted warnings if any subexpression before
2845 such a sequence point could be undefined. On a higher level, however, the
2846 sequence point may not be relevant, and we'll merge the two lists.
2848 Example: (b++, a) + b;
2849 The call that processes the COMPOUND_EXPR will store the increment of B
2850 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2851 processes the PLUS_EXPR will need to merge the two lists so that
2852 eventually, all accesses end up on the same list (and we'll warn about the
2853 unordered subexpressions b++ and b.
2855 A note on merging. If we modify the former example so that our expression
2856 becomes
2857 (b++, b) + a
2858 care must be taken not simply to add all three expressions into the final
2859 PNO_SP list. The function merge_tlist takes care of that by merging the
2860 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2861 way, so that no more than one access to B is recorded. */
2863 static void
2865 tree writer)
2866 {
2871 /* X may be NULL if it is the operand of an empty statement expression
2872 ({ }). */
2876 restart:
2884 {
2916 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2917 two first, to avoid warning for (a ? b++ : b++). */
2933 /* Expressions inside the LHS are not ordered wrt. the sequence points
2934 in the RHS. Example:
2935 *a = (a++, 2)
2936 Despite the fact that the modification of "a" is in the before_sp
2937 list (tmp_before), it conflicts with the use of "a" in the LHS.
2938 We can handle this by adding the contents of tmp_list3
2939 to those of tmp_before, and redoing the collision warnings for that
2940 list. */
2943 /* Exclude the LHS itself here; we first have to merge it into the
2944 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2945 didn't exclude the LHS, we'd get it twice, once as a read and once
2946 as a write. */
2957 /* We need to warn about conflicts among arguments and conflicts between
2958 args and the function address. Side effects of the function address,
2959 however, are not ordered by the sequence point of the call. */
2960 {
2961 call_expr_arg_iterator iter;
2962 tree arg;
2966 {
2971 }
2976 }
2979 /* Scan all the list, e.g. indices of multi dimensional array. */
2981 {
2987 }
2991 {
2998 {
3010 {
3014 }
3017 }
3021 }
3031 /* For other expressions, simply recurse on their operands.
3032 Manual tail recursion for unary expressions.
3033 Other non-expressions need not be processed. */
3035 {
3039 }
3041 {
3045 {
3050 }
3051 }
3053 }
3054 }
3056 /* Try to warn for undefined behavior in EXPR due to missing sequence
3057 points. */
3059 DEBUG_FUNCTION void
3061 {
3067 {
3070 }
3075 }
3076 \f
3077 /* Validate the expression after `case' and apply default promotions. */
3079 static tree
3081 {
3086 /* Promote char or short to int. */
3089 {
3092 }
3097 }
3098 \f
3099 /* See if the case values LOW and HIGH are in the range of the original
3100 type (i.e. before the default conversion to int) of the switch testing
3101 expression.
3102 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3103 the type before promoting it. CASE_LOW_P is a pointer to the lower
3104 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3105 if the case is not a case range.
3106 The caller has to make sure that we are not called with NULL for
3107 CASE_LOW_P (i.e. the default case).
3108 Returns true if the case label is in range of ORIG_TYPE (saturated or
3109 untouched) or false if the label is out of range. */
3111 static bool
3114 {
3119 /* If there was a problem with the original type, do nothing. */
3126 /* Case label is less than minimum for type. */
3129 {
3132 }
3134 /* Case value is greater than maximum for type. */
3137 {
3140 }
3142 /* Saturate lower case label value to minimum. */
3145 {
3149 }
3151 /* Saturate upper case label value to maximum. */
3154 {
3158 }
3166 }
3167 \f
3168 /* Return an integer type with BITS bits of precision,
3169 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3171 tree
3173 {
3212 }
3214 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3215 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3216 and saturating if SATP is nonzero, otherwise not saturating. */
3218 tree
3221 {
3225 else
3233 {
3235 "fixed-point types that have too many integral and "
3238 }
3241 }
3243 /* Used for communication between c_common_type_for_mode and
3244 c_register_builtin_type. */
3247 /* Return a data type that has machine mode MODE.
3248 If the mode is an integer,
3249 then UNSIGNEDP selects between signed and unsigned types.
3250 If the mode is a fixed-point mode,
3251 then UNSIGNEDP selects between saturating and nonsaturating types. */
3253 tree
3255 {
3256 tree t;
3293 #if HOST_BITS_PER_WIDE_INT >= 64
3296 #endif
3321 {
3323 tree inner_type;
3339 }
3341 {
3346 }
3356 {
3442 }
3450 }
3452 tree
3454 {
3456 }
3458 /* Return a signed type the same as TYPE in other respects. */
3460 tree
3462 {
3464 }
3466 /* Return a type the same as TYPE except unsigned or
3467 signed according to UNSIGNEDP. */
3469 tree
3471 {
3472 tree type1;
3474 /* This block of code emulates the behavior of the old
3475 c_common_unsigned_type. In particular, it returns
3476 long_unsigned_type_node if passed a long, even when a int would
3477 have the same size. This is necessary for warnings to work
3478 correctly in archs where sizeof(int) == sizeof(long) */
3481 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3497 #if HOST_BITS_PER_WIDE_INT >= 64
3500 #endif
3510 #define C_COMMON_FIXED_TYPES(NAME) \
3511 if (type1 == short_ ## NAME ## _type_node \
3512 || type1 == unsigned_short_ ## NAME ## _type_node) \
3513 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3514 : short_ ## NAME ## _type_node; \
3515 if (type1 == NAME ## _type_node \
3516 || type1 == unsigned_ ## NAME ## _type_node) \
3517 return unsignedp ? unsigned_ ## NAME ## _type_node \
3518 : NAME ## _type_node; \
3519 if (type1 == long_ ## NAME ## _type_node \
3520 || type1 == unsigned_long_ ## NAME ## _type_node) \
3521 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3522 : long_ ## NAME ## _type_node; \
3523 if (type1 == long_long_ ## NAME ## _type_node \
3524 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3525 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3526 : long_long_ ## NAME ## _type_node;
3528 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3529 if (type1 == NAME ## _type_node \
3530 || type1 == u ## NAME ## _type_node) \
3531 return unsignedp ? u ## NAME ## _type_node \
3532 : NAME ## _type_node;
3534 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3535 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3536 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3537 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3538 : sat_ ## short_ ## NAME ## _type_node; \
3539 if (type1 == sat_ ## NAME ## _type_node \
3540 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3541 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3542 : sat_ ## NAME ## _type_node; \
3543 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3544 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3545 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3546 : sat_ ## long_ ## NAME ## _type_node; \
3547 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3548 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3549 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3550 : sat_ ## long_long_ ## NAME ## _type_node;
3552 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3553 if (type1 == sat_ ## NAME ## _type_node \
3554 || type1 == sat_ ## u ## NAME ## _type_node) \
3555 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3556 : sat_ ## NAME ## _type_node;
3582 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3583 the precision; they have precision set to match their range, but
3584 may use a wider mode to match an ABI. If we change modes, we may
3585 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3586 the precision as well, so as to yield correct results for
3587 bit-field types. C++ does not have these separate bit-field
3588 types, and producing a signed or unsigned variant of an
3589 ENUMERAL_TYPE may cause other problems as well. */
3595 #define TYPE_OK(node) \
3596 (TYPE_MODE (type) == TYPE_MODE (node) \
3597 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3616 #if HOST_BITS_PER_WIDE_INT >= 64
3619 #endif
3628 #undef TYPE_OK
3631 }
3633 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3635 tree
3637 {
3638 /* Extended integer types of the same width as a standard type have
3639 lesser rank, so those of the same width as int promote to int or
3640 unsigned int and are valid for printf formats expecting int or
3641 unsigned int. To avoid such special cases, avoid creating
3642 extended integer types for bit-fields if a standard integer type
3643 is available. */
3660 }
3662 /* The C version of the register_builtin_type langhook. */
3664 void
3666 {
3667 tree decl;
3677 }
3678 \f
3679 /* Print an error message for invalid operands to arith operation
3680 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3681 LOCATION is the location of the message. */
3683 void
3686 {
3690 {
3735 }
3739 }
3740 \f
3741 /* Given an expression as a tree, return its original type. Do this
3742 by stripping any conversion that preserves the sign and precision. */
3743 static tree
3745 {
3748 }
3750 /* Subroutine of build_binary_op, used for comparison operations.
3751 See if the operands have both been converted from subword integer types
3752 and, if so, perhaps change them both back to their original type.
3753 This function is also responsible for converting the two operands
3754 to the proper common type for comparison.
3756 The arguments of this function are all pointers to local variables
3757 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3758 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3760 If this function returns nonzero, it means that the comparison has
3761 a constant value. What this function returns is an expression for
3762 that value. */
3764 tree
3767 {
3768 tree type;
3777 /* Throw away any conversions to wider types
3778 already present in the operands. */
3783 /* If primopN is first sign-extended from primopN's precision to opN's
3784 precision, then zero-extended from opN's precision to
3785 *restype_ptr precision, shortenings might be invalid. */
3788 && !unsignedp0
3793 && !unsignedp1
3797 /* Handle the case that OP0 does not *contain* a conversion
3798 but it *requires* conversion to FINAL_TYPE. */
3805 /* If one of the operands must be floated, we cannot optimize. */
3809 /* If first arg is constant, swap the args (changing operation
3810 so value is preserved), for canonicalization. Don't do this if
3811 the second arg is 0. */
3816 {
3833 {
3848 }
3850 }
3852 /* If comparing an integer against a constant more bits wide,
3853 maybe we can deduce a value of 1 or 0 independent of the data.
3854 Or else truncate the constant now
3855 rather than extend the variable at run time.
3857 This is only interesting if the constant is the wider arg.
3858 Also, it is not safe if the constant is unsigned and the
3859 variable arg is signed, since in this case the variable
3860 would be sign-extended and then regarded as unsigned.
3861 Our technique fails in this case because the lowest/highest
3862 possible unsigned results don't follow naturally from the
3863 lowest/highest possible values of the variable operand.
3864 For just EQ_EXPR and NE_EXPR there is another technique that
3865 could be used: see if the constant can be faithfully represented
3866 in the other operand's type, by truncating it and reextending it
3867 and see if that preserves the constant's value. */
3873 {
3876 /* 1 if comparison is nominally unsigned. */
3878 tree val;
3890 {
3891 /* Convert primop1 to target type, but do not introduce
3892 additional overflow. We know primop1 is an int_cst. */
3896 }
3898 {
3901 }
3904 {
3909 }
3910 else
3911 {
3916 }
3919 /* This used to be a switch, but Genix compiler can't handle that. */
3921 {
3924 }
3926 {
3929 }
3931 {
3936 }
3938 {
3943 }
3945 {
3950 }
3952 {
3957 }
3959 /* If primop0 was sign-extended and unsigned comparison specd,
3960 we did a signed comparison above using the signed type bounds.
3961 But the comparison we output must be unsigned.
3963 Also, for inequalities, VAL is no good; but if the signed
3964 comparison had *any* fixed result, it follows that the
3965 unsigned comparison just tests the sign in reverse
3966 (positive values are LE, negative ones GE).
3967 So we can generate an unsigned comparison
3968 against an extreme value of the signed type. */
3971 {
3974 {
3989 }
3991 }
3995 {
4002 }
4005 {
4006 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4010 }
4012 /* Value is not predetermined, but do the comparison
4013 in the type of the operand that is not constant.
4014 TYPE is already properly set. */
4015 }
4017 /* If either arg is decimal float and the other is float, find the
4018 proper common type to use for comparison. */
4029 /* If args' natural types are both narrower than nominal type
4030 and both extend in the same manner, compare them
4031 in the type of the wider arg.
4032 Otherwise must actually extend both to the nominal
4033 common type lest different ways of extending
4034 alter the result.
4035 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4040 {
4044 type);
4045 /* Make sure shorter operand is extended the right way
4046 to match the longer operand. */
4047 primop0
4050 primop0);
4051 primop1
4054 primop1);
4055 }
4056 else
4057 {
4058 /* Here we must do the comparison on the nominal type
4059 using the args exactly as we received them. */
4066 {
4068 /* All unsigned values are >= 0, so we warn. However,
4069 if OP0 is a constant that is >= 0, the signedness of
4070 the comparison isn't an issue, so suppress the
4071 warning. */
4073 warn_type_limits && !in_system_header
4077 primop0)))
4078 /* Do not warn for enumeration types. */
4082 {
4099 }
4102 {
4103 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4108 }
4109 }
4110 }
4118 }
4119 \f
4120 /* Return a tree for the sum or difference (RESULTCODE says which)
4121 of pointer PTROP and integer INTOP. */
4123 tree
4126 {
4129 /* The result is a pointer of the same type that is being added. */
4133 {
4137 }
4139 {
4143 }
4145 {
4149 }
4150 else
4153 /* We are manipulating pointer values, so we don't need to warn
4154 about relying on undefined signed overflow. We disable the
4155 warning here because we use integer types so fold won't know that
4156 they are really pointers. */
4159 /* If what we are about to multiply by the size of the elements
4160 contains a constant term, apply distributive law
4161 and multiply that constant term separately.
4162 This helps produce common subexpressions. */
4167 /* If the constant comes from pointer subtraction,
4168 skip this optimization--it would cause an error. */
4170 /* If the constant is unsigned, and smaller than the pointer size,
4171 then we must skip this optimization. This is because it could cause
4172 an overflow error if the constant is negative but INTOP is not. */
4176 {
4181 /* Convert both subexpression types to the type of intop,
4182 because weird cases involving pointer arithmetic
4183 can result in a sum or difference with different type args. */
4188 }
4190 /* Convert the integer argument to a type the same size as sizetype
4191 so the multiply won't overflow spuriously. */
4197 /* Replace the integer argument with a suitable product by the object size.
4198 Do this multiplication as signed, then convert to the appropriate type
4199 for the pointer operation and disregard an overflow that occurred only
4200 because of the sign-extension change in the latter conversion. */
4201 {
4209 }
4211 /* Create the sum or difference. */
4220 }
4221 \f
4222 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4223 and if NON_CONST is known not to be permitted in an evaluated part
4224 of a constant expression. */
4226 tree
4228 {
4232 /* This should never be called for C++. */
4236 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4245 }
4247 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4248 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4249 around the SAVE_EXPR if needed so that c_fully_fold does not need
4250 to look inside SAVE_EXPRs. */
4252 tree
4254 {
4263 }
4265 /* Return whether EXPR is a declaration whose address can never be
4266 NULL. */
4268 bool
4270 {
4275 }
4277 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4278 or for an `if' or `while' statement or ?..: exp. It should already
4279 have been validated to be of suitable type; otherwise, a bad
4280 diagnostic may result.
4282 The EXPR is located at LOCATION.
4284 This preparation consists of taking the ordinary
4285 representation of an expression expr and producing a valid tree
4286 boolean expression describing whether expr is nonzero. We could
4287 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4288 but we optimize comparisons, &&, ||, and !.
4290 The resulting type should always be `truthvalue_type_node'. */
4292 tree
4294 {
4296 {
4338 ? truthvalue_true_node
4344 ? truthvalue_true_node
4349 /* Fall through. */
4352 {
4355 {
4356 /* Common Ada/Pascal programmer's mistake. */
4358 OPT_Waddress,
4360 inner);
4362 }
4364 }
4381 /* These don't change whether an object is nonzero or zero. */
4386 /* These don't change whether an object is zero or nonzero, but
4387 we can't ignore them if their second arg has side-effects. */
4389 {
4392 c_common_truthvalue_conversion
4395 }
4396 else
4401 /* Distribute the conversion into the arms of a COND_EXPR. */
4403 {
4406 /* In C++ one of the arms might have void type if it is throw. */
4414 }
4415 else
4416 {
4417 /* Folding will happen later for C. */
4425 }
4427 CASE_CONVERT:
4428 {
4432 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4433 since that affects how `default_conversion' will behave. */
4437 /* Don't strip a conversion from C++0x scoped enum, since they
4438 don't implicitly convert to other types. */
4442 /* If this isn't narrowing the argument, we can ignore it. */
4446 }
4452 {
4456 }
4461 }
4464 {
4466 expr = (build_binary_op
4470 c_common_truthvalue_conversion
4473 c_common_truthvalue_conversion
4478 }
4481 {
4486 }
4487 else
4490 ret:
4493 }
4494 \f
4503 /* Apply the TYPE_QUALS to the new DECL. */
4505 void
4507 {
4515 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4516 constructor can produce constant init, so rely on cp_finish_decl to
4517 clear TREE_READONLY if the variable has non-constant init. */
4520 {
4523 }
4525 {
4527 /* Allow 'restrict' on arrays of pointers.
4528 FIXME currently we just ignore it. */
4534 }
4535 }
4537 /* Hash function for the problem of multiple type definitions in
4538 different files. This must hash all types that will compare
4539 equal via comptypes to the same value. In practice it hashes
4540 on some of the simple stuff and leaves the details to comptypes. */
4542 static hashval_t
4544 {
4548 tree t2;
4550 {
4551 /* For pointers, hash on pointee type plus some swizzling. */
4554 /* Hash on number of elements and total size. */
4573 }
4574 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4575 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4577 /* We might have a VLA here. */
4580 else
4583 }
4587 /* Return the typed-based alias set for T, which may be an expression
4588 or a type. Return -1 if we don't do anything special. */
4590 alias_set_type
4592 {
4593 tree u;
4596 /* For VLAs, use the alias set of the element type rather than the
4597 default of alias set 0 for types compared structurally. */
4599 {
4603 }
4605 /* Permit type-punning when accessing a union, provided the access
4606 is directly through the union. For example, this code does not
4607 permit taking the address of a union member and then storing
4608 through it. Even the type-punning allowed here is a GCC
4609 extension, albeit a common and useful one; the C standard says
4610 that such accesses have implementation-defined behavior. */
4618 /* That's all the expressions we handle specially. */
4622 /* The C standard guarantees that any object may be accessed via an
4623 lvalue that has character type. */
4629 /* The C standard specifically allows aliasing between signed and
4630 unsigned variants of the same type. We treat the signed
4631 variant as canonical. */
4633 {
4636 /* t1 == t can happen for boolean nodes which are always unsigned. */
4639 }
4641 /* Handle the case of multiple type nodes referring to "the same" type,
4642 which occurs with IMA. These share an alias set. FIXME: Currently only
4643 C90 is handled. (In C99 type compatibility is not transitive, which
4644 complicates things mightily. The alias set splay trees can theoretically
4645 represent this, but insertion is tricky when you consider all the
4646 different orders things might arrive in.) */
4651 /* Save time if there's only one input file. */
4655 /* Pointers need special handling if they point to any type that
4656 needs special handling (below). */
4658 {
4659 tree t2;
4660 /* Find bottom type under any nested POINTERs. */
4664 ;
4672 }
4673 /* These are the only cases that need special handling. */
4680 /* Undefined? */
4684 /* Look up t in hash table. Only one of the compatible types within each
4685 alias set is recorded in the table. */
4689 NULL);
4692 {
4695 }
4696 else
4697 /* Our caller will assign and record (in t) a new alias set; all we need
4698 to do is remember t in the hash table. */
4702 }
4703 \f
4704 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4705 the second parameter indicates which OPERATOR is being applied.
4706 The COMPLAIN flag controls whether we should diagnose possibly
4707 ill-formed constructs or not. LOC is the location of the SIZEOF or
4708 TYPEOF operator. */
4710 tree
4713 {
4721 {
4723 {
4730 }
4731 else
4732 {
4734 {
4738 else
4741 }
4743 }
4744 }
4746 {
4754 }
4757 {
4762 }
4765 {
4770 }
4771 else
4772 {
4774 /* Convert in case a char is more than one unit. */
4778 else
4780 }
4782 /* VALUE will have the middle-end integer type sizetype.
4783 However, we should really return a value of type `size_t',
4784 which is just a typedef for an ordinary integer type. */
4788 }
4790 /* Implement the __alignof keyword: Return the minimum required
4791 alignment of EXPR, measured in bytes. For VAR_DECLs,
4792 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4793 from an "aligned" __attribute__ specification). LOC is the
4794 location of the ALIGNOF operator. */
4796 tree
4798 {
4799 tree t;
4806 {
4809 }
4815 {
4822 {
4829 }
4831 }
4832 else
4836 }
4837 \f
4838 /* Handle C and C++ default attributes. */
4840 enum built_in_attribute
4841 {
4842 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4843 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4844 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4845 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4846 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4848 #undef DEF_ATTR_NULL_TREE
4849 #undef DEF_ATTR_INT
4850 #undef DEF_ATTR_STRING
4851 #undef DEF_ATTR_IDENT
4852 #undef DEF_ATTR_TREE_LIST
4853 ATTR_LAST
4854 };
4860 enum c_builtin_type
4861 {
4862 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4863 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4864 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4865 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4866 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4867 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4868 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4869 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4870 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4871 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4872 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4873 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4874 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4875 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4876 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4877 NAME,
4878 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4880 #undef DEF_PRIMITIVE_TYPE
4881 #undef DEF_FUNCTION_TYPE_0
4882 #undef DEF_FUNCTION_TYPE_1
4883 #undef DEF_FUNCTION_TYPE_2
4884 #undef DEF_FUNCTION_TYPE_3
4885 #undef DEF_FUNCTION_TYPE_4
4886 #undef DEF_FUNCTION_TYPE_5
4887 #undef DEF_FUNCTION_TYPE_6
4888 #undef DEF_FUNCTION_TYPE_7
4889 #undef DEF_FUNCTION_TYPE_VAR_0
4890 #undef DEF_FUNCTION_TYPE_VAR_1
4891 #undef DEF_FUNCTION_TYPE_VAR_2
4892 #undef DEF_FUNCTION_TYPE_VAR_3
4893 #undef DEF_FUNCTION_TYPE_VAR_4
4894 #undef DEF_FUNCTION_TYPE_VAR_5
4895 #undef DEF_POINTER_TYPE
4896 BT_LAST
4897 };
4901 /* A temporary array for c_common_nodes_and_builtins. Used in
4902 communication with def_fn_type. */
4905 /* A helper function for c_common_nodes_and_builtins. Build function type
4906 for DEF with return type RET and N arguments. If VAR is true, then the
4907 function should be variadic after those N arguments.
4909 Takes special care not to ICE if any of the types involved are
4910 error_mark_node, which indicates that said type is not in fact available
4911 (see builtin_type_for_size). In which case the function type as a whole
4912 should be error_mark_node. */
4914 static void
4916 {
4917 tree t;
4924 {
4930 }
4937 else
4940 egress:
4943 }
4945 /* Build builtin functions common to both C and C++ language
4946 frontends. */
4948 static void
4950 {
4951 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4952 builtin_types[ENUM] = VALUE;
4953 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4954 def_fn_type (ENUM, RETURN, 0, 0);
4955 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4956 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4957 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4958 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4959 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4960 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4961 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4962 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4963 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4964 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4965 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4966 ARG6) \
4967 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4968 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4969 ARG6, ARG7) \
4970 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4971 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4972 def_fn_type (ENUM, RETURN, 1, 0);
4973 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4974 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4975 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4976 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4977 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4978 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4979 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4980 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4981 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4982 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4983 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4984 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4988 #undef DEF_PRIMITIVE_TYPE
4989 #undef DEF_FUNCTION_TYPE_1
4990 #undef DEF_FUNCTION_TYPE_2
4991 #undef DEF_FUNCTION_TYPE_3
4992 #undef DEF_FUNCTION_TYPE_4
4993 #undef DEF_FUNCTION_TYPE_5
4994 #undef DEF_FUNCTION_TYPE_6
4995 #undef DEF_FUNCTION_TYPE_VAR_0
4996 #undef DEF_FUNCTION_TYPE_VAR_1
4997 #undef DEF_FUNCTION_TYPE_VAR_2
4998 #undef DEF_FUNCTION_TYPE_VAR_3
4999 #undef DEF_FUNCTION_TYPE_VAR_4
5000 #undef DEF_FUNCTION_TYPE_VAR_5
5001 #undef DEF_POINTER_TYPE
5006 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5007 NONANSI_P, ATTRS, IMPLICIT, COND) \
5008 if (NAME && COND) \
5009 def_builtin_1 (ENUM, NAME, CLASS, \
5010 builtin_types[(int) TYPE], \
5011 builtin_types[(int) LIBTYPE], \
5012 BOTH_P, FALLBACK_P, NONANSI_P, \
5013 built_in_attributes[(int) ATTRS], IMPLICIT);
5015 #undef DEF_BUILTIN
5023 }
5025 /* Like get_identifier, but avoid warnings about null arguments when
5026 the argument may be NULL for targets where GCC lacks stdint.h type
5027 information. */
5031 {
5033 }
5035 /* Build tree nodes and builtin functions common to both C and C++ language
5036 frontends. */
5038 void
5040 {
5044 tree array_domain_type;
5045 tree va_list_ref_type_node;
5046 tree va_list_arg_type_node;
5050 /* Define `int' and `char' first so that dbx will output them first. */
5054 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5055 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5056 but not C. Are the conditionals here needed? */
5062 long_unsigned_type_node);
5064 {
5066 int128_integer_type_node);
5068 int128_unsigned_type_node);
5069 }
5073 long_long_integer_type_node);
5075 long_long_unsigned_type_node);
5078 long_long_unsigned_type_node);
5081 short_unsigned_type_node);
5084 short_unsigned_type_node);
5086 /* Define both `signed char' and `unsigned char'. */
5090 /* These are types that c_common_type_for_size and
5091 c_common_type_for_mode use. */
5094 intQI_type_node));
5097 intHI_type_node));
5100 intSI_type_node));
5103 intDI_type_node));
5104 #if HOST_BITS_PER_WIDE_INT >= 64
5107 TYPE_DECL,
5109 intTI_type_node));
5110 #endif
5113 unsigned_intQI_type_node));
5116 unsigned_intHI_type_node));
5119 unsigned_intSI_type_node));
5122 unsigned_intDI_type_node));
5123 #if HOST_BITS_PER_WIDE_INT >= 64
5126 TYPE_DECL,
5128 unsigned_intTI_type_node));
5129 #endif
5131 /* Create the widest literal types. */
5132 widest_integer_literal_type_node
5136 widest_integer_literal_type_node));
5138 widest_unsigned_literal_type_node
5142 widest_unsigned_literal_type_node));
5146 pid_type_node =
5153 /* Only supported decimal floating point extension if the target
5154 actually supports underlying modes. */
5158 {
5162 }
5165 {
5170 long_long_fract_type_node);
5172 unsigned_short_fract_type_node);
5174 unsigned_fract_type_node);
5176 unsigned_long_fract_type_node);
5178 unsigned_long_long_fract_type_node);
5180 sat_short_fract_type_node);
5183 sat_long_fract_type_node);
5185 sat_long_long_fract_type_node);
5187 sat_unsigned_short_fract_type_node);
5189 sat_unsigned_fract_type_node);
5191 sat_unsigned_long_fract_type_node);
5193 sat_unsigned_long_long_fract_type_node);
5198 long_long_accum_type_node);
5200 unsigned_short_accum_type_node);
5202 unsigned_accum_type_node);
5204 unsigned_long_accum_type_node);
5206 unsigned_long_long_accum_type_node);
5208 sat_short_accum_type_node);
5211 sat_long_accum_type_node);
5213 sat_long_long_accum_type_node);
5215 sat_unsigned_short_accum_type_node);
5217 sat_unsigned_accum_type_node);
5219 sat_unsigned_long_accum_type_node);
5221 sat_unsigned_long_long_accum_type_node);
5223 }
5226 TYPE_DECL,
5228 complex_integer_type_node));
5230 TYPE_DECL,
5232 complex_float_type_node));
5234 TYPE_DECL,
5236 complex_double_type_node));
5240 complex_long_double_type_node));
5243 /* For C++, make fileptr_type_node a distinct void * type until
5244 FILE type is defined. */
5249 /* Set the TYPE_NAME for any variants that were built before
5250 record_builtin_type gave names to the built-in types. */
5251 {
5257 }
5259 /* This node must not be shared. */
5265 /* Make a type to be the domain of a few array types
5266 whose domains don't really matter.
5267 200 is small enough that it always fits in size_t
5268 and large enough that it can hold most function names for the
5269 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5272 /* Make a type for arrays of characters.
5273 With luck nothing will ever really depend on the length of this
5274 array type. */
5275 char_array_type_node
5278 /* Likewise for arrays of ints. */
5279 int_array_type_node
5283 const_string_type_node
5287 /* This is special for C++ so functions can be overloaded. */
5293 {
5296 else
5299 }
5301 /* This is for wide string constants. */
5302 wchar_array_type_node
5305 /* Define 'char16_t'. */
5310 {
5315 }
5317 /* This is for UTF-16 string constants. */
5318 char16_array_type_node
5321 /* Define 'char32_t'. */
5326 {
5331 }
5333 /* This is for UTF-32 string constants. */
5334 char32_array_type_node
5337 wint_type_node =
5340 intmax_type_node =
5342 uintmax_type_node =
5346 sig_atomic_type_node =
5349 int8_type_node =
5352 int16_type_node =
5355 int32_type_node =
5358 int64_type_node =
5361 uint8_type_node =
5364 c_uint16_type_node =
5367 c_uint32_type_node =
5370 c_uint64_type_node =
5373 int_least8_type_node =
5376 int_least16_type_node =
5379 int_least32_type_node =
5382 int_least64_type_node =
5385 uint_least8_type_node =
5388 uint_least16_type_node =
5391 uint_least32_type_node =
5394 uint_least64_type_node =
5397 int_fast8_type_node =
5400 int_fast16_type_node =
5403 int_fast32_type_node =
5406 int_fast64_type_node =
5409 uint_fast8_type_node =
5412 uint_fast16_type_node =
5415 uint_fast32_type_node =
5418 uint_fast64_type_node =
5421 intptr_type_node =
5424 uintptr_type_node =
5427 default_function_type
5429 ptrdiff_type_node
5436 va_list_type_node));
5438 {
5441 tree ptype;
5444 {
5448 ptype));
5450 }
5451 }
5454 {
5457 }
5458 else
5459 {
5462 }
5469 /* Create the built-in __null node. It is important that this is
5470 not shared. */
5474 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5476 }
5478 /* The number of named compound-literals generated thus far. */
5481 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5483 void
5485 {
5488 compound_literal_number);
5489 compound_literal_number++;
5491 }
5493 tree
5495 {
5499 }
5502 /* Linked list of disabled built-in functions. */
5505 {
5513 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5514 begins with "__builtin_", give an error. */
5516 void
5518 {
5521 else
5522 {
5527 }
5528 }
5531 /* Return true if the built-in function NAME has been disabled, false
5532 otherwise. */
5534 static bool
5536 {
5539 {
5542 }
5544 }
5547 /* Worker for DEF_BUILTIN.
5548 Possibly define a builtin function with one or two names.
5549 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5550 nonansi_p and flag_no_nonansi_builtin. */
5552 static void
5559 {
5560 tree decl;
5573 fnattrs);
5582 }
5583 \f
5584 /* Nonzero if the type T promotes to int. This is (nearly) the
5585 integral promotions defined in ISO C99 6.3.1.1/2. */
5587 bool
5589 {
5591 {
5601 /* ??? Technically all enumerations not larger than an int
5602 promote to an int. But this is used along code paths
5603 that only want to notice a size change. */
5611 }
5612 }
5614 /* Return 1 if PARMS specifies a fixed number of parameters
5615 and none of their types is affected by default promotions. */
5617 int
5619 {
5620 const_tree t;
5622 {
5639 }
5641 }
5643 /* Recursively remove any '*' or '&' operator from TYPE. */
5644 tree
5646 {
5650 }
5652 /* Recursively remove pointer or array type from TYPE. */
5653 tree
5655 {
5659 }
5661 /* Used to compare case labels. K1 and K2 are actually tree nodes
5662 representing case labels, or NULL_TREE for a `default' label.
5663 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5664 K2, and 0 if K1 and K2 are equal. */
5666 int
5668 {
5669 /* Consider a NULL key (such as arises with a `default' label) to be
5670 smaller than anything else. */
5677 }
5679 /* Process a case label, located at LOC, for the range LOW_VALUE
5680 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5681 then this case label is actually a `default' label. If only
5682 HIGH_VALUE is NULL_TREE, then case label was declared using the
5683 usual C/C++ syntax, rather than the GNU case range extension.
5684 CASES is a tree containing all the case ranges processed so far;
5685 COND is the condition for the switch-statement itself. Returns the
5686 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5687 is created. */
5689 tree
5692 {
5693 tree type;
5694 tree label;
5695 tree case_label;
5696 splay_tree_node node;
5698 /* Create the LABEL_DECL itself. */
5701 /* If there was an error processing the switch condition, bail now
5702 before we get more confused. */
5710 {
5713 }
5715 /* Case ranges are a GNU extension. */
5722 {
5727 }
5729 {
5734 }
5737 {
5738 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5739 really a case range, even though it was written that way.
5740 Remove the HIGH_VALUE to simplify later processing. */
5745 }
5747 /* See if the case is in range of the type of the original testing
5748 expression. If both low_value and high_value are out of range,
5749 don't insert the case label and return NULL_TREE. */
5755 /* Look up the LOW_VALUE in the table of case labels we already
5756 have. */
5758 /* If there was not an exact match, check for overlapping ranges.
5759 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5760 that's a `default' label and the only overlap is an exact match. */
5762 {
5763 splay_tree_node low_bound;
5764 splay_tree_node high_bound;
5766 /* Even though there wasn't an exact match, there might be an
5767 overlap between this case range and another case range.
5768 Since we've (inductively) not allowed any overlapping case
5769 ranges, we simply need to find the greatest low case label
5770 that is smaller that LOW_VALUE, and the smallest low case
5771 label that is greater than LOW_VALUE. If there is an overlap
5772 it will occur in one of these two ranges. */
5778 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5779 the LOW_VALUE, so there is no need to check unless the
5780 LOW_BOUND is in fact itself a case range. */
5786 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5787 range is bigger than the low end of the current range, so we
5788 are only interested if the current range is a real range, and
5789 not an ordinary case label. */
5791 && high_value
5793 high_value)
5796 }
5797 /* If there was an overlap, issue an error. */
5799 {
5803 {
5807 }
5809 {
5812 }
5813 else
5814 {
5818 }
5820 }
5822 /* Add a CASE_LABEL to the statement-tree. */
5824 /* Register this case label in the splay tree. */
5831 error_out:
5832 /* Add a label so that the back-end doesn't think that the beginning of
5833 the switch is unreachable. Note that we do not add a case label, as
5834 that just leads to duplicates and thence to failure later on. */
5836 {
5839 }
5841 }
5843 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5844 Used to verify that case values match up with enumerator values. */
5846 static void
5848 {
5851 /* ??? Not working too hard to print the double-word value.
5852 Should perhaps be done with %lwd in the diagnostic routines? */
5861 else
5870 buf);
5871 else
5876 }
5878 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5879 Used to verify that case values match up with enumerator values. */
5881 static int
5883 {
5887 /* Skip default case. */
5891 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5892 when we did our enum->case scan. Reset our scratch bit after. */
5895 else
5898 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5899 not set, that means that CASE_HIGH did not appear when we did our
5900 enum->case scan. Reset our scratch bit after. */
5902 {
5905 else
5907 }
5910 }
5912 /* Handle -Wswitch*. Called from the front end after parsing the
5913 switch construct. */
5914 /* ??? Should probably be somewhere generic, since other languages
5915 besides C and C++ would want this. At the moment, however, C/C++
5916 are the only tree-ssa languages that support enumerations at all,
5917 so the point is moot. */
5919 void
5922 {
5923 splay_tree_node default_node;
5924 splay_tree_node node;
5925 tree chain;
5935 /* From here on, we only care about about enumerated types. */
5939 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5943 /* Check the cases. Warn about case values which are not members of
5944 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5945 there is no default case, check that exactly all enumeration
5946 literals are covered by the cases. */
5948 /* Clearing COND if it is not an integer constant simplifies
5949 the tests inside the loop below. */
5953 /* The time complexity here is O(N*lg(N)) worst case, but for the
5954 common case of monotonically increasing enumerators, it is
5955 O(N), since the nature of the splay tree will keep the next
5956 element adjacent to the root at all times. */
5959 {
5965 {
5966 /* Mark the CASE_LOW part of the case entry as seen. */
5970 }
5972 /* Even though there wasn't an exact match, there might be a
5973 case range which includes the enumerator's value. */
5976 {
5980 {
5981 /* If we match the upper bound exactly, mark the CASE_HIGH
5982 part of the case entry as seen. */
5986 }
5987 }
5989 /* We've now determined that this enumerated literal isn't
5990 handled by the case labels of the switch statement. */
5992 /* If the switch expression is a constant, we only really care
5993 about whether that constant is handled by the switch. */
5997 /* If there is a default_node, the only relevant option is
5998 Wswitch-enum. Otherwise, if both are enabled then we prefer
5999 to warn using -Wswitch because -Wswitch is enabled by -Wall
6000 while -Wswitch-enum is explicit. */
6003 ? OPT_Wswitch_enum
6007 }
6009 /* Warn if there are case expressions that don't correspond to
6010 enumerators. This can occur since C and C++ don't enforce
6011 type-checking of assignments to enumeration variables.
6013 The time complexity here is now always O(N) worst case, since
6014 we should have marked both the lower bound and upper bound of
6015 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6016 above. This scan also resets those fields. */
6019 }
6021 /* Finish an expression taking the address of LABEL (an
6022 IDENTIFIER_NODE). Returns an expression for the address.
6024 LOC is the location for the expression returned. */
6026 tree
6028 {
6029 tree result;
6039 else
6040 {
6043 /* The current function is not necessarily uninlinable.
6044 Computed gotos are incompatible with inlining, but the value
6045 here could be used only in a diagnostic, for example. */
6047 }
6050 }
6051 \f
6053 /* Given a boolean expression ARG, return a tree representing an increment
6054 or decrement (as indicated by CODE) of ARG. The front end must check for
6055 invalid cases (e.g., decrement in C++). */
6056 tree
6058 {
6059 tree val;
6064 {
6087 }
6090 }
6091 \f
6092 /* Built-in macros for stddef.h and stdint.h, that require macros
6093 defined in this file. */
6094 void
6096 {
6159 }
6161 static void
6163 {
6164 /* Fill in the built_in_attributes array. */
6165 #define DEF_ATTR_NULL_TREE(ENUM) \
6166 built_in_attributes[(int) ENUM] = NULL_TREE;
6167 #define DEF_ATTR_INT(ENUM, VALUE) \
6168 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6169 #define DEF_ATTR_STRING(ENUM, VALUE) \
6170 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6171 #define DEF_ATTR_IDENT(ENUM, STRING) \
6172 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6173 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6174 built_in_attributes[(int) ENUM] \
6175 = tree_cons (built_in_attributes[(int) PURPOSE], \
6176 built_in_attributes[(int) VALUE], \
6177 built_in_attributes[(int) CHAIN]);
6179 #undef DEF_ATTR_NULL_TREE
6180 #undef DEF_ATTR_INT
6181 #undef DEF_ATTR_IDENT
6182 #undef DEF_ATTR_TREE_LIST
6183 }
6185 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6186 identifier as an argument, so the front end shouldn't look it up. */
6188 bool
6190 {
6193 /* Unknown attribute that we'll end up ignoring, return true so we
6194 don't complain about an identifier argument. */
6200 else
6202 }
6204 /* Attribute handlers common to C front ends. */
6206 /* Handle a "packed" attribute; arguments as in
6207 struct attribute_spec.handler. */
6209 static tree
6212 {
6214 {
6218 }
6220 {
6222 /* Still pack bitfields. */
6227 else
6229 }
6230 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6231 used for DECL_REGISTER. It wouldn't mean anything anyway.
6232 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6233 that changes what the typedef is typing. */
6234 else
6235 {
6238 }
6241 }
6243 /* Handle a "nocommon" attribute; arguments as in
6244 struct attribute_spec.handler. */
6246 static tree
6250 {
6253 else
6254 {
6257 }
6260 }
6262 /* Handle a "common" attribute; arguments as in
6263 struct attribute_spec.handler. */
6265 static tree
6268 {
6271 else
6272 {
6275 }
6278 }
6280 /* Handle a "noreturn" attribute; arguments as in
6281 struct attribute_spec.handler. */
6283 static tree
6286 {
6289 /* See FIXME comment in c_common_attribute_table. */
6296 = build_pointer_type
6299 else
6300 {
6303 }
6306 }
6308 /* Handle a "hot" and attribute; arguments as in
6309 struct attribute_spec.handler. */
6311 static tree
6314 {
6317 {
6319 {
6323 }
6324 /* Most of the rest of the hot processing is done later with
6325 lookup_attribute. */
6326 }
6327 else
6328 {
6331 }
6334 }
6336 /* Handle a "cold" and attribute; arguments as in
6337 struct attribute_spec.handler. */
6339 static tree
6342 {
6345 {
6347 {
6351 }
6352 /* Most of the rest of the cold processing is done later with
6353 lookup_attribute. */
6354 }
6355 else
6356 {
6359 }
6362 }
6364 /* Handle a "noinline" attribute; arguments as in
6365 struct attribute_spec.handler. */
6367 static tree
6371 {
6374 else
6375 {
6378 }
6381 }
6383 /* Handle a "noclone" attribute; arguments as in
6384 struct attribute_spec.handler. */
6386 static tree
6390 {
6392 {
6395 }
6398 }
6400 /* Handle a "always_inline" attribute; arguments as in
6401 struct attribute_spec.handler. */
6403 static tree
6408 {
6410 {
6411 /* Set the attribute and mark it for disregarding inline
6412 limits. */
6414 }
6415 else
6416 {
6419 }
6422 }
6424 /* Handle a "gnu_inline" attribute; arguments as in
6425 struct attribute_spec.handler. */
6427 static tree
6432 {
6434 {
6435 /* Do nothing else, just set the attribute. We'll get at
6436 it later with lookup_attribute. */
6437 }
6438 else
6439 {
6442 }
6445 }
6447 /* Handle a "leaf" attribute; arguments as in
6448 struct attribute_spec.handler. */
6450 static tree
6454 {
6456 {
6459 }
6461 {
6464 }
6467 }
6469 /* Handle an "artificial" attribute; arguments as in
6470 struct attribute_spec.handler. */
6472 static tree
6477 {
6479 {
6480 /* Do nothing else, just set the attribute. We'll get at
6481 it later with lookup_attribute. */
6482 }
6483 else
6484 {
6487 }
6490 }
6492 /* Handle a "flatten" attribute; arguments as in
6493 struct attribute_spec.handler. */
6495 static tree
6497 tree args ATTRIBUTE_UNUSED,
6499 {
6501 /* Do nothing else, just set the attribute. We'll get at
6502 it later with lookup_attribute. */
6503 ;
6504 else
6505 {
6508 }
6511 }
6513 /* Handle a "warning" or "error" attribute; arguments as in
6514 struct attribute_spec.handler. */
6516 static tree
6519 {
6522 /* Do nothing else, just set the attribute. We'll get at
6523 it later with lookup_attribute. */
6524 ;
6525 else
6526 {
6529 }
6532 }
6534 /* Handle a "used" attribute; arguments as in
6535 struct attribute_spec.handler. */
6537 static tree
6540 {
6546 {
6551 }
6552 else
6553 {
6556 }
6559 }
6561 /* Handle a "unused" attribute; arguments as in
6562 struct attribute_spec.handler. */
6564 static tree
6567 {
6569 {
6577 {
6582 }
6583 else
6584 {
6587 }
6588 }
6589 else
6590 {
6594 }
6597 }
6599 /* Handle a "externally_visible" attribute; arguments as in
6600 struct attribute_spec.handler. */
6602 static tree
6607 {
6611 {
6614 {
6618 }
6619 }
6620 else
6621 {
6624 }
6627 }
6629 /* Handle a "const" attribute; arguments as in
6630 struct attribute_spec.handler. */
6632 static tree
6635 {
6638 /* See FIXME comment on noreturn in c_common_attribute_table. */
6644 = build_pointer_type
6647 else
6648 {
6651 }
6654 }
6656 /* Handle a "transparent_union" attribute; arguments as in
6657 struct attribute_spec.handler. */
6659 static tree
6663 {
6664 tree type;
6673 {
6674 /* Make sure that the first field will work for a transparent union.
6675 If the type isn't complete yet, leave the check to the code in
6676 finish_struct. */
6678 {
6684 }
6687 {
6688 /* If the type isn't complete yet, setting the flag
6689 on a variant wouldn't ever be checked. */
6693 /* build_duplicate_type doesn't work for C++. */
6697 /* A type variant isn't good enough, since we don't a cast
6698 to such a type removed as a no-op. */
6700 }
6704 }
6706 ignored:
6709 }
6711 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6712 get the requested priority for a constructor or destructor,
6713 possibly issuing diagnostics for invalid or reserved
6714 priorities. */
6716 static priority_type
6718 {
6719 HOST_WIDE_INT pri;
6720 tree arg;
6726 {
6729 else
6732 }
6745 {
6748 "destructor priorities from 0 to %d are reserved "
6750 MAX_RESERVED_INIT_PRIORITY);
6751 else
6753 "constructor priorities from 0 to %d are reserved "
6755 MAX_RESERVED_INIT_PRIORITY);
6756 }
6759 invalid:
6762 MAX_INIT_PRIORITY);
6763 else
6765 MAX_INIT_PRIORITY);
6767 }
6769 /* Handle a "constructor" attribute; arguments as in
6770 struct attribute_spec.handler. */
6772 static tree
6776 {
6783 {
6784 priority_type priority;
6789 }
6790 else
6791 {
6794 }
6797 }
6799 /* Handle a "destructor" attribute; arguments as in
6800 struct attribute_spec.handler. */
6802 static tree
6806 {
6813 {
6814 priority_type priority;
6819 }
6820 else
6821 {
6824 }
6827 }
6829 /* Nonzero if the mode is a valid vector mode for this architecture.
6830 This returns nonzero even if there is no hardware support for the
6831 vector mode, but we can emulate with narrower modes. */
6833 static int
6835 {
6839 /* Doh! What's going on? */
6848 /* Hardware support. Woo hoo! */
6854 /* We should probably return 1 if requesting V4DI and we have no DI,
6855 but we have V2DI, but this is probably very unlikely. */
6857 /* If we have support for the inner mode, we can safely emulate it.
6858 We may not have V2DI, but me can emulate with a pair of DIs. */
6860 }
6863 /* Handle a "mode" attribute; arguments as in
6864 struct attribute_spec.handler. */
6866 static tree
6869 {
6877 else
6878 {
6883 tree typefm;
6888 {
6894 }
6896 /* Change this type to have a type with the specified mode.
6897 First check for the special modes. */
6910 else
6913 {
6916 }
6919 {
6922 }
6926 {
6958 }
6960 {
6963 }
6966 {
6971 {
6974 }
6978 else
6981 }
6982 else
6983 {
6984 /* For fixed-point modes, we need to test if the signness of type
6985 and the machine mode are consistent. */
6988 {
6991 }
6992 /* For fixed-point modes, we need to pass saturating info. */
6996 }
6999 {
7002 }
7004 {
7005 /* For enumeral types, copy the precision from the integer
7006 type returned above. If not an INTEGER_TYPE, we can't use
7007 this mode for this type. */
7009 {
7012 }
7015 {
7018 }
7019 else
7020 {
7021 /* We cannot build a type variant, as there's code that assumes
7022 that TYPE_MAIN_VARIANT has the same mode. This includes the
7023 debug generators. Instead, create a subrange type. This
7024 results in all of the enumeral values being emitted only once
7025 in the original, and the subtype gets them by reference. */
7028 else
7031 }
7032 }
7036 {
7039 }
7042 }
7045 }
7047 /* Handle a "section" attribute; arguments as in
7048 struct attribute_spec.handler. */
7050 static tree
7053 {
7057 {
7063 {
7067 {
7069 "section attribute cannot be specified for "
7072 }
7074 /* The decl may have already been given a section attribute
7075 from a previous declaration. Ensure they match. */
7079 {
7083 }
7087 {
7090 }
7091 else
7093 }
7094 else
7095 {
7098 }
7099 }
7100 else
7101 {
7105 }
7108 }
7110 /* Check whether ALIGN is a valid user-specified alignment. If so,
7111 return its base-2 log; if not, output an error and return -1. If
7112 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7113 no error. */
7114 int
7116 {
7121 {
7124 }
7128 {
7131 }
7133 {
7136 }
7138 }
7140 /* Handle a "aligned" attribute; arguments as in
7141 struct attribute_spec.handler. */
7143 static tree
7146 {
7155 {
7159 }
7166 {
7169 /* If we have a TYPE_DECL, then copy the type, so that we
7170 don't accidentally modify a builtin type. See pushdecl. */
7173 {
7180 }
7181 else
7186 }
7189 {
7192 }
7195 {
7200 else
7204 }
7205 else
7206 {
7209 }
7212 }
7214 /* Handle a "weak" attribute; arguments as in
7215 struct attribute_spec.handler. */
7217 static tree
7222 {
7225 {
7228 }
7230 {
7234 }
7238 else
7242 }
7244 /* Handle an "alias" or "ifunc" attribute; arguments as in
7245 struct attribute_spec.handler, except that IS_ALIAS tells us
7246 whether this is an alias as opposed to ifunc attribute. */
7248 static tree
7251 {
7256 {
7259 }
7263 /* A static variable declaration is always a tentative definition,
7264 but the alias is a non-tentative definition which overrides. */
7267 {
7271 }
7275 {
7279 }
7281 /* Note that the very first time we process a nested declaration,
7282 decl_function_context will not be set. Indeed, *would* never
7283 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7284 we do below. After such frobbery, pushdecl would set the context.
7285 In any case, this is never what we want. */
7287 {
7288 tree id;
7292 {
7296 }
7298 /* This counts as a use of the object pointed to. */
7303 else
7304 {
7307 else
7310 }
7313 /* ifuncs are also aliases, so set that attribute too. */
7316 }
7317 else
7318 {
7321 }
7324 }
7326 /* Handle an "alias" or "ifunc" attribute; arguments as in
7327 struct attribute_spec.handler. */
7329 static tree
7332 {
7334 }
7336 /* Handle an "alias" or "ifunc" attribute; arguments as in
7337 struct attribute_spec.handler. */
7339 static tree
7342 {
7344 }
7346 /* Handle a "weakref" attribute; arguments as in struct
7347 attribute_spec.handler. */
7349 static tree
7352 {
7355 /* We must ignore the attribute when it is associated with
7356 local-scoped decls, since attribute alias is ignored and many
7357 such symbols do not even have a DECL_WEAK field. */
7359 || current_function_decl
7361 {
7365 }
7368 {
7372 }
7374 /* The idea here is that `weakref("name")' mutates into `weakref,
7375 alias("name")', and weakref without arguments, in turn,
7376 implicitly adds weak. */
7379 {
7386 }
7387 else
7388 {
7393 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7394 and that isn't supported; and because it wants to add it to
7395 the list of weak decls, which isn't helpful. */
7397 }
7400 }
7402 /* Handle an "visibility" attribute; arguments as in
7403 struct attribute_spec.handler. */
7405 static tree
7409 {
7415 {
7419 {
7421 name);
7423 }
7425 {
7429 }
7430 }
7432 {
7435 }
7438 {
7441 }
7443 /* If this is a type, set the visibility on the type decl. */
7445 {
7450 {
7452 name);
7454 }
7455 }
7465 else
7466 {
7467 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7469 }
7473 {
7487 }
7492 /* Go ahead and attach the attribute to the node as well. This is needed
7493 so we can determine whether we have VISIBILITY_DEFAULT because the
7494 visibility was not specified, or because it was explicitly overridden
7495 from the containing scope. */
7498 }
7500 /* Determine the ELF symbol visibility for DECL, which is either a
7501 variable or a function. It is an error to use this function if a
7502 definition of DECL is not available in this translation unit.
7503 Returns true if the final visibility has been determined by this
7504 function; false if the caller is free to make additional
7505 modifications. */
7507 bool
7509 {
7513 /* If the user explicitly specified the visibility with an
7514 attribute, honor that. DECL_VISIBILITY will have been set during
7515 the processing of the attribute. We check for an explicit
7516 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7517 to distinguish the use of an attribute from the use of a "#pragma
7518 GCC visibility push(...)"; in the latter case we still want other
7519 considerations to be able to overrule the #pragma. */
7521 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7526 /* Set default visibility to whatever the user supplied with
7527 visibility_specified depending on #pragma GCC visibility. */
7529 {
7532 {
7535 /* If visibility changed and DECL already has DECL_RTL, ensure
7536 symbol flags are updated. */
7541 }
7542 }
7544 }
7546 /* Handle an "tls_model" attribute; arguments as in
7547 struct attribute_spec.handler. */
7549 static tree
7552 {
7553 tree id;
7560 {
7563 }
7568 {
7571 }
7581 else
7582 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7586 }
7588 /* Handle a "no_instrument_function" attribute; arguments as in
7589 struct attribute_spec.handler. */
7591 static tree
7596 {
7600 {
7604 }
7606 {
7610 }
7611 else
7615 }
7617 /* Handle a "malloc" attribute; arguments as in
7618 struct attribute_spec.handler. */
7620 static tree
7623 {
7627 else
7628 {
7631 }
7634 }
7636 /* Handle a "alloc_size" attribute; arguments as in
7637 struct attribute_spec.handler. */
7639 static tree
7642 {
7645 {
7652 {
7657 }
7658 }
7660 }
7662 /* Handle a "fn spec" attribute; arguments as in
7663 struct attribute_spec.handler. */
7665 static tree
7669 {
7674 }
7676 /* Handle a "returns_twice" attribute; arguments as in
7677 struct attribute_spec.handler. */
7679 static tree
7682 {
7685 else
7686 {
7689 }
7692 }
7694 /* Handle a "no_limit_stack" attribute; arguments as in
7695 struct attribute_spec.handler. */
7697 static tree
7702 {
7706 {
7710 }
7712 {
7716 }
7717 else
7721 }
7723 /* Handle a "pure" attribute; arguments as in
7724 struct attribute_spec.handler. */
7726 static tree
7729 {
7732 /* ??? TODO: Support types. */
7733 else
7734 {
7737 }
7740 }
7742 /* Digest an attribute list destined for a transactional memory statement.
7743 ALLOWED is the set of attributes that are allowed for this statement;
7744 return the attribute we parsed. Multiple attributes are never allowed. */
7746 int
7748 {
7753 {
7761 {
7764 }
7767 {
7770 }
7773 else
7775 }
7778 }
7780 /* Transform a TM attribute name into a maskable integer and back.
7781 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
7782 to how the lack of an attribute is treated. */
7784 int
7786 {
7800 }
7802 tree
7804 {
7807 {
7825 }
7827 }
7829 /* Return the first TM attribute seen in LIST. */
7831 tree
7833 {
7835 {
7839 }
7841 }
7843 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
7844 Here we accept only function types, and verify that none of the other
7845 function TM attributes are also applied. */
7846 /* ??? We need to accept class types for C++, but not C. This greatly
7847 complicates this function, since we can no longer rely on the extra
7848 processing given by function_type_required. */
7850 static tree
7853 {
7854 /* Only one path adds the attribute; others don't. */
7858 {
7861 /* Only tm_callable and tm_safe apply to classes. */
7864 /* FALLTHRU */
7868 {
7871 ;
7874 else
7876 }
7880 {
7883 {
7888 }
7889 }
7890 /* FALLTHRU */
7893 /* If a function is next, pass it on to be tried next. */
7897 ignored:
7900 }
7903 }
7905 /* Handle the TM_WRAP attribute; arguments as in
7906 struct attribute_spec.handler. */
7908 static tree
7911 {
7914 /* We don't need the attribute even on success, since we
7915 record the entry in an external table. */
7920 else
7921 {
7927 else
7928 {
7932 {
7936 else
7938 }
7939 else
7941 }
7942 }
7945 }
7947 /* Ignore the given attribute. Used when this attribute may be usefully
7948 overridden by the target, but is not used generically. */
7950 static tree
7954 {
7957 }
7959 /* Handle a "no vops" attribute; arguments as in
7960 struct attribute_spec.handler. */
7962 static tree
7966 {
7970 }
7972 /* Handle a "deprecated" attribute; arguments as in
7973 struct attribute_spec.handler. */
7975 static tree
7979 {
7987 {
7990 }
7993 {
8004 else
8006 }
8008 {
8013 }
8014 else
8018 {
8021 {
8027 }
8030 else
8032 }
8035 }
8037 /* Handle a "vector_size" attribute; arguments as in
8038 struct attribute_spec.handler. */
8040 static tree
8044 {
8054 {
8057 }
8059 /* Get the vector size (in bytes). */
8062 /* We need to provide for vector pointers, vector arrays, and
8063 functions returning vectors. For example:
8065 __attribute__((vector_size(16))) short *foo;
8067 In this case, the mode is SI, but the type being modified is
8068 HI, so we need to look further. */
8077 /* Get the mode of the type being modified. */
8088 {
8091 }
8094 {
8097 }
8100 {
8103 }
8105 /* Calculate how many units fit in the vector. */
8108 {
8111 }
8115 /* Build back pointers if needed. */
8119 }
8121 /* Handle the "nonnull" attribute. */
8122 static tree
8126 {
8130 /* If no arguments are specified, all pointer arguments should be
8131 non-null. Verify a full prototype is given so that the arguments
8132 will have the correct types when we actually check them later. */
8134 {
8136 {
8139 }
8141 }
8143 /* Argument list specified. Verify that each argument number references
8144 a pointer argument. */
8146 {
8150 {
8155 }
8158 {
8159 function_args_iterator iter;
8160 tree argument;
8164 {
8168 }
8172 {
8177 }
8180 {
8185 }
8186 }
8187 }
8190 }
8192 /* Check the argument list of a function call for null in argument slots
8193 that are marked as requiring a non-null pointer argument. The NARGS
8194 arguments are passed in the array ARGARRAY.
8195 */
8197 static void
8199 {
8200 tree a;
8208 /* See if any of the nonnull attributes has no arguments. If so,
8209 then every pointer argument is checked (in which case the check
8210 for pointer type is done in check_nonnull_arg). */
8212 do
8220 else
8221 {
8222 /* Walk the argument list. If we encounter an argument number we
8223 should check for non-null, do it. */
8225 {
8227 {
8231 }
8236 }
8237 }
8238 }
8240 /* Check that the Nth argument of a function call (counting backwards
8241 from the end) is a (pointer)0. The NARGS arguments are passed in the
8242 array ARGARRAY. */
8244 static void
8246 {
8250 {
8253 tree sentinel;
8254 function_args_iterator iter;
8255 tree t;
8257 /* Skip over the named arguments. */
8259 {
8262 len++;
8263 }
8266 {
8269 }
8271 /* The sentinel must be one of the varargs, i.e.
8272 in position >= the number of fixed arguments. */
8274 {
8278 }
8280 /* Validate the sentinel. */
8284 /* Although __null (in C++) is only an integer we allow it
8285 nevertheless, as we are guaranteed that it's exactly
8286 as wide as a pointer, and we don't want to force
8287 users to cast the NULL they have written there.
8288 We warn with -Wstrict-null-sentinel, though. */
8291 }
8292 }
8294 /* Helper for check_function_nonnull; given a list of operands which
8295 must be non-null in ARGS, determine if operand PARAM_NUM should be
8296 checked. */
8298 static bool
8300 {
8304 {
8311 }
8313 }
8315 /* Check that the function argument PARAM (which is operand number
8316 PARAM_NUM) is non-null. This is called by check_function_nonnull
8317 via check_function_arguments_recurse. */
8319 static void
8322 {
8323 /* Just skip checking the argument if it's not a pointer. This can
8324 happen if the "nonnull" attribute was given without an operand
8325 list (which means to check every pointer argument). */
8333 }
8335 /* Helper for nonnull attribute handling; fetch the operand number
8336 from the attribute argument list. */
8338 static bool
8340 {
8341 /* Verify the arg number is a constant. */
8348 }
8350 /* Handle a "nothrow" attribute; arguments as in
8351 struct attribute_spec.handler. */
8353 static tree
8356 {
8359 /* ??? TODO: Support types. */
8360 else
8361 {
8364 }
8367 }
8369 /* Handle a "cleanup" attribute; arguments as in
8370 struct attribute_spec.handler. */
8372 static tree
8375 {
8379 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8380 for global destructors in C++. This requires infrastructure that
8381 we don't have generically at the moment. It's also not a feature
8382 we'd be missing too much, since we do have attribute constructor. */
8384 {
8388 }
8390 /* Verify that the argument is a function in scope. */
8391 /* ??? We could support pointers to functions here as well, if
8392 that was considered desirable. */
8395 {
8399 }
8402 {
8406 }
8408 /* That the function has proper type is checked with the
8409 eventual call to build_function_call. */
8412 }
8414 /* Handle a "warn_unused_result" attribute. No special handling. */
8416 static tree
8420 {
8421 /* Ignore the attribute for functions not returning any value. */
8423 {
8426 }
8429 }
8431 /* Handle a "sentinel" attribute. */
8433 static tree
8436 {
8438 {
8442 }
8443 else
8444 {
8446 {
8450 }
8451 }
8454 {
8458 {
8462 }
8463 else
8464 {
8466 {
8470 }
8471 }
8472 }
8475 }
8477 /* Handle a "type_generic" attribute. */
8479 static tree
8483 {
8484 /* Ensure we have a function type. */
8487 /* Ensure we have a variadic function. */
8491 }
8493 /* Handle a "target" attribute. */
8495 static tree
8498 {
8499 /* Ensure we have a function type. */
8501 {
8504 }
8506 flags))
8510 }
8512 /* Arguments being collected for optimization. */
8519 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8520 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8521 false for #pragma GCC optimize. */
8523 bool
8525 {
8533 tree ap;
8535 /* Build up argv vector. Just in case the string is stored away, use garbage
8536 collected strings. */
8541 {
8545 {
8549 }
8552 {
8553 /* Split string into multiple substrings. */
8561 {
8568 {
8572 }
8573 else
8574 {
8577 }
8581 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8582 options. */
8584 {
8589 else
8593 }
8596 {
8599 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8600 itself is -Os, and any other switch begins with a -f. */
8606 }
8611 }
8613 }
8614 }
8624 /* Now parse the options. */
8634 /* Don't allow changing -fstrict-aliasing. */
8639 }
8641 /* For handling "optimize" attribute. arguments as in
8642 struct attribute_spec.handler. */
8644 static tree
8647 {
8648 /* Ensure we have a function type. */
8650 {
8653 }
8654 else
8655 {
8659 /* Save current options. */
8662 /* If we previously had some optimization options, use them as the
8663 default. */
8668 /* Parse options, and update the vector. */
8673 /* Restore current options. */
8675 }
8678 }
8680 /* Handle a "no_split_stack" attribute. */
8682 static tree
8687 {
8691 {
8695 }
8697 {
8701 }
8704 }
8705 \f
8706 /* Check for valid arguments being passed to a function with FNTYPE.
8707 There are NARGS arguments in the array ARGARRAY. */
8708 void
8710 {
8711 /* Check for null being passed in a pointer argument that must be
8712 non-null. We also need to do this if format checking is enabled. */
8717 /* Check for errors in format strings. */
8724 }
8726 /* Generic argument checking recursion routine. PARAM is the argument to
8727 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8728 once the argument is resolved. CTX is context for the callback. */
8729 void
8734 {
8738 {
8739 /* Strip coercion. */
8743 }
8746 {
8748 tree attrs;
8751 /* See if this is a call to a known internationalization function
8752 that modifies a format arg. Such a function may have multiple
8753 format_arg attributes (for example, ngettext). */
8756 attrs;
8759 {
8760 tree inner_arg;
8761 tree format_num_expr;
8764 call_expr_arg_iterator iter;
8766 /* Extract the argument number, which was previously checked
8767 to be valid. */
8779 {
8784 }
8785 }
8787 /* If we found a format_arg attribute and did a recursive check,
8788 we are done with checking this argument. Otherwise, we continue
8789 and this will be considered a non-literal. */
8792 }
8795 {
8796 /* Check both halves of the conditional expression. */
8802 }
8805 }
8807 /* Checks for a builtin function FNDECL that the number of arguments
8808 NARGS against the required number REQUIRED and issues an error if
8809 there is a mismatch. Returns true if the number of arguments is
8810 correct, otherwise false. */
8812 static bool
8814 {
8816 {
8820 }
8822 {
8826 }
8828 }
8830 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8831 Returns false if there was an error, otherwise true. */
8833 bool
8835 {
8841 {
8851 {
8853 {
8857 }
8859 }
8869 {
8876 {
8880 }
8882 }
8887 {
8892 {
8896 }
8899 {
8901 fndecl);
8903 }
8905 }
8910 {
8912 {
8915 }
8917 }
8922 }
8923 }
8925 /* Function to help qsort sort FIELD_DECLs by name order. */
8927 int
8929 {
8934 /* A nontype is "greater" than a type. */
8943 }
8946 gt_pointer_operator new_value;
8950 /* This routine compares two fields like field_decl_cmp but using the
8951 pointer operator in resort_data. */
8953 static int
8955 {
8960 /* A nontype is "greater" than a type. */
8966 {
8973 }
8975 }
8977 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8979 void
8982 gt_pointer_operator new_value,
8984 {
8989 resort_field_decl_cmp);
8990 }
8992 /* Subroutine of c_parse_error.
8993 Return the result of concatenating LHS and RHS. RHS is really
8994 a string literal, its first character is indicated by RHS_START and
8995 RHS_SIZE is its length (including the terminating NUL character).
8997 The caller is responsible for deleting the returned pointer. */
9001 {
9007 }
9009 /* Issue the error given by GMSGID, indicating that it occurred before
9010 TOKEN, which had the associated VALUE. */
9012 void
9015 {
9016 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9026 {
9031 {
9044 }
9048 else
9054 }
9064 {
9069 }
9077 {
9082 }
9083 else
9087 {
9090 }
9091 #undef catenate_messages
9092 }
9094 /* Mapping for cpp message reasons to the options that enable them. */
9096 struct reason_option_codes_t
9097 {
9100 };
9120 };
9122 /* Return the gcc option code associated with the reason for a cpp
9123 message, or 0 if none. */
9125 static int
9127 {
9131 {
9134 }
9136 }
9138 /* Callback from cpp_error for PFILE to print diagnostics from the
9139 preprocessor. The diagnostic is of type LEVEL, with REASON set
9140 to the reason code if LEVEL is represents a warning, at location
9141 LOCATION unless this is after lexing and the compiler's location
9142 should be used instead, with column number possibly overridden by
9143 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9144 the arguments. Returns true if a diagnostic was emitted, false
9145 otherwise. */
9147 bool
9151 {
9152 diagnostic_info diagnostic;
9153 diagnostic_t dlevel;
9158 {
9163 /* Fall through. */
9188 }
9201 }
9203 /* Convert a character from the host to the target execution character
9204 set. cpplib handles this, mostly. */
9206 HOST_WIDE_INT
9208 {
9209 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9210 zero-extended under -fno-signed-char. cpplib insists that characters
9211 and character constants are always unsigned. Hence we must convert
9212 back and forth. */
9220 else
9222 }
9224 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9225 references with an INDIRECT_REF of a constant at the bottom; much like the
9226 traditional rendering of offsetof as a macro. Return the folded result. */
9228 tree
9230 {
9234 {
9250 {
9253 }
9263 {
9267 }
9281 /* Check if the offset goes beyond the upper bound of the array. */
9283 {
9289 {
9293 {
9294 tree v;
9301 {
9309 }
9310 /* Don't warn if the array might be considered a poor
9311 man's flexible array member with a very permissive
9312 definition thereof. */
9316 "index %E denotes an offset "
9319 }
9320 }
9321 }
9328 /* Handle static members of volatile structs. */
9335 }
9338 }
9340 /* Likewise, but convert it to the return type of offsetof. */
9342 tree
9344 {
9346 }
9348 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9349 expression, because B will always be true. */
9351 void
9353 {
9356 "the omitted middle operand in ?: will always be %<true%>, "
9358 }
9360 /* Give an error for storing into ARG, which is 'const'. USE indicates
9361 how ARG was being used. */
9363 void
9365 {
9368 /* Using this macro rather than (for example) arrays of messages
9369 ensures that all the format strings are checked at compile
9370 time. */
9371 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9372 : (use == lv_increment ? (I) \
9373 : (use == lv_decrement ? (D) : (AS))))
9375 {
9386 else
9392 }
9398 arg);
9404 arg);
9406 {
9416 arg);
9417 }
9423 arg);
9424 else
9429 arg);
9430 }
9432 /* Print an error message for an invalid lvalue. USE says
9433 how the lvalue is being used and so selects the error message. LOC
9434 is the location for the error. */
9436 void
9438 {
9440 {
9458 }
9459 }
9461 /* Print an error message for an invalid indirection of type TYPE.
9462 ERRSTRING is the name of the operator for the indirection. */
9464 void
9466 {
9468 {
9476 type);
9481 type);
9486 type);
9491 type);
9495 }
9496 }
9497 \f
9498 /* *PTYPE is an incomplete array. Complete it with a domain based on
9499 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9500 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9501 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9503 int
9505 {
9512 {
9514 {
9515 int eltsize
9518 }
9520 {
9524 {
9528 }
9529 else
9530 {
9531 tree curindex;
9544 cnt++)
9545 {
9549 else
9550 {
9554 size_one_node);
9555 }
9558 }
9561 }
9562 }
9563 else
9564 {
9565 /* Make an error message unless that happened already. */
9568 }
9569 }
9570 else
9571 {
9575 }
9582 else
9585 /* Using build_distinct_type_copy and modifying things afterward instead
9586 of using build_array_type to create a new type preserves all of the
9587 TYPE_LANG_FLAG_? bits that the front end may have set. */
9595 /* Make sure we have the canonical MAIN_TYPE. */
9598 hashcode);
9601 /* Fix the canonical type. */
9611 else
9616 else
9622 {
9624 /* If we proceed with the array type as it is, we'll eventually
9625 crash in tree_low_cst(). */
9627 }
9631 }
9633 /* Like c_mark_addressable but don't check register qualifier. */
9634 void
9636 {
9642 }
9645 \f
9646 /* Used to help initialize the builtin-types.def table. When a type of
9647 the correct size doesn't exist, use error_mark_node instead of NULL.
9648 The later results in segfaults even when a decl using the type doesn't
9649 get invoked. */
9651 tree
9653 {
9656 }
9658 /* A helper function for resolve_overloaded_builtin in resolving the
9659 overloaded __sync_ builtins. Returns a positive power of 2 if the
9660 first operand of PARAMS is a pointer to a supported data type.
9661 Returns 0 if an error is encountered. */
9663 static int
9665 {
9666 tree type;
9670 {
9673 }
9687 incompatible:
9690 }
9692 /* A helper function for resolve_overloaded_builtin. Adds casts to
9693 PARAMS to make arguments match up with those of FUNCTION. Drops
9694 the variadic arguments at the end. Returns false if some error
9695 was encountered; true on success. */
9697 static bool
9700 {
9701 function_args_iterator iter;
9702 tree ptype;
9706 /* We've declared the implementation functions to use "volatile void *"
9707 as the pointer parameter, so we shouldn't get any complaints from the
9708 call to check_function_arguments what ever type the user used. */
9712 /* For the rest of the values, we need to cast these to FTYPE, so that we
9713 don't get warnings for passing pointer types, etc. */
9716 {
9720 /* XXX void_type_node belies the abstraction. */
9726 {
9729 }
9731 /* Only convert parameters if arg_type is unsigned integer type with
9732 new format sync routines, i.e. don't attempt to convert pointer
9733 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9734 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9735 kinds). */
9737 {
9738 /* Ideally for the first conversion we'd use convert_for_assignment
9739 so that we get warnings for anything that doesn't match the pointer
9740 type. This isn't portable across the C and C++ front ends atm. */
9745 }
9748 }
9750 /* __atomic routines are not variadic. */
9752 {
9755 }
9757 /* The definition of these primitives is variadic, with the remaining
9758 being "an optional list of variables protected by the memory barrier".
9759 No clue what that's supposed to mean, precisely, but we consider all
9760 call-clobbered variables to be protected so we're safe. */
9764 }
9766 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9767 RESULT to make it match the type of the first pointer argument in
9768 PARAMS. */
9770 static tree
9772 {
9777 /* New format doesn't require casting unless the types are the same size. */
9780 else
9782 }
9784 /* This function verifies the PARAMS to generic atomic FUNCTION.
9785 It returns the size if all the parameters are the same size, otherwise
9786 0 is returned if the parameters are invalid. */
9788 static int
9790 {
9795 tree type_0;
9797 /* Determine the parameter makeup. */
9799 {
9815 }
9818 {
9821 }
9823 /* Get type of first parameter, and determine its size. */
9826 {
9828 function);
9830 }
9832 /* Types must be compile time constant sizes. */
9834 {
9837 function);
9839 }
9843 /* Zero size objects are not allowed. */
9845 {
9848 function);
9850 }
9852 /* Check each other parameter is a pointer and the same size. */
9854 {
9857 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
9861 {
9863 function);
9865 }
9868 {
9870 function);
9872 }
9873 }
9875 /* Check memory model parameters for validity. */
9877 {
9880 {
9883 {
9886 function);
9887 }
9888 }
9889 else
9891 {
9893 function);
9895 }
9896 }
9899 }
9902 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
9903 at the beginning of the parameter list PARAMS representing the size of the
9904 objects. This is to match the library ABI requirement. LOC is the location
9905 of the function call.
9906 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
9907 returned to allow the external call to be constructed. */
9909 static tree
9912 {
9913 tree size_node;
9915 /* Insert a SIZE_T parameter as the first param. If there isn't
9916 enough space, allocate a new vector and recursively re-build with that. */
9918 {
9921 tree f;
9930 }
9932 /* Add the size parameter and leave as a function call for processing. */
9936 }
9939 /* This will process an __atomic_exchange function call, determine whether it
9940 needs to be mapped to the _N variation, or turned into a library call.
9941 LOC is the location of the builtin call.
9942 FUNCTION is the DECL that has been invoked;
9943 PARAMS is the argument list for the call. The return value is non-null
9944 TRUE is returned if it is translated into the proper format for a call to the
9945 external library, and NEW_RETURN is set the tree for that function.
9946 FALSE is returned if processing for the _N variation is required, and
9947 NEW_RETURN is set to the the return value the result is copied into. */
9948 static bool
9951 {
9956 /* Size of 0 is an error condition. */
9958 {
9961 }
9963 /* If not a lock-free size, change to the library generic format. */
9965 {
9968 }
9970 /* Otherwise there is a lockfree match, transform the call from:
9971 void fn(T* mem, T* desired, T* return, model)
9972 into
9973 *return = (T) (fn (In* mem, (In) *desired, model)) */
9980 /* Create pointer to appropriate size. */
9984 /* Convert object pointer to required type. */
9987 /* Convert new value to required type, and dereference it. */
9992 /* Move memory model to the 3rd position, and end param list. */
9996 /* Convert return pointer and dereference it for later assignment. */
10000 }
10003 /* This will process an __atomic_compare_exchange function call, determine
10004 whether it needs to be mapped to the _N variation, or turned into a lib call.
10005 LOC is the location of the builtin call.
10006 FUNCTION is the DECL that has been invoked;
10007 PARAMS is the argument list for the call. The return value is non-null
10008 TRUE is returned if it is translated into the proper format for a call to the
10009 external library, and NEW_RETURN is set the tree for that function.
10010 FALSE is returned if processing for the _N variation is required. */
10012 static bool
10016 {
10021 /* Size of 0 is an error condition. */
10023 {
10026 }
10028 /* If not a lock-free size, change to the library generic format. */
10030 {
10031 /* The library generic format does not have the weak parameter, so
10032 remove it from the param list. Since a parameter has been removed,
10033 we can be sure that there is room for the SIZE_T parameter, meaning
10034 there will not be a recursive rebuilding of the parameter list, so
10035 there is no danger this will be done twice. */
10037 {
10041 }
10044 }
10046 /* Otherwise, there is a match, so the call needs to be transformed from:
10047 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10048 into
10049 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10055 /* Create pointer to appropriate size. */
10059 /* Convert object pointer to required type. */
10063 /* Convert expected pointer to required type. */
10067 /* Convert desired value to required type, and dereference it. */
10072 /* The rest of the parameters are fine. NULL means no special return value
10073 processing.*/
10076 }
10079 /* This will process an __atomic_load function call, determine whether it
10080 needs to be mapped to the _N variation, or turned into a library call.
10081 LOC is the location of the builtin call.
10082 FUNCTION is the DECL that has been invoked;
10083 PARAMS is the argument list for the call. The return value is non-null
10084 TRUE is returned if it is translated into the proper format for a call to the
10085 external library, and NEW_RETURN is set the tree for that function.
10086 FALSE is returned if processing for the _N variation is required, and
10087 NEW_RETURN is set to the the return value the result is copied into. */
10089 static bool
10092 {
10097 /* Size of 0 is an error condition. */
10099 {
10102 }
10104 /* If not a lock-free size, change to the library generic format. */
10106 {
10109 }
10111 /* Otherwise, there is a match, so the call needs to be transformed from:
10112 void fn(T* mem, T* return, model)
10113 into
10114 *return = (T) (fn ((In *) mem, model)) */
10120 /* Create pointer to appropriate size. */
10124 /* Convert object pointer to required type. */
10128 /* Move memory model to the 2nd position, and end param list. */
10132 /* Convert return pointer and dereference it for later assignment. */
10136 }
10139 /* This will process an __atomic_store function call, determine whether it
10140 needs to be mapped to the _N variation, or turned into a library call.
10141 LOC is the location of the builtin call.
10142 FUNCTION is the DECL that has been invoked;
10143 PARAMS is the argument list for the call. The return value is non-null
10144 TRUE is returned if it is translated into the proper format for a call to the
10145 external library, and NEW_RETURN is set the tree for that function.
10146 FALSE is returned if processing for the _N variation is required, and
10147 NEW_RETURN is set to the the return value the result is copied into. */
10149 static bool
10152 {
10157 /* Size of 0 is an error condition. */
10159 {
10162 }
10164 /* If not a lock-free size, change to the library generic format. */
10166 {
10169 }
10171 /* Otherwise, there is a match, so the call needs to be transformed from:
10172 void fn(T* mem, T* value, model)
10173 into
10174 fn ((In *) mem, (In) *value, model) */
10179 /* Create pointer to appropriate size. */
10183 /* Convert object pointer to required type. */
10187 /* Convert new value to required type, and dereference it. */
10192 /* The memory model is in the right spot already. Return is void. */
10196 }
10199 /* Some builtin functions are placeholders for other expressions. This
10200 function should be called immediately after parsing the call expression
10201 before surrounding code has committed to the type of the expression.
10203 LOC is the location of the builtin call.
10205 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10206 PARAMS is the argument list for the call. The return value is non-null
10207 when expansion is complete, and null if normal processing should
10208 continue. */
10210 tree
10212 {
10218 {
10224 else
10228 }
10230 /* Handle BUILT_IN_NORMAL here. */
10232 {
10237 {
10238 /* Handle these 4 together so that they can fall through to the next
10239 case if the call is transformed to an _N variant. */
10241 {
10243 {
10247 /* Change to the _N variant. */
10250 }
10253 {
10255 params,
10258 /* Change to the _N variant. */
10261 }
10263 {
10267 /* Change to the _N variant. */
10270 }
10272 {
10276 /* Change to the _N variant. */
10279 }
10282 }
10283 /* Fallthrough to the normal processing. */
10284 }
10301 {
10303 /* Fallthru for parameter processing. */
10304 }
10321 {
10332 orig_format))
10344 /* If new_return is set, assign function to that expr and cast the
10345 result to void since the generic interface returned void. */
10347 {
10348 /* Cast function result from I{1,2,4,8,16} to the required type. */
10351 result);
10355 }
10357 }
10361 }
10362 }
10364 /* Ignoring their sign, return true if two scalar types are the same. */
10365 bool
10367 {
10374 /* Equality works here because c_common_signed_type uses
10375 TYPE_MAIN_VARIANT. */
10378 }
10380 /* Check for missing format attributes on function pointers. LTYPE is
10381 the new type or left-hand side type. RTYPE is the old type or
10382 right-hand side type. Returns TRUE if LTYPE is missing the desired
10383 attribute. */
10385 bool
10387 {
10389 tree ra;
10395 {
10396 tree la;
10401 }
10402 else
10404 }
10406 /* Subscripting with type char is likely to lose on a machine where
10407 chars are signed. So warn on any machine, but optionally. Don't
10408 warn for unsigned char since that type is safe. Don't warn for
10409 signed char because anyone who uses that must have done so
10410 deliberately. Furthermore, we reduce the false positive load by
10411 warning only for non-constant value of type char. */
10413 void
10415 {
10419 }
10421 /* Implement -Wparentheses for the unexpected C precedence rules, to
10422 cover cases like x + y << z which readers are likely to
10423 misinterpret. We have seen an expression in which CODE is a binary
10424 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10425 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10426 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10427 expression was not formed using a binary or unary operator, or it
10428 was enclosed in parentheses. */
10430 void
10434 {
10438 /* This macro tests that the expression ARG with original tree code
10439 CODE appears to be a boolean expression. or the result of folding a
10440 boolean expression. */
10441 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10442 (truth_value_p (TREE_CODE (ARG)) \
10443 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10445 || ((CODE) != INTEGER_CST \
10446 && (integer_onep (ARG) || integer_zerop (ARG))))
10449 {
10481 /* Check cases like x|y==z */
10486 /* Check cases like !x | y */
10500 /* Check cases like x^y==z */
10514 /* Check cases like x&y==z */
10519 /* Check cases like !x & y */
10550 }
10551 #undef NOT_A_BOOLEAN_EXPR_P
10552 }
10554 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10556 void
10558 {
10560 {
10563 else
10565 }
10566 }
10568 /* Warn for division by zero according to the value of DIVISOR. LOC
10569 is the location of the division operator. */
10571 void
10573 {
10574 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10575 about division by zero. Do not issue a warning if DIVISOR has a
10576 floating-point type, since we consider 0.0/0.0 a valid way of
10577 generating a NaN. */
10581 }
10583 /* Subroutine of build_binary_op. Give warnings for comparisons
10584 between signed and unsigned quantities that may fail. Do the
10585 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10586 so that casts will be considered, but default promotions won't
10587 be.
10589 LOCATION is the location of the comparison operator.
10591 The arguments of this function map directly to local variables
10592 of build_binary_op. */
10594 void
10599 {
10604 /* In C++, check for comparison of different enum types. */
10610 {
10614 }
10616 /* Do not warn if the comparison is being done in a signed type,
10617 since the signed type will only be chosen if it can represent
10618 all the values of the unsigned type. */
10621 /* Do not warn if both operands are unsigned. */
10624 else
10625 {
10631 else
10639 /* Do not warn if the signed quantity is an unsuffixed integer
10640 literal (or some static constant expression involving such
10641 literals or a conditional expression involving such literals)
10642 and it is non-negative. */
10645 /* Do not warn if the comparison is an equality operation, the
10646 unsigned quantity is an integral constant, and it would fit
10647 in the result if the result were signed. */
10652 /* In C, do not warn if the unsigned quantity is an enumeration
10653 constant and its maximum value would fit in the result if the
10654 result were signed. */
10660 else
10662 OPT_Wsign_compare,
10664 }
10666 /* Warn if two unsigned values are being compared in a size larger
10667 than their original size, and one (and only one) is the result of
10668 a `~' operator. This comparison will always fail.
10670 Also warn if one operand is a constant, and the constant does not
10671 have all bits set that are set in the ~ operand when it is
10672 extended. */
10679 {
10686 {
10687 tree primop;
10693 {
10697 }
10698 else
10699 {
10703 }
10708 {
10711 {
10715 else
10718 }
10719 }
10720 }
10728 }
10729 }
10731 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
10732 type via c_common_type. If -Wdouble-promotion is in use, and the
10733 conditions for warning have been met, issue a warning. GMSGID is
10734 the warning message. It must have two %T specifiers for the type
10735 that was converted (generally "float") and the type to which it was
10736 converted (generally "double), respectively. LOC is the location
10737 to which the awrning should refer. */
10739 void
10742 {
10743 tree source_type;
10747 /* If the conversion will not occur at run-time, there is no need to
10748 warn about it. */
10760 else
10763 }
10765 /* Setup a TYPE_DECL node as a typedef representation.
10767 X is a TYPE_DECL for a typedef statement. Create a brand new
10768 ..._TYPE node (which will be just a variant of the existing
10769 ..._TYPE node with identical properties) and then install X
10770 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
10772 The whole point here is to end up with a situation where each
10773 and every ..._TYPE node the compiler creates will be uniquely
10774 associated with AT MOST one node representing a typedef name.
10775 This way, even though the compiler substitutes corresponding
10776 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
10777 early on, later parts of the compiler can always do the reverse
10778 translation and get back the corresponding typedef name. For
10779 example, given:
10781 typedef struct S MY_TYPE;
10782 MY_TYPE object;
10784 Later parts of the compiler might only know that `object' was of
10785 type `struct S' if it were not for code just below. With this
10786 code however, later parts of the compiler see something like:
10788 struct S' == struct S
10789 typedef struct S' MY_TYPE;
10790 struct S' object;
10792 And they can then deduce (from the node for type struct S') that
10793 the original object declaration was:
10795 MY_TYPE object;
10797 Being able to do this is important for proper support of protoize,
10798 and also for generating precise symbolic debugging information
10799 which takes full account of the programmer's (typedef) vocabulary.
10801 Obviously, we don't want to generate a duplicate ..._TYPE node if
10802 the TYPE_DECL node that we are now processing really represents a
10803 standard built-in type. */
10805 void
10807 {
10811 {
10814 }
10817 {
10825 }
10826 }
10828 /* Record the types used by the current global variable declaration
10829 being parsed, so that we can decide later to emit their debug info.
10830 Those types are in types_used_by_cur_var_decl, and we are going to
10831 store them in the types_used_by_vars_hash hash table.
10832 DECL is the declaration of the global variable that has been parsed. */
10834 void
10836 {
10840 {
10843 }
10844 }
10846 /* If DECL is a typedef that is declared in the current function,
10847 record it for the purpose of -Wunused-local-typedefs. */
10849 void
10851 {
10856 /* if this is not a locally defined typedef then we are not
10857 interested. */
10864 }
10866 /* If T is a TYPE_DECL declared locally, mark it as used. */
10868 void
10870 {
10875 }
10877 /* Warn if there are some unused locally defined typedefs in the
10878 current function. */
10880 void
10882 {
10884 tree decl;
10885 /* The number of times we have emitted -Wunused-local-typedefs
10886 warnings. If this is different from errorcount, that means some
10887 unrelated errors have been issued. In which case, we'll avoid
10888 emitting "unused-local-typedefs" warnings. */
10900 {
10904 OPT_Wunused_local_typedefs,
10907 }
10910 {
10913 }
10914 }
10916 /* The C and C++ parsers both use vectors to hold function arguments.
10917 For efficiency, we keep a cache of unused vectors. This is the
10918 cache. */
10925 /* Return a new vector from the cache. If the cache is empty,
10926 allocate a new vector. These vectors are GC'ed, so it is OK if the
10927 pointer is not released.. */
10931 {
10934 else
10935 {
10936 /* Passing 0 to VEC_alloc returns NULL, and our callers require
10937 that we always return a non-NULL value. The vector code uses
10938 4 when growing a NULL vector, so we do too. */
10940 }
10941 }
10943 /* Release a vector of trees back to the cache. */
10945 void
10947 {
10949 {
10952 }
10953 }
10955 /* Get a new tree vector holding a single tree. */
10959 {
10963 }
10965 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
10969 {
10974 }
10976 /* Get a new tree vector which is a copy of an existing one. */
10980 {
10983 tree t;
10990 }
10992 /* Return true if KEYWORD starts a type specifier. */
10994 bool
10996 {
10998 {
11028 }
11029 }
11031 /* Return true if KEYWORD names a type qualifier. */
11033 bool
11035 {
11037 {
11044 }
11045 }
11047 /* Return true if KEYWORD names a storage class specifier.
11049 RID_TYPEDEF is not included in this list despite `typedef' being
11050 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11051 such for syntactic convenience only. */
11053 bool
11055 {
11057 {
11067 }
11068 }
11070 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11072 static bool
11074 {
11076 {
11084 }
11085 }
11087 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11088 declaration-specifier (C99 6.7). */
11090 bool
11092 {
11099 {
11106 }
11107 }
11109 /* Initialize language-specific-bits of tree_contains_struct. */
11111 void
11113 {
11116 }
11118 /* Build a user-defined numeric literal out of an integer constant type VALUE
11119 with identifier SUFFIX. */
11121 tree
11123 {
11129 }
11131 /* For vector[index], convert the vector to a
11132 pointer of the underlying type. */
11133 void
11136 {
11138 {
11140 tree type1;
11154 }
11155 }