| blob | bb18c39cd6ba1ba8c62ba14f2429525939b0f244 |
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 {
562 /* These Objective-C keywords are recognized only immediately after
563 an '@'. */
580 /* These are recognized only in protocol-qualifier context
581 (see above) */
588 /* These are recognized inside a property attribute list */
597 };
602 /* Table of machine-independent attributes common to all C-like languages. */
604 {
605 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
606 affects_type_identity } */
613 /* FIXME: logically, noreturn attributes should be listed as
614 "false, true, true" and apply to function types. But implementing this
615 would require all the places in the compiler that use TREE_THIS_VOLATILE
616 on a decl to identify non-returning functions to be located and fixed
617 to check the function type instead. */
642 /* The same comments as for noreturn attributes apply to const ones. */
666 handle_no_instrument_function_attribute,
684 /* ??? These two attributes didn't make the transition from the
685 Intel language document to the multi-vendor language document. */
690 /* For internal use (marking of builtins) only. The name contains space
691 to prevent its usage in source code. */
713 /* For internal use (marking of builtins) only. The name contains space
714 to prevent its usage in source code. */
731 /* For internal use only. The leading '*' both prevents its usage in
732 source code and signals that it may be overridden by machine tables. */
737 /* For internal use (marking of builtins and runtime functions) only.
738 The name contains space to prevent its usage in source code. */
742 };
744 /* Give the specifications for the format attributes, used by C and all
745 descendants. */
748 {
749 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
750 affects_type_identity } */
756 };
758 /* Return identifier for address space AS. */
762 {
766 }
768 /* Push current bindings for the function name VAR_DECLS. */
770 void
772 {
777 {
781 {
783 saved);
785 }
786 }
788 /* Normally they'll have been NULL, so only push if we've got a
789 stack, or they are non-NULL. */
791 saved_function_name_decls);
792 }
794 /* Finish up the current bindings, adding them into the current function's
795 statement tree. This must be done _before_ finish_stmt_tree is called.
796 If there is no current function, we must be at file scope and no statements
797 are involved. Pop the previous bindings. */
799 void
801 {
810 {
818 }
824 {
825 /* We had saved values, restore them. */
826 tree saved;
829 {
834 }
836 }
838 }
840 /* Return the text name of the current function, suitably prettified
841 by PRETTY_P. Return string must be freed by caller. */
845 {
852 {
855 }
868 {
871 }
874 }
876 /* Return the VAR_DECL for a const char array naming the current
877 function. If the VAR_DECL has not yet been created, create it
878 now. RID indicates how it should be formatted and IDENTIFIER_NODE
879 ID is its name (unfortunately C and C++ hold the RID values of
880 keywords in different places, so we can't derive RID from ID in
881 this language independent code. LOC is the location of the
882 function. */
884 tree
886 {
896 {
897 /* If a tree is built here, it would normally have the lineno of
898 the current statement. Later this tree will be moved to the
899 beginning of the function and this line number will be wrong.
900 To avoid this problem set the lineno to 0 here; that prevents
901 it from appearing in the RTL. */
902 tree stmts;
910 saved_function_name_decls
914 }
919 }
921 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
923 tree
925 {
930 /* Compute the number of elements, for the array type. */
932 {
935 }
937 {
940 }
942 {
945 }
946 else
947 {
950 }
952 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
953 limit in C++98 Annex B is very large (65536) and is not normative,
954 so we do not diagnose it (warn_overlength_strings is forced off
955 in c_common_post_options). */
957 {
961 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
962 separate the %d from the 'C'. 'ISO' should not be
963 translated, but it may be moved after 'C%d' in languages
964 where modifiers follow nouns. */
966 "string length %qd is greater than the length %qd "
969 }
971 /* Create the array type for the string constant. The ISO C++
972 standard says that a string literal has type `const char[N]' or
973 `const wchar_t[N]'. We use the same logic when invoked as a C
974 front-end with -Wwrite-strings.
975 ??? We should change the type of an expression depending on the
976 state of a warning flag. We should just be warning -- see how
977 this is handled in the C++ front-end for the deprecated implicit
978 conversion from string literals to `char*' or `wchar_t*'.
980 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
981 array type being the unqualified version of that type.
982 Therefore, if we are constructing an array of const char, we must
983 construct the matching unqualified array type first. The C front
984 end does not require this, but it does no harm, so we do it
985 unconditionally. */
996 }
997 \f
998 /* If DISABLE is true, stop issuing warnings. This is used when
999 parsing code that we know will not be executed. This function may
1000 be called multiple times, and works as a stack. */
1002 static void
1004 {
1006 {
1009 }
1010 }
1012 /* If ENABLE is true, reenable issuing warnings. */
1014 static void
1016 {
1018 {
1021 }
1022 }
1024 /* Fully fold EXPR, an expression that was not folded (beyond integer
1025 constant expressions and null pointer constants) when being built
1026 up. If IN_INIT, this is in a static initializer and certain
1027 changes are made to the folding done. Clear *MAYBE_CONST if
1028 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1029 expression because it contains an evaluated operator (in C99) or an
1030 operator outside of sizeof returning an integer constant (in C90)
1031 not permitted in constant expressions, or because it contains an
1032 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1033 set to true by callers before calling this function.) Return the
1034 folded expression. Function arguments have already been folded
1035 before calling this function, as have the contents of SAVE_EXPR,
1036 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1037 C_MAYBE_CONST_EXPR. */
1039 tree
1041 {
1042 tree ret;
1048 /* This function is not relevant to C++ because C++ folds while
1049 parsing, and may need changes to be correct for C++ when C++
1050 stops folding while parsing. */
1057 {
1060 }
1067 }
1069 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1070 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1071 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1072 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1073 both evaluated and unevaluated subexpressions while
1074 *MAYBE_CONST_ITSELF is carried from only evaluated
1075 subexpressions). */
1077 static tree
1080 {
1092 /* This function is not relevant to C++ because C++ folds while
1093 parsing, and may need changes to be correct for C++ when C++
1094 stops folding while parsing. */
1098 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1099 anything else not counted as an expression cannot usefully be
1100 folded further at this point. */
1106 /* Operands of variable-length expressions (function calls) have
1107 already been folded, as have __builtin_* function calls, and such
1108 expressions cannot occur in constant expressions. */
1110 {
1114 }
1117 {
1126 else
1129 }
1131 /* Assignment, increment, decrement, function call and comma
1132 operators, and statement expressions, cannot occur in constant
1133 expressions if evaluated / outside of sizeof. (Function calls
1134 were handled above, though VA_ARG_EXPR is treated like a function
1135 call here, and statement expressions are handled through
1136 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1138 {
1158 }
1160 /* Fold individual tree codes as appropriate. */
1162 {
1164 /* Any non-constancy will have been marked in a containing
1165 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1173 maybe_const_itself);
1178 {
1181 }
1190 maybe_const_itself);
1193 maybe_const_itself);
1199 {
1203 }
1245 /* Binary operations evaluating both arguments (increment and
1246 decrement are binary internally in GCC). */
1250 maybe_const_itself);
1258 /* The RHS of a MODIFY_EXPR was fully folded when building that
1259 expression for the sake of conversion warnings. */
1262 maybe_const_itself);
1266 ret = in_init
1269 else
1280 CASE_CONVERT:
1290 /* Unary operations. */
1293 maybe_const_itself);
1297 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1298 not prepared to deal with them if they occur in initializers. */
1306 ret = in_init
1309 else
1314 {
1318 }
1320 {
1323 CASE_CONVERT:
1324 /* Don't warn about explicit conversions. We will already
1325 have warned about suspect implicit conversions. */
1332 }
1337 /* Binary operations not necessarily evaluating both
1338 arguments. */
1345 ? truthvalue_false_node
1353 ret = in_init
1356 else
1361 && op0_const
1362 && op0_const_self
1368 && op0_const_self
1394 else
1399 && op0_const
1400 && op0_const_self
1404 && op0_const_self
1408 && op0_const
1409 && op0_const_self
1413 && op0_const_self
1419 /* Each case where an operand with excess precision may be
1420 encountered must remove the EXCESS_PRECISION_EXPR around
1421 inner operands and possibly put one around the whole
1422 expression or possibly convert to the semantic type (which
1423 c_fully_fold does); we cannot tell at this stage which is
1424 appropriate in any particular case. */
1428 /* Various codes may appear through folding built-in functions
1429 and their arguments. */
1431 }
1433 out:
1434 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1435 have been done by this point, so remove them again. */
1439 {
1443 }
1447 }
1449 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1450 return EXP. Otherwise, return either EXP or its known constant
1451 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1452 Is the BLKmode test appropriate? */
1454 tree
1456 {
1457 tree ret;
1459 /* This function is only used by C, for c_fully_fold and other
1460 optimization, and may not be correct for C++. */
1471 /* Avoid unwanted tree sharing between the initializer and current
1472 function's body where the tree can be modified e.g. by the
1473 gimplifier. */
1477 }
1479 /* Print a warning if a constant expression had overflow in folding.
1480 Invoke this function on every expression that the language
1481 requires to be a constant expression.
1482 Note the ANSI C standard says it is erroneous for a
1483 constant expression to overflow. */
1485 void
1487 {
1495 }
1497 /* The same as above but print an unconditional error. */
1498 void
1500 {
1507 }
1509 /* Print a warning if an expression had overflow in folding and its
1510 operands hadn't.
1512 Invoke this function on every expression that
1513 (1) appears in the source code, and
1514 (2) is a constant expression that overflowed, and
1515 (3) is not already checked by convert_and_check;
1516 however, do not invoke this function on operands of explicit casts
1517 or when the expression is the result of an operator and any operand
1518 already overflowed. */
1520 void
1522 {
1527 {
1556 }
1557 }
1559 /* Warn about uses of logical || / && operator in a context where it
1560 is likely that the bitwise equivalent was intended by the
1561 programmer. We have seen an expression in which CODE is a binary
1562 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1563 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1564 void
1568 {
1580 /* Warn if &&/|| are being used in a context where it is
1581 likely that the bitwise equivalent was intended by the
1582 programmer. That is, an expression such as op && MASK
1583 where op should not be any boolean expression, nor a
1584 constant, and mask seems to be a non-boolean integer constant. */
1592 {
1596 else
1601 }
1603 /* We do not warn for constants because they are typical of macro
1604 expansions that test for features. */
1608 /* This warning only makes sense with logical operands. */
1616 /* We first test whether either side separately is trivially true
1617 (with OR) or trivially false (with AND). If so, do not warn.
1618 This is a common idiom for testing ranges of data types in
1619 portable code. */
1626 /* If this is an OR operation, invert both sides; now, the result
1627 should be always false to get a warning. */
1641 /* If this is an OR operation, invert both sides; now, the result
1642 should be always false to get a warning. */
1650 /* If both expressions have the same operand, if we can merge the
1651 ranges, and if the range test is always false, then warn. */
1658 {
1661 "logical %<or%> "
1663 else
1665 "logical %<and%> "
1667 }
1668 }
1671 /* Warn if EXP contains any computations whose results are not used.
1672 Return true if a warning is printed; false otherwise. LOCUS is the
1673 (potential) location of the expression. */
1675 bool
1677 {
1678 restart:
1682 /* Don't warn about void constructs. This includes casting to void,
1683 void function calls, and statement expressions with a final cast
1684 to void. */
1692 {
1708 /* For a binding, warn if no side effect within it. */
1720 /* In && or ||, warn if 2nd operand has no side effect. */
1727 /* Let people do `(foo (), 0)' without a warning. */
1734 /* If this is an expression with side effects, don't warn; this
1735 case commonly appears in macro expansions. */
1741 /* Don't warn about automatic dereferencing of references, since
1742 the user cannot control it. */
1744 {
1747 }
1748 /* Fall through. */
1751 /* Referencing a volatile value is a side effect, so don't warn. */
1756 /* If this is an expression which has no operands, there is no value
1757 to be unused. There are no such language-independent codes,
1758 but front ends may define such. */
1762 warn:
1764 }
1765 }
1768 /* Print a warning about casts that might indicate violation
1769 of strict aliasing rules if -Wstrict-aliasing is used and
1770 strict aliasing mode is in effect. OTYPE is the original
1771 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1773 bool
1775 {
1776 /* Strip pointer conversion chains and get to the correct original type. */
1784 /* If the type we are casting to is a ref-all pointer
1785 dereferencing it is always valid. */
1792 {
1793 /* Casting the address of an object to non void pointer. Warn
1794 if the cast breaks type based aliasing. */
1796 {
1800 }
1801 else
1802 {
1803 /* warn_strict_aliasing >= 3. This includes the default (3).
1804 Only warn if the cast is dereferenced immediately. */
1805 alias_set_type set1 =
1811 {
1815 }
1818 {
1822 }
1823 }
1824 }
1825 else
1827 {
1828 /* At this level, warn for any conversions, even if an address is
1829 not taken in the same statement. This will likely produce many
1830 false positives, but could be useful to pinpoint problems that
1831 are not revealed at higher levels. */
1836 {
1840 }
1841 }
1844 }
1846 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1847 sizeof as last operand of certain builtins. */
1849 void
1853 {
1868 {
1874 /* FALLTHRU */
1894 }
1909 {
1913 {
1916 "argument to %<sizeof%> in %qD call is the same "
1917 "expression as the destination; did you mean to "
1923 "argument to %<sizeof%> in %qD call is the same "
1924 "expression as the destination; did you mean to "
1926 else
1928 "argument to %<sizeof%> in %qD call is the same "
1929 "expression as the destination; did you mean to "
1932 }
1935 && !strop
1938 {
1940 "argument to %<sizeof%> in %qD call is the same "
1941 "pointer type %qT as the destination; expected %qT "
1945 }
1946 }
1949 {
1953 {
1956 "argument to %<sizeof%> in %qD call is the same "
1957 "expression as the source; did you mean to "
1963 "argument to %<sizeof%> in %qD call is the same "
1964 "expression as the source; did you mean to "
1966 else
1968 "argument to %<sizeof%> in %qD call is the same "
1969 "expression as the source; did you mean to "
1972 }
1975 && !strop
1978 {
1980 "argument to %<sizeof%> in %qD call is the same "
1981 "pointer type %qT as the source; expected %qT "
1985 }
1986 }
1987 }
1989 /* Warn for unlikely, improbable, or stupid DECL declarations
1990 of `main'. */
1992 void
1994 {
1995 function_args_iterator iter;
1996 tree type;
2000 {
2001 /* XXX void_type_node belies the abstraction. */
2007 {
2029 "third argument of %q+D should probably be "
2032 }
2033 }
2035 /* It is intentional that this message does not mention the third
2036 argument because it's only mentioned in an appendix of the
2037 standard. */
2041 }
2043 /* True if pointers to distinct types T1 and T2 can be converted to
2044 each other without an explicit cast. Only returns true for opaque
2045 vector types. */
2046 bool
2048 {
2055 }
2057 /* True if vector types T1 and T2 can be converted to each other
2058 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2059 can only be converted with -flax-vector-conversions yet that is not
2060 in effect, emit a note telling the user about that option if such
2061 a note has not previously been emitted. */
2062 bool
2064 {
2072 convertible_lax =
2087 {
2090 "conversions between vectors with differing "
2092 }
2095 }
2097 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2098 and have vector types, V0 has the same type as V1, and the number of
2099 elements of V0, V1, MASK is the same.
2101 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2102 called with two arguments. In this case implementation passes the
2103 first argument twice in order to share the same tree code. This fact
2104 could enable the mask-values being twice the vector length. This is
2105 an implementation accident and this semantics is not guaranteed to
2106 the user. */
2107 tree
2109 {
2110 tree ret;
2116 {
2119 }
2127 {
2131 }
2135 {
2138 }
2141 {
2145 }
2151 {
2153 "argument vector(s) and the mask vector should "
2156 }
2160 {
2164 }
2167 {
2168 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2174 else
2175 {
2178 }
2182 }
2190 }
2192 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2193 to integral type. */
2195 static tree
2197 {
2202 {
2203 /* C++0x scoped enumerations don't implicitly convert to integral
2204 type; if we stripped an explicit conversion to a larger type we
2205 need to replace it so common_type will still work. */
2209 }
2211 }
2213 /* This is a helper function of build_binary_op.
2215 For certain operations if both args were extended from the same
2216 smaller type, do the arithmetic in that type and then extend.
2218 BITWISE indicates a bitwise operation.
2219 For them, this optimization is safe only if
2220 both args are zero-extended or both are sign-extended.
2221 Otherwise, we might change the result.
2222 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2223 but calculated in (unsigned short) it would be (unsigned short)-1.
2224 */
2225 tree
2227 {
2231 tree type;
2233 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2234 excessive narrowing when we call get_narrower below. For
2235 example, suppose that OP0 is of unsigned int extended
2236 from signed char and that RESULT_TYPE is long long int.
2237 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2238 like
2240 (long long int) (unsigned int) signed_char
2242 which get_narrower would narrow down to
2244 (unsigned int) signed char
2246 If we do not cast OP0 first, get_narrower would return
2247 signed_char, which is inconsistent with the case of the
2248 explicit cast. */
2255 /* UNS is 1 if the operation to be done is an unsigned one. */
2258 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2259 but it *requires* conversion to FINAL_TYPE. */
2270 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2272 /* For bitwise operations, signedness of nominal type
2273 does not matter. Consider only how operands were extended. */
2277 /* Note that in all three cases below we refrain from optimizing
2278 an unsigned operation on sign-extended args.
2279 That would not be valid. */
2281 /* Both args variable: if both extended in same way
2282 from same width, do it in that width.
2283 Do it unsigned if args were zero-extended. */
2290 return c_common_signed_or_unsigned_type
2297 && (type
2308 && (type
2316 }
2318 /* Checks if expression EXPR of real/integer type cannot be converted
2319 to the real/integer type TYPE. Function returns true when:
2320 * EXPR is a constant which cannot be exactly converted to TYPE
2321 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2322 for EXPR type and TYPE being both integers or both real.
2323 * EXPR is not a constant of real type and TYPE is an integer.
2324 * EXPR is not a constant of integer type which cannot be
2325 exactly converted to real type.
2326 Function allows conversions between types of different signedness and
2327 does not return true in that case. Function can produce signedness
2328 warnings if PRODUCE_WARNS is true. */
2329 bool
2331 {
2337 {
2338 /* Warn for real constant that is not an exact integer converted
2339 to integer type. */
2342 {
2345 }
2346 /* Warn for an integer constant that does not fit into integer type. */
2350 {
2353 {
2357 }
2359 {
2363 }
2364 else
2366 }
2368 {
2369 /* Warn for an integer constant that does not fit into real type. */
2371 {
2375 }
2376 /* Warn for a real constant that does not fit into a smaller
2377 real type. */
2380 {
2384 }
2385 }
2386 }
2387 else
2388 {
2389 /* Warn for real types converted to integer types. */
2396 {
2397 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2401 /* Don't warn for short y; short x = ((int)y & 0xff); */
2405 {
2406 /* If both args were extended from a shortest type,
2407 use that type if that is safe. */
2414 {
2420 /* If one of the operands is a non-negative constant
2421 that fits in the target type, then the type of the
2422 other operand does not matter. */
2431 /* If constant is unsigned and fits in the target
2432 type, then the result will also fit. */
2434 && unsigned0
2437 && unsigned1
2440 }
2441 }
2442 /* Warn for integer types converted to smaller integer types. */
2446 /* When they are the same width but different signedness,
2447 then the value may change. */
2450 /* Even when converted to a bigger type, if the type is
2451 unsigned but expr is signed, then negative values
2452 will be changed. */
2458 }
2460 /* Warn for integer types converted to real types if and only if
2461 all the range of values of the integer type cannot be
2462 represented by the real type. */
2465 {
2469 /* Don't warn about char y = 0xff; float x = (int) y; */
2481 }
2483 /* Warn for real types converted to smaller real types. */
2488 }
2491 }
2493 /* Warns if the conversion of EXPR to TYPE may alter a value.
2494 This is a helper function for warnings_for_convert_and_check. */
2496 static void
2498 {
2506 {
2519 /* Conversion from boolean to a signed:1 bit-field (which only
2520 can hold the values 0 and -1) doesn't lose information - but
2521 it does change the value. */
2536 {
2537 /* In case of COND_EXPR, if both operands are constants or
2538 COND_EXPR, then we do not care about the type of COND_EXPR,
2539 only about the conversion of each operand. */
2547 {
2551 }
2552 /* Fall through. */
2553 }
2560 }
2561 }
2563 /* Produce warnings after a conversion. RESULT is the result of
2564 converting EXPR to TYPE. This is a helper function for
2565 convert_and_check and cp_convert_and_check. */
2567 void
2569 {
2576 {
2577 /* Do not diagnose overflow in a constant expression merely
2578 because a conversion overflowed. */
2583 {
2584 /* This detects cases like converting -129 or 256 to
2585 unsigned char. */
2589 else
2591 }
2595 /* No warning for converting 0x80000000 to int. */
2603 else
2605 }
2610 else
2612 }
2615 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2616 Invoke this function on every expression that is converted implicitly,
2617 i.e. because of language rules and not because of an explicit cast. */
2619 tree
2621 {
2622 tree result;
2623 tree expr_for_warning;
2625 /* Convert from a value with possible excess precision rather than
2626 via the semantic type, but do not warn about values not fitting
2627 exactly in the semantic type. */
2629 {
2635 }
2636 else
2650 }
2651 \f
2652 /* A node in a list that describes references to variables (EXPR), which are
2653 either read accesses if WRITER is zero, or write accesses, in which case
2654 WRITER is the parent of EXPR. */
2655 struct tlist
2656 {
2659 };
2661 /* Used to implement a cache the results of a call to verify_tree. We only
2662 use this for SAVE_EXPRs. */
2663 struct tlist_cache
2664 {
2668 tree expr;
2669 };
2671 /* Obstack to use when allocating tlist structures, and corresponding
2672 firstobj. */
2676 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2677 warnings. */
2679 /* SAVE_EXPRs need special treatment. We process them only once and then
2680 cache the results. */
2692 /* Create a new struct tlist and fill in its fields. */
2695 {
2702 }
2704 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2705 is nonnull, we ignore any node we find which has a writer equal to it. */
2707 static void
2709 {
2711 {
2718 }
2719 }
2721 /* Merge the nodes of ADD into TO. This merging process is done so that for
2722 each variable that already exists in TO, no new node is added; however if
2723 there is a write access recorded in ADD, and an occurrence on TO is only
2724 a read access, then the occurrence in TO will be modified to record the
2725 write. */
2727 static void
2729 {
2736 {
2743 {
2747 }
2749 {
2753 }
2755 }
2756 }
2758 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2759 references in list LIST conflict with it, excluding reads if ONLY writers
2760 is nonzero. */
2762 static void
2765 {
2768 /* Avoid duplicate warnings. */
2774 {
2778 {
2783 }
2785 }
2786 }
2788 /* Given a list LIST of references to variables, find whether any of these
2789 can cause conflicts due to missing sequence points. */
2791 static void
2793 {
2797 {
2800 }
2801 }
2803 /* Return nonzero if X is a tree that can be verified by the sequence point
2804 warnings. */
2805 static int
2807 {
2814 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2815 (lvalue_p) crash on TRY/CATCH. */
2822 /* No point to track non-const calls, they will never satisfy
2823 operand_equal_p. */
2831 }
2833 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2834 static bool
2836 {
2838 }
2840 /* Walk the tree X, and record accesses to variables. If X is written by the
2841 parent tree, WRITER is the parent.
2842 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2843 expression or its only operand forces a sequence point, then everything up
2844 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2845 in PNO_SP.
2846 Once we return, we will have emitted warnings if any subexpression before
2847 such a sequence point could be undefined. On a higher level, however, the
2848 sequence point may not be relevant, and we'll merge the two lists.
2850 Example: (b++, a) + b;
2851 The call that processes the COMPOUND_EXPR will store the increment of B
2852 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2853 processes the PLUS_EXPR will need to merge the two lists so that
2854 eventually, all accesses end up on the same list (and we'll warn about the
2855 unordered subexpressions b++ and b.
2857 A note on merging. If we modify the former example so that our expression
2858 becomes
2859 (b++, b) + a
2860 care must be taken not simply to add all three expressions into the final
2861 PNO_SP list. The function merge_tlist takes care of that by merging the
2862 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2863 way, so that no more than one access to B is recorded. */
2865 static void
2867 tree writer)
2868 {
2873 /* X may be NULL if it is the operand of an empty statement expression
2874 ({ }). */
2878 restart:
2886 {
2918 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2919 two first, to avoid warning for (a ? b++ : b++). */
2935 /* Expressions inside the LHS are not ordered wrt. the sequence points
2936 in the RHS. Example:
2937 *a = (a++, 2)
2938 Despite the fact that the modification of "a" is in the before_sp
2939 list (tmp_before), it conflicts with the use of "a" in the LHS.
2940 We can handle this by adding the contents of tmp_list3
2941 to those of tmp_before, and redoing the collision warnings for that
2942 list. */
2945 /* Exclude the LHS itself here; we first have to merge it into the
2946 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2947 didn't exclude the LHS, we'd get it twice, once as a read and once
2948 as a write. */
2959 /* We need to warn about conflicts among arguments and conflicts between
2960 args and the function address. Side effects of the function address,
2961 however, are not ordered by the sequence point of the call. */
2962 {
2963 call_expr_arg_iterator iter;
2964 tree arg;
2968 {
2973 }
2978 }
2981 /* Scan all the list, e.g. indices of multi dimensional array. */
2983 {
2989 }
2993 {
3000 {
3012 {
3016 }
3019 }
3023 }
3033 /* For other expressions, simply recurse on their operands.
3034 Manual tail recursion for unary expressions.
3035 Other non-expressions need not be processed. */
3037 {
3041 }
3043 {
3047 {
3052 }
3053 }
3055 }
3056 }
3058 /* Try to warn for undefined behavior in EXPR due to missing sequence
3059 points. */
3061 DEBUG_FUNCTION void
3063 {
3069 {
3072 }
3077 }
3078 \f
3079 /* Validate the expression after `case' and apply default promotions. */
3081 static tree
3083 {
3088 /* Promote char or short to int. */
3091 {
3094 }
3099 }
3100 \f
3101 /* See if the case values LOW and HIGH are in the range of the original
3102 type (i.e. before the default conversion to int) of the switch testing
3103 expression.
3104 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3105 the type before promoting it. CASE_LOW_P is a pointer to the lower
3106 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3107 if the case is not a case range.
3108 The caller has to make sure that we are not called with NULL for
3109 CASE_LOW_P (i.e. the default case).
3110 Returns true if the case label is in range of ORIG_TYPE (saturated or
3111 untouched) or false if the label is out of range. */
3113 static bool
3116 {
3121 /* If there was a problem with the original type, do nothing. */
3128 /* Case label is less than minimum for type. */
3131 {
3134 }
3136 /* Case value is greater than maximum for type. */
3139 {
3142 }
3144 /* Saturate lower case label value to minimum. */
3147 {
3151 }
3153 /* Saturate upper case label value to maximum. */
3156 {
3160 }
3168 }
3169 \f
3170 /* Return an integer type with BITS bits of precision,
3171 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3173 tree
3175 {
3214 }
3216 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3217 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3218 and saturating if SATP is nonzero, otherwise not saturating. */
3220 tree
3223 {
3227 else
3235 {
3237 "fixed-point types that have too many integral and "
3240 }
3243 }
3245 /* Used for communication between c_common_type_for_mode and
3246 c_register_builtin_type. */
3249 /* Return a data type that has machine mode MODE.
3250 If the mode is an integer,
3251 then UNSIGNEDP selects between signed and unsigned types.
3252 If the mode is a fixed-point mode,
3253 then UNSIGNEDP selects between saturating and nonsaturating types. */
3255 tree
3257 {
3258 tree t;
3295 #if HOST_BITS_PER_WIDE_INT >= 64
3298 #endif
3323 {
3325 tree inner_type;
3341 }
3343 {
3348 }
3358 {
3444 }
3452 }
3454 tree
3456 {
3458 }
3460 /* Return a signed type the same as TYPE in other respects. */
3462 tree
3464 {
3466 }
3468 /* Return a type the same as TYPE except unsigned or
3469 signed according to UNSIGNEDP. */
3471 tree
3473 {
3474 tree type1;
3476 /* This block of code emulates the behavior of the old
3477 c_common_unsigned_type. In particular, it returns
3478 long_unsigned_type_node if passed a long, even when a int would
3479 have the same size. This is necessary for warnings to work
3480 correctly in archs where sizeof(int) == sizeof(long) */
3483 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3499 #if HOST_BITS_PER_WIDE_INT >= 64
3502 #endif
3512 #define C_COMMON_FIXED_TYPES(NAME) \
3513 if (type1 == short_ ## NAME ## _type_node \
3514 || type1 == unsigned_short_ ## NAME ## _type_node) \
3515 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3516 : short_ ## NAME ## _type_node; \
3517 if (type1 == NAME ## _type_node \
3518 || type1 == unsigned_ ## NAME ## _type_node) \
3519 return unsignedp ? unsigned_ ## NAME ## _type_node \
3520 : NAME ## _type_node; \
3521 if (type1 == long_ ## NAME ## _type_node \
3522 || type1 == unsigned_long_ ## NAME ## _type_node) \
3523 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3524 : long_ ## NAME ## _type_node; \
3525 if (type1 == long_long_ ## NAME ## _type_node \
3526 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3527 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3528 : long_long_ ## NAME ## _type_node;
3530 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3531 if (type1 == NAME ## _type_node \
3532 || type1 == u ## NAME ## _type_node) \
3533 return unsignedp ? u ## NAME ## _type_node \
3534 : NAME ## _type_node;
3536 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3537 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3538 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3539 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3540 : sat_ ## short_ ## NAME ## _type_node; \
3541 if (type1 == sat_ ## NAME ## _type_node \
3542 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3543 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3544 : sat_ ## NAME ## _type_node; \
3545 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3546 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3547 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3548 : sat_ ## long_ ## NAME ## _type_node; \
3549 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3550 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3551 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3552 : sat_ ## long_long_ ## NAME ## _type_node;
3554 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3555 if (type1 == sat_ ## NAME ## _type_node \
3556 || type1 == sat_ ## u ## NAME ## _type_node) \
3557 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3558 : sat_ ## NAME ## _type_node;
3584 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3585 the precision; they have precision set to match their range, but
3586 may use a wider mode to match an ABI. If we change modes, we may
3587 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3588 the precision as well, so as to yield correct results for
3589 bit-field types. C++ does not have these separate bit-field
3590 types, and producing a signed or unsigned variant of an
3591 ENUMERAL_TYPE may cause other problems as well. */
3597 #define TYPE_OK(node) \
3598 (TYPE_MODE (type) == TYPE_MODE (node) \
3599 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3618 #if HOST_BITS_PER_WIDE_INT >= 64
3621 #endif
3630 #undef TYPE_OK
3633 }
3635 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3637 tree
3639 {
3640 /* Extended integer types of the same width as a standard type have
3641 lesser rank, so those of the same width as int promote to int or
3642 unsigned int and are valid for printf formats expecting int or
3643 unsigned int. To avoid such special cases, avoid creating
3644 extended integer types for bit-fields if a standard integer type
3645 is available. */
3662 }
3664 /* The C version of the register_builtin_type langhook. */
3666 void
3668 {
3669 tree decl;
3679 }
3680 \f
3681 /* Print an error message for invalid operands to arith operation
3682 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3683 LOCATION is the location of the message. */
3685 void
3688 {
3692 {
3737 }
3741 }
3742 \f
3743 /* Given an expression as a tree, return its original type. Do this
3744 by stripping any conversion that preserves the sign and precision. */
3745 static tree
3747 {
3750 }
3752 /* Subroutine of build_binary_op, used for comparison operations.
3753 See if the operands have both been converted from subword integer types
3754 and, if so, perhaps change them both back to their original type.
3755 This function is also responsible for converting the two operands
3756 to the proper common type for comparison.
3758 The arguments of this function are all pointers to local variables
3759 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3760 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3762 If this function returns nonzero, it means that the comparison has
3763 a constant value. What this function returns is an expression for
3764 that value. */
3766 tree
3769 {
3770 tree type;
3779 /* Throw away any conversions to wider types
3780 already present in the operands. */
3785 /* If primopN is first sign-extended from primopN's precision to opN's
3786 precision, then zero-extended from opN's precision to
3787 *restype_ptr precision, shortenings might be invalid. */
3790 && !unsignedp0
3795 && !unsignedp1
3799 /* Handle the case that OP0 does not *contain* a conversion
3800 but it *requires* conversion to FINAL_TYPE. */
3807 /* If one of the operands must be floated, we cannot optimize. */
3811 /* If first arg is constant, swap the args (changing operation
3812 so value is preserved), for canonicalization. Don't do this if
3813 the second arg is 0. */
3818 {
3835 {
3850 }
3852 }
3854 /* If comparing an integer against a constant more bits wide,
3855 maybe we can deduce a value of 1 or 0 independent of the data.
3856 Or else truncate the constant now
3857 rather than extend the variable at run time.
3859 This is only interesting if the constant is the wider arg.
3860 Also, it is not safe if the constant is unsigned and the
3861 variable arg is signed, since in this case the variable
3862 would be sign-extended and then regarded as unsigned.
3863 Our technique fails in this case because the lowest/highest
3864 possible unsigned results don't follow naturally from the
3865 lowest/highest possible values of the variable operand.
3866 For just EQ_EXPR and NE_EXPR there is another technique that
3867 could be used: see if the constant can be faithfully represented
3868 in the other operand's type, by truncating it and reextending it
3869 and see if that preserves the constant's value. */
3875 {
3878 /* 1 if comparison is nominally unsigned. */
3880 tree val;
3892 {
3893 /* Convert primop1 to target type, but do not introduce
3894 additional overflow. We know primop1 is an int_cst. */
3898 }
3900 {
3903 }
3906 {
3911 }
3912 else
3913 {
3918 }
3921 /* This used to be a switch, but Genix compiler can't handle that. */
3923 {
3926 }
3928 {
3931 }
3933 {
3938 }
3940 {
3945 }
3947 {
3952 }
3954 {
3959 }
3961 /* If primop0 was sign-extended and unsigned comparison specd,
3962 we did a signed comparison above using the signed type bounds.
3963 But the comparison we output must be unsigned.
3965 Also, for inequalities, VAL is no good; but if the signed
3966 comparison had *any* fixed result, it follows that the
3967 unsigned comparison just tests the sign in reverse
3968 (positive values are LE, negative ones GE).
3969 So we can generate an unsigned comparison
3970 against an extreme value of the signed type. */
3973 {
3976 {
3991 }
3993 }
3997 {
4004 }
4007 {
4008 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4012 }
4014 /* Value is not predetermined, but do the comparison
4015 in the type of the operand that is not constant.
4016 TYPE is already properly set. */
4017 }
4019 /* If either arg is decimal float and the other is float, find the
4020 proper common type to use for comparison. */
4031 /* If args' natural types are both narrower than nominal type
4032 and both extend in the same manner, compare them
4033 in the type of the wider arg.
4034 Otherwise must actually extend both to the nominal
4035 common type lest different ways of extending
4036 alter the result.
4037 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4042 {
4046 type);
4047 /* Make sure shorter operand is extended the right way
4048 to match the longer operand. */
4049 primop0
4052 primop0);
4053 primop1
4056 primop1);
4057 }
4058 else
4059 {
4060 /* Here we must do the comparison on the nominal type
4061 using the args exactly as we received them. */
4068 {
4070 /* All unsigned values are >= 0, so we warn. However,
4071 if OP0 is a constant that is >= 0, the signedness of
4072 the comparison isn't an issue, so suppress the
4073 warning. */
4075 warn_type_limits && !in_system_header
4079 primop0)))
4080 /* Do not warn for enumeration types. */
4084 {
4101 }
4104 {
4105 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4110 }
4111 }
4112 }
4120 }
4121 \f
4122 /* Return a tree for the sum or difference (RESULTCODE says which)
4123 of pointer PTROP and integer INTOP. */
4125 tree
4128 {
4131 /* The result is a pointer of the same type that is being added. */
4135 {
4139 }
4141 {
4145 }
4147 {
4151 }
4152 else
4155 /* We are manipulating pointer values, so we don't need to warn
4156 about relying on undefined signed overflow. We disable the
4157 warning here because we use integer types so fold won't know that
4158 they are really pointers. */
4161 /* If what we are about to multiply by the size of the elements
4162 contains a constant term, apply distributive law
4163 and multiply that constant term separately.
4164 This helps produce common subexpressions. */
4169 /* If the constant comes from pointer subtraction,
4170 skip this optimization--it would cause an error. */
4172 /* If the constant is unsigned, and smaller than the pointer size,
4173 then we must skip this optimization. This is because it could cause
4174 an overflow error if the constant is negative but INTOP is not. */
4178 {
4183 /* Convert both subexpression types to the type of intop,
4184 because weird cases involving pointer arithmetic
4185 can result in a sum or difference with different type args. */
4190 }
4192 /* Convert the integer argument to a type the same size as sizetype
4193 so the multiply won't overflow spuriously. */
4199 /* Replace the integer argument with a suitable product by the object size.
4200 Do this multiplication as signed, then convert to the appropriate type
4201 for the pointer operation and disregard an overflow that occurred only
4202 because of the sign-extension change in the latter conversion. */
4203 {
4211 }
4213 /* Create the sum or difference. */
4222 }
4223 \f
4224 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4225 and if NON_CONST is known not to be permitted in an evaluated part
4226 of a constant expression. */
4228 tree
4230 {
4234 /* This should never be called for C++. */
4238 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4247 }
4249 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4250 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4251 around the SAVE_EXPR if needed so that c_fully_fold does not need
4252 to look inside SAVE_EXPRs. */
4254 tree
4256 {
4265 }
4267 /* Return whether EXPR is a declaration whose address can never be
4268 NULL. */
4270 bool
4272 {
4277 }
4279 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4280 or for an `if' or `while' statement or ?..: exp. It should already
4281 have been validated to be of suitable type; otherwise, a bad
4282 diagnostic may result.
4284 The EXPR is located at LOCATION.
4286 This preparation consists of taking the ordinary
4287 representation of an expression expr and producing a valid tree
4288 boolean expression describing whether expr is nonzero. We could
4289 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4290 but we optimize comparisons, &&, ||, and !.
4292 The resulting type should always be `truthvalue_type_node'. */
4294 tree
4296 {
4298 {
4340 ? truthvalue_true_node
4346 ? truthvalue_true_node
4351 /* Fall through. */
4354 {
4357 {
4358 /* Common Ada/Pascal programmer's mistake. */
4360 OPT_Waddress,
4362 inner);
4364 }
4366 }
4383 /* These don't change whether an object is nonzero or zero. */
4388 /* These don't change whether an object is zero or nonzero, but
4389 we can't ignore them if their second arg has side-effects. */
4391 {
4394 c_common_truthvalue_conversion
4397 }
4398 else
4403 /* Distribute the conversion into the arms of a COND_EXPR. */
4405 {
4408 /* In C++ one of the arms might have void type if it is throw. */
4416 }
4417 else
4418 {
4419 /* Folding will happen later for C. */
4427 }
4429 CASE_CONVERT:
4430 {
4434 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4435 since that affects how `default_conversion' will behave. */
4439 /* Don't strip a conversion from C++0x scoped enum, since they
4440 don't implicitly convert to other types. */
4444 /* If this isn't narrowing the argument, we can ignore it. */
4448 }
4454 {
4458 }
4463 }
4466 {
4468 expr = (build_binary_op
4472 c_common_truthvalue_conversion
4475 c_common_truthvalue_conversion
4480 }
4483 {
4488 }
4489 else
4492 ret:
4495 }
4496 \f
4505 /* Apply the TYPE_QUALS to the new DECL. */
4507 void
4509 {
4517 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4518 constructor can produce constant init, so rely on cp_finish_decl to
4519 clear TREE_READONLY if the variable has non-constant init. */
4522 {
4525 }
4527 {
4529 /* Allow 'restrict' on arrays of pointers.
4530 FIXME currently we just ignore it. */
4536 }
4537 }
4539 /* Hash function for the problem of multiple type definitions in
4540 different files. This must hash all types that will compare
4541 equal via comptypes to the same value. In practice it hashes
4542 on some of the simple stuff and leaves the details to comptypes. */
4544 static hashval_t
4546 {
4550 tree t2;
4552 {
4553 /* For pointers, hash on pointee type plus some swizzling. */
4556 /* Hash on number of elements and total size. */
4575 }
4576 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4577 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4579 /* We might have a VLA here. */
4582 else
4585 }
4589 /* Return the typed-based alias set for T, which may be an expression
4590 or a type. Return -1 if we don't do anything special. */
4592 alias_set_type
4594 {
4595 tree u;
4598 /* For VLAs, use the alias set of the element type rather than the
4599 default of alias set 0 for types compared structurally. */
4601 {
4605 }
4607 /* Permit type-punning when accessing a union, provided the access
4608 is directly through the union. For example, this code does not
4609 permit taking the address of a union member and then storing
4610 through it. Even the type-punning allowed here is a GCC
4611 extension, albeit a common and useful one; the C standard says
4612 that such accesses have implementation-defined behavior. */
4620 /* That's all the expressions we handle specially. */
4624 /* The C standard guarantees that any object may be accessed via an
4625 lvalue that has character type. */
4631 /* The C standard specifically allows aliasing between signed and
4632 unsigned variants of the same type. We treat the signed
4633 variant as canonical. */
4635 {
4638 /* t1 == t can happen for boolean nodes which are always unsigned. */
4641 }
4643 /* Handle the case of multiple type nodes referring to "the same" type,
4644 which occurs with IMA. These share an alias set. FIXME: Currently only
4645 C90 is handled. (In C99 type compatibility is not transitive, which
4646 complicates things mightily. The alias set splay trees can theoretically
4647 represent this, but insertion is tricky when you consider all the
4648 different orders things might arrive in.) */
4653 /* Save time if there's only one input file. */
4657 /* Pointers need special handling if they point to any type that
4658 needs special handling (below). */
4660 {
4661 tree t2;
4662 /* Find bottom type under any nested POINTERs. */
4666 ;
4674 }
4675 /* These are the only cases that need special handling. */
4682 /* Undefined? */
4686 /* Look up t in hash table. Only one of the compatible types within each
4687 alias set is recorded in the table. */
4691 NULL);
4694 {
4697 }
4698 else
4699 /* Our caller will assign and record (in t) a new alias set; all we need
4700 to do is remember t in the hash table. */
4704 }
4705 \f
4706 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4707 the second parameter indicates which OPERATOR is being applied.
4708 The COMPLAIN flag controls whether we should diagnose possibly
4709 ill-formed constructs or not. LOC is the location of the SIZEOF or
4710 TYPEOF operator. */
4712 tree
4715 {
4723 {
4725 {
4732 }
4733 else
4734 {
4736 {
4740 else
4743 }
4745 }
4746 }
4748 {
4756 }
4759 {
4764 }
4767 {
4772 }
4773 else
4774 {
4776 /* Convert in case a char is more than one unit. */
4780 else
4782 }
4784 /* VALUE will have the middle-end integer type sizetype.
4785 However, we should really return a value of type `size_t',
4786 which is just a typedef for an ordinary integer type. */
4790 }
4792 /* Implement the __alignof keyword: Return the minimum required
4793 alignment of EXPR, measured in bytes. For VAR_DECLs,
4794 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4795 from an "aligned" __attribute__ specification). LOC is the
4796 location of the ALIGNOF operator. */
4798 tree
4800 {
4801 tree t;
4808 {
4811 }
4817 {
4824 {
4831 }
4833 }
4834 else
4838 }
4839 \f
4840 /* Handle C and C++ default attributes. */
4842 enum built_in_attribute
4843 {
4844 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4845 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4846 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4847 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4848 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4850 #undef DEF_ATTR_NULL_TREE
4851 #undef DEF_ATTR_INT
4852 #undef DEF_ATTR_STRING
4853 #undef DEF_ATTR_IDENT
4854 #undef DEF_ATTR_TREE_LIST
4855 ATTR_LAST
4856 };
4862 enum c_builtin_type
4863 {
4864 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4865 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4866 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4867 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4868 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4869 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4870 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4871 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4872 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4873 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4874 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4875 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4876 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4877 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4878 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4879 NAME,
4880 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4882 #undef DEF_PRIMITIVE_TYPE
4883 #undef DEF_FUNCTION_TYPE_0
4884 #undef DEF_FUNCTION_TYPE_1
4885 #undef DEF_FUNCTION_TYPE_2
4886 #undef DEF_FUNCTION_TYPE_3
4887 #undef DEF_FUNCTION_TYPE_4
4888 #undef DEF_FUNCTION_TYPE_5
4889 #undef DEF_FUNCTION_TYPE_6
4890 #undef DEF_FUNCTION_TYPE_7
4891 #undef DEF_FUNCTION_TYPE_VAR_0
4892 #undef DEF_FUNCTION_TYPE_VAR_1
4893 #undef DEF_FUNCTION_TYPE_VAR_2
4894 #undef DEF_FUNCTION_TYPE_VAR_3
4895 #undef DEF_FUNCTION_TYPE_VAR_4
4896 #undef DEF_FUNCTION_TYPE_VAR_5
4897 #undef DEF_POINTER_TYPE
4898 BT_LAST
4899 };
4903 /* A temporary array for c_common_nodes_and_builtins. Used in
4904 communication with def_fn_type. */
4907 /* A helper function for c_common_nodes_and_builtins. Build function type
4908 for DEF with return type RET and N arguments. If VAR is true, then the
4909 function should be variadic after those N arguments.
4911 Takes special care not to ICE if any of the types involved are
4912 error_mark_node, which indicates that said type is not in fact available
4913 (see builtin_type_for_size). In which case the function type as a whole
4914 should be error_mark_node. */
4916 static void
4918 {
4919 tree t;
4926 {
4932 }
4939 else
4942 egress:
4945 }
4947 /* Build builtin functions common to both C and C++ language
4948 frontends. */
4950 static void
4952 {
4953 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4954 builtin_types[ENUM] = VALUE;
4955 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4956 def_fn_type (ENUM, RETURN, 0, 0);
4957 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4958 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4959 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4960 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4961 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4962 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4963 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4964 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4965 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4966 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4967 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4968 ARG6) \
4969 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4970 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4971 ARG6, ARG7) \
4972 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4973 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4974 def_fn_type (ENUM, RETURN, 1, 0);
4975 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4976 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4977 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4978 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4979 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4980 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4981 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4982 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4983 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4984 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4985 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4986 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4990 #undef DEF_PRIMITIVE_TYPE
4991 #undef DEF_FUNCTION_TYPE_1
4992 #undef DEF_FUNCTION_TYPE_2
4993 #undef DEF_FUNCTION_TYPE_3
4994 #undef DEF_FUNCTION_TYPE_4
4995 #undef DEF_FUNCTION_TYPE_5
4996 #undef DEF_FUNCTION_TYPE_6
4997 #undef DEF_FUNCTION_TYPE_VAR_0
4998 #undef DEF_FUNCTION_TYPE_VAR_1
4999 #undef DEF_FUNCTION_TYPE_VAR_2
5000 #undef DEF_FUNCTION_TYPE_VAR_3
5001 #undef DEF_FUNCTION_TYPE_VAR_4
5002 #undef DEF_FUNCTION_TYPE_VAR_5
5003 #undef DEF_POINTER_TYPE
5008 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5009 NONANSI_P, ATTRS, IMPLICIT, COND) \
5010 if (NAME && COND) \
5011 def_builtin_1 (ENUM, NAME, CLASS, \
5012 builtin_types[(int) TYPE], \
5013 builtin_types[(int) LIBTYPE], \
5014 BOTH_P, FALLBACK_P, NONANSI_P, \
5015 built_in_attributes[(int) ATTRS], IMPLICIT);
5017 #undef DEF_BUILTIN
5025 }
5027 /* Like get_identifier, but avoid warnings about null arguments when
5028 the argument may be NULL for targets where GCC lacks stdint.h type
5029 information. */
5033 {
5035 }
5037 /* Build tree nodes and builtin functions common to both C and C++ language
5038 frontends. */
5040 void
5042 {
5046 tree array_domain_type;
5047 tree va_list_ref_type_node;
5048 tree va_list_arg_type_node;
5052 /* Define `int' and `char' first so that dbx will output them first. */
5056 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5057 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5058 but not C. Are the conditionals here needed? */
5064 long_unsigned_type_node);
5066 {
5068 int128_integer_type_node);
5070 int128_unsigned_type_node);
5071 }
5075 long_long_integer_type_node);
5077 long_long_unsigned_type_node);
5080 long_long_unsigned_type_node);
5083 short_unsigned_type_node);
5086 short_unsigned_type_node);
5088 /* Define both `signed char' and `unsigned char'. */
5092 /* These are types that c_common_type_for_size and
5093 c_common_type_for_mode use. */
5096 intQI_type_node));
5099 intHI_type_node));
5102 intSI_type_node));
5105 intDI_type_node));
5106 #if HOST_BITS_PER_WIDE_INT >= 64
5109 TYPE_DECL,
5111 intTI_type_node));
5112 #endif
5115 unsigned_intQI_type_node));
5118 unsigned_intHI_type_node));
5121 unsigned_intSI_type_node));
5124 unsigned_intDI_type_node));
5125 #if HOST_BITS_PER_WIDE_INT >= 64
5128 TYPE_DECL,
5130 unsigned_intTI_type_node));
5131 #endif
5133 /* Create the widest literal types. */
5134 widest_integer_literal_type_node
5138 widest_integer_literal_type_node));
5140 widest_unsigned_literal_type_node
5144 widest_unsigned_literal_type_node));
5148 pid_type_node =
5155 /* Only supported decimal floating point extension if the target
5156 actually supports underlying modes. */
5160 {
5164 }
5167 {
5172 long_long_fract_type_node);
5174 unsigned_short_fract_type_node);
5176 unsigned_fract_type_node);
5178 unsigned_long_fract_type_node);
5180 unsigned_long_long_fract_type_node);
5182 sat_short_fract_type_node);
5185 sat_long_fract_type_node);
5187 sat_long_long_fract_type_node);
5189 sat_unsigned_short_fract_type_node);
5191 sat_unsigned_fract_type_node);
5193 sat_unsigned_long_fract_type_node);
5195 sat_unsigned_long_long_fract_type_node);
5200 long_long_accum_type_node);
5202 unsigned_short_accum_type_node);
5204 unsigned_accum_type_node);
5206 unsigned_long_accum_type_node);
5208 unsigned_long_long_accum_type_node);
5210 sat_short_accum_type_node);
5213 sat_long_accum_type_node);
5215 sat_long_long_accum_type_node);
5217 sat_unsigned_short_accum_type_node);
5219 sat_unsigned_accum_type_node);
5221 sat_unsigned_long_accum_type_node);
5223 sat_unsigned_long_long_accum_type_node);
5225 }
5228 TYPE_DECL,
5230 complex_integer_type_node));
5232 TYPE_DECL,
5234 complex_float_type_node));
5236 TYPE_DECL,
5238 complex_double_type_node));
5242 complex_long_double_type_node));
5245 /* For C++, make fileptr_type_node a distinct void * type until
5246 FILE type is defined. */
5251 /* Set the TYPE_NAME for any variants that were built before
5252 record_builtin_type gave names to the built-in types. */
5253 {
5259 }
5261 /* This node must not be shared. */
5267 /* Make a type to be the domain of a few array types
5268 whose domains don't really matter.
5269 200 is small enough that it always fits in size_t
5270 and large enough that it can hold most function names for the
5271 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5274 /* Make a type for arrays of characters.
5275 With luck nothing will ever really depend on the length of this
5276 array type. */
5277 char_array_type_node
5280 /* Likewise for arrays of ints. */
5281 int_array_type_node
5285 const_string_type_node
5289 /* This is special for C++ so functions can be overloaded. */
5295 {
5298 else
5301 }
5303 /* This is for wide string constants. */
5304 wchar_array_type_node
5307 /* Define 'char16_t'. */
5312 {
5317 }
5319 /* This is for UTF-16 string constants. */
5320 char16_array_type_node
5323 /* Define 'char32_t'. */
5328 {
5333 }
5335 /* This is for UTF-32 string constants. */
5336 char32_array_type_node
5339 wint_type_node =
5342 intmax_type_node =
5344 uintmax_type_node =
5348 sig_atomic_type_node =
5351 int8_type_node =
5354 int16_type_node =
5357 int32_type_node =
5360 int64_type_node =
5363 uint8_type_node =
5366 c_uint16_type_node =
5369 c_uint32_type_node =
5372 c_uint64_type_node =
5375 int_least8_type_node =
5378 int_least16_type_node =
5381 int_least32_type_node =
5384 int_least64_type_node =
5387 uint_least8_type_node =
5390 uint_least16_type_node =
5393 uint_least32_type_node =
5396 uint_least64_type_node =
5399 int_fast8_type_node =
5402 int_fast16_type_node =
5405 int_fast32_type_node =
5408 int_fast64_type_node =
5411 uint_fast8_type_node =
5414 uint_fast16_type_node =
5417 uint_fast32_type_node =
5420 uint_fast64_type_node =
5423 intptr_type_node =
5426 uintptr_type_node =
5429 default_function_type
5431 ptrdiff_type_node
5438 va_list_type_node));
5440 {
5443 tree ptype;
5446 {
5450 ptype));
5452 }
5453 }
5456 {
5459 }
5460 else
5461 {
5464 }
5471 /* Create the built-in __null node. It is important that this is
5472 not shared. */
5476 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5478 }
5480 /* The number of named compound-literals generated thus far. */
5483 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5485 void
5487 {
5490 compound_literal_number);
5491 compound_literal_number++;
5493 }
5495 tree
5497 {
5501 }
5504 /* Linked list of disabled built-in functions. */
5507 {
5515 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5516 begins with "__builtin_", give an error. */
5518 void
5520 {
5523 else
5524 {
5529 }
5530 }
5533 /* Return true if the built-in function NAME has been disabled, false
5534 otherwise. */
5536 static bool
5538 {
5541 {
5544 }
5546 }
5549 /* Worker for DEF_BUILTIN.
5550 Possibly define a builtin function with one or two names.
5551 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5552 nonansi_p and flag_no_nonansi_builtin. */
5554 static void
5561 {
5562 tree decl;
5575 fnattrs);
5584 }
5585 \f
5586 /* Nonzero if the type T promotes to int. This is (nearly) the
5587 integral promotions defined in ISO C99 6.3.1.1/2. */
5589 bool
5591 {
5593 {
5603 /* ??? Technically all enumerations not larger than an int
5604 promote to an int. But this is used along code paths
5605 that only want to notice a size change. */
5613 }
5614 }
5616 /* Return 1 if PARMS specifies a fixed number of parameters
5617 and none of their types is affected by default promotions. */
5619 int
5621 {
5622 const_tree t;
5624 {
5641 }
5643 }
5645 /* Recursively remove any '*' or '&' operator from TYPE. */
5646 tree
5648 {
5652 }
5654 /* Recursively remove pointer or array type from TYPE. */
5655 tree
5657 {
5661 }
5663 /* Used to compare case labels. K1 and K2 are actually tree nodes
5664 representing case labels, or NULL_TREE for a `default' label.
5665 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5666 K2, and 0 if K1 and K2 are equal. */
5668 int
5670 {
5671 /* Consider a NULL key (such as arises with a `default' label) to be
5672 smaller than anything else. */
5679 }
5681 /* Process a case label, located at LOC, for the range LOW_VALUE
5682 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5683 then this case label is actually a `default' label. If only
5684 HIGH_VALUE is NULL_TREE, then case label was declared using the
5685 usual C/C++ syntax, rather than the GNU case range extension.
5686 CASES is a tree containing all the case ranges processed so far;
5687 COND is the condition for the switch-statement itself. Returns the
5688 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5689 is created. */
5691 tree
5694 {
5695 tree type;
5696 tree label;
5697 tree case_label;
5698 splay_tree_node node;
5700 /* Create the LABEL_DECL itself. */
5703 /* If there was an error processing the switch condition, bail now
5704 before we get more confused. */
5712 {
5715 }
5717 /* Case ranges are a GNU extension. */
5724 {
5729 }
5731 {
5736 }
5739 {
5740 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5741 really a case range, even though it was written that way.
5742 Remove the HIGH_VALUE to simplify later processing. */
5747 }
5749 /* See if the case is in range of the type of the original testing
5750 expression. If both low_value and high_value are out of range,
5751 don't insert the case label and return NULL_TREE. */
5757 /* Look up the LOW_VALUE in the table of case labels we already
5758 have. */
5760 /* If there was not an exact match, check for overlapping ranges.
5761 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5762 that's a `default' label and the only overlap is an exact match. */
5764 {
5765 splay_tree_node low_bound;
5766 splay_tree_node high_bound;
5768 /* Even though there wasn't an exact match, there might be an
5769 overlap between this case range and another case range.
5770 Since we've (inductively) not allowed any overlapping case
5771 ranges, we simply need to find the greatest low case label
5772 that is smaller that LOW_VALUE, and the smallest low case
5773 label that is greater than LOW_VALUE. If there is an overlap
5774 it will occur in one of these two ranges. */
5780 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5781 the LOW_VALUE, so there is no need to check unless the
5782 LOW_BOUND is in fact itself a case range. */
5788 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5789 range is bigger than the low end of the current range, so we
5790 are only interested if the current range is a real range, and
5791 not an ordinary case label. */
5793 && high_value
5795 high_value)
5798 }
5799 /* If there was an overlap, issue an error. */
5801 {
5805 {
5809 }
5811 {
5814 }
5815 else
5816 {
5820 }
5822 }
5824 /* Add a CASE_LABEL to the statement-tree. */
5826 /* Register this case label in the splay tree. */
5833 error_out:
5834 /* Add a label so that the back-end doesn't think that the beginning of
5835 the switch is unreachable. Note that we do not add a case label, as
5836 that just leads to duplicates and thence to failure later on. */
5838 {
5841 }
5843 }
5845 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5846 Used to verify that case values match up with enumerator values. */
5848 static void
5850 {
5853 /* ??? Not working too hard to print the double-word value.
5854 Should perhaps be done with %lwd in the diagnostic routines? */
5863 else
5872 buf);
5873 else
5878 }
5880 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5881 Used to verify that case values match up with enumerator values. */
5883 static int
5885 {
5889 /* Skip default case. */
5893 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5894 when we did our enum->case scan. Reset our scratch bit after. */
5897 else
5900 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5901 not set, that means that CASE_HIGH did not appear when we did our
5902 enum->case scan. Reset our scratch bit after. */
5904 {
5907 else
5909 }
5912 }
5914 /* Handle -Wswitch*. Called from the front end after parsing the
5915 switch construct. */
5916 /* ??? Should probably be somewhere generic, since other languages
5917 besides C and C++ would want this. At the moment, however, C/C++
5918 are the only tree-ssa languages that support enumerations at all,
5919 so the point is moot. */
5921 void
5924 {
5925 splay_tree_node default_node;
5926 splay_tree_node node;
5927 tree chain;
5937 /* From here on, we only care about about enumerated types. */
5941 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5945 /* Check the cases. Warn about case values which are not members of
5946 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5947 there is no default case, check that exactly all enumeration
5948 literals are covered by the cases. */
5950 /* Clearing COND if it is not an integer constant simplifies
5951 the tests inside the loop below. */
5955 /* The time complexity here is O(N*lg(N)) worst case, but for the
5956 common case of monotonically increasing enumerators, it is
5957 O(N), since the nature of the splay tree will keep the next
5958 element adjacent to the root at all times. */
5961 {
5967 {
5968 /* Mark the CASE_LOW part of the case entry as seen. */
5972 }
5974 /* Even though there wasn't an exact match, there might be a
5975 case range which includes the enumerator's value. */
5978 {
5982 {
5983 /* If we match the upper bound exactly, mark the CASE_HIGH
5984 part of the case entry as seen. */
5988 }
5989 }
5991 /* We've now determined that this enumerated literal isn't
5992 handled by the case labels of the switch statement. */
5994 /* If the switch expression is a constant, we only really care
5995 about whether that constant is handled by the switch. */
5999 /* If there is a default_node, the only relevant option is
6000 Wswitch-enum. Otherwise, if both are enabled then we prefer
6001 to warn using -Wswitch because -Wswitch is enabled by -Wall
6002 while -Wswitch-enum is explicit. */
6005 ? OPT_Wswitch_enum
6009 }
6011 /* Warn if there are case expressions that don't correspond to
6012 enumerators. This can occur since C and C++ don't enforce
6013 type-checking of assignments to enumeration variables.
6015 The time complexity here is now always O(N) worst case, since
6016 we should have marked both the lower bound and upper bound of
6017 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6018 above. This scan also resets those fields. */
6021 }
6023 /* Finish an expression taking the address of LABEL (an
6024 IDENTIFIER_NODE). Returns an expression for the address.
6026 LOC is the location for the expression returned. */
6028 tree
6030 {
6031 tree result;
6041 else
6042 {
6045 /* The current function is not necessarily uninlinable.
6046 Computed gotos are incompatible with inlining, but the value
6047 here could be used only in a diagnostic, for example. */
6049 }
6052 }
6053 \f
6055 /* Given a boolean expression ARG, return a tree representing an increment
6056 or decrement (as indicated by CODE) of ARG. The front end must check for
6057 invalid cases (e.g., decrement in C++). */
6058 tree
6060 {
6061 tree val;
6066 {
6089 }
6092 }
6093 \f
6094 /* Built-in macros for stddef.h and stdint.h, that require macros
6095 defined in this file. */
6096 void
6098 {
6161 }
6163 static void
6165 {
6166 /* Fill in the built_in_attributes array. */
6167 #define DEF_ATTR_NULL_TREE(ENUM) \
6168 built_in_attributes[(int) ENUM] = NULL_TREE;
6169 #define DEF_ATTR_INT(ENUM, VALUE) \
6170 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6171 #define DEF_ATTR_STRING(ENUM, VALUE) \
6172 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6173 #define DEF_ATTR_IDENT(ENUM, STRING) \
6174 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6175 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6176 built_in_attributes[(int) ENUM] \
6177 = tree_cons (built_in_attributes[(int) PURPOSE], \
6178 built_in_attributes[(int) VALUE], \
6179 built_in_attributes[(int) CHAIN]);
6181 #undef DEF_ATTR_NULL_TREE
6182 #undef DEF_ATTR_INT
6183 #undef DEF_ATTR_IDENT
6184 #undef DEF_ATTR_TREE_LIST
6185 }
6187 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6188 identifier as an argument, so the front end shouldn't look it up. */
6190 bool
6192 {
6195 /* Unknown attribute that we'll end up ignoring, return true so we
6196 don't complain about an identifier argument. */
6202 else
6204 }
6206 /* Attribute handlers common to C front ends. */
6208 /* Handle a "packed" attribute; arguments as in
6209 struct attribute_spec.handler. */
6211 static tree
6214 {
6216 {
6220 }
6222 {
6224 /* Still pack bitfields. */
6229 else
6231 }
6232 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6233 used for DECL_REGISTER. It wouldn't mean anything anyway.
6234 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6235 that changes what the typedef is typing. */
6236 else
6237 {
6240 }
6243 }
6245 /* Handle a "nocommon" attribute; arguments as in
6246 struct attribute_spec.handler. */
6248 static tree
6252 {
6255 else
6256 {
6259 }
6262 }
6264 /* Handle a "common" attribute; arguments as in
6265 struct attribute_spec.handler. */
6267 static tree
6270 {
6273 else
6274 {
6277 }
6280 }
6282 /* Handle a "noreturn" attribute; arguments as in
6283 struct attribute_spec.handler. */
6285 static tree
6288 {
6291 /* See FIXME comment in c_common_attribute_table. */
6298 = build_pointer_type
6301 else
6302 {
6305 }
6308 }
6310 /* Handle a "hot" and attribute; arguments as in
6311 struct attribute_spec.handler. */
6313 static tree
6316 {
6319 {
6321 {
6325 }
6326 /* Most of the rest of the hot processing is done later with
6327 lookup_attribute. */
6328 }
6329 else
6330 {
6333 }
6336 }
6338 /* Handle a "cold" and attribute; arguments as in
6339 struct attribute_spec.handler. */
6341 static tree
6344 {
6347 {
6349 {
6353 }
6354 /* Most of the rest of the cold processing is done later with
6355 lookup_attribute. */
6356 }
6357 else
6358 {
6361 }
6364 }
6366 /* Handle a "noinline" attribute; arguments as in
6367 struct attribute_spec.handler. */
6369 static tree
6373 {
6376 else
6377 {
6380 }
6383 }
6385 /* Handle a "noclone" attribute; arguments as in
6386 struct attribute_spec.handler. */
6388 static tree
6392 {
6394 {
6397 }
6400 }
6402 /* Handle a "always_inline" attribute; arguments as in
6403 struct attribute_spec.handler. */
6405 static tree
6410 {
6412 {
6413 /* Set the attribute and mark it for disregarding inline
6414 limits. */
6416 }
6417 else
6418 {
6421 }
6424 }
6426 /* Handle a "gnu_inline" attribute; arguments as in
6427 struct attribute_spec.handler. */
6429 static tree
6434 {
6436 {
6437 /* Do nothing else, just set the attribute. We'll get at
6438 it later with lookup_attribute. */
6439 }
6440 else
6441 {
6444 }
6447 }
6449 /* Handle a "leaf" attribute; arguments as in
6450 struct attribute_spec.handler. */
6452 static tree
6456 {
6458 {
6461 }
6463 {
6466 }
6469 }
6471 /* Handle an "artificial" attribute; arguments as in
6472 struct attribute_spec.handler. */
6474 static tree
6479 {
6481 {
6482 /* Do nothing else, just set the attribute. We'll get at
6483 it later with lookup_attribute. */
6484 }
6485 else
6486 {
6489 }
6492 }
6494 /* Handle a "flatten" attribute; arguments as in
6495 struct attribute_spec.handler. */
6497 static tree
6499 tree args ATTRIBUTE_UNUSED,
6501 {
6503 /* Do nothing else, just set the attribute. We'll get at
6504 it later with lookup_attribute. */
6505 ;
6506 else
6507 {
6510 }
6513 }
6515 /* Handle a "warning" or "error" attribute; arguments as in
6516 struct attribute_spec.handler. */
6518 static tree
6521 {
6524 /* Do nothing else, just set the attribute. We'll get at
6525 it later with lookup_attribute. */
6526 ;
6527 else
6528 {
6531 }
6534 }
6536 /* Handle a "used" attribute; arguments as in
6537 struct attribute_spec.handler. */
6539 static tree
6542 {
6548 {
6553 }
6554 else
6555 {
6558 }
6561 }
6563 /* Handle a "unused" attribute; arguments as in
6564 struct attribute_spec.handler. */
6566 static tree
6569 {
6571 {
6579 {
6584 }
6585 else
6586 {
6589 }
6590 }
6591 else
6592 {
6596 }
6599 }
6601 /* Handle a "externally_visible" attribute; arguments as in
6602 struct attribute_spec.handler. */
6604 static tree
6609 {
6613 {
6616 {
6620 }
6621 }
6622 else
6623 {
6626 }
6629 }
6631 /* Handle a "const" attribute; arguments as in
6632 struct attribute_spec.handler. */
6634 static tree
6637 {
6640 /* See FIXME comment on noreturn in c_common_attribute_table. */
6646 = build_pointer_type
6649 else
6650 {
6653 }
6656 }
6658 /* Handle a "transparent_union" attribute; arguments as in
6659 struct attribute_spec.handler. */
6661 static tree
6665 {
6666 tree type;
6677 {
6678 /* Make sure that the first field will work for a transparent union.
6679 If the type isn't complete yet, leave the check to the code in
6680 finish_struct. */
6682 {
6688 }
6691 {
6692 /* If the type isn't complete yet, setting the flag
6693 on a variant wouldn't ever be checked. */
6697 /* build_duplicate_type doesn't work for C++. */
6701 /* A type variant isn't good enough, since we don't a cast
6702 to such a type removed as a no-op. */
6704 }
6708 }
6710 ignored:
6713 }
6715 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6716 get the requested priority for a constructor or destructor,
6717 possibly issuing diagnostics for invalid or reserved
6718 priorities. */
6720 static priority_type
6722 {
6723 HOST_WIDE_INT pri;
6724 tree arg;
6730 {
6733 else
6736 }
6749 {
6752 "destructor priorities from 0 to %d are reserved "
6754 MAX_RESERVED_INIT_PRIORITY);
6755 else
6757 "constructor priorities from 0 to %d are reserved "
6759 MAX_RESERVED_INIT_PRIORITY);
6760 }
6763 invalid:
6766 MAX_INIT_PRIORITY);
6767 else
6769 MAX_INIT_PRIORITY);
6771 }
6773 /* Handle a "constructor" attribute; arguments as in
6774 struct attribute_spec.handler. */
6776 static tree
6780 {
6787 {
6788 priority_type priority;
6793 }
6794 else
6795 {
6798 }
6801 }
6803 /* Handle a "destructor" attribute; arguments as in
6804 struct attribute_spec.handler. */
6806 static tree
6810 {
6817 {
6818 priority_type priority;
6823 }
6824 else
6825 {
6828 }
6831 }
6833 /* Nonzero if the mode is a valid vector mode for this architecture.
6834 This returns nonzero even if there is no hardware support for the
6835 vector mode, but we can emulate with narrower modes. */
6837 static int
6839 {
6843 /* Doh! What's going on? */
6852 /* Hardware support. Woo hoo! */
6858 /* We should probably return 1 if requesting V4DI and we have no DI,
6859 but we have V2DI, but this is probably very unlikely. */
6861 /* If we have support for the inner mode, we can safely emulate it.
6862 We may not have V2DI, but me can emulate with a pair of DIs. */
6864 }
6867 /* Handle a "mode" attribute; arguments as in
6868 struct attribute_spec.handler. */
6870 static tree
6873 {
6881 else
6882 {
6887 tree typefm;
6892 {
6898 }
6900 /* Change this type to have a type with the specified mode.
6901 First check for the special modes. */
6914 else
6917 {
6920 }
6923 {
6926 }
6930 {
6962 }
6964 {
6967 }
6970 {
6975 {
6978 }
6982 else
6985 }
6986 else
6987 {
6988 /* For fixed-point modes, we need to test if the signness of type
6989 and the machine mode are consistent. */
6992 {
6995 }
6996 /* For fixed-point modes, we need to pass saturating info. */
7000 }
7003 {
7006 }
7008 {
7009 /* For enumeral types, copy the precision from the integer
7010 type returned above. If not an INTEGER_TYPE, we can't use
7011 this mode for this type. */
7013 {
7016 }
7019 {
7022 }
7023 else
7024 {
7025 /* We cannot build a type variant, as there's code that assumes
7026 that TYPE_MAIN_VARIANT has the same mode. This includes the
7027 debug generators. Instead, create a subrange type. This
7028 results in all of the enumeral values being emitted only once
7029 in the original, and the subtype gets them by reference. */
7032 else
7035 }
7036 }
7040 {
7043 }
7046 }
7049 }
7051 /* Handle a "section" attribute; arguments as in
7052 struct attribute_spec.handler. */
7054 static tree
7057 {
7061 {
7067 {
7071 {
7073 "section attribute cannot be specified for "
7076 }
7078 /* The decl may have already been given a section attribute
7079 from a previous declaration. Ensure they match. */
7083 {
7087 }
7091 {
7094 }
7095 else
7097 }
7098 else
7099 {
7102 }
7103 }
7104 else
7105 {
7109 }
7112 }
7114 /* Check whether ALIGN is a valid user-specified alignment. If so,
7115 return its base-2 log; if not, output an error and return -1. If
7116 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7117 no error. */
7118 int
7120 {
7125 {
7128 }
7132 {
7135 }
7137 {
7140 }
7142 }
7144 /*
7145 If in c++-11, check if the c++-11 alignment constraint with respect
7146 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7147 c++-11 mode, does nothing.
7149 [dcl.align]2/ says:
7151 [* if the constant expression evaluates to a fundamental alignment,
7152 the alignment requirement of the declared entity shall be the
7153 specified fundamental alignment.
7155 * if the constant expression evaluates to an extended alignment
7156 and the implementation supports that alignment in the context
7157 of the declaration, the alignment of the declared entity shall
7158 be that alignment
7160 * if the constant expression evaluates to an extended alignment
7161 and the implementation does not support that alignment in the
7162 context of the declaration, the program is ill-formed]. */
7164 static bool
7168 {
7181 {
7183 {
7184 /* For file scope variables and static members, the target
7185 supports alignments that are at most
7186 MAX_OFILE_ALIGNMENT. */
7189 }
7190 else
7191 {
7192 #ifdef BIGGEST_FIELD_ALIGNMENT
7193 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7194 #else
7195 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7196 #endif
7197 /* For non-static members, the target supports either
7198 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7199 if it is defined or BIGGEST_ALIGNMENT. */
7204 #undef MAX_TARGET_FIELD_ALIGNMENT
7205 /* For stack variables, the target supports at most
7206 MAX_STACK_ALIGNMENT. */
7210 }
7211 }
7213 {
7214 /* Let's be liberal for types. */
7217 }
7225 }
7227 /* Handle a "aligned" attribute; arguments as in
7228 struct attribute_spec.handler. */
7230 static tree
7233 {
7242 {
7246 }
7254 {
7257 /* If we have a TYPE_DECL, then copy the type, so that we
7258 don't accidentally modify a builtin type. See pushdecl. */
7261 {
7268 }
7269 else
7274 }
7277 {
7280 }
7283 /* C++-11 [dcl.align/4]:
7285 When multiple alignment-specifiers are specified for an
7286 entity, the alignment requirement shall be set to the
7287 strictest specified alignment.
7289 This formally comes from the c++11 specification but we are
7290 doing it for the GNU attribute syntax as well. */
7294 {
7299 else
7303 }
7304 else
7305 {
7308 }
7311 }
7313 /* Handle a "weak" attribute; arguments as in
7314 struct attribute_spec.handler. */
7316 static tree
7321 {
7324 {
7327 }
7329 {
7333 }
7337 else
7341 }
7343 /* Handle an "alias" or "ifunc" attribute; arguments as in
7344 struct attribute_spec.handler, except that IS_ALIAS tells us
7345 whether this is an alias as opposed to ifunc attribute. */
7347 static tree
7350 {
7355 {
7358 }
7362 /* A static variable declaration is always a tentative definition,
7363 but the alias is a non-tentative definition which overrides. */
7366 {
7370 }
7374 {
7378 }
7380 /* Note that the very first time we process a nested declaration,
7381 decl_function_context will not be set. Indeed, *would* never
7382 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7383 we do below. After such frobbery, pushdecl would set the context.
7384 In any case, this is never what we want. */
7386 {
7387 tree id;
7391 {
7395 }
7397 /* This counts as a use of the object pointed to. */
7402 else
7403 {
7406 else
7409 }
7412 /* ifuncs are also aliases, so set that attribute too. */
7415 }
7416 else
7417 {
7420 }
7423 }
7425 /* Handle an "alias" or "ifunc" attribute; arguments as in
7426 struct attribute_spec.handler. */
7428 static tree
7431 {
7433 }
7435 /* Handle an "alias" or "ifunc" attribute; arguments as in
7436 struct attribute_spec.handler. */
7438 static tree
7441 {
7443 }
7445 /* Handle a "weakref" attribute; arguments as in struct
7446 attribute_spec.handler. */
7448 static tree
7451 {
7454 /* We must ignore the attribute when it is associated with
7455 local-scoped decls, since attribute alias is ignored and many
7456 such symbols do not even have a DECL_WEAK field. */
7458 || current_function_decl
7460 {
7464 }
7467 {
7471 }
7473 /* The idea here is that `weakref("name")' mutates into `weakref,
7474 alias("name")', and weakref without arguments, in turn,
7475 implicitly adds weak. */
7478 {
7485 }
7486 else
7487 {
7492 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7493 and that isn't supported; and because it wants to add it to
7494 the list of weak decls, which isn't helpful. */
7496 }
7499 }
7501 /* Handle an "visibility" attribute; arguments as in
7502 struct attribute_spec.handler. */
7504 static tree
7508 {
7514 {
7518 {
7520 name);
7522 }
7524 {
7528 }
7529 }
7531 {
7534 }
7537 {
7540 }
7542 /* If this is a type, set the visibility on the type decl. */
7544 {
7549 {
7551 name);
7553 }
7554 }
7564 else
7565 {
7566 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7568 }
7572 {
7586 }
7591 /* Go ahead and attach the attribute to the node as well. This is needed
7592 so we can determine whether we have VISIBILITY_DEFAULT because the
7593 visibility was not specified, or because it was explicitly overridden
7594 from the containing scope. */
7597 }
7599 /* Determine the ELF symbol visibility for DECL, which is either a
7600 variable or a function. It is an error to use this function if a
7601 definition of DECL is not available in this translation unit.
7602 Returns true if the final visibility has been determined by this
7603 function; false if the caller is free to make additional
7604 modifications. */
7606 bool
7608 {
7612 /* If the user explicitly specified the visibility with an
7613 attribute, honor that. DECL_VISIBILITY will have been set during
7614 the processing of the attribute. We check for an explicit
7615 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7616 to distinguish the use of an attribute from the use of a "#pragma
7617 GCC visibility push(...)"; in the latter case we still want other
7618 considerations to be able to overrule the #pragma. */
7620 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7625 /* Set default visibility to whatever the user supplied with
7626 visibility_specified depending on #pragma GCC visibility. */
7628 {
7631 {
7634 /* If visibility changed and DECL already has DECL_RTL, ensure
7635 symbol flags are updated. */
7640 }
7641 }
7643 }
7645 /* Handle an "tls_model" attribute; arguments as in
7646 struct attribute_spec.handler. */
7648 static tree
7651 {
7652 tree id;
7659 {
7662 }
7667 {
7670 }
7680 else
7681 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7685 }
7687 /* Handle a "no_instrument_function" attribute; arguments as in
7688 struct attribute_spec.handler. */
7690 static tree
7695 {
7699 {
7703 }
7705 {
7709 }
7710 else
7714 }
7716 /* Handle a "malloc" attribute; arguments as in
7717 struct attribute_spec.handler. */
7719 static tree
7722 {
7726 else
7727 {
7730 }
7733 }
7735 /* Handle a "alloc_size" attribute; arguments as in
7736 struct attribute_spec.handler. */
7738 static tree
7741 {
7744 {
7751 {
7756 }
7757 }
7759 }
7761 /* Handle a "fn spec" attribute; arguments as in
7762 struct attribute_spec.handler. */
7764 static tree
7768 {
7773 }
7775 /* Handle a "returns_twice" attribute; arguments as in
7776 struct attribute_spec.handler. */
7778 static tree
7781 {
7784 else
7785 {
7788 }
7791 }
7793 /* Handle a "no_limit_stack" attribute; arguments as in
7794 struct attribute_spec.handler. */
7796 static tree
7801 {
7805 {
7809 }
7811 {
7815 }
7816 else
7820 }
7822 /* Handle a "pure" attribute; arguments as in
7823 struct attribute_spec.handler. */
7825 static tree
7828 {
7831 /* ??? TODO: Support types. */
7832 else
7833 {
7836 }
7839 }
7841 /* Digest an attribute list destined for a transactional memory statement.
7842 ALLOWED is the set of attributes that are allowed for this statement;
7843 return the attribute we parsed. Multiple attributes are never allowed. */
7845 int
7847 {
7852 {
7860 {
7863 }
7866 {
7869 }
7872 else
7874 }
7877 }
7879 /* Transform a TM attribute name into a maskable integer and back.
7880 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
7881 to how the lack of an attribute is treated. */
7883 int
7885 {
7899 }
7901 tree
7903 {
7906 {
7924 }
7926 }
7928 /* Return the first TM attribute seen in LIST. */
7930 tree
7932 {
7934 {
7938 }
7940 }
7942 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
7943 Here we accept only function types, and verify that none of the other
7944 function TM attributes are also applied. */
7945 /* ??? We need to accept class types for C++, but not C. This greatly
7946 complicates this function, since we can no longer rely on the extra
7947 processing given by function_type_required. */
7949 static tree
7952 {
7953 /* Only one path adds the attribute; others don't. */
7957 {
7960 /* Only tm_callable and tm_safe apply to classes. */
7963 /* FALLTHRU */
7967 {
7970 ;
7973 else
7975 }
7979 {
7982 {
7987 }
7988 }
7989 /* FALLTHRU */
7992 /* If a function is next, pass it on to be tried next. */
7996 ignored:
7999 }
8002 }
8004 /* Handle the TM_WRAP attribute; arguments as in
8005 struct attribute_spec.handler. */
8007 static tree
8010 {
8013 /* We don't need the attribute even on success, since we
8014 record the entry in an external table. */
8019 else
8020 {
8026 else
8027 {
8031 {
8035 else
8037 }
8038 else
8040 }
8041 }
8044 }
8046 /* Ignore the given attribute. Used when this attribute may be usefully
8047 overridden by the target, but is not used generically. */
8049 static tree
8053 {
8056 }
8058 /* Handle a "no vops" attribute; arguments as in
8059 struct attribute_spec.handler. */
8061 static tree
8065 {
8069 }
8071 /* Handle a "deprecated" attribute; arguments as in
8072 struct attribute_spec.handler. */
8074 static tree
8078 {
8086 {
8089 }
8092 {
8103 else
8105 }
8107 {
8112 }
8113 else
8117 {
8120 {
8126 }
8129 else
8131 }
8134 }
8136 /* Handle a "vector_size" attribute; arguments as in
8137 struct attribute_spec.handler. */
8139 static tree
8143 {
8153 {
8156 }
8158 /* Get the vector size (in bytes). */
8161 /* We need to provide for vector pointers, vector arrays, and
8162 functions returning vectors. For example:
8164 __attribute__((vector_size(16))) short *foo;
8166 In this case, the mode is SI, but the type being modified is
8167 HI, so we need to look further. */
8176 /* Get the mode of the type being modified. */
8187 {
8190 }
8193 {
8196 }
8199 {
8202 }
8204 /* Calculate how many units fit in the vector. */
8207 {
8210 }
8214 /* Build back pointers if needed. */
8218 }
8220 /* Handle the "nonnull" attribute. */
8221 static tree
8225 {
8229 /* If no arguments are specified, all pointer arguments should be
8230 non-null. Verify a full prototype is given so that the arguments
8231 will have the correct types when we actually check them later. */
8233 {
8235 {
8238 }
8240 }
8242 /* Argument list specified. Verify that each argument number references
8243 a pointer argument. */
8245 {
8249 {
8254 }
8257 {
8258 function_args_iterator iter;
8259 tree argument;
8263 {
8267 }
8271 {
8276 }
8279 {
8284 }
8285 }
8286 }
8289 }
8291 /* Check the argument list of a function call for null in argument slots
8292 that are marked as requiring a non-null pointer argument. The NARGS
8293 arguments are passed in the array ARGARRAY.
8294 */
8296 static void
8298 {
8299 tree a;
8307 /* See if any of the nonnull attributes has no arguments. If so,
8308 then every pointer argument is checked (in which case the check
8309 for pointer type is done in check_nonnull_arg). */
8311 do
8319 else
8320 {
8321 /* Walk the argument list. If we encounter an argument number we
8322 should check for non-null, do it. */
8324 {
8326 {
8330 }
8335 }
8336 }
8337 }
8339 /* Check that the Nth argument of a function call (counting backwards
8340 from the end) is a (pointer)0. The NARGS arguments are passed in the
8341 array ARGARRAY. */
8343 static void
8345 {
8349 {
8352 tree sentinel;
8353 function_args_iterator iter;
8354 tree t;
8356 /* Skip over the named arguments. */
8358 {
8361 len++;
8362 }
8365 {
8368 }
8370 /* The sentinel must be one of the varargs, i.e.
8371 in position >= the number of fixed arguments. */
8373 {
8377 }
8379 /* Validate the sentinel. */
8383 /* Although __null (in C++) is only an integer we allow it
8384 nevertheless, as we are guaranteed that it's exactly
8385 as wide as a pointer, and we don't want to force
8386 users to cast the NULL they have written there.
8387 We warn with -Wstrict-null-sentinel, though. */
8390 }
8391 }
8393 /* Helper for check_function_nonnull; given a list of operands which
8394 must be non-null in ARGS, determine if operand PARAM_NUM should be
8395 checked. */
8397 static bool
8399 {
8403 {
8410 }
8412 }
8414 /* Check that the function argument PARAM (which is operand number
8415 PARAM_NUM) is non-null. This is called by check_function_nonnull
8416 via check_function_arguments_recurse. */
8418 static void
8421 {
8422 /* Just skip checking the argument if it's not a pointer. This can
8423 happen if the "nonnull" attribute was given without an operand
8424 list (which means to check every pointer argument). */
8432 }
8434 /* Helper for nonnull attribute handling; fetch the operand number
8435 from the attribute argument list. */
8437 static bool
8439 {
8440 /* Verify the arg number is a constant. */
8447 }
8449 /* Handle a "nothrow" attribute; arguments as in
8450 struct attribute_spec.handler. */
8452 static tree
8455 {
8458 /* ??? TODO: Support types. */
8459 else
8460 {
8463 }
8466 }
8468 /* Handle a "cleanup" attribute; arguments as in
8469 struct attribute_spec.handler. */
8471 static tree
8474 {
8478 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8479 for global destructors in C++. This requires infrastructure that
8480 we don't have generically at the moment. It's also not a feature
8481 we'd be missing too much, since we do have attribute constructor. */
8483 {
8487 }
8489 /* Verify that the argument is a function in scope. */
8490 /* ??? We could support pointers to functions here as well, if
8491 that was considered desirable. */
8494 {
8498 }
8501 {
8505 }
8507 /* That the function has proper type is checked with the
8508 eventual call to build_function_call. */
8511 }
8513 /* Handle a "warn_unused_result" attribute. No special handling. */
8515 static tree
8519 {
8520 /* Ignore the attribute for functions not returning any value. */
8522 {
8525 }
8528 }
8530 /* Handle a "sentinel" attribute. */
8532 static tree
8535 {
8537 {
8541 }
8542 else
8543 {
8545 {
8549 }
8550 }
8553 {
8557 {
8561 }
8562 else
8563 {
8565 {
8569 }
8570 }
8571 }
8574 }
8576 /* Handle a "type_generic" attribute. */
8578 static tree
8582 {
8583 /* Ensure we have a function type. */
8586 /* Ensure we have a variadic function. */
8590 }
8592 /* Handle a "target" attribute. */
8594 static tree
8597 {
8598 /* Ensure we have a function type. */
8600 {
8603 }
8605 flags))
8609 }
8611 /* Arguments being collected for optimization. */
8618 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8619 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8620 false for #pragma GCC optimize. */
8622 bool
8624 {
8632 tree ap;
8634 /* Build up argv vector. Just in case the string is stored away, use garbage
8635 collected strings. */
8640 {
8644 {
8648 }
8651 {
8652 /* Split string into multiple substrings. */
8660 {
8667 {
8671 }
8672 else
8673 {
8676 }
8680 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8681 options. */
8683 {
8688 else
8692 }
8695 {
8698 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8699 itself is -Os, and any other switch begins with a -f. */
8705 }
8710 }
8712 }
8713 }
8723 /* Now parse the options. */
8733 /* Don't allow changing -fstrict-aliasing. */
8738 }
8740 /* For handling "optimize" attribute. arguments as in
8741 struct attribute_spec.handler. */
8743 static tree
8746 {
8747 /* Ensure we have a function type. */
8749 {
8752 }
8753 else
8754 {
8758 /* Save current options. */
8761 /* If we previously had some optimization options, use them as the
8762 default. */
8767 /* Parse options, and update the vector. */
8772 /* Restore current options. */
8774 }
8777 }
8779 /* Handle a "no_split_stack" attribute. */
8781 static tree
8786 {
8790 {
8794 }
8796 {
8800 }
8803 }
8804 \f
8805 /* Check for valid arguments being passed to a function with FNTYPE.
8806 There are NARGS arguments in the array ARGARRAY. */
8807 void
8809 {
8810 /* Check for null being passed in a pointer argument that must be
8811 non-null. We also need to do this if format checking is enabled. */
8816 /* Check for errors in format strings. */
8823 }
8825 /* Generic argument checking recursion routine. PARAM is the argument to
8826 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8827 once the argument is resolved. CTX is context for the callback. */
8828 void
8833 {
8837 {
8838 /* Strip coercion. */
8842 }
8845 {
8847 tree attrs;
8850 /* See if this is a call to a known internationalization function
8851 that modifies a format arg. Such a function may have multiple
8852 format_arg attributes (for example, ngettext). */
8855 attrs;
8858 {
8859 tree inner_arg;
8860 tree format_num_expr;
8863 call_expr_arg_iterator iter;
8865 /* Extract the argument number, which was previously checked
8866 to be valid. */
8878 {
8883 }
8884 }
8886 /* If we found a format_arg attribute and did a recursive check,
8887 we are done with checking this argument. Otherwise, we continue
8888 and this will be considered a non-literal. */
8891 }
8894 {
8895 /* Check both halves of the conditional expression. */
8901 }
8904 }
8906 /* Checks for a builtin function FNDECL that the number of arguments
8907 NARGS against the required number REQUIRED and issues an error if
8908 there is a mismatch. Returns true if the number of arguments is
8909 correct, otherwise false. */
8911 static bool
8913 {
8915 {
8919 }
8921 {
8925 }
8927 }
8929 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8930 Returns false if there was an error, otherwise true. */
8932 bool
8934 {
8940 {
8950 {
8952 {
8956 }
8958 }
8968 {
8975 {
8979 }
8981 }
8986 {
8991 {
8995 }
8998 {
9000 fndecl);
9002 }
9004 }
9009 {
9011 {
9014 }
9016 }
9021 }
9022 }
9024 /* Function to help qsort sort FIELD_DECLs by name order. */
9026 int
9028 {
9033 /* A nontype is "greater" than a type. */
9042 }
9045 gt_pointer_operator new_value;
9049 /* This routine compares two fields like field_decl_cmp but using the
9050 pointer operator in resort_data. */
9052 static int
9054 {
9059 /* A nontype is "greater" than a type. */
9065 {
9072 }
9074 }
9076 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9078 void
9081 gt_pointer_operator new_value,
9083 {
9088 resort_field_decl_cmp);
9089 }
9091 /* Subroutine of c_parse_error.
9092 Return the result of concatenating LHS and RHS. RHS is really
9093 a string literal, its first character is indicated by RHS_START and
9094 RHS_SIZE is its length (including the terminating NUL character).
9096 The caller is responsible for deleting the returned pointer. */
9100 {
9106 }
9108 /* Issue the error given by GMSGID, indicating that it occurred before
9109 TOKEN, which had the associated VALUE. */
9111 void
9114 {
9115 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9125 {
9130 {
9143 }
9147 else
9153 }
9163 {
9168 }
9176 {
9181 }
9182 else
9186 {
9189 }
9190 #undef catenate_messages
9191 }
9193 /* Mapping for cpp message reasons to the options that enable them. */
9195 struct reason_option_codes_t
9196 {
9199 };
9219 };
9221 /* Return the gcc option code associated with the reason for a cpp
9222 message, or 0 if none. */
9224 static int
9226 {
9230 {
9233 }
9235 }
9237 /* Callback from cpp_error for PFILE to print diagnostics from the
9238 preprocessor. The diagnostic is of type LEVEL, with REASON set
9239 to the reason code if LEVEL is represents a warning, at location
9240 LOCATION unless this is after lexing and the compiler's location
9241 should be used instead, with column number possibly overridden by
9242 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9243 the arguments. Returns true if a diagnostic was emitted, false
9244 otherwise. */
9246 bool
9250 {
9251 diagnostic_info diagnostic;
9252 diagnostic_t dlevel;
9257 {
9262 /* Fall through. */
9287 }
9300 }
9302 /* Convert a character from the host to the target execution character
9303 set. cpplib handles this, mostly. */
9305 HOST_WIDE_INT
9307 {
9308 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9309 zero-extended under -fno-signed-char. cpplib insists that characters
9310 and character constants are always unsigned. Hence we must convert
9311 back and forth. */
9319 else
9321 }
9323 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9324 references with an INDIRECT_REF of a constant at the bottom; much like the
9325 traditional rendering of offsetof as a macro. Return the folded result. */
9327 tree
9329 {
9333 {
9349 {
9352 }
9362 {
9366 }
9380 /* Check if the offset goes beyond the upper bound of the array. */
9382 {
9388 {
9392 {
9393 tree v;
9400 {
9408 }
9409 /* Don't warn if the array might be considered a poor
9410 man's flexible array member with a very permissive
9411 definition thereof. */
9415 "index %E denotes an offset "
9418 }
9419 }
9420 }
9427 /* Handle static members of volatile structs. */
9434 }
9437 }
9439 /* Likewise, but convert it to the return type of offsetof. */
9441 tree
9443 {
9445 }
9447 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9448 expression, because B will always be true. */
9450 void
9452 {
9455 "the omitted middle operand in ?: will always be %<true%>, "
9457 }
9459 /* Give an error for storing into ARG, which is 'const'. USE indicates
9460 how ARG was being used. */
9462 void
9464 {
9467 /* Using this macro rather than (for example) arrays of messages
9468 ensures that all the format strings are checked at compile
9469 time. */
9470 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9471 : (use == lv_increment ? (I) \
9472 : (use == lv_decrement ? (D) : (AS))))
9474 {
9485 else
9491 }
9497 arg);
9503 arg);
9505 {
9515 arg);
9516 }
9522 arg);
9523 else
9528 arg);
9529 }
9531 /* Print an error message for an invalid lvalue. USE says
9532 how the lvalue is being used and so selects the error message. LOC
9533 is the location for the error. */
9535 void
9537 {
9539 {
9557 }
9558 }
9560 /* Print an error message for an invalid indirection of type TYPE.
9561 ERRSTRING is the name of the operator for the indirection. */
9563 void
9565 {
9567 {
9575 type);
9580 type);
9585 type);
9590 type);
9594 }
9595 }
9596 \f
9597 /* *PTYPE is an incomplete array. Complete it with a domain based on
9598 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9599 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9600 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9602 int
9604 {
9611 {
9613 {
9614 int eltsize
9617 }
9619 {
9623 {
9627 }
9628 else
9629 {
9630 tree curindex;
9643 cnt++)
9644 {
9648 else
9649 {
9653 size_one_node);
9654 }
9657 }
9660 }
9661 }
9662 else
9663 {
9664 /* Make an error message unless that happened already. */
9667 }
9668 }
9669 else
9670 {
9674 }
9681 else
9684 /* Using build_distinct_type_copy and modifying things afterward instead
9685 of using build_array_type to create a new type preserves all of the
9686 TYPE_LANG_FLAG_? bits that the front end may have set. */
9694 /* Make sure we have the canonical MAIN_TYPE. */
9697 hashcode);
9700 /* Fix the canonical type. */
9710 else
9715 else
9721 {
9723 /* If we proceed with the array type as it is, we'll eventually
9724 crash in tree_low_cst(). */
9726 }
9730 }
9732 /* Like c_mark_addressable but don't check register qualifier. */
9733 void
9735 {
9741 }
9744 \f
9745 /* Used to help initialize the builtin-types.def table. When a type of
9746 the correct size doesn't exist, use error_mark_node instead of NULL.
9747 The later results in segfaults even when a decl using the type doesn't
9748 get invoked. */
9750 tree
9752 {
9755 }
9757 /* A helper function for resolve_overloaded_builtin in resolving the
9758 overloaded __sync_ builtins. Returns a positive power of 2 if the
9759 first operand of PARAMS is a pointer to a supported data type.
9760 Returns 0 if an error is encountered. */
9762 static int
9764 {
9765 tree type;
9769 {
9772 }
9786 incompatible:
9789 }
9791 /* A helper function for resolve_overloaded_builtin. Adds casts to
9792 PARAMS to make arguments match up with those of FUNCTION. Drops
9793 the variadic arguments at the end. Returns false if some error
9794 was encountered; true on success. */
9796 static bool
9799 {
9800 function_args_iterator iter;
9801 tree ptype;
9805 /* We've declared the implementation functions to use "volatile void *"
9806 as the pointer parameter, so we shouldn't get any complaints from the
9807 call to check_function_arguments what ever type the user used. */
9811 /* For the rest of the values, we need to cast these to FTYPE, so that we
9812 don't get warnings for passing pointer types, etc. */
9815 {
9819 /* XXX void_type_node belies the abstraction. */
9825 {
9828 }
9830 /* Only convert parameters if arg_type is unsigned integer type with
9831 new format sync routines, i.e. don't attempt to convert pointer
9832 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9833 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9834 kinds). */
9836 {
9837 /* Ideally for the first conversion we'd use convert_for_assignment
9838 so that we get warnings for anything that doesn't match the pointer
9839 type. This isn't portable across the C and C++ front ends atm. */
9844 }
9847 }
9849 /* __atomic routines are not variadic. */
9851 {
9854 }
9856 /* The definition of these primitives is variadic, with the remaining
9857 being "an optional list of variables protected by the memory barrier".
9858 No clue what that's supposed to mean, precisely, but we consider all
9859 call-clobbered variables to be protected so we're safe. */
9863 }
9865 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9866 RESULT to make it match the type of the first pointer argument in
9867 PARAMS. */
9869 static tree
9871 {
9876 /* New format doesn't require casting unless the types are the same size. */
9879 else
9881 }
9883 /* This function verifies the PARAMS to generic atomic FUNCTION.
9884 It returns the size if all the parameters are the same size, otherwise
9885 0 is returned if the parameters are invalid. */
9887 static int
9889 {
9894 tree type_0;
9896 /* Determine the parameter makeup. */
9898 {
9914 }
9917 {
9920 }
9922 /* Get type of first parameter, and determine its size. */
9925 {
9927 function);
9929 }
9931 /* Types must be compile time constant sizes. */
9933 {
9936 function);
9938 }
9942 /* Zero size objects are not allowed. */
9944 {
9947 function);
9949 }
9951 /* Check each other parameter is a pointer and the same size. */
9953 {
9956 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
9960 {
9962 function);
9964 }
9967 {
9969 function);
9971 }
9972 }
9974 /* Check memory model parameters for validity. */
9976 {
9979 {
9982 {
9985 function);
9986 }
9987 }
9988 else
9990 {
9992 function);
9994 }
9995 }
9998 }
10001 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10002 at the beginning of the parameter list PARAMS representing the size of the
10003 objects. This is to match the library ABI requirement. LOC is the location
10004 of the function call.
10005 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10006 returned to allow the external call to be constructed. */
10008 static tree
10011 {
10012 tree size_node;
10014 /* Insert a SIZE_T parameter as the first param. If there isn't
10015 enough space, allocate a new vector and recursively re-build with that. */
10017 {
10020 tree f;
10029 }
10031 /* Add the size parameter and leave as a function call for processing. */
10035 }
10038 /* This will process an __atomic_exchange function call, determine whether it
10039 needs to be mapped to the _N variation, or turned into a library call.
10040 LOC is the location of the builtin call.
10041 FUNCTION is the DECL that has been invoked;
10042 PARAMS is the argument list for the call. The return value is non-null
10043 TRUE is returned if it is translated into the proper format for a call to the
10044 external library, and NEW_RETURN is set the tree for that function.
10045 FALSE is returned if processing for the _N variation is required, and
10046 NEW_RETURN is set to the the return value the result is copied into. */
10047 static bool
10050 {
10055 /* Size of 0 is an error condition. */
10057 {
10060 }
10062 /* If not a lock-free size, change to the library generic format. */
10064 {
10067 }
10069 /* Otherwise there is a lockfree match, transform the call from:
10070 void fn(T* mem, T* desired, T* return, model)
10071 into
10072 *return = (T) (fn (In* mem, (In) *desired, model)) */
10079 /* Create pointer to appropriate size. */
10083 /* Convert object pointer to required type. */
10086 /* Convert new value to required type, and dereference it. */
10091 /* Move memory model to the 3rd position, and end param list. */
10095 /* Convert return pointer and dereference it for later assignment. */
10099 }
10102 /* This will process an __atomic_compare_exchange function call, determine
10103 whether it needs to be mapped to the _N variation, or turned into a lib call.
10104 LOC is the location of the builtin call.
10105 FUNCTION is the DECL that has been invoked;
10106 PARAMS is the argument list for the call. The return value is non-null
10107 TRUE is returned if it is translated into the proper format for a call to the
10108 external library, and NEW_RETURN is set the tree for that function.
10109 FALSE is returned if processing for the _N variation is required. */
10111 static bool
10115 {
10120 /* Size of 0 is an error condition. */
10122 {
10125 }
10127 /* If not a lock-free size, change to the library generic format. */
10129 {
10130 /* The library generic format does not have the weak parameter, so
10131 remove it from the param list. Since a parameter has been removed,
10132 we can be sure that there is room for the SIZE_T parameter, meaning
10133 there will not be a recursive rebuilding of the parameter list, so
10134 there is no danger this will be done twice. */
10136 {
10140 }
10143 }
10145 /* Otherwise, there is a match, so the call needs to be transformed from:
10146 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10147 into
10148 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10154 /* Create pointer to appropriate size. */
10158 /* Convert object pointer to required type. */
10162 /* Convert expected pointer to required type. */
10166 /* Convert desired value to required type, and dereference it. */
10171 /* The rest of the parameters are fine. NULL means no special return value
10172 processing.*/
10175 }
10178 /* This will process an __atomic_load function call, determine whether it
10179 needs to be mapped to the _N variation, or turned into a library call.
10180 LOC is the location of the builtin call.
10181 FUNCTION is the DECL that has been invoked;
10182 PARAMS is the argument list for the call. The return value is non-null
10183 TRUE is returned if it is translated into the proper format for a call to the
10184 external library, and NEW_RETURN is set the tree for that function.
10185 FALSE is returned if processing for the _N variation is required, and
10186 NEW_RETURN is set to the the return value the result is copied into. */
10188 static bool
10191 {
10196 /* Size of 0 is an error condition. */
10198 {
10201 }
10203 /* If not a lock-free size, change to the library generic format. */
10205 {
10208 }
10210 /* Otherwise, there is a match, so the call needs to be transformed from:
10211 void fn(T* mem, T* return, model)
10212 into
10213 *return = (T) (fn ((In *) mem, model)) */
10219 /* Create pointer to appropriate size. */
10223 /* Convert object pointer to required type. */
10227 /* Move memory model to the 2nd position, and end param list. */
10231 /* Convert return pointer and dereference it for later assignment. */
10235 }
10238 /* This will process an __atomic_store function call, determine whether it
10239 needs to be mapped to the _N variation, or turned into a library call.
10240 LOC is the location of the builtin call.
10241 FUNCTION is the DECL that has been invoked;
10242 PARAMS is the argument list for the call. The return value is non-null
10243 TRUE is returned if it is translated into the proper format for a call to the
10244 external library, and NEW_RETURN is set the tree for that function.
10245 FALSE is returned if processing for the _N variation is required, and
10246 NEW_RETURN is set to the the return value the result is copied into. */
10248 static bool
10251 {
10256 /* Size of 0 is an error condition. */
10258 {
10261 }
10263 /* If not a lock-free size, change to the library generic format. */
10265 {
10268 }
10270 /* Otherwise, there is a match, so the call needs to be transformed from:
10271 void fn(T* mem, T* value, model)
10272 into
10273 fn ((In *) mem, (In) *value, model) */
10278 /* Create pointer to appropriate size. */
10282 /* Convert object pointer to required type. */
10286 /* Convert new value to required type, and dereference it. */
10291 /* The memory model is in the right spot already. Return is void. */
10295 }
10298 /* Some builtin functions are placeholders for other expressions. This
10299 function should be called immediately after parsing the call expression
10300 before surrounding code has committed to the type of the expression.
10302 LOC is the location of the builtin call.
10304 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10305 PARAMS is the argument list for the call. The return value is non-null
10306 when expansion is complete, and null if normal processing should
10307 continue. */
10309 tree
10311 {
10317 {
10323 else
10327 }
10329 /* Handle BUILT_IN_NORMAL here. */
10331 {
10336 {
10337 /* Handle these 4 together so that they can fall through to the next
10338 case if the call is transformed to an _N variant. */
10340 {
10342 {
10346 /* Change to the _N variant. */
10349 }
10352 {
10354 params,
10357 /* Change to the _N variant. */
10360 }
10362 {
10366 /* Change to the _N variant. */
10369 }
10371 {
10375 /* Change to the _N variant. */
10378 }
10381 }
10382 /* Fallthrough to the normal processing. */
10383 }
10400 {
10402 /* Fallthru for parameter processing. */
10403 }
10420 {
10431 orig_format))
10443 /* If new_return is set, assign function to that expr and cast the
10444 result to void since the generic interface returned void. */
10446 {
10447 /* Cast function result from I{1,2,4,8,16} to the required type. */
10450 result);
10454 }
10456 }
10460 }
10461 }
10463 /* Ignoring their sign, return true if two scalar types are the same. */
10464 bool
10466 {
10473 /* Equality works here because c_common_signed_type uses
10474 TYPE_MAIN_VARIANT. */
10477 }
10479 /* Check for missing format attributes on function pointers. LTYPE is
10480 the new type or left-hand side type. RTYPE is the old type or
10481 right-hand side type. Returns TRUE if LTYPE is missing the desired
10482 attribute. */
10484 bool
10486 {
10488 tree ra;
10494 {
10495 tree la;
10500 }
10501 else
10503 }
10505 /* Subscripting with type char is likely to lose on a machine where
10506 chars are signed. So warn on any machine, but optionally. Don't
10507 warn for unsigned char since that type is safe. Don't warn for
10508 signed char because anyone who uses that must have done so
10509 deliberately. Furthermore, we reduce the false positive load by
10510 warning only for non-constant value of type char. */
10512 void
10514 {
10518 }
10520 /* Implement -Wparentheses for the unexpected C precedence rules, to
10521 cover cases like x + y << z which readers are likely to
10522 misinterpret. We have seen an expression in which CODE is a binary
10523 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10524 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10525 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10526 expression was not formed using a binary or unary operator, or it
10527 was enclosed in parentheses. */
10529 void
10533 {
10537 /* This macro tests that the expression ARG with original tree code
10538 CODE appears to be a boolean expression. or the result of folding a
10539 boolean expression. */
10540 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10541 (truth_value_p (TREE_CODE (ARG)) \
10542 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10544 || ((CODE) != INTEGER_CST \
10545 && (integer_onep (ARG) || integer_zerop (ARG))))
10548 {
10580 /* Check cases like x|y==z */
10585 /* Check cases like !x | y */
10599 /* Check cases like x^y==z */
10613 /* Check cases like x&y==z */
10618 /* Check cases like !x & y */
10649 }
10650 #undef NOT_A_BOOLEAN_EXPR_P
10651 }
10653 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10655 void
10657 {
10659 {
10662 else
10664 }
10665 }
10667 /* Warn for division by zero according to the value of DIVISOR. LOC
10668 is the location of the division operator. */
10670 void
10672 {
10673 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10674 about division by zero. Do not issue a warning if DIVISOR has a
10675 floating-point type, since we consider 0.0/0.0 a valid way of
10676 generating a NaN. */
10680 }
10682 /* Subroutine of build_binary_op. Give warnings for comparisons
10683 between signed and unsigned quantities that may fail. Do the
10684 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10685 so that casts will be considered, but default promotions won't
10686 be.
10688 LOCATION is the location of the comparison operator.
10690 The arguments of this function map directly to local variables
10691 of build_binary_op. */
10693 void
10698 {
10703 /* In C++, check for comparison of different enum types. */
10709 {
10713 }
10715 /* Do not warn if the comparison is being done in a signed type,
10716 since the signed type will only be chosen if it can represent
10717 all the values of the unsigned type. */
10720 /* Do not warn if both operands are unsigned. */
10723 else
10724 {
10730 else
10738 /* Do not warn if the signed quantity is an unsuffixed integer
10739 literal (or some static constant expression involving such
10740 literals or a conditional expression involving such literals)
10741 and it is non-negative. */
10744 /* Do not warn if the comparison is an equality operation, the
10745 unsigned quantity is an integral constant, and it would fit
10746 in the result if the result were signed. */
10751 /* In C, do not warn if the unsigned quantity is an enumeration
10752 constant and its maximum value would fit in the result if the
10753 result were signed. */
10759 else
10761 OPT_Wsign_compare,
10763 }
10765 /* Warn if two unsigned values are being compared in a size larger
10766 than their original size, and one (and only one) is the result of
10767 a `~' operator. This comparison will always fail.
10769 Also warn if one operand is a constant, and the constant does not
10770 have all bits set that are set in the ~ operand when it is
10771 extended. */
10778 {
10785 {
10786 tree primop;
10792 {
10796 }
10797 else
10798 {
10802 }
10807 {
10810 {
10814 else
10817 }
10818 }
10819 }
10827 }
10828 }
10830 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
10831 type via c_common_type. If -Wdouble-promotion is in use, and the
10832 conditions for warning have been met, issue a warning. GMSGID is
10833 the warning message. It must have two %T specifiers for the type
10834 that was converted (generally "float") and the type to which it was
10835 converted (generally "double), respectively. LOC is the location
10836 to which the awrning should refer. */
10838 void
10841 {
10842 tree source_type;
10846 /* If the conversion will not occur at run-time, there is no need to
10847 warn about it. */
10859 else
10862 }
10864 /* Setup a TYPE_DECL node as a typedef representation.
10866 X is a TYPE_DECL for a typedef statement. Create a brand new
10867 ..._TYPE node (which will be just a variant of the existing
10868 ..._TYPE node with identical properties) and then install X
10869 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
10871 The whole point here is to end up with a situation where each
10872 and every ..._TYPE node the compiler creates will be uniquely
10873 associated with AT MOST one node representing a typedef name.
10874 This way, even though the compiler substitutes corresponding
10875 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
10876 early on, later parts of the compiler can always do the reverse
10877 translation and get back the corresponding typedef name. For
10878 example, given:
10880 typedef struct S MY_TYPE;
10881 MY_TYPE object;
10883 Later parts of the compiler might only know that `object' was of
10884 type `struct S' if it were not for code just below. With this
10885 code however, later parts of the compiler see something like:
10887 struct S' == struct S
10888 typedef struct S' MY_TYPE;
10889 struct S' object;
10891 And they can then deduce (from the node for type struct S') that
10892 the original object declaration was:
10894 MY_TYPE object;
10896 Being able to do this is important for proper support of protoize,
10897 and also for generating precise symbolic debugging information
10898 which takes full account of the programmer's (typedef) vocabulary.
10900 Obviously, we don't want to generate a duplicate ..._TYPE node if
10901 the TYPE_DECL node that we are now processing really represents a
10902 standard built-in type. */
10904 void
10906 {
10910 {
10913 }
10916 {
10924 }
10925 }
10927 /* Record the types used by the current global variable declaration
10928 being parsed, so that we can decide later to emit their debug info.
10929 Those types are in types_used_by_cur_var_decl, and we are going to
10930 store them in the types_used_by_vars_hash hash table.
10931 DECL is the declaration of the global variable that has been parsed. */
10933 void
10935 {
10939 {
10942 }
10943 }
10945 /* If DECL is a typedef that is declared in the current function,
10946 record it for the purpose of -Wunused-local-typedefs. */
10948 void
10950 {
10955 /* if this is not a locally defined typedef then we are not
10956 interested. */
10963 }
10965 /* If T is a TYPE_DECL declared locally, mark it as used. */
10967 void
10969 {
10974 }
10976 /* Warn if there are some unused locally defined typedefs in the
10977 current function. */
10979 void
10981 {
10983 tree decl;
10984 /* The number of times we have emitted -Wunused-local-typedefs
10985 warnings. If this is different from errorcount, that means some
10986 unrelated errors have been issued. In which case, we'll avoid
10987 emitting "unused-local-typedefs" warnings. */
10999 {
11003 OPT_Wunused_local_typedefs,
11006 }
11009 {
11012 }
11013 }
11015 /* The C and C++ parsers both use vectors to hold function arguments.
11016 For efficiency, we keep a cache of unused vectors. This is the
11017 cache. */
11024 /* Return a new vector from the cache. If the cache is empty,
11025 allocate a new vector. These vectors are GC'ed, so it is OK if the
11026 pointer is not released.. */
11030 {
11033 else
11034 {
11035 /* Passing 0 to VEC_alloc returns NULL, and our callers require
11036 that we always return a non-NULL value. The vector code uses
11037 4 when growing a NULL vector, so we do too. */
11039 }
11040 }
11042 /* Release a vector of trees back to the cache. */
11044 void
11046 {
11048 {
11051 }
11052 }
11054 /* Get a new tree vector holding a single tree. */
11058 {
11062 }
11064 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11068 {
11073 }
11075 /* Get a new tree vector which is a copy of an existing one. */
11079 {
11082 tree t;
11089 }
11091 /* Return true if KEYWORD starts a type specifier. */
11093 bool
11095 {
11097 {
11127 }
11128 }
11130 /* Return true if KEYWORD names a type qualifier. */
11132 bool
11134 {
11136 {
11143 }
11144 }
11146 /* Return true if KEYWORD names a storage class specifier.
11148 RID_TYPEDEF is not included in this list despite `typedef' being
11149 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11150 such for syntactic convenience only. */
11152 bool
11154 {
11156 {
11166 }
11167 }
11169 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11171 static bool
11173 {
11175 {
11183 }
11184 }
11186 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11187 declaration-specifier (C99 6.7). */
11189 bool
11191 {
11198 {
11205 }
11206 }
11208 /* Initialize language-specific-bits of tree_contains_struct. */
11210 void
11212 {
11215 }
11217 /* Build a user-defined numeric literal out of an integer constant type VALUE
11218 with identifier SUFFIX. */
11220 tree
11222 {
11228 }
11230 /* For vector[index], convert the vector to a
11231 pointer of the underlying type. */
11232 void
11235 {
11237 {
11239 tree type1;
11253 }
11254 }
11256 /* Return true iff ALIGN is an integral constant that is a fundamental
11257 alignment, as defined by [basic.align] in the c++-11
11258 specifications.
11260 That is:
11262 [A fundamental alignment is represented by an alignment less than or
11263 equal to the greatest alignment supported by the implementation
11264 in all contexts, which is equal to
11265 alignof(max_align_t)]. */
11267 bool
11269 {
11272 }